Cluster k1629 · Lean proof of the Riemann hypothesis
Size data, parameter choices and lattice-length bounds
Lattices & mass · before 1900 · Undergraduate level
A small cluster of technical bookkeeping around "size data": records of real parameters (a large number x, a tiny exponent epsilon, constants) attached to the host number-field setup. Statements bound sums of local quantities by multiples of base sizes, relate lattice lengths at each place to counted lengths, and say that suitable large constants exist. One named hypothesis bounds a combination of quantities by a constant times a ratio. Most items are stated hypotheses of type Prop or small lemmas used to line up parameters for later steps. The role is a guess from names and statements.
3 import steps to the main theorem.
Feeds into 561 clusters · 21% of the map.
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. Names and descriptions on this map are written by Claude from samples of the code and may be wrong.
Why it's in the proof
- This cluster: Size data, parameter choices and lattice-length bounds
- Family bounds on shares, degrees and admissible constantsAdelic lattices, level subgroups and explicit bounds
- Mertens-type estimates and zero sums for Dirichlet L-functionsHecke characters and primes in progressions
- ★ Main theorem: Main theorem statements, plus the explicit formula for Dirichlet L-functions
Each step is an import.
Prerequisite concepts
Real analysisLattices in n dimensions, covolume and counting pointsDedekind domains (unique factorisation of ideals)
Builds on 7 clusters
Direct imports: clusters with a file that a file here imports.
By theme: Adelic lattices, level subgroups and explicit bounds (5), Wach lattices and admissible filtered modules (1), Hecke characters and primes in progressions (1)
Key: Size data, places and constants for families of lattices, Local formal-group data, ties and served orbits at inert primes, Numerical comparison, Mertens-type bounds and sum-over-primes hypotheses
- Explicit parameter choices: scale, ranks and host conditionsAdelic lattices, level subgroups and explicit bounds
- Size data, places and constants for families of latticesAdelic lattices, level subgroups and explicit bounds
- Local formal-group data, ties and served orbits at inert primesAdelic lattices, level subgroups and explicit bounds
- Numerical comparison, Mertens-type bounds and sum-over-primes hypothesesAdelic lattices, level subgroups and explicit bounds
- Family parameters, size data and stable lattices for divisibility argumentAdelic lattices, level subgroups and explicit bounds
- Twisted places, size data and polynomial bounds for design familiesWach lattices and admissible filtered modules
- Host-field facts on thick orbits, stabilizers and Frobenius conditionsHecke characters and primes in progressions
Needed by 4 clusters
Direct importers: clusters with a file that imports a file here.
By theme: Adelic lattices, level subgroups and explicit bounds (4)
Key: Family bounds on shares, degrees and admissible constants (on the route to the main theorem), Numerical comparison, Mertens-type bounds and sum-over-primes hypotheses, Ambient Hermitian lattice data, row sides and sharp lattice bounds
19 Lean files, main folder Formalism.SharpRestriction.InertJacobiLevels.
Explore