*** Problems in this lecture Due March 15 ***
*** Please complete a course evaluation ***
Let be a finite group, and let
be a set parameterizing irreducible unitary representations of
up to isomorphism. We know that
is a finite set whose cardinality is bounded by the number of conjugacy classes in
For each
let
be an irreducible unitary representation of
, and denote by
the corresponding character. Then, form an orthogonal set of functions in the class algebra
,
We do not yet know that spans
but we will get there soon.
Today we will discuss the representation-theoretic analogue of prime factorization. In fact, decomposing representations is easier than decomposing numbers because our set of irreducible objects is finite, and there is a formula for the multiplicity of a given irreducible in a given representation.
Let be any finite-dimensional unitary representation of
Either this representation is irreducible, or not. If it is, then
is isomorphic to
for some
If not, then it contains a proper subrepresentation, i.e. a nonzero subspace
which is
-stable.
Theorem 24.1 (Maschke’s Theorem). The orthogonal complement is also
-stable.
Proof: For any and
we have
for all
We now have a decomposition of
into two proper subrepresentations. Repeat this process on each of the “factors”
and
, and after finitely many steps you will produce a binary tree whose leaves are irreducible subrepresentations of
. Each of these leaves is necessarily isomorphic to one of the “primes”
We thus have a “prime factorization”
where is the number of leaves in the tree isomorphic to
This is called the isotypic decomposition of
. It remains to verify that however we decompose
into irreducibles, the end result will be the same.
Problem 24.1. State and prove a uniqueness theorem for “the” isotypic decomposition of a representation (hint: character orthogonality).
Theorem 24.2. We have
Proof: Taking traces on each side of the isotypic decomposition yields
now use character orthogonality.
Problem 24.2. Prove that
Now we are in position to prove that the character of a representation really does characterize it, up to isomorphism.
Theorem 24.3. Two unitary representation and
of
are isomorphic if and only if
Proof: It is clear that isomorphic representations have the same character. For the converse, the fact that implies that
for all
so that
and
have the same isotypic decomposition.
Theorem 24.4. A unitary representation of
is irreducible if and only if
Proof: Let
denote the isotypic decomposition of in character form. We then have
and you can take it from here.
Problem 24.3. Compute the isotypic decomposition of the regular representation.