AFTD Auto-Formalizing Theoretical Domains

young_lattice_rank

def

The centered rank of a Young diagram μ in L(m, n) is 2 * |cells(μ)| - m * n.

Statement

def young_lattice_rank (m n : ℕ) (μ : YoungLattice m n) : ℤ
Defined in
arXiv:2610.24148, Section 2.7.4
Verified
24 Oct 2026
Axioms
none listed
Built on 1
  • YoungLatticeThe Young lattice L(m, n) is the type of Young diagrams whose cells (i, j) satisfy i < m and j < n, ordered by inclusion.
Used by 2

Read back from the Lean

The definition young_lattice_rank takes two natural numbers $m$ and $n$, and an element $\mu$ of YoungLattice m n (a Young diagram fitting in an $m \times n$ box), and returns the integer $2 \cdot |\mu| - mn$, where $|\mu|$ is the number of cells in the Young diagram $\mu$.

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 centered rank function on the Young lattice L(m, n), taking values from -m*n to m*n with step size 2. -/
def young_lattice_rank (m n : ℕ) (μ : YoungLattice m n) : ℤ := 2 * (μ.val.cells.card : ℤ) - (m * n : ℤ)
See it in the graphDiscuss this resultChallenge it