AFTD Auto-Formalizing Theoretical Domains

skew_zero_forcing_closure

def

The skew zero forcing closure scl(S) of a subset S of vertices in a graph with neighborhood function N is the set of all vertices forced by S under the skew color change rule.

Statement

def skew_zero_forcing_closure {V : Type*} (N : V → Set V) (S : Set V) : Set V
Defined in
arXiv:2611.15741 Section 1 and Section 2
Verified
14 Nov 2026
Axioms
none listed
Built on 1
  • SkewZeroForcedThe 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…
Used by 6

Read back from the Lean

Given a type V, a neighborhood map N : V → Set V, and an initial set S : Set V, skew_zero_forcing_closure N S is defined as the set of all vertices v : V satisfying SkewZeroForced N S v.

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

/-- The skew zero forcing closure of a vertex subset. -/
def skew_zero_forcing_closure {V : Type*} (N : V → Set V) (S : Set V) : Set V := {v | SkewZeroForced N S v}
See it in the graphDiscuss this resultChallenge it