Puneet Varma (Editor)

Kolmogorov's two series theorem

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

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.

Contents

Statement of the theorem

Let ( X n ) n = 1 be independent random variables with expected values E [ X n ] = μ n and variances V a r ( X n ) = σ n 2 , such that n = 1 μ n converges in ℝ and n = 1 σ n 2 converges in ℝ. Then n = 1 X n converges in ℝ almost surely.

Proof

Assume WLOG μ n = 0 . Set S N = n = 1 N X n , and we will see that lim sup N S N lim inf N S N = 0 with probability 1.

For every m N ,

Thus, for every m N and ϵ > 0 ,

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

By the assumption that n = 1 σ n 2 converges, it follows that the last term tends to 0 when m , for every arbitraty ϵ > 0 .

References

Kolmogorov's two-series theorem Wikipedia