SkewZeroForced
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
- szf_circuit_flat_has_vertex_neighborhoodLet M be a matroid on a finite ground set V with M.E = Set.univ. If M is SZF-realized by a graph with symmetric neighborhood function N (u…
- matroid_realization_via_circuit_neighborhoods_szfLet V be a finite type ([Finite V]), let N : V → Set V be a symmetric neighborhood function satisfying u ∈ N v ↔ v ∈ N u for all u, v : V,…
- szf_multigraph_closure_indicatorOn a graph without parallel edges (multiplicities 0 or 1, given by neighbourhood sets N), the multigraph skew zero forcing closure…
- skew_zero_forcing_closureThe 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…
- skew_zero_forcing_closure_subset_matroid_closureLet V be a finite type ([Finite V]), let N : V → Set V be a symmetric neighborhood function satisfying u ∈ N v ↔ v ∈ N u for all u, v : V,…
- matroid_closure_subset_skew_zero_forcing_closureLet V be a finite type ([Finite V]), let N : V → Set V be a symmetric neighborhood function satisfying u ∈ N v ↔ v ∈ N u for all u, v : V,…
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