Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Multiplicity-counted load and arity of a local activation family

Definition
NarrowDNF_ActivationLoad

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

combinatoricsnarrow-dnf-authors-importprobabilitystoc-2027

Let III be a finite coordinate set, JJJ a local activation family on {0,1}I\{0,1\}^I{0,1}I, and μp\mu_pμp​ the Bernoulli product law. For each S⊆IS\subseteq IS⊆I, the event JS(x)J_S(x)JS​(x) is the activation test indexed by SSS. The load is

Λp(J)=∑S⊆I∣S∣ μp{x:JS(x)}.\Lambda_p(J)=\sum_{S\subseteq I}|S|\,\mu_p\{x:J_S(x)\}.Λp​(J)=S⊆I∑​∣S∣μp​{x:JS​(x)}.

It counts activated coordinate sets with multiplicity: a coordinate lying in several firing sets contributes once for each such set. It is therefore distinct from the expected cardinality of the union of activated coordinates.

For a natural number ddd, the predicate ArityLE⁡(J,d)\operatorname{ArityLE}(J,d)ArityLE(J,d) says that no activation indexed by a set of cardinality greater than ddd ever fires: ∣S∣>d|S|>d∣S∣>d implies ¬JS(x)\neg J_S(x)¬JS​(x) for every input xxx. These two quantities express the separate load and local-set-size controls used in Hatami's construction and in the monotonicization argument. No approximation or load bound is assumed by either definition.

Definition code
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.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.Ring
import Definitions.Def_NarrowDNF_Adaptive
import Definitions.Def_NarrowDNF_ProductMeasure

namespace NarrowDNF
end NarrowDNF

namespace NarrowDNF.Activation
end NarrowDNF.Activation


namespace NarrowDNF
namespace Activation
open scoped BigOperators
attribute [local instance] Classical.propDecidable
variable {ι : Type*} [Fintype ι] [DecidableEq ι]

noncomputable def load (J : Activation ι) (p : ℝ) : ℝ := by
  classical exact ∑ S : Finset ι, (S.card : ℝ) * ProductMeasure.probability p (J.fires S)

def ArityLE (J : Activation ι) (d : ℕ) : Prop :=
  ∀ S, d < S.card → ∀ x, ¬ J.fires S x







end Activation
end NarrowDNF
Source
https://github.com/liuchliuch/narrow-dnf-lean/blob/eecadd6a5ea0a331d6cf9fd5cb39fc6ec854b372/NarrowDNF/ActivationLoad.lean#L11-L12 https://github.com/liuchliuch/narrow-dnf-lean/blob/eecadd6a5ea0a331d6cf9fd5cb39fc6ec854b372/NarrowDNF/ActivationLoad.lean#L14-L15

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