Content deleted Content added
fixed typo in Lusztig's name |
Citation bot (talk | contribs) Misc citation tidying. | Use this bot. Report bugs. | #UCB_CommandLine |
||
(10 intermediate revisions by 9 users not shown) | |||
Line 1:
In [[mathematics]], the '''Littelmann path model''' is a [[combinatorics|combinatorial device]] due to [[Peter Littelmann]] for computing multiplicities ''without overcounting'' in the [[representation theory]] of symmetrisable [[Kac–Moody algebra]]s. Its most important application is to complex [[semisimple Lie algebra]]s or equivalently compact [[semisimple Lie group]]s, the case described in this article. Multiplicities in [[Weyl character formula|irreducible representations]], tensor products and [[branching rule]]s can be calculated using a [[graph theory|coloured directed graph]], with labels given by the [[root system|simple roots]] of the Lie algebra.
Developed as a bridge between the theory of [[crystal basis|crystal bases]] arising from the work of [[Masaki Kashiwara|Kashiwara]] and [[George Lusztig|Lusztig]] on [[quantum group]]s 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 [[root lattice|weight]] as well as a pair of '''root operators''' acting on paths for each [[root lattice|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
* For a given [[dominant weight]] '''λ''', find the weight multiplicities in the [[Weyl character formula|irreducible representation]] ''L''(λ) with highest weight λ.
Line 12:
* Suppose that <math>\mathfrak{g}_1</math> is the [[Levi decomposition|Levi component]] of a [[parabolic subalgebra]] of a semisimple Lie algebra <math>\mathfrak{g}</math>. For a given dominant highest weight '''λ''', determine the [[branching rule]] for decomposing the restriction of ''L''('''λ''') to <math>\mathfrak{g}_1</math>.<ref>Every complex semisimple Lie algebra <math>\mathfrak{g}</math> is the [[complexification]] of the Lie algebra of a compact connected simply connected semisimple Lie group. The subalgebra <math>\mathfrak{g}_1</math> corresponds to a maximal rank closed subgroup, i.e. one containing a maximal torus.</ref>
(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 [[Weyl character formula|explicit character formulas]],<ref>{{harvnb|Weyl|
* [[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>\mathfrak{gl}</math><sub>''m''+''n''</sub> to <math>\mathfrak{gl}</math><sub>''m''</sub> <math>\oplus</math> <math>\mathfrak{gl}</math><sub>''n''</sub> 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.<ref>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 [[
Littelmann's contribution was to give a unified combinatorial model that applied to all symmetrizable [[Kac–Moody algebra]]s and provided explicit subtraction-free combinatorial formulas for weight multiplicities, tensor product rules and [[branching rule]]s. 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 [[root lattice|simple root]] of <math>\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<ref>{{harvnb|Littelmann|
* The standard monomial theory of Lakshmibai and Seshadri arising from the geometry of [[Schubert variety|Schubert varieties]].
Line 108:
==References==
{{refbegin}}
*{{citation|title=Representations of Quantum Algebras and Combinatorics of Young Tableaux|first= Susumu |last=Ariki|series=University Lecture Series|volume=26|publisher=American Mathematical Society|year= 2002|isbn =0821832328}}
*{{citation|
*{{citation|title=Introduction to Quantum Groups and Crystal Bases|
|series=[[Graduate Studies in Mathematics]]|volume=42|publisher=American Mathematical Society}}
*{{citation|first=Ronald C.|last=King|title=S-functions and characters of Lie algebras and superalgebras|pages=226–261| series=IMA Vol. Math. Appl.|journal=Institute for Mathematics and Its Applications|volume= 19|publisher= Springer-Verlag|year=1990|bibcode=1990IMA....19..226K}}
*{{citation|first=James E.|last=Humphreys|year=1994|edition=2|isbn=
* {{citation|last=Littelmann|first=Peter|title=A Littlewood-Richardson rule for symmetrizable Kac-Moody algebras|journal= Invent. Math.|volume= 116|year=1994|pages=329–346|doi=10.1007/BF01231564|bibcode = 1994InMat.116..329L |s2cid=85546837}}
*{{citation| last=Littelmann|first= Peter|title=Paths and root operators in representation theory|journal=Ann. of Math.|volume= 142 |year=1995|pages= 499–525| doi=10.2307/2118553| jstor=2118553| issue=3| publisher=Annals of Mathematics}}
*{{citation|first=Peter|last=Littelmann|title=Characters of Representations and Paths in <math>\mathfrak{h}</math><sub>'''R'''</sub>*|pages=29–49|year=1997|journal=Proceedings of Symposia in Pure Mathematics|publisher=American Mathematical Society|volume=61|doi=10.1090/pspum/061/1476490}} [instructional course]
*{{citation|first=Dudley E.|last= Littlewood|authorlink=Dudley E. Littlewood|title= The Theory of Group Characters and Matrix Representations of Groups |url=https://books.google.com/books?id=C6xHHEaI-GcC |year=1977 |publisher=American Mathematical Society |isbn=978-0-8218-7435-6 |edition=2nd |orig-date=1950 |volume=357 |series=AMS Chelsea Publishing Series |ref={{harvid|Littlewood|1950}}}}
*{{citation|first=
*{{citation|last=Mathieu|first= Olivier|title=Le modèle des chemins, Exposé No. 798
▲*{{citation|last=Mathieu|first= Olivier|title=Le modèle des chemins, Exposé No. 798, |series= Séminaire Bourbaki (astérique)|volume= 37|url=http://www.numdam.org/numdam-bin/fitem?id=SB_1994-1995__37__209_0|year=1995}}
*{{citation|first=Sheila|last=Sundaram|title=Tableaux in the representation theory of the classical Lie groups|pages= 191–225|
series=IMA Vol. Math. Appl.|journal=Institute for Mathematics and Its Applications|volume= 19|publisher=Springer-Verlag |year=1990|bibcode=1990IMA....19..191S}}
*{{citation|first=Hermann|last=Weyl|authorlink=Hermann Weyl|title=The
{{refend}}
[[Category:Representation theory]]
|