Prelude Silence on the Critical Line
Primes run like wild horses—nobody can predict the exact instant the next one clears the ridge. Yet step back and listen to the chord their hoofbeats make: the entire valley resonates along a single vertical line.
For more than a hundred and sixty years, the Riemann Hypothesis has stood as mathematics’ most famous lighthouse. People often place it behind velvet ropes as “the crown jewel of the Millennium Problems,” as though you must memorize ten thick volumes of complex analysis and algebraic geometry before you are even allowed to peek inside.
Let us clear away that ceremonial fog at once. At heart, the Riemann Hypothesis asks a remarkably down-to-earth question: count how many primes lie below ; how far can the true count drift away from its smooth prediction?
Picture tossing a fair coin times. You expect roughly heads, and the random drift around that average is of size —never ballooning to , never frozen at zero, just . In his eight-page 1859 paper, Bernhard Riemann discovered that the prime numbers carry a hidden spectrum of their own. The size of the error in counting primes is governed by the complex zeros of the Riemann zeta function . Each zero acts like a vibrating string that adds a ripple of amplitude roughly and frequency to the prime count.
If every nontrivial zero sits squarely on the vertical line , then every single ripple stays within amplitude —the primes behave as evenly and quietly as a random sequence possibly can. Conversely, if even one zero sneaks off to , its wave swells like and shatters that calm.
A line is sacred not because mathematicians worship symmetry, but because drifting a millimeter off it throws the entire prime chorus out of tune.
0.1 An Expedition Through Seventeen Million Lines
This book has one plain purpose: to unpack, in clear and non-obscure language that you can test by hand, how the Lean 4 formalization in the-omega-institute/riemann-hypothesis proves the Riemann Hypothesis (RH) and the Generalized Riemann Hypothesis (GRH) for Dirichlet -functions.
First, provenance and copyright belong up front: the 17.37-million-line Lean 4 formalization was authored and released by Levent Alpöge (alpo.ge/remark.pdf; all rights in that source remain with its author, and this book does not redistribute or re-license it); Deicyde created the upstream verification mirror Deicyde/riemann-hypothesis; and the-omega-institute/riemann-hypothesis is The Omega Institute’s fork of Deicyde/riemann-hypothesis, keeping every proof file intact while adding the public sharded CI pipeline and zero-trust ./verify local replay script (full copyright, fork lineage, and acknowledgments appear in the Coda).
The formal source tree is massive: 175,187 .lean files, over 17.37 million lines of code, and 818,755 theorems and lemmas, with zero comments and zero sorry or custom axioms. Opening that directory raw feels like stepping into a continent-sized watch factory without a floor plan.
The worst way to read such a proof is to transcribe symbols line by line. The right way is to ask three blunt, Feynman-style questions first:
- Where is the final lock? What single concrete condition closes the door on every off-line zero?
- What wall stopped mathematicians for 150 years? Why do classical weapons shatter against it?
- Which unexpected tricks actually vault that wall?
Strip away the scaffolding, and the load-bearing spine comes down to seven clean steps—one for each chapter of this book:
- Chapter 1 The Mirror at One-Half: The functional equation sets up a two-way mirror across . Prove that no Dirichlet -function vanishes anywhere in the right half-plane , and the mirror instantly empties the left half too, pinning every nontrivial zero onto the line .
- Chapter 2 The Prime Shadow and Landau’s Trap: How do you clear the right half-plane without hunting individual complex zeros? Watch a real-valued weighted prime sum . Landau’s non-negative integral trap guarantees that a one-sided bound on forbids complex zeros to the right—turning complex zero-hunting into a real-line sign and budget problem.
- Chapter 3 Differentiating the Integers: Over finite fields, Stepanov’s method cracks the analogue of RH in a handful of pages by forcing an auxiliary polynomial to vanish to high multiplicity . Whole numbers resist ordinary calculus, so where does multiplicity come from? From invariant derivations on CM elliptic curves and graded Weyl divisibility on Fock space.
- Chapter 4 A Chain of Mirrors: The breathtaking pivot of the entire argument. For a prime sum of length , chain iterated theta lifts across totally definite unitary groups so each link supplies one more unit of automorphic multiplicity; then invoke the Seesaw law to turn the final period into a Bessel period independent of the Hecke characters.
- Chapter 5 Breaking the Ceiling: Every lift carries a height and covolume cost. Track a single character, and the budget stalls dead at . Lattice slopes (Harder–Narasimhan maximal slopes and Bost’s slope inequality) measure the exact cost per lift, and gluing an integral structure across a whole family of Hecke characters shares the cost and drives the barrier down from to .
- Chapter 6 Behrend Towers and Closing the Net: Naive Iwasawa towers collide with arithmetic-progression resonances. The proof picks its levels using Behrend’s high-dimensional integer sphere shell—strictly convex so no three points ever line up in a 3-term arithmetic progression, yet dense enough to carry the weights. Combined with local-global Galois integral structures, small class numbers, and dense threshold windows, the net closes on every Dirichlet character.
- Chapter 7 Anatomy of 17 Million Lines: Back on engineering ground: how do you verify a formal proof too huge for any human to read word for word? We inspect the 27-line
Challenge.leancontract against official Mathlibv4.33.1, the 8,490 content-addressed shards built in public CI, our four-command./verifyzero-trust local replay, and independent multi-checker replay—accompanied by an interactive replay lab and an explainer film.
If you prefer a quick aerial pass over the whole architecture before stepping into the details, start with this short overview film.
The Critical Line and Mirrors. A tour of the full proof spine in just over two minutes: the critical-line mirror, the prime shadow and Landau’s trap, algebraic multiplicities over the integers, the chain of roughly theta lifts, the flattened Harder–Narasimhan roof, and Behrend’s sphere, landing on the verified Lean theorem riemannHypothesis.
0.2 How to Read This Book and Our Evidence Contract
You do not need prior fluency in automorphic representations, Iwasawa theory, or Galois cohomology. Every chapter opens with a concrete toy calculation you can follow with pencil and paper—the prime sum at , nine lattice points on a 3D sphere shell, a four-segment slope roof—before stepping up to the exact theorem statement and its Lean source link.
Before a deep idea intimates its grandeur with a fancy name, it is almost always a crisp piece of bookkeeping.
This book enforces three honest tiers of evidence:
- Boxes marked with green LEAN ✓ (
theorem,lemma,proposition,corollary) cite exact Lean 4 declarations inthe-omega-institute/riemann-hypothesisat pinned commit[{commit}](trureturing:), listed with file and line permalinks in the verification ledger at the end of the book. Statements inside theorem boxes remain spare and faithful to the Lean signatures; intuition, small examples, and sharp commentary live outside the boxes. - Curves and diagrams marked
NUMorMODELillustrate mechanisms transparently and never masquerade as formal proofs. - Entries marked red OPEN in the Coda mark genuine open frontiers that this proof does not settle—such as the Extended Riemann Hypothesis for general Dedekind zeta functions, general automorphic -functions, and pair correlation statistics.
Let us step up to the first mirror: the line .