AFTD Auto-Formalizing Theoretical Domains

SkewZeroForced

inductive

The skew zero forcing closure predicate on vertices V: a vertex is forced from an initial set S under neighborhood function N if it is in S or if it is the unique unfilled neighbor of some vertex u.

Statement

inductive SkewZeroForced {V : Type*} (N : V → Set V) (S : Set V) : V → Prop
Defined in
arXiv:2611.15741 Section 1 and Section 2
Verified
14 Nov 2026
Axioms
none listed
Used by 6

Read back from the Lean

SkewZeroForced is an inductively defined predicate family parameterized by a type V, a neighborhood function N : V → Set V, and an initial set S : Set V. An element v : V satisfies SkewZeroForced N S v if and only if it can be derived from the following two rules: 1. init: Any v : V such that v ∈ S satisfies SkewZeroForced N S v. 2. step: For any u : V and w : V, if w ∈ N u and for every x ∈ N u with x ≠ w, SkewZeroForced N S x holds, then SkewZeroForced N S w holds.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- Inductive definition of the skew zero forcing closure of an initial set under the skew color change rule. -/
inductive SkewZeroForced {V : Type*} (N : V → Set V) (S : Set V) : V → Prop where
  | init (v : V) : v ∈ S → SkewZeroForced N S v
  | step (u : V) (w : V) :
      w ∈ N u →
      (∀ x ∈ N u, x ≠ w → SkewZeroForced N S x) →
      SkewZeroForced N S w
See it in the graphDiscuss this resultChallenge it