Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Positive active labels form an acceptance certificate

Proved
NarrowDNF.Activation.positive_certificate

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

combinatoricsnarrow-dnf-authors-importprobabilitystoc-2027

Let ι\iotaι be a coordinate set and JJJ a family of local activation tests indexed by finite subsets of ι\iotaι. Assume each test is increasing under the coordinatewise order. Write AJ(x)A_J(x)AJ​(x) for the union of sets whose tests fire at input xxx. Let u:{0,1}ι→{0,1}u:\{0,1\}^{\iota}\to\{0,1\}u:{0,1}ι→{0,1} be monotone and constant on adaptive atoms, where an atom records the active union and its input labels. If u(x)=1u(x)=1u(x)=1, then every input yyy preserving the positive active labels is accepted:

(∀i∈AJ(x), xi=1⇒yi=1)⟹u(y)=1.\bigl(\forall i\in A_J(x),\ x_i=1\Rightarrow y_i=1\bigr)\quad\Longrightarrow\quad u(y)=1.(∀i∈AJ​(x), xi​=1⇒yi​=1)⟹u(y)=1.

Thus the positive labels in the active union constitute a certificate for acceptance.

Preamble
import Mathlib.Data.Bool.Basic
import Mathlib.Data.Finset.Lattice.Fold
import Mathlib.Data.Fintype.Pi
import Mathlib.Order.Monotone.Basic
import Definitions.Def_NarrowDNF_Adaptive

namespace NarrowDNF
end NarrowDNF

namespace NarrowDNF.Activation
end NarrowDNF.Activation
open NarrowDNF
open NarrowDNF
open NarrowDNF.Activation
variable {ι : Type*} [DecidableEq ι]
omit [DecidableEq ι]
Formal statement
theorem NarrowDNF.Activation.positive_certificate {J : Activation ι} (hJ : J.Increasing)
    {u : Cube ι → Bool} (hu : Monotone u) (hm : J.Measurable u)
    {x : Cube ι} (hx : u x = true) {y : Cube ι}
    (hy : ∀ i ∈ J.active x, x i = true → y i = true) : u y = true := by sorry
Source
https://github.com/liuchliuch/narrow-dnf-lean/blob/eecadd6a5ea0a331d6cf9fd5cb39fc6ec854b372/NarrowDNF/Adaptive.lean#L70-L92

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