Girish Mahajan (Editor)

Kronecker's lemma

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

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.

Contents

The lemma

If ( x n ) n = 1 ∞ is an infinite sequence of real numbers such that

∑ m = 1 ∞ x m = s

exists and is finite, then we have for all 0 < b 1 ≤ b 2 ≤ b 3 ≤ … and b n → ∞ that

lim n → ∞ 1 b n ∑ k = 1 n b k x k = 0.

Proof

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

1 b n ∑ k = 1 n b k x k = S n − 1 b n ∑ k = 1 n − 1 ( b k + 1 − b k ) S k

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

S n − 1 b n ∑ k = 1 N − 1 ( b k + 1 − b k ) S k − 1 b n ∑ k = N n − 1 ( b k + 1 − b k ) S k = S n − 1 b n ∑ k = 1 N − 1 ( b k + 1 − b k ) S k − 1 b n ∑ k = N n − 1 ( b k + 1 − b k ) s − 1 b n ∑ k = N n − 1 ( b k + 1 − b k ) ( S k − s ) = S n − 1 b n ∑ k = 1 N − 1 ( b k + 1 − b k ) S k − b n − b N b n s − 1 b n ∑ k = N n − 1 ( b k + 1 − b k ) ( S k − s ) .

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 ϵ ( b n − b N ) / b n ≤ ϵ .

References

Kronecker's lemma Wikipedia
(Text) CC BY-SA