Paper-parameter squared error after Fourier pruning
ProvedNarrowDNF.HatamiInput.paper_truncation_error_lecombinatoricsnarrow-dnf-authors-importprobabilitystoc-2027
Let be finite, , , and Boolean satisfy total resampling influence for an integer . Set , , , and retain , where are the Fourier components of the encoding of . Then
This combines the high-degree and small-component pruning losses at the source parameters.
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.Algebra.Order.Floor.Ring
import Mathlib.Analysis.MeanInequalities
import Mathlib.Analysis.SpecialFunctions.Exp
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.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.Data.Real.Sqrt
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.NormNum
import Mathlib.Tactic.NormNum.RealSqrt
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_HatamiParameters
import Definitions.Def_NarrowDNF_HatamiResidual
import Definitions.Def_NarrowDNF_Influence
import Definitions.Def_NarrowDNF_LoadTransport
import Definitions.Def_NarrowDNF_ProductMeasure
import Theorems.Thm_NarrowDNF_BourgainEstimate_paper_smallComponentMass_bound
import Theorems.Thm_NarrowDNF_FourierTruncation_significant_remainder_le
import Theorems.Thm_NarrowDNF_HatamiInput_highDegreeReal_mass_le
namespace NarrowDNF
end NarrowDNF
namespace NarrowDNF.Activation
end NarrowDNF.Activation
namespace NarrowDNF.BourgainEstimate
end NarrowDNF.BourgainEstimate
namespace NarrowDNF.FiberShift
end NarrowDNF.FiberShift
namespace NarrowDNF.Fourier
end NarrowDNF.Fourier
namespace NarrowDNF.HatamiActivation
end NarrowDNF.HatamiActivation
namespace NarrowDNF.HatamiInput
end NarrowDNF.HatamiInput
namespace NarrowDNF.Influence
end NarrowDNF.Influence
namespace NarrowDNF.ProductMeasure
end NarrowDNF.ProductMeasure
noncomputable section
open scoped BigOperators
open NarrowDNF
open NarrowDNF.HatamiInput
variable {ι : Type*} [Fintype ι] [DecidableEq ι]
Formal statement
theorem NarrowDNF.HatamiInput.paper_truncation_error_le {p a : ℝ} (hp0 : 0 < p) (hp1 : p < 1)
(ha : 0 < a) (ha1 : a ≤ 1) (f : Cube ι → Bool) (C : ℕ)
(hC : 1 ≤ C) (hI : Influence.totalInfluence p f ≤ C) :
ConditionalExpectation.squaredError (ProductMeasure.weight p)
(fun x => Influence.boolValue (f x))
(HatamiResidual.truncated p (fun x => Influence.boolValue (f x))
(HatamiActivation.significantSets p (fun x => Influence.boolValue (f x))
(1000*(C : ℝ)/a) (HatamiParameters.epsilonOne (1000*(C : ℝ)/a) (a/1000)))) ≤
2*(a/1000) := by sorrySource