Section 2 found that has no two-sided
ideals except the two unavoidable ones: as an algebra it
cannot be collapsed. This section is about a second kind
of object that is indecomposable — not the algebra, but
a space the algebra acts on — and about what happens
when a space does break apart. The main theorem says
that “every invariant subspace can be split off” and
“the space is a sum of unbreakable pieces” are one
condition wearing two faces, and that condition is what
the rest of the chapter runs on. At the end we check the
new vocabulary against the old: an operator is
semisimple in Chapter 10’s sense exactly when the
algebra it generates acts semisimply.
Throughout, is
any field. Nothing in this section asks
it to be algebraically closed or to have a particular
characteristic; the hypotheses start biting in the next
section. Algebras are associative, unital, and
finite-dimensional over , as agreed in Section
1.
Two
meanings of the word simple
Section 2 proved that has exactly two
two-sided ideals (Theorem 23.2.2), while
— the
infinite-dimensional standing exception of Section 1 —
has infinitely many. That difference deserves a
name.
A simple algebra is one that cannot be collapsed:
forming the quotient by an ideal either changes nothing
or destroys everything.
Definition
23.3.1 (Simple Algebra)
An -algebra
is
simple if and the only two-sided ideals (Definition 15.10.3) of
are and itself.
In words: two conditions, and the first is not
decoration. The zero algebra has only one ideal, so
without the clause it would count as simple and every
theorem below would need an exception for it.
Examples.
- The field itself. is simple: a
nonzero ideal contains some , hence contains
, hence
everything.
- Matrix algebras. is simple for
every (Theorem 23.2.2). This is
the example the whole chapter is aimed at.
- A degenerate case. recovers , so the two
examples above are one.
Nonexample by minimal change.
Replace by
the algebra of
upper triangular matrices over
. It is a
subalgebra of of dimension , with basis , and the set is a two-sided ideal of : it is a subspace, and
Since , the algebra is not simple. The
clause that fails is the second one; is fine.
Why this definition. Section 2
identified ideals with kernels: the kernel of an algebra
homomorphism out of is a two-sided ideal,
and conversely every two-sided ideal is the kernel of
the map onto the quotient algebra (Definition 23.2.2, Theorem 23.2.5).
Simplicity therefore says that admits no interesting
image under a homomorphism, which is the following
one-line consequence.
Proposition
23.3.1 (Maps Out of a Simple Algebra)
Let be a
simple -algebra,
let be
an -algebra, and
let be an algebra homomorphism (Definition 23.1.2). Then
is
injective.
Proof. Since we have : otherwise
for
every . The
kernel of
is a two-sided ideal of , and it does not
contain ,
because . So , and
simplicity forces . A
linear map with zero kernel is injective (Theorem 2.2.3).
Section 2 had already seen the case , which is
simple by Theorem 23.2.2: that is
Corollary 23.2.3. So a
simple algebra has only one image under a homomorphism
worth the name: itself. Section 6 will turn this around
and recognize the semisimple algebras,
over an algebraically closed field, as products of
matrix algebras; its Exercise C1 picks out the simple
ones among them as the single matrix algebras.
Algebras
acting on spaces
An algebra is already a set of operators, by Section
1’s embedding theorem (Theorem 23.1.3). But the
same abstract algebra acts on many different spaces —
acts on
, on itself, on
by
conjugation — and the differences between those actions
are the subject. We need a word for one of them.
Definition
23.3.2 (Representation of an Algebra, and
Invariant Subspaces)
Let be an
-algebra. A
representation of on a finite-dimensional
vector space over
is an algebra
homomorphism so that is linear, , and . We
then call an
-space and
abbreviate to
. A
subspace is -invariant if
for
every and
every .
In words: the multiplication of is carried to
composition of operators, and — the clause that is easy
to overlook — the identity of must act as the
identity of . Two standing
examples:
- The tautological representation. If
is a subalgebra containing (Definition 23.1.1), the
inclusion is a representation. This is the case we
usually mean when we say “an algebra of operators on
”.
- The regular representation. acts on itself by left
multiplication: . Associativity gives , bilinearity gives linearity,
and . Here the -invariant subspaces are
precisely the left ideals of Section
2.
Nonexample by minimal change. Take
, , and for
every . This is
linear and multiplicative, but , so it is not a representation. The
clause that fails is unitality, and it is not a
technicality: it is what makes lie
in , a
step used twice below.
Now the indecomposable actions.
An irreducible -space is one with
nothing inside it for to see.
Definition
23.3.3 (Irreducible, or Simple, -space)
An -space is
irreducible — equivalently,
simple — if and
the only -invariant subspaces of
are and .
Both words are standard and we use them
interchangeably. Again two clauses, and again the first
is needed: has only one
subspace and must be excluded by hand, exactly as the
zero algebra was.
Examples.
- Lines. Any -space of dimension
is irreducible,
whatever is,
since its only subspaces are and itself.
These are the smallest possible pieces, and Section 4
will show that over an algebraically closed field a
commutative algebra has no others.
- The column space of a matrix
algebra. is an irreducible
-space.
Indeed, let be invariant and pick with .
Given any , extend to a basis of
(Theorem 1.6.5) and
let be the
matrix of the linear map sending to and the other
basis vectors to (Theorem 2.1.6). Then
. So .
Nonexample by minimal change. Shrink
to the upper
triangular algebra above, still acting on
. The line is -invariant, because an
upper triangular
has . So is not an irreducible
-space; the clause
that fails is the second.
Warning. Two different
words are both spelled “simple”. An algebra is
simple when it has no proper nonzero two-sided
ideal; an -space is simple when it
has no proper nonzero invariant
subspace. The first does not imply the second.
For the
algebra is
simple, yet
as a space over itself is not: the
matrices whose columns other than the first are zero
form a left ideal that is neither nor all of , that is, a proper
nonzero invariant subspace of the regular
representation.
Quick check. Let be the
algebra of diagonal matrices and let
. Which
subspaces of are
-invariant? Is
irreducible?
Solution. The invariant subspaces
are ,
, , and . Each of these four
is invariant because fixes
each coordinate line. No other line with is:
must be a multiple of , and if both
and then forces and hence , a contradiction.
So is not
irreducible: is a proper
nonzero invariant subspace.
Splitting
a space into pieces
Here is the phenomenon the section is built on. Take
and the
single operator , that is,
and . The line is invariant.
Is there an invariant complement? A complement of a line
in is a line
with
and , and
is a nonzero element of , which meets
only in
. So : there is no
invariant complement, and does not break into
invariant lines.
Compare , where splits
perfectly. The difference between these two pictures is
the definition we want.
An algebra acts semisimply when every invariant
subspace can be split off.
Definition
23.3.4 (Semisimple Action, Semisimple
Algebra)
Let be an
-algebra and an -space. We say acts semisimply
on if
every -invariant subspace
has
an -invariant
complement: a subspace with The algebra is
semisimple if it acts semisimply on
itself in the regular representation —
that is, if every left ideal of has a complementary
left ideal.
In words: the first notion is a property of an
action, the second a property of the algebra alone,
obtained by feeding the algebra its own most faithful
space. The examples come after the theorem that makes
the definition usable.
Warning. Acting semisimply
depends on the space, not only on the algebra.
The upper triangular algebra does not act semisimply
on , as we check
below. Yet it does act semisimply on the one-dimensional
space through
,
for the silly reason that a one-dimensional space has no
invariant subspace to split off. Always say
which space. The unqualified phrase
“ is semisimple”
is reserved for the regular representation, and a
proposition below shows that this is the right choice: a
semisimple algebra acts semisimply on every space.
The first thing to know is that the property passes
to invariant subspaces. Without this, no induction on
dimension gets started.
Lemma
23.3.2 (Splitting Is Inherited by Invariant
Subspaces)
Let act
semisimply on a finite-dimensional -space , and let be -invariant. Then , with the action , is
an -space, and
acts semisimply
on .
Idea. An invariant subspace of is also one of , so it has an invariant
complement
in . That
complement is too big; cut it down to and check
that nothing was lost.
Proof. Since is -invariant, for
every , and
is linear, multiplicative, and sends
to ; so it is a
representation.
Let be -invariant. Then is an -invariant subspace of
, so there is an
-invariant with . Put
, which is -invariant because and are.
:
the inclusion holds since
and
.
Conversely, let and write with , .
Then , because both and lie in ; hence and .
The sum is direct: .
Therefore with an -invariant complement,
which is what semisimplicity of the action on asks for.
Now the theorem. It is the section’s real content,
and every later section uses it.
Theorem
23.3.3 (Complete Reducibility)
Let be an
-algebra and let
be a
finite-dimensional -space. The following
are equivalent:
- (a) acts semisimply on
;
- (b) is a sum of irreducible
-invariant
subspaces;
- (c) is a direct sum of
finitely many irreducible -invariant
subspaces.
Here a sum over the empty family is , so all
three hold when . No hypothesis is placed on .
Idea. For (a) (c), induct
on . The
smallest nonzero invariant subspace is automatically
irreducible: it has no room for a proper one. Split it
off using (a), and apply the inductive hypothesis to the
complement — which is legitimate precisely because of Lemma 23.3.2. For (b)
(a),
given an invariant , build a complement
greedily out of the given irreducible pieces: add pieces
to as long as the
sum stays direct, and then show that a piece left
outside would have to meet the sum in , so it could
have been added too.
Proof.
- (a) (c).
Induction on . If then
is the empty direct sum and there is nothing to prove.
Let
and suppose the implication holds for every -space of smaller
dimension.
Among the nonzero -invariant subspaces of
— there is at
least one, namely
— choose of
smallest dimension. Then is irreducible: it is
nonzero, and if is -invariant with , then
is a nonzero
-invariant
subspace of , so
by the choice of ,
and by Theorem 1.6.8.
By (a) there is an -invariant with . By
Lemma 23.3.2, is an -space on which acts semisimply, and
because . The
inductive hypothesis writes with each an irreducible -invariant subspace of
. Invariance
and irreducibility refer only to the action of , not to the ambient
space, so each
is an irreducible -invariant subspace of
as well. Hence
a direct sum of finitely many
irreducibles.
(c) (b). A direct
sum is in particular a sum.
(d) (a). Write
with each an irreducible -invariant subspace, and
let
be -invariant.
Call a finite subset good if the sum
is direct. The empty set is good. Every
good satisfies
where the first inequality uses and the
middle equality is Theorem 1.7.5. So
the sizes of good sets are bounded, and we may choose a
good with as large
as possible. Put an -invariant subspace,
since a sum of -invariant subspaces is
-invariant. Write
.
Claim: for every . Fix . The subspace is -invariant and contained
in the irreducible , so it is or . Suppose it were
. Then
, since
gives and . We
show
is good, contradicting maximality. Let Then , so ;
and then forces and
every , because is good (Theorem 1.7.5 (b)).
So the sum over is direct, which is the contradiction.
Hence , that is, .
The claim gives , so with
invariant. This
proves (a).
Two features of the proof are worth keeping. The
complement produced in (b) (a) is a sum
of some of the given pieces, so nothing new has to be
constructed. And the pieces in (c) are far from unique:
under the
scalar matrices is a direct sum of any
two distinct lines.
Example
(Upper Triangular Matrices Are Not Semisimple)
Let be the algebra of upper triangular
matrices, of dimension . Show that does not act semisimply
on , and list
the irreducible -subspaces of .
Solution. The -invariant subspaces of
are , , and , and no others.
Certainly all three are invariant, the middle one
because for upper triangular . Conversely, let be an invariant
line with . Since and ,
invariance gives for some . If then gives , hence after all; so and .
Now
is an invariant subspace with no invariant complement,
since a complement of a line in is a line, and is the only
invariant one. So
does not act semisimply on . The only irreducible
-subspace is ; in
particular is
not a sum of irreducibles, in agreement with Theorem 23.3.3.
For contrast, here is an action that does split, and
it is the one Section 6 will build on.
Example
(Matrix Algebras Are Semisimple)
Show that is a semisimple algebra for every .
Solution. Section 2 did the work.
For
let
be the column ideal: the matrices all of whose columns
except the -th are
zero. By Proposition 23.2.4 (d),
each is a left
ideal and . Moreover for the
one-dimensional space of row vectors ,
so is a
minimal nonzero left ideal by part (c)
of the same proposition.
The -invariant
subspaces of the regular representation are the left
ideals of , so
“minimal nonzero left ideal” says exactly “irreducible
-subspace”. Hence
the regular representation of is a direct sum of
irreducibles, and Theorem 23.3.3 makes
semisimple.
The definition of a semisimple
algebra only looked at one space. It
controls all of them.
Proposition
23.3.4 (A Semisimple Algebra Has No Other Kind
of Representation)
Let be a
semisimple -algebra and let be any
finite-dimensional -space. Then acts semisimply on
.
Idea. Every vector lies in , because acts as the identity;
so is the sum of
the subspaces . Chop itself into irreducible
left ideals and
show each
is either zero or irreducible. Then is a sum of
irreducibles and Theorem 23.3.3
finishes.
Proof. If there is
nothing to prove, so let . Since is semisimple, Theorem 23.3.3 applied to
the regular representation gives with each an irreducible left
ideal.
Claim: for a left ideal that is irreducible and
a vector , the subspace is either or an
irreducible -invariant subspace of
. It is a
subspace, being the image of the linear map
restricted to ,
and it is -invariant because with . Suppose and let be
-invariant with
.
Put This is a subspace of , and it is a left
ideal: for
and we
have and
since is invariant. As is irreducible, or . If , then every
has
the form with , whence and ,
contradicting . So , which says and
therefore . This proves the claim.
Now let . Since ,
we have .
Hence and discarding the summands that are exhibits
as a sum of
irreducible -invariant subspaces. By
Theorem 23.3.3, acts semisimply on
.
How far
from semisimple: the radical
The upper triangular algebra failed to act semisimply
on , and the
ideal was
visibly to blame: it is nonzero, yet it squares to zero,
so no irreducible space can feel it. That suggests
measuring the failure by collecting everything
invisible.
We write for
what follows. Chapter 14 §01 writes
for the radical of a bilinear form; here the argument is
an algebra and the two never meet.
Definition
23.3.5 (Radical of an Algebra)
Let be an
-algebra. Its
radical is where
runs over all irreducible -spaces and .
In words: the elements that every irreducible
representation sends to . The quantifier ranges
over a manageable supply: if is irreducible and
is
nonzero, then is a nonzero
invariant subspace, so is the image of the linear map , and
.
The radical is a two-sided ideal. It is a subspace,
being an intersection of kernels of linear maps; and if
, , and
is irreducible, then for every . Taking
and in turn shows
and lie in .
The first fact we want is the one the triangular
example suggested.
Lemma
23.3.5 (A Nilpotent Ideal Is Invisible)
Let be an
-algebra and let
be
a two-sided ideal which is nilpotent:
for some ,
every product of
elements of is
. Then .
Proof. Let be an irreducible -space and write , and more generally
.
The subspace is -invariant, since with . By
irreducibility, or .
Suppose . Applying to both sides, , and repeating gives for every
. But
by nilpotency, so , contradicting irreducibility.
Hence , that is, every acts as on . Since was an arbitrary
irreducible -space, .
And the radical really does obstruct
semisimplicity.
Proposition
23.3.6 (A Semisimple Algebra Has Zero
Radical)
Let be a
semisimple -algebra. Then .
Proof. By Theorem 23.3.3 applied to
the regular representation, with each an irreducible -space. Let . Then
acts as on each
, so for every
, and therefore
. In
particular .
We can now finish the running example.
Quick check. Let be the algebra of upper
triangular matrices and its ideal of strictly
upper triangular matrices. Using the two results above,
identify and decide whether is a semisimple
algebra. Hint: the maps and
go from to .
Solution. , and
is not semisimple.
We
saw that is a
two-sided ideal, and because . By
Lemma 23.3.5, .
For
upper triangular the product has and . So and
are algebra homomorphisms , each sending to ; they make an -space in two ways,
irreducible because . An element of must
be killed by both, so it has and
lies in .
Since , Proposition 23.3.6 shows
is not a
semisimple algebra.
Back to a
single operator
Chapter 10 §08 already used the word semisimple, for
an operator: is
semisimple when
is a product of distinct monic
irreducible polynomials (Definition 10.8.1).
That definition was about a polynomial. This section’s
is about invariant subspaces. They agree, and proving so
is the best check that the new definition is the right
one.
Fix a finite-dimensional over
and , and let
which is a commutative subalgebra of containing (Proposition 23.1.2). A
subspace is -invariant if and
only if it is -invariant: one
direction is the case , and the other holds because gives
for every , hence
for every .
Theorem
23.3.7 (The Two Meanings of Semisimple
Agree)
Let be a finite-dimensional vector
space over and
let .
The following are equivalent:
- (a) is semisimple in the
sense of Definition 10.8.1,
that is, is a
product of distinct monic irreducible polynomials;
- (b) acts semisimply on
: every -invariant subspace has
a -invariant
complement;
- (c) is a sum of irreducible
-invariant
subspaces.
No hypothesis is placed on .
Idea.
- (b) and (c) are Theorem 23.3.3 for the
algebra , so
the work is the polynomial statement (a). Forwards: the
primary decomposition splits into pieces on which
the minimal polynomial is a single irreducible , and inside such a
piece every nonzero vector generates a
cyclic subspace of dimension — which leaves no
room for a proper invariant subspace. Backwards: an
irreducible piece is cyclic, and a factorization of its
minimal polynomial would manufacture a smaller invariant
subspace inside it; so each piece contributes one
irreducible polynomial, and their product, which is
squarefree, kills .
Proof. By the remark preceding the
theorem, “-invariant” and “-invariant” are the
same condition, so (b) (c) is Theorem 23.3.3 applied to
.
- (a) (c). Write
with distinct monic irreducibles, so that every
exponent in the factorization is . By Theorem 9.8.1, with a nonzero -invariant subspace on
which .
Fix and let
with . Then , so the -annihilator divides
(Definition 10.5.2);
it is monic of degree at least because ,
and is
irreducible, so . By
Theorem 10.5.2
(a), the cyclic subspace has
dimension ,
and it is -invariant (Proposition 10.5.1).
is irreducible. Let be -invariant with and
pick
with . Since , the
same argument gives and
. As and the
two ends have equal dimension, Theorem 1.6.8 gives
.
Every nonzero lies in , so is a sum of
irreducible -invariant subspaces,
and hence so is .
- (c) (a). Write
with each irreducible.
Each is
irreducible. Pick with
. Then is a
nonzero -invariant
subspace of , so
, and Theorem 10.5.2
(a), (c) give with .
Suppose were not
irreducible. Since , Definition 6.3.1 then
gives with
both and nonconstant, and we may
take them monic after dividing each by its leading
coefficient. So and . Put .
Then : otherwise
would give (Definition 10.5.2),
impossible since has degree less than . Also
, so
and, by Theorem 10.5.2
(a), . But is a
nonzero -invariant
subspace of ,
hence equal to
by irreducibility — a contradiction. So no such
factorization exists and is irreducible.
Finitely many pieces suffice. Start with one
; as long as
the sum of the chosen pieces is not , some is not contained in
it, and adding that one strictly increases the
dimension. The process stops, giving .
Conclusion. Let be the
distinct polynomials among and put , a
product of distinct monic irreducibles. For each , the polynomial divides
, so vanishes on ; as these
subspaces span ,
and
therefore (Theorem 9.5.1). If
some irreducible
had ,
then ,
which contradicts the uniqueness of the factorization of
into irreducibles
(Theorem 6.3.5), every
exponent there being . So no irreducible
square divides ,
which is (a).
Two things follow at once. First, the operator case
is nothing but the case of Theorem 23.3.3, so
Chapter 10’s vocabulary was this chapter’s all along.
Second, over an algebraically closed field every
irreducible polynomial is linear — a monic polynomial of
degree at least
has a root ,
hence the nonconstant factor (Theorem 6.1.3) — so
“semisimple” there means “a product of distinct
linear factors”, which is
diagonalizability (Theorem 9.8.2): over
such a field,
acts semisimply on exactly when is diagonalizable. The
shear fails
on both counts, as it must. Chapter 10 §08 made a finer
statement in the same direction, Proposition 10.8.2:
in characteristic zero, semisimple means diagonalizable
after the field has been enlarged enough to split . That proposition
needs its characteristic hypothesis; Theorem 23.3.7 does not,
because it never leaves .
Exercises
A. Check your
understanding
Exercise
(A1)
- (a) State what it
means for an algebra to be simple and
what it means for an -space to be
irreducible, and give one object that
is the first but whose regular representation is not the
second.
- (b) True or false:
if acts
semisimply on ,
then every -invariant subspace of
is irreducible.
Justify your answer.
- (c) Where exactly
does the proof of Proposition 23.3.4 use
the requirement built into Definition 23.3.2? And
why is the step in the proof of Proposition 23.3.6
not an instance of that
requirement?
- (d) Name for
the algebra of
upper triangular matrices, and say which two results identify
it.
Solution.
(a) is simple if and its only
two-sided ideals are and (Definition 23.3.1); an
-space is irreducible if and
its only -invariant subspaces are
and
(Definition 23.3.3). For
the algebra
is simple,
but its regular representation is not irreducible, since
the first column ideal of Example (Matrix Algebras Are Semisimple)
is a proper nonzero left ideal.
(b) False. Take
acting on
by scalars.
Every subspace is invariant and every subspace has a
complement, so
acts semisimply; but itself is an invariant
subspace of dimension , and it is not
irreducible.
(c) In the final
paragraph, at the words “Since ”:
that is the requirement and
nothing else, and without it need not lie in
, so need not be the sum of
the subspaces . The step in Proposition 23.3.6 is a
different statement: it is axiom (A3) of Definition 14.12.1, which
makes a
two-sided identity of itself, and it holds
with no representation in sight.
(d) , the strictly upper triangular matrices:
the inclusion is Lemma 23.3.5 applied to
the nilpotent ideal , and comes from the
two one-dimensional representations and
.
B. Practice
Exercise
(B1: Which actions split?)
Determine which of the following subalgebras of , acting on , act semisimply.
Justify your answer in each case, and when the action is
semisimple exhibit as a direct sum of
irreducibles.
- (a) the scalar
matrices ;
- (b) the diagonal
matrices;
- (c) , where ;
- (d) itself.
Solution.
(a) Semisimple.
Every subspace is invariant, and every subspace of a
finite-dimensional space has a complement (Theorem 1.7.6).
, and each line is irreducible
because it has dimension .
(b) Semisimple.
By the Quick check above, the invariant subspaces are
, , , ; the two lines are
complements of each other and the two extreme cases are
complements of each other. Again with both summands
irreducible.
(c) Not
semisimple. The invariant subspaces are the -invariant ones, and
the only invariant line is : if with
then is a
nonzero element of , which is not
a multiple of . So has no
invariant complement. (Alternatively: is not
squarefree, so Theorem 23.3.7
applies.)
(d) Semisimple,
trivially: is
itself irreducible, as shown after Definition 23.3.3, so
is a one-term
direct sum of irreducibles.
Exercise
(B2: A two-dimensional algebra)
Let and .
- (a) Prove that is a commutative
subalgebra of of dimension .
- (b) Prove that is a two-sided ideal
of and compute
.
- (c) Is a semisimple algebra?
Justify your answer.
Solution.
(a) is a
subspace, and are independent since is not a scalar. It
contains , and
using ; the right-hand side lies in and is symmetric in the
two factors, so
is a commutative subalgebra of dimension .
(b) The displayed
product shows , and is commutative, so
is a two-sided
ideal; since . By Lemma 23.3.5, . Conversely
is an algebra homomorphism by the same display, and , so
is an irreducible
-space; an element
of must have . Hence .
(c) No: , so Proposition 23.3.6 rules
it out.
Exercise
(B3: Semisimple operators)
For each of the following, decide whether acts semisimply on
, using Theorem 23.3.7.
- (a) , , the rotation matrix
;
- (b) , , ;
- (c) , , ;
- (d) , , .
Solution.
(a) Yes. ,
irreducible over and occurring once,
so is semisimple.
Note that is
not diagonalizable over ; semisimplicity is
the weaker condition.
(b) Yes. , two
distinct irreducibles.
(c) No. repeats the
irreducible .
(d) No. by Theorem 10.5.3,
and is
repeated.
C. Going deeper
Exercise
(C1: The diagonal algebra)
Let be the algebra of all diagonal matrices,
acting on .
- (a) Prove that every
-invariant
subspace of is
the span of a subset of . Hint: consider .
- (b) Deduce that
acts semisimply
on and identify
the irreducible -subspaces.
Solution.
(a) Let be -invariant and put . For and each
, the matrix is diagonal, so
; if , choosing with gives . Hence
. Conversely every is , since for by the
definition of . So
.
(b) By (a) the
invariant subspaces are indexed by subsets , and the complement of inside given by the
complementary subset is again invariant. So acts semisimply, and
. The irreducible -subspaces are exactly
the coordinate lines : they are
irreducible because they have dimension , and by (a) no other
subspace is both invariant and free of a proper nonzero
invariant subspace.
Exercise
(C2: The radical is never everything)
Let
be a finite-dimensional -algebra.
- (a) Prove that has at least one
irreducible -space. Hint: among
the nonzero left ideals, take one of smallest
dimension.
- (b) Prove that every
irreducible -space
has dimension at most .
- (c) Deduce that
, so .
Solution.
(a) itself is a nonzero
left ideal, so among the nonzero left ideals there is
one, , of smallest
dimension. A nonzero left ideal contained in is a nonzero left ideal
of , hence has
dimension at least , hence equals by Theorem 1.6.8. Since
the -invariant
subspaces of the regular representation are the left
ideals, is an
irreducible -space.
(b) Let be irreducible and
nonzero. The set is an -invariant subspace
containing , so . It is the
image of the linear map , , so by Theorem 2.3.1.
(c) Let be as in (a). Since
, pick
with ; then , so does not act as on and therefore . Hence . (Note the contrast with Proposition 23.3.6: the
radical is always a proper ideal, but it is only in the
semisimple case.)