AFTD Auto-Formalizing Theoretical Domains

ZeroForced

inductive

The zero forcing closure of an initial set S of blue vertices in G under the color change rule.

Statement

inductive ZeroForced {V : Type*} (G : SimpleGraph V) (S : Set V) : V → Prop
Defined in
arXiv:2611.11352 Section 1
Verified
10 Nov 2026
Axioms
none listed
Used by 16

Read back from the Lean

Given a type V, a simple graph G on V, and a subset S of V, ZeroForced G S is the inductive predicate on vertices of V defined by two rules: 1. init: If v ∈ S, then ZeroForced G S v. 2. step: If u, w : V such that ZeroForced G S u, u is adjacent to w in G, and every neighbor x of u with x ≠ w satisfies ZeroForced G S x, then ZeroForced G S w.

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

/-- Inductive definition of vertices in the zero forcing closure of S. -/
inductive ZeroForced {V : Type*} (G : SimpleGraph V) (S : Set V) : V → Prop | init (v : V) : v ∈ S → ZeroForced G S v
  | step (u : V) (w : V) : ZeroForced G S u → G.Adj u w →
      (∀ x, G.Adj u x → x ≠ w → ZeroForced G S x) → ZeroForced G S w
See it in the graphDiscuss this resultChallenge it