YoungLattice
def
The Young lattice L(m, n) is the type of Young diagrams whose cells (i, j) satisfy i < m and j < n, ordered by inclusion.
Statement
def YoungLattice (m n : ℕ) : Type
- Defined in
- arXiv:2610.24148, Section 2.7.4
- Verified
- 24 Oct 2026
- Axioms
- none listed
- Used by 4
- young_lattice_rankThe centered rank of a Young diagram μ in L(m, n) is 2 * |cells(μ)| - m * n.
- young_lattice_rank_is_ranked_posetFor any m and n, the rank function young_lattice_rank makes L(m, n) into a ranked poset in the sense of is_ranked_poset.
- young_lattice_partial_orderThe Young lattice L(m, n) inherits the partial order on Young diagrams given by cell inclusion.
- young_lattice_one_fractional_scdFor any positive integer n ≥ 1, the Young lattice L(1, n) admits a fractional symmetric chain decomposition.
Read back from the Lean
For natural numbers m and n, YoungLattice m n is defined as the type (subtype) of Young diagrams μ such that for every cell c ∈ μ, the first coordinate of c is strictly less than m and the second coordinate of c is strictly less than n (i.e., Young diagrams fitting inside an m × n box).
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 Young lattice L(m, n) of integer partitions whose Young diagrams fit inside an m × n bounding box. -/ def YoungLattice (m n : ℕ) : Type := { μ : YoungDiagram // ∀ c ∈ μ, c.1 < m ∧ c.2 < n }