Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Count parameters exist for source data at every positive moment loss ttt

Proved
RH.Transport.PhysicalHigh.exists_tuned_count_parameters

by Himan · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

analytic-number-theorynumber-theoryqrh-lw56e2-b83dbbdtowards-grh

Throughout, O=Z[ζ3]\mathcal O=\mathbb Z[\zeta_3]O=Z[ζ3​], a Hecke character is a finite-order Hecke character of Q(ζ3)\mathbb Q(\zeta_3)Q(ζ3​) in OpenAI's family-003 development, and β\betaβ is the supremum of the real parts of the zeros of the associated Hecke LLL-functions (pole exception excluded, sentinel at 1/21/21/2). The tuned constants of LW56e2's refinement are p=214651/1250000000p=214651/1250000000p=214651/1250000000, the Gram exponent b=192821/1562500b=192821/1562500b=192821/1562500, the total slot length ℓ=16+p\ell=\tfrac16+pℓ=61​+p, the row and column exponents ℓx=(1−ℓ−b)/2\ell_x=(1-\ell-b)/2ℓx​=(1−ℓ−b)/2 and ℓy=(1−ℓ+b)/2\ell_y=(1-\ell+b)/2ℓy​=(1−ℓ+b)/2, the conductor exponent h=(1+3ℓ+b)/2h=(1+3\ell+b)/2h=(1+3ℓ+b)/2, the cushion ζ=1/(8⋅1012)\zeta=1/(8\cdot 10^{12})ζ=1/(8⋅1012), the boundary B=1112−ℓ4=4374785349/5000000000B=\tfrac{11}{12}-\tfrac{\ell}{4}=4374785349/5000000000B=1211​−4ℓ​=4374785349/5000000000 and the signal exponent sig⁡(s)=s+ℓx/2−1+h/6=s−2147607/3125000\operatorname{sig}(s)=s+\ell_x/2-1+h/6=s-2147607/3125000sig(s)=s+ℓx​/2−1+h/6=s−2147607/3125000.

Let FFF be source data over a high-side seed, with modulus MF=∏P∈F.SPM_F=\prod_{P\in F.S}PMF​=∏P∈F.S​P, and let t>0t>0t>0. Then there exist count parameters for (MF,⊤,t)(M_F,\top,t)(MF​,⊤,t): constants

0<cB≤1,kB>0,0<cH≤1,kH>00<c_B\le 1,\quad k_B>0,\qquad 0<c_H\le 1,\quad k_H>00<cB​≤1,kB​>0,0<cH​≤1,kH​>0

for which OpenAI's balanced-range and high-range row count bounds hold for the full group H=(O/MF)×H=(\mathcal O/M_F)^\timesH=(O/MF​)× at moment loss ttt. In other words, the record type CountParameters(MF,⊤,t)\mathrm{CountParameters}(M_F,\top,t)CountParameters(MF​,⊤,t) is nonempty.

The count constants are thereby chosen at the actual reserved moment loss, before the moment degree and the height exponent are selected.

Formalization Note CountParameters is OAI.SevenEighths.ProbeHighRowFamily.CountParameters from the platform bundle OAIHecke78B027; its two fields balanced and high are the count bounds referred to above.

Preamble
import Mathlib
import Definitions.Def_HeckeSevenEighths
import Definitions.Def_OAIHecke78B027
set_option autoImplicit false
open scoped Classical ContDiff
open OAI OAI.SevenEighths
open HeckeFamily ProbePhysical ProbeHighRowFamily ProbeFinalAssembly Parameters
local notation "O" => HeckeFamily.O
noncomputable section
Formal statement
theorem RH.Transport.PhysicalHigh.exists_tuned_count_parameters {Δ : ℝ} {D : HighData Δ}
    (F : SourceData D) (t : ℝ) (ht : 0 < t) :
    Nonempty (CountParameters F.modulus ⊤ t) := by sorry
Source
LW56e2, quasi-riemann-improved, commit b83dbbd914c5751acf9bc3389cde58970437278f, lean/Transport/PhysicalHigh/FixedSource.lean, theorem exists_tuned_count_parameters (L41-L43): https://github.com/LW56e2/quasi-riemann-improved/blob/b83dbbd914c5751acf9bc3389cde58970437278f/lean/Transport/PhysicalHigh/FixedSource.lean#L41-L43

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me