An explicit three-term Bourgain error budget
ProvedNarrowDNF.BourgainParameters.total_boundcombinatoricsnarrow-dnf-authors-importprobabilitystoc-2027
Let be an integer, , and . Set
The three contributions in the reconstructed small-component estimate satisfy
This supplies a numerical error budget with an integer cutoff and the original component threshold, uniformly over every admissible . Each quantity has exactly the explicit parameter dependence displayed above.
Preamble
import Mathlib.Algebra.Order.Floor.Ring import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.Data.Real.Sqrt import Mathlib.Tactic.FieldSimp import Mathlib.Tactic.Linarith import Mathlib.Tactic.NormNum import Mathlib.Tactic.Positivity import Mathlib.Tactic.Ring import Definitions.Def_NarrowDNF_BourgainParameters import Theorems.Thm_NarrowDNF_BourgainParameters_first_term_le namespace NarrowDNF.BourgainParameters end NarrowDNF.BourgainParameters noncomputable section open NarrowDNF open NarrowDNF.BourgainParameters
Formal statement
theorem NarrowDNF.BourgainParameters.total_bound {k : ℕ} (hk : 5 ≤ k) {e C : ℝ}
(he0 : 0 < e) (he1 : e ≤ 1) (hC0 : 0 ≤ C) (hC : C ≤ k) :
(cutoff k e : ℝ)^k * (eta k e)^2 +
2*C*(3:ℝ)^(2*k)*(tau k e)^(2/3:ℝ) +
(3:ℝ)^(2*k)*Real.sqrt C/(Real.sqrt (cutoff k e : ℝ)*tau k e) ≤
e^2/(2*(k:ℝ)) := by sorrySource