young_lattice_partial_order
instance
The Young lattice L(m, n) inherits the partial order on Young diagrams given by cell inclusion.
Statement
instance young_lattice_partial_order (m n : ℕ) : PartialOrder (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
- 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_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 all natural numbers $m$ and $n$, the type YoungLattice m n is equipped with a PartialOrder instance, defined as the subtype partial order inherited from YoungDiagram.
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
/-- Partial order on YoungLattice m n induced by the inclusion order on YoungDiagram. -/ instance young_lattice_partial_order (m n : ℕ) : PartialOrder (YoungLattice m n) := inferInstanceAs (PartialOrder { μ : YoungDiagram // ∀ c ∈ μ, c.1 < m ∧ c.2 < n })