Littelmann path model

From HandWiki

In mathematics, the Littelmann path model is a combinatorial device due to Peter Littelmann for computing multiplicities without overcounting in the representation theory of symmetrisable Kac–Moody algebras. Its most important application is to complex semisimple Lie algebras or equivalently compact semisimple Lie groups, the case described in this article. Multiplicities in irreducible representations, tensor products and branching rules can be calculated using a coloured directed graph, with labels given by the simple roots of the Lie algebra.

Developed as a bridge between the theory of crystal bases arising from the work of Kashiwara and Lusztig on quantum groups and the standard monomial theory of C. S. Seshadri and Lakshmibai, Littelmann's path model associates to each irreducible representation a rational vector space with basis given by paths from the origin to a weight as well as a pair of root operators acting on paths for each simple root. This gives a direct way of recovering the algebraic and combinatorial structures previously discovered by Kashiwara and Lusztig using quantum groups.

Background and motivation

Some of the basic questions in the representation theory of complex semisimple Lie algebras or compact semisimple Lie groups going back to Hermann Weyl include:[1][2]

  • For a given dominant weight λ, find the weight multiplicities in the irreducible representation L(λ) with highest weight λ.
  • For two highest weights λ, μ, find the decomposition of their tensor product L(λ) [math]\displaystyle{ \otimes }[/math] L(μ) into irreducible representations.
  • Suppose that [math]\displaystyle{ \mathfrak{g}_1 }[/math] is the Levi component of a parabolic subalgebra of a semisimple Lie algebra [math]\displaystyle{ \mathfrak{g} }[/math]. For a given dominant highest weight λ, determine the branching rule for decomposing the restriction of L(λ) to [math]\displaystyle{ \mathfrak{g}_1 }[/math].[3]

(Note that the first problem, of weight multiplicities, is the special case of the third in which the parabolic subalgebra is a Borel subalgebra. Moreover, the Levi branching problem can be embedded in the tensor product problem as a certain limiting case.)

Answers to these questions were first provided by Hermann Weyl and Richard Brauer as consequences of explicit character formulas,[4] followed by later combinatorial formulas of Hans Freudenthal, Robert Steinberg and Bertram Kostant; see (Humphreys 1994). An unsatisfactory feature of these formulas is that they involved alternating sums for quantities that were known a priori to be non-negative. Littelmann's method expresses these multiplicities as sums of non-negative integers without overcounting. His work generalizes classical results based on Young tableaux for the general linear Lie algebra [math]\displaystyle{ \mathfrak{gl} }[/math]n or the special linear Lie algebra [math]\displaystyle{ \mathfrak{sl} }[/math]n:[5][6][7][8]

  • Issai Schur's result in his 1901 dissertation that the weight multiplicities could be counted in terms of column-strict Young tableaux (i.e. weakly increasing to the right along rows, and strictly increasing down columns).
  • The celebrated Littlewood–Richardson rule that describes both tensor product decompositions and branching from [math]\displaystyle{ \mathfrak{gl} }[/math]m+n to [math]\displaystyle{ \mathfrak{gl} }[/math]m [math]\displaystyle{ \oplus }[/math] [math]\displaystyle{ \mathfrak{gl} }[/math]n in terms of lattice permutations of skew tableaux.

Attempts at finding similar algorithms without overcounting for the other classical Lie algebras had only been partially successful.[9]

Littelmann's contribution was to give a unified combinatorial model that applied to all symmetrizable Kac–Moody algebras and provided explicit subtraction-free combinatorial formulas for weight multiplicities, tensor product rules and branching rules. He accomplished this by introducing the vector space V over Q generated by the weight lattice of a Cartan subalgebra; on the vector space of piecewise-linear paths in V connecting the origin to a weight, he defined a pair of root operators for each simple root of [math]\displaystyle{ \mathfrak{g} }[/math]. The combinatorial data could be encoded in a coloured directed graph, with labels given by the simple roots.

Littelmann's main motivation[10] was to reconcile two different aspects of representation theory:

  • The standard monomial theory of Lakshmibai and Seshadri arising from the geometry of Schubert varieties.
  • Crystal bases arising in the approach to quantum groups of Masaki Kashiwara and George Lusztig. Kashiwara and Lusztig constructed canonical bases for representations of deformations of the universal enveloping algebra of [math]\displaystyle{ \mathfrak{g} }[/math] depending on a formal deformation parameter q. In the degenerate case when q = 0, these yield crystal bases together with pairs of operators corresponding to simple roots; see (Ariki 2002).

Although differently defined, the crystal basis, its root operators and crystal graph were later shown to be equivalent to Littelmann's path model and graph; see (Hong Kang). In the case of complex semisimple Lie algebras, there is a simplified self-contained account in (Littelmann 1997) relying only on the properties of root systems; this approach is followed here.

Definitions

Let P be the weight lattice in the dual of a Cartan subalgebra of the semisimple Lie algebra [math]\displaystyle{ \mathfrak{g} }[/math].

A Littelmann path is a piecewise-linear mapping

[math]\displaystyle{ \pi:[0,1]\cap \mathbf{Q} \rightarrow P\otimes_{\mathbf{Z}}\mathbf{Q} }[/math]

such that π(0) = 0 and π(1) is a weight.

Let (H α) be the basis of [math]\displaystyle{ \mathfrak{h} }[/math] consisting of "coroot" vectors, dual to basis of [math]\displaystyle{ \mathfrak{h} }[/math]* formed by simple roots (α). For fixed α and a path π, the function [math]\displaystyle{ h(t)= (\pi(t), H_\alpha) }[/math] has a minimum value M.

Define non-decreasing self-mappings l and r of [0,1] [math]\displaystyle{ \cap }[/math] Q by

[math]\displaystyle{ l(t) = \min_{t\le s\le 1} (1,h(s)-M),\,\,\,\,\,\, r(t) = 1 - \min_{0\le s\le t} (1,h(s)-M). }[/math]

Thus l(t) = 0 until the last time that h(s) = M and r(t) = 1 after the first time that h(s) = M.

Define new paths πl and πr by

[math]\displaystyle{ \pi_r(t)= \pi(t) + r(t) \alpha,\,\,\,\,\,\, \pi_l(t) = \pi(t) - l(t)\alpha }[/math]

The root operators eα and fα are defined on a basis vector [π] by

  • [math]\displaystyle{ \displaystyle{ e_\alpha [\pi] = [\pi_r]} }[/math] if r (0) = 0 and 0 otherwise;
  • [math]\displaystyle{ \displaystyle{f_\alpha [\pi] = [\pi_l]} }[/math] if l (1) = 1 and 0 otherwise.

The key feature here is that the paths form a basis for the root operators like that of a monomial representation: when a root operator is applied to the basis element for a path, the result is either 0 or the basis element for another path.

Properties

Let [math]\displaystyle{ \mathcal{A} }[/math] be the algebra generated by the root operators. Let π(t) be a path lying wholly within the positive Weyl chamber defined by the simple roots. Using results on the path model of C. S. Seshadri and Lakshmibai, Littelmann showed that

  • the [math]\displaystyle{ \mathcal{A} }[/math]-module generated by [π] depends only on π(1) = λ and has a Q-basis consisting of paths [σ];
  • the multiplicity of the weight μ in the integrable highest weight representation L(λ) is the number of paths σ with σ(1) = μ.

There is also an action of the Weyl group on paths [π]. If α is a simple root and k = h(1), with h as above, then the corresponding reflection sα acts as follows:

  • sα [π] = [π] if k = 0;
  • sα [π]= fαk [π] if k > 0;
  • sα [π]= eα – k [π] if k < 0.

If π is a path lying wholly inside the positive Weyl chamber, the Littelmann graph [math]\displaystyle{ \mathcal{G}_\pi }[/math] is defined to be the coloured, directed graph having as vertices the non-zero paths obtained by successively applying the operators fα to π. There is a directed arrow from one path to another labelled by the simple root α, if the target path is obtained from the source path by applying fα.

  • The Littelmann graphs of two paths are isomorphic as coloured, directed graphs if and only if the paths have the same end point.

The Littelmann graph therefore only depends on λ. Kashiwara and Joseph proved that it coincides with the "crystal graph" defined by Kashiwara in the theory of crystal bases.

Applications

Character formula

If π(1) = λ, the multiplicity of the weight μ in L(λ) is the number of vertices σ in the Littelmann graph [math]\displaystyle{ \mathcal{G}_\pi }[/math] with σ(1) = μ.

Generalized Littlewood–Richardson rule

Let π and σ be paths in the positive Weyl chamber with π(1) = λ and σ(1) = μ. Then

[math]\displaystyle{ L(\lambda) \otimes L(\mu) = \bigoplus_\eta L(\lambda + \tau(1)), }[/math]

where τ ranges over paths in [math]\displaystyle{ \mathcal{G}_\sigma }[/math] such that π [math]\displaystyle{ \star }[/math] τ lies entirely in the positive Weyl chamber and the concatenation π [math]\displaystyle{ \star }[/math] τ (t) is defined as π(2t) for t ≤ 1/2 and π(1) + τ( 2t – 1) for t ≥ 1/2.

Branching rule

If [math]\displaystyle{ \mathfrak{g}_1 }[/math] is the Levi component of a parabolic subalgebra of [math]\displaystyle{ \mathfrak{g} }[/math] with weight lattice P1 [math]\displaystyle{ \supset }[/math] P then

[math]\displaystyle{ L(\lambda)|_{\mathfrak{g}_1} = \bigoplus_{\sigma} L_{\mathfrak{g}_1}(\sigma(1)), }[/math]

where the sum ranges over all paths σ in [math]\displaystyle{ \mathcal{G}_\pi }[/math] which lie wholly in the positive Weyl chamber for [math]\displaystyle{ \mathfrak{g}_1 }[/math].

See also

  • Crystal basis

Notes

  1. ↑ Weyl 1953
  2. ↑ Humphreys 1994
  3. ↑ Every complex semisimple Lie algebra [math]\displaystyle{ \mathfrak{g} }[/math] is the complexification of the Lie algebra of a compact connected simply connected semisimple Lie group. The subalgebra [math]\displaystyle{ \mathfrak{g}_1 }[/math] corresponds to a maximal rank closed subgroup, i.e. one containing a maximal torus.
  4. ↑ Weyl 1953, p. 230,312. The "Brauer-Weyl rules" for restriction to maximal rank subgroups and for tensor products were developed independently by Brauer (in his thesis on the representations of the orthogonal groups) and by Weyl (in his papers on representations of compact semisimple Lie groups).
  5. ↑ Littlewood 1950
  6. ↑ Macdonald 1998
  7. ↑ Sundaram 1990
  8. ↑ King 1990
  9. ↑ Numerous authors have made contributions, including the physicist R. C. King, and the mathematicians S. Sundaram, I. M. Gelfand, A. Zelevinsky and A. Berenstein. The surveys of (King 1990) and (Sundaram 1990) give variants of Young tableaux which can be used to compute weight multiplicities, branching rules and tensor products with fundamental representations for the remaining classical Lie algebras. (Berenstein Zelevinsky) discuss how their method using convex polytopes, proposed in 1988, is related to Littelmann paths and crystal bases.
  10. ↑ Littelmann 1997

References



Retrieved from "https://handwiki.org/wiki/index.php?title=Littelmann_path_model&oldid=3382524"