Activation load under Bernoulli forcing
ProvedNarrowDNF.Activation.load_forcing_lecombinatoricsnarrow-dnf-authors-importprobabilitystoc-2027
Let be a finite coordinate set and an activation family: each event depends only on bits in its finite indexing set . For , define its load by , where is independent Bernoulli measure. Suppose and no set larger than ever fires. Then, for every ,
The new bias is the probability that at least one of two independent Bernoulli bits is one. The estimate controls the load increase caused by this forcing distribution, including both endpoint biases.
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_ActivationLoad
import Definitions.Def_NarrowDNF_Adaptive
import Definitions.Def_NarrowDNF_Certificates
import Definitions.Def_NarrowDNF_CoordinateShift
import Definitions.Def_NarrowDNF_LoadTransport
import Definitions.Def_NarrowDNF_ProductMeasure
import Theorems.Thm_NarrowDNF_ProductMeasure_expectation_restrict
import Theorems.Thm_NarrowDNF_ProductMeasure_weight_forcing_le
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
variable {ι : Type*} [Fintype ι] [DecidableEq ι]
open NarrowDNF
open NarrowDNF.Activation
open ProductMeasure
attribute [local instance] Classical.propDecidable
Formal statement
theorem NarrowDNF.Activation.load_forcing_le (J : Activation ι) {p : ℝ}
(hp0 : 0 ≤ p) (hp1 : p ≤ 1) {d : ℕ} (hd : J.ArityLE d) :
J.load (2*p-p^2) ≤ (2-p)^d * J.load p := by sorrySource