A point-mass bound for the effective forcing bias
ProvedNarrowDNF.ProductMeasure.weight_forcing_lecombinatoricsnarrow-dnf-authors-importprobabilitystoc-2027
Let be finite, , and . If , then
The estimate uses multiplication rather than division by , so it remains valid at and . Applied on an activation's coordinate set, the exponent counts that activation's arity rather than the ambient dimension.
Preamble
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.BigOperators.Ring.Finset
import Mathlib.Algebra.Order.BigOperators.Ring.Finset
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.Linarith
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Ring
import Definitions.Def_NarrowDNF_Adaptive
import Definitions.Def_NarrowDNF_Certificates
import Definitions.Def_NarrowDNF_CoordinateShift
import Definitions.Def_NarrowDNF_ProductMeasure
namespace NarrowDNF
end NarrowDNF
namespace NarrowDNF.Activation
end NarrowDNF.Activation
namespace NarrowDNF.FiberShift
end NarrowDNF.FiberShift
namespace NarrowDNF.ProductMeasure
end NarrowDNF.ProductMeasure
noncomputable section
open scoped BigOperators
open NarrowDNF
open NarrowDNF.ProductMeasure
variable {ι : Type*} [Fintype ι] [DecidableEq ι]
omit [DecidableEq ι]
Formal statement
theorem NarrowDNF.ProductMeasure.weight_forcing_le {p : ℝ} (hp0 : 0 ≤ p) (hp1 : p ≤ 1) (x : ι → Bool) :
weight (2 * p - p ^ 2) x ≤ (2 - p) ^ Fintype.card ι * weight p x := by sorrySource