The Adjoint representation of a Lie algebra is
The Killing form is the symmetric invariant bilinear form
Solved by gpt-5.6-sol high.
A vector subspace is an ideal of a Lie algebra when . A Nilpotent Lie algebra is one whose lower central series
eventually vanishes.
By the Engel theorem, the operators for a nilpotent complex Lie algebra can be represented simultaneously by strictly upper triangular matrices. Their products are strictly upper triangular and have zero trace. Hence
Solved by gpt-5.6-sol high.
A Solvable Lie algebra is one whose derived series
eventually vanishes. By the Lie theorem, the adjoint operators of a solvable complex Lie algebra are simultaneously upper triangular. If , then is a sum of commutators of upper triangular matrices and is therefore strictly upper triangular. For every , the product is strictly upper triangular, so
Thus
For a nonzero example, let have basis with . It is solvable because is abelian, but in the ordered basis ,
Solved by gpt-5.6-sol high.
Invariance of the Killing form gives
If , the right-hand side vanishes for every , so . Thus is an ideal.
Let . For and ,
The Cartan solvability criterion makes solvable. The kernel of the adjoint map on lies in its center and is abelian, so is itself solvable. This proves the Solvability of the radical of the Killing form.
Solved by gpt-5.6-sol high.
The Killing form of a complex Simple Lie algebra is nondegenerate. Since is also nondegenerate, there is a unique endomorphism of satisfying
Invariance of both forms gives
so intertwines the adjoint representation. That representation is irreducible because its invariant subspaces are ideals. The Schur lemma therefore gives . Since is nondegenerate, , and
This is the uniqueness of an invariant bilinear form on a simple Lie algebra.
Solved by gpt-5.6-sol high.
For , the Killing form of the special linear Lie algebra is
For and , its matrix on the Cartan part is
whose determinant is . Each pairs only with , with value . In the stated ordering, the remaining block is
whose determinant is . Therefore
Solved by gpt-5.6-sol high.

Articles by others on the same topic (0)

There are currently no matching articles.