Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Retained Fourier sums and pointwise small-component energy

Definition
NarrowDNF_FourierTruncation

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

combinatoricsnarrow-dnf-authors-importprobabilitystoc-2027

Let ι\iotaι be a finite coordinate set, let x∈{0,1}ιx\in\{0,1\}^{\iota}x∈{0,1}ι, and let FS(x)F_S(x)FS​(x) denote the SSS-indexed ppp-biased Fourier component of a real-valued function fff. For a finite family AAA of coordinate subsets, the retained Fourier polynomial is

PAf(x)=∑S∈AFS(x).P_A f(x)=\sum_{S\in A}F_S(x).PA​f(x)=S∈A∑​FS​(x).

For real cutoffs kkk and η\etaη, define the small-component energy by

SmallMass⁡k,η(f)=∑S⊆ιEp ⁣[1{∣S∣≤k, ∣FS(X)∣≤η}FS(X)2].\operatorname{SmallMass}_{k,\eta}(f)=\sum_{S\subseteq\iota}\mathbb E_p\!\left[\mathbf1_{\{|S|\le k,\ |F_S(X)|\le\eta\}}F_S(X)^2\right].SmallMassk,η​(f)=S⊆ι∑​Ep​[1{∣S∣≤k, ∣FS​(X)∣≤η}​FS​(X)2].

The degree comparison uses the real number kkk directly. The magnitude test is pointwise inside the expectation; it is not a condition on the supremum norm of an entire component. These explicit finite sums provide the objects used to separate retained Fourier mass from low-degree, small-amplitude mass in the approximation argument. Their probabilistic interpretation uses the Bernoulli product law; truncation estimates are separate theorem statements.

Definition code
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
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.Log.Basic
import Mathlib.Analysis.SpecialFunctions.Pow.Real
import Mathlib.Analysis.SpecialFunctions.Sqrt
import Mathlib.Data.Bool.Basic
import Mathlib.Data.Finset.Card
import Mathlib.Data.Finset.Image
import Mathlib.Data.Finset.Insert
import Mathlib.Data.Finset.Lattice.Fold
import Mathlib.Data.Fintype.BigOperators
import Mathlib.Data.Fintype.Pi
import Mathlib.Data.Real.Basic
import Mathlib.Logic.Equiv.Prod
import Mathlib.Order.Monotone.Basic
import Mathlib.Tactic
import Mathlib.Tactic.FieldSimp
import Mathlib.Tactic.GCongr
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Ring
import Definitions.Def_NarrowDNF_Adaptive
import Definitions.Def_NarrowDNF_Fourier
import Definitions.Def_NarrowDNF_ProductMeasure

namespace NarrowDNF.Fourier
end NarrowDNF.Fourier

namespace NarrowDNF.FourierTruncation
end NarrowDNF.FourierTruncation

namespace NarrowDNF.ProductMeasure
end NarrowDNF.ProductMeasure


noncomputable section
namespace NarrowDNF.FourierTruncation
open ProductMeasure Fourier
open scoped BigOperators
variable {ι : Type*} [Fintype ι] [DecidableEq ι]

def partialSum (p : ℝ) (f : Cube ι → ℝ) (retained : Finset (Finset ι)) (x : Cube ι) : ℝ :=
  ∑ S ∈ retained, component p f S x












/-- The small-component energy with the paper's real degree cutoff. -/
def smallMassReal (p : ℝ) (f : Cube ι → ℝ) (k η : ℝ) : ℝ :=
  ∑ S : Finset ι, expectation p (fun x =>
    if (S.card : ℝ) ≤ k ∧ |component p f S x| ≤ η then component p f S x ^ 2 else 0)



end NarrowDNF.FourierTruncation
Source
https://github.com/liuchliuch/narrow-dnf-lean/blob/eecadd6a5ea0a331d6cf9fd5cb39fc6ec854b372/NarrowDNF/FourierTruncation.lean#L60-L63 https://github.com/liuchliuch/narrow-dnf-lean/blob/eecadd6a5ea0a331d6cf9fd5cb39fc6ec854b372/NarrowDNF/FourierTruncation.lean#L11-L12

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