The rounded Bourgain cutoff preserves the first error bound
ProvedNarrowDNF.BourgainParameters.first_term_lecombinatoricsnarrow-dnf-authors-importprobabilitystoc-2027
Let be an integer and . Define the real cutoff, its integer rounding, and the component threshold by
Then
Thus the counting contribution in the Bourgain error budget remains small when its cutoff is replaced by an actual integer. The ceiling here is the nonnegative integer ceiling, which agrees with the usual ceiling because .
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 namespace NarrowDNF.BourgainParameters end NarrowDNF.BourgainParameters noncomputable section open NarrowDNF open NarrowDNF.BourgainParameters
Formal statement
theorem NarrowDNF.BourgainParameters.first_term_le {k : ℕ} (hk : 1 ≤ k) {e : ℝ}
(he0 : 0 < e) (he1 : e ≤ 1) :
(cutoff k e : ℝ)^k * (eta k e)^2 ≤ e^2 / (3:ℝ)^k := by sorrySource