Equivalent characterizations of semisimplicity for Lie algebras
Semisimplicity is equivalent to nondegeneracy of the Killing form and to decomposition into simple ideals.
Theorem (TFAE: semisimplicity)
Let be a finite-dimensional Lie algebra over a field of characteristic (in particular over or ). The following are equivalent.
- No nonzero solvable ideals: is semisimple, i.e. it has no nonzero solvable ideal (equivalently, its radical is ).
- Nondegenerate Killing form: the Killing form is nondegenerate; compare nondegeneracy of the Killing form.
- Direct sum of simple ideals: is a (finite) direct sum of simple Lie algebras; see semisimple equals direct sum of simple ideals.
- Adjoint representation is completely reducible: the representation is completely reducible.
- Cartan-type trace criterion: satisfies a trace criterion equivalent to semisimplicity as in Cartan’s criterion for semisimplicity.
Context
These equivalences are used interchangeably in practice: (2) is often the fastest computational test, while (3) is the structural starting point for classification (compare classification of simple Lie algebras). Complete reducibility of representations (see Weyl’s theorem) is a major consequence of semisimplicity.