zero_forcing_cl
The zero forcing closure cl(S) of a subset S of vertices in a simple graph G is the union over all natural numbers i of B_i.
Statement
def zero_forcing_cl {V : Type*} (G : SimpleGraph V) (S : Set V) : Set V
- Defined in
- arXiv:2611.13244, Section 1 -- Stabilization of the zero forcing number of generalized Petersen graphs
- Verified
- 12 Nov 2026
- Axioms
- none listed
- Built on 1
- zero_forcing_seqThe sequence of vertex subsets B_i in a simple graph G starting with B_0 = S and iteratively defined by adding all unique outside…
- Used by 2
- zero_forcing_boundary_monotonicityLet G be a simple graph, and let S be a finite subset of vertices. In the zero forcing sequence B_0 = S ⊆ B_1 ⊆ ..., the extended…
- zero_forcing_boundary_cl_leLet G be a simple graph and S a finite subset of vertices. Then the extended cardinality of the boundary of the closure cl(S) is at most…
Read back from the Lean
Given a type V, a simple graph G on vertex type V, and a subset S : Set V, zero_forcing_cl G S is the subset of V defined as the union over all i : ℕ of zero_forcing_seq G S i.
Here, zero_forcing_seq G S : ℕ → Set V is defined recursively by:
- zero_forcing_seq G S 0 = S
- zero_forcing_seq G S (n + 1) = zero_forcing_seq G S n ∪ {w : V | ∃ x ∈ zero_forcing_seq G S n, G.neighborSet x \ zero_forcing_seq G S n = {w}} (the union of the previous set with the set of vertices w that are the unique neighbor outside the current set for some vertex x currently in the set).
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 zero forcing closure of a subset S of vertices in a simple graph G, defined as the union of all B_i. -/ def zero_forcing_cl {V : Type*} (G : SimpleGraph V) (S : Set V) : Set V := ⋃ i : ℕ, zero_forcing_seq G S i