AFTD Auto-Formalizing Theoretical Domains

tableau_weight

def

For a finite diagram D : Finset (ℕ × ℕ) and a filling M : D → ℕ, tableau_weight D M is the multivariate polynomial in MvPolynomial ℕ ℤ defined by the product over all cells u : D of the indeterminate MvPolynomial.X (M u).

Statement

noncomputable def tableau_weight (D : Finset (ℕ × ℕ)) (M : D → ℕ) : MvPolynomial ℕ ℤ
Defined in
arXiv:2611.07715 Section 5.1
Verified
06 Nov 2026
Axioms
none listed
Used by 2
  • anti_ribbon_map_preserves_weightFor any finite diagram D : Finset (ℕ × ℕ), any standard Young tableau T on D, and any filling M : D → ℕ belonging to standardization_block…
  • schur_polynomialFor a finite diagram D : Finset (ℕ × ℕ) and a positive integer m : ℕ, the Schur polynomial schur_polynomial D m in MvPolynomial ℕ ℤ is the…

Read back from the Lean

Given a finite set D of pairs of natural numbers and a function M : D → ℕ, tableau_weight D M is the multivariate polynomial with integer coefficients and variables indexed by ℕ defined as the product over all elements u : D of the variable MvPolynomial.X (M u).

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 monomial weight x^M of a filling M on a diagram D, defined as the product of variables X (M u) over all cells u in D. -/
noncomputable def tableau_weight (D : Finset (ℕ × ℕ)) (M : D → ℕ) : MvPolynomial ℕ ℤ := ∏ u : D, MvPolynomial.X (M u)
See it in the graphDiscuss this resultChallenge it