Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bound for the low common Gaussian dyad, for total slot width E≤1/5E\le1/5E≤1/5 and outer exponents x<yx<yx<y

Proved
OAI.SevenEighths.ProbePhysical.transport_low_central_gaussian_dyad

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​] is the ring of Eisenstein integers and all objects named in typewriter font are those of OpenAI's family-003 development (the zero-free half-plane Re⁡s>7/8\operatorname{Re}s>7/8Res>7/8 for Hecke LLL-functions of Q(ζ3)\mathbb Q(\zeta_3)Q(ζ3​)). The parameter EEE (totalWidth) is the total width of the prime slots, with

0≤E≤15,0\le E\le\tfrac15 ,0≤E≤51​,

so that rows have length Z1−EZ^{1-E}Z1−E. OpenAI's development fixes E=16E=\tfrac16E=61​. The reflected loss is

λ(E,d)=14max⁡(0,  5E−1+d),\lambda(E,d)=\tfrac14\max\big(0,\;5E-1+d\big),λ(E,d)=41​max(0,5E−1+d),

which vanishes for E=16E=\tfrac16E=61​ and 0≤d≤160\le d\le\tfrac160≤d≤61​.

Statement. Let x,yx,yx,y be real with

x+y=1−E,x<y,E<2x−y.x+y=1-E,\qquad x<y,\qquad E<2x-y .x+y=1−E,x<y,E<2x−y.

Let η\etaη be a Hecke character, SSS a finite set of maximal ideals containing fixedBadPrimes, ℓ1,…,ℓK≥0\ell_1,\dots,\ell_K\ge0ℓ1​,…,ℓK​≥0 with ∑iℓi≤E\sum_i\ell_i\le E∑i​ℓi​≤E, reals a>0a>0a>0, bbb, 0<ε<10<\varepsilon<10<ε<1, and smooth W0,W1W_0,W_1W0​,W1​ supported in [a0,b0][a_0,b_0][a0​,b0​], [a1,b1][a_1,b_1][a1​,b1​] with a0,a1>0a_0,a_1>0a0​,a1​>0, a1<b1a_1<b_1a1​<b1​ and ∣W1∣≤M|W_1|\le M∣W1​∣≤M. There are a degree D∈ND\in\mathbb ND∈N and C>0C>0C>0 such that for all sufficiently large ZZZ one has Z>1Z>1Z>1 and the following holds. For all pairwise disjoint finite sets TiT_iTi​ of Supported prime ideals outside SSS with norms in [aZℓi,bZℓi][aZ^{\ell_i},bZ^{\ell_i}][aZℓi​,bZℓi​], every set JJJ of slots, every UUU with

Z1+μ−ε/2≤U≤Z1+μ+ε/2,μ=lowSelectedLength ℓ J,Z^{1+\mu-\varepsilon/2}\le U\le Z^{1+\mu+\varepsilon/2},\qquad \mu=\texttt{lowSelectedLength}\ \ell\ J ,Z1+μ−ε/2≤U≤Z1+μ+ε/2,μ=lowSelectedLength ℓ J,

all slot weights bounded by 111 and every compactly supported Schwartz function VVV,

∥lowCommonDyad(… ; Zx,Zy,U,Z1+μ,V)∥≤C Z x/2+(y−x)/12+254ε  gaussianJointMoment V D (U/Z1+μ).\big\lVert\texttt{lowCommonDyad}(\dots;\,Z^{x},Z^{y},U,Z^{1+\mu},V)\big\rVert\le C\,Z^{\,x/2+(y-x)/12+254\varepsilon}\;\texttt{gaussianJointMoment}\ V\ D\ \big(U/Z^{1+\mu}\big).​lowCommonDyad(…;Zx,Zy,U,Z1+μ,V)​≤CZx/2+(y−x)/12+254εgaussianJointMoment V D (U/Z1+μ).

This bounds one central dyad of the Gaussian decomposition of the low-side compensated probe. Summing over the central dyads and adding the remote ones gives the low-side probe bound with exponent x/2+(y−x)/12x/2+(y-x)/12x/2+(y−x)/12.

Relation to the fixed-width statement. For E=16E=\tfrac16E=61​ this is OpenAI's Proved theorem OAI.SevenEighths.ProbePhysical.low_central_gaussian_dyad. The statement here differs from it only as follows: ∑iℓi≤16\sum_i\ell_i\le\tfrac16∑i​ℓi​≤61​ is replaced by ∑iℓi≤E\sum_i\ell_i\le E∑i​ℓi​≤E; the outer scales Z17/48Z^{17/48}Z17/48 and Z23/48Z^{23/48}Z23/48 are replaced by ZxZ^{x}Zx and ZyZ^{y}Zy under the three displayed hypotheses on x,yx,yx,y; and the exponent 316\tfrac3{16}163​ is replaced by x/2+(y−x)/12x/2+(y-x)/12x/2+(y−x)/12, which equals 316\tfrac3{16}163​ at the fixed values. All other hypotheses and all objects are unchanged.

Formalization Note The definitions are OpenAI's, from the definition bundles of the OpenAI mission on this platform. Spaces were inserted after some < and ≤ signs so that the statement tokenizes under import Mathlib; the statement is otherwise verbatim from the source.

Preamble
import Mathlib
import Definitions.Def_HeckeSevenEighths
import Definitions.Def_OAIHecke78B022
import Definitions.Def_OAIHecke78B023
import Definitions.Def_Transport_ReflectedExponent
set_option autoImplicit false
Formal statement
namespace OAI

noncomputable section

open scoped Classical ContDiff SchwartzMap

open MeasureTheory

namespace SevenEighths.ProbePhysical

open CompletedGauss CanonicalQuadraticSieve RayFourExpansion

local notation "O" => ActualEisensteinCubic.O

local notation "Id" => Ideal O

theorem transport_low_central_gaussian_dyad
    (totalWidth x y : ℝ) (hE0 : 0≤ totalWidth) (hE1 : totalWidth≤1/5)
    (hsumXY : x+y=1-totalWidth) (hxy : x< y) (hgrow : totalWidth<2*x-y) (η : HeckeFamily.Character) (S : Finset Id)
    (hS : ∀P∈S,P.IsMaximal) (hbad : fixedBadPrimes⊆S)
    {K : ℕ} (ell : Fin K→ℝ) (hell : ∀i,0≤ ell i) (hsum : ∑i,ell i≤ totalWidth)
    (a b ε : ℝ) (ha : 0< a) (hε : 0< ε) (hε1 : ε<1)
    (W0 W1 : ℝ→ℂ) (a0 b0 a1 b1 M : ℝ) (ha0 : 0< a0) (ha1 : 0< a1)
    (hab1 : a1< b1) (hM : 0≤ M)
    (hW0 : Function.support W0⊆Set.Icc a0 b0) (hW1 : Function.support W1⊆Set.Icc a1 b1)
    (hW0s : ContDiff ℝ ∞ W0) (hW1s : ContDiff ℝ ∞ W1) (hWM : ∀x,‖W1 x‖≤ M) :
    ∃degree : ℕ,∃C : ℝ,0< C ∧ ∀ᶠZ : ℝ in Filter.atTop,1< Z ∧
    ∀(T : Fin K→Finset PrimeIdeal),(∀i P,P∈T i→Supported P.val)→
      (∀i P,P∈T i→P.val∉S)→Pairwise (fun i j=>Disjoint (T i) (T j))→
      (∀i P,P∈T i→a*Z^(ell i)≤(Ideal.absNorm P.val:ℝ) ∧ (Ideal.absNorm P.val:ℝ)≤ b*Z^(ell i))→
    ∀(J : Finset (Fin K))(U : ℝ),0< U→
      Z^(1+lowSelectedLength ell J-ε/2)≤ U→U≤ Z^(1+lowSelectedLength ell J+ε/2)→
    ∀(W : Fin K→ℝ→ℂ),(∀i x,‖W i x‖≤1)→
    ∀(V : SchwartzMap ℝ ℂ)(hV : HasCompactSupport (V:ℝ→ℂ)),
      ‖lowCommonDyad η (calibrationForSet S hS) W0 W1 (fun i=>canonicalSlotSupport (T i))
        W (fun i=>Z^(ell i)) J (Z^x) (Z^y) U
          (Z^(1+lowSelectedLength ell J)) V hV‖≤
        C*Z^((x/2+(y-x)/12)+254*ε)*gaussianJointMoment V hV degree (U/Z^(1+lowSelectedLength ell J)) := by sorry


end SevenEighths.ProbePhysical
end

end OAI
Source
LW56e2, quasi-riemann-improved, commit b83dbbd914c5751acf9bc3389cde58970437278f, lean/Transport/PhysicalLow/LowGaussianDyad.lean, theorem transport_low_central_gaussian_dyad (L20-L41): https://github.com/LW56e2/quasi-riemann-improved/blob/b83dbbd914c5751acf9bc3389cde58970437278f/lean/Transport/PhysicalLow/LowGaussianDyad.lean#L20-L41

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