2.10. Lecture 10
In this lecture we will finally define the last of the machinery needed to finish the proof of Theorem 2.8.7, and then we will finish said proof.
2.10.1. Universal projections
Recall that for any representation , the sum of matrices acts on as the orthogonal projection onto , the subspace of vectors in that are -invariant, i.e. the subrepresentation of that is isomorphic to copies of the irreducible trivial representation. We now generalise this. To start with, recall that for any element of the group algebra , we define
The space of -valued functions on is isomorphic to ; one possible choice of isomorphism is
Composition then lets us define :
Lemma 2.10.1.
If , then .
Proof.
This is Problem 2.10.3 below. ∎
Proposition 2.10.2.
Let and be an irreducible representation of . Then
Proof.
Proof of Theorem 2.8.7, continued:.
We want to prove that spans the space . To do this, we assume that is orthogonal to all ; and need to show that then .
Given any representation , we may decompose into irreducible subrepresentations:
Now, preserves each irreducible component, hence . By Proposition 2.10.2, , where . By assumption, for all , hence
Thus: for any representation of . In particular, considering the regular representation , we have
The set forms a basis of , so the linear combination is only zero if and only if for all , i.e. . ∎
We collect two more useful facts regarding maps :
Corollary 2.10.3.
If and are two irreducible representations, then
Corollary 2.10.4.
Let be a representation of with decomposition into irreducible subrepresentations
For each , define
Then is a projection onto .
Proof.
This follows directly from the previous corollary. ∎
The subrepresentation is called the -isotopic component of , and is called the -isotopic projector. Observe that since is independent of the choice of decomposition of into irreducibles, must also be independent of this choice. This implies that the only choices in the decomposition are given by the different decompositions of each into copies of .
Example 2.10.5.
We consider the permutation representation of , and compute the matrices of the isotopic projectors for all the irreducible representations of :
2.10.2. Example: the character table of .
Example 2.10.6.
We determine the character table of . First, we have the 1-dimensional trivial and sign representations:
Next, we have the 3-dimensional irreducible permutation representation of on , whose character satisfies
Notice that we also have an operation on representations known as twisting: if is any irreducible representation of and is a 1-dimensional character of , then we can define a new representation, , of on by the formula . It has character . In this case, we can look at the representation and see that it will also be irreducible:
Since , these are both irreducible. The characters of the two representations are different, hence they are non-isomorphic.
There is one more row of the table to find. This can be done using orthonormality with the first column, this is Corollary 2.8.8. If we recall that the dimension must be a positive integer we can test candidate cases and determine that it must be . Thus we obtain that the full character table is
Notice that we constructed the character of the final representation without constructing the representation itself!
2.10.3. Exercises
Problem 58. Prove Lemma 2.10.1.
Problem 59. Let and be two representations of a group . Show that if and only if
for all representations of .
Problem 60. Let be a representation of a group and a subgroup of . Show that
Problem 61. Find the character table of . Decompose the restriction of each irreducible representation of to into irreducibles.
Remark: When we say “decompose a representation into irreducibles”, we simply mean find out how many times each irreducible representation occurs in the decomposition. This is in contrast to if we were to ask for a “decomposition into irreducible subrepresentations”, which involves finding irreducible subrepresentations of the given representation and showing that their direct sum is the whole representation - this is a much harder task.
Problem 62. Decompose into irreducible isotopic components.
Problem 63. Let be a finite set on which a group acts. Consider the permutation representation of on the free vector space of .
-
(a)
Show that (recall that ) is equal to the number of -orbits in .
-
(b)
Compute , and use it to show Burnside’s lemma: the number of -orbits in is equal to
i.e. the average number of fixed points of the group elements.