Proof AtlasMCP access
ProofsNumber theory

Lean proof review
The Riemann Hypothesis

Unverified claim

A proposed Lean proof that every nontrivial zero of ζ(s) has real part ½.

Lean 4Number theoryƒDirichlet L-functions
Formalism/HermitianCurvature/HermitianCurvatureProofs/CutCptCopy.lean
1import Formalism.HermitianCurvature.HermitianCurvatureProofs.CutLimENFMain2import Formalism.HermitianCurvature.HermitianCurvatureProofs.CutGermDone3import Formalism.HermitianCurvature.HermitianCurvatureProofs.CutNFTopFormDone4import Formalism.HermitianCurvature.HermitianCurvatureProofs.CutNFIdPairPtw5import Formalism.HermitianCurvature.HermitianCurvatureProofs.CutNFIdPolAll6import Formalism.HermitianCurvature.HermitianCurvatureProofs.CutNFTopPtw7import Formalism.HermitianCurvature.HermitianCurvatureProofs.ModuleFormPosCompactSupport8import Formalism.HermitianCurvature.HermitianCurvatureProofs.VectorIsomorphismCompactSupport9import Formalism.HermitianCurvature.HermitianCurvatureProofs.SizeStandardCompact10import Formalism.HermitianCurvature.HermitianCurvatureProofs.ExistsNormBoundThreeFamilies1112open Lean Meta Elab Command1314namespace Formalism.FourierDecayAlt.P.CptCopy1516def special : List (Name × Name) :=17  [(`Formalism.FourierDecayAlt.P.pb_formPos, `Formalism.FourierDecayAlt.P.module_form_pos_compact_support),18   (`Formalism.FourierDecayAlt.P.list_duality_level_group, `Formalism.FourierDecayAlt.P.size_standard_compact),19   (`Formalism.FourierDecayAlt.P.vector_isomorphism_levels, `Formalism.FourierDecayAlt.P.vector_isomorphism_compact_support)]2021def manual : List Name :=22  [`Formalism.FourierDecayAlt.P5.ThmPActual, `Formalism.FourierDecayAlt.KB.SizeStd, `Formalism.FourierDecayAlt.KB.VIso, `Formalism.FourierDecayAlt.P.PBL.FormPos,23   `Formalism.FourierDecayAlt.P.standard_pairing_of_heads,24   `Formalism.FourierDecayAlt.P.TBBx5.FormNonneg, `Formalism.FourierDecayAlt.P.TBBx5.form_re_nonneg, `Formalism.FourierDecayAlt.P.TBBx5.form_cs,25   `Formalism.FourierDecayAlt.P.TBBx5.formNonneg_of, `Formalism.FourierDecayAlt.P.CutBP.posAt_of_cpt, `Formalism.FourierDecayAlt.P.TBBx5.integral_three_at_place_of_parts,26   `Formalism.FourierDecayAlt.P.TBBx5.integral_four_at_place_of_parts, `Formalism.FourierDecayAlt.P.CutBP.truncated_limit_positivity_holds, `Formalism.FourierDecayAlt.P.CutBP.glGram]2728def roots : List Name :=29  [`Formalism.FourierDecayAlt.P.CutBP.thmBpAt_main4, `Formalism.FourierDecayAlt.P.CutBP.germ_truncation_positive, `Formalism.FourierDecayAlt.P.CutBP.block_growth_bound_of_compact_coef,30   `Formalism.FourierDecayAlt.P.CutBP.nFTopFormAll_of_ptw, `Formalism.FourierDecayAlt.P.CutBP.top_identity_of_domination_limits, `Formalism.FourierDecayAlt.P.CutBP.nfPolFormAll_of_top]3132def terminal (n : Name) : Bool := manual.contains n || (special.lookup n).isSome3334def suffixed : Name → Name35  | .str p s => .str p (s ++ "Cpt")36  | n => .str n "Cpt"3738def proposals (ci : ConstantInfo) : Array Name :=39  ci.type.getUsedConstants ++ ((ci.value? (allowOpaque := true)).map (·.getUsedConstants) |>.getD #[])4041partial def go (env : Environment) (n : Name) (st : NameSet × NameSet × Array Name) : NameSet × NameSet × Array Name :=42  let (seen, tainted, order) := st43  if seen.contains n || terminal n then st else44  let seen := seen.insert n45  match env.find? n with46  | none => (seen, tainted, order)47  | some ci =>48    let us := proposals ci49    let (seen, tainted, order) :=50      us.foldl (fun s c => if (`Formalism).isPrefixOf c then go env c s else s) (seen, tainted, order)
91 linesLn 15UTF-8Raw