On the optimality of McLeish s conditions for the central limit theorem

Size: px
Start display at page:

Download "On the optimality of McLeish s conditions for the central limit theorem"

Transcription

1 O the optimality of McLeish s coditios for the cetral limit theorem Jérôme Dedecker a a Laboratoire MAP5, CNRS UMR 845, Uiversité Paris-Descartes, Sorboe Paris Cité, 45 rue des Saits Pères, 7570 Paris cedex 06, Frace. Abstract We costruct a family of statioary ergodic sequeces for which the cetral limit theorem (CLT) does ot hold. These examples show that McLeish s coditios for the CLT are sharp i a precise sese. Résumé Sur l optimalité des coditios de McLeish pour le théorème limite cetral Nous costruisos ue famille de suites strictemet statioaires et ergodiques pour lesquelles le théorème limite cetral a pas lieu. Ces exemples motret que les coditios de McLeish pour le théorème limite cetral sot optimales e u ses précis. Itroductio Let (Ω, A, P) be a probability space, ad let T : Ω Ω be a bijective, bi-measurable trasformatio preservig the probability P. We assume here that the couple (T, P) is ergodic, meaig that ay A A satisfyig T (A) = A has probability 0 or. Let F 0 be a σ-algebra of A satisfyig F 0 T (F 0 ). Let X 0 be a F 0 -measurable, square itegrable ad cetered radom variable, ad defie the statioary sequece (X i ) i Z by X i = X 0 T i. Let the S = X + X + + X, ad for t [0, ], W (t) = S [t] + (t [t])x [t]+. Note that W is a radom variable i the space (C([0, ]), ) of cotiuous bouded fuctios equipped with the uiform metric. The followig weak ivariace priciple (WIP) is essetially due to McLeish [0], Theorem.5. The preset form, which ca be deduced from Haa s criterio [5][6], has bee stated i []. Theorem. Assume that there exists a sequece (a ) 0 of positive umbers such that ( ) a k < ad 0 k=0 a E(X F 0 ) <. () 0 The the series σ = k Z Cov(X 0, X k ) coverges absolutely ad E(S ) coverges to σ. Moreover the process / W coverges i distributio i (C([0, ]), ) to σw, where W is a stadard Wieer process. Remark I [], the ergodicity is ot required, ad Coditio () is show to be sufficiet for the coditioal WIP (which implies the stable covergece i the sese of Réyi []). I [0] the o adapted case is also cosidered (i.e. X 0 is ot supposed to be F 0 -measurable). The o-adapted versio of Theorem. is give i [3]. As quoted i [3], Coditio () holds as soo as E(X F 0 ) <. ()

2 Note that the CLT for / S uder () was already quoted i Aexe A. of my PhD thesis [] (as a cosequece of Heyde s criterio [7]). At that time, my advisor Emmauel Rio asked me whether the CLT could be true if 0 E(X F 0 ) < ad E(S ) σ. The aswer is egative as I poited out i Aexe A.3 of my PhD thesis (this is metioed i Propositio 7 of [] without proof). Recetly, the questio was asked agai by Christophe Cuy at the coferece Des martigales aux systèmes dyamiques held i Mare-la-vallée (October 8-0, 04). O this occasio, I showed him the couterexample of my PhD thesis, ad he coviced me to write a ote o the subject, ad to give a more geeral statemet. As we shall see i Corollary.4, the CLT is ot true eve if a = l( e) i the secod term of (). I would like to thak here Christophe Cuy for his suggestio. To be complete, ote that the coditio 0 E(X F 0 ) < is sufficiet for the CLT whe X = f(y ) is a fuctio of a ormal Markov chai, ad F 0 = σ(y i, i 0): this ca be deduced from [4], as idicated to me by the referee. I would like to thak the referee, who also idicated to me Lemma. below, ad the refereces [8] ad [3]. Mai result ad discussio Let us start with a prelimiary remark. For ay sequece (ψ ) 0 of positive umbers such that 0 ( k=0 ψ k) =, oe ca fid a sequece (u ) 0 of positive umbers such that ( ) u = ad ψ <. (3) 0 0 To see this, ote that the secod coditio i (3) writes also 0 ( k=0 ψ k) u <, ad that the followig lemma holds. Lemma. Let (v ) 0 be a o-decreasig sequece of positive umbers. The 0 v = if ad oly if there exists a sequece (u ) 0 of positive umbers such that 0 u = ad 0 v u <. Proof of Lemma.. If such a (u ) 0 exists, the, writig u = u v / v / ad applyig Cauchy-Schwarz s iequality, we see that 0 v =. For the other implicatio, assume that 0 v = ad let y = k=0 v k ad u = (y v ). Sice (y ) 0 ad (v ) 0 are o-decreasig, oe ca see that u (y v + ) y + y x dx ad v + u + y + y x dx, ad the results follows. k= We are ow i positio to state the mai result of this ote. Theorem. Let (ψ ) 0 be a sequece of positive umbers such that: ψ for ay oegative iteger, ad 0 ( k=0 ψ k) =. For ay sequece (u ) 0 of positive umbers satisfyig (3), there exists a statioary ergodic sequece (X i ) i Z of square itegrable ad cetered radom variables, such that E(X M 0 ) u k for M 0 = σ(x i, i 0), ad lim E(S ) =, (4) k= but the sequece / S does ot coverge i distributio. Remark Note that, by (3) ad the first part of (4), 0 ψ E(X M 0 ) <. Hece, Theorem. shows that the coditios of Theorem. o the sequece (a ) 0 caot be relaxed, if we assume moreover that a for ay oegative iteger. Note that, by defiitio, M 0 = σ(x i, i 0) is the smallest σ-algebra such that X 0 is M 0 -measurable ad M 0 T (M 0 ). u k

3 Remark 3 Oe ca modify the statemet of Theorem. as follows: there exists a statioary ergodic sequece (X i ) i Z of square itegrable ad cetered radom variables, such that the first coditio of (4) holds, but the sequece / S is ot stochastically bouded. It suffices to choose the sequece α i = u i ( [0,/] ]/,] ) i the costructio of Sectio 3. We ow give some examples of weights satisfyig the assumptios of Theorem. or Theorem.. Defiitio.3 For x > 0, let l (x) = l(x e), ad for ay iteger k, defie l k by iductio as follows: for x > 0, l k (x) = l l k (x). For ay positive iteger k ad ay positive umber a, defie the ( k ) L,a (x) = (l (x)) a ad for k >, L k,a (x) = l i (x) (l k (x)) a. The followig corollary is a direct cosequece of Theorem. ad Theorem.. Corollary.4 For ay positive iteger k, the followig statemets hold:. If for some k ad a >, 0 L k,a() E(X F 0 ) <, the Coditio () is satisfied, ad the coclusio of Theorem. holds.. For ay k, there exists a statioary ergodic sequece (X i ) i Z of square itegrable ad cetered radom variables, such that 0 L k,() E(X M 0 ) < for M 0 = σ(x i, i 0) ad E(S ), but the sequece / S does ot coverge i distributio. Let us metio that the couterexample give i Theorem. is differet from the couterexample of Peligrad ad Utev []. I Theorem. of their paper, they show that, for ay sequece c 0, there exists a statioary ergodic sequece (X i ) i Z of square itegrable ad cetered radom variables (i their example X i = g(y i ) where Y i is a coutable Markov chai ad F 0 = σ(y i, i 0)) such that E(S F 0 ) c <, (5) 3/ = but / S is ot stochastically bouded. This proves that the coditio of Maxwell ad Woodroofe [9] (Coditio (5) with c ) for the CLT ad the WIP (see agai [] for the WIP) is sharp (ote that () also implies Maxwell-Woodroofe s coditio). The couterexample of Peligrad ad Utev is differet from ours because firstly we deal with the quatity E(X F 0 ) istead of E(S F 0 ), ad secodly i our case E(S ) which implies the stochastic boudedess of / S. I the paper [3], there is a example of a statioary ergodic sequece such that E(S F 0 ) = o( / l()) ad the CLT fails, but agai the variace does ot grow liearly. I [8] there is a example for which E(S F 0 ) = o( / l()) ad E(S ) ad the CLT fails. I Remark of [8] the authors ask the followig questio: does E(S F 0 ) = o( / l()) ad E(S ) imply the CLT? Thaks to Theorem. we are able to give a egative aswer to this questio: it suffices to take ψ ad u = (L, ()), which implies that E(X F 0 ) = o( / / l()). Note that this also proves that coditio () is sharp. 3 The couterexamples For i Z, let F i = T i (F 0 ), F = i Z F i, ad for i, k Z, let P i (X k ) = E(X k F i ) E(X k F i ). Clearly, if E(X 0 F ) = 0 almost surely, the E(X k F 0 ) = i 0 P i(x k ). The radom variables P i (X k ), P j (X k ) beig orthogoal if i j, Pythagoras s theorem ad the statioarity imply that E(X F 0 ) = P 0 (X i ). (6) 3 k= i=

4 The costructio of the sequeces (X i ) i Z is based o the followig lemmas (proofs i Sectio 4). Lemma 3. Let T p, = p+ i=p P p(x i ). If 0 E(X F 0 ) <, the E(S F 0 ) lim = 0 ad lim S T p, = 0. (7) p= Lemma 3. Let (H, H ) be a ifiite dimesioal Hilbert space. Let (u ) 0 be a sequece of positive umbers such that 0 u = ad u 0. There exists a icreasig sequece of positive itegers (t i ) i 0 such that: for ay orthoormal family (e i ) i 0 i H, there exists a sequece (h i ) i 0 satisfyig h ti = e i, h j h j H u j for ay j, (8) ad for t i < j < t i+, h j = b j e i + c j e i+ with b j + c j =. Let us ow costruct the sequece (X i ) i Z of Theorem.. Let λ be the Lebesgue measure over [0, ], ad let B be the σ-algebra of Borel sets of [0, ]. We deote by X the probability space X = ([0, ], B, λ). Let (ψ ) 0 ad (u ) 0 be two sequeces as i Theorem.. Let (α i ) i 0 be a sequece of fuctios i H = L (X ) (to be chose latter) such that λ(α i ) = 0, α i = ad α i u i. (9) i=0 We cosider the space Ω = X Z ad the probabilty P = λ Z. The trasformatio T is the shift o Ω defied by (T (ω)) i = ω i+. Clearly P is ivariat by T ad the couple (T, P) is ergodic. Startig from the sequece (α i ) i 0 ad from the projectios π j (ω) = ω j, we defie the sequece (A i ) i 0 of fuctios of L (P) by: A i = α i π 0. The sequece (X i ) i Z is the defied by: X 0 = A j T j = α j π j ad X i = X 0 T i = A j T i j. (0) j=0 j=0 Note that these series are well defied i L (P) because (A j T i j ) j 0 is a sequece of idepedet radom variables ad j 0 A j T i j = j 0 α j j 0 u j <. Let F i = σ(π j, j i). Clearly, X 0 is F 0 -measurable ad F is P-trivial by the 0 law. With the otatios of the begiig of this sectio, we have P 0 (X i ) = A i for ay positive iteger i. Hece, it follows from (6) ad (9) that E(X F 0 ) k u k. Note that this is also true with the σ-algebra M 0 = σ(x i, i 0), ad the first coditio of (4) is satisfied. O the other had T p, = p+ i=p P p(x i ) = i=0 A i T p. Hece, the sequece (T p, ) p is i.i.d. ad p= T p, j=0 = T 0, = α i =, () where the last equality follows from (9). Applyig Lemma 3., we ifer that lim E(S ) =, ad (4) is fully satisfied. It remais to choose α i i such a way that / S does ot coverge i distributio. To do this, we use Lemma 3. with a appropriate orthoormal family (e i ) i 0 of L (X ). Let first f = ( [0, [ [, [) ad g = i=0 ( [k/ +,(k+)/ + [ [(k+)/ +,(k+)/ + [). k=0 4

5 Let (t i ) i 0 be the sequece of Lemma 3., ad defie e i = f ti ad e i+ = g ti+. Now, we put α 0 = h 0 ad for i > 0, α i = h i h i, where (h i ) i 0 is the sequece of Lemma 3.. Applyig Lemma 3., we see that (α i ) i 0 satisfies (9). By costructio t i=0 α i = f t ad t + i=0 α i = g t+. Let us check that the two sequeces t / S t ad t / + S t + coverge i distributio to two distict laws. By Lemma 3. it is equivalet to cosider the two sequeces t / t / + t+ p= T p,t +. Now ( ( )) ix t E exp T p,t = t p= ( ( ( ))) ( ( ( t ixft λ exp = cos x t t t p= T p,t ad )))t t. t Cosequetly lim E(exp(ixt / S t )) =, provig that the sequece t / S t coverges i distributio to the Dirac mass at 0. O the other had, the radom variables (T i,t+ ) i t+ are idepedet cetered Rademacher radom variables, so that t / + coverges i distributio to a stadard ormal. coverge i distributio. 4 Proofs of Lemmas 3. ad 3. t+ p= T p,t + ad t / + S t + As a coclusio, the sequece / S does ot Proof of Lemma 3.. We begi with the first part of (7). Sice for ay positive iteger m, the sequece / E(S m F 0 ) coverges to 0 as teds to ifiity, it suffices to prove that lim sup E(S S m F 0 ) = 0. () m >m Now E(S S m F 0 ) = i=m j=m E (E(X i F 0 )E(X j F 0 )) i=m E(X i F 0 ), where the last boud holds because E (E(X i F 0 )E(X j F 0 )) E(X i F 0 ) E(X j F 0 ) E(X i F 0 ) as soo as j i. Hece, () follows easily from the fact that 0 E(X F 0 ) <. We ow prove the secod part of (7). Let S p, = i=p P p(x i ). By orthogoality ad statioarity, oe successively derives S E(S F 0 ) T p, p= = S p, p= = p= i=+ p T p, = p= P 0 (X i ) = p= p= P p (X i ) P 0 (X i ). (3) p+ i=+ Let β p = i=p i P 0(X i ) (which is fiite because of (6) ad the fact that 0 E(X F 0 ) < ). Usig Cauchy-Schwarz s iequality i l, we get P 0 (X i ) p= i=p p= β p = i i=p i= ( i i=p ) i β p, ad the last term coverges to zero as, by usig Cesàro s lemma ad the fact that β 0. Together with (3) ad the first part of (7), this completes the proof of the secod part of (7). p= 5

6 Proof of Lemma 3.. Let (u ) 0 be as i Lemma 3. (without loss of geerality, assume that u < π/ for ay positive iteger ). Defie the the icreasig sequece (t i ) i 0 by iductio : t 0 = 0, ad t i+ is the uique > t i + such that k=t i+ u k < π k=t i+ u k. The fuctio h j is the defied by h ti = e i ad, for t i < j < t i+, ( j ) ( j ) h j = cos u k e i + si u k e i+. k=t i+ k=t i+ By costructio h j, h j cos(u j ). Hece h j h j H ( cos(u j)) u j. Refereces [] J. Dedecker, Pricipes d ivariace pour les champs aléatoires statioaires, Thèse 555, Uiversité Paris Sud, (998). [] J. Dedecker, F. Merlevède, Necessary ad sufficiet coditios for the coditioal cetral limit theorem, A. Probab. 30 (00) [3] J. Dedecker, F. Merlevède, D. Volý, O the weak ivariace priciple for o-adapted sequeces uder projective criteria, J. Theoret. Probab. 0 (007) [4] M. I. Gordi, B. A. Lifšic, A remark about a Markov process with ormal trasitio operator, Third Vilius coferece o probability ad statistics, (98) [5] E. J. Haa, Cetral limit theorems for time series regressio, Z. Wahrsch. verw. Gebiete 6 (973) [6] E. J. Haa, The cetral limit theorem for time series regressio, Stoch. Processes Appl. 9 (979) [7] C. C. Heyde, O the cetral limit theorem for statioary processes, Z. Wahrsch. verw. Gebiete. 30 (974) [8] J. Klicarová, D. Volý, O the exactess of the Wu-Woodroofe approximatio, Stoch. Processes Appl. 9 (009) [9] M. Maxwell, M. Woodroofe, Cetral limit theorem for additive fuctioals of Markov chais, A. Probab. 8 (000) [0] D. L. McLeish, Ivariace priciples for depedet variables, Z. Wahrsch. Verw. Gebiete 3 (975) [] M. Peligrad, S. Utev, A ew maximal iequality ad ivariace priciple for statioary sequeces, A. Probab. 33 (005) [] A. Réyi, O stable sequeces of evets, Sakhyā Ser. A, 5 (963) [3] D. Volý, Martigale approximatio ad optimality of some coditios for the cetral limit theorem, J. Theoret. Probab. 3 (00)

Convergence of random variables. (telegram style notes) P.J.C. Spreij

Convergence of random variables. (telegram style notes) P.J.C. Spreij Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space

More information

Erratum to: An empirical central limit theorem for intermittent maps

Erratum to: An empirical central limit theorem for intermittent maps Probab. Theory Relat. Fields (2013) 155:487 491 DOI 10.1007/s00440-011-0393-0 ERRATUM Erratum to: A empirical cetral limit theorem for itermittet maps J. Dedecker Published olie: 25 October 2011 Spriger-Verlag

More information

On the weak invariance principle for non adapted sequences under projective criteria.

On the weak invariance principle for non adapted sequences under projective criteria. O the weak ivariace priciple for o adapted sequeces uder projective criteria. Jérôme Dedecker, Florece Merlevède, Dalibor Voly To cite this versio: Jérôme Dedecker, Florece Merlevède, Dalibor Voly. O the

More information

Diagonal approximations by martingales

Diagonal approximations by martingales Alea 7, 257 276 200 Diagoal approximatios by martigales Jaa Klicarová ad Dalibor Volý Faculty of Ecoomics, Uiversity of South Bohemia, Studetsa 3, 370 05, Cese Budejovice, Czech Republic E-mail address:

More information

7.1 Convergence of sequences of random variables

7.1 Convergence of sequences of random variables Chapter 7 Limit Theorems Throughout this sectio we will assume a probability space (, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite

More information

7.1 Convergence of sequences of random variables

7.1 Convergence of sequences of random variables Chapter 7 Limit theorems Throughout this sectio we will assume a probability space (Ω, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite

More information

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014. Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the

More information

1 Convergence in Probability and the Weak Law of Large Numbers

1 Convergence in Probability and the Weak Law of Large Numbers 36-752 Advaced Probability Overview Sprig 2018 8. Covergece Cocepts: i Probability, i L p ad Almost Surely Istructor: Alessadro Rialdo Associated readig: Sec 2.4, 2.5, ad 4.11 of Ash ad Doléas-Dade; Sec

More information

Necessary and sufficient conditions for the conditional central limit theorem

Necessary and sufficient conditions for the conditional central limit theorem Necessary ad sufficiet coditios for the coditioal cetral it theorem Jérôme DEDECKER ad Florece MERLEVÈDE Uiversité Paris 6 Abstract Followig Lideberg s approach, we obtai a ew coditio for a statioary sequece

More information

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i

More information

BIRKHOFF ERGODIC THEOREM

BIRKHOFF ERGODIC THEOREM BIRKHOFF ERGODIC THEOREM Abstract. We will give a proof of the poitwise ergodic theorem, which was first proved by Birkhoff. May improvemets have bee made sice Birkhoff s orgial proof. The versio we give

More information

Sequences and Series of Functions

Sequences and Series of Functions Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges

More information

Entropy Rates and Asymptotic Equipartition

Entropy Rates and Asymptotic Equipartition Chapter 29 Etropy Rates ad Asymptotic Equipartitio Sectio 29. itroduces the etropy rate the asymptotic etropy per time-step of a stochastic process ad shows that it is well-defied; ad similarly for iformatio,

More information

Definition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.

Definition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4. 4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad

More information

6.3 Testing Series With Positive Terms

6.3 Testing Series With Positive Terms 6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial

More information

On the behavior at infinity of an integrable function

On the behavior at infinity of an integrable function O the behavior at ifiity of a itegrable fuctio Emmauel Lesige To cite this versio: Emmauel Lesige. O the behavior at ifiity of a itegrable fuctio. The America Mathematical Mothly, 200, 7 (2), pp.75-8.

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS MASSACHUSTTS INSTITUT OF TCHNOLOGY 6.436J/5.085J Fall 2008 Lecture 9 /7/2008 LAWS OF LARG NUMBRS II Cotets. The strog law of large umbers 2. The Cheroff boud TH STRONG LAW OF LARG NUMBRS While the weak

More information

This section is optional.

This section is optional. 4 Momet Geeratig Fuctios* This sectio is optioal. The momet geeratig fuctio g : R R of a radom variable X is defied as g(t) = E[e tx ]. Propositio 1. We have g () (0) = E[X ] for = 1, 2,... Proof. Therefore

More information

Advanced Stochastic Processes.

Advanced Stochastic Processes. Advaced Stochastic Processes. David Gamarik LECTURE 2 Radom variables ad measurable fuctios. Strog Law of Large Numbers (SLLN). Scary stuff cotiued... Outlie of Lecture Radom variables ad measurable fuctios.

More information

5 Birkhoff s Ergodic Theorem

5 Birkhoff s Ergodic Theorem 5 Birkhoff s Ergodic Theorem Amog the most useful of the various geeralizatios of KolmogorovâĂŹs strog law of large umbers are the ergodic theorems of Birkhoff ad Kigma, which exted the validity of the

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013 MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013 Fuctioal Law of Large Numbers. Costructio of the Wieer Measure Cotet. 1. Additioal techical results o weak covergece

More information

Introduction to Probability. Ariel Yadin

Introduction to Probability. Ariel Yadin Itroductio to robability Ariel Yadi Lecture 2 *** Ja. 7 ***. Covergece of Radom Variables As i the case of sequeces of umbers, we would like to talk about covergece of radom variables. There are may ways

More information

Math 341 Lecture #31 6.5: Power Series

Math 341 Lecture #31 6.5: Power Series Math 341 Lecture #31 6.5: Power Series We ow tur our attetio to a particular kid of series of fuctios, amely, power series, f(x = a x = a 0 + a 1 x + a 2 x 2 + where a R for all N. I terms of a series

More information

1 The Haar functions and the Brownian motion

1 The Haar functions and the Brownian motion 1 The Haar fuctios ad the Browia motio 1.1 The Haar fuctios ad their completeess The Haar fuctios The basic Haar fuctio is 1 if x < 1/2, ψx) = 1 if 1/2 x < 1, otherwise. 1.1) It has mea zero 1 ψx)dx =,

More information

Introduction to Extreme Value Theory Laurens de Haan, ISM Japan, Erasmus University Rotterdam, NL University of Lisbon, PT

Introduction to Extreme Value Theory Laurens de Haan, ISM Japan, Erasmus University Rotterdam, NL University of Lisbon, PT Itroductio to Extreme Value Theory Laures de Haa, ISM Japa, 202 Itroductio to Extreme Value Theory Laures de Haa Erasmus Uiversity Rotterdam, NL Uiversity of Lisbo, PT Itroductio to Extreme Value Theory

More information

Chapter 6 Infinite Series

Chapter 6 Infinite Series Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat

More information

Lecture 8: Convergence of transformations and law of large numbers

Lecture 8: Convergence of transformations and law of large numbers Lecture 8: Covergece of trasformatios ad law of large umbers Trasformatio ad covergece Trasformatio is a importat tool i statistics. If X coverges to X i some sese, we ofte eed to check whether g(x ) coverges

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

7 Sequences of real numbers

7 Sequences of real numbers 40 7 Sequeces of real umbers 7. Defiitios ad examples Defiitio 7... A sequece of real umbers is a real fuctio whose domai is the set N of atural umbers. Let s : N R be a sequece. The the values of s are

More information

NECESSARY AND SUFFICIENT CONDITIONS FOR THE CONDITIONAL CENTRAL LIMIT THEOREM. BY JÉRÔME DEDECKER AND FLORENCE MERLEVÈDE Université Paris 6

NECESSARY AND SUFFICIENT CONDITIONS FOR THE CONDITIONAL CENTRAL LIMIT THEOREM. BY JÉRÔME DEDECKER AND FLORENCE MERLEVÈDE Université Paris 6 The Aals of Probability 2002, Vol. 30, No. 3, 044 08 NECESSARY AND SUFFICIENT CONDITIONS FOR THE CONDITIONAL CENTRAL LIMIT THEOREM BY JÉRÔME DEDECKER AND FLORENCE MERLEVÈDE Uiversité Paris 6 Followig Lideberg

More information

1 = δ2 (0, ), Y Y n nδ. , T n = Y Y n n. ( U n,k + X ) ( f U n,k + Y ) n 2n f U n,k + θ Y ) 2 E X1 2 X1

1 = δ2 (0, ), Y Y n nδ. , T n = Y Y n n. ( U n,k + X ) ( f U n,k + Y ) n 2n f U n,k + θ Y ) 2 E X1 2 X1 8. The cetral limit theorems 8.1. The cetral limit theorem for i.i.d. sequeces. ecall that C ( is N -separatig. Theorem 8.1. Let X 1, X,... be i.i.d. radom variables with EX 1 = ad EX 1 = σ (,. Suppose

More information

Lecture 3 The Lebesgue Integral

Lecture 3 The Lebesgue Integral Lecture 3: The Lebesgue Itegral 1 of 14 Course: Theory of Probability I Term: Fall 2013 Istructor: Gorda Zitkovic Lecture 3 The Lebesgue Itegral The costructio of the itegral Uless expressly specified

More information

2.2. Central limit theorem.

2.2. Central limit theorem. 36.. Cetral limit theorem. The most ideal case of the CLT is that the radom variables are iid with fiite variace. Although it is a special case of the more geeral Lideberg-Feller CLT, it is most stadard

More information

ECE 330:541, Stochastic Signals and Systems Lecture Notes on Limit Theorems from Probability Fall 2002

ECE 330:541, Stochastic Signals and Systems Lecture Notes on Limit Theorems from Probability Fall 2002 ECE 330:541, Stochastic Sigals ad Systems Lecture Notes o Limit Theorems from robability Fall 00 I practice, there are two ways we ca costruct a ew sequece of radom variables from a old sequece of radom

More information

Lecture 3 : Random variables and their distributions

Lecture 3 : Random variables and their distributions Lecture 3 : Radom variables ad their distributios 3.1 Radom variables Let (Ω, F) ad (S, S) be two measurable spaces. A map X : Ω S is measurable or a radom variable (deoted r.v.) if X 1 (A) {ω : X(ω) A}

More information

MAT1026 Calculus II Basic Convergence Tests for Series

MAT1026 Calculus II Basic Convergence Tests for Series MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real

More information

Precise Rates in Complete Moment Convergence for Negatively Associated Sequences

Precise Rates in Complete Moment Convergence for Negatively Associated Sequences Commuicatios of the Korea Statistical Society 29, Vol. 16, No. 5, 841 849 Precise Rates i Complete Momet Covergece for Negatively Associated Sequeces Dae-Hee Ryu 1,a a Departmet of Computer Sciece, ChugWoo

More information

Math Solutions to homework 6

Math Solutions to homework 6 Math 175 - Solutios to homework 6 Cédric De Groote November 16, 2017 Problem 1 (8.11 i the book): Let K be a compact Hermitia operator o a Hilbert space H ad let the kerel of K be {0}. Show that there

More information

On forward improvement iteration for stopping problems

On forward improvement iteration for stopping problems O forward improvemet iteratio for stoppig problems Mathematical Istitute, Uiversity of Kiel, Ludewig-Mey-Str. 4, D-24098 Kiel, Germay irle@math.ui-iel.de Albrecht Irle Abstract. We cosider the optimal

More information

2.1. Convergence in distribution and characteristic functions.

2.1. Convergence in distribution and characteristic functions. 3 Chapter 2. Cetral Limit Theorem. Cetral limit theorem, or DeMoivre-Laplace Theorem, which also implies the wea law of large umbers, is the most importat theorem i probability theory ad statistics. For

More information

A Proof of Birkhoff s Ergodic Theorem

A Proof of Birkhoff s Ergodic Theorem A Proof of Birkhoff s Ergodic Theorem Joseph Hora September 2, 205 Itroductio I Fall 203, I was learig the basics of ergodic theory, ad I came across this theorem. Oe of my supervisors, Athoy Quas, showed

More information

ACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory

ACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory 1. Graph Theory Prove that there exist o simple plaar triagulatio T ad two distict adjacet vertices x, y V (T ) such that x ad y are the oly vertices of T of odd degree. Do ot use the Four-Color Theorem.

More information

University of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck!

University of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck! Uiversity of Colorado Dever Dept. Math. & Stat. Scieces Applied Aalysis Prelimiary Exam 13 Jauary 01, 10:00 am :00 pm Name: The proctor will let you read the followig coditios before the exam begis, ad

More information

Measure and Measurable Functions

Measure and Measurable Functions 3 Measure ad Measurable Fuctios 3.1 Measure o a Arbitrary σ-algebra Recall from Chapter 2 that the set M of all Lebesgue measurable sets has the followig properties: R M, E M implies E c M, E M for N implies

More information

Solutions to HW Assignment 1

Solutions to HW Assignment 1 Solutios to HW: 1 Course: Theory of Probability II Page: 1 of 6 Uiversity of Texas at Austi Solutios to HW Assigmet 1 Problem 1.1. Let Ω, F, {F } 0, P) be a filtered probability space ad T a stoppig time.

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 3 9/11/2013. Large deviations Theory. Cramér s Theorem

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 3 9/11/2013. Large deviations Theory. Cramér s Theorem MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/5.070J Fall 203 Lecture 3 9//203 Large deviatios Theory. Cramér s Theorem Cotet.. Cramér s Theorem. 2. Rate fuctio ad properties. 3. Chage of measure techique.

More information

Introduction to Probability. Ariel Yadin. Lecture 7

Introduction to Probability. Ariel Yadin. Lecture 7 Itroductio to Probability Ariel Yadi Lecture 7 1. Idepedece Revisited 1.1. Some remiders. Let (Ω, F, P) be a probability space. Give a collectio of subsets K F, recall that the σ-algebra geerated by K,

More information

Math 525: Lecture 5. January 18, 2018

Math 525: Lecture 5. January 18, 2018 Math 525: Lecture 5 Jauary 18, 2018 1 Series (review) Defiitio 1.1. A sequece (a ) R coverges to a poit L R (writte a L or lim a = L) if for each ǫ > 0, we ca fid N such that a L < ǫ for all N. If the

More information

An Introduction to Randomized Algorithms

An Introduction to Randomized Algorithms A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis

More information

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial. Taylor Polyomials ad Taylor Series It is ofte useful to approximate complicated fuctios usig simpler oes We cosider the task of approximatig a fuctio by a polyomial If f is at least -times differetiable

More information

Mi-Hwa Ko and Tae-Sung Kim

Mi-Hwa Ko and Tae-Sung Kim J. Korea Math. Soc. 42 2005), No. 5, pp. 949 957 ALMOST SURE CONVERGENCE FOR WEIGHTED SUMS OF NEGATIVELY ORTHANT DEPENDENT RANDOM VARIABLES Mi-Hwa Ko ad Tae-Sug Kim Abstract. For weighted sum of a sequece

More information

Research Article Moment Inequality for ϕ-mixing Sequences and Its Applications

Research Article Moment Inequality for ϕ-mixing Sequences and Its Applications Hidawi Publishig Corporatio Joural of Iequalities ad Applicatios Volume 2009, Article ID 379743, 2 pages doi:0.55/2009/379743 Research Article Momet Iequality for ϕ-mixig Sequeces ad Its Applicatios Wag

More information

Ergodicity of Stochastic Processes and the Markov Chain Central Limit Theorem

Ergodicity of Stochastic Processes and the Markov Chain Central Limit Theorem Uiversity of Bristol School of Mathematics Ergodicity of Stochastic Processes ad the Markov Chai Cetral Limit Theorem A Project of 30 Credit Poits at Level 7 For the Degree of MSci Mathematics Author:

More information

A Hilbert Space Central Limit Theorem for Geometrically Ergodic Markov Chains

A Hilbert Space Central Limit Theorem for Geometrically Ergodic Markov Chains A Hilbert Space Cetral Limit Theorem for Geometrically Ergodic Marov Chais Joh Stachursi Research School of Ecoomics, Australia Natioal Uiversity Abstract This ote proves a simple but useful cetral limit

More information

Detailed proofs of Propositions 3.1 and 3.2

Detailed proofs of Propositions 3.1 and 3.2 Detailed proofs of Propositios 3. ad 3. Proof of Propositio 3. NB: itegratio sets are geerally omitted for itegrals defied over a uit hypercube [0, s with ay s d. We first give four lemmas. The proof of

More information

Lecture 19: Convergence

Lecture 19: Convergence Lecture 19: Covergece Asymptotic approach I statistical aalysis or iferece, a key to the success of fidig a good procedure is beig able to fid some momets ad/or distributios of various statistics. I may

More information

Notes 19 : Martingale CLT

Notes 19 : Martingale CLT Notes 9 : Martigale CLT Math 733-734: Theory of Probability Lecturer: Sebastie Roch Refereces: [Bil95, Chapter 35], [Roc, Chapter 3]. Sice we have ot ecoutered weak covergece i some time, we first recall

More information

4x 2. (n+1) x 3 n+1. = lim. 4x 2 n+1 n3 n. n 4x 2 = lim = 3

4x 2. (n+1) x 3 n+1. = lim. 4x 2 n+1 n3 n. n 4x 2 = lim = 3 Exam Problems (x. Give the series (, fid the values of x for which this power series coverges. Also =0 state clearly what the radius of covergece is. We start by settig up the Ratio Test: x ( x x ( x x

More information

Distribution of Random Samples & Limit theorems

Distribution of Random Samples & Limit theorems STAT/MATH 395 A - PROBABILITY II UW Witer Quarter 2017 Néhémy Lim Distributio of Radom Samples & Limit theorems 1 Distributio of i.i.d. Samples Motivatig example. Assume that the goal of a study is to

More information

1+x 1 + α+x. x = 2(α x2 ) 1+x

1+x 1 + α+x. x = 2(α x2 ) 1+x Math 2030 Homework 6 Solutios # [Problem 5] For coveiece we let α lim sup a ad β lim sup b. Without loss of geerality let us assume that α β. If α the by assumptio β < so i this case α + β. By Theorem

More information

Berry-Esseen bounds for self-normalized martingales

Berry-Esseen bounds for self-normalized martingales Berry-Essee bouds for self-ormalized martigales Xiequa Fa a, Qi-Ma Shao b a Ceter for Applied Mathematics, Tiaji Uiversity, Tiaji 30007, Chia b Departmet of Statistics, The Chiese Uiversity of Hog Kog,

More information

Integrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number

Integrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number MATH 532 Itegrable Fuctios Dr. Neal, WKU We ow shall defie what it meas for a measurable fuctio to be itegrable, show that all itegral properties of simple fuctios still hold, ad the give some coditios

More information

Probability 2 - Notes 10. Lemma. If X is a random variable and g(x) 0 for all x in the support of f X, then P(g(X) 1) E[g(X)].

Probability 2 - Notes 10. Lemma. If X is a random variable and g(x) 0 for all x in the support of f X, then P(g(X) 1) E[g(X)]. Probability 2 - Notes 0 Some Useful Iequalities. Lemma. If X is a radom variable ad g(x 0 for all x i the support of f X, the P(g(X E[g(X]. Proof. (cotiuous case P(g(X Corollaries x:g(x f X (xdx x:g(x

More information

SOME GENERALIZATIONS OF OLIVIER S THEOREM

SOME GENERALIZATIONS OF OLIVIER S THEOREM SOME GENERALIZATIONS OF OLIVIER S THEOREM Alai Faisat, Sait-Étiee, Georges Grekos, Sait-Étiee, Ladislav Mišík Ostrava (Received Jauary 27, 2006) Abstract. Let a be a coverget series of positive real umbers.

More information

An alternative proof of a theorem of Aldous. concerning convergence in distribution for martingales.

An alternative proof of a theorem of Aldous. concerning convergence in distribution for martingales. A alterative proof of a theorem of Aldous cocerig covergece i distributio for martigales. Maurizio Pratelli Dipartimeto di Matematica, Uiversità di Pisa. Via Buoarroti 2. I-56127 Pisa, Italy e-mail: pratelli@dm.uipi.it

More information

Lecture 4. We also define the set of possible values for the random walk as the set of all x R d such that P(S n = x) > 0 for some n.

Lecture 4. We also define the set of possible values for the random walk as the set of all x R d such that P(S n = x) > 0 for some n. Radom Walks ad Browia Motio Tel Aviv Uiversity Sprig 20 Lecture date: Mar 2, 20 Lecture 4 Istructor: Ro Peled Scribe: Lira Rotem This lecture deals primarily with recurrece for geeral radom walks. We preset

More information

Empirical Processes: Glivenko Cantelli Theorems

Empirical Processes: Glivenko Cantelli Theorems Empirical Processes: Gliveko Catelli Theorems Mouliath Baerjee Jue 6, 200 Gliveko Catelli classes of fuctios The reader is referred to Chapter.6 of Weller s Torgo otes, Chapter??? of VDVW ad Chapter 8.3

More information

Central limit theorem and almost sure central limit theorem for the product of some partial sums

Central limit theorem and almost sure central limit theorem for the product of some partial sums Proc. Idia Acad. Sci. Math. Sci. Vol. 8, No. 2, May 2008, pp. 289 294. Prited i Idia Cetral it theorem ad almost sure cetral it theorem for the product of some partial sums YU MIAO College of Mathematics

More information

Almost Sure Invariance Principles via Martingale Approximation

Almost Sure Invariance Principles via Martingale Approximation Almost Sure Ivariace Priciples via Martigale Approximatio Florece Merlevède a, Costel Peligrad b ad Magda Peligrad c a Uiversité Paris Est, Laboratoire de mathématiques, UMR 8050 CNRS, Bâtimet Coperic,

More information

Random Walks on Discrete and Continuous Circles. by Jeffrey S. Rosenthal School of Mathematics, University of Minnesota, Minneapolis, MN, U.S.A.

Random Walks on Discrete and Continuous Circles. by Jeffrey S. Rosenthal School of Mathematics, University of Minnesota, Minneapolis, MN, U.S.A. Radom Walks o Discrete ad Cotiuous Circles by Jeffrey S. Rosethal School of Mathematics, Uiversity of Miesota, Mieapolis, MN, U.S.A. 55455 (Appeared i Joural of Applied Probability 30 (1993), 780 789.)

More information

for all x ; ;x R. A ifiite sequece fx ; g is said to be ND if every fiite subset X ; ;X is ND. The coditios (.) ad (.3) are equivalet for =, but these

for all x ; ;x R. A ifiite sequece fx ; g is said to be ND if every fiite subset X ; ;X is ND. The coditios (.) ad (.3) are equivalet for =, but these sub-gaussia techiques i provig some strog it theorems Λ M. Amii A. Bozorgia Departmet of Mathematics, Faculty of Scieces Sista ad Baluchesta Uiversity, Zaheda, Ira Amii@hamoo.usb.ac.ir, Fax:054446565 Departmet

More information

Notes 27 : Brownian motion: path properties

Notes 27 : Brownian motion: path properties Notes 27 : Browia motio: path properties Math 733-734: Theory of Probability Lecturer: Sebastie Roch Refereces:[Dur10, Sectio 8.1], [MP10, Sectio 1.1, 1.2, 1.3]. Recall: DEF 27.1 (Covariace) Let X = (X

More information

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n = 60. Ratio ad root tests 60.1. Absolutely coverget series. Defiitio 13. (Absolute covergece) A series a is called absolutely coverget if the series of absolute values a is coverget. The absolute covergece

More information

MAXIMAL INEQUALITIES AND STRONG LAW OF LARGE NUMBERS FOR AANA SEQUENCES

MAXIMAL INEQUALITIES AND STRONG LAW OF LARGE NUMBERS FOR AANA SEQUENCES Commu Korea Math Soc 26 20, No, pp 5 6 DOI 0434/CKMS20265 MAXIMAL INEQUALITIES AND STRONG LAW OF LARGE NUMBERS FOR AANA SEQUENCES Wag Xueju, Hu Shuhe, Li Xiaoqi, ad Yag Wezhi Abstract Let {X, } be a sequece

More information

ON THE DELOCALIZED PHASE OF THE RANDOM PINNING MODEL

ON THE DELOCALIZED PHASE OF THE RANDOM PINNING MODEL O THE DELOCALIZED PHASE OF THE RADOM PIIG MODEL JEA-CHRISTOPHE MOURRAT Abstract. We cosider the model of a directed polymer pied to a lie of i.i.d. radom charges, ad focus o the iterior of the delocalized

More information

Topics. Homework Problems. MATH 301 Introduction to Analysis Chapter Four Sequences. 1. Definition of convergence of sequences.

Topics. Homework Problems. MATH 301 Introduction to Analysis Chapter Four Sequences. 1. Definition of convergence of sequences. MATH 301 Itroductio to Aalysis Chapter Four Sequeces Topics 1. Defiitio of covergece of sequeces. 2. Fidig ad provig the limit of sequeces. 3. Bouded covergece theorem: Theorem 4.1.8. 4. Theorems 4.1.13

More information

Solution. 1 Solutions of Homework 1. Sangchul Lee. October 27, Problem 1.1

Solution. 1 Solutions of Homework 1. Sangchul Lee. October 27, Problem 1.1 Solutio Sagchul Lee October 7, 017 1 Solutios of Homework 1 Problem 1.1 Let Ω,F,P) be a probability space. Show that if {A : N} F such that A := lim A exists, the PA) = lim PA ). Proof. Usig the cotiuity

More information

MATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and

MATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and MATH01 Real Aalysis (2008 Fall) Tutorial Note #7 Sequece ad Series of fuctio 1: Poitwise Covergece ad Uiform Covergece Part I: Poitwise Covergece Defiitio of poitwise covergece: A sequece of fuctios f

More information

Riesz-Fischer Sequences and Lower Frame Bounds

Riesz-Fischer Sequences and Lower Frame Bounds Zeitschrift für Aalysis ud ihre Aweduge Joural for Aalysis ad its Applicatios Volume 1 (00), No., 305 314 Riesz-Fischer Sequeces ad Lower Frame Bouds P. Casazza, O. Christese, S. Li ad A. Lider Abstract.

More information

Asymptotic distribution of products of sums of independent random variables

Asymptotic distribution of products of sums of independent random variables Proc. Idia Acad. Sci. Math. Sci. Vol. 3, No., May 03, pp. 83 9. c Idia Academy of Scieces Asymptotic distributio of products of sums of idepedet radom variables YANLING WANG, SUXIA YAO ad HONGXIA DU ollege

More information

Dimension-free PAC-Bayesian bounds for the estimation of the mean of a random vector

Dimension-free PAC-Bayesian bounds for the estimation of the mean of a random vector Dimesio-free PAC-Bayesia bouds for the estimatio of the mea of a radom vector Olivier Catoi CREST CNRS UMR 9194 Uiversité Paris Saclay olivier.catoi@esae.fr Ilaria Giulii Laboratoire de Probabilités et

More information

Singular Continuous Measures by Michael Pejic 5/14/10

Singular Continuous Measures by Michael Pejic 5/14/10 Sigular Cotiuous Measures by Michael Peic 5/4/0 Prelimiaries Give a set X, a σ-algebra o X is a collectio of subsets of X that cotais X ad ad is closed uder complemetatio ad coutable uios hece, coutable

More information

Notes 5 : More on the a.s. convergence of sums

Notes 5 : More on the a.s. convergence of sums Notes 5 : More o the a.s. covergece of sums Math 733-734: Theory of Probability Lecturer: Sebastie Roch Refereces: Dur0, Sectios.5; Wil9, Sectio 4.7, Shi96, Sectio IV.4, Dur0, Sectio.. Radom series. Three-series

More information

Probability for mathematicians INDEPENDENCE TAU

Probability for mathematicians INDEPENDENCE TAU Probability for mathematicias INDEPENDENCE TAU 2013 28 Cotets 3 Ifiite idepedet sequeces 28 3a Idepedet evets........................ 28 3b Idepedet radom variables.................. 33 3 Ifiite idepedet

More information

M17 MAT25-21 HOMEWORK 5 SOLUTIONS

M17 MAT25-21 HOMEWORK 5 SOLUTIONS M17 MAT5-1 HOMEWORK 5 SOLUTIONS 1. To Had I Cauchy Codesatio Test. Exercise 1: Applicatio of the Cauchy Codesatio Test Use the Cauchy Codesatio Test to prove that 1 diverges. Solutio 1. Give the series

More information

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3 MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special

More information

Introduction to Probability. Ariel Yadin. Lecture 2

Introduction to Probability. Ariel Yadin. Lecture 2 Itroductio to Probability Ariel Yadi Lecture 2 1. Discrete Probability Spaces Discrete probability spaces are those for which the sample space is coutable. We have already see that i this case we ca take

More information

2.4.2 A Theorem About Absolutely Convergent Series

2.4.2 A Theorem About Absolutely Convergent Series 0 Versio of August 27, 200 CHAPTER 2. INFINITE SERIES Add these two series: + 3 2 + 5 + 7 4 + 9 + 6 +... = 3 l 2. (2.20) 2 Sice the reciprocal of each iteger occurs exactly oce i the last series, we would

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 6 9/23/2013. Brownian motion. Introduction

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 6 9/23/2013. Brownian motion. Introduction MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/5.070J Fall 203 Lecture 6 9/23/203 Browia motio. Itroductio Cotet.. A heuristic costructio of a Browia motio from a radom walk. 2. Defiitio ad basic properties

More information

Archimedes - numbers for counting, otherwise lengths, areas, etc. Kepler - geometry for planetary motion

Archimedes - numbers for counting, otherwise lengths, areas, etc. Kepler - geometry for planetary motion Topics i Aalysis 3460:589 Summer 007 Itroductio Ree descartes - aalysis (breaig dow) ad sythesis Sciece as models of ature : explaatory, parsimoious, predictive Most predictios require umerical values,

More information

Self-normalized deviation inequalities with application to t-statistic

Self-normalized deviation inequalities with application to t-statistic Self-ormalized deviatio iequalities with applicatio to t-statistic Xiequa Fa Ceter for Applied Mathematics, Tiaji Uiversity, 30007 Tiaji, Chia Abstract Let ξ i i 1 be a sequece of idepedet ad symmetric

More information

Let us give one more example of MLE. Example 3. The uniform distribution U[0, θ] on the interval [0, θ] has p.d.f.

Let us give one more example of MLE. Example 3. The uniform distribution U[0, θ] on the interval [0, θ] has p.d.f. Lecture 5 Let us give oe more example of MLE. Example 3. The uiform distributio U[0, ] o the iterval [0, ] has p.d.f. { 1 f(x =, 0 x, 0, otherwise The likelihood fuctio ϕ( = f(x i = 1 I(X 1,..., X [0,

More information

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + 62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of

More information

1 Lecture 2: Sequence, Series and power series (8/14/2012)

1 Lecture 2: Sequence, Series and power series (8/14/2012) Summer Jump-Start Program for Aalysis, 202 Sog-Yig Li Lecture 2: Sequece, Series ad power series (8/4/202). More o sequeces Example.. Let {x } ad {y } be two bouded sequeces. Show lim sup (x + y ) lim

More information

Law of the sum of Bernoulli random variables

Law of the sum of Bernoulli random variables Law of the sum of Beroulli radom variables Nicolas Chevallier Uiversité de Haute Alsace, 4, rue des frères Lumière 68093 Mulhouse icolas.chevallier@uha.fr December 006 Abstract Let be the set of all possible

More information

n=1 a n is the sequence (s n ) n 1 n=1 a n converges to s. We write a n = s, n=1 n=1 a n

n=1 a n is the sequence (s n ) n 1 n=1 a n converges to s. We write a n = s, n=1 n=1 a n Series. Defiitios ad first properties A series is a ifiite sum a + a + a +..., deoted i short by a. The sequece of partial sums of the series a is the sequece s ) defied by s = a k = a +... + a,. k= Defiitio

More information

Fall 2013 MTH431/531 Real analysis Section Notes

Fall 2013 MTH431/531 Real analysis Section Notes Fall 013 MTH431/531 Real aalysis Sectio 8.1-8. Notes Yi Su 013.11.1 1. Defiitio of uiform covergece. We look at a sequece of fuctios f (x) ad study the coverget property. Notice we have two parameters

More information

Randomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018)

Randomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018) Radomized Algorithms I, Sprig 08, Departmet of Computer Sciece, Uiversity of Helsiki Homework : Solutios Discussed Jauary 5, 08). Exercise.: Cosider the followig balls-ad-bi game. We start with oe black

More information

lim za n n = z lim a n n.

lim za n n = z lim a n n. Lecture 6 Sequeces ad Series Defiitio 1 By a sequece i a set A, we mea a mappig f : N A. It is customary to deote a sequece f by {s } where, s := f(). A sequece {z } of (complex) umbers is said to be coverget

More information

LECTURE 8: ASYMPTOTICS I

LECTURE 8: ASYMPTOTICS I LECTURE 8: ASYMPTOTICS I We are iterested i the properties of estimators as. Cosider a sequece of radom variables {, X 1}. N. M. Kiefer, Corell Uiversity, Ecoomics 60 1 Defiitio: (Weak covergece) A sequece

More information