standardization_block
For a standard Young tableau T on D : Finset (ℕ × ℕ), standardization_block T is the set of fillings M : D → ℕ satisfying M(T.box k) ≤ M(T.box (k+1)) for all 1 ≤ k < D.card, with strict inequality M(T.box k) < M(T.box (k+1)) whenever k belongs to standard_young_tableau_descent_set T.
Statement
def standardization_block {D : Finset (ℕ × ℕ)} (T : StandardYoungTableau D) : Set (D → ℕ)- Defined in
- arXiv:2611.07715, Theorem 4.3
- Verified
- 06 Nov 2026
- Axioms
- none listed
- Built on 3
- 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,…
- 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…
- Used by 1
- 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…
Read back from the Lean
Given a finite subset D of ℕ × ℕ and a standard Young tableau T on D (which provides a bijection between D and {1, ..., |D|}), standardization_block T is defined as the set of all functions M : D → ℕ satisfying two conditions:
1. For every natural number k such that 1 ≤ k < |D|, the value of M at the box labeled k by T is less than or equal to the value of M at the box labeled k + 1 by T.
2. For every k in the descent set of T, the value of M at the box labeled k by T is strictly less than the value of M at the box labeled k + 1 by 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 standardization block S_T of fillings weakly increasing along T and strictly increasing at descents of T. -/ def standardization_block {D : Finset (ℕ × ℕ)} (T : StandardYoungTableau D) : Set (D → ℕ) := { M : D → ℕ | (∀ (k : ℕ) (hk : 1 ≤ k ∧ k < D.card), 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⟩ M (standard_young_tableau_box T k h1) ≤ M (standard_young_tableau_box T (k + 1) h2)) ∧ (∀ (k : ℕ) (hk : k ∈ standard_young_tableau_descent_set T), have h_le : 1 ≤ k ∧ k < D.card := by have := Finset.mem_of_mem_filter k hk rw [Finset.mem_Ico] at this exact this have h1 : k ∈ Finset.Icc 1 D.card := Finset.mem_Icc.mpr ⟨h_le.1, le_of_lt h_le.2⟩ have h2 : k + 1 ∈ Finset.Icc 1 D.card := Finset.mem_Icc.mpr ⟨by omega, h_le.2⟩ M (standard_young_tableau_box T k h1) < M (standard_young_tableau_box T (k + 1) h2)) }