Misplaced Pages

Hardy–Littlewood Tauberian theorem

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
(Redirected from Hardy–Littlewood tauberian theorem)

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 a n 0 {\displaystyle a_{n}\geq 0} is such that there is an asymptotic equivalence

n = 0 a n e n y 1 y   as   y 0 {\displaystyle \sum _{n=0}^{\infty }a_{n}e^{-ny}\sim {\frac {1}{y}}\ {\text{as}}\ y\downarrow 0}

then there is also an asymptotic equivalence

k = 0 n a k n {\displaystyle \sum _{k=0}^{n}a_{k}\sim n}

as n {\displaystyle n\to \infty } . 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. In 1930, Jovan Karamata gave a new and much simpler proof.

Statement of the theorem

Series formulation

This formulation is from Titchmarsh. Suppose a n 0 {\displaystyle a_{n}\geq 0} for all n N {\displaystyle n\in \mathbb {N} } , and we have

n = 0 a n x n 1 1 x   as   x 1. {\displaystyle \sum _{n=0}^{\infty }a_{n}x^{n}\sim {\frac {1}{1-x}}\ {\text{as}}\ x\uparrow 1.}

Then as n {\displaystyle n\to \infty } we have

k = 0 n a k n . {\displaystyle \sum _{k=0}^{n}a_{k}\sim n.}

The theorem is sometimes quoted in equivalent forms, where instead of requiring a n 0 {\displaystyle a_{n}\geq 0} , we require a n = O ( 1 ) {\displaystyle a_{n}=O(1)} , or we require a n K {\displaystyle a_{n}\geq -K} for some constant K {\displaystyle K} . The theorem is sometimes quoted in another equivalent formulation (through the change of variable x = 1 / e y {\displaystyle x=1/e^{y}} ). If,

n = 0 a n e n y 1 y   as   y 0 {\displaystyle \sum _{n=0}^{\infty }a_{n}e^{-ny}\sim {\frac {1}{y}}\ {\text{as}}\ y\downarrow 0}

then

k = 0 n a k n . {\displaystyle \sum _{k=0}^{n}a_{k}\sim n.}

Integral formulation

The following more general formulation is from Feller. Consider a real-valued function F : [ 0 , ) R {\displaystyle F:[0,\infty )\to \mathbb {R} } of bounded variation. The Laplace–Stieltjes transform of F {\displaystyle F} is defined by the Stieltjes integral

ω ( s ) = 0 e s t d F ( t ) . {\displaystyle \omega (s)=\int _{0}^{\infty }e^{-st}\,dF(t).}

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

  • ω ( s ) C s ρ , a s   s 0 {\displaystyle \omega (s)\sim Cs^{-\rho },\quad {\rm {{as\ }s\to 0}}}
  • F ( t ) C Γ ( ρ + 1 ) t ρ ,   as   t . {\displaystyle F(t)\sim {\frac {C}{\Gamma (\rho +1)}}t^{\rho },\ {\text{as}}\ t\to \infty .}

Here Γ {\displaystyle \Gamma } denotes the Gamma function. One obtains the theorem for series as a special case by taking ρ = 1 {\displaystyle \rho =1} and F ( t ) {\displaystyle F(t)} to be a piecewise constant function with value k = 0 n a k {\displaystyle \textstyle {\sum _{k=0}^{n}a_{k}}} between t = n {\displaystyle t=n} and t = n + 1 {\displaystyle t=n+1} .

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

L ( t x ) L ( x ) 1 , x {\displaystyle {\frac {L(tx)}{L(x)}}\to 1,\quad x\to \infty }

for every t > 0 {\displaystyle t>0} . Let L {\displaystyle L} be a function slowly varying at infinity and ρ 0 {\displaystyle \rho \geq 0} . Then the following statements are equivalent

  • ω ( s ) s ρ L ( s 1 ) , as   s 0 {\displaystyle \omega (s)\sim s^{-\rho }L(s^{-1}),\quad {\text{as}}\ s\to 0}
  • F ( t ) 1 Γ ( ρ + 1 ) t ρ L ( t ) , as   t . {\displaystyle F(t)\sim {\frac {1}{\Gamma (\rho +1)}}t^{\rho }L(t),\quad {\text{as}}\ t\to \infty .}

Karamata's proof

Karamata (1930) found a short proof of the theorem by considering the functions g {\displaystyle g} such that

lim x 1 ( 1 x ) a n x n g ( x n ) = 0 1 g ( t ) d t {\displaystyle \lim _{x\to 1}(1-x)\sum a_{n}x^{n}g(x^{n})=\int _{0}^{1}g(t)dt}

An easy calculation shows that all monomials g ( x ) = x k {\displaystyle g(x)=x^{k}} have this property, and therefore so do all polynomials g {\displaystyle g} . This can be extended to a function g {\displaystyle 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 a n {\displaystyle a_{n}} are positive. In particular the function given by g ( t ) = 1 / t {\displaystyle g(t)=1/t} if 1 / e < t < 1 {\displaystyle 1/e<t<1} and 0 {\displaystyle 0} otherwise has this property. But then for x = e 1 / N {\displaystyle x=e^{-1/N}} the sum a n x n g ( x n ) {\displaystyle \sum a_{n}x^{n}g(x^{n})} is a 0 + + a N {\displaystyle a_{0}+\cdots +a_{N}} and the integral of g {\displaystyle g} is 1 {\displaystyle 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 ( 1 x ) = 1 x + 2 x 2 2 x 3 + 3 x 4 3 x 5 + {\displaystyle {\frac {1}{(1+x)^{2}(1-x)}}=1-x+2x^{2}-2x^{3}+3x^{4}-3x^{5}+\cdots }

is asymptotic to 1 / 4 ( 1 x ) {\displaystyle 1/4(1-x)} as x 1 {\displaystyle x\to 1} , 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

Main article: Littlewood's Tauberian theorem

In 1911 Littlewood proved an extension of Tauber's converse of Abel's theorem. Littlewood showed the following: If a n = O ( 1 / n ) {\displaystyle a_{n}=O(1/n)} , and we have

a n x n s   as   x 1 {\displaystyle \sum a_{n}x^{n}\to s\ {\text{as}}\ x\uparrow 1}

then

a n = s . {\displaystyle \sum a_{n}=s.}

This came historically before the Hardy–Littlewood Tauberian theorem, but can be proved as a simple application of it.

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 ) e n y 1 y , {\displaystyle \sum _{n=2}^{\infty }\Lambda (n)e^{-ny}\sim {\frac {1}{y}},}

where Λ {\displaystyle \Lambda } is the von Mangoldt function, and then conclude

n x Λ ( n ) x , {\displaystyle \sum _{n\leq x}\Lambda (n)\sim x,}

an equivalent form of the prime number theorem. Littlewood developed a simpler proof, still based on this Tauberian theorem, in 1971.

Notes

  1. ^ Titchmarsh, E. C. (1939). The Theory of Functions (2nd ed.). Oxford: Oxford University Press. ISBN 0-19-853349-7.
  2. ^ Hardy, G. H. (1991) . Divergent Series. Providence, RI: AMS Chelsea. ISBN 0-8284-0334-1.
  3. Feller, William (1971). An introduction to probability theory and its applications. Vol. II. Second edition. New York: John Wiley & Sons. MR 0270403.
  4. Bounded variation is only required locally: on every bounded subinterval of [ 0 , ) {\displaystyle [0,\infty )} . However, then more complicated additional assumptions on the convergence of the Laplace–Stieltjes transform are required. See Shubin, M. A. (1987). Pseudodifferential operators and spectral theory. Springer Series in Soviet Mathematics. Berlin, New York: Springer-Verlag. ISBN 978-3-540-13621-7. MR 0883081.
  5. Hardy, G. H. (1999) . Ramanujan: Twelve Lectures on Subjects Suggested by his Life and Work. Providence: AMS Chelsea Publishing. ISBN 978-0-8218-2023-0.
  6. ^ Narkiewicz, Władysław (2000). The Development of Prime Number Theory. Berlin: Springer-Verlag. ISBN 3-540-66289-8.
  • Karamata, J. (December 1930). "Über die Hardy-Littlewoodschen Umkehrungen des Abelschen Stetigkeitssatzes". Mathematische Zeitschrift (in German). 32 (1): 319–320. doi:10.1007/BF01194636.

External links

Category: