Section 1 · PDF pages 5–6
Scope, source and standard of proof
The notation transcription is provisional. Check it against the printed mathematics when citing or reusing a formula.
1 Scope, source and standard of proof
The target is the ordinary Riemann Hypothesis for the meromorphic continuation of ∑_{n≥1}n^{−s}. The source actually proves a stronger half-plane assertion for all Dirichlet characters and then specializes it to the character modulo one. We follow that argument; we do not assume that it is enough merely to state its stronger intermediate assertions.
The underlying mathematical argument is credited to Levent Alpöge and Claude, as requested and as described by the supplied project’s provenance. This manuscript is a human-readable reconstruction of that supplied argument prepared by Jeremy Rodgers; it introduces no original extensions. Its source authority is the archive rh-main.zip, SHA-256
02a2877f92f3a6579181209838e7e8de08ba472e87cf8404f56a0e4f42ed8f19.
Project source paths below are relative to lean/src. Established Mathlib statements are read at the exact revision 0df444a360eaa60ab8c11dca51a86af692955474, pinned by the project. This fixes, in particular, the conventions for the values assigned at poles, primitive characters, local reciprocity and complex powers.
A citation in this manuscript has two jobs: to state the mathematical result being used, and to identify a source precise enough to check that result. At an application we check the hypotheses, normalization and quantifiers. A project declaration bearing a literature-related name is not, by itself, a literature citation. All forty-five handoff gap groups and all fourteen original frontier branches are reconstructed across Sections 2–17, and their exact wiring into the terminal argument is assembled in Section 17 (Proposition 17.4 and Theorem 17.5), with all fourteen original frontier branches accounted for in Section 18. Standard published theorems enter only at their explicitly checked statements.
The earlier expansion is preserved in RH_Exposition and the checkpoint recorded in data/scope-and-freeze.json. The large supporting expansions are used to recover actual arguments, not as a substitute for an argument in the present paper. Routine foundations of algebra, topology and analysis may be cited at referee level. We no longer attempt to print every generated Lean declaration or every implementation detail of those foundations.
The original fourteen frontier branches are retained in the compact input map. They are an initial check-list, not a proof that all essential mathematical inputs have been found. Coverage is decided by tracing the actual terminal argument and checking each mathematical contract. A transitive UTF-8 textual source scan of the local modules imported by Main.lean (175,187 local modules) records zero missing local modules and zero textual axiom, sorry, or admit declarations. That source scan is strictly weaker than a Lean 4 kernel check: no local Lean 4 elaboration or kernel typechecking of the full pinned environment has been obtained here, and a successful typesetting build does not supply formal verification. Likewise, the post-assembly checks applied to this manuscript were targeted audits of specific proofs and interfaces rather than a complete line-by-line independent referee verification of every page.
Attribution and AI assistance. The underlying mathematical argument is credited to Levent Alpöge and Anthropic’s Claude. Jeremy Rodgers prepared this human-readable reconstruction with AI assistance from OpenAI’s GPT/Codex and Google’s Antigravity/Gemini in translating Lean declarations into mathematical prose, drafting and revising the exposition, and conducting targeted consistency checks. Jeremy Rodgers takes responsibility for the submitted manuscript.