Kolmogorov's two-series theorem

From testwiki
Jump to navigation Jump to search

In probability theory, Kolmogorov's two-series theorem is a result about the convergence of random series. It follows from Kolmogorov's inequality and is used in one proof of the strong law of large numbers.

Statement of the theorem

Let (Xn)n=1∞ be independent random variables with expected values 𝐄[Xn]=ΞΌn and variances π•πšπ«(Xn)=Οƒn2, such that βˆ‘n=1∞μn converges in ℝ and βˆ‘n=1βˆžΟƒn2 converges in ℝ. Then βˆ‘n=1∞Xn converges in ℝ almost surely.

Proof

Assume WLOG ΞΌn=0. Set SN=βˆ‘n=1NXn, and we will see that lim supNSNβˆ’lim infNSN=0 with probability 1.

For every mβˆˆβ„•, lim supNβ†’βˆžSNβˆ’lim infNβ†’βˆžSN=lim supNβ†’βˆž(SNβˆ’Sm)βˆ’lim infNβ†’βˆž(SNβˆ’Sm)≀2maxkβˆˆβ„•|βˆ‘i=1kXm+i|

Thus, for every mβˆˆβ„• and Ο΅>0, β„™(lim supNβ†’βˆž(SNβˆ’Sm)βˆ’lim infNβ†’βˆž(SNβˆ’Sm)β‰₯Ο΅)≀ℙ(2maxkβˆˆβ„•|βˆ‘i=1kXm+i|β‰₯Ο΅ )=β„™(maxkβˆˆβ„•|βˆ‘i=1kXm+i|β‰₯Ο΅2 )≀lim supNβ†’βˆž4Ο΅βˆ’2βˆ‘i=m+1m+NΟƒi2=4Ο΅βˆ’2limNβ†’βˆžβˆ‘i=m+1m+NΟƒi2

While the second inequality is due to Kolmogorov's inequality.

By the assumption that βˆ‘n=1βˆžΟƒn2 converges, it follows that the last term tends to 0 when mβ†’βˆž, for every arbitrary Ο΅>0.

References

Template:Reflist

  • Durrett, Rick. Probability: Theory and Examples. Duxbury advanced series, Third Edition, Thomson Brooks/Cole, 2005, Section 1.8, pp. 60–69.
  • M. LoΓ¨ve, Probability theory, Princeton Univ. Press (1963) pp. Sect. 16.3
  • W. Feller, An introduction to probability theory and its applications, 2, Wiley (1971) pp. Sect. IX.9