The Riemann-von Mangoldt Explicit Formula
Anchor (Master): Davenport 2000 *Multiplicative Number Theory* 3e §17 (the exact and truncated explicit formulas, the residue sum over the critical zeros); Montgomery-Vaughan 2007 *Multiplicative Number Theory I* (Cambridge UP) §12.1, §13.1-13.2 (the explicit formula and the zero-counting $N(T)$); Edwards 1974 *Riemann's Zeta Function* (Academic Press) Ch. 3 (Riemann's $J(x)$ and $\pi(x)$ via $\operatorname{Li}$); Riemann 1859; von Mangoldt 1895; Backlund 1918 (the remainder in $N(T)$)
Intuition Beginner
The previous units handed us a weighted prime count , the running total of over every prime power up to , and showed that it grows like . The explicit formula is the exact bookkeeping behind that approximate statement. It says: take the simple straight-line growth , then subtract one small correction wave for every place the zeta function vanishes. Add the main growth to all the waves and you do not get an estimate of the prime count — you get the prime count exactly, on the nose.
Think of a struck bell. The pure tone is the main term . The overtones, the faint ringing on top, are the waves coming from the zeros. Each zero of the zeta function sits at a complex location, and that location fixes both the pitch and the loudness of its wave. The whole subtlety of the primes is encoded as the spectrum of one sound. This is the precise sense in which "the primes are the music of the zeros."
There is a second formula of the same kind that counts something else: how many zeros the zeta function has up to a given height. This zero-counting formula grows in a clean, predictable way, roughly a height times the logarithm of that height. The two formulas are two halves of one dictionary. One says the zeros govern the primes; the other says exactly how many zeros there are to do the governing.
Visual Beginner
Picture the staircase of , jumping up by at each prime power, overlaid on the straight diagonal line . The staircase wiggles around the diagonal. The explicit formula explains every wiggle: each zero of the zeta function adds one gentle wave, and the waves sum to the exact gap between the staircase and the line.
psi(x)
^ staircase psi(x)
| _____/
| _____/ <- jumps by log p
| _____/
| _____/ .......... diagonal y = x
| _____/ wiggle = sum of zero-waves
|_____/
+-------------------------------------> x
adding the waves: x + wave(rho_1) + wave(rho_2) + ... = psi(x) exactly| (height) | , zeros up to height | |
|---|---|---|
The right column is the smooth Riemann-von Mangoldt estimate; the middle column is the true zero count. They track each other closely, the numerical shadow of the zero-counting formula.
Worked example Beginner
Let us see, with the smallest pieces, how the zeros build the wiggle in . The explicit formula reads $$ \psi(x) = x - (\text{a wave for each zero}) - (\text{tiny fixed leftovers}). $$
Step 1. Locate the lowest zeros. The zeta function's first vanishing in the upper half-plane sits at height about ; it comes paired with its mirror image at height . Together this pair makes the first and loudest wave.
Step 2. Size the wave. A zero on the critical line contributes a wave whose height is the square root of divided by the height of the zero. At the square root is , and the zero height is about , so the first wave has size about — a small ripple on top of the main term .
Step 3. Add the next pair. The second pair of zeros sits at height about , giving a wave of size about . The waves shrink as the zeros climb, so the first few already capture most of the wiggle.
What this tells us: the main term does the heavy lifting, and the zeros add ever-smaller ripples, , then , then less. The prime count is the diagonal plus a quickly fading chorus of waves, one per zero.
Check your understanding Beginner
Formal definition Intermediate+
Throughout, with real, is the natural logarithm, is the Riemann zeta function of 21.12.01 with its simple pole at , is the Chebyshev function with the von Mangoldt function, and denotes a critical zero of (a zero with ). The partial-fraction expansion of and the Hadamard product for the completed zeta are those established in 21.12.01 and 06.01.17. We follow Davenport [Davenport §17].
Definition (the exact explicit formula). The Riemann-von Mangoldt explicit formula is the identity, valid for not a prime power, $$ \psi(x) = x - \sum_\rho \frac{x^\rho}{\rho} - \log(2\pi) - \frac{1}{2}\log!\big(1 - x^{-2}\big), $$ the sum taken over the critical zeros in order of increasing (equivalently, paired as ). The term is the residue of the Perron integrand at the pole ; each is its residue at a zero ; is the residue at ; and collects the residues at the elementary zeros .
Definition (the truncated explicit formula). For a truncation height , the truncated explicit formula restricts the zero-sum to at the cost of an error term: $$ \psi(x) = x - \sum_{|\operatorname{Im}\rho| \le T} \frac{x^\rho}{\rho} + O!\left(\frac{x \log^2(xT)}{T} + \log x\right). $$ This is the form used for estimates: choosing as a function of trades the length of the zero-sum against the size of the remainder.
Definition (the Riemann-von Mangoldt zero-counting formula). Let count the zeros of with and . Then $$ N(T) = \frac{T}{2\pi}\log\frac{T}{2\pi} - \frac{T}{2\pi} + O(\log T). $$ The main term measures the density of zeros: the average gap between consecutive heights near is about , so zeros become denser as one climbs.
The symbols , , , the critical zeros , the completed zeta , the counting function , the logarithmic integral , and Riemann's prime-counting are recorded in _meta/NOTATION.md. The elementary zeros are the points from the functional equation of 21.12.01.
Counterexamples to common slips
- "The zero-sum converges absolutely." It does not. The series is only conditionally convergent, and only when the zeros are paired (or summed in order of increasing ). Pairing with makes real and of size , summable against the zero density only because of the cancellation.
- " counts zeros on the critical line." counts all critical-strip zeros up to height , with no assumption that they lie on . The Riemann hypothesis is the separate claim for every such zero; the formula for holds unconditionally.
- "The explicit formula proves the prime number theorem by itself." The identity is exact but unconditional, and a zero with would make its wave as large as . The PNT needs the extra input of
21.12.02, which forces every and so every wave to be .
Key theorem with proof Intermediate+
The signature result is the Riemann-von Mangoldt zero-counting formula. It is the companion to the explicit formula: the explicit formula expresses primes through the zeros, and counts those zeros, supplying the density input that bounds the conditionally convergent zero-sum. The proof is the argument principle applied to the completed zeta , whose zeros are exactly the critical zeros of 06.01.17. [Davenport §17]
Theorem (Riemann-von Mangoldt zero-counting formula). Let count, with multiplicity, the zeros of with (and ). Then for , $$ N(T) = \frac{T}{2\pi}\log\frac{T}{2\pi} - \frac{T}{2\pi} + O(\log T). $$
Proof. Recall the completed zeta of 06.01.17, entire of order one, with , whose zeros are precisely the critical zeros of . Apply the argument principle to on the rectangle with vertices , , , (taking to avoid the ordinate of any zero). The number of zeros inside is
$$
N(T) = \frac{1}{2\pi},\Delta_R \arg\xi(s),
$$
the total change of argument around , divided by . By the symmetry and the reflection , the contour splits into two halves contributing equally, so where runs from up to , then to .
Write and track the argument of each factor along . The algebraic factor and contribute . Stirling's formula for gives $$ \Delta_L \arg!\Big(\pi^{-s/2}\Gamma!\big(\tfrac{s}{2}\big)\Big) = \frac{T}{2}\log\frac{T}{2\pi} - \frac{T}{2} + O(1), $$ the main contribution. The remaining factor contributes , and a contour bound on the number of zeros of on horizontal segments gives [Montgomery-Vaughan §13]. Doubling and dividing by , $$ N(T) = \frac{1}{\pi}\Big(\frac{T}{2}\log\frac{T}{2\pi} - \frac{T}{2}\Big) + S(T) + O(1) = \frac{T}{2\pi}\log\frac{T}{2\pi} - \frac{T}{2\pi} + O(\log T). \qquad \square $$
Bridge. This counting formula builds toward the convergence of the explicit formula's zero-sum and appears again in 21.12.03 as the input to effective error terms. The foundational reason it matters is that the average gap between zero heights near is , so the density is exactly what is needed to bound the conditionally convergent : this is exactly the place where the analytic count of zeros controls the arithmetic fluctuation of the primes. Putting these together, generalises the qualitative statement "infinitely many zeros" into a quantitative law, and the central insight is that the same completed function whose Hadamard product of 06.01.17 gave the partial-fraction expansion of now, through its argument, counts the very zeros that expansion sums over — the bridge is the argument principle reading off from both the density of zeros and, via residues, their arithmetic effect.
Exercises Intermediate+
Advanced results Master
Theorem 1 (the exact explicit formula). For not a prime power [von Mangoldt 1895], $$ \psi(x) = x - \sum_\rho \frac{x^\rho}{\rho} - \log(2\pi) - \frac{1}{2}\log!\big(1 - x^{-2}\big), $$ the zero-sum conditionally convergent when paired . The identity is exact and unconditional: it holds whatever the location of the zeros, and reduces the entire arithmetic of to the geometry of the zero set. At a prime power the left side is replaced by , the midpoint of the jump.
Theorem 2 (the truncated explicit formula). For [Davenport §17],
$$
\psi(x) = x - \sum_{|\operatorname{Im}\rho| \le T} \frac{x^\rho}{\rho} + O!\left(\frac{x\log^2(xT)}{T} + \log x\right).
$$
This is the workhorse: combined with the de la Vallée Poussin zero-free region of 21.12.02 (every ) and the choice , it reproduces , and under the Riemann hypothesis it yields .
Theorem 3 (Riemann-von Mangoldt zero count). With [Montgomery-Vaughan §13], $$ N(T) = \frac{T}{2\pi}\log\frac{T}{2\pi} - \frac{T}{2\pi} + \frac{7}{8} + S(T) + O!\Big(\frac1T\Big), \qquad S(T) = O(\log T). $$ The smooth part comes from Stirling applied to the -factor in ; the fluctuating is the argument of on the critical line, whose typical size is (Selberg) though only is provable unconditionally.
Theorem 4 (Riemann's prime-counting formula). Riemann's weighted count satisfies [Riemann 1859] $$ J(x) = \operatorname{Li}(x) - \sum_\rho \operatorname{Li}(x^\rho) - \log 2 + \int_x^\infty \frac{dt}{t(t^2 - 1)\log t}, $$ and . The term is the integral-logarithm image of the wave ; the secondary explains the persistent bias for accessible , reversed infinitely often (Littlewood).
Theorem 5 (the duality primes zeros). The explicit formula is a self-dual pairing: the von Mangoldt weights at the primes and the residues at the zeros are the two sides of one Fourier-type identity, generalised by Weil to any test function with Mellin transform , $$ \sum_n \Lambda(n),g(n) = \int_0^\infty g(t),dt - \sum_\rho \hat g(\rho) + (\text{archimedean term}), $$ the von Mangoldt formula being the case . The primes and zeros are dual data of the same distribution [Davenport §17].
Synthesis. The explicit formula is the foundational reason analytic number theory is a spectral subject: it states that is the diagonal corrected by one wave per zero, and the central insight is that the residue calculus of 21.12.02 and the partial-fraction expansion of 21.12.01 are two readings of the same contour integral — one reads the pole at as the main term, the other reads the zeros as the spectrum. This is exactly the bridge from the asymptotic to an exact identity: where the contour proof produced the leading plus an error, the explicit formula names every term of that error as , and putting these together with the zero-counting — whose density governs the convergence of the zero-sum — gives the quantitative law that a zero at height with real part contributes a wave of amplitude . The central insight recurs as duality: the explicit formula is dual to the Hadamard product of 06.01.17, the prime-side is dual to the zero-side residues, and Weil's generalisation makes this Fourier duality the structural template for every -function. The bridge is everywhere the completed : its argument counts the zeros, its Hadamard product expands , and its functional equation symmetrises the explicit formula — the single object from which both halves of the dictionary, primes and zeros, are read.
Full proof set Master
Proposition 1 (exact explicit formula by residues). For not a prime power, .
Proof. By Perron's formula of 21.12.02, for , interpreted as a symmetric limit. Apply the residue theorem on rectangles with right edge and left edge for through odd integers (avoiding the elementary zeros). The integrand has simple poles at (residue , since has residue there and ), at each critical zero (residue ), at (residue ), and at each elementary zero (residue ). The partial-fraction expansion of 21.12.01 gives on horizontal lines chosen between consecutive zero ordinates, so the top and bottom edges contribute , and on the far-left edge the factor for . Summing residues,
$$
\psi(x) = x - \sum_\rho \frac{x^\rho}{\rho} - \log(2\pi) - \sum_{k \ge 1}\frac{x^{-2k}}{2k}, \qquad \sum_{k\ge1}\frac{x^{-2k}}{2k} = \tfrac12\log\frac{1}{1 - x^{-2}} = -\tfrac12\log(1 - x^{-2}),
$$
which is the claim.
Proposition 2 (zero-counting via the argument principle). .
Proof. As in the Key theorem: on the rectangle with vertices , . Symmetry and reduce this to twice the variation along . The factor contributes ; Stirling gives along equal to , and with contributing , the smooth part is . The -factor contributes , and Jensen's inequality applied to on the segment bounds the number of sign changes, giving . Doubling and dividing by yields the formula.
Proposition 3 (conditional convergence of the zero-sum). The series , summed in order of increasing , converges.
Proof. Pair with ; the combined term is , of amplitude for . Grouping zeros in dyadic blocks , each block has zeros, each term , so the block contributes . Partial summation over blocks against the oscillating cosine — whose phase sweeps many periods per block, forcing cancellation — gives convergence of the ordered sum; without the pairing/ordering the series is not absolutely convergent, since diverges like .
Proposition 4 ( to via and Möbius inversion). .
Proof. Define . Then , a finite sum (terms vanish once ), and Möbius inversion gives . Integrating the explicit formula for against (Abel summation, up to the prime-power correction) converts each term: , , and the constants into plus the convergent integral . Hence . The Möbius sum keeps the term and the term ; higher are .
Connections Master
The exact and truncated explicit formulas are the residue-sum payoff of the contour machinery of
21.12.02: that unit shifts the Perron integral of past the pole at to extract the main term , and this unit completes the sum by collecting every remaining residue, turning the asymptotic into the exact identity with the zero-sum as its error.The partial-fraction expansion of and the residue at , residue at each simple zero, and the constant are exactly those of
21.12.01; this unit assembles those residues into the explicit formula, so the analytic pole structure established there becomes the wave decomposition of here.The completed zeta , its entire order-one Hadamard factorisation, and the count of its zeros via the argument principle rest on the Weierstrass-Hadamard factorisation theory of
06.01.17; the same whose product expanded now, through its argument along a contour, yields the zero-counting that bounds the explicit formula's zero-sum.The truncated explicit formula with its remainder is the precise input to the effective error terms of
21.12.03; pairing it with a quantitative zero-free region converts the conditionally convergent zero-sum into a power-saving bound on , the step that makes the prime number theorem effective.
Historical & philosophical context Master
Bernhard Riemann's 1859 memoir [Riemann 1859] introduced the explicit formula in the form for the prime-counting function , expressing it as minus a sum over the zeros plus lower-order terms, and stated the asymptotic for the zero count . Riemann gave only sketches; the analytic estimates — the Hadamard product for the order-one entire function , the convergence of the zero-sum, the justification of the contour shift — were not in place. The first rigorous proof of the explicit formula, recast in the cleaner weighted form , is due to Hans von Mangoldt in 1895 [von Mangoldt 1895], who supplied the function and the contour argument; the formula and its weighted variant now carry both names.
The zero-counting formula was stated by Riemann and proved by von Mangoldt and, with the sharpened remainder, by Ralf Backlund in 1918; the canonical modern derivation via the argument principle on is in Davenport's Multiplicative Number Theory and Montgomery-Vaughan's text [Montgomery-Vaughan §13]. Edwards's Riemann's Zeta Function reconstructs Riemann's own route to and through and Möbius inversion [Davenport §17]. André Weil's 1952 reformulation recognised the explicit formula as a duality between a distribution on the primes and a distribution on the zeros, the form that governs the explicit formulas of all automorphic -functions.
Bibliography Master
@article{riemann1859,
author = {Riemann, Bernhard},
title = {Ueber die Anzahl der Primzahlen unter einer gegebenen Gr\"{o}sse},
journal = {Monatsberichte der K\"{o}niglichen Preu\ss{}ischen Akademie der Wissenschaften zu Berlin},
pages = {671--680},
year = {1859}
}
@article{vonmangoldt1895,
author = {von Mangoldt, Hans},
title = {Zu Riemanns Abhandlung ``Ueber die Anzahl der Primzahlen unter einer gegebenen Gr\"{o}sse''},
journal = {Journal f\"{u}r die reine und angewandte Mathematik (Crelle)},
volume = {114},
pages = {255--305},
year = {1895}
}
@article{backlund1918,
author = {Backlund, Ralf},
title = {\"{U}ber die Nullstellen der Riemannschen Zetafunktion},
journal = {Acta Mathematica},
volume = {41},
pages = {345--375},
year = {1918}
}
@book{edwards1974,
author = {Edwards, Harold M.},
title = {Riemann's Zeta Function},
publisher = {Academic Press},
year = {1974},
note = {Chapters 1, 3: Riemann's $J(x)$, $N(T)$, and the explicit formula}
}
@book{davenport2000,
author = {Davenport, Harold},
title = {Multiplicative Number Theory},
edition = {3},
series = {Graduate Texts in Mathematics},
volume = {74},
publisher = {Springer-Verlag},
year = {2000},
note = {Revised by H. L. Montgomery; \S17: the explicit formula and the zero count}
}
@book{montgomeryvaughan2007,
author = {Montgomery, Hugh L. and Vaughan, Robert C.},
title = {Multiplicative Number Theory I: Classical Theory},
series = {Cambridge Studies in Advanced Mathematics},
volume = {97},
publisher = {Cambridge University Press},
year = {2007},
note = {\S12.1: explicit formula; \S13.1--13.2: the Riemann-von Mangoldt $N(T)$}
}