A polynomial bound for a finite geometric sum
ProvedNarrowDNF.BourgainComponents.sum_powers_lecombinatoricsnarrow-dnf-authors-importprobabilitystoc-2027
For arbitrary nonnegative integers and , the finite geometric sum obeys
Powers have their usual natural-number meaning, including . Consequently the result covers and . This estimate supplies the elementary numerical step in bounding the number of subsets of size at most by a single explicit polynomial bound in the size of the underlying set.
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
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 ι] [DecidableEq ι]
Formal statement
theorem NarrowDNF.BourgainComponents.sum_powers_le (n k : ℕ) : (∑ j ∈ Finset.range (k+1), n^j) ≤ (n+1)^k := by sorry
Source