Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Probability bound for many large coordinate squares

Proved
NarrowDNF.BourgainIntegration.large_event_probability_le

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

combinatoricsnarrow-dnf-authors-importprobabilitystoc-2027

Let α\alphaα and ι\iotaι be finite, let w:α→Rw:\alpha\to\mathbb Rw:α→R have nonnegative values, and let FFF be a finite family of subsets of ι\iotaι. Assign real values cS(x)c_S(x)cS​(x) for x∈αx\in\alphax∈α and finite supports SSS. Define Qi(x)=∑S∈F:i∈ScS(x)2Q_i(x)=\sum_{S\in F:i\in S}c_S(x)^2Qi​(x)=∑S∈F:i∈S​cS​(x)2 and A(x)={i:Qi(x)>τ2}A(x)=\{i:Q_i(x)>\tau^2\}A(x)={i:Qi​(x)>τ2}. For every positive integer MMM and real τ>0\tau>0τ>0,

∑xwx1∣A(x)∣≥M≤∑xwx∑iQi(x)Mτ2.\sum_xw_x\mathbf1_{|A(x)|\ge M}\le\frac{\sum_xw_x\sum_iQ_i(x)}{M\tau^2}.x∑​wx​1∣A(x)∣≥M​≤Mτ2∑x​wx​∑i​Qi​(x)​.

Normalized weights interpret this as a probability estimate for having many large coordinate squares; arbitrary nonnegative weights also satisfy it.

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.Pow.Real
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.GCongr
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

namespace NarrowDNF.BourgainComponents
end NarrowDNF.BourgainComponents

namespace NarrowDNF.BourgainIntegration
end NarrowDNF.BourgainIntegration

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 NarrowDNF
open NarrowDNF.BourgainIntegration
open BourgainComponents
open scoped BigOperators
attribute [local instance] Classical.propDecidable
variable {α : Type*} [Fintype α]
variable {ι : Type*} [Fintype ι] [DecidableEq ι]
Formal statement
theorem NarrowDNF.BourgainIntegration.large_event_probability_le (w : α → ℝ) (hw : ∀ x, 0 ≤ w x)
    (F : Finset (Finset ι)) (c : α → Finset ι → ℝ) (M : ℕ) (hM : 0 < M)
    (τ : ℝ) (hτ : 0 < τ) :
    (∑ x, w x * (if M ≤ (largeCoordinates F (c x) τ).card then 1 else 0)) ≤
      (∑ x, w x * ∑ i, coordinateSquare F (c x) i) / ((M : ℝ)*τ^2) := by sorry
Source
https://github.com/liuchliuch/narrow-dnf-lean/blob/eecadd6a5ea0a331d6cf9fd5cb39fc6ec854b372/NarrowDNF/BourgainIntegration.lean#L59-L77

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