Low-degree energy is controlled by geometrically damped energy
ProvedNarrowDNF.BourgainSquareFunction.low_degree_le_dampedcombinatoricsnarrow-dnf-authors-importprobabilitystoc-2027
Let be a finite coordinate set and let be an arbitrary array indexed by subsets . For any nonnegative integers ,
Subset indices correspond exactly to the Boolean support masks used in the formal statement, and their degree is . The inequality converts a low-degree truncation into a full spectral sum with geometric damping. It requires no probability measure or assumption that the array consists of Fourier coefficients.
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.MeanInequalities
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.Option
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.NormNum.RealSqrt
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Ring
import Definitions.Def_NarrowDNF_Fourier
namespace NarrowDNF.BourgainSquareFunction
end NarrowDNF.BourgainSquareFunction
noncomputable section
open scoped BigOperators
open NarrowDNF
open NarrowDNF.BourgainSquareFunction
variable {ι : Type*} [Fintype ι] [DecidableEq ι]
Formal statement
theorem NarrowDNF.BourgainSquareFunction.low_degree_le_damped (a : (ι → Bool) → ℝ) (k m : ℕ) :
(∑ s ∈ (Finset.univ.filter fun s => Fourier.degree s ≤ k), a s^2) ≤
(3 : ℝ)^(m*k) * ∑ s, a s^2 / (3 : ℝ)^(m * Fourier.degree s) := by sorrySource