The Riemann Hypothesis: The Greatest Unsolved Problem in Mathematics
We explore the Riemann Hypothesis — the conjecture that all non-trivial zeros of the Riemann zeta function have real part 1/2 — its deep connections to prime numbers, and why it remains the most important open problem in mathematics.
The Conjecture
The Riemann Hypothesis (1859)
All non-trivial zeros of the Riemann zeta function have real part equal to .
The Riemann Hypothesis (RH) is listed as one of the seven Millennium Prize Problems by the Clay Mathematics Institute, with a $1,000,000 reward for a proof or disproof. It has been open since 1859 and is widely considered the most important unsolved problem in pure mathematics.
The Riemann Zeta Function
Definition and Analytic Continuation
For , the zeta function is defined by the convergent series:
This series diverges for , but extends to a meromorphic function on all of with a single simple pole at with residue .
The analytic continuation can be obtained via the functional equation or by the integral representation:
which extends to the whole plane via contour integration.
The Functional Equation
Functional Equation
Or in the symmetric form: define . Then:
This symmetry about the line is the reason the critical line plays a central role.
Trivial and Non-Trivial Zeros
Trivial Zeros
From the functional equation, at (the trivial zeros), because at these points.
Non-Trivial Zeros
All other zeros lie in the critical strip . The Riemann Hypothesis asserts that they all lie on the critical line .
The first few non-trivial zeros (on the upper half of the critical line) are:
Over zeros have been computed, and all lie exactly on .
Connection to Prime Numbers
Euler's Product
This product formula encodes the fundamental theorem of arithmetic and shows that the analytic properties of are intimately tied to the distribution of primes.
The Explicit Formula
Riemann derived a remarkable formula connecting primes and zeros of :
where and the sum runs over all non-trivial zeros .
Each zero contributes an oscillatory term of magnitude . If for all zeros (RH), these oscillations have size — the smallest possible. If any zero has , the error in the Prime Number Theorem is larger.
RH and Prime Counting
If the Riemann Hypothesis is true:
This is the strongest possible error bound for the Prime Number Theorem.
Evidence For the Hypothesis
Numerical Evidence
Over non-trivial zeros have been computed, all on the critical line. The first zero off the line (if it exists) must have imaginary part greater than .
Partial Results
- Hardy (1914): Infinitely many zeros lie on the critical line.
- Selberg (1942): A positive proportion of zeros lie on the critical line.
- Levinson (1974): At least of zeros are on the critical line.
- Conrey (1989): At least of zeros are on the critical line.
- Zero-free regions: for (various authors), but no one has proved for all zeros.
Analogues
The Riemann Hypothesis has been proved for the analogous zeta functions over finite fields (the Weil conjectures, proved by Deligne in 1974). This is the strongest indirect evidence.
Consequences of RH
The Riemann Hypothesis, if true, would have enormous consequences:
Prime Gaps
RH implies , where is the -th prime. This is much stronger than what is currently known unconditionally.
Goldbach-Type Results
Many results in additive number theory (e.g., the ternary Goldbach conjecture, already proved) become simpler or stronger under RH.
Cryptography
The security of RSA encryption relies on the difficulty of factoring large numbers. RH would sharpen our understanding of the distribution of primes, though it would not directly break RSA.
The Generalized Riemann Hypothesis
The GRH extends RH to all Dirichlet -functions and is used (often as an unproven hypothesis) throughout analytic number theory and algebraic number theory.
Why It's Hard
Several features make RH resistant to proof:
-
Analytic nature. The zeros of are controlled by subtle cancellations in oscillatory integrals, not by algebraic identities.
-
No known structural reason. Unlike the finite field case, where the zeros are eigenvalues of a Frobenius endomorphism, there is no known geometric or algebraic object whose spectrum gives the zeros of .
-
The Hilbert-Pólya conjecture. It has been speculated that the zeros correspond to eigenvalues of a self-adjoint operator. If true, RH would follow from the spectral theorem. But no such operator has been found.
-
Random matrix connections. Montgomery (1973) discovered that the pair correlation of zeros matches the eigenvalue statistics of random unitary matrices (GUE). This deep connection, confirmed computationally, remains unexplained.
A Timeline
| Year | Event |
|---|---|
| 1737 | Euler discovers the product formula |
| 1859 | Riemann's memoir: analytic continuation, functional equation, explicit formula, RH |
| 1896 | Hadamard and de la Vallée-Poussin prove PNT (using ) |
| 1900 | Hilbert lists RH as problem 8 |
| 1914 | Hardy: infinitely many zeros on critical line |
| 1974 | Deligne proves Weil conjectures (RH for finite fields) |
| 2000 | Clay Millennium Prize: $1,000,000 for proof or disproof |
Summary
References
- Riemann, B., "Ueber die Anzahl der Primzahlen unter einer gegebenen Grösse," Monatsberichte der Berliner Akademie, 1859. English translation
- Edwards, H. M., Riemann's Zeta Function, Academic Press, 1974. Reprinted by Dover, 2001.
- Titchmarsh, E. C., The Theory of the Riemann Zeta-Function, 2nd edition (revised by D. R. Heath-Brown), Oxford University Press, 1986.
- Bombieri, E., "The Riemann Hypothesis," Clay Mathematics Institute, 2000. Official problem description
- Wikipedia — Riemann hypothesis
- Numberphile — The Riemann Hypothesis (YouTube)