Canonical: https://knowlpedia.com/lie-groups/nilpotent-lie-algebra/

# Nilpotent Lie algebra

A Lie algebra whose lower central series reaches zero after finitely many steps.

Let \(\mathfrak g\) be a finite-dimensional [Lie algebra](https://knowlpedia.com/lie-groups/lie-algebra/).

The **lower central series** \(\gamma_\bullet(\mathfrak g)\) is defined by \(\gamma_1(\mathfrak g)=\mathfrak g\) and
\(\gamma_{k+1}(\mathfrak g)=[\mathfrak g,\gamma_k(\mathfrak g)]\) (see [lower central series](https://knowlpedia.com/lie-groups/lower-central-series-lie-algebra/)).

The Lie algebra \(\mathfrak g\) is **nilpotent** if there exists \(s\ge 1\) such that
\[
\gamma_{s+1}(\mathfrak g)=0.
\]

The smallest such \(s\) is the **nilpotency class** (or step).

## Immediate consequences

- \(\gamma_2(\mathfrak g)=[\mathfrak g,\mathfrak g]\) is the [derived subalgebra](https://knowlpedia.com/lie-groups/derived-subalgebra/); repeated commutators strictly decrease in size until they vanish.
- In any nonzero nilpotent Lie algebra, the [center](https://knowlpedia.com/lie-groups/center-of-a-lie-algebra/) is nontrivial (a standard structural feature used in many inductive arguments).
- Nilpotent implies [solvable](https://knowlpedia.com/lie-groups/solvable-lie-algebra/); see [nilpotent implies solvable](https://knowlpedia.com/lie-groups/nilpotent-implies-solvable-lemma/).

## Examples

- The Heisenberg Lie algebra is nilpotent of step \(2\); see [the Heisenberg algebra](https://knowlpedia.com/lie-groups/example-heisenberg-algebra/).
- Strictly upper triangular matrices form a nilpotent Lie algebra under commutator; see [strictly upper triangular matrices](https://knowlpedia.com/lie-groups/example-strictly-upper-triangular/).

## Remarks

Nilpotent Lie algebras are the infinitesimal counterparts of simply connected nilpotent Lie groups, where the [exponential map](https://knowlpedia.com/lie-groups/exponential-map-lie-group/) has especially strong global behavior and the [BCH formula](https://knowlpedia.com/lie-groups/baker-campbell-hausdorff-formula/) truncates after finitely many terms.
