The Prime Number Theorem

Filip Jaskovic

Abstract

This note presents a concise analytic proof of the prime number theorem in the Newman style, emphasizing the non-vanishing of on and a short Tauberian argument.

The prime number theorem, that the number of primes is asymptotic to , was proved (independently) by Hadamard and de la Vallée Poussin in 1896. Their proof had two elements: showing that Riemann’s zeta function has no zeros with , and deducing the prime number theorem from this. An ingenious short proof of the first assertion was found soon afterwards by the same authors and by Mertens and is reproduced here, but the deduction of the prime number theorem continued to involve difficult analysis. A proof that was elementary in a technical sense, avoiding the use of complex analysis, was found in 1949 by Selberg and Erdős, but this proof is intricate and much less clearly motivated than the analytic one. A few years later, D. J. Newman found a very simple version of the Tauberian argument needed for an analytic proof of the prime number theorem. We describe that proof, which has a beautifully simple structure and uses little beyond Cauchy’s theorem.

Recall that means , and that denotes a quantity bounded in absolute value by a fixed multiple of . We denote by the number of primes .

as .

We present the argument in a sequence of steps by studying the three functions

where always denotes a prime. The series defining and are absolutely and locally uniformly convergent for , so they define holomorphic functions on that half-plane.

for .
extends holomorphically to .

The series on the right converges absolutely for because

by the mean value theorem.

.

Hence, since changes by when changes by , we get for any and all . Summing over with gives .

and is holomorphic for .

The final sum converges for , so together with (II) this gives a meromorphic continuation of to , with poles only at and zeros of . If has a zero of order at (, ) and a zero of order at , then

The inequality

implies , so , i.e. .

converges.

Therefore (V) follows by applying the analytic theorem below to and , using (III) and (IV).

Let () be bounded and locally integrable, and suppose for extends holomorphically to . Then exists and equals .
.

Since is non-decreasing,

for such , contradicting (V). Similarly, if for some one had for all sufficiently large , then

again contradicting (V). Therefore .

The prime number theorem follows from (VI):

and partial summation yields .

This is entire. We must show . Let be large, and let be the boundary of

where is small enough that is holomorphic on and inside . By Cauchy’s theorem,

On the right semicircle (), the integrand is bounded by , where , so that contribution is . For the left part (), treat and separately. Since is entire, its contour may be replaced by the left semicircle , and the same bound follows because

Finally, the remaining integral over tends to as because its integrand is times , and uniformly on compact subsets of . Hence

Since is arbitrary, this proves the theorem.

Historical remarks

The “Riemann” zeta function was first introduced and studied by Euler, and the product representation in (I) is his. The connection with the prime number theorem was found by Riemann, who made a deep study of the analytic properties of . For the present proof, however, the nearly trivial continuation property (II) is sufficient. The ingenious estimate in (III) is essentially due to Chebyshev, who proved refined bounds showing that (and hence also ) stays between roughly and for all sufficiently large . This remained the best result until the full prime number theorem was proved in 1896 by de la Vallée Poussin and Hadamard. The short proof of non-vanishing on in (IV) is in essence Hadamard’s, later refined by de la Vallée Poussin and Mertens. The analytic theorem and its use in (V) and (VI) are due to D. J. Newman. Apart from minor simplifications, this exposition follows Newman and Korevaar.

For broader historical perspective, see Bateman and Diamond.

References

  • [B] P. Bateman and H. Diamond, A hundred years of prime numbers, Amer. Math. Monthly 103 (1996), 729-741.
  • [K] J. Korevaar, On Newman’s quick way to the prime number theorem, Math. Intelligencer 4(3) (1982), 108-115.
  • [N] D. J. Newman, Simple analytic proof of the prime number theorem, Amer. Math. Monthly 87 (1980), 693-696.
  • [T] E. C. Titchmarsh, The Theory of the Riemann Zeta Function, Oxford, 1951.