Lie Algebra Extensions and H2

Executive summary

H2 classifies extensions, and builds new algebras

An extension of g by an abelian ideal A determines an action of g on A, and with that action fixed the extensions are classified by H²(g, A). The construction mirrors the group case exactly: choose a linear section, measure its failure to preserve the bracket, obtain a 2-cocycle. The central extensions produced this way are not curiosities — the Heisenberg algebra and the affine Kac–Moody algebras are built precisely this way.

Learning objectives

Construct the 2-cocycle from a linear section.
State the classification by H².
Identify central extensions and their cocycle condition.
Give the standard examples.

Section 01The classification

AlgorithmFrom an extension to a cocyclein: an extension with abelian kernel → out: a class in H²

Given 0 → A → e → g → 0 with A abelian, choose a linear section s: g → e. A linear splitting always exists over a field.
Define the action of g on A by x·a = [s(x), a], independent of s since A is abelian.
Define f(x, y) = [s(x), s(y)] − s([x, y]), which lies in A.
The Jacobi identity in e forces the 2-cocycle condition on f.
Changing s by a linear map c: g → A changes f by the coboundary of c.
The class [f] ∈ H²(g, A) classifies the extension up to equivalence.

The cocycle condition

Explicitly, f must satisfy the alternating identity x·f(y,z) − y·f(x,z) + z·f(x,y) − f([x,y],z) + f([x,z],y) − f([y,z],x) = 0. This is the Jacobi identity for the twisted bracket, exactly as the group 2-cocycle condition is associativity.

Section 02Central extensions

With trivial action, A is central and the cocycle condition reduces to an alternating bilinear form f satisfying

f([x, y], z) + f([y, z], x) + f([z, x], y) = 0

Example

Heisenberg algebra

The central extension of an abelian Lie algebra with a symplectic form as cocycle. It is the algebra of position and momentum operators in quantum mechanics.

Example

Affine Kac–Moody algebras

The one-dimensional central extension of a loop algebra g ⊗ K[t, t⁻¹], with cocycle given by a residue pairing. The centre is what makes the representation theory rich.

Example

Virasoro algebra

The central extension of the Witt algebra of vector fields on the circle. The central charge appearing in conformal field theory is exactly the H² parameter.

Section 03Vanishing

For a semisimple Lie algebra over a field of characteristic zero, the second Whitehead lemma gives H²(g, A) = 0 for every finite-dimensional module. So every such extension splits.

The hypotheses are essential

Semisimplicity, characteristic zero and finite-dimensional coefficients are all needed. The affine and Virasoro algebras are central extensions of infinite-dimensional Lie algebras — precisely the setting where the Whitehead lemmas do not apply, and where the non-vanishing H² is the whole point.

ReferenceFrequently asked questions

Why is a linear section always available?

Because over a field every short exact sequence of vector spaces splits. So unlike the group case, where the section is merely a set map, here the section is linear and only the bracket fails to be preserved. This makes the cocycle bilinear.

What is the central charge?

The parameter labelling which multiple of the generating cocycle is used, when H² with trivial one-dimensional coefficients is one-dimensional. In conformal field theory it is a physical invariant of the theory.

Are all extensions of a Lie algebra classified by H²?

Only those with abelian kernel and a fixed action. For non-abelian kernels an outer action must be specified and an H³ obstruction appears, exactly parallel to the group case.

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 Lie Algebra Extensions and H2. 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 Lie Algebra Extensions and H2 as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—extensions, algebras, algebra, central, section—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 Lie Algebra Extensions and H2?