Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Activation load under Bernoulli forcing

Proved
NarrowDNF.Activation.load_forcing_le

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

combinatoricsnarrow-dnf-authors-importprobabilitystoc-2027

Let ι\iotaι be a finite coordinate set and JJJ an activation family: each event JSJ_SJS​ depends only on bits in its finite indexing set S⊆ιS\subseteq\iotaS⊆ι. For q∈[0,1]q\in[0,1]q∈[0,1], define its load by ℓq(J)=∑S⊆ι∣S∣Pr⁡q[JS]\ell_q(J)=\sum_{S\subseteq\iota}|S|\Pr_q[J_S]ℓq​(J)=∑S⊆ι​∣S∣Prq​[JS​], where Pr⁡q\Pr_qPrq​ is independent Bernoulli measure. Suppose d∈Nd\in\mathbb Nd∈N and no set larger than ddd ever fires. Then, for every p∈[0,1]p\in[0,1]p∈[0,1],

ℓ2p−p2(J)≤(2−p)dℓp(J).\ell_{2p-p^2}(J)\le(2-p)^d\ell_p(J).ℓ2p−p2​(J)≤(2−p)dℓp​(J).

The new bias is the probability that at least one of two independent Bernoulli ppp 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 sorry
Source
https://github.com/liuchliuch/narrow-dnf-lean/blob/eecadd6a5ea0a331d6cf9fd5cb39fc6ec854b372/NarrowDNF/LoadTransport.lean#L112-L131

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