Polynomial bound for the number of small subsets
ProvedNarrowDNF.BourgainComponents.card_small_subsets_lecombinatoricsnarrow-dnf-authors-importprobabilitystoc-2027
Let be a finite subset of a coordinate set , and let . The number of subsets of containing at most elements satisfies
The bound includes the empty subset and holds when is empty or . It provides a simple polynomial estimate, in the size of the available coordinate set, for the number of possible component supports of bounded degree.
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_Fourier
import Definitions.Def_NarrowDNF_Influence
import Definitions.Def_NarrowDNF_ProductMeasure
import Theorems.Thm_NarrowDNF_BourgainComponents_sum_powers_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 ι]
omit [Fintype ι]
Formal statement
theorem NarrowDNF.BourgainComponents.card_small_subsets_le (A : Finset ι) (k : ℕ) :
(A.powerset.filter fun S => S.card ≤ k).card ≤ (A.card+1)^k := by sorrySource