Cluster k1620 · Lean proof of the Riemann hypothesis
Primes in short intervals with prescribed norm conditions
Lattices & mass · 1900–1949 · Graduate level
A cluster of analytic estimates about prime numbers. A "short norm" claim says that primes of a given form (norms from a quadratic field of discriminant 3 mod 4, with congruence conditions) occur in short intervals, in a quantitative way with explicit constants and logarithms. Other statements say such primes are 1 modulo a number, that one can choose two primes above an exponential size bound, and basic properties of an expectation over random subsets of primes (Bernoulli sums). Several results assume the short-norm claim as a hypothesis, so they are conditional. The files use real-analysis inequalities.
3 import steps to the main theorem.
Feeds into 329 clusters · 12% 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: Primes in short intervals with prescribed norm conditions
- Primes in progressions, thin prime sets and imaginary quadratic host primesHecke characters and primes in progressions
- Zero-free region for zeta and 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. This is 1 of 3 shortest routes.
Prerequisite concepts
Chebyshev functions theta and psiPrimes and divisibilityModular arithmeticReal analysisCalculus
References
Iwaniec and Kowalski, Analytic Number Theory · ch. 5 and ch. 18Background reading suggested by the AI namer · unchecked
Builds on 12 clusters
Direct imports: clusters with a file that a file here imports.
By theme: Hecke characters and primes in progressions (6), Adelic lattices, level subgroups and explicit bounds (3), Polynomial representations of GL and Fock spaces (1), Wach lattices and admissible filtered modules (1), Representations of GL over finite fields (1)
Key: Primes in progressions, thin prime sets and imaginary quadratic host primes (on the route to the main theorem), Primes in progressions, Siegel-Walfisz and exceptional zero bounds, Counting bad polynomials and permutations (the bad-share estimates)
- Primes in progressions, Siegel-Walfisz and exceptional zero boundsHecke characters and primes in progressions
- Mertens-type estimates and zero sums for Dirichlet L-functionsHecke characters and primes in progressions
- Mean-square and Jacobi-symbol estimates for prime sums in progressionsHecke characters and primes in progressions
- Primes in progressions, thin prime sets and imaginary quadratic host primesHecke characters and primes in progressions
- Explicit parameter choices: scale, ranks and host conditionsAdelic lattices, level subgroups and explicit bounds
- Counting bad polynomials and permutations (the bad-share estimates)Representations of GL over finite fields
- Real-analysis inequalities and explicit size bounds for large scalesAdelic lattices, level subgroups and explicit bounds
- An alternative route to GRH for Dirichlet L-functions, from three inputsHecke characters and primes in progressions
- Small-order primes, thin scales and family conditions on host sizesAdelic lattices, level subgroups and explicit bounds
- Counting subspaces over finite fields and densitiesPolynomial representations of GL and Fock spaces
- Host-field facts on thick orbits, stabilizers and Frobenius conditionsHecke characters and primes in progressions
- Local cohomology setup, tied period rings, Fontaine formalism and crystalline charactersWach lattices and admissible filtered modules
Needed by 5 clusters
Direct importers: clusters with a file that imports a file here.
By theme: Hecke characters and primes in progressions (2), Adelic lattices, level subgroups and explicit bounds (2), Wach lattices and admissible filtered modules (1)
Key: Primes in progressions, thin prime sets and imaginary quadratic host primes (on the route to the main theorem), An alternative route to GRH for Dirichlet L-functions, from three inputs, Explicit parameter choices: scale, ranks and host conditions
14 Lean files, main folder Development.AutomorphicArithmetic.ShortNorms.
Explore