Unipotent representations of real reductive groups
Name
1191267388-MIT.pdf
Size
1003.65 KB
Format
Adobe PDF
Checksum (MD5)
4e4956bb15c33d31b8ba68399700ef2e
Author(s)
Mason-Brown, Lucas(Lucas David)
Advisor(s)
David Vogan.
Date Issued
2020
Publisher
Massachusetts Institute of Technology
Abstract
Let G be a real reductive group and let Ĝ be the set of irreducible unitary representations of G. The determination of Ĝ (for arbitrary G) is one of the fundamental unsolved problems in representation theory. In the early 1980s, Arthur introduced a finite set Unip(G) of (conjecturally unitary) irreducible representations of G called unipotent representations. In a certain sense, these representations form the build-ing blocks of Ĝ. Hence, the determination of Ĝ requires as a crucial ingredient the determination of Unip(G). In this thesis, we prove three results on unipotent representations. First, we study unipotent representations by restriction to K [subset symbol] G, a maximal compact subgroup. We deduce a formula for this restriction in a wide range of cases, proving (in these cases) a long-standing conjecture of Vogan. Next, we study the unipotent representations attached to induced nilpotent orbits. We find that Unip(G) is 'generated' by an even smaller set Unip2(G) consisting of representations attached to rigid nilpotent orbits. Finally, we study the unipotent representations attached to the principal nilpotent orbit. We provide a complete classification of such representations, including a formula for their K-types.
Description
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, May, 2020
Cataloged from the official PDF of thesis.
Includes bibliographical references (pages 207-210).
Subjects
Mathematics.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
MIT theses may be protected by copyright. Please reuse MIT thesis content according to the MIT Libraries Permissions Policy, which is available through the URL provided.
Persistent DSpace Link
