Lecture 10
Problem 58.
Prove Lemma 10.1.
Solution: Let . Note that conjugation by is a bijection, i.e. . We will also make use of the fact that if is a class function , for all . Then
|
|
|
|
|
|
|
|
|
|
|
|
As was arbitrary we have that is in .
Problem 59.
Let and be two finite-dimensional representations of a finite group . Show that if and only if
for all finite-dimensional representations of .
Solution: We have
Thus, if for all , we have , hence by Theorem 29.
On the other hand, if , then , hence
Problem 60. Let be a representation of a group and a subgroup of . Show that
Solution: Since for all , , hence .
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.
Solution:
We start by determining the conjugacy classes of . Recall the following:
.
A conjugacy class in that is contained in splits into two disjoint conjugacy classes in if and only if its cycle type consists of distinct odd integers. If not, it remains a conjugacy class of .
Thus, the conjugacy classes of are
By Theorem 19, we then know that there are four irreducible representations of , and the squares of their dimensions sum up to .
Recall the character table of :
size: |
1 |
6 |
3 |
8 |
6 |
|
|
|
|
|
|
|
1 |
1 |
1 |
1 |
1 |
|
1 |
-1 |
1 |
1 |
-1 |
|
3 |
|
-1 |
0 |
-1 |
|
3 |
-1 |
-1 |
0 |
1 |
|
2 |
0 |
2 |
-1 |
0 |
The trivial representation is of course an irreducible representation, and we see that the character of has norm one:
hence is irreducible. Since on , restricting to gives the same representation. We thus have
size: |
1 |
3 |
4 |
4 |
|
|
|
|
|
|
1 |
1 |
1 |
1 |
|
3 |
|
0 |
0 |
By checking the dimensions, we see that we are missing two one-dimensional representations and . All the elements of have order two, hence the characters there must have order two in (i.e. they are , and all the elements of and have order three, hence the characters must be third roots of unity. Writing , we get
size: |
1 |
3 |
4 |
4 |
|
|
|
|
|
|
1 |
1 |
1 |
1 |
|
3 |
|
0 |
0 |
|
1 |
|
|
|
|
1 |
|
|
|
We now use column orthogonality with the first column to see that both S must in fact be s, and
We then get that , , and .
Column orthogonality between the last two columns gives
so there are two solutions (each giving one of the characters ): . The completed table reads
size: |
1 |
6 |
4 |
4 |
|
|
|
|
|
|
1 |
1 |
1 |
1 |
|
3 |
|
0 |
0 |
|
1 |
|
|
|
|
1 |
|
|
|
The sign representation on restricted to is simply the trivial representation, while and restricted to are both the irreducible three-dimensional irreducible representation.
It remains to decompose the restriction of the two-dimensional irreducible representation to . Since has no two-dimensional irreducibles, this must be the direct sum of two one-dimensional representations. We compute the inner product of with and :
hence .
Problem 62. Decompose into irreducible isotopic components.
Solution:
The character table of reads
size: |
1 |
1 |
2 |
2 |
2 |
|
|
|
|
|
|
|
1 |
1 |
1 |
1 |
1 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Thus
For each irreducible representation , the isotopic component of in is the image of the isotopic projector . For the four one-dimensional representations, we compute :
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
For the two-dimensional representation, the -isotopic component is
Given any of the canonical basis elements , we have
hence the matrix of w.r.t. the basis is
The kernel of this is then spanned by , , , , giving
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
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.
Solution:
-
(a)
We write , where each is a -orbit in . For each , let . Clearly , for all so each is in . Also note that, as the orbits are disjoint each is disjoint and the set is linearly independent. To show it spans let so for all . We can partition this into -orbits to get
and thus for each orbit we have and for each , . Thus all the are the same for all and . The set therefore spans and hence is a basis so .
Functional method:
We write , where each is a -orbit in . For each , let be the function defined through
Noting that , we see that each . Furthermore, since the support of is , and the are all disjoint, the set is linearly independent. We show that it spans : given , we have for all , . In particular, is constant on each , allowing us to write
The set is therefore a basis of , giving , which is the number of -orbits in .
-
(b)
By Lemma 9.4, we have
From Problem 46,
which, when substituted into the above identity, gives
i.e. Burnside’s lemma.