The Riemann Hypothesis — Current State of Knowledge

The Riemann zeta function, defined for $\mathrm{Re}(s)>1$ by $\zeta (s)={\sum }_{n=1}^{\infty }{n}^{-s}$, extends by analytic continuation to a meromorphic function on $\mathbb{C}$ with a single simple pole at $s=1$. It vanishes at the "trivial zeros" $s=-2,-4,-6,\dots$ and at infinitely many "nontrivial zeros" in the critical strip $0<\mathrm{Re}(s)<1$. The Riemann Hypothesis asserts that every nontrivial zero has real part exactly $\frac{1}{2}$. Its importance flows from the explicit formulas linking these zeros to the fluctuations of prime counting functions: the zeros are, quite literally, the spectrum of the primes. A surprising fact is that the statistical distribution of the zeros' spacings matches the eigenvalue statistics of large random Hermitian matrices (the Gaussian Unitary Ensemble), an empirical link discovered in a 1972 tea-time conversation between Hugh Montgomery and Freeman Dyson.

The Core Insight

Primes look random, but their randomness is structured. The structure is encoded in a single analytic object — $\zeta (s)$ — whose zeros act as a hidden frequency spectrum. The "explicit formula" expresses the deviation of $\pi (x)$ from its smooth approximation as a sum of oscillating terms $x^{\rho }$, one per zero $\rho$. A zero at $\rho =\beta +i\gamma$ contributes a wave of amplitude proportional to $x^{\beta }$. The Riemann Hypothesis says all these amplitudes share the same exponent $\beta =\frac{1}{2}$ — the primes are as evenly distributed as randomness permits, with no anomalously large clustering. Everything else in the subject is a corollary or a reformulation of this single equidistribution-of-error statement.

Formal Statement

The Riemann Zeta Function

For $\mathrm{Re}(s)>1$, define

Here $s=\sigma +it$ with $\sigma =\mathrm{Re}(s)$, $t=\mathrm{Im}(s)$, and $p$ ranges over primes. The series and product converge absolutely for $\sigma >1$.

Analytic Continuation and the Functional Equation

The completed zeta function

is entire and satisfies the symmetric functional equation

The factors $\Gamma (s/2)$ and the pole structure of $\zeta$ combine so that the zeros of $\Gamma (s/2)$ at $s=0,-2,-4,\dots$ force the trivial zeros of $\zeta$ at $s=-2,-4,-6,\dots$ (the $s=0$ pole is cancelled by the factor $s$). The completed $\xi (s)$ has zeros exactly at the nontrivial zeros of $\zeta$.

The Riemann Hypothesis

Every zero $\rho$ of $\xi (s)$ — equivalently every nontrivial zero of $\zeta (s)$ — satisfies

Counting Zeros and the Riemann–von Mangoldt Formula

Let $N(T)$ be the number of nontrivial zeros with $0<\gamma \le T$ (counted with multiplicity, $\rho =\beta +i\gamma$). Then

where $S(T)=\frac{1}{\pi }\arg \zeta (\frac{1}{2}+iT)$ is the (small, $O(\log T)$) fluctuation term.

This shows there are infinitely many nontrivial zeros, with density $\sim \frac{1}{2\pi }\log \frac{T}{2\pi }$ near height $T$.

Why It (Would) Hold — The Explicit Formula

Connecting Zeros to Primes: the Explicit Formula

We sketch the von Mangoldt explicit formula, the engine making RH equivalent to optimal prime distribution.

Bernhard Riemann | 1826–1866

Born in Breselenz, Hanover, Riemann was a student of Gauss and Dirichlet at Göttingen. His entire output on number theory consists of a single eight-page memoir (1859), written upon election to the Berlin Academy, in which he introduced the complex-analytic study of $\zeta (s)$, proved the functional equation, gave the explicit formula relating primes to zeros, and stated — almost in passing, as "very likely" (sehr wahrscheinlich) — that all nontrivial zeros lie on the critical line. He admitted he could not prove it and "set it aside." Riemann's Nachlass (unpublished notes), partly decoded by C. L. Siegel in 1932, revealed astonishing computational depth, including the Riemann–Siegel formula now used to verify zeros numerically. He died of tuberculosis at 39. His paper reshaped number theory into an analytic discipline and posed the problem that has organized the field for 165 years.

Building Intuition

Think of $\log \zeta (s)$ as a "music box" for the primes. The prime power $p^k$ contributes a pure tone of frequency $\log p^k$. The function $\psi (x)$ is the running total of how loud the primes have been up to $x$; on average it grows like $x$ (the prime number theorem). The deviation $\psi (x)-x$ is a sound wave, and the explicit formula [8] decomposes it into harmonics indexed by the zeros: a zero at height $\gamma$ on the line $\sigma =\beta$ produces a wave $\propto x^{\beta }\cos (\gamma \log x)/|\rho |$.

If all zeros sit on $\sigma =\frac{1}{2}$, every harmonic shares the same envelope $\sqrt{x}$ — none dominates, and the error stays as small as a random walk of these frequencies allows. A single off-line zero at $\sigma =0.7$ would produce a harmonic growing like $x^{0.7}$, eventually drowning out the others and creating large, systematic biases in prime gaps. RH is the statement: the prime spectrum is perfectly balanced. The location $\sigma =\frac{1}{2}$ is precisely the axis of symmetry imposed by the functional equation [3] — RH says nature chose the most symmetric possible configuration.

The critical strip: trivial zeros, the critical line, and a quadruple of nontrivial zeros symmetric about $\sigma=\tfrac12$

Worked Examples

Magnitude of the leading oscillation from the first zero

1. The paired term is $\frac{x^{{\rho }_1}}{{\rho }_1}+\frac{x^{{\bar{\rho }}_1}}{{\bar{\rho }}_1}=2\mathrm{Re}\left(\frac{x^{{\rho }_1}}{{\rho }_1}\right)$.
2. $|{\rho }_1|=\sqrt{0.25+14.1347^2}\approx 14.143$.
3. $x^{{\rho }_1}=x^{1/2}{e}^{i{\gamma }_1\log x}$. With $x=10^6$: $x^{1/2}=10^3=1000$, and $\log x=6\ln 10\approx 13.8155$, so ${\gamma }_1\log x\approx 14.1347\times 13.8155\approx 195.28$ rad.
4. Reduce modulo $2\pi$: $195.28/(2\pi )\approx 31.08$, fractional $0.08\times 2\pi \approx 0.503$ rad, $\cos (0.503)\approx 0.876$ (the phase of $x^{{\rho }_1}$; the $1/{\rho }_1$ factor adds a small phase $-\arctan (2{\gamma }_1)\approx -\pi /2$, but for a magnitude estimate we take the envelope).
5. Amplitude envelope $=\frac{2x^{1/2}}{|{\rho }_1|}=\frac{2\times 1000}{14.143}\approx 141.4$.

Counting zeros up to height $T$

1. Main term: $N(T)\approx \frac{T}{2\pi }\log \frac{T}{2\pi }-\frac{T}{2\pi }+\frac{7}{8}$.
2. Compute $\frac{T}{2\pi }=\frac{1000}{6.2832}\approx 159.155$.
3. $\frac{T}{2\pi }=159.155$; $\log (159.155)\approx 5.0699$.
4. First term: $159.155\times 5.0699\approx 806.9$.
5. Subtract $\frac{T}{2\pi }=159.155$: $806.9-159.16=647.7$.
6. Add $7/8=0.875$: $648.6$.

Common Misconceptions

What RH does and does NOT say

• RH is not "proved for the first $N$ zeros, so probably true." Numerical verification (over $10^{13}$ zeros checked, all on the line) is evidence, not proof. The functions involved have logarithmically slow features ($S(T)$ is provably unbounded), so finite checks cannot decide the conjecture. The Skewes-number phenomenon (where $\pi (x)-\mathrm{Li}(x)$ first turns positive only near $x\approx 1.4\times 10^{316}$) is a cautionary tale: number-theoretic crossovers can hide astronomically far out.
• RH does not assert there are no zeros off the line — it asserts none exist anywhere. A single counterexample anywhere in the strip refutes it.
• The "trivial zeros" $-2,-4,\dots$ are irrelevant to RH. RH concerns only zeros in $0<\sigma <1$.
• RH $\ne$ the Prime Number Theorem (PNT). PNT is the unconditional statement $\zeta (1+it)\ne 0$ (no zeros on the edge $\sigma =1$), proved 1896. RH is the vastly stronger statement that they all sit on $\sigma =\frac{1}{2}$.
• The Generalized RH (GRH) for Dirichlet $L$-functions, and the Grand RH for automorphic $L$-functions, are separate (stronger) conjectures; proving RH for $\zeta$ alone does not prove them.

The Davenport–Heilbronn function: zeros off the line are possible for *similar*-looking functions

RH is special to $\zeta$ and genuine $L$-functions; it is not a generic feature of Dirichlet-series-with-functional-equations. The Davenport–Heilbronn function is a linear combination of two Dirichlet $L$-functions:

Connections

RH within the web of mathematics

• Prime Number Theorem: PNT is the assertion that $\zeta (s)\ne 0$ on $\sigma =1$; RH sharpens the error term to optimal size via [9]. RH $\Rightarrow$ the strongest unconditional prime-gap bounds.
• Dirichlet L-functions and Generalized Riemann Hypothesis: GRH extends RH to all $L(s,\chi )$, controlling primes in arithmetic progressions; it implies the validity of fast primality and discrete-log algorithms.
• Random Matrix Theory (GUE): The Montgomery–Odlyzko law states the pair correlation of zeros matches the Gaussian Unitary Ensemble, suggesting the zeros are eigenvalues of some self-adjoint operator (the Hilbert–Pólya conjecture).
• Weil Conjectures and the function-field analogue: Over finite fields, the analogue of RH (for zeta functions of curves/varieties) was proved by Weil (1948) and Deligne (1974). The function-field zeros are eigenvalues of Frobenius acting on cohomology — a true spectral interpretation that the number-field case still lacks.
• Selberg Trace Formula: Provides a genuine spectral analogue (eigenvalues of the Laplacian on a hyperbolic surface) where the "Selberg zeta function" satisfies an exact RH, modeling the hoped-for arithmetic situation.
• Mertens Function and $\mu (n)$: RH $⟺M(x)={\sum }_{n\le x}\mu (n)=O(x^{1/2+\epsilon })$, recasting it as a square-root-cancellation statement for the Möbius function.

Real-World Applications

Concrete consequences and uses

1. Cryptographic primality testing (Miller–Rabin → deterministic under GRH). Under the Generalized Riemann Hypothesis, the Miller–Rabin test becomes a deterministic polynomial-time primality test (Gary Miller, 1976), checking witnesses up to $2(\log n{)}^2$. This underpins efficient RSA key generation.
2. Bounds on the least quadratic non-residue and primitive roots. GRH gives $O((\log n{)}^2)$ bounds (Ankeny), used in algorithms for square roots mod $p$ and discrete logarithms.
3. Sieve theory and explicit prime bounds. RH-conditional results give the sharpest known intervals guaranteed to contain a prime, relevant to cryptographic prime sampling.
4. Numerical analysis & quasi-Monte Carlo. Distribution-of-primes results inform low-discrepancy sequences and lattice rules.
5. Quantum chaos / physics of the zeta zeros. The Berry–Keating conjecture proposes a Hamiltonian $H=xp$ whose quantized spectrum reproduces the zeros; this connects RH to the semiclassical quantization of chaotic systems and has driven experimental analog-computing proposals.
6. Lattice-based and class-group cryptography. GRH-conditional bounds on class numbers and ideal-class group structure feed security analyses.
7. Verification of large prime tables & $\pi (x)$ computation. The Riemann–Siegel formula and Odlyzko–Schönhage algorithm (used to compute zeros) double as the engine for analytic computations of $\pi (x)$ at astronomical $x$.

Historical Development

• 1737 — Euler. Discovers the Euler product $\zeta (s)={\prod }_p(1-p^{-s}{)}^{-1}$ and evaluates $\zeta (2)={\pi }^2/6$, first linking the analytic function to primes.
• 1859 — Riemann. Eight-page memoir: analytic continuation, functional equation [3], explicit formula, and the hypothesis that all nontrivial zeros have $\mathrm{Re}=\frac{1}{2}$.
• 1896 — Hadamard & de la Vallée Poussin (independently). Prove $\zeta (1+it)\ne 0$, yielding the Prime Number Theorem $\pi (x)\sim \mathrm{Li}(x)$. A "zero-free region" near $\sigma =1$ is established, the unconditional backbone.
• 1900 — Hilbert. Lists RH as part of Problem 8 in his famous Paris address, cementing it as a central open problem.
• 1914 — Hardy. Proves infinitely many zeros lie exactly on the critical line (no statement they are all there).
• 1932 — Siegel. Decodes Riemann's Nachlass, recovering the Riemann–Siegel formula, the basis of all subsequent numerical verification.
• 1942 — Selberg. Shows a positive proportion of zeros lie on the line; Levinson (1974) raises it to $>1/3$, Conrey (1989) to $>2/5$.
• 1972 — Montgomery & Dyson. Pair-correlation conjecture links zero spacings to the GUE of random matrix theory, born from a chance Princeton tea conversation.
• 1974 — Deligne. Proves the Weil conjectures, establishing the function-field analogue of RH, the strongest evidence that an arithmetic-spectral proof should exist.
• 2000 — Clay Mathematics Institute. Names RH one of the seven Millennium Prize Problems ($1,000,000).VerificationbyGourdon–Demichel(2004)confirmsthefirst$10^{13}$ zeros on the line.

Subtleties & Limits

The state of the assault on RH (2024)

• No proof, no disproof. Despite 165 years and verification of $>10^{13}$ zeros, RH remains open.
• The Hilbert–Pólya program seeks a self-adjoint operator $H$ whose eigenvalues are the imaginary parts $\gamma$ (forcing them real, hence zeros on the line). The Berry–Keating $H=xp$ heuristic and Connes' noncommutative-geometry trace formula are the leading incarnations; none yet yields the operator.
• The de Branges approach via Hilbert spaces of entire functions has gaps; the necessary positivity conditions remain unverified and a counterexample to the precise formulation was identified.
• Function-field success vs. number-field failure. Deligne's proof uses étale cohomology and Frobenius eigenvalues — tools that do not exist over $\mathbb{Q}$. Constructing the "field with one element" ${\mathbb{F}}_1$ or an arithmetic site (Connes–Consani) to import these ideas is a major active program.
• Equivalent reformulations abound (Robin's inequality on $\sigma (n)$, the Nyman–Beurling closure criterion in $L^2(0,1)$, the Báez-Duarte sequence, the Lagarias inequality $\sigma (n)\le H_n+e^{H_n}\log H_n$), but none has cracked the core difficulty: encoding the Euler product's positivity into a spectral or variational statement.
• The barrier of $S(T)$. Since $S(T)={\Omega }_{\pm }(\log T/\log \log T)$ (Montgomery, Selberg), the fluctuations grow without bound; any proof must control these unbounded oscillations, which finite computation cannot.

See Also