Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Forcing-coordinate sets and extension of local Boolean inputs

Definition
NarrowDNF_LoadTransport

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

combinatoricsnarrow-dnf-authors-importprobabilitystoc-2027

For a Boolean assignment d∈{0,1}ιd\in\{0,1\}^{\iota}d∈{0,1}ι on a finite coordinate set, define the forcing set

D(d)={i∈ι:di=1}.D(d)=\{i\in\iota:d_i=1\}.D(d)={i∈ι:di​=1}.

It translates a cube-valued random choice into the set of coordinates forced to one when evaluating a local activation family. If ddd is sampled from the Bernoulli product law, membership of distinct coordinates in D(d)D(d)D(d) is represented by the corresponding independent bits.

For a finite set S⊆ιS\subseteq\iotaS⊆ι and a local assignment z:S→{0,1}z:S\to\{0,1\}z:S→{0,1}, define its full-cube extension by

extend⁡S(z)i={zii∈S,0i∉S.\operatorname{extend}_S(z)_i=\begin{cases}z_i&i\in S,\\0&i\notin S.\end{cases}extendS​(z)i​={zi​0​i∈S,i∈/S.​

This makes a local activation evaluable using the global-input encoding. The activation's locality condition ensures that the choice of labels outside SSS carries no additional information. These two objects support the later point-mass and load-transport estimates under forcing, including the effective bias 2p−p22p-p^22p−p2; those estimates are separate theorem nodes.

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.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

namespace NarrowDNF
end NarrowDNF

namespace NarrowDNF.Activation
end NarrowDNF.Activation

namespace NarrowDNF.ProductMeasure
end NarrowDNF.ProductMeasure


/-!
# Load transport under random forcing

Point-mass and expectation bounds at effective bias `2*p-p^2`. Bounds are stated
without division by point masses, so they hold also for degenerate biases.
-/

noncomputable section
open scoped BigOperators

namespace NarrowDNF.ProductMeasure

variable {ι : Type*} [Fintype ι] [DecidableEq ι]











end NarrowDNF.ProductMeasure

namespace NarrowDNF

variable {ι : Type*} [Fintype ι] [DecidableEq ι]

def forcingCoordinates (d : Cube ι) : Finset ι :=
  Finset.univ.filter fun i => d i = true



namespace Activation

open ProductMeasure
attribute [local instance] Classical.propDecidable

/-- Extend a local input by zero; locality makes this particular extension
irrelevant to the activation's value. -/
def extendLocal (S : Finset ι) (z : S → Bool) : Cube ι :=
  fun i => if hi : i ∈ S then z ⟨i, hi⟩ else false

















end Activation
end NarrowDNF
Source
https://github.com/liuchliuch/narrow-dnf-lean/blob/eecadd6a5ea0a331d6cf9fd5cb39fc6ec854b372/NarrowDNF/LoadTransport.lean#L69-L70 https://github.com/liuchliuch/narrow-dnf-lean/blob/eecadd6a5ea0a331d6cf9fd5cb39fc6ec854b372/NarrowDNF/LoadTransport.lean#L82-L85

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