Lambert summation explained

In mathematical analysis and analytic number theory, Lambert summation is a summability method for summing infinite series related to Lambert series specially relevant in analytic number theory.

Definition

Define the Lambert kernel by

L(x)=log(1/x)x
1-x
with

L(1)=1

. Note that

L(xn)>0

is decreasing as a function of

n

when

0<x<1

. A sum
infty
\sum
n=0

an

is Lambert summable to

A

if
\lim
x\to1-
infty
\sum
n=0

anL(xn)=A

, written
infty
\sum
n=0

an=A(L)

.

Abelian and Tauberian theorem

Abelian theorem

If a series is convergent to

A

then it is Lambert summable to

A

.

Tauberian theorem

Suppose that

infty
\sum
n=1

an

is Lambert summable to

A

. Then it is Abel summable to

A

. In particular, if
infty
\sum
n=0

an

is Lambert summable to

A

and

nan\geq-C

then
infty
\sum
n=0

an

converges to

A

.

The Tauberian theorem was first proven by G. H. Hardy and John Edensor Littlewood but was not independent of number theory, in fact they used a number-theoretic estimate which is somewhat stronger than the prime number theorem itself. The unsatisfactory situation around the Lambert Tauberian theorem was resolved by Norbert Wiener.

Examples

infty
\sum
n=1
\mu(n)
n

=0(L)

, where μ is the Möbius function. Hence if this series converges at all, it converges to zero. Note that the sequence
\mu(n)
n
satisfies the Tauberian condition, therefore the Tauberian theorem implies
infty
\sum
n=1
\mu(n)
n

=0

in the ordinary sense. This is equivalent to the prime number theorem.
infty
\sum
n=1
Λ(n)-1
n

=-2\gamma(L)

where

Λ

is von Mangoldt function and

\gamma

is Euler's constant. By the Tauberian theorem, the ordinary sum converges and in particular converges to

-2\gamma

. This is equivalent to

\psi(x)\simx

where

\psi

is the second Chebyshev function.

See also

References

. Hugh L. Montgomery . Hugh Montgomery (mathematician) . Robert C. Vaughan . Robert Charles Vaughan (mathematician) . Multiplicative number theory I. Classical theory . Cambridge tracts in advanced mathematics . 97 . 2007 . 978-0-521-84903-6 . 159–160 . Cambridge Univ. Press . Cambridge.