A more building-oriented proof of the ``saturation'' theorem of Kapovich-Leeb-Millson (Q386097)

From MaRDI portal
Revision as of 09:41, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A more building-oriented proof of the ``saturation'' theorem of Kapovich-Leeb-Millson
scientific article

    Statements

    A more building-oriented proof of the ``saturation'' theorem of Kapovich-Leeb-Millson (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 December 2013
    0 references
    The goal of this paper is to give an exposition, with a few simplification, of the proof of the ``saturation'' theorem, which was obtained by \textit{M. Kapovich} and \textit{J. J. Millson} after a series of papers with Leeb (see [Groups Geom. Dyn. 2, No. 3, 405--480 (2008; Zbl 1147.22011)] and references therein). Let \(G\) be a semisimple group over \(\mathbb C\), and \(G^\vee\) its Langlands dual. Denote \(V(\lambda)\) the irreducible representation of \(G^\vee\) of highest weight \(\lambda\). The question is to know what the multiplicity of \(V(\lambda)\) in \(V(\mu)\otimes V(\nu)\) is. The paper of Kapovich and Millson [loc. cit.], as well as the paper under review, use the LS-path model, introduced by \textit{P. Littelmann} [Invent. Math. 116, No. 1--3, 329--346 (1994; Zbl 0805.17019)], which links this representation-theoretic question to the combinatorics of the Bruhat-Tits building of \(G(\mathbb C(\!(t)\!))\). Kapovich and Millson introduced Hecke paths, which are more easily understood than LS-paths. The main improvement of the authors over the proof of Kapovich and Millson is in the study of these paths and of geodesic triangles in the building.
    0 references
    0 references
    Euclidean buildings
    0 references
    saturation theorem
    0 references
    LS path model
    0 references
    0 references