2.7. Lecture 7
2.7.1. Characters
Throughout this section, is a finite group and is a finite-dimensional complex vector space.
Definition 2.7.1.
Let be a finite-dimensional complex representation of . The character of is the function defined by
Remark 2.7.2.
Here we define ( as the sum of the eigenvalues of the matrix (with multiplicities). It is a theorem from linear algebra that this is equal to the sum of the diagonal elements of the matrix of with respect to any choice of basis of
Example 2.7.3.
Let be the trivial representation of on . Then for all .
Example 2.7.4.
Let be the defining representation of . Then
hence , , .
Important: This is easily seen from the previous example, as .
The following lemma is quite important:
Lemma 2.7.5.
Isomorphic representations have the same character.
Proof.
By Problem 1.3.2, if and are isomorphic, then and have the same eigenvalues, hence also the same traces. ∎
It seems that we throw away a lot of information when we go from studying a representation to studying its character; the remarkable thing is that, in fact, the character completely determines the representation. Moreover, there is a lot of structure to the characters and it is often possible to find all of the characters of a group, even when it is not clear how to construct the representations!
Example 2.7.6.
If is a 1-dimensional representation, then is its own character (the trace of a scalar is just itself).
Example 2.7.7.
Let be the permutation representation of . Then
Proof.
Given , consider the matrix of with respect to the standard basis . The -th column of this matrix is . Thus, this column will contribute to the trace if it has a in the -th row (i.e. if ), and zero otherwise. ∎
By a similar argument:
Example 2.7.8.
Let be the regular representation of . Then
Proof.
Let be an enumeration of the elements of ; this forms a basis of . Then for any , we have
for some . The -th column of the matrix of is the coordinate vector of with respect to the choice of basis, i.e. it has a in row , and zeroes elsewhere. This gives a non-zero contribution to the trace (in in that case +1) if and only if is on the diagonal, i.e. . But , so this happens if and only if . ∎
We collect several useful properties of characters in the following proposition:
Proposition 2.7.9.
Let and be finite-dimensional representations of a finite group . Then
-
(i)
.
-
(ii)
and for all .
-
(iii)
-
(iv)
for all .
Proof.
-
(i)
.
-
(ii)
This follows from the linear algebra identity .
-
(iii)
Let be an an eigenbasis of for with eigenvalues , and an eigenbasis of for with eigenvalues . Then is a basis of . This is in fact an eigenbasis for , since
and similarly . All the eigenvalues of are thus given by , hence
-
(iv)
This follows from the fact that for any eigenvector of with eigenvalue , we have
so . Since has finite order, , giving . This then yields
∎
2.7.2. Exercises
Problem 43. Let denote the usual -dimensional irreducible subrepresentation of the permutation representation of on . Compute the character of this subrepresentation.
Problem 44. Let be such that and are both in the same conjugacy class. Show that is real-valued for any representation of .
Problem 45. Let be a representation of a finite group . Show that
-
(a)
.
-
(b)
Problem 46. Let the finite group act on the finite set , and consider the representation as in Definition 1.1.9. Show that