AFTD Auto-Formalizing Theoretical Domains

simple_graph_t_chromatic_principal_specialization

def

For a finite simple graph G on a finite vertex type V and a natural number n, the n-th principal specialization of the t-chromatic symmetric function ps_n(Z_G(x; t)) is the bivariate polynomial in Polynomial (Polynomial ℕ) defined as the sum over all proper colorings c : G.Coloring (Fin n) of Polynomial.monomial (Finset.univ.image c).card (Polynomial.monomial (∑ v : V, (c v : ℕ)) (1 : ℕ)), where the outer indeterminate represents t and the inner indeterminate represents q.

Statement

noncomputable def simple_graph_t_chromatic_principal_specialization {V : Type*} [Fintype V]
    (G : SimpleGraph V) (n : ℕ) : Polynomial (Polynomial ℕ)
Defined in
arXiv:2610.31785, Definition 3.8
Verified
26 Oct 2026
Axioms
none listed
Used by 12

Read back from the Lean

Given a finite type V, a simple graph G on V, and a natural number n, simple_graph_t_chromatic_principal_specialization G n is the bivariate polynomial in Polynomial (Polynomial ℕ) defined as the sum over all proper vertex colorings c : G.Coloring (Fin n) of G with colors in {0, 1, …, n - 1} of: X^k · Y^s where: - X is the variable of the outer polynomial and k = (Finset.univ.image c).card is the number of distinct colors used by c on V, - Y is the variable of the inner polynomial, with coefficient 1, and s = ∑ v : V, (c v : ℕ) is the sum over all vertices v : V of the numerical value of the color c v ∈ {0, 1, …, n - 1} coerced to ℕ.

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 n-th principal specialization ps_n(Z_G(x; t)) of the t-chromatic symmetric function of a graph G. -/
noncomputable def simple_graph_t_chromatic_principal_specialization {V : Type*} [Fintype V]
    (G : SimpleGraph V) (n : ℕ) : Polynomial (Polynomial ℕ) := ∑ c : G.Coloring (Fin n),
    Polynomial.monomial (Finset.univ.image c).card
      (Polynomial.monomial (∑ v : V, (c v : ℕ)) (1 : ℕ))
See it in the graphDiscuss this resultChallenge it