Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

High-side bound: the data probe approximates the Hecke signal with saving σ\sigmaσ

Proved
RH.Transport.PhysicalHigh.fixed_high_bound

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.

Assume B<β≤7/8B<\beta\le 7/8B<β≤7/8. Let DDD be tuned data with detector scales P=D.PP=D.PP=D.P, let FFF be source data with FirstTail(4 P.e, F.S)\mathrm{FirstTail}(4\,P.e,\ F.S)FirstTail(4P.e, F.S), let counts be count parameters for the modulus of FFF at the reserved loss t=10−15t=10^{-15}t=10−15, and let τ\tauτ satisfy

0<τ<1400,4τ<P.cost200,τ<t,2τ≤t,τ (2+4 P.eps)<t.0<\tau<\frac1{400},\qquad 4\tau<\frac{P.\mathrm{cost}}{200},\qquad \tau<t,\qquad 2\tau\le t,\qquad \tau\,(2+4\,P.\mathrm{eps})<t .0<τ<4001​,4τ<200P.cost​,τ<t,2τ≤t,τ(2+4P.eps)<t.

Then there is a constant C>0C>0C>0 such that for every Hecke character η\etaη there is Cη>0C_\eta>0Cη​>0 with the following property. For all sufficiently large ZZZ and every C0≥0C_0\ge 0C0​≥0, if the tuned source moment bound TSMB(F,D,counts;η,Z,τ,C0Zt,Z2τ)\mathrm{TSMB}\big(F,D,\mathrm{counts};\eta,Z,\tau,C_0Z^{t},Z^{2\tau}\big)TSMB(F,D,counts;η,Z,τ,C0​Zt,Z2τ) holds, then

∣JF,D,η(Z)−Sχ,H,c(Z)∣≤(Cη+C C0 N(fη)2 P.eps) Zsig⁡(β)−P.σ.\Big|J_{F,D,\eta}(Z)-S_{\chi,H,c}(Z)\Big|\le\Big(C_\eta+C\,C_0\,N(\mathfrak f_\eta)^{2\,P.\mathrm{eps}}\Big)\,Z^{\operatorname{sig}(\beta)-P.\sigma}.​JF,D,η​(Z)−Sχ,H,c​(Z)​≤(Cη​+CC0​N(fη​)2P.eps)Zsig(β)−P.σ.

Here JF,D,ηJ_{F,D,\eta}JF,D,η​ is the data probe, χ\chiχ is η\etaη with the primes of F.SF.SF.S deleted, H(s)H(s)H(s) is the source correction of η\etaη for F.SF.SF.S, c=sig⁡(0)c=\operatorname{sig}(0)c=sig(0), Sχ,H,cS_{\chi,H,c}Sχ,H,c​ is the source's Hecke signal, and N(fη)N(\mathfrak f_\eta)N(fη​) is the absolute norm of the modulus of η\etaη.

This is the high-side half of the common probe at the tuned boundary: conditionally on the moment bound, the probe differs from the signal by a power saving P.σP.\sigmaP.σ below the signal exponent at β\betaβ, with a constant CCC that is uniform in η\etaη.

Formalization Note JF,D,ηJ_{F,D,\eta}JF,D,η​ is RH.Transport.dataProbe (definition Transport_DataProbe), TSMB\mathrm{TSMB}TSMB is TunedSourceMomentBound (definition Transport_PhysicalHigh_MomentBound), the signal is OAI.SevenEighths.HeckeSignal.signal and the correction is PrincipalSignalComparison.sourceCorrection. The quantifier order is the source's: CCC is chosen before η\etaη, CηC_\etaCη​ after, and C0C_0C0​ after ZZZ.

Preamble
import Mathlib
import Definitions.Def_HeckeSevenEighths
import Definitions.Def_OAIHecke78B027
import Definitions.Def_Transport_PhysicalHigh_MomentBound
import Definitions.Def_Transport_DataProbe
set_option autoImplicit false
open RH RH.Transport RH.Transport.PhysicalHigh
open scoped Classical BigOperators ContDiff
open Filter
open OAI OAI.SevenEighths
open ProbeFinalAssembly
open HeckeFamily ProbePhysical ProbeHighRowFamily Parameters PrincipalSignalComparison
open HeckeInverseAmplification HeckeDetectorPhysicalSelection HeckeDetectorFiberPartition
open ProbeMellinBoundary
noncomputable section
Formal statement
theorem RH.Transport.PhysicalHigh.fixed_high_bound (hβ : TunedCandidate.B<HeckeZeroSupremum.beta)
    (hceiling : HeckeZeroSupremum.beta≤7/8)
    {Kmin : ℕ} {allowance : ℝ} (D : TunedData Kmin allowance)
    {Δ : ℝ} {seed : HighData Δ} (F : SourceData seed)
    (hfirst : FirstTail (4*D.P.e) F.S)
    (counts : CountParameters F.modulus ⊤ reservedLoss) (τ : ℝ)
    (hτ : 0<τ) (hτd : τ<(1/200:ℝ)/2) (hτcost : 4*τ<(1/200:ℝ)*D.P.cost)
    (hτt : τ<reservedLoss) (hτ2 : 2*τ≤reservedLoss) (hτeps : τ*(2+4*D.P.eps)<reservedLoss) :
    ∃C : ℝ,0<C ∧ ∀η : Character,∃Ct : ℝ,0<Ct ∧ ∀ᶠZ : ℝ in atTop,
      ∀C0 : ℝ,0≤C0 → TunedSourceMomentBound F D counts η Z τ (C0*Z^reservedLoss) (Z^(2*τ)) →
      ‖RH.Transport.dataProbe F D η Z-HeckeSignal.signal (η.excludePrimes F.S F.exclusions.prime)
        (sourceCorrection η F.S) (TunedCandidate.signal 0) Z‖≤
        (Ct+C*C0*(η.modulus.absNorm:ℝ)^(2*D.P.eps))*Z^(TunedCandidate.signal HeckeZeroSupremum.beta-D.P.sigma) := by sorry
Source
LW56e2, quasi-riemann-improved, commit b83dbbd914c5751acf9bc3389cde58970437278f, lean/Transport/PhysicalHigh/FixedHigh.lean, theorem fixed_high_bound (L21-L33): https://github.com/LW56e2/quasi-riemann-improved/blob/b83dbbd914c5751acf9bc3389cde58970437278f/lean/Transport/PhysicalHigh/FixedHigh.lean#L21-L33

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