AFTD Auto-Formalizing Theoretical Domains

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

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}
See it in the graphDiscuss this resultChallenge it