riemann

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

The definite side condition

drafted

Statement

DefiniteSideCondition is a definition of the type DefiniteSideType. A DefiniteSideType is a predicate on six arguments: a datum DD of the type D7, an object OO of the type Obj D, a real cc, a bundle bb of the type BundleCondition D O c, and two reals CC and CHC_H.

A bundle bb is a structure with seven fields: a reciprocity record R, spectral ties S, a row side family P, a fact pin that the row side is determined, a pair of natural numbers DH =(Δ,h0)= (\Delta, h_0) with D.s.Del=ΔD.s.\mathrm{Del} = \Delta and O.L.etaSz=m⋅h0O.L.\mathrm{etaSz} = m \cdot h_0 (where m=D.R.mm = D.R.m), square integrable columns C, and a real bundle B. The field B contains an indefinite realisation B.Q. Write QQ for B.Q (the abbreviation qRealOfBundle b) and ZcZ_c for the scale function zsc b.P Δ h0 c. The function zsc is the scale of ZscOfNum3 with its l6m part shifted by −c-c times its l6u part and its l6u part set to 00.

Then DefiniteSideCondition D O c b C CH is this statement. Take the following data.

  1. hok1: a proof of b.P.A3.fam3.Ok3 1.
  2. hsep: a proof of b.P.A3.fam3.TypesSep3.
  3. hP: a proof of CovolumeOntoIsometryConditions Q.Rl F Q.sEE (hkCan b.P.A3) C CH, where FF is the face faceT b.P b.C.toS.c.face b.C.toS.Sp Zc. This structure extends PrimRows3 and has the fields w1, covol (the bound L3), onto (the bound ON), lamLow (the bound L6), seeIso, miStar and fun0, all at the numbers Q.Rl.num F C CH.
  4. hI: a proof of PassIn3 Q.Rl F C CH. It says that there are a finite type SS, finite dimensional representations τs\tau_s of the group GG over the field D.what₂.LL, and a real nˉ\bar n with the pass condition CxPassIn3.
  5. Five reals λ0\lambda_0, C0C_0, cec_e, SwS_w, C1C_1.
  6. H: for each word uu, the numerical facts NumFacts of the record ofRecord D O.L Δ h0 at the letter of uu, with the constants O.L.NcO.L.N_c, λ0\lambda_0, C0C_0, cec_e, cc, SwS_w, C1C_1.
  7. NuC: for each member ww of the column face, a submodule over the ring of integers of D.what₂.LL of the space LLa(w)\mathrm{LL}^{a(w)}. Here a(w)a(w) is read off the face at the subspace Zs of the package Pk = packageOfPrimitiveLinks Q hok1 hsep C CH hP hI.
  8. I: division compatibility data DivisionCompatibilityDataThreeSided for the row side of bb, the subspace Pk.Zs, the two indefinite data of the package (Pk.core.base and Pk.core.cols), the base level O.ex.p0 and the column face at Pk.Zs.

If DivTied3 ... Pk.core.cols.col NuC I holds (the data II are tied to the package and to NuC), and if II is equal to the division data b.P.I of the bundle (as a heterogeneous equality HEq I b.P.I), then for each word uu the row statement

RowsU (b.C.toS.c) Pk Ru (I.wU u) (nuOf O.L u (I.eNu u))\mathrm{RowsU}\ (b.C.\mathrm{toS}.c)\ \mathrm{Pk}\ R_u\ (I.\mathrm{wU}\ u)\ (\mathrm{nuOf}\ O.L\ u\ (I.\mathrm{eNu}\ u))

holds. Here RuR_u is the record of numbers RecNums.ofNum (ofRecord D O.L Δ h0) (Equiv.refl _) (letterOf u) T O.L.Nc λ0 C0 ce c Sw C1 (H u), with T=(D.mem u).A.TT = (D.\mathrm{mem}\ u).A.T, and nuOf O.L u e is the pullback of the lattice O.L.NuLat u along the linear equivalence ee.

DivTied3 is a structure of ten fields: equal ranks, and the ties grp, tup, mu1, sharp, base, mt, th, num and cols. RowsU says that there are a column chain, a chain tie, a matrix family X0X_0 at the infinite places of LL with a Hermitian identity, height numbers, an operator norm bound and column bound data with logarithmic bounds, and that Nu is a lattice. This step does not unfold these objects further.

Lean

def GlobalTheory.Fc.DefiniteSideCondition : _root_.GlobalTheory.Fc.R1.DefiniteSideType

The declaration is in Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/DefiniteSideCondition.lean, line 25. 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 definition. It is one long universal implication. The abbreviations qRealOfBundle, faceT, ofRecord and letterOf only read fields of bb and DD or pack them into a tuple.

Notes

The bound variable lam0 of the definition has the same name as the global definition Formalism.BasicNotions.lam0. The dependency list contains the global name, but the definition does not use it. The name lam0 in the text is the bound real λ0\lambda_0.

The package packageOfPrimitiveLinks Q hok1 hsep C CH hP hI is written out in full ten times in the Lean text. Each time it is the same term.

The word "definite" is in the name only. The text does not mention a definite form. The predicate enters the record HypsAlt through the field rRows : SelectionDefiniteRows DR 𝒜 σ, with DR = DefiniteSideCondition in the trunk. See HypsAlt is nonempty from the closed bound.

Uses

The proof also uses these declarations in a routine way, for example to unfold a definition or to pass an argument on: Formalism.BasicNotions.lam0, GlobalTheory.Fc.qRealOfBundle, Formalism.IndefR.faceT, Formalism.L2.DIV.letterOf, Formalism.L2.DIV.ofRecord.

The proof cites these declarations, but their steps are not written yet. The text above tells what each one gives: GlobalTheory.Fc.R1.DefiniteSideType, Formalism.IndefR.Links.CovolumeOntoIsometryConditions, Formalism.IndefR.Links.PassIn3, Formalism.IndefR.hkCan, Formalism.L2.DIV.Cons.nuOf, Formalism.L2.DIV.DivTied3, Formalism.L2.DIV.DivisionCompatibilityDataThreeSided, Formalism.L2.DIV.RecNums.ofNum, Formalism.L2.RowDataTransport.RowsU, Formalism.L2.RowDataTransport.packageOfPrimitiveLinks, GlobalTheory.Fc.zsc.

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.