Math 2.0

Nonassociative rings and algebras Definition

Littelmann path model

Builds on Semisimple Lie algebraCartan subalgebraSimple rootsCorootHighest weightWeight of a representation

Definition

Let 𝔤\mathfrak{g} be a complex semisimple Lie algebra with Cartan subalgebra 𝔥\mathfrak{h} and simple roots α1,…,αr\alpha_1, \dots, \alpha_r. Let X⊂𝔥∗X \subset \mathfrak{h}^* be the weight lattice, let XℝX_\R be its real span, and let α∨\alpha^\vee be the coroot of a simple root α\alpha. A path is a piecewise linear map π ⁣:[0,1]→Xℝ\pi \colon [0, 1] \to X_\R with π(0)=0\pi(0) = 0, taken up to reparametrisation. For a path π\pi and a simple root α\alpha, put h(t)=⟨π(t),α∨⟩h(t) = \ip{\pi(t)}{\alpha^\vee} and let mm be the minimum of hh on [0,1][0, 1]. The root operator fαf_\alpha is defined as follows.

  1. If h(1)−m<1h(1) - m < 1, then fαπ=0f_\alpha \pi = 0.
  2. Otherwise let t0t_0 be the largest tt with h(t)=mh(t) = m, and t1t_1 the smallest t≥t0t \ge t_0 with h(t)=m+1h(t) = m + 1.
  3. Then fαπ(t)=π(t)f_\alpha \pi(t) = \pi(t) for t≤t0t \le t_0, fαπ(t)=π(t0)+sα(π(t)−π(t0))f_\alpha \pi(t) = \pi(t_0) + s_\alpha(\pi(t) - \pi(t_0)) for t0≤t≤t1t_0 \le t \le t_1, and fαπ(t)=π(t)−αf_\alpha \pi(t) = \pi(t) - \alpha for t≥t1t \ge t_1.

Here sα(x)=x−⟨x,α∨⟩αs_\alpha(x) = x - \ip{x}{\alpha^\vee} \alpha is the simple reflection. For a dominant integral weight λ\lambda, let πλ(t)=tλ\pi_\lambda(t) = t\lambda. The path model of λ\lambda is the set B(λ)B(\lambda) of nonzero paths fαi1⋯fαikπλf_{\alpha_{i_1}} \cdots f_{\alpha_{i_k}} \pi_\lambda, over all k≥0k \ge 0 and all sequences of simple roots.

Remarks

Littelmann's character formula states ch⁡L(λ)=∑π∈B(λ)eπ(1)\operatorname{ch} L(\lambda) = \sum_{\pi \in B(\lambda)} e^{\pi(1)}, where L(λ)L(\lambda) is the irreducible module of highest weight λ\lambda. The same formula holds if πλ\pi_\lambda is replaced by any path from 00 to λ\lambda that stays in the dominant chamber. Example: for 𝔰𝔩2(ℂ)\mathfrak{sl}_2(\C), identify XℝX_\R with ℝ\R by λ↦λ(h)\lambda \mapsto \lambda(h), so that α=2\alpha = 2 and ⟨x,α∨⟩=x\ip{x}{\alpha^\vee} = x. For πn(t)=nt\pi_n(t) = nt one finds that fαkπnf_\alpha^k \pi_n goes down to −k-k and then up, ending at n−2kn - 2k, for 0≤k≤n0 \le k \le n. For k=nk = n the end value is −n-n and the minimum is −n-n, so clause 1 gives fαn+1πn=0f_\alpha^{n+1} \pi_n = 0. The endpoints n,n−2,…,−nn, n - 2, \dots, -n are the weights of L(n)L(n), each with multiplicity one. Non-example: the path π(t)=−t\pi(t) = -t does not stay in the dominant chamber, and fαπ=0f_\alpha \pi = 0 by clause 1. Its set of endpoints is {−1}\set{-1}, which is not the set of weights of any representation.

Reading path

To understand this page from the ground up, read these 7 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. Coroot concept
  3. Highest weight concept
  4. Semisimple Lie algebra concept
  5. Simple roots concept
  6. Weight of a representation concept
  7. Littelmann path model definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Littelmann_path_model
About this page
TagZYDN0V3WWY
URIm2://ZYDN0V3WWY
Kinddefinition
WritingW0 stub
MSC17B10, 05E10
DefinesLittelmann path model
UsesSemisimple Lie algebra, Cartan subalgebra, Simple roots, Coroot, Highest weight, Weight of a representation
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.