Cartan’s criterion for solvability

A Lie algebra over characteristic 0 is solvable iff a certain trace pairing vanishes on g × [g,g].
Cartan’s criterion for solvability

Let g\mathfrak{g} be a finite-dimensional over a field of characteristic 00, and let BB be its :

B(X,Y)=tr(adXadY). B(X,Y)=\mathrm{tr}(\mathrm{ad}_X\circ \mathrm{ad}_Y).

Write g=[g,g]\mathfrak{g}'=[\mathfrak{g},\mathfrak{g}] for the .

Theorem (Cartan’s criterion for solvability). g\mathfrak{g} is if and only if

B(X,Y)=0for all Xg,  Yg. B(X,Y)=0 \quad \text{for all } X\in \mathfrak{g},\; Y\in \mathfrak{g}'.

Equivalently,

tr(adXadY)=0for all Xg,  Y[g,g]. \mathrm{tr}(\mathrm{ad}_X\circ \mathrm{ad}_Y)=0 \quad \text{for all } X\in \mathfrak{g},\; Y\in [\mathfrak{g},\mathfrak{g}].

Motivation. Solvability is defined in terms of the , but Cartan’s criterion replaces an iterative bracket computation with a single trace-vanishing condition. It is particularly effective when g\mathfrak{g} is presented as a subalgebra of gl(V)\mathfrak{gl}(V), where traces can be computed concretely.

Remark. The criterion is compatible with the heuristic that “brackets measure noncommutativity”: the condition tests how far commutators act nontrivially through ad\mathrm{ad}. Compare also .