Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The significant-component truncation error splits into high degree and small components

Proved
NarrowDNF.FourierTruncation.significant_remainder_le

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

combinatoricsnarrow-dnf-authors-importprobabilitystoc-2027

Let III be finite, 0<p<10<p<10<p<1, f:{0,1}I→Rf:\{0,1\}^I\to\mathbb Rf:{0,1}I→R, and k,η∈Rk,\eta\in\mathbb Rk,η∈R. Write fS(x)=f^p(S)χSp(x)f_S(x)=\widehat f_p(S)\chi_S^p(x)fS​(x)=f​p​(S)χSp​(x), and retain

R={S:∣S∣≤k, ∃x  ∣fS(x)∣>η}.\mathcal R=\{S:|S|\le k,\ \exists x\;|f_S(x)|>\eta\}.R={S:∣S∣≤k, ∃x∣fS​(x)∣>η}.

Define the small-component energy by

B=∑SEp[1{∣S∣≤k, ∣fS(X)∣≤η}fS(X)2].B=\sum_S\mathbb E_p[\mathbf1_{\{|S|\le k,\ |f_S(X)|\le\eta\}}f_S(X)^2].B=S∑​Ep​[1{∣S∣≤k, ∣fS​(X)∣≤η}​fS​(X)2].

Then

Ep ⁣[(f−∑S∈RfS)2]≤∑∣S∣>kf^p(S)2+B.\mathbb E_p\!\left[\left(f-\sum_{S\in\mathcal R}f_S\right)^2\right]\le\sum_{|S|>k}\widehat f_p(S)^2+B.Ep​​(f−S∈R∑​fS​)2​≤∣S∣>k∑​f​p​(S)2+B.

The cutoffs may be arbitrary real numbers. This separates two error sources before inserting any quantitative high-degree or Bourgain estimate.

Preamble
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_Certificates
import Definitions.Def_NarrowDNF_ConditionalExpectation
import Definitions.Def_NarrowDNF_CoordinateShift
import Definitions.Def_NarrowDNF_Fourier
import Definitions.Def_NarrowDNF_FourierTruncation
import Definitions.Def_NarrowDNF_HatamiActivation
import Definitions.Def_NarrowDNF_Influence
import Definitions.Def_NarrowDNF_LoadTransport
import Definitions.Def_NarrowDNF_ProductMeasure
import Theorems.Thm_NarrowDNF_Fourier_inner_parseval

namespace NarrowDNF
end NarrowDNF

namespace NarrowDNF.Activation
end NarrowDNF.Activation

namespace NarrowDNF.FiberShift
end NarrowDNF.FiberShift

namespace NarrowDNF.Fourier
end NarrowDNF.Fourier

namespace NarrowDNF.FourierTruncation
end NarrowDNF.FourierTruncation

namespace NarrowDNF.HatamiActivation
end NarrowDNF.HatamiActivation

namespace NarrowDNF.Influence
end NarrowDNF.Influence

namespace NarrowDNF.ProductMeasure
end NarrowDNF.ProductMeasure
noncomputable section
open NarrowDNF
open NarrowDNF.FourierTruncation
open ProductMeasure Fourier
open scoped BigOperators
variable {ι : Type*} [Fintype ι] [DecidableEq ι]
Formal statement
theorem NarrowDNF.FourierTruncation.significant_remainder_le {p : ℝ} (hp0 : 0 < p) (hp1 : p < 1)
    (f : Cube ι → ℝ) (k η : ℝ) :
    ConditionalExpectation.squaredError (weight p) f
      (partialSum p f (HatamiActivation.significantSets p f k η)) ≤
      (∑ S : Finset ι, if k < (S.card : ℝ) then setCoefficient p f S ^ 2 else 0) +
        smallMassReal p f k η := by sorry
Source
https://github.com/liuchliuch/narrow-dnf-lean/blob/eecadd6a5ea0a331d6cf9fd5cb39fc6ec854b372/NarrowDNF/FourierTruncation.lean#L65-L96

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