Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Low-degree energy is controlled by geometrically damped energy

Proved
NarrowDNF.BourgainSquareFunction.low_degree_le_damped

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

combinatoricsnarrow-dnf-authors-importprobabilitystoc-2027

Let III be a finite coordinate set and let aS∈Ra_S\in\mathbb RaS​∈R be an arbitrary array indexed by subsets S⊆IS\subseteq IS⊆I. For any nonnegative integers k,mk,mk,m,

∑∣S∣≤kaS2≤3mk∑S⊆IaS23m∣S∣.\sum_{|S|\le k}a_S^2\le3^{mk}\sum_{S\subseteq I}\frac{a_S^2}{3^{m|S|}}.∣S∣≤k∑​aS2​≤3mkS⊆I∑​3m∣S∣aS2​​.

Subset indices correspond exactly to the Boolean support masks used in the formal statement, and their degree is ∣S∣|S|∣S∣. 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 sorry
Source
https://github.com/liuchliuch/narrow-dnf-lean/blob/eecadd6a5ea0a331d6cf9fd5cb39fc6ec854b372/NarrowDNF/BourgainSquareFunction.lean#L112-L130

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