AFTD Auto-Formalizing Theoretical Domains

StandardYoungTableau

structure

For a finite diagram D : Finset (ℕ × ℕ), a standard Young tableau is an equivalence toEquiv : D ≃ Finset.Icc 1 D.card from the subtype D to the interval {1, ..., |D|} such that for all u, v : D, if row_col_le D u.1 v.1 holds then (toEquiv u : ℕ) ≤ (toEquiv v : ℕ).

Statement

structure StandardYoungTableau (D : Finset (ℕ × ℕ))
Defined in
arXiv:2611.07715, Definition 2.1
Verified
06 Nov 2026
Axioms
none listed
Built on 1
  • row_col_leFor a finite diagram D : Finset (ℕ × ℕ) and cells u, v : ℕ × ℕ, row_col_le D u v holds if there is a reflexive-transitive chain of unit…
Used by 6
  • standard_young_tableau_boxFor a standard Young tableau T on a finite diagram D : Finset (ℕ × ℕ) and an integer k with proof hk : k ∈ Finset.Icc 1 D.card,…
  • 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…
  • instFintypeStandardYoungTableauThe type StandardYoungTableau D of standard Young tableaux on a finite diagram D is finite.

Read back from the Lean

A structure StandardYoungTableau parameterized by a finite set of coordinate pairs D : Finset (ℕ × ℕ). An instance of this structure consists of: 1. toEquiv: A bijection (equivalence) between the subtype of elements in D and the finset interval {1, ..., D.card} (Finset.Icc 1 D.card). 2. monotone': A proof that for all cells u, v : D, if row_col_le D u.1 v.1 holds, then the natural number assigned to u, (toEquiv u : ℕ), is less than or equal to (toEquiv v : ℕ). Here: - row_col_le D u v asserts that v is reachable from u by zero or more steps (the reflexive-transitive closure Relation.ReflTransGen) of moving either one unit right (x.1 = y.1 ∧ x.2 + 1 = y.2) or one unit down (x.1 + 1 = y.1 ∧ x.2 = y.2), such that every point x and y along each step satisfies InImplicit D. - InImplicit D is the inductively defined predicate on ℕ × ℕ that contains: - all elements x ∈ D (base), - any point (i, j) horizontally between two points (i, j₁) and (i, j₂) in InImplicit D with j₁ ≤ j ≤ j₂ (row_between), - any point (i, j) vertically between two points (i₁, j) and (i₂, j) in InImplicit D with i₁ ≤ i ≤ i₂ (col_between).

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

/-- A standard Young tableau on a diagram D is a bijection onto {1, ..., |D|} preserving the row-column order. -/
structure StandardYoungTableau (D : Finset (ℕ × ℕ)) where
  toEquiv : D ≃ Finset.Icc 1 D.card
  monotone' : ∀ (u v : D), row_col_le D u.1 v.1 → (toEquiv u : ℕ) ≤ (toEquiv v : ℕ)
See it in the graphDiscuss this resultChallenge it