Complete reducibility (Corollary 23.7.4)
promises that every complex representation of a finite
group breaks into irreducible pieces, but the promise is
not constructive: it says nothing about which pieces, or
how many of each. This section produces a small table of
numbers that answers both questions. To each
representation we attach one function , its character,
and we prove that the characters of the irreducible
representations are an orthonormal
basis of a space of functions we can compute
the dimension of by counting. Everything a complex
representation is, up to equivalence, is then read off
from one row of numbers.
Throughout, is
a finite group and the field is . The hypothesis
matters twice over: never divides , so Theorem 23.7.3 applies;
and is
algebraically closed, so Schur’s lemma (Theorem 23.4.1) gives
that the only operators commuting with an irreducible
representation are the scalars. The theory over a field
whose characteristic divides — modular
representation theory — is a different subject, and this
book does not enter it.
Conjugacy
classes
Before characters we need the sets they are constant
on. The book has met them only in an exercise of Section
1 (Exercise (C1: The center of a group algebra)),
so we build them here.
Definition
23.8.1 (Conjugate elements, conjugacy
class)
Let be a
group. Elements are conjugate if for
some . The conjugacy class of
is
Conjugacy is an equivalence relation (Definition 0.5.2):
gives
reflexivity; if , then , which gives symmetry
using Theorem 0.10.1; and if
and
, then
,
which gives transitivity. Hence the conjugacy classes
are the equivalence classes, and by Theorem 0.5.2 they
partition : every element lies in
exactly one class. We write for the number of
conjugacy classes of , a finite number since
is finite.
In an abelian group for every
, so every class
is a single element and . At the other extreme, always.
Example
(The conjugacy classes of the symmetric group on three
letters)
Find the conjugacy classes of .
Solution. First a rule that does
the work. For and a cycle ,
Both sides are permutations, so it is enough
to check they agree at every point. At : the left
side applies to get , then the cycle to
get
(indices read cyclically), then to get ; the
right side does the same in one step. At a point with : the left side gives back, and so
does the right side, since is not among
the by
injectivity. Every point of is for exactly one
, so the two
agree.
So conjugation relabels the entries of a cycle. In
, conjugating
by the six
elements produces ,
and as runs
over the pair
runs over all three two-element
subsets; so . Conjugating gives , which is or according to
the cyclic order; both occur, for and , so . The three classes are of sizes , which add to as a partition must. So for — the same number as
the three irreducible complex representations found in
Example (The irreducible complex representations of the symmetric group on three
letters). That is no coincidence, and the theorem
explaining it is the main result of this section.
The
character of a representation
A representation on is a whole family of
matrices, and the matrices change when the basis does.
To compare representations we want something attached to
that does not
move. Chapter 2 already supplies the candidate: the
trace of an operator does not depend on the basis (Definition 4.5.2),
and similar operators have equal traces.
The character of a representation records one
number per group element: the trace of the operator that
element acts by.
Definition
23.8.2 (Character)
Let be a
representation of a finite group on a finite-dimensional
complex vector space . The
character of is the function
Its degree is . A
character is irreducible if is irreducible (Definition 23.7.4).
In words: a character is a list of complex
numbers, one per group element, obtained by computing
traces. It throws away a great deal — the whole matrix
becomes one number — and the content of this section is
that it throws away exactly the information we did not
want.
Examples. Let be finite.
- The trivial representation has for every . We write for
the constant function .
- The sign representation of has .
- The permutation representation of on has , the number of fixed
points. Indeed the matrix of in the
standard basis has -entry equal to exactly when , and otherwise.
- The regular representation on has and for . The matrix of in
the basis has -entry equal to
exactly when
, that is,
when by
cancellation (Theorem 0.10.1).
One fact about finite groups is needed first, and
Chapter 0 did not record it. It costs four lines, and
Section 9 will use it constantly.
Lemma
23.8.1 (Order of an Element)
Let be a
finite group and . Then there is a least integer with , called the
order of . Moreover if and only if
divides , and is a subgroup of with exactly elements.
Proof. The
elements cannot all be distinct, so
for some
.
Canceling (Theorem 0.10.1) gives
with
. Hence
the set of positive integers with is non-empty, and
it has a least element .
Suppose , so . Divide: with . Then and minimality of forces , that is . Conversely
gives
, so .
Consequently
depends only on
modulo , so , and those elements are distinct
because whenever . Finally ,
and , so is a
subgroup (Definition 0.10.2).
The next proposition collects the properties we use
constantly. Chapter 4’s trace results do all the
work.
Proposition
23.8.2 (Basic properties of characters)
Let be a
representation of a finite group on a complex space
, with character
.
Then:
- (a) ;
- (b) is a class
function:
for all ;
- (c) equivalent
representations have equal characters;
- (d) if with both
summands -invariant, then ;
- (e) for every , and .
Idea. Parts (a)–(d) are the four
standard facts about the trace read in this setting: the
trace of the identity, invariance under conjugation,
invariance under similarity, and additivity over a block
decomposition. Part (e) is different: it needs to know
that is
diagonalizable with eigenvalues on the unit circle,
which comes from
having finite order.
Proof.
(a) (Theorem 0.10.3), and
in (Theorem 4.5.3).
(b) , where the second equality is (Theorem 4.5.3)
applied with and .
(c) If for an isomorphism (Definition 23.7.3), the
same computation as in (b) gives .
(d) Choose a
basis of formed
by a basis of
followed by a basis of . Since both are
invariant, the matrix of in this basis is
block diagonal, with the matrices of and on the
diagonal. The diagonal entries of the big matrix are
those of the two blocks, so the traces add (Definition 4.5.2).
(e) We may assume
, since
otherwise is
the zero function and both claims are clear.
Finite order. By Lemma 23.8.1 there is an
integer
with ,
namely the order of .
Diagonalizability. Then , so the polynomial annihilates . Over it equals with , a product of
distinct linear factors (Example (Roots of Unity)).
By Theorem 9.8.2, (c)
(a),
is
diagonalizable, and every eigenvalue satisfies , hence
.
Conclusion. Let be the diagonal entries in an
eigenbasis, . Then . In the same basis is diagonal with entries , and
gives . Hence . Finally
by
the triangle inequality for complex numbers (Theorem 0.6.4),
applied repeatedly. This proves the proposition.
Quick check. A representation of
has character
with and for some
. What is
wrong?
Solution. Nothing can have such a
character: by Proposition 23.8.2 (e),
for every , and . The bound says
a character is largest, in absolute value, at the
identity.
Class
functions and their inner product
Part (b) of Proposition 23.8.2 says
every character lives in one particular space of
functions, and that space is small enough to be a useful
home.
Definition
23.8.3 (Class function)
Let be a
finite group. A function is a class
function if for
all ;
equivalently, if
is constant on each conjugacy class. The set of class
functions is written .
The functions form a complex vector space under the
pointwise operations (Example (The Standard Vector Spaces)
(d)). The zero function is a class function, and sums
and scalar multiples of class functions are class
functions, so is a
subspace of it (Theorem 1.2.1). Its
dimension is exactly what we want to count.
Non-example by minimal change. On
, the function
that is at and elsewhere is
not a class function: for , so would have to take the
same value at , and it takes there. Changing to be on all
three transpositions repairs it; that is the
indicator function of a whole class, and those are the
building blocks below.
Proposition
23.8.3 (The class functions have dimension the
number of classes)
Let be a
finite group with conjugacy classes . For each
let
be the function that is on and elsewhere. Then
is a basis of , and
.
Proof. Each is constant on
every class — it is on and on the others — so it
lies in .
Spanning. Let and pick for each
. Every lies in exactly
one class (the
classes partition ), and then while . So .
Independence. Suppose .
Evaluating at gives , since every other vanishes there.
Hence the list is a basis and .
Now the pairing. It is the standard inner product of
, with the coordinates indexed by and normalized by so that
the trivial character has length .
Definition
23.8.4 (The inner product of class
functions)
For functions on a finite group , set
This satisfies (IP1)–(IP3) of Definition 11.1.1
on the space of all functions , hence on the
subspace :
linearity in the first slot and conjugate symmetry are
immediate from the formula, and
whenever ,
since some term is positive and none is negative. So
is a
complex inner product space of dimension , and all of Chapter 11
is available in it.
When and are class
functions the sum can be shortened to one term per
class: with and ,
(23.8.1)
That is the formula used for hand computation, and it
is the only place the class sizes enter.
Two
averaging lemmas
Both proofs of orthogonality run through the same
device as Maschke’s theorem: average over , and the average is
-invariant. Here
we also need its trace.
Lemma
23.8.4 (The average of a representation is the
projection onto the fixed space)
Let be a
representation of a finite group on a complex space
, and set Then is a subspace,
is a projection
with ,
and
Proof. is an intersection of
subspaces, hence a subspace (Theorem 1.2.2).
Fix .
Then ,
because is a bijection of (Theorem 0.10.1) and so
only reorders the terms. Hence for
every , giving
. Conversely, if then . So is the identity on
; combined with
this gives
and .
Thus is a
projection (Definition 4.5.1)
of rank ,
and by Theorem 4.5.4,
the field being . On the other hand
the trace is linear (Theorem 4.5.3),
so . This proves the
lemma.
Lemma
23.8.5 (The trace of a two-sided
multiplication)
Let and be finite-dimensional
vector spaces over a field , let and , and let
Then
is linear and .
Idea. Write everything in
coordinates. In the basis of given by the
matrix units , the map sends
to a matrix
whose -entry
is ;
adding those diagonal coefficients factorizes as a
product of two sums.
Proof. Linearity of is immediate from
bilinearity of composition. Fix bases of and and identify with , where
and
(Theorem 4.1.4);
let and be the matrices of and . Under the
identification
becomes .
Let be the matrix unit with a in position and zeros
elsewhere — the rectangular version of the matrix units
of Lemma 23.2.1; these matrices form a basis.
By Definition 0.9.9,
In the basis , the
coefficient of in is the
-entry of
, namely
. These
coefficients are the diagonal entries of the matrix of
, so by Definition 4.5.2,
and , by Definition 4.5.2.
This proves the lemma.
Now put the two together. Given representations on and on , make act on the space of linear maps
by
Proposition
23.8.6 (The representation on the space of
linear maps)
Let
be representations of a finite group on complex spaces . Then above is a
representation of
on , its
character is , and its
fixed space is the space of maps intertwining and (Definition 23.7.3); for
and this is the
commutant of Definition 23.4.1.
Consequently
(23.8.2)
Proof. A representation.
Each is
linear in , and
, using the
homomorphism property of and and Theorem 0.10.1 for the
inverse of a product. Taking shows is invertible with
inverse .
Its character. Apply Lemma 23.8.5 with and
:
the last step by Proposition 23.8.2
(e).
Its fixed space. means , and composing with on the right
turns this into . So the fixed space is exactly .
The count. Apply Lemma 23.8.4 to and substitute the
character just computed. This proves the
proposition.
Orthogonality of the irreducible characters
Everything is now in place. Schur’s lemma converts
the right-hand side of Eq. 23.8.2 into a or a .
Theorem
23.8.7 (Orthogonality of Irreducible
Characters)
Let be a
finite group and let on and on be
irreducible complex representations of
. Then In particular the characters of pairwise
inequivalent irreducible complex representations form an
orthonormal list in .
Idea. By Eq. 23.8.2,
counts the dimension of the space of intertwining maps
. Schur’s
lemma says that space is when the two are
inequivalent, because a non-zero intertwiner would be an
isomorphism. When they are equivalent, fix one
isomorphism ;
every other intertwiner differs from it by an
intertwiner of
with itself, which over is a scalar. So the
space is the line .
Proof. By Eq. 23.8.2, , which is a non-negative
integer. It remains to compute that dimension.
Case 1: . By Theorem 23.7.1, and are irreducible -spaces; and since
the condition for all extends by
linearity to all of , the members of
are
exactly the -maps (Definition 23.4.1). Let
be non-zero. By Theorem 23.4.1 (a) it is
an isomorphism, making and equivalent (Definition 23.7.3) — a
contradiction. Hence and
the inner product is .
Case 2: . Fix an isomorphism , so
for all . Applying on both sides
gives , so intertwines
with . Let and set
. Then for every , so
commutes with every . Since is irreducible and
the field is algebraically closed, Corollary 23.4.3 gives
for some , and hence . Therefore ,
which has dimension because .
The last sentence of the statement follows: distinct
members of a list of pairwise inequivalent irreducibles
pair to , and each
pairs with itself to . This proves the
theorem.
Two consequences come for free, and both are used in
every computation below.
Corollary
23.8.8 (Irreducibility criterion)
Let be a
complex representation of a finite group on , with
character .
Write with each irreducible (Corollary 23.7.4), and
let be the distinct characters occurring
among the , with
multiplicities . Then In particular if
and only if is
irreducible, and two complex representations of with the same character
are equivalent.
Proof. Repeated use of Proposition 23.8.2 (d)
gives , and grouping
equal terms gives . Distinct characters come from
inequivalent representations, since equivalent ones have
equal characters (Proposition 23.8.2 (c));
so by Theorem 23.8.7 the are orthonormal,
and and, expanding the pairing in the first
slot and then in the second, .
If is
irreducible then and , so .
Conversely, a sum of squares of positive integers equals
only when there
is a single term equal to ; then and is
irreducible.
For the last claim, suppose and have the same
character. Every irreducible character of then has , so each
irreducible occurs with the same multiplicity in both
decompositions. So the two decompositions into
irreducibles use the same irreducibles with the same
multiplicities, and the summands can be matched in pairs
with equal characters. Two irreducible summands with
equal characters are equivalent: were they inequivalent,
Theorem 23.8.7 would make
their characters orthogonal, hence unequal, since an
irreducible character pairs with itself to and not to . The direct sum of
those equivalences is an isomorphism intertwining
and . This proves
the corollary.
Solution. From Example (The irreducible complex representations of the symmetric group on three
letters) the matrices give , and ; by Proposition 23.8.2 (b)
these three values determine on
all of , the
classes being those of Example (The conjugacy classes of the symmetric group on three letters).
Using Eq. 23.8.1 with class
sizes ,
so the representation is irreducible.
For the permutation representation,
counts fixed points: at , at a transposition,
at a -cycle. Then So , and
by Corollary 23.8.8 the
permutation representation is the direct sum of the
trivial and the standard one. That matches the splitting
found by hand in
Example (The irreducible complex representations of the symmetric group on three
letters), and it was found here without looking at a
single vector.
The
characters span the class functions
Orthonormality already bounds the number of
irreducible representations: an orthonormal list in
is
independent (Theorem 11.1.4), so
there are at most
of them up to equivalence. The next theorem shows there
are exactly . It
is the deepest statement of the section, and its proof
is the third and last averaging argument: this time we
average the group elements themselves, weighted by a
class function.
Theorem
23.8.9 (The Irreducible Characters Are a Basis
of the Class Functions)
Let be a
finite group with
conjugacy classes. Then has exactly irreducible complex
representations up to equivalence, and their characters
form an orthonormal
basis of .
Idea. Suppose a class function
is orthogonal to
every irreducible character; we must show . Build from the operator on any representation . ① Because is a class function,
commutes with
every —
conjugating by permutes the
terms and leaves the coefficients alone. ② So on an
irreducible it
is a scalar, and its trace, which is , forces that scalar to be . ③ Complete
reducibility (Corollary 23.7.4) spreads
this to every representation. ④ Apply it to the regular
representation and evaluate at : the result is
, and the are a basis.
Proof. Orthonormal lists are
independent (Theorem 11.1.4) and
(Proposition 23.8.3), so
by Theorem 23.8.7 any list
of pairwise inequivalent irreducible representations has
at most members.
Choose such a list with as large as possible;
by maximality every irreducible complex representation
of is equivalent
to some .
Write , and let , using Proposition 23.8.2
(b).
Let , the orthogonal complement of in (Definition 11.3.1),
so is a class
function with ,
hence also , for every . For
any representation of on , define
Claim. Claim 1.
commutes
with for
every .
Proof. Fix . Then The map is a bijection , with inverse
.
Substituting , so that , the sum becomes .
Since is a class
function, , so the sum is . Multiplying on
the right by gives the
claim.
Claim. Claim 2. If
is
irreducible, then .
Proof. By Claim 1 and Corollary 23.4.3, over
the algebraically closed field we get
for some . Taking traces and using linearity of the
trace (Theorem 4.5.3),
Now
is equivalent to some , so by Proposition 23.8.2 (c),
and . Since , .
Claim. Claim 3.
for
every representation .
Proof. We may assume . By Corollary 23.7.4, with each invariant and irreducible.
Each maps
into , hence so does , and its
restriction to
is , which is by Claim 2. So vanishes on each
, hence on their
sum .
Now apply Claim 3 to the regular representation on
, where . Evaluating at the basis vector
, The are a basis of
, so every
coefficient vanishes: , that is
, for all
. Hence .
By Theorem 11.3.2,
. So
is an orthonormal spanning list, hence a basis, and
by Proposition 23.8.3.
Finally, inequivalent irreducibles have different
characters, since orthonormality gives for ; so the characters correspond
to the
equivalence classes of irreducible representations. This
proves the theorem.
Corollary
23.8.10 (The sum of the squares of the
degrees)
Let be a
finite group and let on be a
complete list of pairwise inequivalent irreducible
complex representations of , one for each of the
conjugacy classes
(Theorem 23.8.9). Then
each occurs
in the regular representation with multiplicity exactly
, and
Proof. The regular character is
and for , as computed after Definition 23.8.2. Hence
the value
being a real number (Proposition 23.8.2 (a)).
By Corollary 23.8.8 this
inner product is the multiplicity of in , so
. Evaluating at gives .
This is Corollary 23.6.2, the
count of the structure theorem, applied to
: the two
proofs are different and the answer is the same.
Corollary
23.8.11 (Orthogonality of the columns)
Let be a
finite group with conjugacy classes ,
representatives and sizes , and irreducible characters
. Then for all ,
Idea. Theorem 23.8.9 makes the
table of character values a square
array. Rescale it so that orthonormality of the rows
says the matrix is unitary; then its columns are
orthonormal too, because a one-sided inverse of a square
matrix is two-sided.
Proof. Let have
entries ; the
square root is a positive real. By Eq. 23.8.1 and Theorem 23.8.7, which is for and otherwise. Hence . By Theorem 3.4.5,
as
well, so for all equals
when and
otherwise. For
this gives
,
and for it
gives . Conjugating
the second identity, which is a sum of complex numbers,
gives the stated form. This proves the corollary.
Two
character tables
The character table of is the array whose
-entry is
: one
row per irreducible character, one column per conjugacy
class. By Theorem 23.8.9 it is
square, by Theorem 23.8.7 its rows
are orthonormal, and by Corollary 23.8.11 its
columns are orthogonal.
Example
(The character table of the symmetric group on three
letters)
Write down the character table of and verify every
orthogonality relation.
Solution. By Example (The conjugacy classes of the symmetric group on three letters)
there are
classes, with representatives , , and sizes . So there are
three irreducible complex representations (Theorem 23.8.9), and Example (The irreducible complex representations of the symmetric group on three
letters) produced three: the trivial, the sign and
the standard one. Their characters, from the definitions
and the traces computed in Example (Checking the standard representation by its character),
are:
| class size |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Degrees. , as Corollary 23.8.10
requires.
Row orthogonality, from Eq. 23.8.1 with weights
and divisor
. All values are
real, so conjugation does nothing:
Column orthogonality, from Corollary 23.8.11, with
no weights this time: Every relation holds.
Example
(The character table of a cyclic group of order
four)
Write down the character table of and verify the
orthogonality relations.
Solution. The group is abelian, so
every conjugacy class is a single element and . By Theorem 23.8.9 there are
four irreducible complex representations, and Example (The irreducible complex representations of a cyclic group)
produced four, all of degree : ,
using . Their degrees satisfy .
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Row orthogonality. For characters of degree
, , so If
every term is and
the sum is .
If , put
, so and ; then , and dividing by gives . For
instance and .
Column orthogonality. Every class has size
, so Corollary 23.8.11
predicts down the
diagonal and off
it. The same geometric sum settles every one of them:
column against
column gives
, which is when , and is otherwise by the
computation just made, read with . Three of them
written out. Column against itself: . Column against : the entries of
column are
and
those of column
are ,
so the sum is . Column
against : .
Read as a matrix, the table is , which up
to the factor
is the
Fourier matrix of Example (The Fourier matrix of size four).
That is not a coincidence, and Section 09 explains
it.
Warning. The character
table does not determine the group. Two
non-isomorphic groups can have identical character
tables. The standard witness is a pair of groups of
order : the eight
symmetries of a square (four rotations and four
reflections), and the group sitting inside the quaternions of Definition 14.12.3 under
multiplication. Both have five conjugacy classes and
degrees , and their tables agree entry for entry, yet
the groups are not isomorphic. This is stated on
credit and not proved here; nothing below
depends on it. What the character table does
determine is every complex representation of the group,
up to equivalence (Corollary 23.8.8).
Exercises
A. Check your
understanding
Exercise
(A1)
- (a) Define the
character of a representation, and state why it does not
depend on a choice of basis.
- (b) State the
orthogonality relation for irreducible complex
characters.
- (c) Determine
whether the following is true: “if is a character of
then .” Justify your answer.
- (d) A group of order
has exactly four
conjugacy classes. Determine the degrees of its
irreducible complex representations.
- (e) Explain why the
number of irreducible complex representations of an
abelian group is
.
Solution.
- (a)
(Definition 23.8.2). The
trace of an operator is computed from its matrix in any
basis and the answer is the same for all of them (Definition 4.5.2),
so
depends only on .
- (b) For irreducible
complex representations of a finite
group,
is if and
otherwise (Theorem 23.8.7).
- (c) False. See the
warning after Proposition 23.8.2: for
the standard representation of , but . It is true precisely for characters
of degree .
- (d) Four classes
means four irreducible representations (Theorem 23.8.9), with
degrees satisfying (Corollary 23.8.10). Every
group has the trivial representation, so we may take
and need
with each . The squares available are , since . A
triple containing a has its other two terms
summing to , so it
is ,
which works; and a triple with no is one of , , and , none of them
. So the degrees
are .
- (e) In an abelian
group ,
so every conjugacy class is a singleton and ; now
apply Theorem 23.8.9.
B. Practice
Exercise
(B1: A character computed and decomposed)
Let be
the permutation matrix of , so that
(Definition 3.4.2),
and let be the
representation of on given by .
- (a) Compute the
character of on
the three conjugacy classes.
- (b) Decompose into
irreducibles.
Solution.
(a) This is the
construction of Proposition 23.8.6 with
both representations equal to the permutation
representation on
. So its
character is .
From Example (Checking the standard representation by its character),
on the classes of , , , so .
(b) With weights
and divisor
: So , and the degrees check:
. As a check on the arithmetic,
, as Corollary 23.8.8
requires. In particular : the -equivariant operators
on form a
plane, spanned by the identity and the all-ones
matrix.
Exercise
(B2: Which of these are characters?)
Let ,
with classes ordered , , of sizes . Determine which
of the following class functions are characters of
complex representations of . Justify your
answer.
- (a) ;
- (b) ;
- (c) ;
- (d) .
Solution. A class function is a
character exactly when it is a non-negative
integer combination of , and , by Corollary 23.7.4 and Proposition 23.8.2 (d);
the coefficients are the inner products .
(a) , , . All non-negative
integers, and matches the degree. Yes: it
is the character of the direct sum of the trivial, the
sign and the standard representation, equivalently of
the direct sum of the permutation representation and the
sign representation, since .
(b) Inner
products as
computed in Example (Checking the standard representation by its character).
Yes: the permutation
representation.
(c) , . A negative
multiplicity is impossible, so no. (It
is a difference of characters, called a virtual
character, but not a character.)
(d) , which is not
an integer. So no: it is not even a
combination of the three irreducible characters with
integer coefficients, let alone non-negative
ones.
Exercise
(B3: Degree-one characters of a cyclic group)
Let .
- (a) Write down the
character table.
- (b) Verify and by direct computation.
Solution.
(a) The group is
abelian of order ,
so there are six classes, six irreducible characters,
all of degree ,
given by with (Example (The irreducible complex representations of a cyclic group)).
The table has -entry , with .
(b) Here using . And .
C. Going deeper
Exercise
(C1: Counting fixed points)
Let be a
finite group acting on through a homomorphism ,
and let be the corresponding
permutation representation on , where is the
permutation matrix of Definition 3.4.2
(so by Lemma 3.4.7
(a)).
- (a) Prove that
equals the average number of fixed points of the
permutations , and also
equals .
- (b) Deduce that for
every , the
average number of fixed points of a permutation in is exactly .
- (c) For with , verify (a)
numerically.
Solution.
(a) By the
computation after Definition 23.8.2, is the
number of with
.
Hence is exactly the average of those counts. By Lemma 23.8.4 applied to
, the same
quantity is .
(b) Take and . A vector
fixed
by every
has for
all , by
taking the
transposition ; conversely every vector with equal
coordinates is fixed. So , of dimension (for this is itself). By (a) the
average number of fixed points equals that dimension,
namely .
(c) For , on
classes of sizes , so the average number of fixed points is
. Directly: fixes three points,
each of the three transpositions fixes one, and each of
the two -cycles
fixes none, giving . And by
(b). The three agree.
Exercise
(C2: Degree-one characters form a group)
Let be a
finite group and let be the set of
characters of degree of complex
representations of . (For abelian this group is the
subject of Section 09.)
- (a) Prove that the
pointwise product of two degree-one characters is a
degree-one character, and that is a group under
this product.
- (b) Prove that ,
the number of conjugacy classes, with equality if and
only if is
abelian. Hint: use Corollary 23.8.10 in one
direction and Corollary 23.4.4 in the
other.
Solution.
(a) A degree-one
character is a homomorphism (the representation
is the scalar it multiplies by). If are two of
them then , using commutativity
of ; so is again a
homomorphism into , hence
a degree-one character. The product is associative
because multiplication in is; is
an identity; and is a homomorphism and satisfies
. So is a group (Definition 0.10.1).
(b) Degree-one
characters are irreducible (a one-dimensional
representation has no non-trivial invariant subspace)
and pairwise distinct elements of are inequivalent
representations, since for degree one, equivalence means
equality. So
is a subset of the irreducible characters
(Theorem 23.8.9) and .
Equality says every irreducible character has degree
. If is abelian then is a commutative
algebra, so every irreducible -space is
one-dimensional by Corollary 23.4.4; by Theorem 23.7.1 those are
exactly the irreducible representations of . Conversely, if every
irreducible has degree then by Corollary 23.8.10, so
every conjugacy class is a singleton; that is, for all
, which says
is abelian.
Exercise
(C3: The second orthogonality relation)
Let be a
finite group with irreducible complex characters .
- (a) Prove that for every
.
- (b) Deduce that
if and only if the class of is all of , and that this happens
only for the trivial group. Hint:
always.
- (c) For compute at each of the three
classes and check (a).
Solution.
(a) This is the
diagonal case
of Corollary 23.8.11, with
a
representative of its own class and .
The value is independent of the representative chosen,
as it must be, since characters are class
functions.
(b) By (a), the
sum equals
exactly when , that is, when the
class of is all
of . But , and the
classes partition , so a class equal to
forces . Conversely for
the trivial group the only class is and the single
character has .
(c) From Example (The character table of the symmetric group on three letters):
at , ; at
, ; at
, . Each
matches with class sizes
.