riemann

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

The predicate Closed on family classes

drafted

Statement

Closed is a definition. It takes two parameters and returns a proposition.

  1. 𝒞\mathcal{C} is a family class (the type FamClass). A FamClass is a predicate on families: for each real ε\varepsilon and each family FF of the type FamP ε, it gives a proposition 𝒞(F)\mathcal{C}(F).
  2. PP is a predicate on a family and one real number: for each real ε\varepsilon, each family FF of the type FamP ε and each real CHC_H, it gives a proposition P(F,CH)P(F, C_H).

A family FamP ε is a structure with a real parameter ε\varepsilon. It has a threshold x1>1x_1 > 1, an index type IxI_x for each real xx, a datum D(x,i)D(x,i) of the type D7 and size data L(x,i)L(x,i) for each xx and each i∈Ixi \in I_x, and many named real constants. The size data have the scale parameter ε\varepsilon (the field L_eps). The constants of FF are put in four lists: cPre, cOut, cMid CH (which contains CHC_H as its first entry) and cLast.

A threshold record KK of the type TransportedAlt has four parts: a real number K.pre and three functions K.t, K.mid, K.last from lists of reals to reals. The statement Fm.Large K CH is the conjunction of four parts:

  • each entry cc of Fm.cPre satisfies K.pre≤cK.\mathrm{pre} \le c,
  • True (the part K.t is not read),
  • each entry cc of Fm.cMid CH satisfies K.mid(cOut)≤cK.\mathrm{mid}(\mathrm{cOut}) \le c,
  • each entry cc of Fm.cLast satisfies K.last(cOut+ ⁣ ⁣+cMid CH)≤cK.\mathrm{last}(\mathrm{cOut} \mathbin{+\!\!+} \mathrm{cMid}\ C_H) \le c.

So the thresholds for the middle and last constants can depend on the constants in cOut and on earlier lists.

Then Closed 𝒞 P is the proposition: there is ε1>0\varepsilon_1 > 0 such that for each ε\varepsilon with 0<ε≤ε10 < \varepsilon \le \varepsilon_1 there is a threshold record KK such that for each family FF of the type FamP ε and each real CHC_H, if 𝒞(F)\mathcal{C}(F) holds and F.Large K CH holds, then P(F,CH)P(F, C_H) holds. In symbols:

∃ε1>0, ∀ε∈(0,ε1], ∃K, ∀F:FamP ε, ∀CH∈ℝ, 𝒞(F)∧Large(F,K,CH)⇒P(F,CH).\exists \varepsilon_1 > 0,\ \forall \varepsilon \in (0, \varepsilon_1],\ \exists K,\ \forall F : \mathrm{FamP}\ \varepsilon,\ \forall C_H \in \mathbb{R},\ \mathcal{C}(F) \wedge \mathrm{Large}(F, K, C_H) \Rightarrow P(F, C_H).

In words: PP holds for all small ε\varepsilon, for each family in the class whose constants are large enough. This is the "closed" of "closed bound" in the theorem names of the unitary hypotheses chapter.

Lean

def Formalism.MainNotions.Closed (𝒞 : FamClass) (P : ∀ {eps : ℝ}, FamP eps → ℝ → Prop) : Prop

The declaration is in Formalism/SharpRestriction/ParamsHeightRankConstant.lean, line 159. 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. The text only combines the existential and universal quantifiers above.

Notes

The order of the quantifiers matters. The threshold record KK may depend on ε\varepsilon, but not on the family FF or on CHC_H. The bound ε1\varepsilon_1 does not depend on anything.

The second part of FamP.Large is True, so the function K.t of a threshold record plays no role in Closed.

The same file proves Closed.and (two closed statements on one class give a closed conjunction, with min⁡(ε1,ε1′)\min(\varepsilon_1, \varepsilon_1') and the pointwise maximum of the two threshold records) and Closed.imp (a closed statement implies a closed statement with a weaker predicate).

The unitary hypotheses chapter uses Closed in many fields of the record HypsAlt, in the predicate S0.NL, in CovolumeBoundOfX and in the closed bound hypothesis of HypsAlt is nonempty from the closed bound.

Uses

The proof cites no other step.

The proof cites these declarations, but their steps are not written yet. The text above tells what each one gives: Formalism.MainNotions.FamClass, Formalism.MainNotions.FamP, Formalism.MainNotions.TransportedAlt.

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.