Explicit formulae for L-functions

In mathematics, the explicit formulae for L-functions are relations between sums over the complex number zeroes of an L-function and sums over prime powers, introduced by Riemann (1859) for the Riemann zeta function. Such explicit formulae have been applied also to questions on bounding the discriminant of an algebraic number field, and the conductor of a number field.

Riemann's explicit formula

In his 1859 paper "On the Number of Primes Less Than a Given Magnitude" Riemann sketched an explicit formula (it was not fully proven until 1895 by von Mangoldt, see below) for the normalized prime-counting function π₀(x) which is related to the prime-counting function π(x) by

$\pi _{0}(x)={\frac {1}{2}}\lim _{h\to 0}\left[\,\pi (x+h)+\pi (x-h)\,\right]\,,$

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

$f(x)=\pi _{0}(x)+{\frac {1}{2}}\,\pi _{0}(x^{1/2})+{\frac {1}{3}}\,\pi _{0}(x^{1/3})+\cdots$

in which a prime power pⁿ counts as 1⁄n of a prime. The normalized prime-counting function can be recovered from this function by

$\pi _{0}(x)=\sum _{n}{\frac {1}{n}}\,\mu (n)\,f(x^{1/n})=f(x)-{\frac {1}{2}}\,f(x^{1/2})-{\frac {1}{3}}\,f(x^{1/3})-{\frac {1}{5}}\,f(x^{1/5})+{\frac {1}{6}}\,f(x^{1/6})-\cdots ,$

where μ(n) is the Möbius function. Riemann's formula is then

$f(x)=\operatorname {li} (x)-\sum _{\rho }\operatorname {li} (x^{\rho })-\log(2)+\int _{x}^{\infty }{\frac {dt}{~t\,(t^{2}-1)~\log(t)~}}$

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 li occurring in the first term is the (unoffset) logarithmic integral function given by the Cauchy principal value of the divergent integral

$\operatorname {li} (x)=\int _{0}^{x}{\frac {dt}{\,\log(t)\,}}\,.$

The terms li(x^ρ) involving the zeros of the zeta function need some care in their definition as li has branch points at 0 and 1, and are defined by analytic continuation in the complex variable ρ in the region x > 1 and Re(ρ) > 0. The other terms also correspond to zeros: The dominant term li(x) comes from the pole at s = 1, 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. (For graphs of the sums of the first few terms of this series see Zagier 1977.)

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 ψ 

$\psi _{0}(x)={\dfrac {1}{2\pi i}}\int _{\sigma -i\infty }^{\sigma +i\infty }\left(-{\dfrac {\zeta '(s)}{\zeta (s)}}\right){\dfrac {x^{s}}{s}}\,ds=x-\sum _{\rho }{\frac {~x^{\rho }\,}{\rho }}-\log(2\pi )-{\dfrac {1}{2}}\log(1-x^{-2})$

where the LHS is an inverse Mellin transform with

$\sigma >1\,,\quad \psi (x)=\sum _{p^{k}\leq x}\log p\,,\quad {\text{and}}\quad \psi _{0}(x)={\frac {1}{2}}\lim _{h\to 0}(\psi (x+h)+\psi (x-h))$

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:

$\sum _{\rho }{\frac {x^{\rho }}{\rho }}=\lim _{T\to \infty }S(x,T)$   where   $S(x,T)=\sum _{\rho :\left|\Im \rho \right|\leq T}{\frac {x^{\rho }}{\rho }}\,.$

The error involved in truncating the sum to S(x,T) is always smaller than ln(x) in absolute value, and when divided by the natural logarithm of x, has absolute value smaller than x⁄T divided by the distance from x 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

${\begin{aligned}&\Phi (1)+\Phi (0)-\sum _{\rho }\Phi (\rho )\\&=\sum _{p,m}{\frac {\log(p)}{p^{m/2}}}{\Big (}F(\log(p^{m}))+F(-\log(p^{m})){\Big )}-{\frac {1}{2\pi }}\int _{-\infty }^{\infty }\varphi (t)\Psi (t)\,dt\end{aligned}}$

where

• ρ runs over the non-trivial zeros of the zeta function
• p runs over positive primes
• m runs over positive integers
• F is a smooth function all of whose derivatives are rapidly decreasing
• $\varphi$ is a Fourier transform of F:
  $$\varphi (t)=\int _{-\infty }^{\infty }F(x)e^{itx}\,dx$$
• $\Phi (1/2+it)=\varphi (t)$
• $\Psi (t)=-\log(\pi )+\operatorname {Re} (\psi (1/4+it/2))$, where $\psi$ is the digamma 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 terms on the right hand side come from the logarithmic derivative of
  $$\zeta ^{*}(s)=\Gamma (s/2)\pi ^{-s/2}\prod _{p}{\frac {1}{1-p^{-s}}}$$
  with the terms corresponding to the prime p coming from the Euler factor of p, and the term at the end involving Ψ coming from the gamma factor (the Euler factor at infinity).
• 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:

${\frac {d}{du}}\left[\sum _{n\leq e^{|u|}}\Lambda (n)+{\frac {1}{2}}\ln(1-e^{-2|u|})\right]=\sum _{n=1}^{\infty }\Lambda (n)\left[\delta (u+\ln n)+\delta (u-\ln n)\right]+{\frac {1}{2}}{\frac {d\ln(1-e^{-2|u|})}{du}}=e^{u}-\sum _{\rho }e^{\rho u},$

where Λ is the von Mangoldt function.

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:

$\int _{-\infty }^{\infty }f(u)g^{*}(u)\,du=\int _{-\infty }^{\infty }F(t)G^{*}(t)\,dt$

where $F,G$ are the Fourier transforms of $f,g$. At a first look, it seems to be a formula for functions only, but in fact in many cases it also works when $g$ is a distribution. Hence, by setting

$$g(u)=\sum _{n=1}^{\infty }\Lambda (n)\left[\delta (u+\ln n)+\delta (u-\ln n)\right],$$

where $\delta (u)$ is the Dirac delta, and carefully choosing a function $f$ and its Fourier transform, we get the formula above.

Explicit formulae for other arithmetical functions

The Riemann-Weil formula can be generalized to arithmetical functions other than the von Mangoldt function. For example for the Möbius function we have

$\sum _{n=1}^{\infty }{\frac {\mu (n)}{\sqrt {n}}}g(\log n)=\sum _{\rho }{\frac {h(\gamma )}{\zeta '(\rho )}}+\sum _{n=1}^{\infty }{\frac {1}{\zeta '(-2n)}}\int _{-\infty }^{\infty }dxg(x)e^{-(2n+1/2)x}.$

Also for the Liouville function we have

$\sum _{n=1}^{\infty }{\frac {\lambda (n)}{\sqrt {n}}}g(\log n)=\sum _{\rho }{\frac {h(\gamma )\zeta (2\rho )}{\zeta '(\rho )}}+{\frac {1}{\zeta (1/2)}}\int _{-\infty }^{\infty }dx\,g(x).$

For the Euler-Phi function the explicit formula reads

$\sum _{n=1}^{\infty }{\frac {\varphi (n)}{\sqrt {n}}}g(\log n)={\frac {6}{\pi ^{2}}}\int _{-\infty }^{\infty }dx\,g(x)e^{3x/2}+\sum _{\rho }{\frac {h(\gamma )\zeta (\rho -1)}{\zeta '(\rho )}}+{\frac {1}{2}}\sum _{n=1}^{\infty }{\frac {\zeta (-2n-1)}{\zeta '(-2n)}}\int _{-\infty }^{\infty }dx\,g(x)e^{-x(2n+1/2)}.$

In all cases the sum is related to the imaginary part of the Riemann zeros ${\textstyle \rho ={\frac {1}{2}}+i\gamma }$ and the function h is related to the test function g by a Fourier transform, ${\textstyle g(u)={\frac {1}{2\pi }}\int _{-\infty }^{\infty }h(x)\exp(-iux)}$.

For the divisor function of zeroth order $\sum _{n=1}^{\infty }\sigma _{0}(n)f(n)=\sum _{m=-\infty }^{\infty }\sum _{n=1}^{\infty }f(mn)$.

Using a test function of the form $g(x)=f(ye^{x})e^{ax}$ for some positive a turns the Poisson summation formula into a formula involving the Mellin transform. Here y is a real parameter.

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 χ(p ^m), and the terms Φ(1) and Φ(0) 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(log(y)) to be y^1/2/log(y) 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 Φ(1); 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. (There is a minor technical problem in using this case, in that the function F does not satisfy the smoothness condition.)

Hilbert–Pólya conjecture

According to the Hilbert–Pólya conjecture, the complex zeroes ρ should be the eigenvalues of some linear operator T. The sum over the zeros of the explicit formula is then (at least formally) given by a trace:

$\sum _{\rho }F(\rho )=\operatorname {Tr} (F({\widehat {T}})).\!$

Development of the explicit formulae for a wide class of L-functions was given by Weil (1952), 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 Connes has 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 Meyer (2005), who derived the explicit formula of Weil via harmonic analysis on adelic spaces.

See also

• Selberg trace formula
• Selberg zeta function

References

• Ingham, A.E. (1990) [1932], The Distribution of Prime Numbers, Cambridge Tracts in Mathematics and Mathematical Physics, vol. 30, reissued with a foreword by R. C. Vaughan (2nd ed.), Cambridge University Press, ISBN 978-0-521-39789-6, MR 1074573, Zbl 0715.11045
• Lang, Serge (1994), Algebraic number theory, Graduate Texts in Mathematics, vol. 110 (2nd ed.), New York, NY: Springer-Verlag, ISBN 0-387-94225-4, Zbl 0811.11001
• Riemann, Bernhard (1859), "Ueber die Anzahl der Primzahlen unter einer gegebenen Grösse", Monatsberichte der Berliner Akademie
• Weil, André (1952), "Sur les "formules explicites" de la théorie des nombres premiers" [On "explicit formulas" in the theory of prime numbers], Comm. Sém. Math. Univ. Lund [Medd. Lunds Univ. Mat. Sem.] (in French), Tome Supplémentaire: 252–265, MR 0053152, Zbl 0049.03205
• von Mangoldt, Hans (1895), "Zu Riemanns Abhandlung "Über die Anzahl der Primzahlen unter einer gegebenen Grösse"" [On Riemann's paper "The number of prime numbers less than a given magnitude"], Journal für die reine und angewandte Mathematik (in German), 114: 255–305, ISSN 0075-4102, JFM 26.0215.03, MR 1580379
• Meyer, Ralf (2005), "On a representation of the idele class group related to primes and zeros of L-functions", Duke Math. J., 127 (3): 519–595, arXiv:math/0311468, doi:10.1215/s0012-7094-04-12734-4, ISSN 0012-7094, MR 2132868, S2CID 119176169, Zbl 1079.11044
• Zagier, Don (1977), "The first 50 million prime numbers", The Mathematical Intelligencer, 1 (S2): 7–19, doi:10.1007/bf03351556, S2CID 37866599

Further reading

• Edwards, H.M. (1974), Riemann's zeta function, Pure and Applied Mathematics, vol. 58, New York-London: Academic Press, ISBN 0-12-232750-0, Zbl 0315.10035
• Riesel, Hans (1994), Prime numbers and computer methods for factorization, Progress in Mathematics, vol. 126 (2nd ed.), Boston, MA: Birkhäuser, ISBN 0-8176-3743-5, Zbl 0821.11001