Cluster k0677 · Lean proof of the Riemann hypothesis
Main theorem statements, plus the explicit formula for Dirichlet L-functions
Classical number theory · 1900–1949 · Graduate level
Statements.lean spells out the Riemann hypothesis and its Dirichlet L-function versions, and Main.lean proves them by pointing to the final assembly elsewhere. Most of the other files prove a standard explicit formula: a prime sum twisted by a character is controlled by the zeros of its L-function, with the zeros near any height counted and Perron's formula bounded. A third set of files only states alternative "if these prime-sum bounds hold, then RH follows" claims, which are never proved.
This cluster holds the main theorem.
The whole proof feeds into it: it builds on all 2,646 other clusters.
Proof status as of 22 Nov 2026: on 21 Nov 2026 a joint statement by the Lean and Mathlib communities, endorsed by the Lean FRO and the Mathlib Initiative, certified the Lean statement and proof. More independent checks: math.mit.edu/~drew/grh. This cluster's name and description were checked against its full Lean code; the other names and descriptions on this map are written by Claude from samples of the code and may be wrong.
Checked against the code
This name and description were checked against every Lean file in the cluster (source commit 40e56bab) and corrected where the earlier, AI-drafted ones were wrong. Some of the declarations the check rests on:
riemannHypothesis in Main: RiemannHypothesis := rhOfAll; plus the GRH-for-Dirichlet theorems LFunction_ne_zero_of_half_lt_re, LFunction_eq_zero_re, LFunction_eq_zero_re_of_isPrimitiveDirichletLNonvanishingRightOfHalf in Statements: L(chi,s) != 0 for Re s > 1/2 except at the poleexplicitFormula_closed / zerosWindow_closed in Formalism.PeriodIntegrals.ExplicitFormulaCounts.ExplicitFormula: truncated explicit formula and local zero count, proved
Prerequisite concepts
Dirichlet L-functionsDirichlet charactersWhat RH saysζ(s) as a seriesComplex analysisChebyshev functions theta and psiAnalytic continuation
In the learning path
References
Davenport, Multiplicative Number Theory · ch. 17-19 (explicit formula, zero-free region)Background reading suggested by the AI namer · unchecked
GRH for Dirichlet L-functions — H. Davenport, Multiplicative Number Theory (book)Cited in the author's note · matched by word overlap · unchecked
von Mangoldt function, explicit formula — H. Davenport, Multiplicative Number Theory, ch. 17-19Cited in the author's note · matched by word overlap · unchecked
Weil explicit formula — A. Weil, "Sur les formules explicites de la theorie des nombres premiers" (1952)Cited in the author's note · matched by word overlap · unchecked
Turan power-sum method — P. Turan, On a New Method of Analysis and its Applications (book, 1984)Cited in the author's note · matched by word overlap · unchecked
Builds on 3 clusters
By theme: Hecke characters and primes in progressions (3)
Key: Primes in progressions, Siegel-Walfisz and exceptional zero bounds, Zero-free region for zeta and Dirichlet L-functions, Mertens-type estimates and zero sums for Dirichlet L-functions
Needed by 8 clusters
By theme: Hecke characters and primes in progressions (7), Adelic lattices, level subgroups and explicit bounds (1)
Key: Primes in progressions, Siegel-Walfisz and exceptional zero bounds, Zero-free region for zeta and Dirichlet L-functions, Mean-square and Jacobi-symbol estimates for prime sums in progressions
65 Lean files, main folder Formalism.PeriodIntegrals.UnitaryGroupMassFormula.ExplicitFormula.
Explore