Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Assembling residual errors with a covering set of ranks

Proved
NarrowDNF.HatamiCrossTerms.residual_le_rank_factor

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

combinatoricsnarrow-dnf-authors-importprobabilitystoc-2027

On a finite cube, let 0≤p≤10\le p\le10≤p≤1, JJJ be a local activation family, fff real valued, and A\mathcal AA a finite family of supports. Let R⊆N\mathcal R\subseteq\mathbb NR⊆N contain ∣S∣|S|∣S∣ for every S∈AS\in\mathcal AS∈A. Write FSF_SFS​ for Fourier components, F~S\widetilde F_SFS​ for their restricted-activation conditional approximations, and C=∑S≠Rmax⁡(0,Ep[F~SF~R])\mathcal C=\sum_{S\ne R}\max(0,E_p[\widetilde F_S\widetilde F_R])C=∑S=R​max(0,Ep​[FS​FR​]), summing over A\mathcal AA. Then

Ep[(∑S∈A(FS−F~S))2]≤∣R∣(∑S∈AEp[(FS−F~S)2]+C).E_p\left[\left(\sum_{S\in\mathcal A}(F_S-\widetilde F_S)\right)^2\right]\le|\mathcal R|\left(\sum_{S\in\mathcal A}E_p[(F_S-\widetilde F_S)^2]+\mathcal C\right).Ep​​(S∈A∑​(FS​−FS​))2​≤∣R∣(S∈A∑​Ep​[(FS​−FS​)2]+C).
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_HatamiActivation
import Definitions.Def_NarrowDNF_HatamiCrossTerms
import Definitions.Def_NarrowDNF_HatamiResidual
import Definitions.Def_NarrowDNF_Influence
import Definitions.Def_NarrowDNF_LoadTransport
import Definitions.Def_NarrowDNF_ProductMeasure
import Theorems.Thm_NarrowDNF_HatamiCrossTerms_rank_group_residual_le
import Theorems.Thm_NarrowDNF_RankGrouping_weighted_squared_sum_le_rank_groups

namespace NarrowDNF
end NarrowDNF

namespace NarrowDNF.Activation
end NarrowDNF.Activation

namespace NarrowDNF.FiberShift
end NarrowDNF.FiberShift

namespace NarrowDNF.Fourier
end NarrowDNF.Fourier

namespace NarrowDNF.HatamiActivation
end NarrowDNF.HatamiActivation

namespace NarrowDNF.HatamiCrossTerms
end NarrowDNF.HatamiCrossTerms

namespace NarrowDNF.HatamiResidual
end NarrowDNF.HatamiResidual

namespace NarrowDNF.Influence
end NarrowDNF.Influence

namespace NarrowDNF.ProductMeasure
end NarrowDNF.ProductMeasure

namespace NarrowDNF.RankGrouping
end NarrowDNF.RankGrouping
noncomputable section
open scoped BigOperators
open NarrowDNF
open NarrowDNF.HatamiCrossTerms
open ProductMeasure HatamiResidual HatamiActivation
attribute [local instance] Classical.propDecidable
variable {ι : Type*} [Fintype ι] [DecidableEq ι]
Formal statement
theorem NarrowDNF.HatamiCrossTerms.residual_le_rank_factor {p : ℝ} (hp0 : 0 ≤ p) (hp1 : p ≤ 1)
    (J : Activation ι) (f : Cube ι → ℝ) (A : Finset (Finset ι))
    (ranks : Finset ℕ) (hcover : ∀ S ∈ A, S.card ∈ ranks) :
    ConditionalExpectation.squaredError (weight p) (truncated p f A) (approxTruncated p J f A) ≤
      (ranks.card : ℝ) * ((∑ S ∈ A, ConditionalExpectation.squaredError (weight p)
        (Fourier.component p f S) (approxComponent p J f S)) + crossEnvelope p J f A) := by sorry
Source
https://github.com/liuchliuch/narrow-dnf-lean/blob/eecadd6a5ea0a331d6cf9fd5cb39fc6ec854b372/NarrowDNF/HatamiCrossTerms.lean#L398-L423

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