In Lecture 23 we worked out the irreducible representations of the symmetric group and computed their characters. Proceeding by bare hands becomes difficult quickly since the cardinality of
grows very rapidly (indeed, superexponentially) with
.
We can at least answer one natural question, which encouragingly was asked by Yunseong Jung in Lecture 23: is the standard representation of irreducible for all
? If so, we will have three irreducible unitary representations of
, namely the trivial and alternating ones, which are one-dimensional, and the standard representation, which is
dimensional. This isn’t much – the number of irreducible representations of
is the number of partitions of
which according to the Hardy-Ramanujan formula is asymptotically
for large – but it’s better than nothing.
Start with the permutation representation of
, so
is a Hilbert space with orthonormal basis
,
and
is the group homomorphism defined by
The character of the permutation representation of is
so is the number of fixed points (i.e. one-cycles) of the permutation
Therefore,
where is the set of fixed points of
. To understand this sum, let us begin with the simpler version without the squares. By Burnside’s Lemma, which is a consequence of the orbit-stabilizer theorem, we have
where is the number of orbits of
acting on
Obviously, the number of orbits of
acting on
is one, i.e.
acts transitively on
so
which can be interpreted probabilistically as saying that the expected number of fixed points in a uniformly random sample from is one.
We can use a version of the same argument to evaluate To get the exponent of
into the equation, let
act on
by
Then, we have
so that points of which are fixed by a given
are in bijection with pairs of points in
which are fixed by
. Applying Burnside’s Lemma we thus have
It is not too difficult to determine the number of orbits of acting on
Indeed, consider any point
Either
or
. In the first case, the orbit of
under
consists of all pairs of points with equal coordinates, in the second case it is all pairs of points with distinct coordinates; these two mutually exclusive cases are the only possibilities. We thus have
which says that the second moment of the random variable which gives the number of fixed points in a uniformly random permutation is equal to two. Since
and
you might be tempted to assume that the
th moment of
is
but this is wrong and the correct answer is quite a bit more interesting.
For our purposes, all we need is
Let be the random variable defined by
We conclude from the above that the character of the permutation representation of
satisfies
Now let be the one-dimensional subspace of
spanned by
which is an irreducible representation of
, and let
be its orthogonal complement, which is the standard representation of
. Since
we have
and therefore
where we have used character orthogonality to claim
on the grounds that and
are non-isomorphic representations of
for
Indeed,
is the trivial representation of
, in which every permutation acts as the identity on this one-dimensional space. The standard representation
is the alternating representation of
if
and for
its dimension is strictly larger than one.
To finish the argument, write
where the fact that follows from its irreducibility. Likewise, since
the standard representation of the symmetric group is irreducible.
Thankfully, the basic idea in the representation theory of the symmetric groups is very simple: is a subgroup of
(more precisely,
is isomorphic to the subgroup of
consisting of all permutations of
that have
as a fixed point). Thus we have an infinite sequence of nested groups
or equivalently an infinite sequence of nested algebras
The strategy is therefore to analyze representations of inductively, by understanding how the unitary representations of
is related to those of
Let be a set indexing isomorphism classes of irreducible unitary representations of
or equivalently irreducible linear representations of its convolution algebra
For each
let
be a representative of the corresponding isomorphism class. We know
concretely: it is the set of integer partitions of the number
, which also index conjugacy classes in
Since is irreducible, the image of
in
under
is all of
by Burnside’s theorem. On the other hand, viewing
as a subgroup of
and hence
as a subalgebra of
the image of
in
is not necessarily all of
meaning that
is a unitary representation of
but not necessarily an irreducible one. So viewed as a representation of
there is an isotypic decomposition
where the direct sum is over the set of partitions of
and
is the multiplicity of
in
viewed as a representation of
The main theorem in the representation theory of the symmetric groups is a strikingly simple description of this isotypic decomposition, which we discuss in Lecture 25.