Kronecker's lemma

In mathematics, Kronecker's lemma (see, e.g., Shiryaev (1996, Lemma IV.3.2)) is a result about the relationship between convergence of infinite sums and convergence of sequences. The lemma is often used in the proofs of theorems concerning sums of independent random variables such as the strong Law of large numbers. The lemma is named after the German mathematician Leopold Kronecker.

The lemma

If is an infinite sequence of real numbers such that

exists and is finite, then we have for all and that

Proof

Let denote the partial sums of the x's. Using summation by parts,

Pick any ε > 0. Now choose N so that is ε-close to s for k > N. This can be done as the sequence converges to s. Then the right hand side is:

Now, let n go to infinity. The first term goes to s, which cancels with the third term. The second term goes to zero (as the sum is a fixed value). Since the b sequence is increasing, the last term is bounded by .

gollark: Except on new versions.
gollark: Please note that due to CCTweaked not supporting binary websocket messages until recently it won't work too well.
gollark: <@139909890905866240> Just use `cargo build --release` or `cargo run`.
gollark: It just shows, well, the display name.
gollark: Why does that register as a *makefile*?

References

  • Shiryaev, Albert N. (1996). Probability (2nd ed.). Springer. ISBN 0-387-94549-0.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.