One thing I’ve been thinking about lately is the tensor product multiplicities for the classical groups. The case of the general (special) linear group is the Littlewood-Richardson rule, so I wanted to discuss how to use these numbers to gain some information for the orthogonal and symplectic groups.
First, let’s get some notation out of the way. We’ll work over a field K of characteristic 0, and E will denote a vector space equipped with a nondegenerate symplectic or orthogonal form . Write where . We’ll assume that E has a basis such that for and such that all other pairings are 0. If K is algebraically closed, this always happens. We let G be the subgroup of which preserves this form, i.e., the subgroup of all g with determinant 1 such that for all v and w. Let’s use the Cartan-Killing classification to name these groups as follows: when is orthogonal and is odd (resp. even), we say that G is type B (resp. type D), and when is symplectic, we say that G is type C.
We take T to be a subgroup of G consisting of diagonal matrices. This is a maximal torus, and the matrices look like in the case that and look like otherwise. For uniformity of notation, let’s write these matrices as . The character group of T can be identified with by associating the character with the element .
2. Representations of classical groups
With the identification above, we would like to know which characters are dominant weights. We can take our Borel subgroup to be the upper triangular matrices inside of G, so that we have picked a subset of positive roots. In type B and C, a weight is dominant if and only if , and in type D we have a slightly relaxed condition .
We can construct the representations with these highest weights as certain submodules of representations of the general linear group . The Weyl construction goes as follows. First, given any partition with at most parts, we can find a copy of the irreducible representation of of highest weight inside of where .
Call this representation . Given our form , and integers (i,j) such that , we have a contraction map defined by where the hat means we have removed those two vectors. Define to be the intersection of with the kernels of all possible contraction maps. Then we have the following. Let be a partition with at most n parts. In types B and C, is an irreducible representation of G with highest weight . The same is true in type D if . Otherwise, in type D with , we have that is the direct sum of two irreducible representations of G, one with highest weight , and the other with highest weight .
Finally, let me just mention that these three groups are semisimple, so all finite dimensional representations break up into a direct sum of irreducible representations.
3. Tensor products
Let denote the Littlewood-Richardson coefficients for the general linear group. These can be defined by the tensor product decomposition (as representations)
Suppose that we want a decomposition of the tensor product
Under the assumption that , the Newell-Littlewood formula gives that
Note that the formula does not take into account which group we were dealing with. This is surprising (at least to me)! However, the answer is really limiting because we made a largeness assumption on n. For small values of n, the formula above can still be made valid if we reinterpret what means when . I’ll say something about these modification rules in the next section.
4. Modification rules
We want to reinterpret in the case that . In each case, we will either replace it by 0, or where . In this case, let’s say that is the modification of . Let's describe these modification rules separately for each group.
Let be a partition and draw its Young diagram. Let be the number of boxes in the ith column. Set if and otherwise. Here’s a way to picture what the mean. If it exists, put a horizontal dashed line through the middle of the (n + i – 1)st box of the ith column for all i. Then fold the column along that dashed line and delete any parts with overlap. If the part below the dashed line is longer than the part above, the new column becomes negative.
Now set . If the are not distinct, then the modification of is 0. Otherwise rearrange the in decreasing order using a permutation , add 1 to the second largest, add 2 to the third largest, etc. These new numbers are the column lengths of a partition , and the modification of is where is the sign of the permutation .
The C and D case are similar, but we need to define the slightly differently. Both also have interpretations in terms of folding Young diagrams. So we’ll just mention how to define the in these two cases.
Set if and otherwise.
Set if and otherwise.
- Kazuhiko Koike and Itaru Terada, Young-diagrammatic methods for the representation theory of the classical groups of type , J. Algebra 107 (1987), no. 2, 466–511.
- D. E. Littlewood, Products and plethysms of characters with orthogonal, symplectic and symmetric groups, Canad. J. Math. 10 1958 17–32.