Sections 01–06 studied an algebra of operators in the
abstract. A group is not an algebra — its elements
cannot be added — but a group can be made to
act by operators, and then the operators it
produces span an algebra. This section sets up that
translation: a representation of a group over is the same thing as a
representation of the group algebra , so everything
proved about algebras applies at once. The section’s
main theorem, Maschke’s, says when the resulting algebra
is semisimple, and its hypothesis on the field is not
decoration: we exhibit a group and a field where the
conclusion fails outright.
Throughout, is
a finite group, written
multiplicatively, with its identity element written
, and is a field. All vector
spaces are finite-dimensional over . Where a statement
needs to be , or needs a condition
on , the statement says so.
Letting a
group act by operators
The book’s groups so far have been groups of
matrices or of permutations: (Example (Groups)), the
symmetric group , the classical groups
of Chapter 14. Such a group arrives with its linear
algebra attached. An abstract group does not. If all we
know about is its
multiplication table, the only way to bring linear
algebra to bear is to manufacture operators out of
it.
The manufacture has one requirement. Group
multiplication must become composition of operators,
since composition is the only product on , and every group
element must become an invertible
operator, since every group element can be undone. That
is exactly the definition of a homomorphism into the
group of
invertible operators on , a group under
composition by the same argument that makes one (Example (Groups)).
A representation is a way of realizing the
elements of a group as invertible operators, so that
multiplying in the group means composing the
operators.
Definition
23.7.1 (Representation of a group)
Let be a
group, a field
and a
finite-dimensional vector space over . A
representation of on over is a group homomorphism
that is, a map assigning to each an invertible
operator on
such that
for all . The space is the
representation space, and is the
degree of . The representation
is faithful if is injective. When
we speak of
a matrix representation and write .
In words: to give a representation is to attach to
each an
invertible operator on one fixed
space , in such a
way that the operator attached to a product is the
composition of the operators attached to the factors.
Two conditions that look like extra demands are already
implied by Theorem 0.10.3: , and
for every . So we never have to
check them.
Note what is not required. Nothing
says is
injective, and nothing says the operators are distinct. The
constant map is a perfectly good representation; it
simply carries no information about .
Examples. Fix a finite group and a field .
- The trivial representation. and for every
. It is a
representation because , matching . Its degree is . This is the degenerate
case, and it is not a curiosity: it is one of the basic
building blocks, and in Section 08 it is the piece that
detects averages.
- The sign representation of . and , where is the sign of a
permutation (Definition 7.3.2). It
is a homomorphism because (Theorem 7.3.1). Over
a field of characteristic we have , so the sign
representation coincides with the trivial one; over
it does not. It
is faithful on ,
whose two elements have signs and , but not on for , where while .
- The permutation representation of . and , extended linearly (Theorem 2.1.6). Then
, where the last step uses
that
means “first ,
then ”. So
is a
homomorphism, and each is
invertible with inverse . The
matrix of in the
standard basis is the permutation matrix of Definition 3.4.2.
The same recipe works for any subgroup of .
- The rotation representation of over . and is rotation by
, with
matrix . Composing
rotations adds angles, so ; and rotating by is the
identity, so the recipe does not depend on the
representative .
For this
representation has no invariant line. A line invariant
under
would give that matrix a real eigenvalue (Proposition 9.1.2),
but with and its characteristic polynomial is
, of
discriminant , which is negative because
forces when
. (The
quarter-turn case is Example (A Rotation Has No Invariant Lines).)
Section 04 turned this into the standard warning about
Schur’s lemma over .
- The regular representation. , the group
algebra of Definition 23.1.5: the
free vector space on the set (Definition 15.2.3), with
basis and multiplication determined by . Its dimension is . Put , extended linearly. Then , so is a
homomorphism, and is
invertible with inverse .
It is faithful: if then , so
because the
are
distinct basis vectors. Its degree is .
Non-example by minimal change. Keep
and , and try
over . Each matrix is
invertible, and , so multiplicativity holds on
representatives. But the recipe is not well
defined on : the class is also , and . The clause that
fails is that
must be a function on . Over the same recipe on
is well defined, because there; we return to
that example when Maschke’s theorem breaks.
Warning. A representation
need not remember the group. The trivial
representation of any group is a representation, and it
forgets everything. Conversely, a non-injective can still be useful:
the sign representation of has a huge kernel yet
separates even from odd permutations. When a statement
needs to see
all of , it must
say faithful; none of the theorems
below does.
Quick check. Is , , a
representation?
Solution. No: it is not well
defined. We have in , but while .
Equivalently, a representation of degree is a homomorphism , and forces , since is the only real cube
root of . So the
only degree- real
representation of is the trivial
one.
Subrepresentations, equivalence, and irreducibility
Having made operators, we ask the question this book
always asks of a family of operators: can the space be
broken into smaller pieces that the family preserves?
Chapter 9 called such a piece an invariant subspace (Definition 9.1.1).
Here the family is .
Definition
23.7.2 (Subrepresentation)
Let be a
representation of
on . A subspace
is
-invariant if
for every and every . In that case the restrictions define a
representation of on , the
subrepresentation of on .
Two checks make this legitimate. First, really is an
operator on , by invariance. Second,
it is invertible on : applying invariance to
gives , so has a
two-sided inverse on , namely .
Multiplicativity is inherited. The subspaces and are always -invariant; we call them
the trivial invariant subspaces.
Definition
23.7.3 (Equivalence of representations)
Let and
be
representations of on and , over the same
field. A linear map intertwines and if The representations are
equivalent, written , if
some intertwining
is an isomorphism; equivalently, if for all .
Equivalence is what “the same representation written
in another basis” means. Indeed, if and
is an invertible
matrix, then is simultaneous similarity of
the whole family by one
matrix. It is an equivalence relation: intertwines with itself; if
intertwines with and is
invertible then intertwines with , since
gives ; and a composition of
intertwining isomorphisms intertwines.
Definition
23.7.4 (Irreducible representation)
A representation of on is
irreducible if and the only
-invariant
subspaces of are
and . A representation with
that
is not irreducible is reducible.
Read the two clauses separately. The zero space is
excluded by decree, exactly as is excluded from the
primes: keeping it would break every statement of the
form “every representation is built from irreducible
ones”. The second clause is the real content.
Examples and a non-example.
- Every representation of degree is irreducible: a
one-dimensional space has no subspaces but and itself.
- The permutation representation of on is
reducible for every . The line is -invariant, since
, the same three basis vectors in
another order. And , .
- So is the sum-zero subspace , of dimension : permuting the
coordinates of
does not change their sum. We will see below that over
the
subrepresentation on is irreducible; this is
the standard representation of .
- Non-example by minimal change.
Replace by the
subgroup and keep . Then is -invariant, though it is
not -invariant.
Invariance depends on the whole group, not on one
element of it.
Finally, the operation that puts representations
together. If are representations of on , their
direct sum is the representation on
given by . In a
basis adapted to the decomposition its matrix is block
diagonal, . Conversely, if with both
summands -invariant, then the map
,
, is an isomorphism intertwining
with , so . So “decomposing a representation” and
“finding an invariant complement” are the same task.
Representations of and representations of
Here is the bridge that puts Sections 01–06 to work.
The group algebra was built in Definition 23.1.5
precisely so that the next theorem is true.
Theorem
23.7.1 (Representations of are representations of
)
Let be a
finite group, a
field and a
finite-dimensional vector space over . The assignment is a bijection from the set of representations
onto the set of algebra homomorphisms
(Definition 23.1.2) — that
is, onto the ways of making an -space in the sense
of Definition 23.3.2.
Moreover a subspace is -invariant for if and only if for every .
Idea. An element of is a formal linear
combination of group elements, so a linear map out of
is determined
by, and may be prescribed freely on, the basis . The only
thing to check is that “multiplicative on the basis”
upgrades to “multiplicative everywhere”, and that is
bilinearity of both products. The inverse map recovers
by restricting
to the basis; the one point needing care is why
is automatically invertible, which is
where earns its keep.
Proof. Let
be a representation. The formula defines a linear map
, because is a basis
of and a
linear map may be prescribed on a basis (Theorem 2.1.6). It
sends to
(Theorem 0.10.3). For
multiplicativity, take and .
Multiplication in and composition in
are both
bilinear, so where the third equality is the homomorphism
property of .
Hence is an
algebra homomorphism.
Conversely, let be an algebra
homomorphism, and set . Since is the identity
of (Definition 23.1.5) and
is the
identity of , the unital
clause of Definition 23.1.2 gives
. Then . In particular and likewise in the
other order, so each is invertible and
maps into
. Thus is a representation,
and because the two agree on the basis
and
both are linear. Since also , the two constructions are mutually
inverse, and the assignment is a bijection.
For the last sentence, suppose is -invariant. For
and , each
lies in
, and is a subspace, so . Conversely, if for all , take . This proves
the theorem.
So the two languages are interchangeable, and we use
whichever is shorter. A -invariant subspace is
an -invariant
subspace; an irreducible representation of on is exactly a simple
-space in the
sense of Definition 23.3.3; and a
map intertwining two representations of is exactly an -map in the sense of
Definition 23.4.1, since
the condition for all extends by linearity to
all of . In
particular Schur’s lemma (Theorem 23.4.1) applies
verbatim to irreducible representations of groups, and
we use it that way in Section 08.
Maschke’s
theorem
We now know that a reducible representation has a
proper non-zero invariant subspace . To break into pieces we need
more: an invariant complement, a -invariant with . An
ordinary complement always exists (Theorem 1.7.6), but
it has no reason to be invariant.
The idea for repairing it is the one move this
chapter uses over and over. Start with an object that is
not invariant, and average its -translates. The average
is invariant because translating it permutes the terms
of the sum. Averaging divides by , and that
is the whole hypothesis.
Lemma
23.7.2 (When the group order is
invertible)
Let be a field
and a positive
integer. Then in
if and only if
does not divide .
Proof. If , then for every positive integer (Definition 0.7.2), and
divides no
positive integer, so both sides of the equivalence hold.
Assume from now on that , so
is the
smallest positive integer with .
() We
prove the contrapositive: if , then . Write
with . By Lemma 0.7.4, .
()
Suppose, for a contradiction, that some positive integer
has and . Choose such an
as small as
possible. Now , since , and , since
is the smallest positive integer killing . So is a positive
integer, and by Lemma 0.7.4 whence . Also , for otherwise would divide . This
contradicts the minimality of . This proves the
lemma.
Theorem
23.7.3 (Maschke’s Theorem)
Let be a
finite group and a field whose
characteristic does not divide . Let be a representation
of on a
finite-dimensional space over , and let be a -invariant subspace.
Then there is a -invariant subspace
with
Idea. Pick any
projection of
onto ; its kernel is a
complement, but the wrong one, because need not commute with
the . Repair
it by averaging the conjugates over
. ① Each
conjugate is again a projection onto , because is invariant. ② Their
average is
therefore again a projection onto — here we divide by
. ③
Conjugating by
only
permutes the terms of the sum, so commutes with every
, and then
its kernel is invariant.
Proof. Write . By
hypothesis and Lemma 23.7.2, , so the
scalar exists in . By Theorem 1.7.6 there
is a subspace
with ; let be the projection onto along (Theorem 4.5.1
(b)), so
and for
all .
Define
Step 1: . Let and . Then , and
is -invariant, so
. A subspace is closed under sums and scalar
multiples, so .
Step 2: for . Let and . Since
is -invariant and
, we have , so
and hence . Summing over the elements of gives , and multiplying by gives .
By Steps 1 and 2, for every , and fixes pointwise; therefore
, so is a projection (Definition 4.5.1)
with .
Step 3: commutes with every
.
Fix . Then
using
and . The
map is
a bijection , with inverse by Theorem 0.10.1, so as
runs over so does , and the sum is
unchanged: . Multiplying on the right by gives .
Step 4: conclusion. Put . By
Theorem 4.5.1
(a), . And is -invariant: if and , then by Step 3,
, so . This proves the theorem.
Two hypotheses did real work, and it is worth naming
where. Finiteness of is what makes the sum
a finite
sum, hence an operator at all. The condition on the
characteristic is what makes exist, and Step
2 is where it is spent: without the division, the
computation in Step 2 gives , which is for every when
divides . The
unnormalized sum then annihilates instead of fixing it,
and there is nothing to rescue. Both failures are real,
not artifacts of the proof.
Example
(Maschke fails when the characteristic divides the
order)
Let be a
prime, ,
and
. Define
Show that is a well-defined
representation, that is -invariant, and that
has
no -invariant
complement.
Solution. Well defined.
The entry is read
in , so the
matrix depends only on modulo ; and ,
so . Each matrix is invertible, with
inverse .
So is a
representation of the additive group . Here , so the characteristic
does divide the order and the
hypothesis of Theorem 23.7.3 fails.
The invariant line. for
every , so is -invariant, and .
No invariant complement. If , then
by Theorem 1.7.3, so
for
some ; and , since would force and , which is not a complement of
itself. Suppose
is -invariant.
Then must be a scalar multiple . Comparing second coordinates and dividing
by gives
;
comparing first coordinates then gives , so , a contradiction.
Hence has no
-invariant
complement. In fact is the
only non-trivial invariant subspace, so
is neither
irreducible nor a direct sum of irreducibles.
Warning. Do not drop
finiteness either. Let (infinite) act on
by
— now well defined, since has no relations to
respect. The computation just made, with in , again shows is invariant
with no invariant complement, and here the
characteristic is . Averaging over is not an option: the
sum has infinitely many terms.
Once one invariant complement can always be found,
the full decomposition follows by induction.
Corollary
23.7.4 (Complete Reducibility of Group
Representations)
Let be a
finite group and
a field with — for instance . Then every
representation
of on a non-zero
finite-dimensional space over decomposes as with each a -invariant subspace on
which the subrepresentation is irreducible.
Proof. We argue by strong induction
on (Theorem 0.2.10). If
is
irreducible, take and . Otherwise has a -invariant subspace
with and . By Theorem 23.7.3 there is a
-invariant with , and since . Both and are at least , and since (Theorem 1.7.4) the
dimension formula Theorem 1.7.3 gives
; hence both are smaller than . The induction
hypothesis decomposes and into irreducible
invariant subspaces, and concatenating the two lists
decomposes ,
because a subspace of invariant under is invariant
under . This
proves the corollary.
In the language of Section 03, the corollary says
that acts
semisimply on every representation (Definition 23.3.4, Theorem 23.3.3); applied
to the regular representation, it says is a semisimple
algebra. Section 06’s structure theorem then applies to
, and Section
08 cashes that in.
Solution. In the base of the
induction and in the meaning of the conclusion. If it is not
irreducible (Definition 23.7.4
excludes the zero space) and it has no non-zero
invariant subspace to split off, so neither branch of
the argument applies. The usual convention is that is the empty
direct sum, ;
the corollary is stated with so that
.
Two
families worked out
We close with the two examples Section 08 will
compute characters for. Both are over , where Corollary 23.7.4 applies
to every finite group.
Example
(The irreducible complex representations of a cyclic
group)
Let
and .
Determine all irreducible representations of up to equivalence.
Solution. Every irreducible is
one-dimensional. Let be a representation
of on over , and set . By Theorem 9.2.4, has an eigenvector
, say
.
The line is invariant under , hence under every
power , so is -invariant. If is irreducible then
, so . (For abelian
the algebra is commutative,
since
and multiplication is bilinear; so this is also Corollary 23.4.4 read
through Theorem 23.7.1.)
Listing them. A one-dimensional
representation is a homomorphism , determined by , which must
satisfy . So is an -th root of unity, with and
(Example (Roots of Unity)).
Conversely each such does define a
homomorphism : the recipe respects
representatives because , and .
They are pairwise inequivalent. Two
one-dimensional representations are equivalent exactly
when they are equal, since on a one-dimensional space
every operator is for a scalar
, and for every isomorphism . And for
, because , the -th roots of unity being
distinct.
So has
exactly
irreducible complex representations, all of degree , namely . Their degrees satisfy , the count Corollary 23.6.2 gives
for the semisimple algebra .
Example
(The irreducible complex representations of the
symmetric group on three letters)
Write down three pairwise inequivalent irreducible
complex representations of , with explicit
matrices for the two-dimensional one.
Solution. Trivial and
sign. and , both on , both irreducible
because their degree is . They are inequivalent:
.
The standard representation. Take the
permutation representation on and restrict it to
the invariant plane . A basis of is with
and : they lie in , they are independent,
and
because is the
kernel of the surjective functional on
(Theorem 2.3.1). Since
is generated by
and — every element
of is a product
of transpositions (Theorem 0.10.4), and
, — it is enough to record two
matrices. With : Writing , the two matrices in
the basis are
The remaining four matrices follow by
multiplying:
for ,
for ,
for and
for .
Irreducibility. A proper non-zero invariant
subspace of the plane would be a line , and would be an
eigenvector of both displayed matrices.
The first has eigenvalues and , with eigenvectors
spanned by
and
respectively. The second has characteristic polynomial
, whose
roots are the two primitive cube roots of unity; neither
nor is an eigenvector
of it, since and are not multiples of , . So there is no
common eigenvector, and the standard representation is
irreducible.
Inequivalent. It has degree , the others degree
, and equivalent
representations act on spaces of the same dimension.
The degrees satisfy , which is the
count Corollary 23.6.2 gives
for the semisimple algebra . That count runs
over all isomorphism classes of
irreducible -spaces (Theorem 23.6.1), and a
further class would add at least to a total already
equal to ; so
these three are all of the irreducible complex
representations of . Section 08 reaches
the same conclusion by counting conjugacy classes, which
does not require the list to be found first.
Exercises
A. Check your
understanding
Exercise
(A1)
- (a) State the
definition of a representation of a group on a vector space , and say which two
properties of
come for free.
- (b) State Maschke’s
theorem with all of its hypotheses.
- (c) Determine
whether the following is true: “every representation of
degree is
irreducible.” Justify your answer.
- (d) Give an example
of a reducible representation of over , and name an
invariant subspace.
- (e) Explain why
, , is
not a representation.
Solution.
- (a) A representation
is a group homomorphism with finite-dimensional over
, that is,
for all
with each
invertible (Definition 23.7.1). Free:
and
, by Theorem 0.10.3.
- (b) If is finite, is a field with ,
is finite-dimensional over and is -invariant, then has a -invariant complement
, so (Theorem 23.7.3).
- (c) True. If then and the only
subspaces of are
and , so in particular the
only invariant ones are the trivial ones.
- (d) The permutation
representation of on ; the line is
invariant, as is the sum-zero plane.
- (e) It is not well
defined:
in , but
. (Equivalently, a degree- representation of needs , and the
only rational solutions of are .)
B. Practice
Exercise
(B1: Which of these are representations?)
Determine which of the following are representations.
Justify your answer in each case.
- (a) , , with .
- (b) , , , where is the
permutation matrix with (Definition 3.4.2).
- (c) , , with as in (b).
- (d) , , .
Solution.
- (a) Yes. Here , so the matrix depends only on modulo and the map is well
defined; it is diagonal, hence invertible since ; and
.
- (b) Yes. Both
factors are multiplicative: (Theorem 7.3.1) and
(Lemma 3.4.7 (a)).
Scalars commute with matrices, so , and is
invertible because is and .
- (c) No. Taking
transposes reverses products: . Since
is not abelian
this differs from : with
,
we
get (Example (Computing with cycles)),
and distinct permutations have distinct permutation
matrices. (The repair is , or equivalently itself.)
- (d) No, on two
counts. It is not well defined: but . And it is not multiplicative even
on representatives: while .
Exercise
(B2: Averaging an inner product)
Let be a
finite group and a representation of
on a complex
space carrying an
inner product (Definition 11.1.1).
Define Prove that is
an inner product on and that every is an isometry
for it. Hence give a second proof of Theorem 23.7.3 over .
Solution. (IP1). For fixed
, the map is linear in , being a composition
of the linear map with a slot that
is linear by (IP1) for . A
sum of linear maps times a scalar is linear.
(IP2). , since conjugation is
additive.
(IP3). For , each because
is
invertible, so each term
is , and
is a positive real. Hence .
Isometry. For , , because is a
bijection of (Theorem 0.10.1).
Second proof of Maschke over . Let be -invariant and let be its
orthogonal complement for .
Then
by Theorem 11.3.2. If
, and , then, writing
and using
that
preserves ,
the last step because and . So , and
is -invariant. Note that
this route needs or , where inner products
live, whereas Theorem 23.7.3 needs only
a condition on the characteristic.
Exercise
(B3: Decomposing a permutation representation)
Number the coordinates of as , as in Chapter 12
§09, and let act by , where
is the cyclic
shift, . Check that is a representation,
decompose
into one-dimensional invariant subspaces, and identify
each with one of the of Example (The irreducible complex representations of a cyclic group).
Solution. A
representation. Shifting three times restores every
entry, so , and therefore depends only on
modulo : the recipe is well
defined on . It is
multiplicative because , and
each is
invertible with inverse .
Decomposition. Let . By
Theorem 12.9.2 the
vectors ,
,
satisfy . The three eigenvalues are
distinct, so the are independent (Theorem 9.2.2), and
three independent vectors in form a basis (Theorem 1.6.4).
Hence and each line is invariant under , hence under every
.
Identification. On the element
acts by the
scalar ,
which is exactly in the
notation of Example (The irreducible complex representations of a cyclic group).
So the three summands realize :
every irreducible representation of occurs exactly
once.
C. Going deeper
Exercise
(C1: One-dimensional representations and the
commutator)
Let be a
finite group and
a field.
- (a) Prove that every
representation of degree satisfies
for all .
- (b) Deduce that the
only degree-
complex representation of other than the trivial one is the sign
representation. Hint: write the -cycle in the form
with
and
transpositions.
Solution.
(a) A
degree-
representation takes values in , which is
abelian under multiplication. So ,
using Theorem 0.10.3 for the
inverses.
(b) Let have degree over . Transpositions are
their own inverses, so . Applying this product to each point,
rightmost factor first: , and . So the
product is . By (a), , and
then . Let . Since
,
, so . Finally
and , so as well. Thus is determined by
: for it is trivial, and
for it
agrees with on
every element. Both values do occur, so there are
exactly two.
Exercise
(C2: Maschke over a field of the right
characteristic)
Let
and , with
.
- (a) For , find two -invariant lines whose
direct sum is .
- (b) For , prove that
has exactly one
non-trivial -invariant subspace, and
conclude that Theorem 23.7.3 fails
here. Which hypothesis is violated?
- (c) For , decompose
into irreducible
subrepresentations.
Solution.
(a) swaps the
coordinates, so and satisfy and
.
Both lines are invariant, since as well.
The two vectors are independent, because the matrix with
columns has
determinant in ;
hence and the sum is direct (Theorem 1.7.4). Its
dimension is , so .
(b) Over we have , so and the
two lines coincide. A non-trivial invariant subspace is
a line
with , and invariance requires .
Over the only
non-zero scalar is , forcing , so and the only non-trivial invariant
subspace is . A
complement of a line in the plane is again a line, and
the only invariant line is itself,
which is not a complement of itself. So this invariant
subspace has no invariant complement, and is not a direct sum of
irreducibles. The violated hypothesis is on the
characteristic: .
(c) Over , , so and are again
independent, with and
. Hence , each summand of
dimension and so
irreducible. Here , and Theorem 23.7.3
applies.
Exercise
(C3: The contragredient representation)
Let be a
finite group and a representation of
on over . For define ,
where
denotes the dual map (Definition 5.4.1).
- (a) Prove that is a representation
of on , the
contragredient of .
- (b) Prove that if
is
-invariant for
, then its
annihilator (Definition 5.2.1) is -invariant for .
- (c) Hence deduce
that if is
irreducible, so is .
Solution.
(a) Each is
invertible, so is invertible by
Theorem 5.4.1 (d). For
multiplicativity, put and . By Theorem 5.4.1 (b), where the fourth equality is Theorem 0.10.1 (3)
applied in .
So is a
homomorphism into .
(b) Let , and . By Definition 5.4.1, . Since and is -invariant, , so
the value is .
Hence
annihilates , that
is, .
(c) Suppose is irreducible. Then
,
so by
Corollary 5.1.4. Let be a -invariant subspace of
with and . By (b), is -invariant, and by Theorem 5.2.2, . From we get , so is a non-trivial
invariant subspace of , contradicting
irreducibility. Hence has no such , and is
irreducible.