szf_multigraph_closure
def
The skew zero forcing closure scl(S) of a vertex set S in the multigraph with adjacency multiplicities μ: the set of vertices forced from S under the multigraph skew colour change rule.
Statement
def szf_multigraph_closure {V : Type*} (μ : V → V → ℕ) (S : Set V) : Set V
- Defined in
- arXiv:2611.15741 Section 1 (SZF closure scl_G(S))
- Verified
- 15 Nov 2026
- Axioms
- none listed
- Built on 1
- SzfMultiForcedSkew zero forcing on a multigraph with adjacency multiplicities μ (μ u v = number of edges between u and v, μ u u = number of loops at u):…
- Used by 6
- not_complete_graphic_matroid_szf_realizable_of_six_leFor n ≥ 6 the cycle matroid M(K_n) is not SZF-realizable by any multigraph on E(K_n).
- complete_graphic_matroid_szf_realizableThe cycle matroid M(K_n) is SZF-realizable: there is a multigraph on the ground set E(K_n) (symmetric adjacency multiplicities μ, loops…
- szf_multigraph_closure_single_loopA vertex with a single loop and no other edges forces itself from the empty filled set.
- szf_multigraph_closure_indicatorOn a graph without parallel edges (multiplicities 0 or 1, given by neighbourhood sets N), the multigraph skew zero forcing closure…
- complete_graphic_matroid_szf_realizable_of_le_fiveFor 1 ≤ n ≤ 5 the cycle matroid M(K_n) is SZF-realizable by some multigraph on E(K_n).
- szf_multigraph_closure_double_loopA vertex with a double loop and no other edges is not forced from the empty filled set.
Read back from the Lean
For any type V, edge-multiplicity function μ : V → V → ℕ, and subset S : Set V, szf_multigraph_closure μ S is defined as the set of all vertices v : V satisfying the inductive predicate SzfMultiForced μ 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 in a multigraph with multiplicities `μ`. -/ def szf_multigraph_closure {V : Type*} (μ : V → V → ℕ) (S : Set V) : Set V := {v | SzfMultiForced μ S v}