total_forcing_poly
def
Given a finite type V and a simple graph G on V, total_forcing_poly G is the polynomial in Polynomial ℕ defined as the sum over all subsets S : Finset V of (if is_total_forcing_set G (S : Set V) then Polynomial.X ^ S.card else 0).
Statement
noncomputable def total_forcing_poly {V : Type*} [Fintype V] (G : SimpleGraph V) : Polynomial ℕ
- Defined in
- arXiv:2611.11352 Section 1
- Verified
- 10 Nov 2026
- Axioms
- none listed
- Built on 1
- is_total_forcing_setA total forcing set is a zero forcing set that induces a subgraph with no isolated vertices.
- Used by 1
- gt_total_forcing_poly_eqFor every integer t ≥ 24, the total forcing polynomial of gt_graph t is equal to the zero forcing polynomial of gt_graph t.
Read back from the Lean
Given a finite type V and a simple graph G on V, total_forcing_poly G is the polynomial in Polynomial ℕ defined as the sum over all subsets S : Finset V of Polynomial.X ^ S.card if S is a total forcing set of G, and 0 otherwise.
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
/-- Total forcing polynomial of a graph. -/ noncomputable def total_forcing_poly {V : Type*} [Fintype V] (G : SimpleGraph V) : Polynomial ℕ := open scoped Classical in ∑ S : Finset V, if is_total_forcing_set G (S : Set V) then Polynomial.X ^ S.card else 0