“Littelmann path model”的意思、由来-开放百科全书

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]

(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 {{harvtxt|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

_n or the special linear Lie algebra

_n:^[5]^[6]^[7]^[8]

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

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:

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 {{harvtxt|Hong|Kang|2002|p=xv}}. In the case of complex semisimple Lie algebras, there is a simplified self-contained account in {{harvtxt|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

Let (H_α) be the basis of

consisting of "coroot" vectors, dual to basis of

* formed by simple roots (α). For fixed α and a path π, the function

has a minimum value M.

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

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

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

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:

If π is a path lying wholly inside the positive Weyl chamber, the Littelmann graph

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 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

with σ(1) = μ.

Generalized Littlewood–Richardson rule

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

where τ ranges over paths in

such that π

τ lies entirely in the positive Weyl chamber and

the concatenation π

τ (t) is defined as π(2t) for t ≤ 1/2 and π(1) + τ( 2t – 1) for t ≥ 1/2.

Branching rule

is the Levi component of a parabolic subalgebra of

with weight lattice P₁

P then

where the sum ranges over all paths σ in

which lie wholly in the positive Weyl chamber for

See also

Notes

1. ^{{harvnb|Weyl|1946}}
2. ^{{harvnb|Humphreys|1994}}
3. ^Every complex semisimple Lie algebra

is the complexification of the Lie algebra of a compact connected simply connected semisimple Lie group. The subalgebra

corresponds to a maximal rank closed subgroup, i.e. one containing a maximal torus.
4. ^{{harvnb|Weyl|1946|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. ^{{harvnb|Littlewood|1950}}
6. ^{{harvnb|Macdonald|1979}}
7. ^{{harvnb|Sundaram|1990}}
8. ^{{harvnb|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 {{harvtxt|King|1990}} and {{harvtxt|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. {{harvtxt|Berenstein|Zelevinsky|2001}} discuss how their method using convex polytopes, proposed in 1988, is related to Littelmann paths and crystal bases.
10. ^{{harvnb|Littelmann|2007}}

References

1997|journal=Proceedings of Symposia in Pure Mathematics|publisher=American Mathematical Society|volume=61|doi=10.1090/pspum/061/1476490}} [instructional course]

series=IMA Vol. Math. Appl.|journal=Institute for Mathematics and Its Applications|volume= 19|publisher=Springer-Verlag |year=1990|bibcode=1990IMA....19..191S}}