Canonical: https://knowlpedia.com/lie-groups/cartans-criterion-solvability/

# Cartan’s criterion for solvability

A Lie algebra over characteristic 0 is solvable iff a certain trace pairing vanishes on g × [g,g].

Let \(\mathfrak{g}\) be a finite-dimensional [Lie algebra](https://knowlpedia.com/lie-groups/lie-algebra/) over a field of characteristic \(0\), and let \(B\) be its [Killing form](https://knowlpedia.com/lie-groups/killing-form/):
\[
B(X,Y)=\mathrm{tr}(\mathrm{ad}_X\circ \mathrm{ad}_Y).
\]

Write \(\mathfrak{g}'=[\mathfrak{g},\mathfrak{g}]\) for the [derived subalgebra](https://knowlpedia.com/lie-groups/derived-subalgebra/).

**Theorem (Cartan’s criterion for solvability).** \(\mathfrak{g}\) is [solvable](https://knowlpedia.com/lie-groups/solvable-lie-algebra/) if and only if
\[
B(X,Y)=0 \quad \text{for all } X\in \mathfrak{g},\; Y\in \mathfrak{g}'.
\]
Equivalently,
\[
\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 [derived series](https://knowlpedia.com/lie-groups/derived-series-lie-algebra/), but Cartan’s criterion replaces an iterative bracket computation with a single trace-vanishing condition. It is particularly effective when \(\mathfrak{g}\) is presented as a subalgebra of \(\mathfrak{gl}(V)\), where [traces](https://knowlpedia.com/linear-algebra/trace/) 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 \(\mathrm{ad}\). Compare also [Cartan’s semisimplicity criterion](https://knowlpedia.com/lie-groups/cartans-criterion-semisimplicity/).
