In Lecture 3, we introduced the Young-Jucys-Murphy elements in the group algebra of the symmetric group . The YJM elements form a commuting family of elements in the group algebra of the symmetric group , and have the amazing feature that symmetric polynomials in always belong to the class algebra despite the non-centrality of the ‘s themselves. This is quite remarkable, as there is no obvious reason why an arbitrary symmetric polynomial should evaluate to a linear combination of conjugacy classes.
Since is central, Schur’s Lemma implies that it acts in any given irreducible representation of as a scalar operator. More precisely, if is the irreducible representation of corresponding to the partition (more precisely, a representative of the isomorphism class of all such representations), then the operator is of the form
where is the identity operator and is a scalar. Note that this scalar must in fact be real, because each , being a sum of transpositions, is a selfadjoint element of Indeed,
are commuting selfadjoint operators, and hence are simultaneously diagonalizable, i.e. admit a common eigenbasis. A natural question is then how to explicitly describe the eigenvalue This question has an amazing answer, which we now describe.
According to Schur’s Lemma, the class algebra may be described as the subalgebra of consisting of elements which act as scalar operators in all irreducible representations. Note that we are including here a converse to Schur’s Lemma, namely the statement that if is a scalar operator in for all , then ; this follows immediately from the fact that the map
is an algebra isomorphism (often referred to as the noncommutative Fourier transform). We can generalize this as follows.
As you know from Math 202B, the branching of irreducible -modules is multiplicity free. More precisely, we may consider the group algebra of the symmetric group as the subalgebra of spanned by permutations in satisfying The isotopic decomposition of an irreducible -module as an -module is
where the direct sum is over all irreducible -modules such that the Young diagram can be obtained from the Young diagram by adding a single cell.
Example 1: For the “staircase” diagram the isotypic decomposition of the irreducible -module as an -module is
Iterating this construction, we obtain a decomposition of into a sum of dimensional spaces indexed by “growth sequences”
where is a diagram with -cells, which encode the possible life histories of the multicellular organism starting from the single-celled organism Obviously, each such growth history corresponds uniquely to a standard Young tableau of shape — the entry of a given cell encodes the time instant at which that cell was added. Thus, multiplicity-free branching gives us a basis of each irreducible representation canonically determined up to scaling; this basis is known as the Young basis (or sometimes the Gelfand-Tsetlin basis). By Schur’s lemma, the subalgebra
coincides with the maximal commutative subalgebra of of elements which act diagonally on the Young basis of every irreducible representation ; this algebra is known as the Young subalgebra (or Gelfand-Tsetlin subalgebra) of the group algebra , and its construction depends crucially on the fact that we have a natural inclusion . Observe that the YJM elements belong to the algebra (explaining why is a conceptually optimal way to answer one of the homework problems). The following Theorem is an enormously useful tool, both theoretically and computationally.
Theorem 1 (Diaconis-Greene,Murphy,Okounkov-Vershik): The commutative algebra is exactly the algebra of polynomials in the YJM elements Moreover, for each irreducible representation of , the action of on the corresponding Young basis is given by
where is the content (i.e. column index minus row index) of the cell in containing the number .
Example 2: Consider the group algebra of the symmetric group of degree acting in the irreducible representation labeled by the staircase partition and let be the Young basis vector corresponding to the standard tableau
Theorem 1 says that is an eigenvector of each of the operators and that the corresponding eigenvalues are, respectively,
Corollary 1: For any and any , we have
where the right hand side denotes the evaluation of the symmetric polynomial on the numbers , with being an arbitrary enumeration of the cells of
Example 2: Corollary 1 tells us that the eigenvalue of the symmetric polynomial
acting in is
We will black-box Theorem 1, and (possibly) return to its proof later, though I will post a resource where you can look it up if you wish. Our goal will be to mine some rather remarkable information from Theorem 1. There are two natural directions in which one might want to go.
First, there is the question of whether evaluation on the YJM elements in fact defines a surjective morphism
If this were so, then for each there would exist a symmetric polynomial such that
i.e. we could express each conjugacy class as a symmetric polynomial function of the YJM elements. This would in turn have the following character-theoretic consequence. One one hand, the eigenvalue of the conjugacy class acting in the irreducible representation is given by
where as always the character is by definition the trace of the operator , with an arbitrary permutation in the conjugacy class Indeed, on one hand we have
since the trace of a scalar operator is simply its unique eigenvalue summed dimension-many times, and on the other hand
Corollary 1 would then give us the formula
which in turn gives us a formula for the irreducible character as a function of the content alphabet of the Young diagram . In fact, this is all true, and is a consequence of combining Corollary 1 with the following classical theorem on the class algebra.
Theorem 2 (Farahat-Higman): Every conjugacy class can be expressed as a polynomial in the levels of the Cayley graph of
A good treatment of this approach to the irreducible characters of the symmetric groups has been given by our colleague Adriano Garsia, and I will post his lecture notes to our Piazza page. There is an inescapable downside to this seemingly miraculous result: the symmetric polynomials are not given by any simple formula. This is in a sense inevitable, as the computation of the irreducible characters of the symmetric groups is a -complete problem, and consequently the quest for an explicit closed form is quixotic.
Instead, one can take the opposite approach, and start from the fact that there are many interesting (symmetric) polynomials which we can write down explicitly, and Theorem 1 gives us a way to explicitly calculate the action of in irreducible representations. It is this direction that we shall follow in the coming lectures.