Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Low-side bound: the data probe is O(Zsig⁡(B)+loss)O\big(Z^{\operatorname{sig}(B)+\mathrm{loss}}\big)O(Zsig(B)+loss)

Proved
RH.Transport.dataProbe_low

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, DDD tuned data, and η\etaη a Hecke character, and let JF,D,η:R→CJ_{F,D,\eta}:\mathbb R\to\mathbb CJF,D,η​:R→C be the data probe. Then for every real loss>0\mathrm{loss}>0loss>0,

JF,D,η(Z)=O(Zsig⁡(B)+loss)(Z→∞).J_{F,D,\eta}(Z)=O\big(Z^{\operatorname{sig}(B)+\mathrm{loss}}\big)\qquad(Z\to\infty).JF,D,η​(Z)=O(Zsig(B)+loss)(Z→∞).

This is the low-side half of the common probe at the tuned boundary: the probe itself grows no faster than the signal exponent evaluated at the boundary BBB, up to an arbitrarily small loss. No hypothesis on β\betaβ is used.

Formalization Note JF,D,ηJ_{F,D,\eta}JF,D,η​ is RH.Transport.dataProbe from the definition Transport_DataProbe; the OOO is Mathlib's Asymptotics.IsBigO along Filter.atTop, and the implied constant may depend on FFF, DDD, η\etaη and the loss.

Preamble
import Mathlib
import Definitions.Def_HeckeSevenEighths
import Definitions.Def_OAIHecke78B024
import Definitions.Def_Transport_DataProbe
set_option autoImplicit false
open RH RH.Transport
open scoped Classical BigOperators ContDiff
open Filter Asymptotics
open OAI OAI.SevenEighths
open HeckeFamily ProbePhysical ProbeFinalAssembly
noncomputable section
Formal statement
theorem RH.Transport.dataProbe_low {Δ : ℝ} {seed : Parameters.HighData Δ} (F : SourceData seed)
    {Kmin : ℕ} {allowance : ℝ} (D : PhysicalHigh.TunedData Kmin allowance)
    (loss : ℝ) (hloss : 0<loss) (η : Character) :
    dataProbe F D η=O[atTop](fun Z : ℝ=>Z^(TunedCandidate.signal TunedCandidate.B+loss)) := by sorry
Source
LW56e2, quasi-riemann-improved, commit b83dbbd914c5751acf9bc3389cde58970437278f, lean/Transport/DataProbe.lean, theorem dataProbe_low (L20-L23): https://github.com/LW56e2/quasi-riemann-improved/blob/b83dbbd914c5751acf9bc3389cde58970437278f/lean/Transport/DataProbe.lean#L20-L23

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