AFTD Auto-Formalizing Theoretical Domains

SzfMultiForced

inductive

Skew zero forcing on a multigraph with adjacency multiplicities μ (μ u v = number of edges between u and v, μ u u = number of loops at u): a vertex is forced from the initial filled set S if it lies in S, or if for some vertex u (filled or not) it is the only unfilled neighbour of u counted with multiplicity, i.e. μ u w = 1 and every other neighbour x of u (μ u x ≠ 0, x ≠ w) is already forced.

Statement

inductive SzfMultiForced {V : Type*} (μ : V → V → ℕ) (S : Set V) : V → Prop
Defined in
arXiv:2611.15741 Section 1 (skew colour change rule on multigraphs, adjacency counted with multiplicity)
Verified
15 Nov 2026
Axioms
none listed
Used by 6

Read back from the Lean

An inductive predicate SzfMultiForced {V : Type*} (μ : V → V → ℕ) (S : Set V) : V → Prop, defining the set of forced vertices on a type V with edge multiplicities μ and initial set S, inductively generated by: 1. init: For every vertex v : V, if v ∈ S, then SzfMultiForced μ S v. 2. step: For any vertices u, w : V, if μ u w = 1 and for all x : V such that x ≠ w and μ u x ≠ 0 we have SzfMultiForced μ S x, then SzfMultiForced μ S w. (Note that the forcing vertex u is not required to belong to SzfMultiForced μ S unless u ≠ w and μ u u ≠ 0.)

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

/-- Skew zero forcing on a multigraph given by adjacency multiplicities `μ` (loops: `μ u u`). -/
inductive SzfMultiForced {V : Type*} (μ : V → V → ℕ) (S : Set V) : V → Prop where
  | init (v : V) : v ∈ S → SzfMultiForced μ S v
  | step (u w : V) :
      μ u w = 1 →
      (∀ x, x ≠ w → μ u x ≠ 0 → SzfMultiForced μ S x) →
      SzfMultiForced μ S w
See it in the graphDiscuss this resultChallenge it