Lecture 20
Problem 99. Decompose into irreducible representations of .
Solution: Clearly as making a choice of coset representatives for and then for gives us a set of coset representatives for and induction is independent of coset representation, by Problem 81. Thus, by Theorem 20.4,
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Problem 100. Let be a -homomorphism between two representations and . Show that
Solution: Recall that as vector spaces so we simply need to show that the -action is preserved. Define
which is an isomorphism of vector spaces. Let , then
for all . Thus is a -homomorphism and hence a -isomorphism.
Problem 101.
Show that the maps and defined during the proof of Theorem LABEL:branch are -homomorphisms.
Solution: First we note that is defined on the basis of so it is clearly linear. Let and . We note that and both have in the same row as all elements of leave invariant. Thus we have , when and are in different rows and
otherwise. Thus is an -homomorphism.
Note that is a restriction of a linear map, hence linear and thus, by induction, each is linear. Let , for . Then, as is a subrepresentation and
for all . Thus is a -homomorphism. For the inductive step suppose is an -homomorphism and let , for . Then, as is a subrepresentation and
for all . Thus, by induction, is an -homomorphism for each .
Problem 102. Let and be two finite-dimensional representations of a group . Show that if , then is a subrepresentation of .
Solution: Let . We may therefore write for some . For any , we have
where we used that for the second equality. The above computation shows that is - invariant, and thus is a subrepresentation of .
Problem 103.
-
(a)
Let be such that for some . Show that is diagonalisable.
-
(b)
Let be a finite-dimensional representation of a finite group . Given , show that there is an eigenbasis for .
Solution:
-
(a)
Since , we have The minimal polynomial of must therefore divide , and hence factors as a number of distinct linear factors . This implies that is diagonalisable.
Alternatively, write in Jordan normal form:
where each is a Jordan block:
Thus, taking the -th power, we have
We must therefore have
for all . Writing where is the matrix with ones on the superdiagonal, and all other entries zero, we have
Note now that has ones on the -th superdiagonal, and all other entries zero (and ). This means that cannot be written as a linear combination of the other s; and so the only way for to hold is if . If all Jordan blocks are matrices then is diagonalisable.
-
(b)
then follows from (a) by choosing a basis of and considering the matrix of with respect to this basis. Since is of finite order, so is its matrix w.r.t. any choice of basis (cf. Problem 19), hence the matrix of is diagonalisable by part (a). Using the change of basis formula to change the basis to that basis given by the diagonalisation results in the claimed eigenbasis of .
Problem 104. Use Lemma 14 (see Problem 25) and Corollary 7 (proved in Lecture 5) to prove the following:
Proposition 15. Let be a finite-dimensional representation of a finite group . For any irreducible representation of and any decomposition of into irreducible subrepresentations, the number of components in the decomposition that are isomorphic to is equal to .
Why does this complete the proof of Theorem 13?
Solution:
By the first part of Theorem 13, given a representation , we may write it as a direct sum of irreducible subrepresentations:
where each is irreducible. Given an irreducible representation , we then have
where Lemma 14 (i) was used for the second equality. Since the dimension of a direct sum is the sum of the dimensions, this gives
By Corollary 7, if , and zero otherwise, hence
This proves the proposition. The last part of Theorem 13 follows since the right-hand side of the above equation is independent of the choice of decomposition of into irreducible subrepresentations.
The following problems give an alternative proof of Maschke’s Theorem (Theorem 10): Recall that an inner product on a vector space is a map such that
-
(i)
for all (conjugate symmetry).
-
(ii)
for all , (linearity in the first argument).
-
(iii)
if (positive-definiteness).
Recall that the standard example on is as follows:
Problem 105. Let be a finite-dimensional vector space. Show that there exists an inner product on .
Solution: Let be any basis of . We define by
This is well-defined due to being a basis: any pair of vectors in can be written in a unique way as a linear combination of the s.
It remains to verify that this is indeed an inner product:
-
(i)
-
(ii)
|
|
|
|
|
|
-
(iii)
with equality if and only if all are zero, i.e. .
Problem 106. Given a finite-dimensional representation of a finite group , and an inner product on , show that defined through
is an inner product.
Solution:
We verify that is an inner product:
-
(i)
-
(ii)
|
|
|
|
|
|
-
(iii)
For each , we have (since is an inner product). Each is invertible, so if and only if , hence
as the sum of a collection of non-negative numbers is non-negative, and equality is obtained if and only if .
Letting , , and be as in Problem 28, show
Problem 107. for all , .
Solution:
|
|
|
|
|
|
Problem 108. If is a subrepresentation of , then is, as well, where
Recalling that , this shows that , proving Theorem 10!
Solution: Given any and , we need to show that . For any , we have
Since is a subrepresentation, . By assumption, , hence
, giving
hence .
Problem 109. Let be an orthonormal basis of with respect to (i.e. equals one if and zero otherwise). Show that
the matrix representation of with respect to this basis satisfies
(Here denotes the conjugate transpose of the matrix .) Conclude that the matrix of is unitary. Use the spectral theorem to give an alternative solution to Problem 14 (a)!
Remark: a representation of of a group on an inner product space (with inner product ) is called unitary if for all . Problem 28 shows that we may always assume that a finite-dimensional representation of a finite group is unitary.
Solution: Since the form an ON-basis, the matrix of with respect to this basis is given by the formula
(here runs through the rows, and the columns). The conjugate transpose of this matrix is then given by the formula
which is precisely the formula for . We have thus shown that
Taking the conjugate transpose of both sides, together with the identity gives that is unitary.
This problem gives an alternative way to show that a finite-order matrix (say, of order ) is diagonalisable: consider the finite group . Form a new invariant inner product on by
As seen above, choosing an orthonormal basis of with respect to , and using the change of basis formula to compute the matrix of with respect to this basis gives a unitary matrix . The spectral theorem applies to unitary matrices, allowing us to write and then .
Problem 110. In lecture 4 we showed that any irreducible representation of ( odd) must have and as given in the table below:
Rep |
|
|
|
|
1 |
1 |
1 |
|
1 |
1 |
-1 |
,
|
2 |
|
|
Use Theorem 16 (ii) to verify that the table contains no redundancies, and that every entry must in fact define a representation of .
Solution: By Theorem 16 (ii), . Summing the dimensions squared of the entries of the table gives Since we proved in class that any irreducible representation of must have and as given by the table. If any of the entries of the table were isomorphic, or were not legitimate representations, we would be able to remove these from the list to obtain a new list that had precisely one representative from each isomorphism class of each irreducible representation. However, the sums of squares of dimensions of this new list could not possibly be equal to , as it was obtained by removing entries from our current list. Thus it is not possible to remove any entries of our table and still have a representative of each isomorphism class.
Problem 111. Let be a representation of a subgroup , the induced representation of from to , and a representation of . Given , define by
where is the representative such that . Show that is a linear map from to .
Solution: We first verify that is a linear operator: for and ,
|
|
|
|
|
|
|
|
hence . We next observe that for and , and we have
hence is a linear map from to . We now verify that this map sends to : let . Then for any and , we have
|
|
|
|
|
|
|
|
i.e. is an -intertwiner, as required.
Problem 112. Show that , where is the polytabloid
Use this to conclude that is a subrepresentation of .
Solution:
We have
Using Problem 79, we may rewrite this as follows:
This shows that for each polytabloid and permutation , . The vectors span , hence is closed under the action of , and is therefore a subrepresentation.
Problem 113. Show that is a unitary representation of with respect to the inner product
Solution:
Since each acts as a bijection on , we have
This gives
|
|
|
|
|
|
as desired.
Problem 114. Given , define by
Show that is self-adjoint with respect to , i.e.
Solution:
Since spans , by linearity it suffices to show that for all . By the definition of and Problem 80, we then have
|
|
|
|
|
|
|
|
|
|
|
|
the second to last equality holding since is a subgroup of .
Problem 115. (Challenging!) Given , show that
for all . Hint: consider for some . Split into two cases: (i) has the numbers in some row and has in some column. Break the sum over into a sum over cosets in of . Show that in this case . (ii) All pairs of numbers in the rows of lie in different columns of . Find so that , and hence .
Solution: Following the hint: let be such that has the numbers in a single row, and has in a single column. By the definition of , we have . Let . We now let be a set of representatives for , i.e.
Since has and in the same row, . We can now compute:
|
|
|
|
|
|
|
|
We now consider the remaining case, i.e. for any pair of numbers in a single column of , and are in different rows of . Letting the first column of be , we let be a permutation that moves each into the row that it is in in , and fixes all other elements. Similarly, let be a permutation that permutes the elements of the second column into the rows they occupy in , a permutation of the third column of , and so on. Then , and since each is just a permutation of column entries, . We now compute
|
|
|
Problem 116. Let be a subrepresentation of . Using Problem 82, show that if there exists and such that , then .
Solution: Since is a linear combination of operators (), and is a subrepresentation of , for all and . By Problem 82, for some . If and (as above) are such that , then . Again using the fact that is a subrepresentation, we then have that . But by definition, .
Problem 117. Let be a subrepresentation of . Using Problem 81, show that if for all and , then .
Solution: The vectors span , so in order to show that (under the assumption for all and ), it suffices to show that . Using the definition of , we have , hence by Problem 81,
Problem 118. Use Problems 83 and 84 to show that is irreducible.
Solution:
Letting be a non-zero subrepresentation of . Then is also a subrepresentation of . By Problems 83 and 84, either or . Since (and is non-zero), we cannot have , hence . This gives , i.e. .
Problem 119. Let be a representation of a group . Denote the space of degree polynomials with complex coefficients in variables by . Let denote the representation of defined through
Show that
(Here denotes the one-dimensional trivial representation.)
Problem 120. Let be an irreducible finite-dimensional representation of a group , and an irreducible finite-dimensional representation of a group .
-
(a)
Show that is an irreducible representation of , where
for all pure tensors and .
-
(b)
Challenging! Assuming and are finite, show that every irreducible representation of is of the form
for irreducible representations and of and , respectively.
Solution:
-
(a)
Given , let be an eigenbasis of for with eigenvalues , and an eigenbasis of for , with eigenvalues . Then is a basis of , and
is therefore in fact an eigenbasis, hence
We can now compute
|
|
|
|
|
|
|
|
as since and are irreducible.
-
(b)
Here we will show that the set is a complete set of irreducible representations of . Firstly, note that all the representations are non-isomorphic: if , then there exists such that hence for any ; similarly for two non-isomorphic irreducible representations , of . This shows that all are non-isomorphic. Next, we show that these are all the irreducible representations of by way of the sum of squares formula
|
|
|
|
|
|
so there are no other irreducibles.
Problem 121. Let be a representation of a finite group . Show that
(Here denotes the one-dimensional trivial representation.)
Solution: The polynomial is the characteristic polynomial of . Letting be an eigenbasis of w.r.t. , with eigenvalues , we have
By Vieta’s formulas, the coefficient in front of is given by
On the other hand, for each , the set forms a basis of , and is in fact an eigenbasis for :
Thus,
which was what we wanted to prove.