AFTD Auto-Formalizing Theoretical Domains

complete_graphic_matroid_szf_realizable

def

The cycle matroid M(K_n) is SZF-realizable: there is a multigraph on the ground set E(K_n) (symmetric adjacency multiplicities μ, loops allowed) whose skew zero forcing closure equals the closure of M(K_n) on every set of edges.

Statement

def complete_graphic_matroid_szf_realizable (n : ℕ) : Prop
Defined in
arXiv:2611.15741 Section 1 (SZF-realizable matroid), specialised to M(K_n)
Verified
15 Nov 2026
Axioms
none listed
Built on 2
  • szf_multigraph_closureThe skew zero forcing closure scl(S) of a vertex set S in the multigraph with adjacency multiplicities μ: the set of vertices forced from…
  • complete_graph_cycle_closureThe closure operator of the cycle matroid M(K_n), as a map on sets of edges of K_n. The ground set is the edge set of the complete graph…
Used by 3

Read back from the Lean

For a given natural number n, complete_graphic_matroid_szf_realizable n asserts that there exists a symmetric edge-multiplicity function μ : E(K_n) → E(K_n) → ℕ (where E(K_n) is the edge set of the complete graph on Fin n) such that for every edge subset S ⊆ E(K_n), the multigraph zero forcing closure szf_multigraph_closure μ S is equal to the cycle closure of S in K_n (complete_graph_cycle_closure n S).

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

/-- `M(K_n)` is SZF-realizable by some multigraph on its ground set. -/
def complete_graphic_matroid_szf_realizable (n : ℕ) : Prop :=
  ∃ μ : (⊤ : SimpleGraph (Fin n)).edgeSet → (⊤ : SimpleGraph (Fin n)).edgeSet → ℕ,
    (∀ u v, μ u v = μ v u) ∧
    ∀ S, szf_multigraph_closure μ S = complete_graph_cycle_closure n S
See it in the graphDiscuss this resultChallenge it