In his 1859 paper "On the Number of Primes Less Than a Given Magnitude" Riemann sketched an explicit formula for the normalized prime-counting function which is related to the prime-counting function by which takes the arithmetic mean of the limit from the left and the limit from the right at discontinuities. His formula was given in terms of the related function in which a prime power counts as of a prime. The normalized prime-counting function can be recovered from this function by where is the Möbius function. Riemann's formula is then involving a sum over the non-trivial zeros of the Riemann zeta function. The sum is not absolutely convergent, but may be evaluated by taking the zeros in order of the absolute value of their imaginary part. The function occurring in the first term is the logarithmic integral function given by the Cauchy principal value of the divergent integral The terms involving the zeros of the zeta function need some care in their definition as has branch points at 0 and 1, and are defined by analytic continuation in the complex variable in the region and. The other terms also correspond to zeros: The dominant term comes from the pole at, considered as a zero of multiplicity −1, and the remaining small terms come from the trivial zeros. This formula says that the zeros of the Riemann zeta function control the oscillations of primes around their "expected" positions. The first rigorous proof of the aforementioned formula was given by von Mangoldt in 1895: it started with a proof of the following formula for the Chebyshev's function where the LHS is an inverse Mellin transform with and the RHS is obtained from the residue theorem, and then converting it into the formula that Riemann himself actually sketched. This series is also conditionally convergent and the sum over zeroes should again be taken in increasing order of imaginary part: The error involved in truncating the sum to is always smaller than in absolute value, and when divided by the natural logarithm of, has absolute value smaller than divided by the distance from to the nearest prime power.
Weil's explicit formula
There are several slightly different ways to state the explicit formula. André Weil's form of the explicit formula states where
ρ runs over the non-trivial zeros of the zeta function
Roughly speaking, the explicit formula says the Fourier transform of the zeros of the zeta function is the set of prime powers plus some elementary factors. Once this is said, the formula comes from the fact that the Fourier transform is a unitary operator, so that a scalar product in time domain is equal to the scalar product of the Fourier transforms in the frequency domain. The terms in the formula arise in the following way.
The left-hand side is a sum over all zeros of ζ * counted with multiplicities, so the poles at 0 and 1 are counted as zeros of order −1.
Weil's explicit formula can be understood like this. The target is to be able to write that : So that the Fourier transform of the non trivial zeros is equal to the primes power symmetrized plus a minor term. Of course, the sum involved are not convergent, but the trick is to use the unitary property of Fourier transform which is that it preserves scalar product : where are the Fourier transforms of. At a first look, it seems to be a formula for functions only, but in fact in many cases it also works when is a distribution. Hence, by setting and carefully choosing a function and its Fourier transform, we get the formula above.
Riemann-Weyl formula can be generalized to other arithmetical functions and not only for the Von-Mangoldt function, for example for the Möbius function we have Also for the Liouville function we have For the Euler-Phi function the explicit formula reads in all cases the sum is related to the imaginary part of the Riemann zeros and the test functionf and g are related by a Fourier transform for the divisor function of zeroth order
Generalizations
The Riemann zeta function can be replaced by a Dirichlet L-function of a Dirichlet character χ. The sum over prime powers then gets extra factors of χ, and the terms Φ and Φ disappear because the L-series has no poles. More generally, the Riemann zeta function and the L-series can be replaced by the Dedekind zeta function of an algebraic number field or a Hecke L-series. The sum over primes then gets replaced by a sum over prime ideals.
Applications
Riemann's original use of the explicit formula was to give an exact formula for the number of primes less than a given number. To do this, take F to be y1/2/log for 0 ≤ y ≤ x and 0 elsewhere. Then the main term of the sum on the right is the number of primes less than x. The main term on the left is Φ; which turns out to be the dominant terms of the prime number theorem, and the main correction is the sum over non-trivial zeros of the zeta function.
Hilbert–Pólya conjecture
According to the Hilbert-Pólya conjecture, the complex zeroes ρ should be the eigenvalues of some linear operatorT. The sum over the zeros of the explicit formula is then given by a trace: Development of the explicit formulae for a wide class of L-functions was given by, who first extended the idea to local zeta-functions, and formulated a version of a generalized Riemann hypothesis in this setting, as a positivity statement for a generalized function on a topological group. More recent work by Alain Conneshas gone much further into the functional-analytic background, providing a trace formula the validity of which is equivalent to such a generalized Riemann hypothesis. A slightly different point of view was given by, who derived the explicit formula of Weil via harmonic analysis on adelic spaces.