riemann

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

The covolume bound CovolumeBoundOfX

drafted

Statement

CovolumeBoundOfX is a definition of a proposition with no parameters. It says:

Closed FamHyp ((F,CH)↦∃C0≥0,EventuallyAtAllPoints F (p↦∀C≥C0, (p.S false).L3 (p.N C CH))).\begin{aligned} &\mathrm{Closed}\ \mathrm{FamHyp}\ \bigl( (F, C_H) \mapsto \exists C_0 \ge 0,\\ &\qquad \mathrm{EventuallyAtAllPoints}\ F\ (p \mapsto \forall C \ge C_0,\ (p.S\ \mathrm{false}).\mathrm{L3}\ (p.N\ C\ C_H)) \bigr). \end{aligned}

The symbols are these.

  • Closed 𝒞 P is the predicate Closed: PP holds for all small ε\varepsilon, for each family in the class 𝒞\mathcal{C} whose constants are large enough.
  • FamHyp is one fixed family class. A family FF is in FamHyp when a list of conditions holds: PageFix, PageWin, SmallFirstModulusBelowScale, TameDistinctF, ChosenWall, an eventual divisibility of DGam by a value of minkM, BoxesF, QDRowsF, the bound F.CYL≤9F.\mathrm{CYL} \le 9, DGamSmooth, TwGood, ∃CH\exists C_H with ChosenE F 3 CH, TuSize and DGamSize. This step does not unfold these conditions.
  • A point pp of FF at (x,i)(x, i), with x>x1x > x_1 and i∈Ixi \in I_x, is an element of the type Pt F x hx i, which is PtAt (F.ex x hx i) F.Csz. It is a structure with a row side P, two natural numbers Del and h0, column data, a core T, real data R over a number field and many compatibility fields.
  • EventuallyAtAllPoints F Q says: there is x0x_0 such that for each x>x1x > x_1 with x0≤xx_0 \le x, each i∈Ixi \in I_x and each point pp at (x,i)(x, i) with RowsTAlt p, the statement Q(x,i,p)Q(x, i, p) holds. Here RowsTAlt p is p.PointConditions' ∧ RecTied D L.
  • p.S false is the data (p.R.toCx3 p.F).data p.F.cr false of the point (one of its two sides, chosen by a Boolean). p.N C CH is the numerical record p.R.num p.F C CH.
  • L3 N for side data SS says: for each index jj, lcv(S.XWj,S.Mj)/S.D≤N.l3j\mathrm{lcv}(S.\mathrm{XW}_j, S.M_j) / S.D \le N.\mathrm{l3}_j. By its name, lcv is a log covolume, so this is an upper bound for a normalised log covolume of the lattice MjM_j.

So CovolumeBoundOfX says: for small ε\varepsilon and for families in FamHyp with large constants, there is C0≥0C_0 \ge 0 such that, at all large xx and at all points that satisfy RowsTAlt, the bound L3 holds for the numbers p.N C CH with each C≥C0C \ge C_0.

Lean

def GlobalTheory.CovTop.CovolumeBoundOfX : Prop

The declaration is in Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/LiftLambdaBound.lean, line 60. 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 applies Closed to the class FamHyp and to a predicate built with EventuallyAtAllPoints.

Notes

In the trunk, CovolumeBoundOfX is a hypothesis. HypsAlt is nonempty from the closed bound takes it as its input hXh_X and passes it to linked_bundles_l3_of_open_alt. The caller every_character_of_theta_integrals_local_matching takes it as a hypothesis too. The theorem SelfIntersectionVolumeEstimates.topCovolSlim2_use_alt_alt proves CovolumeBoundOfX from fifteen named hypotheses, among them resolution and principalisation in characteristic zero, Poincaré-Lelong, Fargues exactness, Zarhin, ArDegree and PublishedHodgeBundleTheorems.

The predicate L3 also appears as the field covol of CovolumeOntoIsometryConditions, one of the side conditions of DefiniteSideCondition.

Uses

The proof cites these declarations, but their steps are not written yet. The text above tells what each one gives: GlobalTheory.BigTop.FamHyp, GlobalTheory.CovTop.EventuallyAtAllPoints.

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.