Skip to content

Riemann Hypothesis · Lean 4 · Referee reconstruction

Read the Riemann Hypothesis argument from Lean

Follow the argument from the reduction for Dirichlet characters to the final assembly for ordinary RH. Jeremy Rodgers reconstructs the mathematics of Levent Alpöge and Anthropic’s Claude in a manuscript for referee checking.

The ordinary Riemann Hypothesis argument in the supplied Lean source

A mathematical reconstruction for referee checking. The manuscript reconstructs 45 handoff gap groups and 14 original frontier branches. Proposition 17.4 constructs a compatible family-selection bundle. Theorem 17.5 traces the discharge of the terminal inputs and assembles the argument for ordinary RH.

Reading edition and verification scope

The chaptered edition covers the 980-page preprint. Copyable notation is still undergoing transcription checks. The reader identifies provisional text and provides the source notation for comparison.

The manuscript reports a textual dependency scan of 175,187 local Lean modules and targeted manuscript audits. Local Lean 4 kernel checking of the full pinned environment was outside the reported checks.

Contents

  1. Title, abstract and contents
  2. 1 Scope, source and standard of proof
  3. 2 The precise target and the endpoint reduction
    Subsections
    1. 2.1 Conventions and established analytic inputs
    2. 2.2 The functional-equation argument
    3. 2.3 The terminal source calls
    4. 2.4 The reduction from primitive characters
  4. 3 The analytic window principle
    Subsections
    1. 3.1 Weighted character families and their poles
    2. 3.2 The windowed Landau theorem
    3. 3.3 From power windows to zero-freeness
    4. 3.4 Levels and the order of the uniform choices
    5. 3.5 The finite character balance
    6. 3.6 Uniform perturbation and subgroup averaging
    7. 3.7 The quantitative core inequality
    8. 3.8 The slope-to-gap estimate
    9. 3.9 Reading the host characters and the level weights
    10. 3.10 What a tied family must supply
    11. 3.11 The character-supply construction
    12. 3.12 Simultaneous analytic selection of the prime pair
    13. 3.13 The progression estimates underlying the mean square
    14. 3.14 Verification of the relative progression input
    15. 3.15 The character boxes and the thin estimate on a host
    16. 3.16 Selecting the first set with the required shares
    17. 3.17 The second set and its quantitative size
    18. 3.18 Norm primes and disjoint exceptional sets
    19. 3.19 Assembling the quantitative host
  5. 4 Finite-field labels and the publication inputs
    Subsections
    1. 4.1 The integer bound and the case-I count
    2. 4.2 Changing coefficients in the remaining counts
    3. 4.3 The precise Kato input
    4. 4.4 Source-model Bloch–Kato cohomology, Kato's Euler system, and the discharge of the two-character predicate
    5. 4.5 The numerical bounds in cases II, III and V
    6. 4.6 The local subquotients in definite base change
    7. 4.7 From finite spectral candidates to definite base change
    8. 4.8 Spectral candidate finiteness and the terminal base-change supplier
    9. 4.9 Weak base-change descent and split-place rigidity
    10. 4.10 The F8 patching package and literature-level realization
    11. 4.11 Residual ends, rank-four symplectic automorphy, and shared-package wiring
    12. 4.12 Construction of the uniform rank-three congruence integer
    13. 4.13 Enlarged-coefficient symplectic congruence bounds for cases II and III
    14. 4.14 Case-V finite-list deformation count and closure of the F8 window
    15. 4.15 What the sixty-field package asserts
    16. 4.16 The exact theta comparison still required
    17. 4.17 The Hecke special values in the theta constant
    18. 4.18 The closed-subgroup argument for constancy
    19. 4.19 Matching finite tensors and factoring the integral
    20. 4.20 How the definite theta comparison constant is forced
    21. 4.21 Common local quotients and matching irreducibility
    22. 4.22 Global theta-integral agreement and dimension-shift recursion
  6. 5 The local parameter input
  7. 6 The uniform arithmetic estimate at two and three
    Subsections
    1. 6.1 The comparison estimate and its numerical errors
    2. 6.2 The reference-family construction
    3. 6.2 The reference-family construction from result 6.45
    4. 6.2 The reference-family construction from result 6.68
    5. 6.3 From pointwise estimates to an eventual family estimate
    6. 6.4 Period rationality and the remaining division bounds
    7. 6.5 Closure under selections and the remaining arithmetic input
    8. 6.6 Prescribed automorphic rational and integral realization
    9. 6.7 Simultaneous arithmetic realization on the selected family
  8. 7 The geometric trace formula and the Galois row
    Subsections
    1. 7.1 The precise output required of the row
    2. 7.2 A finite-correspondence trace calculation
    3. 7.3 What the first geometric realization actually supplies
    4. 7.4 Complex uniformization and the marked period dictionary
    5. 7.5 Positive-line and adelic coordinates, and Hecke fixed-point transport
    6. 7.6 Selected projective towers, trace tests, and geometric realization
    7. 7.7 Rank selection, tangent envelopes, and Hecke descent
    8. 7.8 The theta lift and its uniform bound
    9. 7.9 Analytic suppliers for the definite theta lift
    10. 7.10 Congruences, trace limits and the final row
    11. 7.11 Congruence-density suppliers and unconditional assembly
    12. 7.12 Trace-limit extension and semisimple realization
    13. 7.13 Local closedness, Breuil–Kisin lattice towers, and trace-limit transfer
    14. 7.14 Assembly of the local row and weight normalizations
    15. 7.15 Same-row local–global upgrades and assembly into the Galois row
    16. 7.16 The exact use of the row in the arithmetic window
  9. 8 Families and the arithmetic window estimate
    Subsections
    1. 8.1 The cohomology groups and the window
    2. 8.2 From the three arithmetic estimates to the window
    3. 8.3 Imposing finitely many conditions on one family
    4. 8.4 Restriction estimates used in the plus part
    5. 8.5 Summing the character estimates
    6. 8.6 The minus part: from a character estimate to a prime sum
    7. 8.7 The strict descent in the Euler-system estimate
    8. 8.8 The integral-homology estimate behind Lemma K
    9. 8.9 The numerical closure of the cohomology bound
    10. 8.10 The determinant and finite-orbit bounds
    11. 8.11 The equivariant class-group count
    12. 8.12 Where the arithmetic window enters the family links
    13. 8.13 Choosing one window for every exceptional twist
    14. 8.14 The cycles and the finite-difference construction
    15. 8.14 The cycles and the finite-difference construction from result 8.67
    16. 8.15 The selected rank link
    17. 8.15 The selected rank link from result 8.96
    18. 8.15 The selected rank link from result 8.110
    19. 8.16 Sharp Bessel-subgroup Frobenius-norm integrability
    20. 8.17 Nonvanishing of the rank-one Bessel period for discrete series
    21. 8.18 Same-realization kernel, mass, and loop estimates for the spectral link
    22. 8.19 Automorphic all-row label counts, weight realization, and irreducibility
    23. 8.20 Quantitative Fock no-kernel criterion and local-to-global family link
    24. 8.21 Global arithmetic tie and family assembly with fixed exponents
    25. 8.22 Selected primitive-period, lattice-realization, and divisor-kernel bridges
  10. 9 The covolume estimate and its uniformity
    Subsections
    1. 9.1 Lattices, heights and an integral orthogonal cut
    2. 9.2 The finite-group projector in the cutoff
    3. 9.3 The pointwise estimate
    4. 9.4 The eventual, simultaneous statement
    5. 9.5 A precise geometric citation: point separation
    6. 9.6 Finite generation and fullness of the integral lattice
    7. 9.7 The transference bound used to find a CM frame
    8. 9.8 The adapted frame and nonvanishing construction
    9. 9.8 The adapted frame and nonvanishing construction from result 9.49
    10. 9.8 The adapted frame and nonvanishing construction from result 9.76
  11. 10 Geometric inputs and the integral Hodge–Tate comparison
    Subsections
    1. 10.1 Matching the project model
    2. 10.2 The prismatic normalization and its Hodge quotient
    3. 10.3 The arithmetic model and its normalizations
    4. 10.4 The integral polarized retract
    5. 10.5 The arithmetic fields of the Hodge package
    6. 10.6 Seminegativity on a complete curve
    7. 10.7 Deformation across the stated divided-power thickening
    8. 10.8 The exterior-cup isomorphism in degree two over arbitrary bases
    9. 10.9 Chern–Poincaré duality and polarization forms over arbitrary bases
    10. 10.10 Semistable reduction, arithmetic inputs, and toroidal compactifications
  12. 11 Resolution and principalization in the geometric input
  13. 12 Metric integration and generic nef asymptotics
    Subsections
    1. 12.1 The inverse Poincaré–Lelong identity
    2. 12.2 The generic nef Riemann–Roch input
  14. 13 The short-interval norm-prime input for the analytic host
    Subsections
    1. 13.1 The actual effective exceptional-zero gap
    2. 13.2 The zero-free region and the single exceptional zero
    3. 13.3 The concrete imaginary-quadratic ray family
  15. 14 The ray-family explicit formula with its exceptional zero
  16. 15 Vanishing and the isolated non-klt divisor
    Subsections
    1. 15.1 Nef numerics in every characteristic
    2. 15.2 Strong approximation for the supported special unitary group
    3. 15.3 Bounded short sections and simultaneous finite-place denominators
    4. 15.3 Bounded short sections and simultaneous finite-place denominators from result 15.26
    5. 15.3.1 Finite level theta systems
    6. 15.3.2 Free lower rows, algebraic short-value descent, and global reading equality
    7. 15.3.3 Exact finite-cover evaluation of short sections
    8. 15.3.4 Normalized local class and harmonic valuation estimates
  17. 16 Maximal slopes, scalar extension and measure normalization
    Subsections
    1. 16.1 Selected rationality, prescribed Gram realization, and the covolume assembly
    2. 16.2 Deep-cover good reduction, bad-rank share, and lower-slope bounds
  18. 17 Assembly of the ordinary RH argument
    Subsections
    1. 17.1 From a connected arithmetic family to zero-freeness
    2. 17.2 The seven inputs at the literature assembly
    3. 17.3 What the terminal row supplies
    4. 17.4 Construction of the compatible family bundle and final assembly
  19. 18 Essential inputs and their present status
  20. References