research34 min studyLesson 507 in Mathematics

Highest-weight modules and Verma modules

Construct an induced highest-weight module before taking the simple quotient, and keep finite-dimensional truncation explicit.

On this page

What you’ll understand

  • Specify a Borel and its one-dimensional highest-weight module.
  • Use PBW to explain the size and weight structure of a Verma module.
  • Identify a singular vector and the finite simple quotient in an sl(2) example.

A highest weight specifies how a preferred vector behaves under the Cartan and raising operators. It does not, by itself, say that the module is finite dimensional. The Verma module is the universal construction imposing those highest-vector relations and no finite lowering cutoff. Its unique simple quotient is a different object. Throughout the lesson g is a nonzero finite-dimensional complex semisimple Lie algebra, with a fixed Cartan subalgebra and chosen positive roots.

The Borel choice fixes what highest means

The positive roots determine n+ and the Borel subalgebra b=h⊕n+. The opposite root spaces form n−. For a weight λ in h*, define a one-dimensional b-module Cλ on which h acts by λ and n+ acts by zero. The universal enveloping algebra U(g) is the associative algebra encoding the relation xy−yx=[x,y]. Inducing Cλ from b to g produces the Verma module M(λ). Its distinguished generator is killed by every positive-root operator and has Cartan weight λ.

The Poincaré–Birkhoff–Witt theorem gives a vector-space identification of M(λ) with U(n−). Ordered monomials in negative-root vectors therefore form a basis on its highest generator. Since n− is nonzero, arbitrarily long lowering monomials exist, so every such Verma module is infinite dimensional, even when λ is integral and dominant. Each weight lies below λ by a nonnegative combination of positive roots, and individual weight spaces are finite dimensional. These facts depend on the chosen positive system, not on an unstated global maximum in every direction.

g=n−⊕h⊕n+,b=h⊕n+,M(λ)=U(g)⊗U(b)Cλ≃U(n−) as vector spaces\mathfrak g=\mathfrak n_-\oplus\mathfrak h\oplus\mathfrak n_+,\quad \mathfrak b=\mathfrak h\oplus\mathfrak n_+,\qquad M(\lambda)=U(\mathfrak g)\otimes_{U(\mathfrak b)}\mathbb C_\lambda\simeq U(\mathfrak n_-)\ \text{as vector spaces}
The generator satisfies n+vλ=0 and Hvλ=λ(H)vλ. The PBW identification is a vector-space statement; it does not turn the g-action into a trivial one.↔ Scroll wide equations horizontally.

A universal module and its simple quotient have different relations

Every module generated by a highest vector of weight λ is a quotient of M(λ), by the universal property of induction. A proper submodule cannot contain its one-dimensional top weight space, because that space generates the whole module. Summing proper submodules still misses that top space, leading to a unique maximal proper submodule. The resulting irreducible quotient is denoted L(λ). The quotient can impose lowering relations that are absent from the Verma module, which is precisely how finite-dimensional simple modules arise at dominant integral weights.

For sl(2), write vⱼ=fʲv₀ for every integer j≥0 in M(m). The same commutator calculation gives evⱼ=j(m−j+1)vⱼ₋₁, but there is no automatic endpoint. If m is a nonnegative integer, vₘ₊₁ is another highest vector because its raising coefficient vanishes. It generates a proper submodule, and quotienting by it leaves the finite string of dimension m+1. Before that quotient, calling M(m) the finite spin module would erase infinitely many basis vectors and the nontrivial submodule structure.

M(m):hvj=(m−2j)vj,evj=j(m−j+1)vj−1 (j≥0),m∈Z≥0⟹L(m)=M(m)/U(sl2)vm+1M(m):\quad hv_j=(m-2j)v_j,\quad ev_j=j(m-j+1)v_{j-1}\ (j\ge0),\qquad m\in\mathbb Z_{\ge0}\Longrightarrow L(m)=M(m)/U(\mathfrak{sl}_2)v_{m+1}
The parameter m may be any complex number in a Verma module. The displayed finite quotient requires m to be a nonnegative integer and explicitly kills the singular vector.↔ Scroll wide equations horizontally.

Infinite-dimensional highest-weight theory is not completely reducible

A Verma module can be reducible without splitting as a direct sum of its submodule and quotient. Finite-dimensional complete reducibility for semisimple g does not extend to this infinite-dimensional category. Submodule inclusions, singular vectors, and central characters become meaningful new data. They underpin category O, whose objects satisfy additional finite-generation, weight-space, and local raising-action conditions. Introducing that category requires its hypotheses; merely calling a module highest weight does not prove every categorical property one might want.

For an arbitrary complex λ, L(λ) exists but need not be finite dimensional. In rank one, M(m) is irreducible when m is not a nonnegative integer; the coefficient formula provides the key test. In higher rank, different root directions can produce more elaborate singular vectors, so one rank-one test does not replace the full submodule theory. The practical lesson is to record the Borel, the parameter, the universal construction, and the quotient relations separately before computing dimensions or applying a finite-dimensional character formula.

The infinite module above a three-dimensional quotient

In the sl(2) Verma module M(2), locate a nontrivial singular vector and describe L(2).

  1. The PBW basis vⱼ=fʲv₀ continues for all j≥0. Its weights are 2−2j, so v₃ has weight −4 and is nonzero in M(2).

  2. Its raising coefficient is 3(2−3+1)=0, hence ev₃=0. The submodule it generates contains v₃,v₄ and all later lowering vectors; it is the copy of M(−4) embedded by its highest generator.

  3. The quotient has basis represented by v₀,v₁,v₂ and kills all vⱼ with j≥3. Its raising and lowering actions are the finite irreducible L(2), of dimension three.

The result

M(2) is infinite dimensional and reducible; L(2) is its three-dimensional simple quotient. The same highest-weight label does not make those modules identical.

Explore the model

Interactive lab

Interactive lab · matrix

See a finite nilpotent action without imposing it universally

Reset, set a=1 and b=1. Subtract the identity from the selected matrix to obtain N=E₁₂. Predict Ne₂=e₁ and N²e₂=0. Compare a fresh run with Reset, a=1 and b=0, giving N=0 immediately. The instrument shows a two-dimensional finite representation; its nilpotence relation does not assert that the same power vanishes in every Verma module or in U(g).

See a finite nilpotent action without imposing it universallyThe selected matrix is A = [[a,b],[0,1]]. Playback interpolates geometry between the identity and A; readouts always describe A. Its determinant is a and its singular values come from AᵀA. Positive a makes every supported matrix invertible. This two-dimensional family is not a general eigensolver or a learned network. Current readings: Area scale · det A: 1.4; Singular values · σmax, σmin: 1.597, 0.876; Condition number · κ₂(A): 1.823. All parameters are adjustable with the labeled controls below.Matrix A with first row 1.4, 0.6 and second row zero, one; display interpolates between identity and A while final determinant remains 1.4.−4−2024−2−1012x · equal geometric scaleyA = [ 1.4 0.6 ; 0 1 ]Display blend: 0% · final values below
Interpolated geometryOriginal unit squareSelected final transform
Area scale · det A
1.4
Singular values · σmax, σmin
1.597, 0.876
Condition number · κ₂(A)
1.823
t = 0 s

The selected matrix is A = [[a,b],[0,1]]. Playback interpolates geometry between the identity and A; readouts always describe A. Its determinant is a and its singular values come from AᵀA. Positive a makes every supported matrix invertible. This two-dimensional family is not a general eigensolver or a learned network. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.

Look forA finite-dimensional matrix relation can be a property of one representation rather than a universal algebra relation.

Check your understanding

For a dominant integral weight λ and nonzero semisimple g, which distinction is correct?

Try it yourself

For sl(2), take the Verma module M(−1). Compute evⱼ for j≥1 and use it to explain why this module has no nontrivial proper submodule.

Take a moment to make a prediction or work it out on paper. Open a hint when you need one.

Give me a hint

Every nonzero weight vector is a multiple of some vⱼ. A submodule is h-stable, so a finite sum of distinct weights can be separated by polynomials in h.

Compare with the solution

The coefficient is j(−1−j+1)=−j², nonzero for every j≥1. Any nonzero submodule contains a nonzero weight vector by h-stability and polynomial projection among the finitely many components of a chosen vector. Repeated application of e then reaches a nonzero multiple of v₀. That vector generates all of M(−1), so the submodule is the whole module. Thus M(−1)=L(−1) is irreducible and infinite dimensional, illustrating why simplicity does not imply finite dimensionality.

Take it with you

  • A Borel and weight define a universal highest-weight module.
  • Verma modules retain infinite lowering directions until a quotient imposes relations.
  • Finite-dimensional complete reducibility does not describe the infinite-dimensional highest-weight category.

Read further

Original sources and deeper explanations to follow at your own pace.

Optional progress, saved in this browser when available. Revisit any lesson at any time.

Lesson not marked complete.