Hardy–Littlewood Tauberian theorem

From testwiki
Revision as of 14:20, 18 November 2023 by 2407:cdc0:b010::23f4 (talk) (Karamata's proof)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

In mathematical analysis, the Hardy–Littlewood Tauberian theorem is a Tauberian theorem relating the asymptotics of the partial sums of a series with the asymptotics of its Abel summation. In this form, the theorem asserts that if the sequence an0 is such that there is an asymptotic equivalence

n=0aneny1y as y0

then there is also an asymptotic equivalence

k=0nakn

as n. The integral formulation of the theorem relates in an analogous manner the asymptotics of the cumulative distribution function of a function with the asymptotics of its Laplace transform.

The theorem was proved in 1914 by G. H. Hardy and J. E. Littlewood.[1]Template:Rp In 1930, Jovan Karamata gave a new and much simpler proof.[1]Template:Rp

Statement of the theorem

Series formulation

This formulation is from Titchmarsh.[1]Template:Rp Suppose an0 for all n, and we have

n=0anxn11x as x1.

Then as n we have

k=0nakn.

The theorem is sometimes quoted in equivalent forms, where instead of requiring an0, we require an=O(1), or we require anK for some constant K.[2]Template:Rp The theorem is sometimes quoted in another equivalent formulation (through the change of variable x=1/ey).[2]Template:Rp If,

n=0aneny1y as y0

then

k=0nakn.

Integral formulation

The following more general formulation is from Feller.[3]Template:Rp Consider a real-valued function F:[0,) of bounded variation.[4] The Laplace–Stieltjes transform of F is defined by the Stieltjes integral

ω(s)=0estdF(t).

The theorem relates the asymptotics of ω with those of F in the following way. If ρ is a non-negative real number, then the following statements are equivalent

  • ω(s)Csρ,as s0
  • F(t)CΓ(ρ+1)tρ, as t.

Here Γ denotes the Gamma function. One obtains the theorem for series as a special case by taking ρ=1 and F(t) to be a piecewise constant function with value k=0nak between t=n and t=n+1.

A slight improvement is possible. According to the definition of a slowly varying function, L(x) is slow varying at infinity iff

L(tx)L(x)1,x

for every t>0. Let L be a function slowly varying at infinity and ρ0. Then the following statements are equivalent

  • ω(s)sρL(s1),as s0
  • F(t)1Γ(ρ+1)tρL(t),as t.

Karamata's proof

Template:Harvtxt found a short proof of the theorem by considering the functions g such that

limx1(1x)anxng(xn)=01g(t)dt

An easy calculation shows that all monomials g(x)=xk have this property, and therefore so do all polynomials g. This can be extended to a function g with simple (step) discontinuities by approximating it by polynomials from above and below (using the Weierstrass approximation theorem and a little extra fudging) and using the fact that the coefficients an are positive. In particular the function given by g(t)=1/t if 1/e<t<1 and 0 otherwise has this property. But then for x=e1/N the sum anxng(xn) is a0++aN and the integral of g is 1, from which the Hardy–Littlewood theorem follows immediately.

Examples

Non-positive coefficients

The theorem can fail without the condition that the coefficients are non-negative. For example, the function

1(1+x)2(1x)=1x+2x22x3+3x43x5+

is asymptotic to 1/4(1x) as x1, but the partial sums of its coefficients are 1, 0, 2, 0, 3, 0, 4, ... and are not asymptotic to any linear function.

Littlewood's extension of Tauber's theorem

Template:Main In 1911 Littlewood proved an extension of Tauber's converse of Abel's theorem. Littlewood showed the following: If an=O(1/n), and we have

anxns as x1

then

an=s.

This came historically before the Hardy–Littlewood Tauberian theorem, but can be proved as a simple application of it.[1]Template:Rp

Prime number theorem

In 1915 Hardy and Littlewood developed a proof of the prime number theorem based on their Tauberian theorem; they proved

n=2Λ(n)eny1y,

where Λ is the von Mangoldt function, and then conclude

nxΛ(n)x,

an equivalent form of the prime number theorem.[5]Template:Rp[6]Template:Rp Littlewood developed a simpler proof, still based on this Tauberian theorem, in 1971.[6]Template:Rp

Notes

Template:Reflist

  1. 1.0 1.1 1.2 1.3 Template:Cite book
  2. 2.0 2.1 Template:Cite book
  3. Template:Cite book
  4. Bounded variation is only required locally: on every bounded subinterval of [0,). However, then more complicated additional assumptions on the convergence of the Laplace–Stieltjes transform are required. See Template:Cite book
  5. Template:Cite book
  6. 6.0 6.1 Template:Cite book