AFTD Auto-Formalizing Theoretical Domains

standard_young_tableau_box

def

For a standard Young tableau T on a finite diagram D : Finset (ℕ × ℕ) and an integer k with proof hk : k ∈ Finset.Icc 1 D.card, standard_young_tableau_box T k hk is the cell in D given by T.toEquiv.symm ⟨k, hk⟩.

Statement

def standard_young_tableau_box {D : Finset (ℕ × ℕ)} (T : StandardYoungTableau D) (k : ℕ) (hk : k ∈ Finset.Icc 1 D.card) : D
Defined in
arXiv:2611.07715, Section 4
Verified
06 Nov 2026
Axioms
none listed
Built on 1
  • StandardYoungTableauFor a finite diagram D : Finset (ℕ × ℕ), a standard Young tableau is an equivalence toEquiv : D ≃ Finset.Icc 1 D.card from the subtype D…
Used by 4
  • anti_ribbon_mapFor a standard Young tableau T on D : Finset (ℕ × ℕ) and a filling M : D → ℕ, anti_ribbon_map T M is the filling of anti_ribbon_diagram…
  • 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…
  • standardization_blockFor a standard Young tableau T on D : Finset (ℕ × ℕ), standardization_block T is the set of fillings M : D → ℕ satisfying M(T.box k) ≤…
  • standard_young_tableau_descent_setFor a standard Young tableau T on D : Finset (ℕ × ℕ), the descent set standard_young_tableau_descent_set T is the subset of k ∈ Finset.Ico…

Read back from the Lean

Given a finite set of cells D : Finset (ℕ × ℕ), a standard Young tableau T on D, a natural number k, and a proof hk that k ∈ Finset.Icc 1 D.card (i.e., 1 ≤ k and k ≤ D.card), standard_young_tableau_box T k hk is defined as the cell in D (as an element of the subtype {x // x ∈ D}) whose label under the tableau is k, obtained by applying the inverse of the tableau's equivalence T.toEquiv.symm to ⟨k, hk⟩.

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 box of D assigned entry k by a standard Young tableau T. -/
def standard_young_tableau_box {D : Finset (ℕ × ℕ)} (T : StandardYoungTableau D) (k : ℕ) (hk : k ∈ Finset.Icc 1 D.card) : D := T.toEquiv.symm ⟨k, hk⟩
See it in the graphDiscuss this resultChallenge it