Semisimple Lie Algebras and the Whitehead Lemmas

Executive summary

H1 = H2 = 0, and everything follows

For a semisimple Lie algebra over a field of characteristic zero, H¹(g, A) and H²(g, A) vanish for every finite-dimensional module. The first Whitehead lemma says every derivation is inner and every short exact sequence of modules splits — Weyl's complete reducibility theorem. The second says every extension by an abelian ideal splits, which combined with a further argument gives Levi's decomposition. Both are proved with the Casimir element.

Learning objectives

State both Whitehead lemmas.
Explain the role of the Casimir element in the proof.
Derive Weyl's complete reducibility theorem.
State Levi's theorem and its relation to H².

Section 01Semisimplicity and the Casimir

The Killing form is B(x, y) = tr(ad x ∘ ad y). Cartan's criterion: g is semisimple exactly when B is non-degenerate.

AlgorithmThe Casimir elementin: a semisimple g → out: a central element acting invertibly

Take a faithful finite-dimensional representation and the associated trace form, which is non-degenerate by semisimplicity.
Choose a basis x_i and the dual basis y_i with respect to that form.
Set c = ∑_i x_i y_i ∈ U(g).
c is central in U(g), so it acts as a scalar on each irreducible module by Schur's lemma. Centrality is the key computation.
That scalar is non-zero on any non-trivial irreducible, which is what makes the vanishing arguments work.

Section 02The two lemmas

First Whitehead lemmaH¹(g, A) = 0

Every derivation into a finite-dimensional module is inner. Equivalently, every short exact sequence of finite-dimensional modules splits.

Second Whitehead lemmaH²(g, A) = 0

Every extension of g by a finite-dimensional abelian ideal splits. This is the input to Levi's theorem.

The proof pattern

Decompose the module by the eigenvalues of the Casimir. On the part where it acts invertibly, cohomology vanishes because the Casimir acts both as an invertible scalar and as zero — the latter because it acts trivially on cohomology of the trivial module. On the trivial part, direct computation using semisimplicity of g finishes the argument.

Section 03Consequences

Consequence

Weyl complete reducibility

Every finite-dimensional representation of a semisimple Lie algebra in characteristic zero is a direct sum of irreducibles. This is the first Whitehead lemma restated.

Consequence

Levi decomposition

Every finite-dimensional Lie algebra is a semidirect sum of its radical and a semisimple subalgebra. The second Whitehead lemma supplies the splitting.

Consequence

Rigidity

H²(g, g) = 0 means semisimple Lie algebras admit no non-trivial deformations — they are rigid, which is why the classification by Dynkin diagrams is discrete.

Characteristic zero and finite dimension are both required

In characteristic p, complete reducibility fails and modular representation theory of Lie algebras resembles that of finite groups. For infinite-dimensional coefficients the lemmas also fail, which is exactly why affine and Virasoro central extensions exist.

ReferenceFrequently asked questions

Why is H²(g, g) = 0 a rigidity statement?

Because infinitesimal deformations of a Lie algebra structure are classified by H² with adjoint coefficients, and obstructions to extending them lie in H³. Vanishing of H² means no first-order deformation exists, so the structure cannot be deformed at all.

Is there a group-theoretic analogue?

Maschke's theorem is the analogue of the first Whitehead lemma, and the Schur–Zassenhaus theorem plays a role like the second. In both settings the mechanism is a form of averaging that requires the relevant order or characteristic condition.

What replaces the Casimir in characteristic p?

Nothing with the same force. The trace form can degenerate and the Casimir need not act invertibly, which is precisely why complete reducibility fails and why restricted Lie algebra cohomology is a separate subject.

NavigateContinue in this stream

Curated next steps from this page. The site also surfaces algorithmically related reading below.

ProvenanceSources and further reading

This page is an original KEVOS explanatory article. It presents the underlying mathematics — definitions, algorithms, complexity results and selection criteria — in KEVOS editorial voice. No text is reproduced from any copyrighted source. Where numerical tables are relevant, KEVOS links to live authoritative databases rather than republishing static values.

Handbook application: from concept to controlled practice

Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review Semisimple Lie Algebras and the Whitehead Lemmas. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.

The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.

Treat Semisimple Lie Algebras and the Whitehead Lemmas as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—whitehead, lemmas, casimir, section, semisimple—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.

For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.

A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.

Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.

Step-by-step operating method

Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.

Worked-example protocol

Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.

Stage	Record	Quality check
Input	Objects, domain, notation, assumptions	Every symbol is defined
Method	Permitted operation or cited result at each step	All hypotheses hold
Output	Exact result and representation	Correct type, domain and form
Verification	Substitution, invariant or alternative derivation	Independent agreement
Boundary test	Zero, identity, degenerate or failed hypothesis	Scope is understood

Common failure modes and recovery actions

1. Watch for

Using a theorem without checking every hypothesis.

Recovery: Return to the governing definition or requirement and restate the decision in one sentence.

2. Watch for

Treating a suggestive example as a proof of the general case.

Recovery: Separate evidence from assumption, assign an owner and set a date for validation.

3. Watch for

Changing notation or conventions part-way through an argument.

Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.

4. Watch for

Hiding a division-by-zero, convergence, finiteness or commutativity assumption.

Recovery: Record the consequence, decision and rationale, then update the controlled baseline.

5. Watch for

Reporting a computed result without a residual, substitution or structural check.

Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.

Review checklist

Can every symbol be traced to a definition or prior result?
Which hypothesis does each major step use?
Does the method cover zero, identity, degenerate and boundary cases?
Can the conclusion be checked by a second representation or calculation?
Are mandatory requirements distinguished from recommendations and illustrative values?
Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
Is there a named owner and a trigger for review, escalation, change or retirement?

Questions for deeper application

What is the most important distinction a practitioner must preserve when applying Semisimple Lie Algebras and the Whitehead Lemmas?