riemann

The Lean code claims a proof of the Riemann Hypothesis. This site has not checked the claim yet. See what is checked.

EveryCharacter from theta integrals and local matching

drafted

Statement

Assume the following seven inputs. The Lean local name of each input is in parentheses.

  1. (PP) A proof of UnitaryGroupThirdPlaceHypotheses. This is a structure of 60 propositions. Most of them have names of published results on unitary groups and automorphic forms.
  2. (FF) A proof of ThetaLocalInputs, a structure of 53 propositions with names of published results.
  3. (hAh_A) A proof of ThetaIntegralsAgree. For each admissible triple, two global theta integrals into the same unitary group UWU_W are proportional, with one nonzero constant cc, when their test functions match. Two recursion laws relate the constants for spaces of sizes b+2b + 2 and bb.
  4. (hMh_M) A proof of LocalMatching. For each admissible triple, at each place the two local Weil representations have matched quotient maps onto one common irreducible representation of UWU_W.
  5. (hXh_X) A proof of CovolumeBoundOfX, a bound named L3 for the families of the class FamHyp, in the "closed" sense (small ε\varepsilon, large constants).
  6. (hLh_L) A proof of RecTExists. At each finite place of each number field there is a map from irreducible representations of GLn\mathrm{GL}_n to Weil and Deligne parameters with the laws IsRecT. This is in the style of the local Langlands conjectures.
  7. (hVh_V) A proof of VWin, that is, VWinAt ψ 401 for each primitive Dirichlet character ψ\psi.

Then EveryCharacter holds: for each N≥1N \geq 1, each Dirichlet character χ\chi modulo NN and each ss with Re⁡(s)>12\operatorname{Re}(s) > \tfrac12 and (χ≠1\chi \neq 1 or s≠1s \neq 1), the Dirichlet L-function has L(s,χ)≠0L(s, \chi) \neq 0.

Lean

theorem UpperTheory.Lit.every_character_of_theta_integrals_local_matching (P : _root_.GlobalTheory.Fc.S0.UnitaryGroupThirdPlaceHypotheses) (F : _root_.GlobalTheory.FunPr.ThetaLocalInputs) (hA : GlobalTheory.IndefiniteRowSideFullHecke.WeilTensorModels.ThetaIntegralsAgree) (hM : GlobalTheory.IndefiniteRowSideFullHecke.WeilTensorModels.LocalMatching) (hX : _root_.GlobalTheory.CovTop.CovolumeBoundOfX) (hL : _root_.UpperTheory.Zero.LLC.RecTExists) (hV : VWin) : UpperTheory.EveryCharacter

The declaration is in Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/SiegelEisensteinSecondTermHypotheses.lean, line 69. Its page has the full list of what it uses and what uses it, and a link to the source.

Proof

The proof is one term. It applies EveryCharacter from Green, VWin and HypsAlt to three arguments.

  1. Green. The field P.greenRegularCharacters has the type GreenRegularCharacters. This is a statement in the style of Green's theorem on the cuspidal characters of GLd(𝔽g)\mathrm{GL}_d(\mathbb{F}_g), indexed by regular characters of 𝔽gd×\mathbb{F}_{g^d}^\times. The theorem green_of_regular turns it into the statement GlobalTheory.GLq.Green, which indexes the cuspidal characters of GLd(𝔽g)\mathrm{GL}_d(\mathbb{F}_g) by "prime labels". A prime label is a monic irreducible polynomial of degree dd over ℤ/g\mathbb{Z}/g with a nonzero constant term.
  2. VWin. The hypothesis hVh_V, with no change.
  3. A record of HypsAlt. The theorem HypsAlt is nonempty from the closed bound takes PP, FF, hAh_A, hMh_M, hXh_X, hLh_L and one more hypothesis: for each real cDepc_{\mathrm{Dep}}, the statement LinkedAt (parametersOfDependence hL cDep) (...) with the closed bound BoundAtTwoThreeFamilyFonAlt. The proof supplies this last hypothesis as a function of cDepc_{\mathrm{Dep}}. For each cDepc_{\mathrm{Dep}} it applies boundAtTwoThree_linked_of_recT to the field P.nLink and to the parameters parametersOfDependence hL cDep. The result is Nonempty (HypsAlt S0.NL DefiniteSideCondition).

The step EveryCharacter from Green, VWin and HypsAlt asks for Nonempty (HypsAlt (fun 𝒞 => Closed 𝒞 fun Fm _ => LinkN Fm) DefiniteSideCondition). The definition of S0.NL is fun 𝒞 => Closed 𝒞 fun Fm _ => LinkN Fm. So the two types are equal by unfolding, and Lean accepts the term with no conversion step.

Notes

The theorem is named after the theta inputs hAh_A and hMh_M. In this proof they go only into HypsAlt is nonempty from the closed bound. The branch EveryCharacter from Green, VWin and HypsAlt does not take them.

The input hVh_V is not used here. It is passed on to the branch.

Of the 60 fields of PP, this proof reads two by name: greenRegularCharacters and nLink. The other fields reach the proof only through the step HypsAlt is nonempty from the closed bound, which takes all of PP.

The field greenRegularCharacters is not an open assumption in the final proof. The only caller fills it, through the bundle published_results_eigen, with green_regular_characters_of_literature, which cites the theorem PositivityTheory.Stage1.PM.greenRegularCharacters. The field nLink has the type NLink.Hypotheses₂, a structure of seven named results (Fontaine BcrisB_{\mathrm{cris}}, global Artin reciprocity, Bloch and Kato, local Tate duality, local Euler characteristic, local finiteness, Bhatt and Scholze).

The theta matching chapter unfolds ThetaIntegralsAgree and LocalMatching. The unitary hypotheses chapter follows the record HypsAlt.

Uses

The proof also uses these declarations in a routine way, for example to unfold a definition or to pass an argument on: GlobalTheory.Mem.Top.Bl.parametersOfDependence.

The proof cites these declarations, but their steps are not written yet. The text above tells what each one gives: UpperTheory.N.boundAtTwoThree_linked_of_recT.

Used by

Status

Drafted. The text follows the Lean code, but no person has checked it against the code with the rules of spec 05.7 yet. If you check it, tell us.

A model wrote the first draft (writer@claude-opus-5-5). A person checks it before its status goes up.

The source of this page. Markdown. Something is wrong? Report it.