Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The rounded Bourgain cutoff preserves the first error bound

Proved
NarrowDNF.BourgainParameters.first_term_le

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

combinatoricsnarrow-dnf-authors-importprobabilitystoc-2027

Let k≥1k\ge1k≥1 be an integer and 0<e≤10<e\le10<e≤1. Define the real cutoff, its integer rounding, and the component threshold by

R=318ke10,M=⌈R⌉,η=e10k310k2.R=\frac{3^{18k}}{e^{10}},\qquad M=\lceil R\rceil,\qquad \eta=\frac{e^{10k}}{3^{10k^2}}.R=e10318k​,M=⌈R⌉,η=310k2e10k​.

Then

Mkη2≤e23k.M^k\eta^2\le\frac{e^2}{3^k}.Mkη2≤3ke2​.

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 R≥1R\ge1R≥1.

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 sorry
Source
https://github.com/liuchliuch/narrow-dnf-lean/blob/eecadd6a5ea0a331d6cf9fd5cb39fc6ec854b372/NarrowDNF/BourgainParameters.lean#L56-L91

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