AFTD Auto-Formalizing Theoretical Domains

schur_polynomial

def

For a finite diagram D : Finset (ℕ × ℕ) and a positive integer m : ℕ, the Schur polynomial schur_polynomial D m in MvPolynomial ℕ ℤ is the sum of the monomial weights tableau_weight D M over all semi-standard Young tableaux M in ssyt_bounded D m.

Statement

open scoped BigOperators in
noncomputable def schur_polynomial (D : Finset (ℕ × ℕ)) (m : ℕ) : MvPolynomial ℕ ℤ
Defined in
arXiv:2611.07715, Definition 5.1
Verified
06 Nov 2026
Axioms
none listed
Built on 2
  • ssyt_boundedFor a finite diagram D : Finset (ℕ × ℕ) and an integer bound m : ℕ, ssyt_bounded D m is the finite set of semi-standard fillings M : D → ℕ…
  • tableau_weightFor a finite diagram D : Finset (ℕ × ℕ) and a filling M : D → ℕ, tableau_weight D M is the multivariate polynomial in MvPolynomial ℕ ℤ…
Used by 1
  • anti_ribbon_schur_polynomialFor a positive integer N : ℕ, a descent set S : Finset ℕ, and a bound m : ℕ, the anti-ribbon Schur polynomial anti_ribbon_schur_polynomial…

Read back from the Lean

For a finite set D of pairs of natural numbers (Finset (ℕ × ℕ)) and a natural number bound m, schur_polynomial D m is the multivariate polynomial in MvPolynomial ℕ ℤ defined as the sum over all semistandard Young tableaux M on D bounded by m (M ∈ ssyt_bounded D m) of the weight of M (tableau_weight D M). Here: 1. tableau_weight D M is the product over all cells u : D of the indeterminate MvPolynomial.X (M u). 2. ssyt_bounded D m is the set of all functions M : D → ℕ whose values lie in {1, ..., m} (Finset.Icc 1 m) that satisfy is_semistandard D M. 3. is_semistandard D M asserts that: - for all u, v : D, if row_col_le D u.1 v.1 holds, then M u ≤ M v; and - for all u, v : D, if row_col_le D u.1 v.1 holds and u.1.1 < v.1.1 (the row index of u is strictly less than the row index of v), then M u < M v. 4. row_col_le D u v is the reflexive-transitive closure (Relation.ReflTransGen) of the single-step relation on ℕ × ℕ that allows moving from x to y if InImplicit D x and InImplicit D y hold, and either: - x.1 = y.1 ∧ x.2 + 1 = y.2 (moving one step to the right in the same row), or - x.1 + 1 = y.1 ∧ x.2 = y.2 (moving one step down in the same column).

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

open scoped BigOperators in
/-- Schur polynomial associated with diagram D in m variables. -/
noncomputable def schur_polynomial (D : Finset (ℕ × ℕ)) (m : ℕ) : MvPolynomial ℕ ℤ := ∑ M ∈ ssyt_bounded D m, tableau_weight D M
See it in the graphDiscuss this resultChallenge it