Lecture 16
Problem 86. Let be the irreducible degree 3 character (i.e. ) of such that
Let , with as the subgroup of fixing 6. Compute the character
Solution: We first note the relevant part of the character table of :
Next we determine the conjugacy classes of and their representatives. Note that the only cycle type of distinct odd lengths is 5 + 1, that is, a 5-cycle. So this is the only conjugacy class of that ’splits’ in .
The conjugacy classes and their sizes are given below:
We see that, for each conjugacy class of , is either empty (if is the class of or ), or a single conjugacy class of . In the first case,
and in the second
We obtain
Problem 87. Let , for a prime, and a nontrivial character of .
-
(a)
Compute
-
(b)
By considering , show that
(Recall that if is a non-trivial -th root of unity, we have .)
Solution: Write for the induced character. Since the only conjugacy classes of that intersect are the identity and the -cycles, we see that
if is not a -cycle or the identity. We have
Finally, let . Then the conjugacy class of in contains all the nonidentity elements of , each of which is its own conjugacy class in as is abelian. We therefore have
We have . If , then
by the hint. Therefore
This completes the solution to the first part. For the second part, if we compute we get
This is an integer (because is the character of a representation), so is divisible by , as required.
Problem 88. Let
has 21 elements, and may be expressed as .
-
(a)
Show that is a normal subgroup of .
-
(b)
By considering representations lifted from and induced from , find the character table of .
Solution:
-
(1)
Since is generated by and , in order to show that is normal, it suffices to show that and . Every element of is of the form for some . We then have
hence is normal.
-
(2)
We now determine the conjugacy classes of . As usual, we choose an element, and successively conjugate it by the generators until we have a whole conjugacy class, and then repeat until every element of has been assigned a conjugacy class (cf. Problems 3,4,5):
-
•
is a conjugacy class
-
•
Taking , conjugating with doesn’t do anything. Conjugating with gives . Again, conjugating with does not give any new elements. Conjugating with gives . Repeating gives , so is a conjugacy class.
-
•
Starting with and conjugating with gives . We then have , and , so is a conjugacy class.
-
•
Now taking and conjugating with , we have (using )
Now conjugating by gives
and conjugating by gives
The conjugations of give
and then conjugating :
Conjugating gives
conjugating gives
and finally conjugating gives
so is a conjugacy class.
-
•
Similarly to case iv), for any element of the form , we have
hence all elements of the form are in the same conjugacy class, i.e. the final conjugacy class is
Since , , which has three irreducible representations: apart from the trivial representation, let the one-dimensional be defined through
where . Lifting these to gives three irreducible representations:
size: 1 3 3 7 7 1 1 1 1 1 1 1 1 1 1 1 We are now missing two irreducible representations of , and by counting dimensions, we see that they both must have dimension three.
Since , it has seven irreducible representations, each of which we can induce to . The character formula in our case reads
(where each is a conjugacy class of , and hence ) so the character of is given by
size: 1 3 3 7 7 3 3 3 0 0 Since all the entries of the above are non-negative, this character has positive inner product with the trivial representation of , and is therefore not irreducible (one can quickly see that it is the direct sum of the three one-dimensional irreducible representations). Next we induce the non-trivial representation of given by , where :
size: 1 3 3 7 7 3 0 0 Noting that ), we have
giving so this is irreducible. We see that inducing (defined through ) will give the same representation, whereas inducing will swap the two terms and :
size: 1 3 3 7 7 3 0 0 This completes the table:
size: 1 3 3 7 7 1 1 1 1 1 1 1 1 1 1 1 3 0 0 3 0 0 (One can compute that ; , i.e. .)
-
•