A dimension-free fourth-moment estimate for the low-degree square function
ProvedNarrowDNF.BourgainSquareFunction.squareFunction_fourthcombinatoricsnarrow-dnf-authors-importprobabilitystoc-2027
Let be finite, , , and an integer. For Bernoulli product measure , let and denote its orthonormal Fourier coefficients and characters. Define the squared low-degree square function by
Then
Equivalently, the fourth moment of is bounded independently of both the dimension and the bias.
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_BourgainNoise
import Definitions.Def_NarrowDNF_BourgainSquareFunction
import Definitions.Def_NarrowDNF_Fourier
import Definitions.Def_NarrowDNF_Influence
import Definitions.Def_NarrowDNF_ProductMeasure
import Theorems.Thm_NarrowDNF_BourgainNoise_finite_negative_fourth_contraction
import Theorems.Thm_NarrowDNF_BourgainNoise_finite_positive_fourth_contraction
import Theorems.Thm_NarrowDNF_BourgainSquareFunction_low_degree_le_damped
import Theorems.Thm_NarrowDNF_Fourier_expansion
import Theorems.Thm_NarrowDNF_Fourier_inner_parseval
import Theorems.Thm_NarrowDNF_ProductMeasure_expectation_split
namespace NarrowDNF.BourgainNoise
end NarrowDNF.BourgainNoise
namespace NarrowDNF.BourgainSquareFunction
end NarrowDNF.BourgainSquareFunction
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.BourgainSquareFunction
variable {ι : Type*} [Fintype ι] [DecidableEq ι]
Formal statement
theorem NarrowDNF.BourgainSquareFunction.squareFunction_fourth {p : ℝ} (hp0 : 0 < p) (hp1 : p < 1)
(f : (ι → Bool) → ℝ) (k : ℕ) :
ProductMeasure.expectation p (fun x => squareFunction p f k x ^ 2) ≤
(3 : ℝ)^(4*k) * ProductMeasure.expectation p (fun x => f x ^ 4) := by sorrySource