Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Explicit thresholds and support cutoffs in the Bourgain component estimate

Definition
NarrowDNF_BourgainParameters

by chenghua.liu · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsnarrow-dnf-authors-importprobabilitystoc-2027

For a natural degree cutoff kkk and a real error parameter ε\varepsilonε, define

η(k,ε)=ε10k310k2,τ(k,ε)=ε336k,R(k,ε)=318kε10.\eta(k,\varepsilon)=\frac{\varepsilon^{10k}}{3^{10k^2}},\qquad \tau(k,\varepsilon)=\frac{\varepsilon^3}{3^{6k}},\qquad R(k,\varepsilon)=\frac{3^{18k}}{\varepsilon^{10}}.η(k,ε)=310k2ε10k​,τ(k,ε)=36kε3​,R(k,ε)=ε10318k​.

The integer cutoff is the natural-number ceiling r(k,ε)=⌈R(k,ε)⌉+r(k,\varepsilon)=\lceil R(k,\varepsilon)\rceil_+r(k,ε)=⌈R(k,ε)⌉+​.

In their analytic use, ε>0\varepsilon>0ε>0 and the stated upper bounds on the error parameter are supplied by the surrounding theorem. The symbol ε\varepsilonε is an error budget, not the base of the exponential function. The Fourier threshold η\etaη retains the constants used in the paper; τ\tauτ controls which coordinate square functions are considered large; and the ceiling cutoff turns the real support-size budget into an integer. The bundle fixes these numerical choices without asserting the component estimate that later connects them.

Definition code
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

namespace NarrowDNF.BourgainParameters
end NarrowDNF.BourgainParameters


/-! Explicit numerical choices for the reconstructed Bourgain small-component
estimate. The Fourier threshold eta retains the paper's constants. -/

noncomputable section
namespace NarrowDNF.BourgainParameters

def eta (k : ℕ) (e : ℝ) : ℝ := e^(10*k) / (3:ℝ)^(10*k^2)
def tau (k : ℕ) (e : ℝ) : ℝ := e^3 / (3:ℝ)^(6*k)
def realCutoff (k : ℕ) (e : ℝ) : ℝ := (3:ℝ)^(18*k) / e^10
def cutoff (k : ℕ) (e : ℝ) : ℕ := ⌈realCutoff k e⌉₊























end NarrowDNF.BourgainParameters
Source
https://github.com/liuchliuch/narrow-dnf-lean/blob/eecadd6a5ea0a331d6cf9fd5cb39fc6ec854b372/NarrowDNF/BourgainParameters.lean#L16-L16 https://github.com/liuchliuch/narrow-dnf-lean/blob/eecadd6a5ea0a331d6cf9fd5cb39fc6ec854b372/NarrowDNF/BourgainParameters.lean#L17-L17 https://github.com/liuchliuch/narrow-dnf-lean/blob/eecadd6a5ea0a331d6cf9fd5cb39fc6ec854b372/NarrowDNF/BourgainParameters.lean#L18-L18 https://github.com/liuchliuch/narrow-dnf-lean/blob/eecadd6a5ea0a331d6cf9fd5cb39fc6ec854b372/NarrowDNF/BourgainParameters.lean#L19-L19

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