Residual Gram estimate within one cardinality rank
ProvedNarrowDNF.HatamiCrossTerms.rank_group_residual_lecombinatoricsnarrow-dnf-authors-importprobabilitystoc-2027
Let , be a local activation family on finite , real valued, a finite support family, and . Write for the biased Fourier component, for its conditional approximation using , , and for , with . Then
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_HatamiResidual
import Definitions.Def_NarrowDNF_Influence
import Definitions.Def_NarrowDNF_LoadTransport
import Definitions.Def_NarrowDNF_ProductMeasure
import Definitions.Def_NarrowDNF_ResidualGram
import Theorems.Thm_NarrowDNF_Activation_sameAtom_of_active_subset_of_agree
import Theorems.Thm_NarrowDNF_ConditionalExpectation_adaptiveCode_eq_iff
import Theorems.Thm_NarrowDNF_HatamiResidual_coordinateMean_eq_of_local
import Theorems.Thm_NarrowDNF_ProductMeasure_expectation_split
import Theorems.Thm_NarrowDNF_ResidualGram_residual_square_sum
namespace NarrowDNF
end NarrowDNF
namespace NarrowDNF.Activation
end NarrowDNF.Activation
namespace NarrowDNF.ConditionalExpectation
end NarrowDNF.ConditionalExpectation
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
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.rank_group_residual_le (p : ℝ) (J : Activation ι) (f : Cube ι → ℝ)
(A : Finset (Finset ι)) (r : ℕ) :
expectation p (fun x => (∑ S ∈ A with S.card = r,
(Fourier.component p f S x - approxComponent p J f S x))^2) ≤
∑ S ∈ A with S.card = r,
(ConditionalExpectation.squaredError (weight p) (Fourier.component p f S) (approxComponent p J f S) +
∑ R ∈ A, if S = R then 0 else
max 0 (expectation p (fun x => approxComponent p J f S x * approxComponent p J f R x))) := by sorrySource