AFTD Auto-Formalizing Theoretical Domains

ssyt_bounded

def

For a finite diagram D : Finset (ℕ × ℕ) and an integer bound m : ℕ, ssyt_bounded D m is the finite set of semi-standard fillings M : D → ℕ whose entries all lie in the interval {1, ..., m}.

Statement

open Classical in
noncomputable def ssyt_bounded (D : Finset (ℕ × ℕ)) (m : ℕ) : Finset (D → ℕ)
Defined in
arXiv:2611.07715, Section 5.1
Verified
06 Nov 2026
Axioms
none listed
Built on 1
  • is_semistandardFor a finite diagram D : Finset (ℕ × ℕ), a filling M : D → ℕ is semi-standard if for all u, v : D, row_col_le D u.1 v.1 implies M u ≤ M v,…
Used by 1
  • 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

ssyt_bounded D m defines the finite set (Finset) of all functions M : D → ℕ (where D : Finset (ℕ × ℕ) is viewed as a subtype) such that: 1. The values of M are bounded between 1 and m inclusive (i.e., 1 ≤ M u ≤ m for all u : D). 2. M satisfies is_semistandard D M, meaning that for all u, v : D: - if row_col_le D u.1 v.1, then M u ≤ M v; - if row_col_le D u.1 v.1 and u.1.1 < v.1.1 (the row coordinate of u is strictly less than the row coordinate of v), then M u < M v.

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 Classical in
/-- The finite set of semi-standard Young tableaux of shape D with entries bounded by m. -/
noncomputable def ssyt_bounded (D : Finset (ℕ × ℕ)) (m : ℕ) : Finset (D → ℕ) := Finset.filter (fun M => is_semistandard D M)
    (Finset.image (fun (f : D → Finset.Icc 1 m) => fun u => (f u : ℕ)) Finset.univ)
See it in the graphDiscuss this resultChallenge it