lecture 8
From Scholarpedia
| This article has not been peer-reviewed or accepted for publication yet; It may be unfinished, contain inaccuracies, or unapproved changes. | ||||||||||||||||||||
Author: Dr. Jan A. Sanders, Vrije Universiteit Amsterdam
The trace and Killing form
Let
be
and
. Then define
by
In the case
and
, this is called the Killing form.
In general, one calls
the trace form.
example
Let
and
, with the standard representation (see Lecture 1). Then
proposition
is symmetric.
proof
This follows from
.
proposition
is
-invariant, that is,
.
proof
Given the trivial action of
on
, one has
proposition
proof
From the
-invariance it follows that
Furthermore,
and
corollary
Let
be a Lie algebra. Then
Observe that this class is not trivial, since
is symmetric, not antisymmetric.
musical maps
Let
and define
by
proposition
proof
or
.
Define
by
Then
,
or
.
proposition
is an ideal.
proof
Let
, that is
for all
.
Then it follows from the invariance of
that
and therefore
for all
.
This shows that
.
The statement that
follows by a symmetry argument.
definition
A Leibniz algebra
is called simple if
and
contains no ideals besides
and itself.
proposition
If
is simple, then
.
proof
is an ideal, so it must equal
.
proposition
If
is nonzero, and
is simple, then
is injective.
proof
Let
. Then
for all
,
that is,
. But
must be zero, so
.
proposition
Let
be an ideal in
. Define
Then
is an ideal in
.
proof
Let
,
and
. Then
This shows that
and similarly
.
definition
One defines a series of ideals of
, the derived series, as follows.
If, for some
,
then
is called solvable.
well defined
is an ideal in
.
Suppose that
is an ideal for
.
Then
The inclusion
follows in a similar way.
By induction it follows that all the
's are ideals in
corollary
For
,
is an ideal in
.
remark
If
is solvable (that is,
for some
), then it contains an abelian ideal (namely
).
proposition
If
is solvable, then all its subalgebras and homomorphic images are.
proof
Let
be a subalgebra. Then
. Assume
. Then
and the statement is proved by induction.
Similarly, let
be surjective, and assume
to be surjective.
Then
proposition
If
is a solvable ideal such that
is solvable, then
is solvable.
proof
Say
. Let
be the canonical
projection. Then
or
. Since
,
,
implying the statement.
proposition
If
are solvable ideals of
, then so is
.
proof
One has
Since
is solvable, so is
.
But this implies that
, since
is solvable.
propostion
If
, there exists a unique maximal solvable ideal in
, the radical of
,
denoted by
.
proof
Let
be a maximal solvable ideal in
. Suppose
is another
solvable ideal. Then
is solvable, and by the maximality,
, that is,
.
definition
A Leibniz algebra
is called semisimple if
.
proposition
If
is simple, it is semisimple
proof
For a simple Leibniz algebra the derived series is stationary, that is,
for all
. The only other possible ideal is
, so this must be
.
proposition
is semisimple.
proof
Let
be a nonzero solvable ideal in
.
Then
strictly contains
,
which is in contradiction with its maximality. Thus
, that is,
is the zero ideal in
.
proposition
If
, then
is semisimple.
proof
Let
be an abelian ideal of
.
Take
.
Then
maps
to
.
Thus
. This implies that
In other words,
.
If there are no abelian ideals, then there are no solvable ideals besides
,
that is,
is semisimple.
theorem
Let
be a solvable subalgebra of
,
.
If
, then
contains a common eigenvector for all endomorphisms in
.
proof
Induction on
. Since
is solvable, it properly contains
, otherwise
for
.
Since
is abelian, subspaces are ideals.
Take a subspace of codimension one. Then the inverse image
in
is an ideal of codimension one which includes
.
is solvable, and by the induction assumption there exists a vector
such that
is an eigenvector for each
, that is,
(the exceptional case here is when
. In that case,
onedimensional and abelian,
so one takes an eigenvector of a generator of
).
Let
Now for
and
one finds
.
If one can prove that
then
is invariant under the action of
.
Fix
,
.
Let
be the smallest integer such that
are linearly dependent.
Let
and
be the subspace of
spanned by
. It follows that
and
.
Each
is invariant under
. The matrix of
is upper triangular
with eigenvalue
on the diagonal. This implies
.
Since
, one also has
Both
and
leave
invariant, so the trace of
must be zero.
Thus
.
This shows that
is invariant under the action of
.
Write
. Let
be an eigenvector of
(acting on
). Then
is a common eigenvector
of
.
definition (flag)
Let
be a finite dimensional vectorspace (
). A flag is a chain of subspaces
If
, one says that
leaves the flag invariant if
for
.
theorem (Lie)
Let
be a solvable subalgebra of
.
Then
leaves a flag in
invariant.
proof
It follows from the proof above that there exists a codimension one
-invariant subspace.
Let that be
. Repeat the argument starting with
instead of
and use induction.
lemma
Let
be solvable. Then there exists a flag of ideals
proof
Let
be a finite dimensional representation of
.
Then
is solvable, and stabilizes a flag in
.
Take
and
, then the
are ideals (since they are
-invariant)
and they obey the flag condition.
lemma
Let
be solvable. Then
implies that
is nilpotent.
proof
From the flag of ideals construct a basis. relative to this basis the matrix of
,
is upper triangular. Thus the matrix of
is strictly upper triangular, and therefore nilpotent.
remark
In the next lecture it is shown that this implies that
is nilpotent (to be defined).
| Invited by: | Dr. Eugene M. Izhikevich, Editor-in-Chief of Scholarpedia, the peer-reviewed open-access encyclopedia |
![K_\mathfrak{a}(z,[x,y])=-K_\mathfrak{a}(z,[y,x])=K_\mathfrak{a}([y,z],x)=K_\mathfrak{a}(x,[y,z])](/wiki/images/math/a0625f7e37d04c01bffe0da88bc86500.png)
