young_diagram_same_len_rows_below
def
The number of rows in a Young diagram strictly below row $i$ that have the same length as row $i$.
Statement
def young_diagram_same_len_rows_below (μ : YoungDiagram) (i : ℕ) : ℕ- Defined in
- arXiv:2610.29291 Theorem 3.4 proof
- Verified
- 22 Oct 2026
- Axioms
- none listed
- Used by 1
- block_latin_fillingThe filling assigning to cell $(i, j)$ in row $i$ the value $(\lambda_i - w \cdot (j/w + 1)) + 1 + ((t_i + (j \bmod w)) \bmod w)$, where…
Read back from the Lean
For a Young diagram μ and a natural number i, young_diagram_same_len_rows_below μ i is defined as the number of row indices k strictly greater than i and strictly less than μ.colLen 0 such that row k has the same length as row i in μ (that is, μ.rowLen k = μ.rowLen i).
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 number of rows strictly below row i that have the same length as row i. -/ def young_diagram_same_len_rows_below (μ : YoungDiagram) (i : ℕ) : ℕ := ((Finset.range (μ.colLen 0)).filter fun k => i < k ∧ μ.rowLen k = μ.rowLen i).card