## Nilpotent and Solvable Lie Algebras

There are two big types of Lie algebras that we want to take care of right up front, and both of them are defined similarly. We remember that if and are ideals of a Lie algebra , then — the collection spanned by brackets of elements of and — is also an ideal of . And since the bracket of any element of with any element of is back in , we can see that . Similarly we conclude , so .

Now, starting from we can build up a tower of ideals starting with and moving down by . We call this the “derived series” of . If this tower eventually bottoms out at we say that is “solvable”. If is abelian we see that , so is automatically solvable. At the other extreme, if is simple — and thus not abelian — the only possibility is , so the derived series never gets down to , and thus is not solvable.

We can build up another tower, again starting with , but this time moving down by . We call this the “lower central series” or “descending central series” of . If this tower eventually bottoms out at we say that is “nilpotent”. Just as above we see that abelian Lie algebras are automatically nilpotent, while simple Lie algebras are never nilpotent.

It’s not too hard to see that for all . Indeed, to start. Then if then

so the assertion follows by induction. Thus we see that any nilpotent algebra is solvable, but solvable algebras are not necessarily nilpotent.

As some explicit examples, we look back at the algebras and . The second, as we might guess, is nilpotent, and thus solvable. The first, though, is merely solvable.

First, let’s check that is nilpotent. The obvious basis consists of all the matrix entries with , and we can know that

We have an obvious sense of the “level” of an element: the difference , which is well-defined on each basis element. We can tell that the bracket of two basis elements gives either zero or another basis element whose level is the sum of the levels of the first two basis elements. The ideal is spanned by all the basis elements of level . The ideal is then spanned by basis elements of level . And so it goes, each spanned by basis elements of level . But this must run out soon enough, since the highest possible level is . In terms of the matrix, elements of are zero everywhere on or below the diagonal; elements of are also zero one row above the diagonal; and so on, each step pushing the nonzero elements “off the edge” to the upper-right of the matrix. Thus is nilpotent, and thus solvable as well.

Turning to , we already know that , which we just showed to be solvable! We see that , which will eventually bottom out at , thus is solvable as well. However, we can also calculate that

and so the derived series of stops after the first term and never reaches . Thus this algebra is solvable, but not nilpotent.