riemann

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

The record HypsAlt

drafted

Statement

HypsAlt N DR is a structure in Type 1 with forty-six fields. It has two parameters. The first parameter NN is a property of family classes, of the type FamClass β†’ Prop. The second parameter DRDR is of the type DefiniteSideType, so DRDR gives a relation on two reals for each bundle condition BundleCondition D O c. In the trunk, NN is S0.NL and DRDR is the predicate DefiniteSideCondition.

A value of the structure holds a family class π’œ\mathcal{A}, a selection Οƒ\sigma on it, some constants, and many rows (bounds and conditions) on them. Most rows have one of two forms.

  • A row "per selection" is a statement for each Ξ΅\varepsilon, each family Fm : FamP Ξ΅ with π’œ(Fm)\mathcal{A}(\mathrm{Fm}) (the proof is hchc), each real xx with x1<xx_1 < x (the proof is hxhx, and x1x_1 is the field Fm.x1), each proof hh that the threshold of the selection is at most xx, and each index i : Fm.Ix x.
  • A row "closed on π’ž\mathcal{C}" is a statement Closed π’ž P, see the predicate Closed. It says that PP holds for each family in π’ž\mathcal{C} whose constants are large, for all small Ξ΅\varepsilon.

Two family classes come from π’œ\mathcal{A}:

  • π’œβ€²=\mathcal{A}' = WithTw (WithSm (WithChN π’œ)). This class adds to π’œ\mathcal{A} the conditions DGamDvdF, TameDistinctF, BoxesF, QDRowsF, CYL≀9C_{YL} \le 9 (from WithChN), then DGamSmooth (from WithSm), then TwGood (from WithTw).
  • π’œ3=\mathcal{A}_3 = D3 3 π’œ, that is Des (WithChN π’œ) 3. This class is π’œβ€²\mathcal{A}' with three more conditions: there is CH with ChosenE Fm 3 CH, then TuSize, then DGamSize. The theorem d3_a takes a proof of π’œ3(Fm)\mathcal{A}_3(\mathrm{Fm}) to the proof of π’œ(Fm)\mathcal{A}(\mathrm{Fm}) inside it. It is a projection.

The selection gives these objects at a family, xx and ii:

  • familySelection Οƒ Fm hc is the pair of the threshold Fm.x1 and the map that takes x,hx,h,ix, hx, h, i to the part R of the selected bundle condition.
  • spectralConditionOfRawSelection Οƒ gives the part S.
  • baseLevelChoiceOfRawSelection Οƒ gives the pair of the parts P and pin. The rows below use its first component P.
  • selectionBundleOfRawSelection Οƒ gives the part B.

The forty-six fields follow, in nine groups. The meaning of a row comes from the name of its predicate, by its name, except where this step unfolds the predicate.

Data (5 fields). These fields give the objects that the rows talk about.

  • π’œ : FamClass, the family class.
  • Οƒ : RawSel BundleCondition π’œ. For each family in π’œ\mathcal{A}, each x>x1x > x_1 and each ii, it gives a bundle condition BundleCondition (Fm.D x i) (objAt Fm x hx i) Fm.Csz. A bundle condition has the parts R, S, P, pin, DH, C, B.
  • cT : ℝ β†’ ℝ β†’ ℝ, a constant that depends on Ξ΅\varepsilon and CYLC_{YL}.
  • c30 : List ℝ β†’ CountingConstants, a choice of counting constants (Cres,n0,A,Cb,C,c,cb)(C_{res}, n_0, A, C_b, C, c, c_b) for each list of reals.
  • cIc : ℝ, one more constant.

Facts on the constants (2 fields).

  • hc30: for each family, 0≀C0 \le C and 2(CYL+1)≀A2(C_{YL} + 1) \le A for the constants c30 Fm.cOut.
  • hcI: 0<cIc0 < c_{Ic}.

Statements on the families of π’œ\mathcal{A} (3 fields).

  • hEx : MinkDiv β†’ ExS π’œ cT. If MinkMult n (minkM n) holds for each nn, then for each Ξ»>1\lambda > 1 and each host G with HostExW Ξ» G.req, the class WithTw (π’œ ∧ G.cls Ξ») has design choices with the constant 3 and cT.
  • hduty: each family in π’œ\mathcal{A} has Duty Fm. This is the conjunction of PageFix, PageWin, SmallFirstModulusBelowScale, TameDistinctF, ChosenWall, TupUsedF and TwAllF.
  • hMt: for each family in π’œ\mathcal{A} and each large xx, each ii, each tuple ΞΌ\mu and each element aa of the ring of integers of the number field LL, the image of aa under embLL maps the set Mtilde ΞΌ to itself.

Rows per selection (8 fields). For each family in π’œ\mathcal{A}, xx, hh and ii as above:

  • hRB: the part B gives IndefiniteRealisationBoundedRows.
  • hTw: TieTwRec (Fm.L x i) holds for the field S0.Tw of the part P.
  • hPA: PrimRows3 holds for the fields Q.Rl and Q.F of B, and TypesSep3 holds for P.A3.fam3.
  • hLamP: RowsHoldLam3 P.
  • hDivG: DivRows3G P.
  • hDcPtG: DcPtG P.
  • hInstR: VolSigIndep (Fm.D x i) (the volumes of the fundamental domains do not depend on the signature) and ClassItemsAt (Fm.D x i) n, where nn is the rank of the first space sp.Y 0. ClassItemsAt is the conjunction of GenusMassAt, ClassFinAt and ClassMassAt.
  • selJ: IndefiniteRealisationJoin with the parts R, S and B.Q.

Rows closed on π’œβ€²\mathcal{A}' (2 fields).

  • hTu: if cT(Ξ΅,CYL)≀CTuc_T(\varepsilon, C_{YL}) \le C_{Tu}, then TuSize Fm. TuSize says that for large xx, each Fm.L x i has TuGe and log⁑Tu≀CTuβ‹…mβ‹…L\log T_u \le C_{Tu} \cdot m \cdot L.
  • hn4: for each x>x1x > x_1 and each ii, ClassNumberFormulaβ‚‚ (Fm.D x i) (Fm.ex x hx i).lev.

Rows closed on π’œ3\mathcal{A}_3 (14 fields). In each of these rows, "for large xx" means: there is x0x_0 such that the statement holds for each xβ‰₯x0x \ge x_0 (with x1<xx_1 < x where the row asks for it) and each ii.

  • hTF: TFrame Fm (C_YL + 1) (1/4) 3 (1/2) C_Tu 3.
  • sO: for each proof of π’œ3(Fm)\mathcal{A}_3(\mathrm{Fm}), TheoremSSelected Fm 3 for the selection with the threshold of familySelection and the map to S.toSTies.
  • h30: CountAllPointsClass PLevT' Fm n0 A C c cb with the constants c30 Fm.cOut.
  • jOn: for large xx, the image of V0 mu0 under iota mu0 is the whole space (⊀\top).
  • aPt0: for large xx, Conclusion6 (Fm.D x i) u for each uu.
  • aPtTw: for large xx, TwistedPointIntegral (Fm.D x i) (Fm.ex x hx i).tw.
  • aPer0: for large xx, PeriodClassSumWeyl (Fm.D x i).
  • aPerTw: for large xx, TwistedPeriodAdmissible (Fm.D x i) (Fm.X x i) (Fm.ex x hx i).tw.
  • aP10: for large xx and each uu, Conclusion5Sharp (Fm.D x i) u and TwistedColumnBoundAtT (Fm.X x i) (Fm.ex x hx i).tw u.
  • aAtG: there is C1C_1 such that for large xx, UsedTuplesBoundByConstant (Fm.D x i) (Fm.L x i) (Fm.ex x hx i).errX C1, and familySizeBoundAtTypePrime Fm C1.
  • aC2: FamilySecondComplementInputs Fm.
  • irrC: for large xx, there is A : AllRows (Fm.D x i) with LabelCountGoodInjective A, AllJoinA A and CountAllRows A (epsC cIc r f), where rr and ff are the fields R.r and R.f of Fm.D x i.
  • zL: for each proof of π’œ3(Fm)\mathcal{A}_3(\mathrm{Fm}), there is xrx_r such that for each xβ‰₯xrx \ge x_r with x1<xx_1 < x, each ii and each k : Fin m, the map (lPrj (Fm.D x i) A P0 ψ0 Z k ΞΌ0).mulVec is surjective. Here A, P0, ψ0 and ΞΌ0 are fields of P and of P.A3, and Z is P.A3.fam3.toSub2 P.Zs.
  • tie: RealPlaceSecondLayerConditions Fm. This says that RealTied holds for large xx and that there is ColsTiedSym C with ChiFin0.

Statements that do not depend on a family (8 fields).

  • hLit : LitThin. This is three existence statements of ShortIntervalPrimes, for the levels adm6, adm7 and adm11, each for all data DD.
  • hWu : WuDecayOfGap. For each datum DD with GapHyp and each HidaSetting XX, WuDecay X holds together with an integrability statement.
  • hRF : RowsFinDim, a statement of finite dimension for operators on automorphic L2L^2 spaces.
  • sTy : TypeP, sNG : RowNGP, sM : RowMainEqP. Each is a statement with uniform constants over all data of the type D7.
  • hU: MassRatioUnderVolume D for each DD. That is VolTie D β†’ VolumeRatioβ‚‚ D.
  • hG: GenusMassAt D 2 for each DD. That is: the mass of each positive definite hermitian space of rank 2 is massI D 2.

Statements on the selection over π’œ3\mathcal{A}_3 (3 fields).

  • sLp : LoopRowS 3 π’œβ‚ƒ s, where s takes a family to the threshold of familySelection and to the map to S.toSTies.
  • rRows : SelectionDefiniteRows DR π’œ Οƒ. This is a row closed on π’œ3\mathcal{A}_3. For each proof hchc, there is Cβ‰₯0C \ge 0 such that, eventually along the selection, IndefiniteRealisationConstantBounds holds and DRDR holds for the bundle condition of Οƒ\sigma and CC.
  • hServ : SelectionServed π’œβ‚ƒ (familySelection Οƒ). This has two fields twU and pdv. Each is a row closed on π’œ3\mathcal{A}_3.

The class property (1 field).

  • nRest : N π’œβ‚ƒ.

The counts are 5+2+3+8+2+14+8+3+1=465 + 2 + 3 + 8 + 2 + 14 + 8 + 3 + 1 = 46.

Lean

structure GlobalTheory.Fc.HypsAlt (N : FamClass β†’ Prop) (DR : _root_.GlobalTheory.Fc.R1.DefiniteSideType) : Type 1

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

Proof

There is no proof. This is a structure definition. It only lists the forty-six fields and their types.

Notes

The threshold of familySelection Οƒ Fm hc is Fm.x1. So in each row per selection, the hypothesis hh only says x1≀xx_1 \le x, and hxhx already gives x1<xx_1 < x. The hypothesis hh adds nothing.

The four selection maps familySelection, spectralConditionOfRawSelection, baseLevelChoiceOfRawSelection and selectionBundleOfRawSelection only read parts of the bundle condition that Οƒ\sigma gives. The theorem d3_a is a projection. This step explains them in the Statement and lists them as routine.

Each of the parameters is used by one field only: NN by nRest and DRDR by rRows. In the trunk, HypsAlt is nonempty from the closed bound builds a value of HypsAlt S0.NL DefiniteSideCondition. There nRest is a statement Closed π’œβ‚ƒ LinkN.

Uses

The proof also uses these declarations in a routine way, for example to unfold a definition or to pass an argument on: GlobalTheory.Fc.familySelection, GlobalTheory.Fc.baseLevelChoiceOfRawSelection, GlobalTheory.Fc.selectionBundleOfRawSelection, GlobalTheory.Fc.spectralConditionOfRawSelection, GlobalTheory.Cp.d3_a.

The proof cites these declarations, but their steps are not written yet. The text above tells what each one gives: Formalism.IndefR.IndefiniteRealisationBoundedRows, Formalism.IndefR.Links.PrimRows3, Formalism.L2.DIV.TieTwRec, Formalism.L2.DIV.lPrj, Formalism.L2.G.Adm2InU.TwistedColumnBoundAtT, Formalism.L2.G.Adm2InU.TwistedPeriodAdmissible, Formalism.L2.G.Adm2InU.TwistedPointIntegral, Formalism.L2.G.Adm2InU.UsedTuplesBoundByConstant, Formalism.L2.GlobalTheoryTheory.AllJoin.AllJoinA, Formalism.L2.GlobalTheoryTheory.ConcN.CountAllRows, Formalism.L2.GlobalTheoryTheory.ConcN.epsC, Formalism.L2.GlobalTheoryTheory.GenusMassVolumes.ClassItemsAt, Formalism.L2.GlobalTheoryTheory.GenusMassVolumes.GenusMassAt, Formalism.L2.GlobalTheoryTheory.GenusMassVolumes.VolSigIndep, Formalism.L2.Rows.RowsHoldLam3, Formalism.L2.SG.JoinSI.IndefiniteRealisationJoin, Formalism.L2.SG.Pf.WuDecayOfGap, Formalism.L2.SG.RowsDef.RowsFinDim, Formalism.L2.SG.RowsPos.RowMainEqP, Formalism.L2.SG.RowsPos.RowNGP, Formalism.L2.SG.RowsPos.TypeP, Formalism.L2.SG.ThmSOwn.LoopRowS, Formalism.L2.SG.ThmSOwn.PLevT', Formalism.L2.SG.ThmSOwn.TheoremSSelected, Formalism.MainNotions.ArithmeticCylinders.AllRows, Formalism.MainNotions.ArithmeticCylinders.LabelCountGoodInjective, Formalism.MainNotions.FamClass, Formalism.MainNotions.FamP, Formalism.MainNotions.LitThin, Formalism.MainNotions.MinkDiv, Formalism.MainNotions.PX.TFrame, Formalism.MainNotions.RT.MassRatioUnderVolume, Formalism.MainNotions.RealPlaceSecondLayerConditions, Formalism.MainNotions.S.CountE.CountAllPointsClass, Formalism.MainNotions.S.CountingConstants, Formalism.MainNotions.StandardLattice.ClassNumberFormulaβ‚‚, Formalism.MainNotions.TuSize, Formalism.MainNotions.WeightDegreeSizes.FamilySecondComplementInputs, Formalism.MainNotions.WeightDegreeSizes.PeriodClassSumWeyl, Formalism.MainNotions.WeightDegreeSizes.familySizeBoundAtTypePrime, Formalism.MainNotions.WithSm, Formalism.MainNotions.WithTw, Formalism.MainNotions.product_first_zeroth_parts.Conclusion5Sharp, Formalism.MainNotions.product_first_zeroth_parts.Conclusion6, GlobalTheory.Cp.D3, GlobalTheory.Cp.DcPtG, GlobalTheory.Cp.DivRows3G, GlobalTheory.Cp.Duty, GlobalTheory.Cp.SelectionServed, GlobalTheory.Cp.WithChN, GlobalTheory.Fc.BundleCondition, GlobalTheory.Fc.R1.DefiniteSideType, GlobalTheory.Fc.R1.SelectionDefiniteRows, GlobalTheory.Fc.RawSel, UpperTheory.Top.ExS.

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.