HackerPapers

arXiv:1212.2192math.RT

Unitary representations of real reductive groups

Jeffrey Adams, Marc van Leeuwen, Peter Trapa, David A. Vogan

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

We present a finite algorithm for computing the set of irreducible unitary representations of a real reductive group G. The Langlands classification, as formulated by Knapp and Zuckerman, exhibits any representation with an invariant Hermitian form as a deformation of one of the unitary representations in Harish-Chandra's Plancherel formula. The behavior of these deformations was determined to a first approximation in the Kazhdan-Lusztig analysis of irreducible characters; more complete information comes from the Beilinson-Bernstein proof of the Jantzen conjectures. The basic idea of our algorithm is to follow the behavior of the signature of the Hermitian form through this deformation, counting changes through singularities of the form at reducibility points. An important technical tool is replacing the classical invariant form (in which the real form of the Lie algebra acts by skew-adjoint operators) by forms in which the compact form of the Lie algebra acts by skew-adjoint operators.

arXiv comments
Journal reference
DOI
Subjects
math.RTRepresentation Theory

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Jun 2017 to Jun 2017.

Comments linking this paper, per year.

Discussed in comments1 thread

    • The paper is here [1]. It begins with: """ The purpose of this paper is to give a finite algorithm for computing the set of irreducible unitary representations of a real reductive Lie group G. Before explaining the nature of the algorithm, it is worth recalling why this is an…

      mathgeniusView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.