AFTD Auto-Formalizing Theoretical Domains

principal_specialization_t_chromatic_coeff_t

def

Given a bivariate polynomial P in Z[t][q], the coefficient of t^k is the polynomial in q whose j-th coefficient is the coefficient of t^k in the j-th coefficient of P.

Statement

noncomputable def principal_specialization_t_chromatic_coeff_t
    (P : Polynomial (Polynomial ℤ)) (k : ℕ) : Polynomial ℤ
Defined in
arXiv:2610.31785 Equation (3.1)
Verified
26 Oct 2026
Axioms
none listed

Read back from the Lean

A definition principal_specialization_t_chromatic_coeff_t that takes a polynomial P : Polynomial (Polynomial ℤ) (a bivariate polynomial over ℤ viewed as polynomials in an outer variable with coefficients in an inner polynomial ring) and a natural number k : ℕ, and returns the polynomial in Polynomial ℤ defined as the sum over all j in the support of P of the monomial of degree j whose coefficient is the k-th coefficient of the j-th coefficient of P. In other words, if P = ∑_j P_j X^j, it returns ∑_j (coeff P_j k) X^j, extracting the degree-k coefficient with respect to the inner variable as a polynomial in the outer variable.

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

/-- Extracts the coefficient of t^k from a bivariate polynomial P in Z[t][q] as a univariate polynomial in q. -/
noncomputable def principal_specialization_t_chromatic_coeff_t
    (P : Polynomial (Polynomial ℤ)) (k : ℕ) : Polynomial ℤ :=
  ∑ j ∈ P.support, Polynomial.monomial j ((P.coeff j).coeff k)
See it in the graphDiscuss this resultChallenge it