Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Tuned high-side scalar data: reserved loss, conductor cap and the record TunedData(Kmin⁡,a)\mathrm{TunedData}(K_{\min},a)TunedData(Kmin​,a)

Definition
Transport_PhysicalHigh_TunedData

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.

This file fixes the scalar data of the high-side estimate at the tuned boundary.

  1. Reserved loss. t=10−15t=10^{-15}t=10−15.

  2. Conductor cap. dmax⁡=h+ζ+2td_{\max}=h+\zeta+2tdmax​=h+ζ+2t, the largest conductor exponent that the tuned detector is allowed to reach.

  3. Tuned data. For a natural number Kmin⁡K_{\min}Kmin​ and a real allowance aaa, a record TunedData(Kmin⁡,a)\mathrm{TunedData}(K_{\min},a)TunedData(Kmin​,a) consists of

    • a positive even number of slots K≥Kmin⁡K\ge K_{\min}K≥Kmin​;
    • slot lengths ℓj∈R\ell_j\in\mathbb Rℓj​∈R, j=1,…,Kj=1,\dots,Kj=1,…,K, pairwise distinct, with ∑jℓj=ℓ\sum_j\ell_j=\ell∑j​ℓj​=ℓ;
    • the minimal slot length ℓmin⁡=ℓ/(2K)>0\ell_{\min}=\ell/(2K)>0ℓmin​=ℓ/(2K)>0 and the minimal conductor ratio rmin⁡=ℓmin⁡/dmax⁡>0r_{\min}=\ell_{\min}/d_{\max}>0rmin​=ℓmin​/dmax​>0, with
ℓmin⁡≤ℓj≤t200,ℓj≤plainMesh⁡(t)200(1≤j≤K);\ell_{\min}\le \ell_j\le \frac{t}{200},\qquad \ell_j\le\frac{\operatorname{plainMesh}(t)}{200}\qquad(1\le j\le K);ℓmin​≤ℓj​≤200t​,ℓj​≤200plainMesh(t)​(1≤j≤K);
  • a system PPP of detector scales (ε,e,κ,cost,eps,σ)(\varepsilon,e,\kappa,\mathrm{cost},\mathrm{eps},\sigma)(ε,e,κ,cost,eps,σ) for the parameters (t,K,rmin⁡,ℓmin⁡,a)(t,K,r_{\min},\ell_{\min},a)(t,K,rmin​,ℓmin​,a), that is, positive reals bounded by the allowance aaa and satisfying the budget inequalities of the definition Transport_PhysicalHigh_Parameters.

The record collects every scalar choice of the high-side argument in the order in which the source makes them: the loss ttt and the mesh are fixed first, then KKK and the slots, and the detector scales last, so that the allowance aaa may depend on the final contradiction gap without affecting the slots.

Formalization Note Transcribed verbatim from the source. reservedLoss is an abbrev; the structure field P has type DetectorScales reservedLoss K rmin ellMin allowance. The source's derived inequalities about these objects (for example conductorCap_pos, TunedData.high_budget) are theorems and are not included here.

Definition code
import Mathlib
import Definitions.Def_Transport_PhysicalHigh_Parameters
import Definitions.Def_Transport_PhysicalHigh_EnergyMesh

set_option autoImplicit false

/-!
# Complete tuned high-side scalar data

The reserved high loss and capacity are fixed first. The energy mesh is
therefore fixed before K. The slot construction allows any prior lower
bound on K. The positive allowance may depend on the later contradiction
gap; it only affects post-slot errors, not the selected slots.
-/

namespace RH.Transport.PhysicalHigh
noncomputable section
open scoped BigOperators

abbrev reservedLoss : ℝ := 1 / 1000000000000000
noncomputable def conductorCap : ℝ := TunedCandidate.h + TunedCandidate.zeta + 2 * reservedLoss

structure TunedData (Kmin : ℕ) (allowance : ℝ) where
  K : ℕ
  K_large : Kmin ≤ K
  K_pos : 0 < K
  K_even : Even K
  ell : Fin K → ℝ
  ellMin : ℝ
  rmin : ℝ
  ellMin_eq : ellMin = TunedCandidate.ell / (2 * K)
  rmin_eq : rmin = ellMin / conductorCap
  ellMin_pos : 0 < ellMin
  rmin_pos : 0 < rmin
  slots_injective : Function.Injective ell
  slots_sum : (∑ j, ell j) = TunedCandidate.ell
  slots_pos : ∀ j, 0 < ell j
  slots_lower : ∀ j, ellMin ≤ ell j
  slots_upper : ∀ j, ell j ≤ (1 / 200 : ℝ) * reservedLoss
  slots_fine : ∀ j, ell j ≤ plainMesh reservedLoss / 200
  P : DetectorScales reservedLoss K rmin ellMin allowance

end
end RH.Transport.PhysicalHigh
Source
LW56e2, quasi-riemann-improved, commit b83dbbd914c5751acf9bc3389cde58970437278f, lean/Transport/PhysicalHigh/TunedData.lean, reservedLoss (L17), conductorCap (L18), structure TunedData (L35-L53): https://github.com/LW56e2/quasi-riemann-improved/blob/b83dbbd914c5751acf9bc3389cde58970437278f/lean/Transport/PhysicalHigh/TunedData.lean#L17-L53

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