Low inactive reflected energy bound, for total slot width
ProvedOAI.SevenEighths.InverseReflectedPhase.transport_low_original_inactive_energyThroughout, 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 for Hecke -functions of ). The parameter (totalWidth) is the total width of the prime slots, with
so that rows have length . OpenAI's development fixes . The reflected loss is
which vanishes for and .
Statement. Let be a finite family of cusp data with fixed cusp shapes, and the base congruences, and let be smooth with support in , . Under the further data and hypotheses of the Lean statement, in particular
the sum over the parent rows of the squared norms of the reflected inactive values, with source normTwistedSource W θ at scale , is at most
for a degree and a constant that do not depend on the rows, the tuples or .
This is the energy bound after the member choices and the dyadic decomposition of the inactive slots have been carried out. The factor in front counts the dyads of the inactive slots.
Relation to the fixed-width statement. For this is OpenAI's Proved theorem OAI.SevenEighths.InverseReflectedPhase.low_original_inactive_energy. The statement here differs from it only as follows: is replaced by and by in the hypotheses on the row length, on and on , and the term is added to the exponent of in the conclusion. All other hypotheses and all objects are unchanged.
Formalization Note RH.Transport.Reflected.reflectedLoss totalWidth d is . The remaining 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.
import Mathlib import Definitions.Def_OAIHecke78B026 import Definitions.Def_Transport_ReflectedExponent set_option autoImplicit false
namespace OAI
namespace SevenEighths.InverseReflectedPhase
open scoped Classical BigOperators ContDiff
open ActualEisensteinCubic CubicEisenstein CompletedGauss CompletedDyadic CanonicalQuadraticSieve CanonicalRowCompletion InverseTerminalWidths InverseMoment
noncomputable section
local notation "Eis" => ActualEisensteinCubic.O
universe v
variable {Nlevel : Eis}
theorem transport_low_original_inactive_energy (totalWidth : ℝ) (hE0 : 0≤ totalWidth) (hE1 : totalWidth≤1/5)
{γ : Type*} [Fintype γ] (a c₀ : γ→Eis) (mode : γ→Bool)
[Fintype (Eis⧸Ideal.span {Nlevel^2})]
(lo hi : ℝ) (hlo : 0< lo)
(W : ℝ→ℂ) (hWs : Function.support W⊆Set.Icc lo hi) (hW : ContDiff ℝ ∞ W)
(s : ∀ i,FixedCuspShape (ControlledStratumArithmetic.fixedCusp (a i) (c₀ i) (mode i))) (hc₀ : ∀ i,c₀ i≠0)
(hNlevel : ∀ i,(9:Eis)*c₀ i∣Nlevel)
(hbase : ∀ i,if mode i then ConcretePrimeRowBridge.goodLambda^2∣a i-1 else ConcretePrimeRowBridge.goodLambda^2∣c₀ i-1)
(hac : ∀ i,IsCoprime (a i) (c₀ i))
(Q : Ideal Eis) (hQ : Q≠0) (Ck η : ℝ) (hCk : 0< Ck) (hη : 0< η) (hη1 : η≤1) :
∃ (degree : ℕ) (C Z₀ : ℝ),0< C ∧ 1< Z₀ ∧
∀ g : γ,∀ {σ : Type v} [Fintype σ] [DecidableEq σ],∀ (J F Q₀ : Ideal Eis)
(_hJ : J≠0) (_hF : F≠0),
∀ (A : Finset (FreeReflection.pool J Q Q₀))
(Z d ell0 shift O₀ : ℝ),
Z₀≤ Z → 0≤ d → d≤ totalWidth → 0≤ ell0 → ell0≤ totalWidth-d+η → |shift|≤ η →
O₀=normWidth Z (rowPowerfulPart J) →
∀ (parents rows : Finset (Ideal Eis)),
(∀ I∈parents,I≠0 ∧ (Ideal.absNorm I:ℝ)≤ Ck*Z^(1-totalWidth-2*d)) →
rows⊆originalResidualRows parents J Q →
(∀ P∈fixedBadPrimes,P∣Q) →
let G := (poolPrimeFamily J Q Q₀).restrict A
let jF := fun b : A => completedLocalExponent J F b.val.val
∀ (lists : σ→Finset (Ideal Eis)) (H : σ→ℝ)
(_hdis : Pairwise (fun i j => Disjoint (lists i) (lists j)))
(hmax : ∀ i,∀ P∈lists i,P.IsMaximal)
(hgood : ∀ i,∀ P∈lists i,ConcretePrimeRowBridge.goodLambda∉P)
(_hprime : ∀ i,∀ P∈lists i,Prime P)
(hrows : ∀ K∈rows,Admissible K),
(∀ i,1≤ H i) → (∀ i,∀ P∈lists i,(Ideal.absNorm P:ℝ)≤ H i) → (∏ i,H i)≤ Z^ell0 →
(∀ f,IsCoprime (Ideal.span {Nlevel}) (G.ideal f)) →
(∀ f,ringChar (Eis⧸G.ideal f)≠2) →
(∀ K∈rows,(∀ f,IsCoprime (G.ideal f) K) ∧ IsCoprime (Ideal.span {Nlevel}) K) →
(∀ i,∀ P∈lists i,IsCoprime (Ideal.span {Nlevel}) P) →
(∀ i,∀ P∈lists i,ringChar (Eis⧸P)≠2) →
∀ T : Finset σ,
∃ D : ∀ K : rows,
∀ _b : supportedSlotChoices (fun i : {i // i∉T} => lists i.val) (poolPrimeFamily J Q Q₀).ideal K.val,
∀ p : supportedSlotChoices (fun i : T => lists i.val) (poolPrimeFamily J Q Q₀).ideal K.val,
ControlledStratumArithmetic (G.reflected K.val (hrows K.val K.property)
(slotChoiceFamily (fun i : T => lists i.val) (fun i => hmax i.val) (fun i => hgood i.val) p.val)).generator
Nlevel (a g) (c₀ g) (mode g),
∀ (θ : ℝ) (w : ∀ i,lists i→ℂ), (∀ i P,‖w i P‖≤1) →
(∑ K : rows,‖∑ b : supportedSlotChoices (fun i : {i // i∉T} => lists i.val)
(poolPrimeFamily J Q Q₀).ideal K.val,
((∏ i : {i // i∉T},(Ideal.absNorm (b.val i).val:ℂ)⁻¹)*(∏ i : {i // i∉T},w i.val (b.val i)))*
∑ p : supportedSlotChoices (fun i : T => lists i.val) (poolPrimeFamily J Q Q₀).ideal K.val,
(∏ i : T,w i.val (p.val i))*mixedReflectedValue (D K b p) (s g)
(G.reflected K.val (hrows K.val K.property)
(slotChoiceFamily (fun i : T => lists i.val) (fun i => hmax i.val) (fun i => hgood i.val) p.val)).generator_ne_zero (hc₀ g)
(G.reflected K.val (hrows K.val K.property)
(slotChoiceFamily (fun i : T => lists i.val) (fun i => hmax i.val) (fun i => hgood i.val) p.val)).generator_good
(reflectedExponent jF) (slotIndices A (PrimeIndex K.val) T)
(CompletedHeight.normTwistedSource W θ) (Z^(1+ell0+shift))‖^2)≤
(∏ i : {i // i∉T},256*(columnDyadicLength (H i.val)+1:ℝ))^2*
(C*(1+‖θ‖)^degree*Z^((1-totalWidth-2*d)+RH.Transport.Reflected.reflectedLoss totalWidth d+505*η-O₀/2)) := by sorry
end
end SevenEighths.InverseReflectedPhase
end OAI