Lably
Skip to content

Kronecker's lemma

  • 1 min read
  • 1 chapter

Related on Lably

Through Mathematics, Series (mathematics) and Germany

The lemma

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

∑m=1∞xm=s

exists and is finite, then we have for all 0<b1≤b2≤b3≤… and bn→∞ that

limn→∞1bn∑k=1nbkxk=0.

Proof

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

1bn∑k=1nbkxk=Sn−1bn∑k=1n−1(bk+1−bk)Sk

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

Sn−1bn∑k=1N−1(bk+1−bk)Sk−1bn∑k=Nn−1(bk+1−bk)Sk
=Sn−1bn∑k=1N−1(bk+1−bk)Sk−1bn∑k=Nn−1(bk+1−bk)s−1bn∑k=Nn−1(bk+1−bk)(Sk−s)
=Sn−1bn∑k=1N−1(bk+1−bk)Sk−bn−bNbns−1bn∑k=Nn−1(bk+1−bk)(Sk−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 ϵ(bn−bN)/bn≤ϵ.

More in Scientists, inventors, and mathematicians