AFTD Auto-Formalizing Theoretical Domains

is_zero_forcing_set

def

A set of vertices S is a zero forcing set of G if its zero forcing closure contains all vertices of G.

Statement

def is_zero_forcing_set {V : Type*} (G : SimpleGraph V) (S : Set V) : Prop
Defined in
arXiv:2611.11352 Section 1
Verified
10 Nov 2026
Axioms
none listed
Built on 1
  • ZeroForcedThe zero forcing closure of an initial set S of blue vertices in G under the color change rule.
Used by 30

Read back from the Lean

For a type V, a simple graph G on V, and a subset S : Set V, is_zero_forcing_set G S asserts that every vertex v : V satisfies ZeroForced G 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

/-- A zero forcing set is one whose closure is the entire vertex set. -/
def is_zero_forcing_set {V : Type*} (G : SimpleGraph V) (S : Set V) : Prop := ∀ v, ZeroForced G S v
See it in the graphDiscuss this resultChallenge it