Section 26. Characteristic Functions. Po-Ning Chen, Professor. Institute of Communications Engineering. National Chiao Tung University
|
|
- Johnathan Cobb
- 5 years ago
- Views:
Transcription
1 Section 26 Characteristic Functions Po-Ning Chen, Professor Institute of Communications Engineering National Chiao Tung University Hsin Chu, Taiwan 3, R.O.C.
2 Characteristic function 26- Definition (characteristic function) The characteristic function of a random variable X is defined for real t by: ϕ(t) e itx df X (x) cos(tx)df X (x)+i sin(tx)df X (x). The characteristic function ϕ(t) M(it), where M(t) is the moment generating function of random variable X. The characteristic function is the (inverse) Fourier transform of distribution function. The characteristic function always exist, because distribution function is always integrable. It is named the characteristic function since it completely characterizes the distribution.
3 Fundamental properties regarding characteristic functions26-2 Fundamental properties of characteristic functions The characteristic function of sum of two independent random variables is the product of individual characteristic functions. The characteristic function uniquely determines distribution function. From the pointwise convergence of characteristic function follows the indistribution convergence of random variables.
4 Moments and characteristic function 26-3 ϕ(). ϕ(t) for all t R. ϕ(t) isuniformly continuous. Definition (uniform continuity) A function f(t) isuniformly continuous in A, if for any δ>, there exists h> such that sup f(x) f(y) <δ. {(x,y) A 2 : x y h}
5 Moments and characteristic function 26-4 Proof: ϕ(t + h) ϕ(t) ( e i(t+h)x df X (x) (e ihx )e itx df X (x) (e ihx ) e itx dfx (x) (e ihx ) dfx (x), e itx df X (x) (cos(hx) ) 2 +sin 2 (hx)df X (x) 2 2cos(hx)dFX (x) 2 sin(hx/2) df X (x) ) 2E [ sin(hx/2) ] where the bound is independent of t..
6 Taylor expansion for characteristic functions 26-5 Theorem (Taylor s formula with remainder) Assume that f( ) hasa continuous derivative of order n + in some open interval containing a. Then n f (k) (a) f(x) (x a) k + x (x t) n f (n+) (t)dt. k! n! k By the Taylor s formula with remainder about x, n e ix (e ix ) (k) x x k + x (x t) n (e it ) (n+) dt k! n! k n i k k! xk + x (x t) ( n i n+ e it) dt n! k n (ix) k x + in+ (x t) n e it dt. k! n! k a
7 Taylor expansion for characteristic functions 26-6 Integration by part for the below expression yields that: x (x t) n e it (x t)n x x dt e it (x t) n ( + ) ie it dt n n which implies that: x This summarizes to: e ix xn n + i n x x (x t) n e it dt (x t) n dt + i n (x t) n (e it )dt i n n (ix) k k k! i n+ x n! i n (n )! x (x t) n e it dt x x (x t) n e it dt, (x t) n e it dt, (x t) n (e it )dt
8 Taylor expansion for characteristic functions 26-7 Therefore, for x, eix n (ix) k k! k i n+ x (x t) n e it dt n! i n x (x t) n (e it )dt (n )! x (x t) n e it dt n! (n )! x n! 2 (n )! x n+ (n +)! 2x n n! x (x t) n dt x (x t) n (e it ) dt (x t) n dt, (since e it e it +2)
9 Taylor expansion for characteristic functions 26-8 and for x<, n (ix) k eix k! k i n+ x (x t) n e it dt n! i n x (x t) n (e it )dt (n )! n! x (n )! n! x 2 (n )! ( x) n+ (n +)! 2( x) n n! (x t) n e it dt x (t x) n dt x (x t) n (e it ) dt (t x) n dt, (since e it e it +2)
10 Taylor expansion for characteristic functions 26-9 So to speak, eix n k (ix) k k! min { } x n+ (n +)!, 2 x n. n! Lemma If X has a moment of order n, then n ϕ(t) (it) k [ { }] E[X k tx n+ ] k! E min (n +)!, 2 tx n n! k { t n+ E[ X n+ ] (if the moment of order (n + ) also exists) min, 2 t n E[ X n } ]. (n +)! n! Proof: n ϕ(t) k (it) k E[X k ] k! R n e itx (it) k df X (x) x k df X (x) k! k R n (itx) k eitx k! df X(x). R k
11 Taylor expansion for characteristic functions 26- Concern: When does the characteristic function have Taylor expansion? Corollary If for any t, then Theorem If then t n E[ X n ] lim n n! ϕ(t) E[e t X ] ϕ(t), (it) k E[X k ]. k! k k t k k! E[ X k ] <, (it) k E[X k ]. k! k
12 Taylor expansion for characteristic functions 26- Corollary If for some t, then ϕ(t ) k (it ) k E[X k ], k!. for every t t t, ϕ(t) k (it) k E[X k ]. k! 2. ϕ (k) () i k E[X k ] for every k,, 2,... Property 2, as a direct consequence of Property, is seemingly an analogous property to the moment generating function. However, moments can be determined by the characteristic function in a much weaker sense! (Notably, unlike the moment generation function which may have a big jump at the origin, the characteristic function is always uniformly continuous.)
13 Taylor expansion for characteristic functions 26-2 Lemma If E[ X k ] <, then Proof: ϕ (k) () i k E[X k ].. k : [ ϕ(t + h) ϕ(t) E[iXe itx ] h E h ei(t+h)x itx] h eitx ixe [ ] E e itx (eihx ihx) h [ e itx E e ihx ] ihx h [ min{(/2) hx 2 ], 2 hx } E h E [ min{(/2)h X 2, 2 X } ]. By bounded convergence theorem, min{(/2)h X 2, 2 X } 2 X, where X is integrable, and lim h min{(/2)h x 2, 2 x } almost everywhere jointly imply lim h E [ min{(/2)h X 2, 2 X } ].
14 Taylor expansion for characteristic functions 26-3 Theorem (bounded convergence theorem) If (i) f n g almost everywhere, (ii) g is integrable, and (iii) f n f almost everywhere, then f is integrable and f n dµ fdµ. Hence, we obtain: and ϕ (t) lim h ϕ(t + h) ϕ(t) h ϕ () E[iX]. E[(iX)e itx ],
15 Taylor expansion for characteristic functions k 2: ϕ (t + h) ϕ (t) h E[(iX) 2 e itx ] E[(iX)e i(t+h)x ] E[(iX)e itx ] E[(iX) 2 e itx ] h [ ] E (ix)e itx eihx ihx h [ E X e itx e ihx ] ihx h E [ min{(/2)h X 3, 2 X 2 } ], which again gives by bounded convergence theorem that ϕ (2) (t) E[(iX) 2 e itx ], and ϕ (2) () E[(iX) 2 ]. 3. Induction: The lemma can be proved by repeating the above process by induction (proving that the lemma holds for k n + under the premise that the lemma is valid for k n).
16 Taylor expansion for characteristic functions 26-5 The above lemma does not imply that the derivatives of ϕ(t) alwaysexist.on the contrary, ϕ(t) may be non-differentiable even if it is uniformly continuous. The above lemma actually tells us that the more moments X has, the more derivatives ϕ has. Brainstorming: Can this property be applied to Fourier Transform pair? Certainly, if the function is integrable. Brainstorming: In concept, the tail (rate-of-decaying) behavior of the distribution determines the smoothness (order of differentiability) of ϕ.
17 Riemann-Lebesgue theorem 26-6 Theorem 26. (Riemann-Lebesgue theorem) If X has a density, then ϕ X (t) t. Every Lebesgue integrable function can be approximated by Riemann integrable functions of two kinds. Theorem 7. Suppose that R f(x) dx < (which indicates its Lebesgue integrability) and ε>fixed.. There exists a step function g(x) k i x ii (ai,b i ](x) (which indicates its Riemann integrability), where each a i and b i are finite real numbers, such that f(x) g(x) dx < ε. R 2. There exists a continuous integrable h with bounded support (namely, which indicates its Riemann integrability) such that f(x) h(x) dx < ε. R Notably, a bounded measurable function is Riemann integrable on [a, b] if it is continuous in [a, b].
18 Riemann-Lebesgue theorem 26-7 Proof: From Theorem 7., there is a step function g(x) k j x ji (aj,b j ](x)such that f(x) g(x) dx < ε, R where f(x) is the density of X, and satisfies R f(x)dx <. Therefore, f(x)e itx dx g(x)e itx dx (f(x) g(x)) e itx dx R R R f(x) g(x) dx < ε. The proof is completed by noting that ε is arbitrary and k g(x)e itx dx x j I (aj,b j ](x) e itx dx R R j j a j R k bj x j e itx dx k j x j ( e itb j e ita j it ) t.
19 Independent and Inversion 26-8 The characteristic function of sum of independent random variables is the product of individual characteristic functions. The characteristic function of X is the complex conjugate of the characteristic function of X.
20 Inversion and uniqueness theorem 26-9 How to prove that The characteristic function uniquely determines the probability distribution. This is the task of Uniqueness Theorem. Please again think of the counterpart theorem for Fourier transformation. Also, remember that the cdf of a random variable is sufficient to define its statistic properties.
21 Inversion and uniqueness theorem 26-2 Example 8.4 Prove S(T ) Proof: T sin(x) x dx T T sin(x) x [ ] sin(x) e ux du dx [ T ] e ux sin(x)dx du π 2. dx T (By Fubini s theorem) [ e ut (u sin(t )+cos(t)) ] du +u 2 +u 2du e ut +u2(usin(t )+cos(t))du tan (u) π 2 e ut +u 2 cos(t φ u)du, where cos(φ u )/ +u 2 e ut +u 2 cos(t φ u)du.
22 Inversion and uniqueness theorem 26-2 Finally, e ut cos(t φ u)du +u 2 T e ut +u 2 cos(t φ u) du e ut du, because T. +u 2 for u Theorem (Fubini s theorem) Suppose X and Y can be expressed as X i U i and Y i V i for some {U i } i and {V i} i with µ(u i) < and ν(v i ) <. Then, if either ( ) f(x, y) ν(dy) µ(dx) < or X ( Y X Y ( ) f(x, y) µ(dx) ν(dy) <, Y X ) ( ) f(x, y)ν(dy) µ(dx) f(x, y)µ(dx) ν(dy). Y X
23 Inversion and uniqueness theorem Checking: T sin(x)e ux du T sin(x) dx T<. x
24 Inversion and uniqueness theorem Indeed, S(T ) S(π).
25 Inversion and uniqueness theorem Observation T T e itx it dt 2sgn(x)S(T x ), where sgn (x), if x>;, if x ;, if x<. Proof: T T T e itx it dt e itx T it dt + e itx it dt T e itx T e itx dt + it it dt T e itx e itx dt it T sin(tx) 2 dt t T sin (t x ) 2sgn(x) dt, t T x sin (t ) 2sgn(x) dt 2sgn(x)S(T x ). t
26 Inversion and uniqueness theorem Theorem 26.2 (Uniqueness theorem) For any a and b with Pr[X a] Pr[X b] anda<b, Pr[a <X b] lim T 2π T T e ita e itb ϕ X (t)dt, it where ϕ X (t) is the characteristic function of random variable X. Proof: Let I T denote the quantity inside the limit, namely, I T 2π 2π 2π π T T T T e ita e itb ϕ X (t)dt it e ita e itb ( ) e itx df X (x) dt it ( T e it(x a) e it(x b) ) dt df X (x) T it [ ] sgn(x a)s(t x a ) sgn(x b)s(t x b ) dfx (x). The absolute value of the above integrand, namely [ sgn(x a)s(t x a ) sgn(x b)s(t x b ) ], is bounded above by 2S(π), which is integrable with
27 Inversion and uniqueness theorem respect to measure df X (x). Hence, by bounded convergence theorem, lim T I T π π [ ] lim sgn(x a)s(t x a ) sgn(x b)s(t x b ) dfx (x) T ψ a,b (x)df X (x),
28 Inversion and uniqueness theorem where ψ a,b (x) Consequently, lim [sgn(x a)s(t x a ) sgn(x b)s(t x b )] T lim T lim T I T S(T x b ) S(T x a ), for x<a; S(T x b ), for x a; S(T x a )+S(T x b ), for a<x<b; S(T x a ), for x b; S(T x a ) S(T x b ), for x>b, for x<a; π, for x a; 2 π, for a<x<b; π, for x b; 2, for x>b. π ψ a,b (x)df X (x) 2 Pr[X a]+pr[a<x<b]+ Pr[X b]. 2
29 Inversion and uniqueness theorem The proof is completed by noting that Pr[X a] Pr[X b]. Theorem 26.2 (Uniqueness theorem) For any a and b with a<b, 2 Pr[X a]+pr[a<x<b]+ Pr[X b] lim 2 T 2π T where ϕ X (t) is the characteristic function of random variable X. T e ita e itb ϕ X (t)dt, it Remarks: We can tell more from the proof (than from the statement of the theorem). For example, Theorem If ϕ X(t) dt <, thennopointmassexists. I.e., Pr[X a] for every a R. Proof:
30 Inversion and uniqueness theorem { e ix min! x, }! 2 x { e ix ( + ix) min 2! x 2, }! 2 x ( eix +ix + ) { 2 (ix)2 min 3! x 3, } 2! 2 x 2. 2 Pr[X a]+pr[a<x<b]+ e ita e itb Pr[X b] lim ϕ X (t)dt 2 T 2π T it T lim sup e ita e itb T 2π T it ϕ X(t) dt e it(b a) 2π t(b a) b a ϕ X(t) dt b a ϕ X (t) dt. 2π T Thus, when taking a b, we immediately obtain Pr[X a].
31 Inversion and uniqueness theorem 26-3 Another example of We can tell more from the proof. is: Theorem If ϕ X(t) dt <, then the random variable X has density f, and its density (can be made to) satisfies:. f X (x) ϕ X (t)e itx dt; 2π 2. f X (x) F X (x) for every x R; 3. f X (x) is uniformly continuous for x R. Proof: First, from slide 26-28, we know that random variable X has no point mass. Then, by Theorem 26.2, we have that for every x (as Pr[X x] and Pr[X x + h] ) F X (x + h) F X (x) h lim T 2π e itx e it(x+h) I [ T,T] ϕ X (t)dt. ith As e itx e it(x+h) I [ T,T] ϕ X (t) ith e ith th ϕ X(t) ϕ X (t), which is integrable with respect to Lebesgue measure, dominated convergence
32 Inversion and uniqueness theorem 26-3 theorem implies that F X (x + h) F X (x) h 2π e itx e it(x+h) ϕ X (t)dt. ith Using dominated convergence theorem again with respect to h yields: F X (x + h) F X (x) lim h h 2π 2π 2π We can similarly show that: F X (x) F X (x h) lim h h Accordingly, F X (x) 2π e itx e it(x+h) lim ϕ X (t)dt h ith ϕ X (t) ( e it(x+h) e itx ) lim dt it h h ϕ X (t)e itx dt. 2π ϕ X (t)e itx dt. ϕ X (t)e itx dt.
33 Inversion and uniqueness theorem Claim: F X (x) is uniformly continuous in x R. Proof: F X(x + h) F X(x) 2π 2π 2π ϕ X(t) dt 2π ϕ X (t)e it(x+h) dt ϕ X (t)e itx (e iht )dt ϕ X (t) e itx e iht dt where f U (t) ϕ X (t) ( ϕ X (t) dt π where the bound is independent of x. ϕ X (t)e itx dt e iht fu (t)dt / ϕ X (t) dt ) E[ sin(hu/2) ].
34 Inversion and uniqueness theorem The proof is then completed by quoting the following theorem. In other words, since F satisfies that b a F (x)dx F (b) F (a) for every a, b R, it is surely a density of X. Theorem (See Section 7) If F is a function with continuous derivative F, then b F (x)dx F (b) F (a). a Note that the density is not unique. Any function g satisfying b for every a, b Ris a density of X. a g(x)dx F (b) F (a)
35 Inversion and uniqueness theorem Summary of properties of cdf F F is differentiable almost everywhere. Theorem (H. L. Royden, Real Analysis, 3rd edition, pp., 988) Let g be an increasing real-valued function on the interval [a, b]. Then, g is differentiable almost everywhere. The derivative g is measurable, and b a g (x)dx g(b) g(a). By this theorem, together with the fact that the number of intervals that F is increasing is countable, cdf F is almost everywhere differentiable. F is not necessarily differentiable on every x. F may not have density.
36 Inversion and uniqueness theorem If F has density f, thenf f almost everywhere. If F has continuous density f, thenf f everywhere. By definition of density, h x+h x f(x)dx F (x + h) F (x). h This can be used to show the above two statements. If F is continuous, then F (can be made to) be the density of F. Remarks The tail behavior of the characteristic function determines the smoothness of f X. The tail behavior of the density (i.e., f X ) determines the smoothness of ϕ X.
37 Characteristic functions of some known distributions Standard normal: First, f X (x) 2π e x2 /2 for <x<. ϕ X (t) e t2 /2. ϕ X (t) dt Hence, f X (x) can be recovered from 2π continuous. e t2 /2 dt 2π<. ϕ X(t)e itx dt, and is also uniformly As ϕ X (t) decays exponentially fast at t, f X (x) has all orders of derivative and is very, very smooth in its shape.
38 Characteristic functions of some known distributions Furthermore, t n E[ X n ] n! t n2n/2 Γ((n +)/2) π n! t 2j 2 j (j )! (2j )! for n 2j odd; 2π t 2j 2 j Γ((2j +)/2) (2j)! for n 2j even π { max, } (2 t 2 ) j for n 2j oddandn 2j even t j! { max, }( ) 2e t 2 j since j! > (j/e) j t j n Stirling s approximation ( n 2nπ e ) n <n! < 2nπ ( n e ) n ( + ). 2n Gamma function Γ(x +)x Γ(x) forx>andγ(/2) π.
39 Characteristic functions of some known distributions implies that ϕ X (t) (it) k E[X k ] k! (it) k ( 2 (k 2)/2 ( + ( ) k ) )Γ((k +)/2) k! π ( ) j ( 2 j ) Γ((2j +)/2) t 2j (2j)! π ( ) j ( ) t2 e t2 /2. j! 2 k k j j
40 Characteristic functions of some known distributions Uniform: First, f X (x) for <x<. ϕ X (t) eit. it sin(t/2) sin(s) ϕ X (t) dt dt 4 ds. t/2 s Hence, f X (x) cannot be recovered from 2π ϕ X(t)e itx dt, and is not uniformly continuous as it has jumps at x andx. In addition, lim n implies that t n E[ X n ] n! lim n t n (/(n +)) n! (it) k ϕ X (t) E[X k ] k! k (it) k ( ) k! k + k (it) k+ ( it (k +)! k lim n ) eit. it t n (n +)!
41 Characteristic functions of some known distributions 26-4 Exponential: First, f X (x) e x for <x<. ϕ X (t) it. it dt dt 2 +t 2 ϕ X(t)e itx dt, and is not uni- Hence, f X (x) cannot be recovered from 2π formly continuous as it has a jump at x. In addition, for t <, t n E[ X n ] lim n n! ( E[e tx ] e t x e x dx implies that for t <, (it) k ϕ X (t) E[X k ] k! k lim n t n n! n! k dt. +t 2 lim n t n e ( t )x dx ) t < (it) k (k!) k! k (it) k it.
42 Characteristic functions of some known distributions 26-4 f X (x) Double exponential (Bilateral exponential): 2 e x for <x<. ϕ X (t) +t 2. First, +t 2 dt π<. Hence, f X (x) can be recovered from 2π ϕ X(t)e itx dt, and also is uniformly continuous. But it is not differentiable at x. (Check tail of ϕ(t)!) In addition, for t <, t n E[ X n ] lim n n! ( E[e tx ] implies that for t <, (it) k ϕ X (t) E[X k ] k! k e t x 2 e x dx t n (n!) lim n n! (it) k k k! lim n t n e ( t )x dx t < ( ) 2 ( + ( )k )k! ) (it) 2j +t 2. j
43 Characteristic functions of some known distributions Cauchy: First, f X (x) π( + x 2 ) ϕ X (t) e t. for <x<. e t dt 2 <. Hence, f X (x) can be recovered from 2π ϕ X(t)e itx dt, and is uniformly continuous and differentiable (for ϕ X (t) decays very fast at t and hence f X (x) isverysmooth). In addition, t n E[ X n ] lim n n! {, for t > ; indeterminate, for t, (due to the indeterminate of ) and ϕ X (t) exhibits no Taylor-expansion expression.
44 Characteristic functions of some known distributions Triangular: Notably, f X (x) x for <x<. ( ) cos(t) ϕ X (t) 2. Hence, f X (x) can be recovered from 2π t 2 2 cos(t) t 2 dt 2π<. ϕ X(t)e itx dt, and also is uniformly continuous. But it is not differentiable at x,,. (Check tail of ϕ(t)!) In addition, t n E[ X n ] lim n n! implies that (it) k ϕ X (t) k! k lim n t n (2/[(n +2)(n +)]) n! E[X k ] k lim n (it) k ( ) +( ) k 2 k! (k +)(k +2) 2 t n (n +2)! j ( ) j (t 2 ) j (2j +2)! 2 cos(t) t 2.
45 Characteristic functions of some known distributions No name: Notably, f X (x) ( ) cos(x) for <x<. π x 2 ϕ X (t) ( t )I (,) (t). ( t )I(,) (t) dt <. Hence, f X (x) can be recovered from 2π ϕ X(t)e itx dt, and also is uniformly continuous and differentiable (for ϕ X (t) decays very, very fast at t,and hence f X (x) has all orders of derivatives and is very, very smooth). In addition, E[ X n ] for n 3; hence, t n E[ X n ] lim n n! {, for t > ; indeterminate, for t, and ϕ X (t) exhibits no Taylor-expansion expression.
46 Continuity theorem Theorem 26.3 (Continuity theorem) Proof: X n X if, and only if, ϕ Xn (t) ϕ X (t) for every t R.. X n X implies ϕ Xn (t) n ϕ X (t). Theorem 25.8 (A rephrased version) The following two conditions are equivalent. F n F ; lim f(x)df n (x) f(x)df (x) for every bounded, continuous n R R real function f. From Theorem 25.8, X n X implies that cos(tx)df Xn (x) lim n R R cos(tx)df X (x) and lim sin(tx)df Xn (x) sin(tx)df X (x). n R R These two jointly give that ϕ Xn (t) n ϕ X (t).
47 Continuity theorem ϕ Xn (t) n ϕ X (t) implies X n X. We will first show that ϕ Xn (t) n ϕ X (t) implies {X n } n (or equivalently, {F n } n }) is tight. Then, by Helly s Theorem, there exists a subsequence {X nk } k such that X nk Y,whereY is a random variable with legitimate cdf F Y ( ). Theorem 25.9 (Helly s theorem) For every sequence {F n } n of distribution functions, there exists a subsequence {F nk } k and a non-decreasing, right-continuous function F (not necessarily a cdf) such that lim F n k k (x) F (x) for every continuous points of F. Theorem 25. (rephrased version) Tightness of {F nk } k is a necessary and sufficient condition for the limit F ( ) in Helly s theorem to be a cdf. Definition (tightness) A sequence of cdf s is said to be tight if for any ε>, there exist x and y such that F n (x) <εand F n (y) > ε for all sufficiently large n.
48 Continuity theorem By Fubini s theorem, u u u ( ϕ Xn (t)) dt u u u u ( ) ( e itx )df n (x) dt ( u ) ( e itx )dt df n (x) ( u sin(ux) ) 2 df n (x) ux (This shows that u u u ( ϕ X n (t)) dt is a non-negative real number.) ( 2 sin(ux) ) df n (x) (since sin(ux) ) [ x 2/u] ux ux ( 2 ) df n (x) [ x 2/u] ux df n (x) [ x 2/u] [ Pr X n 2 ]. u
49 Continuity theorem Checking for Fubini s theorem: u u e itx df n (x)dx u u 2dx 4u<. With the above inequality, we next prove that the sequence of probability measures {F Xn } n is tight. Fix an ε>. Since ϕ X (t) is (uniformly) continuous and ϕ X (), there exists u (small enough) such that u u u ( ϕ X (t))dt < ε 2. Continuity at t means that for ε/4 >, there exists u > such that ϕ X (t) <ε/4for u t u. By bounded convergence theorem, u u u ( ϕ Xn (t))dt n u u u ( ϕ X (t))dt.
50 Continuity theorem Hence, there exists N such that for n>n, u u u ( ϕ Xn (t))dt < ε, which by the previously obtained inequality confirms that [ Pr X n > 2 ] <εfor all n N, u namely, {F Xn } n is tight. Now suppose that X nk Y for some Y. Then, by the first part of the proof, we obtain that for every t, However, we are given that for every t, ϕ Xnk (t) k ϕ Y (t). ϕ Xnk (t) k ϕ X (t). These two limits should coincide in every t, i.e., ϕ X (t) ϕ Y (t). We can then infer by the Uniqueness Theorem that X nk X.
51 Continuity theorem 26-5 Theorem 26.2 (Uniqueness theorem) For any a and b with Pr[X a] Pr[X b] anda<b, Pr[a <X b] lim T 2π T T e ita e itb ϕ X (t)dt, it where ϕ X (t) is the characteristic function of random variable X. In fact, we know by ϕ Xn (t) n ϕ X (t) and the Uniqueness Theorem that for every subsequence {n j } j satisfying that {X nj } j converges in distribution to some limiting random variable, this limiting random variable should be X. Finally, we will prove X n X by contradiction. Suppose X n does not converge in distribution to X. Then, there exists x with Pr[X x] suchthat Pr[X n x] Pr[X x], which implies the existence of subsequence {n j } j such that lim inf Pr[Xnj x] Pr[X x] >. j
52 Continuity theorem 26-5 However, for this {X nj } j, we can find a further subsequence such that X nj X. Thiscontradictsto k lim inf Pr[Xnj x] Pr[X x] >. j We therefore obtain the desired contradiction.
53 Continuity theorem The next two corollaries can be proved similarly using the above proof. But their statements could be more useful in applications. Corollary Suppose a sequence of characteristic functions {ϕ n (t)} n has limits in every t, namely lim t ϕ n (t) exists for every t. Define g(t) lim t ϕ n (t). Then if g(t) is continuous at t, then there exists a probability measure µ such that µ n µ, and µ has characteristic function g where µ n is the probability measure corresponding to characteristic function ϕ n ( ). Proof: Notably, in the second part of the proof (i.e, the proof of the tightness of {µ n } n ), the only condition required is that g(t) (i.e., ϕ X(t) in the previous proof) is continuous at t andg(). So the same proof can be used to show this corollary.
54 Continuity theorem In the proof, the continuity of g was used to establish tightness. Hence, if {F X n} n is assumed tight in the first place, then the corollary apparently holds. Corollary 2 Suppose a sequence of characteristic functions {ϕ n (t)} n has limits in every t, namely lim t ϕ n (t) exists for every t. Define g(t) lim ϕ Xn (t). t Then if {µ n } n is tight, then there exists a probability measure µ such that µ n µ, and µ has characteristic function g where µ n is the probability measure corresponding to characteristic function ϕ n ( ). Observation If {X n } n is uniformly bounded, then {F X n } n is tight.
55 Continuity theorem Example 26.2 Let X n be uniformly distributed over ( n, n). Then ϕ Xn (t) n n e itx sin(nt) dx. 2n nt Hence, the limit of ϕ Xn (t) exists, and is equal to: { sin(nt), if t ; g(t) lim ϕ Xn (t) lim n n nt lim lim cos(nt), if t n t In this example, {F Xn } n is not tight, and as expected, g( ) is not continuous at t. {, if t ;, if t Notably, the probability measures of X n s converges vaguely to all-zero measure. Actually, g(t) cannot be obtained by integrating e itx with respect to the true allzero-measure for x R, but a (bizarre) measure that is zero everywhere and integrates to over the entire range. Hence, I put double quotation mark here to indicate it is not the usual all-zero measure.
56 Applying Fourier series to probabilities Theorem Suppose the support of the distribution of random variable X is contained in [, 2π]. Then b Pr[a <X b] lim σ m (t)dt, m a if Pr[X a] Pr[X b] and<a<b<2π, where σ m (t) 2π sin 2 [m(x t)/2] 2πm sin 2 [(x t)/2] df X(x). Proof: By Fubini s theorem, b b ( 2π sin 2 ) [m(x t)/2] σ m (t)dt a a 2πm sin 2 [(x t)/2] df X(x) dt 2π ( b sin 2 ) [m(x t)/2] 2πm a sin 2 [(x t)/2] dt df X (x) 2π ( b sin 2 ) [m(t x)/2] 2πm a sin 2 [(t x)/2] dt df X (x) 2π ( b x sin 2 ) (ms/2) 2πm sin 2 (s/2) ds df X (x). a x
57 Applying Fourier series to probabilities By dominated convergence theorem, for any δ (, 2π), sin 2 (ms/2) lim m 2πm sin 2 (s/2) ds 2π sin 2 (s/2) δ< s <2π δ< s <2π ( lim m It can be shown (cf. the next slide) that for integer m, π sin 2 (ms/2) 2πm π sin 2 (s/2) ds ( π m ) l e isk ds m 2πm π 2πm l k l l l m l Hence, m 2πm l 2πm s δ k l 2sin(kπ) k m sin 2 (ms/2) m sin 2 ds, (s/2) which implies that (note: 2π <a x<b x<2π) lim m ( b x 2πm a x sin 2 ) (ms/2) sin 2 (s/2) ds l k l, if a x>;, if a x< <b x;, if b x< sin 2 ) (ms/2) ds. m l k l sin(kπ) kπ π π. e isk ds {, if x<aor x>b;, if a<x<b.
58 Applying Fourier series to probabilities m l l k l e isk m l e is e is e is e isl ( e is(2l+) ) e is ( m l e ism ( e ism ) 2 e is ( e is ) 2 e isl m l e is(l+) ) ( e ism e eis ( e ism ) ) is e ( is e is(m ) ( e ism ) eis ( e ism ) e is e is sin2 (ms/2) sin 2 (s/2). ) As Pr[X a] Pr[X b], we obtain from dominated convergence theorem that b 2π ( b x sin 2 ) (ms/2) lim σ m (t)dt lim m a m 2πm a x sin 2 (s/2) ds df X (x) Pr[a<X<b].
59 Applying Fourier series to probabilities Discussions: Following from the previous theorem, the Fourier coefficients are defined by: c m 2π e imx df X (x) form, ±, ±2,. {c m } m,±,±2,... canbeviewedasthevalues of the characteristic function for integer arguments. In other words, c m ϕ X (m), where Notably, σ m (t) 2πm 2πm 2π 2π m ϕ X (t) 2π e itx df X (x). sin 2 [m(x t)/2] sin 2 [(x t)/2] df X(x) l l k l e i(x t)k df X (x) m 2πm l l c k e itk. k l
60 Applying Fourier series to probabilities Hence, the distribution of a random variable with support contained in [, 2π] can be uniquely determined by the samples of ϕ X (t), namely {ϕ X (m)} m,±,±2,.... Trivial Extension: The distribution of a random variable with bounded support can be uniquely determined by the samples of its characteristic function (if with a properly selected sampling period). A drawback of using samples to determine the distribution with bounded support is that the probability masses at two end points are undetermined. In other words, using the above theorem as an example, we can have two distinct distributions with equal positive Pr[X ]+Pr[X 2π] >, but their samples are identical. Example Pr[X ]Pr[Y 2π]. Then ϕ X (t) E[e itx ]andϕ Y (t) E[e ity ]e i2πt. However, for every integer m, ϕ X (m) ϕ Y (m) e i2πm. Observation Distributions with the same Pr[X ]+Pr[X 2π] are indistinguishable using the approach of Fourier series.
61 Applying Fourier series to probabilities 26-6 Corollary Suppose the support of the distribution of random variable X is contained in [, 2π]. Then for <a<b<2π, 2 Pr[X a]+pr[a<x<b]+ Pr[X b] lim 2 m b a σ m (t)dt. Proof: Since sin 2 (ms/2)/sin 2 (s/2) is a bounded even function, Hence, 2πm 2πm π π sin 2 (ms/2) sin 2 (s/2) ds 2πm sin 2 (ms/2) sin 2 (s/2) ds π 2πm π sin 2 (ms/2) sin 2 (s/2) ds. sin 2 (ms/2) sin 2 (s/2) ds 2,
62 Applying Fourier series to probabilities 26-6 which implies that lim m ( b x 2πm a x Accordingly, the corollary holds. sin 2 ) (ms/2) sin 2 (s/2) ds, if a x>; 2, if a x ;, if a x< <b x;, if b x ; 2, if b x<, if x<aor x>b; 2, if x a or x b;, if a<x<b. Theorem Suppose {X n } n have supports in [, 2π], and suppose the mth Fourier coefficient c m (n) ofx n converges to c m.then X n X, where X is the distribution determined through {c m } m integer. The distribution of X is unique except possiblely in the way the mass on {, 2π} is split on the points of and 2π. Proof: Note that a sequence of random variables is tight, if their supports are uniformly bounded.
63 Uniformly distributed modulo Give a sequence of real numbers x,x 2,x 3,... Let the probability measure µ n put masses /n at points 2π (x k x k ). Let the probability measure µ be uniformly distributed over (, 2π]. Hence, and c m c m (n) 2π 2π e imx µ(dx) 2π e imx µ n (dx) n 2π n e i2πm(x k x k ), k e imx dx {, if m ;, if m. Therefore, µ n µ, if for m, n n k e i2πm(x k x k ) n. This is named Weyl s criterion.
64 Uniformly distributed modulo Now if x k kθ, whereθ is irrational, then e i2πmθ form,and n e i2πm(x k x k ) n e i2πm(kθ kθ ) n n k n k n k e i2πmkθ ei2πmθn ei2πmθ n e i2πmθ ei2πmθeiπmθn (e iπmθn e iπmθn ) n e iπmθ (e iπmθ e iπmθ ) iπmθ(n+) sin(πmθn) e n sin(πmθ) n.
65 Fourier Transform Question: Is (inverse) Fourier transform always continuous, just like the characteristic function? Answer: No. Think of the (inverse) Fourier transform of sin(x)/x., if t > ; sin(x) π x eitx dx, if t ; 2 π, if t <. If f(x) dx <, then the (inverse) Fourier transform is uniformly continuous. e i(t+h)x f(x)dx e itx f(x)dx (e ihx )e itx f(x)dx (e ihx ) e itx f(x) dx (e ihx ) f(x) dx ( ) f(x) dx (e ihx ) df (x), where df (x) f(x) dx/ ( f(x) dx).
66 Fourier Transform Question: Does (inverse) Fourier transform has Taylor expansion? Answer: This section learns us that if t n R. lim x n f(x) dx,or n n! 2. e t x f(x) dx <, R then Fourier transform has Taylor expansion at t. We also learn that even if Fourier transform does not equal its infinite Taylor sum, we can still express it in partial Taylor sum up to order n, if x n f(x) dx <. R
67 Fourier Transform Question: Does (inverse) Fourier transform has derivatives? Answer: If x n f(x) dx <, R then Fourier transform has kth derivatives at t forallk n. More can be established through the lessen from this section!
Characteristic Functions and the Central Limit Theorem
Chapter 6 Characteristic Functions and the Central Limit Theorem 6.1 Characteristic Functions 6.1.1 Transforms and Characteristic Functions. There are several transforms or generating functions used in
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 informationthe convolution of f and g) given by
09:53 /5/2000 TOPIC Characteristic functions, cont d This lecture develops an inversion formula for recovering the density of a smooth random variable X from its characteristic function, and uses that
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 informationGrading: 1, 2, 3, 4, 5 (each 8 pts) e ita R. e itx dµ(x)dt = 1 2T. cos(t(x a))dt dµ(x) T (x a) 1 2T. cos(t(x a))dt =
Grading:, 2, 3, 4, 5 (each 8 pts Problem : Since e ita =, by Fubini s theorem, I T = e ita ϕ(tdt = e ita e itx dµ(xdt = e it(x a dtdµ(x. Since e it(x a = cos(t(x a + i sin(t(x a and sin(t(x a is an odd
More informationX n D X lim n F n (x) = F (x) for all x C F. lim n F n(u) = F (u) for all u C F. (2)
14:17 11/16/2 TOPIC. Convergence in distribution and related notions. This section studies the notion of the so-called convergence in distribution of real random variables. This is the kind of convergence
More informationChapter 6. Characteristic functions
Chapter 6 Characteristic functions We define the characteristic function of a random variable X by ' X (t) E e x for t R. Note that ' X (t) R e x P X (dx). So if X and Y have the same law, they have the
More informationd(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N
Problem 1. Let f : A R R have the property that for every x A, there exists ɛ > 0 such that f(t) > ɛ if t (x ɛ, x + ɛ) A. If the set A is compact, prove there exists c > 0 such that f(x) > c for all x
More informationReview Sol. of More Long Answer Questions
Review Sol. of More Long Answer Questions 1. Solve the integro-differential equation t y (t) e t v y(v)dv = t; y()=. (1) Solution. The key is to recognize the convolution: t e t v y(v) dv = e t y. () Now
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 informationLecture 4: Fourier Transforms.
1 Definition. Lecture 4: Fourier Transforms. We now come to Fourier transforms, which we give in the form of a definition. First we define the spaces L 1 () and L 2 (). Definition 1.1 The space L 1 ()
More informationAdvanced Calculus Math 127B, Winter 2005 Solutions: Final. nx2 1 + n 2 x, g n(x) = n2 x
. Define f n, g n : [, ] R by f n (x) = Advanced Calculus Math 27B, Winter 25 Solutions: Final nx2 + n 2 x, g n(x) = n2 x 2 + n 2 x. 2 Show that the sequences (f n ), (g n ) converge pointwise on [, ],
More informationMathematical Methods for Physics and Engineering
Mathematical Methods for Physics and Engineering Lecture notes for PDEs Sergei V. Shabanov Department of Mathematics, University of Florida, Gainesville, FL 32611 USA CHAPTER 1 The integration theory
More informationNotes on uniform convergence
Notes on uniform convergence Erik Wahlén erik.wahlen@math.lu.se January 17, 2012 1 Numerical sequences We begin by recalling some properties of numerical sequences. By a numerical sequence we simply mean
More informationFourier Series. 1. Review of Linear Algebra
Fourier Series In this section we give a short introduction to Fourier Analysis. If you are interested in Fourier analysis and would like to know more detail, I highly recommend the following book: Fourier
More informationAn idea how to solve some of the problems. diverges the same must hold for the original series. T 1 p T 1 p + 1 p 1 = 1. dt = lim
An idea how to solve some of the problems 5.2-2. (a) Does not converge: By multiplying across we get Hence 2k 2k 2 /2 k 2k2 k 2 /2 k 2 /2 2k 2k 2 /2 k. As the series diverges the same must hold for the
More information1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer 11(2) (1989),
Real Analysis 2, Math 651, Spring 2005 April 26, 2005 1 Real Analysis 2, Math 651, Spring 2005 Krzysztof Chris Ciesielski 1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer
More informationContinuity. Chapter 4
Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of
More information18.175: Lecture 8 Weak laws and moment-generating/characteristic functions
18.175: Lecture 8 Weak laws and moment-generating/characteristic functions Scott Sheffield MIT 18.175 Lecture 8 1 Outline Moment generating functions Weak law of large numbers: Markov/Chebyshev approach
More informationLecture 32: Taylor Series and McLaurin series We saw last day that some functions are equal to a power series on part of their domain.
Lecture 32: Taylor Series and McLaurin series We saw last day that some functions are equal to a power series on part of their domain. For example f(x) = 1 1 x = 1 + x + x2 + x 3 + = ln(1 + x) = x x2 2
More informationMATH 5640: Fourier Series
MATH 564: Fourier Series Hung Phan, UMass Lowell September, 8 Power Series A power series in the variable x is a series of the form a + a x + a x + = where the coefficients a, a,... are real or complex
More informationAnalysis Qualifying Exam
Analysis Qualifying Exam Spring 2017 Problem 1: Let f be differentiable on R. Suppose that there exists M > 0 such that f(k) M for each integer k, and f (x) M for all x R. Show that f is bounded, i.e.,
More informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
More informationbe the set of complex valued 2π-periodic functions f on R such that
. Fourier series. Definition.. Given a real number P, we say a complex valued function f on R is P -periodic if f(x + P ) f(x) for all x R. We let be the set of complex valued -periodic functions f on
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 informationMath 4263 Homework Set 1
Homework Set 1 1. Solve the following PDE/BVP 2. Solve the following PDE/BVP 2u t + 3u x = 0 u (x, 0) = sin (x) u x + e x u y = 0 u (0, y) = y 2 3. (a) Find the curves γ : t (x (t), y (t)) such that that
More informationSequences and Series of Functions
Chapter 13 Sequences and Series of Functions These notes are based on the notes A Teacher s Guide to Calculus by Dr. Louis Talman. The treatment of power series that we find in most of today s elementary
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 informationReal Analysis Problems
Real Analysis Problems Cristian E. Gutiérrez September 14, 29 1 1 CONTINUITY 1 Continuity Problem 1.1 Let r n be the sequence of rational numbers and Prove that f(x) = 1. f is continuous on the irrationals.
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 informationh(x) lim H(x) = lim Since h is nondecreasing then h(x) 0 for all x, and if h is discontinuous at a point x then H(x) > 0. Denote
Real Variables, Fall 4 Problem set 4 Solution suggestions Exercise. Let f be of bounded variation on [a, b]. Show that for each c (a, b), lim x c f(x) and lim x c f(x) exist. Prove that a monotone function
More information11.8 Power Series. Recall the geometric series. (1) x n = 1+x+x 2 + +x n +
11.8 1 11.8 Power Series Recall the geometric series (1) x n 1+x+x 2 + +x n + n As we saw in section 11.2, the series (1) diverges if the common ratio x > 1 and converges if x < 1. In fact, for all x (
More informationMath Camp II. Calculus. Yiqing Xu. August 27, 2014 MIT
Math Camp II Calculus Yiqing Xu MIT August 27, 2014 1 Sequence and Limit 2 Derivatives 3 OLS Asymptotics 4 Integrals Sequence Definition A sequence {y n } = {y 1, y 2, y 3,..., y n } is an ordered set
More informationAnalysis Finite and Infinite Sets The Real Numbers The Cantor Set
Analysis Finite and Infinite Sets Definition. An initial segment is {n N n n 0 }. Definition. A finite set can be put into one-to-one correspondence with an initial segment. The empty set is also considered
More informationMath 321 Final Examination April 1995 Notation used in this exam: N. (1) S N (f,x) = f(t)e int dt e inx.
Math 321 Final Examination April 1995 Notation used in this exam: N 1 π (1) S N (f,x) = f(t)e int dt e inx. 2π n= N π (2) C(X, R) is the space of bounded real-valued functions on the metric space X, equipped
More informationLecture 5: Expectation
Lecture 5: Expectation 1. Expectations for random variables 1.1 Expectations for simple random variables 1.2 Expectations for bounded random variables 1.3 Expectations for general random variables 1.4
More informationMATH 202B - Problem Set 5
MATH 202B - Problem Set 5 Walid Krichene (23265217) March 6, 2013 (5.1) Show that there exists a continuous function F : [0, 1] R which is monotonic on no interval of positive length. proof We know there
More informationMath 5587 Midterm II Solutions
Math 5587 Midterm II Solutions Prof. Jeff Calder November 3, 2016 Name: Instructions: 1. I recommend looking over the problems first and starting with those you feel most comfortable with. 2. Unless otherwise
More informationContinuity. Chapter 4
Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of
More informationTaylor and Maclaurin Series
Taylor and Maclaurin Series MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Background We have seen that some power series converge. When they do, we can think of them as
More information1 Review of di erential calculus
Review of di erential calculus This chapter presents the main elements of di erential calculus needed in probability theory. Often, students taking a course on probability theory have problems with concepts
More informationMath212a1413 The Lebesgue integral.
Math212a1413 The Lebesgue integral. October 28, 2014 Simple functions. In what follows, (X, F, m) is a space with a σ-field of sets, and m a measure on F. The purpose of today s lecture is to develop the
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 informationf(x)dx = lim f n (x)dx.
Chapter 3 Lebesgue Integration 3.1 Introduction The concept of integration as a technique that both acts as an inverse to the operation of differentiation and also computes areas under curves goes back
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationINTRODUCTION TO REAL ANALYSIS II MATH 4332 BLECHER NOTES
INTRODUCTION TO REAL ANALYSIS II MATH 433 BLECHER NOTES. As in earlier classnotes. As in earlier classnotes (Fourier series) 3. Fourier series (continued) (NOTE: UNDERGRADS IN THE CLASS ARE NOT RESPONSIBLE
More informationMath 341: Probability Seventeenth Lecture (11/10/09)
Math 341: Probability Seventeenth Lecture (11/10/09) Steven J Miller Williams College Steven.J.Miller@williams.edu http://www.williams.edu/go/math/sjmiller/ public html/341/ Bronfman Science Center Williams
More informationGrade: The remainder of this page has been left blank for your workings. VERSION D. Midterm D: Page 1 of 12
First Name: Student-No: Last Name: Section: Grade: The remainder of this page has been left blank for your workings. Midterm D: Page of 2 Indefinite Integrals. 9 marks Each part is worth marks. Please
More informationFixed Points and Contractive Transformations. Ron Goldman Department of Computer Science Rice University
Fixed Points and Contractive Transformations Ron Goldman Department of Computer Science Rice University Applications Computer Graphics Fractals Bezier and B-Spline Curves and Surfaces Root Finding Newton
More information7 Convergence in R d and in Metric Spaces
STA 711: Probability & Measure Theory Robert L. Wolpert 7 Convergence in R d and in Metric Spaces A sequence of elements a n of R d converges to a limit a if and only if, for each ǫ > 0, the sequence a
More informationIowa State University. Instructor: Alex Roitershtein Summer Homework #5. Solutions
Math 50 Iowa State University Introduction to Real Analysis Department of Mathematics Instructor: Alex Roitershtein Summer 205 Homework #5 Solutions. Let α and c be real numbers, c > 0, and f is defined
More informationConvergence in Distribution
Convergence in Distribution Undergraduate version of central limit theorem: if X 1,..., X n are iid from a population with mean µ and standard deviation σ then n 1/2 ( X µ)/σ has approximately a normal
More informationMetric Spaces. Exercises Fall 2017 Lecturer: Viveka Erlandsson. Written by M.van den Berg
Metric Spaces Exercises Fall 2017 Lecturer: Viveka Erlandsson Written by M.van den Berg School of Mathematics University of Bristol BS8 1TW Bristol, UK 1 Exercises. 1. Let X be a non-empty set, and suppose
More informationSolutions to Chapter 17 exercises
Solutions to Chapter 17 exercises 17.1 Let (x n ) be a Cauchy sequence in a discrete metric space (X, d). There exists N N such that d(x m,x n ) < 1 whenever m>n N,soinfactd(x m,x n ) = whenever m>n N,since
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 informationFrom now on, we will represent a metric space with (X, d). Here are some examples: i=1 (x i y i ) p ) 1 p, p 1.
Chapter 1 Metric spaces 1.1 Metric and convergence We will begin with some basic concepts. Definition 1.1. (Metric space) Metric space is a set X, with a metric satisfying: 1. d(x, y) 0, d(x, y) = 0 x
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 informationIf α is a probability distribution on the line, its characteristic function is defined by
Chapter 2 Weak Convergence 2. Characteristic Functions If α is a probability distribution on the line, its characteristic function is defined by φ(t) = exp[ itx] dα. (2.) The above definition makes sense.
More informationconditional cdf, conditional pdf, total probability theorem?
6 Multiple Random Variables 6.0 INTRODUCTION scalar vs. random variable cdf, pdf transformation of a random variable conditional cdf, conditional pdf, total probability theorem expectation of a random
More informationChapter 6. Integration. 1. Integrals of Nonnegative Functions. a j µ(e j ) (ca j )µ(e j ) = c X. and ψ =
Chapter 6. Integration 1. Integrals of Nonnegative Functions Let (, S, µ) be a measure space. We denote by L + the set of all measurable functions from to [0, ]. Let φ be a simple function in L +. Suppose
More informationMATH 5616H INTRODUCTION TO ANALYSIS II SAMPLE FINAL EXAM: SOLUTIONS
MATH 5616H INTRODUCTION TO ANALYSIS II SAMPLE FINAL EXAM: SOLUTIONS You may not use notes, books, etc. Only the exam paper, a pencil or pen may be kept on your desk during the test. Calculators are not
More informationJUHA KINNUNEN. Partial Differential Equations
JUHA KINNUNEN Partial Differential Equations Department of Mathematics and Systems Analysis, Aalto University 207 Contents INTRODUCTION 2 FOURIER SERIES AND PDES 5 2. Periodic functions*.............................
More informationTHE INVERSE FUNCTION THEOREM
THE INVERSE FUNCTION THEOREM W. PATRICK HOOPER The implicit function theorem is the following result: Theorem 1. Let f be a C 1 function from a neighborhood of a point a R n into R n. Suppose A = Df(a)
More informationMath 172 Problem Set 5 Solutions
Math 172 Problem Set 5 Solutions 2.4 Let E = {(t, x : < x b, x t b}. To prove integrability of g, first observe that b b b f(t b b g(x dx = dt t dx f(t t dtdx. x Next note that f(t/t χ E is a measurable
More informationCHAPTER 6. Limits of Functions. 1. Basic Definitions
CHAPTER 6 Limits of Functions 1. Basic Definitions DEFINITION 6.1. Let D Ω R, x 0 be a limit point of D and f : D! R. The limit of f (x) at x 0 is L, if for each " > 0 there is a ± > 0 such that when x
More informationwhere r n = dn+1 x(t)
Random Variables Overview Probability Random variables Transforms of pdfs Moments and cumulants Useful distributions Random vectors Linear transformations of random vectors The multivariate normal distribution
More information8 Laws of large numbers
8 Laws of large numbers 8.1 Introduction We first start with the idea of standardizing a random variable. Let X be a random variable with mean µ and variance σ 2. Then Z = (X µ)/σ will be a random variable
More informationor E ( U(X) ) e zx = e ux e ivx = e ux( cos(vx) + i sin(vx) ), B X := { u R : M X (u) < } (4)
:23 /4/2000 TOPIC Characteristic functions This lecture begins our study of the characteristic function φ X (t) := Ee itx = E cos(tx)+ie sin(tx) (t R) of a real random variable X Characteristic functions
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 informationNumerical Analysis: Interpolation Part 1
Numerical Analysis: Interpolation Part 1 Computer Science, Ben-Gurion University (slides based mostly on Prof. Ben-Shahar s notes) 2018/2019, Fall Semester BGU CS Interpolation (ver. 1.00) AY 2018/2019,
More informationKatznelson Problems. Prakash Balachandran Duke University. June 19, 2009
Katznelson Problems Prakash Balachandran Duke University June 9, 9 Chapter. Compute the Fourier coefficients of the following functions (defined by their values on [ π, π)): f(t) { t < t π (t) g(t) { t
More informationVectors in Function Spaces
Jim Lambers MAT 66 Spring Semester 15-16 Lecture 18 Notes These notes correspond to Section 6.3 in the text. Vectors in Function Spaces We begin with some necessary terminology. A vector space V, also
More informationFOURIER TRANSFORMS. 1. Fourier series 1.1. The trigonometric system. The sequence of functions
FOURIER TRANSFORMS. Fourier series.. The trigonometric system. The sequence of functions, cos x, sin x,..., cos nx, sin nx,... is called the trigonometric system. These functions have period π. The trigonometric
More informationMath 201 Assignment #11
Math 21 Assignment #11 Problem 1 (1.5 2) Find a formal solution to the given initial-boundary value problem. = 2 u x, < x < π, t > 2 u(, t) = u(π, t) =, t > u(x, ) = x 2, < x < π Problem 2 (1.5 5) Find
More informationSection 21. Expected Values. Po-Ning Chen, Professor. Institute of Communications Engineering. National Chiao Tung University
Section 21 Expected Values Po-Ning Chen, Professor Institute of Communications Engineering National Chiao Tung University Hsin Chu, Taiwan 30010, R.O.C. Expected value as integral 21-1 Definition (expected
More informationEntrance Exam, Real Analysis September 1, 2017 Solve exactly 6 out of the 8 problems
September, 27 Solve exactly 6 out of the 8 problems. Prove by denition (in ɛ δ language) that f(x) = + x 2 is uniformly continuous in (, ). Is f(x) uniformly continuous in (, )? Prove your conclusion.
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 informationFACULTY OF SCIENCE FINAL EXAMINATION MATHEMATICS MATH 355. Analysis 4. Examiner: Professor S. W. Drury Date: Wednesday, April 18, 2007 INSTRUCTIONS
FACULTY OF SCIENCE FINAL EXAMINATION MATHEMATICS MATH 355 Analysis 4 Examiner: Professor S. W. Drury Date: Wednesday, April 18, 27 Associate Examiner: Professor K. N. GowriSankaran Time: 2: pm. 5: pm.
More informationFourier and Partial Differential Equations
Chapter 5 Fourier and Partial Differential Equations 5.1 Fourier MATH 294 SPRING 1982 FINAL # 5 5.1.1 Consider the function 2x, 0 x 1. a) Sketch the odd extension of this function on 1 x 1. b) Expand the
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 informationMathematics of Physics and Engineering II: Homework problems
Mathematics of Physics and Engineering II: Homework problems Homework. Problem. Consider four points in R 3 : P (,, ), Q(,, 2), R(,, ), S( + a,, 2a), where a is a real number. () Compute the coordinates
More informationFinite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product
Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )
More informationClassnotes - MA Series and Matrices
Classnotes - MA-2 Series and Matrices Department of Mathematics Indian Institute of Technology Madras This classnote is only meant for academic use. It is not to be used for commercial purposes. For suggestions
More informationBASICS OF PROBABILITY
October 10, 2018 BASICS OF PROBABILITY Randomness, sample space and probability Probability is concerned with random experiments. That is, an experiment, the outcome of which cannot be predicted with certainty,
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 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 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 informationE[X n ]= dn dt n M X(t). ). What is the mgf? Solution. Found this the other day in the Kernel matching exercise: 1 M X (t) =
Chapter 7 Generating functions Definition 7.. Let X be a random variable. The moment generating function is given by M X (t) =E[e tx ], provided that the expectation exists for t in some neighborhood of
More informationPrinciple of Mathematical Induction
Advanced Calculus I. Math 451, Fall 2016, Prof. Vershynin Principle of Mathematical Induction 1. Prove that 1 + 2 + + n = 1 n(n + 1) for all n N. 2 2. Prove that 1 2 + 2 2 + + n 2 = 1 n(n + 1)(2n + 1)
More informationAnalysis III. Exam 1
Analysis III Math 414 Spring 27 Professor Ben Richert Exam 1 Solutions Problem 1 Let X be the set of all continuous real valued functions on [, 1], and let ρ : X X R be the function ρ(f, g) = sup f g (1)
More informationMath 54: Mock Final. December 11, y y 2y = cos(x) sin(2x). The auxiliary equation for the corresponding homogeneous problem is
Name: Solutions Math 54: Mock Final December, 25 Find the general solution of y y 2y = cos(x) sin(2x) The auxiliary equation for the corresponding homogeneous problem is r 2 r 2 = (r 2)(r + ) = r = 2,
More information1 Taylor-Maclaurin Series
Taylor-Maclaurin Series Writing x = x + n x, x = (n ) x,.., we get, ( y ) 2 = y ( x) 2... and letting n, a leap of logic reduces the interpolation formula to: y = y + (x x )y + (x x ) 2 2! y +... Definition...
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 informationMATH 819 FALL We considered solutions of this equation on the domain Ū, where
MATH 89 FALL. The D linear wave equation weak solutions We have considered the initial value problem for the wave equation in one space dimension: (a) (b) (c) u tt u xx = f(x, t) u(x, ) = g(x), u t (x,
More informationMeasure and Integration: Solutions of CW2
Measure and Integration: s of CW2 Fall 206 [G. Holzegel] December 9, 206 Problem of Sheet 5 a) Left (f n ) and (g n ) be sequences of integrable functions with f n (x) f (x) and g n (x) g (x) for almost
More informationPractice Exercises on Differential Equations
Practice Exercises on Differential Equations What follows are some exerices to help with your studying for the part of the final exam on differential equations. In this regard, keep in mind that the exercises
More informationTHE GAMMA FUNCTION AND THE ZETA FUNCTION
THE GAMMA FUNCTION AND THE ZETA FUNCTION PAUL DUNCAN Abstract. The Gamma Function and the Riemann Zeta Function are two special functions that are critical to the study of many different fields of mathematics.
More informationLecture Characterization of Infinitely Divisible Distributions
Lecture 10 1 Characterization of Infinitely Divisible Distributions We have shown that a distribution µ is infinitely divisible if and only if it is the weak limit of S n := X n,1 + + X n,n for a uniformly
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 information+ 2x sin x. f(b i ) f(a i ) < ɛ. i=1. i=1
Appendix To understand weak derivatives and distributional derivatives in the simplest context of functions of a single variable, we describe without proof some results from real analysis (see [7] and
More information