Tauber’s theorem and Karamata’s proof of the Hardy-Littlewood tauberian theorem

Jordan Bell
November 11, 2017

The following lemma is attributed to Kronecker by Knopp.11 1 Konrad Knopp, Theory and Application of Infinite Series, p. 129, Theorem 3.

Lemma 1 (Kronecker’s lemma).

If bn0 then

b0+b1++bnn+10.
Proof.

Suppose that |bn|K for all n, and let ϵ>0. As bn0 there is some n0 such that nn0 implies that |bn|<ϵ. If n(n0+1)Kϵ, then

|b0+b1++bnn+1| |b0+b1++bn0n+1|+|bn0++bnn+1|
(n0+1)Kn+1+(n-n0)ϵn+1
ϵ+ϵ.

We now use the above lemma to prove Tauber’s theorem.22 2 cf. E. C. Titchmarsh, The Theory of Functions, second ed., p. 10, §1.23.

Theorem 2 (Tauber’s theorem).

If an=o(1/n) and n=0anxns as x1-, then

n=0an=s.
Proof.

Let ϵ>0. Because n=0anxns as x1-, there is some δ>0 such that x>1-δ implies that

|n=0anxn-s|<ϵ.

Next, because n|an|0, there is some N>1δ such that (i) if nN then n|an|<ϵ and by Lemma 1, (ii) 1N+1n=0Nn|an|<ϵ.

Take x=1-1N, so N=11-x and 1-x=1N. We have

|n=N+1anxn| =|n=N+1nanxnn|
<n=N+1ϵxnN+1
<ϵN+111-x
=ϵNN+1
<ϵ.

Also, using

1-xn=(1-x)(1+x++xn-1)<(1-x)n

we have

|n=0Nan(1-xn)| n=0N|an|(1-xn)
<n=0N|an|(1-x)n
=n=0N|an|nN
=N+1N1N+1n=0Nn|an|
<N+1Nϵ
<2ϵ.

Now,

n=0Nan-s =n=0Nan-n=0Nanxn+n=0Nanxn-s
=n=0Nan(1-xn)+n=0Nanxn-s
=n=0Nan(1-xn)+n=0Nanxn+n=N+1anxn-n=N+1anxn-s
=n=0Nan(1-xn)+n=0anxn-s-n=N+1anxn

and then

|n=0Nan-s| |n=0Nan(1-xn)|+|n=0anxn-s|+|n=N+1anxn|
<2ϵ+ϵ+ϵ,

proving the claim. ∎

Lemma 3.

Let g:[0,1] and 0<c<1. Suppose that the restrictions of g to [0,c) and [c,1] are continuous and that

g(c-0)=limxc-g(x)g(c).

For ϵ>0, there are are polynomials p(x) and P(x) such that

p(x)g(x)P(x),0x1

and

g-p1ϵ,g-P1ϵ.
Proof.

There is some δ>0 such that c-δx<c implies that

g(c-0)-ϵ2g(x)g(c-0)+ϵ2;

further, take δ<ϵg(c)-g(c-0) and δ<12.

Take L to be the linear function satisfying

L(c-δ)=g(c-δ)+ϵ2,L(c)=g(c)+ϵ2.

For c-δx<c,

L(x)-g(x) =L(x)-g(c-δ)+g(c-δ)-g(c-0)+g(c-0)-g(x)
=L(x)-L(c-δ)+ϵ2+g(c-δ)-g(c-0)+g(c-0)-g(x)
L(c)-L(c-δ)+ϵ2+ϵ2+ϵ2
=g(c)-g(c-δ)+3ϵ2
=g(c)-g(c-0)+g(c-0)-g(c-δ)+3ϵ2
<ϵδ+ϵ2+3ϵ2
<2ϵδ.

Define Φ:[0,1] by

Φ(x)={g(x)+ϵ20x<c-δmax{L(x),g(x)+ϵ2}c-δxcg(x)+ϵ2c<x1.

Φ is continuous and Φg+ϵ2. We have

g-Φ1 =01(Φ(x)-g(x))𝑑x
=0c-δϵ2𝑑x+c-δc(Φ(x)-g(x))𝑑x+c1ϵ2𝑑x
<ϵ2+c-δc(Φ(x)-g(x))𝑑x
ϵ2+c-δcmax{L(x)-g(x),ϵ2}𝑑x
ϵ2+c-δcmax{2ϵδ,ϵ2}𝑑x
=ϵ2+δ2ϵδ
=5ϵ2.

Because Φ is continuous, by the Weierstrass approximation theorem there is a polynomial P(x) such that Φ-Pϵ2. Then,

g(x)P(x),0x1,

and

g-P1g-Φ1+Φ-P1<5ϵ2+Φ-P5ϵ2+ϵ2=3ϵ.

On the other hand, take l to be the linear function satisfying

l(c-δ)=g(c-δ)-ϵ2,l(c)=g(c)-ϵ2.

One checks that for c-δx<c.

g(x)-l(x)<2ϵδ,

Define ϕ:[0,1] by

ϕ(x)={g(x)-ϵ20x<c-δmin{l(x),g(x)-ϵ2}c-δxcg(x)-ϵ2c<x1,

which is continuous and satisfies ϕg-ϵ2. One checks that

g-ϕ1<5ϵ2.

Because ϕ is continuous, there is a polynomial p(x) such that ϕ-pϵ2. Then,

p(x)g(x),0x1,

and

g-p1g-ϕ1+ϕ-p1<5ϵ2+ϕ-p5ϵ2+ϵ2=3ϵ.

The following is the Hardy-Littlewood tauberian theorem.33 3 E. C. Titchmarsh, The Theory of Functions, second ed., p. 227, §7.53, attributed to Karamata.

Theorem 4 (Hardy-Littlewood tauberian theorem).

If an0 for all n and

n=0anxn11-x,x1-,

then

sn=ν=0naνn.
Proof.

For any k0,

(1-x)n=0anxn(xn)k =1-x1-xk+1(1-xk+1)n=0an(xk+1)n
=11+x++xk(1-xk+1)n=0an(xk+1)n
1k+11
=01tk𝑑t,

as x1-. Hence if P(x) is a polynomial, then

limx1-(1-x)n=0anxnP(xn)=01P(t)𝑑t. (1)

Define g:[0,1] by

g(t)={00t<e-1t-1e-1t1.

Let ϵ>0. By Lemma 3, there are polynomials p(x),P(x) such that

p(x)g(x)P(x),0x1

and

g-p1ϵ,P-g1ϵ.

Because the coefficients an are nonnegative, taking upper limits and then using (1) we obtain

lim supx1-(1-x)n=0anxng(xn) lim supx1-(1-x)n=0anxnP(xn)
=limx1-(1-x)n=0anxnP(xn)
=01P(t)𝑑t
<01g(t)𝑑t+ϵ.

Taking lower limits and then using (1) we obtain

lim infx1-(1-x)n=0anxng(xn) lim infx1-(1-x)n=0anxnp(xn)
=limx1-(1-x)n=0anxnp(xn)
=01p(t)𝑑t
>01g(t)𝑑t-ϵ.

The above two inequalities do not depend on the polynomials p(x),P(x) but only on ϵ, and taking ϵ0 yields

lim supx1-(1-x)n=0anxng(xn)01g(t)𝑑t

and

lim infx1-(1-x)n=0anxng(xn)01g(t)𝑑t.

Thus

limx1-(1-x)n=0anxng(xn)=01g(t)𝑑t=e-11t-1𝑑t=1. (2)

For x=e-1/N we have

n=0anxng(xn) =n=0ane-n/Ng(e-n/N)
=n=0Nane-n/Nen/N
=sN.

Thus, (2) tells us that

limN(1-e-1/N)sN=1.

That is,

sN11-e-1/N,

and using

11-e-1/N=N+12+O(N-1)

we get

sNN,

completing the proof. ∎