Positive active labels form an acceptance certificate
ProvedNarrowDNF.Activation.positive_certificatecombinatoricsnarrow-dnf-authors-importprobabilitystoc-2027
Let be a coordinate set and a family of local activation tests indexed by finite subsets of . Assume each test is increasing under the coordinatewise order. Write for the union of sets whose tests fire at input . Let be monotone and constant on adaptive atoms, where an atom records the active union and its input labels. If , then every input preserving the positive active labels is accepted:
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 sorrySource