standard_young_tableau_descent_set
def
For a standard Young tableau T on D : Finset (ℕ × ℕ), the descent set standard_young_tableau_descent_set T is the subset of k ∈ Finset.Ico 1 D.card such that the cell T.box k has strictly smaller row index than the cell T.box (k+1).
Statement
def standard_young_tableau_descent_set {D : Finset (ℕ × ℕ)} (T : StandardYoungTableau D) : Finset ℕ- Defined in
- arXiv:2611.07715, Definition 4.1
- Verified
- 06 Nov 2026
- Axioms
- none listed
- Built on 2
- StandardYoungTableauFor a finite diagram D : Finset (ℕ × ℕ), a standard Young tableau is an equivalence toEquiv : D ≃ Finset.Icc 1 D.card from the subtype D…
- 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,…
- Used by 3
- 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) ≤…
Read back from the Lean
Given a finite set $D \subseteq \mathbb{N} \times \mathbb{N}$ and a standard Young tableau $T$ on $D$, standard_young_tableau_descent_set T is defined as the finite set of natural numbers $k \in [1, |D|)$ such that the first coordinate of the cell labeled $k$ under $T$ is strictly less than the first coordinate of the cell labeled $k + 1$ under $T$.
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 descent set of a standard Young tableau T: indices k such that the box for k+1 lies in a strictly lower row than the box for k. -/ def standard_young_tableau_descent_set {D : Finset (ℕ × ℕ)} (T : StandardYoungTableau D) : Finset ℕ := (Finset.Ico 1 D.card).filter fun k => if hk : 1 ≤ k ∧ k < D.card then have h1 : k ∈ Finset.Icc 1 D.card := Finset.mem_Icc.mpr ⟨hk.1, le_of_lt hk.2⟩ have h2 : k + 1 ∈ Finset.Icc 1 D.card := Finset.mem_Icc.mpr ⟨by omega, hk.2⟩ (standard_young_tableau_box T k h1).1.1 < (standard_young_tableau_box T (k + 1) h2).1.1 else false