Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Splitting truncated mass by covered and uncovered coordinates

Proved
NarrowDNF.BourgainComponents.truncated_mass_split

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

combinatoricsnarrow-dnf-authors-importprobabilitystoc-2027

Let ι\iotaι be finite, let FFF be a finite family of coordinate subsets, and assign a real value cSc_ScS​ to every finite subset SSS. Let A⊆ιA\subseteq\iotaA⊆ι, k∈Nk\in\mathbb Nk∈N, and η∈R\eta\in\mathbb Rη∈R, with ∣S∣≤k|S|\le k∣S∣≤k for every S∈FS\in FS∈F. Write Qi=∑S∈F:i∈ScS2Q_i=\sum_{S\in F:i\in S}c_S^2Qi​=∑S∈F:i∈S​cS2​. Then

∑S∈FcS21∣cS∣≤η≤(∣A∣+1)kη2+∑i∉AQi.\sum_{S\in F}c_S^2\mathbf1_{|c_S|\le\eta}\le(|A|+1)^k\eta^2+\sum_{i\notin A}Q_i.S∈F∑​cS2​1∣cS​∣≤η​≤(∣A∣+1)kη2+i∈/A∑​Qi​.

The estimate separates components supported within a selected coordinate set from those extending outside it, preparing the pointwise Bourgain decomposition.

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_contained_truncated_mass_le
import Theorems.Thm_NarrowDNF_BourgainComponents_uncovered_mass_le

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.truncated_mass_split (F : Finset (Finset ι)) (c : Finset ι → ℝ)
    (A : Finset ι) (k : ℕ) (hF : ∀ S ∈ F, S.card ≤ k) (η : ℝ) :
    truncatedMass F c η ≤ ((A.card+1 : ℕ) : ℝ)^k * η^2 +
      ∑ i, if i ∈ A then 0 else coordinateSquare F c i := by sorry
Source
https://github.com/liuchliuch/narrow-dnf-lean/blob/eecadd6a5ea0a331d6cf9fd5cb39fc6ec854b372/NarrowDNF/BourgainComponents.lean#L150-L167

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