In mathematics, Young's lattice is a lattice that is formed by all integer partitions. It is named after Alfred Young, who, in a series of papers On quantitative substitutional analysis, developed the representation theory of the symmetric group. In Young's theory, the objects now called Young diagrams and the partial order on them played a key, even decisive, role. Young's lattice prominently figures in algebraic combinatorics, forming the simplest example of a differential poset in the sense of Stanley (1988). It is also closely connected with the crystal bases for affine Lie algebras.
Contents
Definition
Young's lattice is a lattice (and hence also a partially ordered set) Y formed by all integer partitions ordered by inclusion of their Young diagrams (or Ferrers diagrams).
Significance
The traditional application of Young's lattice is to the description of the irreducible representations of symmetric groups Sn for all n, together with their branching properties, in characteristic zero. The equivalence classes of irreducible representations may be parametrized by partitions or Young diagrams, the restriction from Sn+1 to Sn is multiplicity-free, and the representation of Sn with partition p is contained in the representation of Sn+1 with partition q if and only if q covers p in Young's lattice. Iterating this procedure, one arrives at Young's semicanonical basis in the irreducible representation of Sn with partition p, which is indexed by the standard Young tableaux of shape p.
Properties
The poset Y is graded: the minimal element is ∅, the unique partition of zero, and the partitions of n have rank n. This means that given two partitions that are comparable in the lattice, their ranks are ordered in the same sense as the partitions, and there is at least one intermediate partition of each intermediate rank.
The poset Y is a lattice. The meet and join of two partitions are given by the intersection and the union of the corresponding Young diagrams. Because it is a lattice in which the meet and join operations are represented by intersections and unions, it is a distributive lattice.
If a partition p covers k elements of Young's lattice for some k then it is covered by k + 1 elements. All partitions covered by p can be found by removing one of the "corners" of its Young diagram (boxes at the end both of their row and of their column). All partitions covering p can be found by adding one of the "dual corners" to its Young diagram (boxes outside the diagram that are the first such box both in their row and in their column). There is always a dual corner in the first row, and for each other dual corner there is a corner in the previous row, whence the stated property.
If distinct partitions p and q both cover k elements of Y then k is 0 or 1, and p and q are covered by k elements. In plain language: two partitions can have at most one (third) partition covered by both (their respective diagrams then each have one box not belonging to the other), in which case there is also one (fourth) partition covering them both (whose diagram is the union of their diagrams).
Saturated chains between ∅ and p are in a natural bijection with the standard Young tableaux of shape p: the diagrams in the chain add the boxes of the diagram of the standard Young tableau in the order of their numbering. More generally, saturated chains between q and p are in a natural bijection with the skew standard tableaux of skew shape p/q.
The Möbius function of Young's lattice takes values 0, ±1. It is given by the formula
μ
Dihedral symmetry
Conventionally, Young's lattice is depicted in a Hasse diagram with all elements of the same rank shown at the same height above the bottom.
Suter (2002) has shown that a different way of depicting some subsets of Young's lattice shows some unexpected symmetries.
The partition
n
+
⋯
+
3
+
2
+
1
{\displaystyle n+\cdots +3+2+1}
of the nth triangular number has a Ferrers diagram that looks like a staircase. The largest elements whose Ferrers diagrams are rectangular that lie under the staircase are these:
1
+
⋯
⋯
⋯
+
1
⏟
n
terms
2
+
⋯
⋯
+