Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pointwise three-part Bourgain decomposition

Proved
NarrowDNF.BourgainComponents.pointwise_bourgain_split

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

combinatoricsnarrow-dnf-authors-importprobabilitystoc-2027

Let ι\iotaι be finite, FFF a finite family of subsets of ι\iotaι, and cS∈Rc_S\in\mathbb RcS​∈R. For k,M∈Nk,M\in\mathbb Nk,M∈N, assume ∣S∣≤k|S|\le k∣S∣≤k for all S∈FS\in FS∈F; let η,τ∈R\eta,\tau\in\mathbb Rη,τ∈R. Define T=∑S∈FcS21∣cS∣≤ηT=\sum_{S\in F}c_S^2\mathbf1_{|c_S|\le\eta}T=∑S∈F​cS2​1∣cS​∣≤η​, Qi=∑S∈F:i∈ScS2Q_i=\sum_{S\in F:i\in S}c_S^2Qi​=∑S∈F:i∈S​cS2​, and A={i:Qi>τ2}A=\{i:Q_i>\tau^2\}A={i:Qi​>τ2}. Then

T≤Mkη2+∑iQi1Qi≤τ2+1∣A∣≥M∑S∈FcS2.T\le M^k\eta^2+\sum_iQ_i\mathbf1_{Q_i\le\tau^2}+\mathbf1_{|A|\ge M}\sum_{S\in F}c_S^2.T≤Mkη2+i∑​Qi​1Qi​≤τ2​+1∣A∣≥M​S∈F∑​cS2​.

The three terms isolate mass on a small collection of large coordinates, contributions involving small coordinates, and the exceptional case of many large coordinates.

Preamble
import Mathlib.Algebra.BigOperators.GroupWithZero.Finset
import Mathlib.Algebra.BigOperators.Ring.Finset
import Mathlib.Algebra.Order.BigOperators.Group.Finset
import Mathlib.Algebra.Order.BigOperators.Ring.Finset
import Mathlib.Analysis.SpecialFunctions.Sqrt
import Mathlib.Data.Finset.Powerset
import Mathlib.Data.Fintype.BigOperators
import Mathlib.Data.Fintype.Pi
import Mathlib.Data.Nat.Choose.Bounds
import Mathlib.Data.Real.Basic
import Mathlib.Logic.Equiv.Prod
import Mathlib.Tactic.FieldSimp
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Ring
import Definitions.Def_NarrowDNF_BourgainComponents
import Definitions.Def_NarrowDNF_Fourier
import Definitions.Def_NarrowDNF_Influence
import Definitions.Def_NarrowDNF_ProductMeasure
import Theorems.Thm_NarrowDNF_BourgainComponents_truncated_mass_split

namespace NarrowDNF.BourgainComponents
end NarrowDNF.BourgainComponents

namespace NarrowDNF.FiberShift
end NarrowDNF.FiberShift

namespace NarrowDNF.Fourier
end NarrowDNF.Fourier

namespace NarrowDNF.Influence
end NarrowDNF.Influence

namespace NarrowDNF.ProductMeasure
end NarrowDNF.ProductMeasure
noncomputable section
open scoped BigOperators
open NarrowDNF
open NarrowDNF.BourgainComponents
variable {ι : Type*} [Fintype ι] [DecidableEq ι]
Formal statement
theorem NarrowDNF.BourgainComponents.pointwise_bourgain_split (F : Finset (Finset ι)) (c : Finset ι → ℝ)
    (k M : ℕ) (hF : ∀ S ∈ F, S.card ≤ k) (η τ : ℝ) :
    truncatedMass F c η ≤ (M : ℝ)^k * η^2 +
      (∑ i, if coordinateSquare F c i ≤ τ^2 then coordinateSquare F c i else 0) +
      (if M ≤ (largeCoordinates F c τ).card then ∑ S ∈ F, c S^2 else 0) := by sorry
Source
https://github.com/liuchliuch/narrow-dnf-lean/blob/eecadd6a5ea0a331d6cf9fd5cb39fc6ec854b372/NarrowDNF/BourgainComponents.lean#L169-L209

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