Math 2.0

Nonassociative rings and algebras Definition

Highest weight

Builds on Weight of a representationSemisimple Lie algebraCartan subalgebraSimple roots

Definition

Let 𝔤\mathfrak{g} be a complex semisimple Lie algebra with Cartan subalgebra 𝔥\mathfrak{h}. Choose a set of positive roots Φ+\Phi^+, with simple roots α1,…,αr\alpha_1, \dots, \alpha_r. For λ,μ∈𝔥∗\lambda, \mu \in \mathfrak{h}^* write μ≤λ\mu \le \lambda if λ−μ=∑iniαi\lambda - \mu = \sum_{i} n_i \alpha_i with all ni∈ℤ≥0n_i \in \Z_{\ge 0}. Let VV be a 𝔤\mathfrak{g}-module. A highest weight of VV is a weight λ\lambda of VV such that μ≤λ\mu \le \lambda for every weight μ\mu of VV. A highest weight vector is a nonzero vector of the weight space VλV_\lambda.

Remarks

Since ≤\le is a partial order, a highest weight is unique when it exists. A highest weight vector vv satisfies x⋅v=0x \cdot v = 0 for every root vector x∈𝔤αx \in \mathfrak{g}_\alpha with α∈Φ+\alpha \in \Phi^+, since λ+α\lambda + \alpha is not a weight. Example: for 𝔰𝔩n(ℂ)\mathfrak{sl}_n(\C) with diagonal 𝔥\mathfrak{h}, the module ℂn\C^n has weights ε1,…,εn\varepsilon_1, \dots, \varepsilon_n, where εi\varepsilon_i reads the ii-th diagonal entry. With simple roots αi=εi−εi+1\alpha_i = \varepsilon_i - \varepsilon_{i+1}, one has ε1−εj=α1+⋯+αj−1\varepsilon_1 - \varepsilon_j = \alpha_1 + \dots + \alpha_{j-1}, so ε1\varepsilon_1 is the highest weight and e1e_1 is a highest weight vector. Non-example: for 𝔰𝔩2(ℂ)\mathfrak{sl}_2(\C), identify weights with numbers by λ↦λ(h)\lambda \mapsto \lambda(h), so that the simple root is 22. The module ℂ2⊕𝔰𝔩2(ℂ)\C^2 \oplus \mathfrak{sl}_2(\C) has weights 1,−11, -1 and 2,0,−22, 0, -2; since 2−1=12 - 1 = 1 is not an even integer, 1≰21 \not\le 2, and there is no highest weight. Each finite-dimensional irreducible module has a highest weight, and so does each module generated by a weight vector killed by all positive root vectors, such as a Verma module.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Cartan subalgebra concept
  2. Semisimple Lie algebra concept
  3. Simple roots concept
  4. Weight of a representation concept
  5. Highest weight definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Weight_(representation_theory)
About this page
TagAVWVVNH75X
URIm2://AVWVVNH75X
Kinddefinition
WritingW0 stub
MSC17B10, 17B20
DefinesHighest weight
UsesWeight of a representation, Semisimple Lie algebra, Cartan subalgebra, Simple roots
Changed3 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.