The Lindeberg central limit theorem
|
|
- Stella Flowers
- 5 years ago
- Views:
Transcription
1 The Lindeberg central limit theorem Jordan Bell Department of Mathematics, University of Toronto May 29, 205 Convergence in distribution We denote by P d the collection of Borel probability measures on d. Unless we say otherwise, we use the narrow topology on P d : the coarsest topology such that for each f C b d, the map µ fdµ d is continuous P d C. Because d is a Polish space it follows that P d is a Polish space. In fact, its topology is induced by the Prokhorov metric. 2 2 Characteristic functions For µ P d, we define its characteristic function µ : d C by µu = e iu x dµx. d Theorem. If µ P has finite kth moment, k 0, then, writing φ = µ:. φ C k. 2. φ k v = i k xk e ivx dµx. 3. φ k is uniformly continuous. 4. φ k v x k dµx. Charalambos D. Aliprantis and Kim C. Border, Infinite Dimensional Analysis: A Hitchhiker s Guide, third ed., p. 55, Theorem 5.5; jordanbell/notes/narrow.pdf 2 Onno van Gaans, Probability measures on metric spaces, nl/~vangaans/jancol.pdf; Bert Fristedt and Lawrence Gray, A Modern Approach to Probability Theory, p. 365, Theorem 25.
2 Proof. For 0 l k, define f l : C by f l v = x l e ivx dµx. For h 0, xl e ivx eihx h xl x = x l+, so by the dominated convergence theorem we have for 0 l k, That is, f l v + h f l v lim = lim h 0 h h 0 = x l e ivx lim h 0 = ix l+ e ivx dµx. f l = if l+. x l e ivx eihx dµx h e ihx h dµx And, by the dominated convergence, for ɛ > 0 there is some δ > 0 such that if w < δ then x k e iwx dµx < ɛ, hence if v u < δ then f k v f k u = x k e iux e iv ux dµx x k e iv ux dµx < ɛ, showing that f k is uniformly continuous. As well, f k v x k dµx But φ = f 0, i.e. φ 0 = f 0, so φ = f 0 = if, φ 2 = if = i 2 f 2,, φ k = i k f k. 2
3 If φ C k, Taylor s theorem tells us that for each x, φx = = = k l=0 l=0 l=0 φ l 0 x x l + l! 0 φ l 0 x x l + l! 0 φ l 0 x l + k x, l! x t k φ k tdt k! x t k φ k t φ k 0dt k! and k x satisfies k x sup 0 u φ k ux φ k 0 Define θ k : C by θ k 0 = 0 and for x 0 x k k!. with which, for all x, θ k x = k! x k kx, φx = l=0 φ l 0 x l + l! k! θ kxx k. Because k is continuous on, θ k is continuous at each x 0. Moreover, θ k x sup φ k ux φ k 0, 0 u and as φ k is continuous it follows that θ k is continuous at 0. Thus θ k is continuous on. Lemma 2. If µ P have finite kth moment, k 0, and for 0 l k, M l = x l dµx, then there is a continuous function θ : C for which The function θ satisfies µx = θx l=0 i l M l x l + l! k! θxxk. sup µ k ux µ k 0. 0 u 3
4 Proof. From Theorem, µ C k and µ l 0 = i l x l dµx = i l M l. Thus from what we worked out above with Taylor s theorem, µx = l=0 i l M l x l + l! k! θ kxx k, for which θ k x sup µ k ux µ k 0. 0 u For a and σ > 0, let pt, a, σ 2 = σ 2π exp t a2 2σ 2, t. Let γ a,σ 2 be the measure on whose density with respect to Lebesgue measure is p, a, σ 2. We call γ a,σ 2 a Gaussian measure. We calculate that the first moment of γ a,σ 2 is a and that its second moment is σ 2. We also calculate that γ a,σ 2x = exp iax 2 σ2 x 2. Lévy s continuity theorem is the following. 3 Theorem 3 Lévy s continuity theorem. Let µ n be a sequence in P d.. If µ P d and µ n µ, then for each µ n converges to µ pointwise. 2. If there is some function φ : d C to which µ n converges pointwise and φ is continuous at 0, then there is some µ P d such that φ = µ and such that µ n µ. 3 The Lindeberg condition, the Lyapunov condition, the Feller condition, and asymptotic negligibility Let Ω, F, P be a probability and let X n, n, be independent L 2 random variables. We specify when we impose other hypotheses on them; in particular, 3 p. 9, Theorem 5. 4
5 we specfify if we suppose them to be identically distributed or to belong to L p for p > 2. For a random variable X, write Write σx = VarX = E X EX 2. σ n = σx n, and, using that the X n are independent, = σ j= X j = j= σ 2 j /2 and For n and ɛ > 0, define η n = EX n. L n ɛ = s 2 n = s 2 n EX j η j 2 X j η j ɛ j= j= x η j ɛ x η j 2 dx j P x. We say that the sequence X n satisfies the Lindeberg condition if for each ɛ > 0, lim L nɛ = 0. so For example, if the sequence X n is identically distributed, then s 2 n = nσ 2, L n ɛ = nσ 2 j= = σ 2 x η ɛn /2 σ x η 2 dx P x x η ɛn /2 σ x η 2 dx P. But if µ is a Borel probability measure on and f L µ and K n is a sequence of compact sets that exhaust, then 4 \K n f dµ 0, n. Hence L n ɛ 0 a, showing that X n satisfies the Lindeberg condition. 4 V. I. Bogachev, Measure Theory, volume I, p. 25, Proposition
6 We say that the sequence X n satisfies the Lyapunov condition if there is some δ > 0 such that the X n are L 2+δ and lim s 2+δ n E X j η j 2+δ = 0. j= In this case, for ɛ > 0, then x η ɛ implies x η 2+δ x η 2 ɛ δ and hence L n ɛ s 2 n x η j x ηj ɛsn 2+δ ɛ δ dx j P x j= = ɛs 2+δ n = ɛs 2+δ n ɛs 2+δ n 0. x η j 2+δ dx j P x x η j ɛ X j η j 2+δ dp X j η j ɛ E X j η j 2+δ j= j= j= This is true for each ɛ > 0, showing that if X n satisfies the Lyapunov condition then it satisfies the Lindeberg condition. For example, if X n are identically distributed and L 2+δ, then s 2+δ n E X j η j 2+δ = j= n δ/2 σ 2+δ E X j η j 2+δ 0, showing that X n satisfies the Lyapunov condition. Another example: Suppose that the sequence X n is bounded by M almost surely and that. X n M almost surely implies that η n = EX n E X n EM = M. Therefore X n η n X n + η n 2M almost surely. Let δ > 0. Then, as s 2 n = nσ 2, s 2+δ n j= E X j η j 2+δ s 2+δ n = 2Mδ s δ n 0, N E X j η j 2 2M δ j= showing that X n satisfies the Lyapunov condition. 6
7 We say that a sequence of random variables X n satisfies the Feller condition when lim max σ j = 0, j n where σ j = σx j = VarX j and = j= We prove that if a sequence satisfies the Lindeberg condition then it satisfies the Feller condition. 5 Lemma 4. If a sequence of random variables X n satisfies the Lindeberg condition, then it satisfies the Feller condition. Proof. Let ɛ > 0 For n and k n, we calculate σk 2 = x η k 2 dx k P x = x η k 2 dx k P x + x η k 2 dx k P x x η k <ɛ x η k ɛ ɛ 2 + x η j 2 dx j P x x η j ɛ Hence j= = ɛ 2 s 2 n + s 2 nl n ɛ. σk max k n σ 2 j /2 2 ɛ 2 + L n ɛ, and so, because the X n satisfy the Lindeberg condition, lim sup max k n This is true for all ɛ > 0, which yields lim max k n σk σk. 2 ɛ 2. 2 = 0, namely, that the X n satisfy the Feller condition. We do not use the following idea of an asymptotically negligible family of random variables elsewhere, and merely take this as an excsuse to write out 5 Heinz Bauer, Probability Theory, p. 235, Lemma
8 what it means. A family of random variables X, n, j k n, is called asymptotically negligible 6 if for each ɛ > 0, lim max P X ɛ = 0. j k n A sequence of random variables X n converging in probability to 0 is equivalent to it being asymptotically negligible, with k n = for each n. For example, suppose that X are L 2 random variables each with EX = 0 and that they satisfy lim For ɛ > 0, by Chebyshev s inequality, whence max VarX = 0. j k n P X ɛ ɛ 2 E X 2 = ɛ 2 VarX, lim max P X ɛ lim sup max j k n j k n ɛ 2 VarX = 0, and so the random variables X are asymptotically negligible. Another example: Suppose that random variables X are identically distributed, with µ = X P. For ɛ > 0, X P n ɛ = P X nɛ = µa n, where A n = {x : x nɛ}. As A n, lim µa n = 0. Hence the random variables X n are asymptotic negligible. The following is a statement about the characteristic functions of an asymptotically negligible family of random variables. 7 Lemma 5. Suppose that a family X, n, j k n, of random variables is asymptotically negligible, and write µ = X P and φ = µ. For each x, lim max φ x = 0. j k n Proof. For any real t, e it t. For x, ɛ > 0, n, and j k n, φ x = e ixy dµ y e ixy dµ y + e ixy dµ y y <ɛ y <ɛ y ɛ xy dµ y + 2dµ y y ɛ ɛ x + 2P X ɛ. 6 Heinz Bauer, Probability Theory, p. 225, Heinz Bauer, Probability Theory, p. 227, Lemma
9 Hence max φ x ɛ x + 2 max P X ɛ. j k n j k n Using that the family X is asymptotically negligible, lim sup But this is true for all ɛ > 0, so proving the claim. lim sup max φ x 2ɛ x. j k n max φ x = 0, j k n 4 The Lindeberg central limit theorem We now prove the Lindeberg central limit theorem. 8 Theorem 6 Lindeberg central limit theorem. If X n is a sequence of independent L 2 random variables that satisfy the Lindeberg condition, then S n P γ, where S n = X j η j = j= n j= X j EX j σx + + X n. Proof. The sequence Y n = X n EX n are independent L 2 random variables that satisfy the Lindeberg condition and σy n = σx n. Proving the claim for the sequence Y n will prove the claim for the sequence X n, and thus it suffices to prove the claim when EX n = 0, i.e. η n = 0. For n and j n, let µ = The first moment of µ is Xj xd Xj P and the second moment of µ is x 2 d Xj P x = Ω P and τ = σ j. X j x = dp = EX j = 0, Ω Xj 8 Heinz Bauer, Probability Theory, p. 235, Theorem dp = s 2 EXj 2 = σ2 j n s 2 = τ, 2 n 9
10 for which j= τ 2 = s 2 n σj 2 =. j= For µ P with first moment xdµx = 0 and second moment x2 dµx = σ 2 <, Lemma 2 tells us that with µx = M 0 + im x M 2 2 x2 + 2 θ 2xx 2 = σ2 2 x2 + 2 θxx2, But by Lemma, so θx θx sup µ ux µ 0. 0 u µ ux = y 2 e iuxy dµy, sup 0 u sup 0 u y 2 e iuxy + dµy y 2 e iuxy dµy. For 0 { u }, e iuxy uxy xy, so for x and ɛ > 0, with ɛ δ = min ɛ, x, when y < δ and 0 u we have e iuxy < ɛ. Thus θx sup y 2 e iuxy dµy + sup y 2 e iuxy dµy 0 u ɛ y <δ ɛσ y <δ y 2 dµy + 2 y 2 dµy. y 2 dµy 0 u { } ɛ Let x and ɛ > 0, and take δ = min ɛ, x. On the one hand, for n and j n, because the first moment of µ is 0 and its second moment is τ 2, µ x = τ 2 2 x2 + 2 θ xx 2, with, from the above, θ x ɛτ y 2 dµ y. On the other hand, the first moment of the Gaussian measure γ 0,τ 2 is 0 and its second moment is τ 2. Its characteristic function is γ 0,τ 2 x = exp τ 2 2 x2 = τ 2 2 x2 + 2 ψ xx 2, 0
11 with, from the above, ψ x ɛτ In particular, for all x, y 2 dγ 0,τ 2 x. µ x γ 0,τ 2 x = x2 2 θ x ψ x. For k and for a l, b l C, l k, k k a l b l = l= l= l= b b l a l b l a l+ a k. l= If further a l, b l, then k k a l b l l= a l b l. l= Because the X n are independent, the distribution of S n = j= X j is the convolution of the distributions of the summands: whose characteristic function is µ n, µ n,n, φ n = n µ, j= since the characteristic function of a convolution of measures is the product of the characteristic functions of the measures. Using n j= τ 2 = and, for x we have φ n x e x2 2 = n n µ x e 2 τ 2 x2 j= j= µ x e 2 τ 2 x2 = j= µ x γ 0,τ 2 x j= = x2 2 θ x ψ x. j=
12 { } ɛ Therefore, for x, ɛ > 0, and δ = min ɛ, x, φ n x e x2 2 x2 ɛτ y 2 dµ y + ɛτ y 2 dγ 2 0,τ 2 y j= n n =ɛx 2 + x 2 y 2 dµ y + x 2 y 2 dγ 0,τ 2 y. We calculate j= L n δ = s 2 n = s 2 n = = = j= y 2 dx j P y j= Xj 2 dp j= X j δ 2 Xj dp j= j= j= X j δ sn y 2 d Xj y 2 dµ y. P y Hence, the fact that the X n satisfy the Lindeberg condition yields lim sup φ n x e x2 2 ɛx 2 + x 2 lim sup y 2 dγ 0,τ 2 y. 2 Write We calculate j= y 2 dγ 0,τ 2 y = j= α n = max τ σ j = max. j n j n j= y 2 exp y2 τ 2π 2τ 2 dy = τ 2 u 2 dγ 0, u j= u δ/τ τ 2 u 2 dγ 0, u j= u δ/α n = u 2 dγ 0, u. u δ/α n 2
13 Because the sequence X n satisfies the Lindeberg condition, by Lemma 4 it satisfies the Feller condition, which means that α n 0 a. Because α n 0 a, δ/α n a, hence u 2 dγ 0, u 0 u δ/α n a. Thus we get y 2 dγ 0,τ 2 y 0 j= a. Using this with 2 yields This is true for all ɛ > 0, so lim sup φ n x e x2 2 ɛx 2. lim φ nx e x 2 = 0, namely, φ n the characteristic function of S n P converges pointwise to e x2 2. Moreover, e x2 2 is indeed continuous at 0, and e x2 2 = γ 0, x. Therefore, Lévy s continuity theorem Theorem 3 tells us that S n P convergearrowly to γ 0,, which is the claim. 2 3
The Kolmogorov continuity theorem, Hölder continuity, and the Kolmogorov-Chentsov theorem
The Kolmogorov continuity theorem, Hölder continuity, and the Kolmogorov-Chentsov theorem Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto June 11, 2015 1 Modifications
More informationIntegral operators. Jordan Bell Department of Mathematics, University of Toronto. April 22, X F x(y)dµ(y) x N c 1 0 x N 1
Integral operators Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto April 22, 2016 1 Product measures Let (, A, µ be a σ-finite measure space. Then with A A the product
More informationPositive definite functions, completely monotone functions, the Bernstein-Widder theorem, and Schoenberg s theorem
Positive definite functions, completely monotone functions, the Bernstein-Widder theorem, and Schoenberg s theorem Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto June
More informationThe Kolmogorov extension theorem
The Kolmogorov extension theorem Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto June 21, 2014 1 σ-algebras and semirings If X is a nonempty set, an algebra of sets on
More informationProbability and Measure
Chapter 4 Probability and Measure 4.1 Introduction In this chapter we will examine probability theory from the measure theoretic perspective. The realisation that measure theory is the foundation of probability
More informationJointly measurable and progressively measurable stochastic processes
Jointly measurable and progressively measurable stochastic processes Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto June 18, 2015 1 Jointly measurable stochastic processes
More informationRademacher functions
Rademacher functions Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto July 6, 4 Binary expansions Define S : {, } N [, ] by Sσ σ k k, σ {, }N. For example, for σ and σ,
More informationThe Central Limit Theorem: More of the Story
The Central Limit Theorem: More of the Story Steven Janke November 2015 Steven Janke (Seminar) The Central Limit Theorem:More of the Story November 2015 1 / 33 Central Limit Theorem Theorem (Central Limit
More informationProbability and Measure
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 84 Paper 4, Section II 26J Let (X, A) be a measurable space. Let T : X X be a measurable map, and µ a probability
More informationStone-Čech compactification of Tychonoff spaces
The Stone-Čech compactification of Tychonoff spaces Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto June 27, 2014 1 Completely regular spaces and Tychonoff spaces A topological
More informationGaussian Hilbert spaces
Gaussian Hilbert spaces Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto July 11, 015 1 Gaussian measures Let γ be a Borel probability measure on. For a, if γ = δ a then
More informationAsymptotic Statistics-III. Changliang Zou
Asymptotic Statistics-III Changliang Zou The multivariate central limit theorem Theorem (Multivariate CLT for iid case) Let X i be iid random p-vectors with mean µ and and covariance matrix Σ. Then n (
More informationLecture 3 - Expectation, inequalities and laws of large numbers
Lecture 3 - Expectation, inequalities and laws of large numbers Jan Bouda FI MU April 19, 2009 Jan Bouda (FI MU) Lecture 3 - Expectation, inequalities and laws of large numbersapril 19, 2009 1 / 67 Part
More information1 Fourier Integrals of finite measures.
18.103 Fall 2013 1 Fourier Integrals of finite measures. Denote the space of finite, positive, measures on by M + () = {µ : µ is a positive measure on ; µ() < } Proposition 1 For µ M + (), we define the
More informationMATH 418: Lectures on Conditional Expectation
MATH 418: Lectures on Conditional Expectation Instructor: r. Ed Perkins, Notes taken by Adrian She Conditional expectation is one of the most useful tools of probability. The Radon-Nikodym theorem enables
More informationChapter 4. The dominated convergence theorem and applications
Chapter 4. The dominated convergence theorem and applications The Monotone Covergence theorem is one of a number of key theorems alllowing one to exchange limits and [Lebesgue] integrals (or derivatives
More informationLecture I: Asymptotics for large GUE random matrices
Lecture I: Asymptotics for large GUE random matrices Steen Thorbjørnsen, University of Aarhus andom Matrices Definition. Let (Ω, F, P) be a probability space and let n be a positive integer. Then a random
More informationMATH MEASURE THEORY AND FOURIER ANALYSIS. Contents
MATH 3969 - MEASURE THEORY AND FOURIER ANALYSIS ANDREW TULLOCH Contents 1. Measure Theory 2 1.1. Properties of Measures 3 1.2. Constructing σ-algebras and measures 3 1.3. Properties of the Lebesgue measure
More informationChapter 7. Basic Probability Theory
Chapter 7. Basic Probability Theory I-Liang Chern October 20, 2016 1 / 49 What s kind of matrices satisfying RIP Random matrices with iid Gaussian entries iid Bernoulli entries (+/ 1) iid subgaussian entries
More informationSemicontinuous functions and convexity
Semicontinuous functions and convexity Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto April 3, 2014 1 Lattices If (A, ) is a partially ordered set and S is a subset
More informationPart II Probability and Measure
Part II Probability and Measure Theorems Based on lectures by J. Miller Notes taken by Dexter Chua Michaelmas 2016 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationBernstein s inequality and Nikolsky s inequality for R d
Bernstein s inequality and Nikolsky s inequality for d Jordan Bell jordan.bell@gmail.com Department of athematics University of Toronto February 6 25 Complex Borel measures and the Fourier transform Let
More information1* (10 pts) Let X be a random variable with P (X = 1) = P (X = 1) = 1 2
Math 736-1 Homework Fall 27 1* (1 pts) Let X be a random variable with P (X = 1) = P (X = 1) = 1 2 and let Y be a standard normal random variable. Assume that X and Y are independent. Find the distribution
More information18.175: Lecture 3 Integration
18.175: Lecture 3 Scott Sheffield MIT Outline Outline Recall definitions Probability space is triple (Ω, F, P) where Ω is sample space, F is set of events (the σ-algebra) and P : F [0, 1] is the probability
More informationMarkov operators acting on Polish spaces
ANNALES POLONICI MATHEMATICI LVII.31997) Markov operators acting on Polish spaces by Tomasz Szarek Katowice) Abstract. We prove a new sufficient condition for the asymptotic stability of Markov operators
More information. Then V l on K l, and so. e e 1.
Sanov s Theorem Let E be a Polish space, and define L n : E n M E to be the empirical measure given by L n x = n n m= δ x m for x = x,..., x n E n. Given a µ M E, denote by µ n the distribution of L n
More information3 (Due ). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?
MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due ). Show that the open disk x 2 + y 2 < 1 is a countable union of planar elementary sets. Show that the closed disk x 2 + y 2 1 is a countable
More informationStability and Sensitivity of the Capacity in Continuous Channels. Malcolm Egan
Stability and Sensitivity of the Capacity in Continuous Channels Malcolm Egan Univ. Lyon, INSA Lyon, INRIA 2019 European School of Information Theory April 18, 2019 1 / 40 Capacity of Additive Noise Models
More informationThe uniform metric on product spaces
The uniform metric on product spaces Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto April 3, 2014 1 Metric topology If (X, d) is a metric space, a X, and r > 0, then
More informationLecture Notes 3 Convergence (Chapter 5)
Lecture Notes 3 Convergence (Chapter 5) 1 Convergence of Random Variables Let X 1, X 2,... be a sequence of random variables and let X be another random variable. Let F n denote the cdf of X n and let
More information2 (Bonus). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?
MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due 9/5). Prove that every countable set A is measurable and µ(a) = 0. 2 (Bonus). Let A consist of points (x, y) such that either x or y is
More informationHomework 11. Solutions
Homework 11. Solutions Problem 2.3.2. Let f n : R R be 1/n times the characteristic function of the interval (0, n). Show that f n 0 uniformly and f n µ L = 1. Why isn t it a counterexample to the Lebesgue
More informationDynkin (λ-) and π-systems; monotone classes of sets, and of functions with some examples of application (mainly of a probabilistic flavor)
Dynkin (λ-) and π-systems; monotone classes of sets, and of functions with some examples of application (mainly of a probabilistic flavor) Matija Vidmar February 7, 2018 1 Dynkin and π-systems Some basic
More informationFACULTY OF SCIENCE FINAL EXAMINATION MATHEMATICS MATH 355. Analysis 4. Examiner: Professor S. W. Drury Date: Tuesday, April 18, 2006 INSTRUCTIONS
FACULTY OF SCIENCE FINAL EXAMINATION MATHEMATICS MATH 355 Analysis 4 Examiner: Professor S. W. Drury Date: Tuesday, April 18, 26 Associate Examiner: Professor K. N. GowriSankaran Time: 2: pm. 5: pm. INSTRUCTIONS
More informationIntegration on Measure Spaces
Chapter 3 Integration on Measure Spaces In this chapter we introduce the general notion of a measure on a space X, define the class of measurable functions, and define the integral, first on a class of
More information6.2 Fubini s Theorem. (µ ν)(c) = f C (x) dµ(x). (6.2) Proof. Note that (X Y, A B, µ ν) must be σ-finite as well, so that.
6.2 Fubini s Theorem Theorem 6.2.1. (Fubini s theorem - first form) Let (, A, µ) and (, B, ν) be complete σ-finite measure spaces. Let C = A B. Then for each µ ν- measurable set C C the section x C is
More informationAliprantis, Border: Infinite-dimensional Analysis A Hitchhiker s Guide
aliprantis.tex May 10, 2011 Aliprantis, Border: Infinite-dimensional Analysis A Hitchhiker s Guide Notes from [AB2]. 1 Odds and Ends 2 Topology 2.1 Topological spaces Example. (2.2) A semimetric = triangle
More information2 Lebesgue integration
2 Lebesgue integration 1. Let (, A, µ) be a measure space. We will always assume that µ is complete, otherwise we first take its completion. The example to have in mind is the Lebesgue measure on R n,
More informationLectures 2 3 : Wigner s semicircle law
Fall 009 MATH 833 Random Matrices B. Való Lectures 3 : Wigner s semicircle law Notes prepared by: M. Koyama As we set up last wee, let M n = [X ij ] n i,j= be a symmetric n n matrix with Random entries
More information3 Integration and Expectation
3 Integration and Expectation 3.1 Construction of the Lebesgue Integral Let (, F, µ) be a measure space (not necessarily a probability space). Our objective will be to define the Lebesgue integral R fdµ
More informationProduct measure and Fubini s theorem
Chapter 7 Product measure and Fubini s theorem This is based on [Billingsley, Section 18]. 1. Product spaces Suppose (Ω 1, F 1 ) and (Ω 2, F 2 ) are two probability spaces. In a product space Ω = Ω 1 Ω
More informationChapter 4: Asymptotic Properties of the MLE
Chapter 4: Asymptotic Properties of the MLE Daniel O. Scharfstein 09/19/13 1 / 1 Maximum Likelihood Maximum likelihood is the most powerful tool for estimation. In this part of the course, we will consider
More informationExercises. T 2T. e ita φ(t)dt.
Exercises. Set #. Construct an example of a sequence of probability measures P n on R which converge weakly to a probability measure P but so that the first moments m,n = xdp n do not converge to m = xdp.
More informationReview of measure theory
209: Honors nalysis in R n Review of measure theory 1 Outer measure, measure, measurable sets Definition 1 Let X be a set. nonempty family R of subsets of X is a ring if, B R B R and, B R B R hold. bove,
More informationA Brief Analysis of Central Limit Theorem. SIAM Chapter Florida State University
1 / 36 A Brief Analysis of Central Limit Theorem Omid Khanmohamadi (okhanmoh@math.fsu.edu) Diego Hernán Díaz Martínez (ddiazmar@math.fsu.edu) Tony Wills (twills@math.fsu.edu) Kouadio David Yao (kyao@math.fsu.edu)
More informationCompact operators on Banach spaces
Compact operators on Banach spaces Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto November 12, 2017 1 Introduction In this note I prove several things about compact
More informationHermite functions. Jordan Bell Department of Mathematics, University of Toronto. September 9, 2015
Hermite functions Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto September 9, 25 Locally convex spaces If V is a vector space and {p α : α A} is a separating family
More informationLecture No 1 Introduction to Diffusion equations The heat equat
Lecture No 1 Introduction to Diffusion equations The heat equation Columbia University IAS summer program June, 2009 Outline of the lectures We will discuss some basic models of diffusion equations and
More informationSection 27. The Central Limit Theorem. Po-Ning Chen, Professor. Institute of Communications Engineering. National Chiao Tung University
Section 27 The Central Limit Theorem Po-Ning Chen, Professor Institute of Communications Engineering National Chiao Tung University Hsin Chu, Taiwan 3000, R.O.C. Identically distributed summands 27- Central
More informationConsistency of Modularity Clustering on Random Geometric Graphs
Consistency of Modularity Clustering on Random Geometric Graphs Erik Davis The University of Arizona May 10, 2016 Outline Introduction to Modularity Clustering Pointwise Convergence Convergence of Optimal
More informationFolland: Real Analysis, Chapter 7 Sébastien Picard
Folland: Real Analysis, Chapter 7 Sébastien Picard Problem 7.2 Let µ be a Radon measure on X. a. Let N be the union of all open U X such that µ(u) =. Then N is open and µ(n) =. The complement of N is called
More informationREAL AND COMPLEX ANALYSIS
REAL AND COMPLE ANALYSIS Third Edition Walter Rudin Professor of Mathematics University of Wisconsin, Madison Version 1.1 No rights reserved. Any part of this work can be reproduced or transmitted in any
More informationStochastic Models (Lecture #4)
Stochastic Models (Lecture #4) Thomas Verdebout Université libre de Bruxelles (ULB) Today Today, our goal will be to discuss limits of sequences of rv, and to study famous limiting results. Convergence
More informationA List of Problems in Real Analysis
A List of Problems in Real Analysis W.Yessen & T.Ma December 3, 218 This document was first created by Will Yessen, who was a graduate student at UCI. Timmy Ma, who was also a graduate student at UCI,
More informationBrownian motion. Samy Tindel. Purdue University. Probability Theory 2 - MA 539
Brownian motion Samy Tindel Purdue University Probability Theory 2 - MA 539 Mostly taken from Brownian Motion and Stochastic Calculus by I. Karatzas and S. Shreve Samy T. Brownian motion Probability Theory
More informationThe Heine-Borel and Arzela-Ascoli Theorems
The Heine-Borel and Arzela-Ascoli Theorems David Jekel October 29, 2016 This paper explains two important results about compactness, the Heine- Borel theorem and the Arzela-Ascoli theorem. We prove them
More informationMeasure Theory on Topological Spaces. Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond
Measure Theory on Topological Spaces Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond May 22, 2011 Contents 1 Introduction 2 1.1 The Riemann Integral........................................ 2 1.2 Measurable..............................................
More informationLecture Notes Introduction to Ergodic Theory
Lecture Notes Introduction to Ergodic Theory Tiago Pereira Department of Mathematics Imperial College London Our course consists of five introductory lectures on probabilistic aspects of dynamical systems,
More informationTHE LINDEBERG-FELLER CENTRAL LIMIT THEOREM VIA ZERO BIAS TRANSFORMATION
THE LINDEBERG-FELLER CENTRAL LIMIT THEOREM VIA ZERO BIAS TRANSFORMATION JAINUL VAGHASIA Contents. Introduction. Notations 3. Background in Probability Theory 3.. Expectation and Variance 3.. Convergence
More informationLARGE DEVIATIONS OF TYPICAL LINEAR FUNCTIONALS ON A CONVEX BODY WITH UNCONDITIONAL BASIS. S. G. Bobkov and F. L. Nazarov. September 25, 2011
LARGE DEVIATIONS OF TYPICAL LINEAR FUNCTIONALS ON A CONVEX BODY WITH UNCONDITIONAL BASIS S. G. Bobkov and F. L. Nazarov September 25, 20 Abstract We study large deviations of linear functionals on an isotropic
More informationKernel Density Estimation
EECS 598: Statistical Learning Theory, Winter 2014 Topic 19 Kernel Density Estimation Lecturer: Clayton Scott Scribe: Yun Wei, Yanzhen Deng Disclaimer: These notes have not been subjected to the usual
More informationStrong Consistency of Set-Valued Frechet Sample Mean in Metric Spaces
Strong Consistency of Set-Valued Frechet Sample Mean in Metric Spaces Cedric E. Ginestet Department of Mathematics and Statistics Boston University JSM 2013 The Frechet Mean Barycentre as Average Given
More information18.175: Lecture 15 Characteristic functions and central limit theorem
18.175: Lecture 15 Characteristic functions and central limit theorem Scott Sheffield MIT Outline Characteristic functions Outline Characteristic functions Characteristic functions Let X be a random variable.
More informationLecture 12. F o s, (1.1) F t := s>t
Lecture 12 1 Brownian motion: the Markov property Let C := C(0, ), R) be the space of continuous functions mapping from 0, ) to R, in which a Brownian motion (B t ) t 0 almost surely takes its value. Let
More informationis a Borel subset of S Θ for each c R (Bertsekas and Shreve, 1978, Proposition 7.36) This always holds in practical applications.
Stat 811 Lecture Notes The Wald Consistency Theorem Charles J. Geyer April 9, 01 1 Analyticity Assumptions Let { f θ : θ Θ } be a family of subprobability densities 1 with respect to a measure µ on a measurable
More informationCHAPTER I THE RIESZ REPRESENTATION THEOREM
CHAPTER I THE RIESZ REPRESENTATION THEOREM We begin our study by identifying certain special kinds of linear functionals on certain special vector spaces of functions. We describe these linear functionals
More informationLEBESGUE INTEGRATION. Introduction
LEBESGUE INTEGATION EYE SJAMAA Supplementary notes Math 414, Spring 25 Introduction The following heuristic argument is at the basis of the denition of the Lebesgue integral. This argument will be imprecise,
More informationSolutions to Tutorial 11 (Week 12)
THE UIVERSITY OF SYDEY SCHOOL OF MATHEMATICS AD STATISTICS Solutions to Tutorial 11 (Week 12) MATH3969: Measure Theory and Fourier Analysis (Advanced) Semester 2, 2017 Web Page: http://sydney.edu.au/science/maths/u/ug/sm/math3969/
More informationProblem set 1, Real Analysis I, Spring, 2015.
Problem set 1, Real Analysis I, Spring, 015. (1) Let f n : D R be a sequence of functions with domain D R n. Recall that f n f uniformly if and only if for all ɛ > 0, there is an N = N(ɛ) so that if n
More informationPhenomena in high dimensions in geometric analysis, random matrices, and computational geometry Roscoff, France, June 25-29, 2012
Phenomena in high dimensions in geometric analysis, random matrices, and computational geometry Roscoff, France, June 25-29, 202 BOUNDS AND ASYMPTOTICS FOR FISHER INFORMATION IN THE CENTRAL LIMIT THEOREM
More informationu xx + u yy = 0. (5.1)
Chapter 5 Laplace Equation The following equation is called Laplace equation in two independent variables x, y: The non-homogeneous problem u xx + u yy =. (5.1) u xx + u yy = F, (5.) where F is a function
More informationMath 118B Solutions. Charles Martin. March 6, d i (x i, y i ) + d i (y i, z i ) = d(x, y) + d(y, z). i=1
Math 8B Solutions Charles Martin March 6, Homework Problems. Let (X i, d i ), i n, be finitely many metric spaces. Construct a metric on the product space X = X X n. Proof. Denote points in X as x = (x,
More informationProblem set 2 The central limit theorem.
Problem set 2 The central limit theorem. Math 22a September 6, 204 Due Sept. 23 The purpose of this problem set is to walk through the proof of the central limit theorem of probability theory. Roughly
More informationNotes of the seminar Evolution Equations in Probability Spaces and the Continuity Equation
Notes of the seminar Evolution Equations in Probability Spaces and the Continuity Equation Onno van Gaans Version of 12 April 2006 These are some notes supporting the seminar Evolution Equations in Probability
More information1 Probability space and random variables
1 Probability space and random variables As graduate level, we inevitably need to study probability based on measure theory. It obscures some intuitions in probability, but it also supplements our intuition,
More informationFourier analysis, measures, and distributions. Alan Haynes
Fourier analysis, measures, and distributions Alan Haynes 1 Mathematics of diffraction Physical diffraction As a physical phenomenon, diffraction refers to interference of waves passing through some medium
More informationModel Specification Testing in Nonparametric and Semiparametric Time Series Econometrics. Jiti Gao
Model Specification Testing in Nonparametric and Semiparametric Time Series Econometrics Jiti Gao Department of Statistics School of Mathematics and Statistics The University of Western Australia Crawley
More informationProblem Set 5: Solutions Math 201A: Fall 2016
Problem Set 5: s Math 21A: Fall 216 Problem 1. Define f : [1, ) [1, ) by f(x) = x + 1/x. Show that f(x) f(y) < x y for all x, y [1, ) with x y, but f has no fixed point. Why doesn t this example contradict
More informationSome basic elements of Probability Theory
Chapter I Some basic elements of Probability Theory 1 Terminology (and elementary observations Probability theory and the material covered in a basic Real Variables course have much in common. However
More informationThe Canonical Gaussian Measure on R
The Canonical Gaussian Measure on R 1. Introduction The main goal of this course is to study Gaussian measures. The simplest example of a Gaussian measure is the canonical Gaussian measure P on R where
More informationSection 8: Asymptotic Properties of the MLE
2 Section 8: Asymptotic Properties of the MLE In this part of the course, we will consider the asymptotic properties of the maximum likelihood estimator. In particular, we will study issues of consistency,
More informationMATHS 730 FC Lecture Notes March 5, Introduction
1 INTRODUCTION MATHS 730 FC Lecture Notes March 5, 2014 1 Introduction Definition. If A, B are sets and there exists a bijection A B, they have the same cardinality, which we write as A, #A. If there exists
More informationPreliminaries to Stochastic Analysis Autumn 2011 version. Xue-Mei Li The University of Warwick
Preliminaries to Stochastic Analysis Autumn 2011 version Xue-Mei Li The University of Warwick Typset: October 21, 2011 Chapter 1 Preliminaries For completion and easy reference we include some basic concepts
More informationBrownian Motion. 1 Definition Brownian Motion Wiener measure... 3
Brownian Motion Contents 1 Definition 2 1.1 Brownian Motion................................. 2 1.2 Wiener measure.................................. 3 2 Construction 4 2.1 Gaussian process.................................
More informationCHAPTER V DUAL SPACES
CHAPTER V DUAL SPACES DEFINITION Let (X, T ) be a (real) locally convex topological vector space. By the dual space X, or (X, T ), of X we mean the set of all continuous linear functionals on X. By the
More informationAnalysis Comprehensive Exam Questions Fall 2008
Analysis Comprehensive xam Questions Fall 28. (a) Let R be measurable with finite Lebesgue measure. Suppose that {f n } n N is a bounded sequence in L 2 () and there exists a function f such that f n (x)
More informationAdvanced Probability Theory (Math541)
Advanced Probability Theory (Math541) Instructor: Kani Chen (Classic)/Modern Probability Theory (1900-1960) Instructor: Kani Chen (HKUST) Advanced Probability Theory (Math541) 1 / 17 Primitive/Classic
More informationLecture 4 Lebesgue spaces and inequalities
Lecture 4: Lebesgue spaces and inequalities 1 of 10 Course: Theory of Probability I Term: Fall 2013 Instructor: Gordan Zitkovic Lecture 4 Lebesgue spaces and inequalities Lebesgue spaces We have seen how
More informationUseful Probability Theorems
Useful Probability Theorems Shiu-Tang Li Finished: March 23, 2013 Last updated: November 2, 2013 1 Convergence in distribution Theorem 1.1. TFAE: (i) µ n µ, µ n, µ are probability measures. (ii) F n (x)
More informationL p Spaces and Convexity
L p Spaces and Convexity These notes largely follow the treatments in Royden, Real Analysis, and Rudin, Real & Complex Analysis. 1. Convex functions Let I R be an interval. For I open, we say a function
More informationClass Notes for Math 921/922: Real Analysis, Instructor Mikil Foss
University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln Math Department: Class Notes and Learning Materials Mathematics, Department of 200 Class Notes for Math 92/922: Real Analysis,
More informationReal Analysis Notes. Thomas Goller
Real Analysis Notes Thomas Goller September 4, 2011 Contents 1 Abstract Measure Spaces 2 1.1 Basic Definitions........................... 2 1.2 Measurable Functions........................ 2 1.3 Integration..............................
More informationRecall that if X is a compact metric space, C(X), the space of continuous (real-valued) functions on X, is a Banach space with the norm
Chapter 13 Radon Measures Recall that if X is a compact metric space, C(X), the space of continuous (real-valued) functions on X, is a Banach space with the norm (13.1) f = sup x X f(x). We want to identify
More informationA BOOLEAN ACTION OF C(M, U(1)) WITHOUT A SPATIAL MODEL AND A RE-EXAMINATION OF THE CAMERON MARTIN THEOREM
A BOOLEAN ACTION OF C(M, U(1)) WITHOUT A SPATIAL MODEL AND A RE-EXAMINATION OF THE CAMERON MARTIN THEOREM JUSTIN TATCH MOORE AND S LAWOMIR SOLECKI Abstract. We will demonstrate that if M is an uncountable
More informationOn a zero speed sensitive cellular automaton
On a zero speed sensitive cellular automaton Xavier Bressaud, Pierre Tisseur Institut de Mathématiques de Luminy, UMR 6206 du CNRS, France Department of Mathematics, Trent University, Ontario, Canada Laboratoire
More informationPCA sets and convexity
F U N D A M E N T A MATHEMATICAE 163 (2000) PCA sets and convexity by Robert K a u f m a n (Urbana, IL) Abstract. Three sets occurring in functional analysis are shown to be of class PCA (also called Σ
More informationChapter 4. Measurable Functions. 4.1 Measurable Functions
Chapter 4 Measurable Functions If X is a set and A P(X) is a σ-field, then (X, A) is called a measurable space. If µ is a countably additive measure defined on A then (X, A, µ) is called a measure space.
More information1 Independent increments
Tel Aviv University, 2008 Brownian motion 1 1 Independent increments 1a Three convolution semigroups........... 1 1b Independent increments.............. 2 1c Continuous time................... 3 1d Bad
More informationWiener Measure and Brownian Motion
Chapter 16 Wiener Measure and Brownian Motion Diffusion of particles is a product of their apparently random motion. The density u(t, x) of diffusing particles satisfies the diffusion equation (16.1) u
More informationApplied Analysis (APPM 5440): Final exam 1:30pm 4:00pm, Dec. 14, Closed books.
Applied Analysis APPM 44: Final exam 1:3pm 4:pm, Dec. 14, 29. Closed books. Problem 1: 2p Set I = [, 1]. Prove that there is a continuous function u on I such that 1 ux 1 x sin ut 2 dt = cosx, x I. Define
More information