Euler-Poincar\'e pairing, Dirac index and elliptic pairing for Harish-Chandra modules
David Renard

TL;DR
This paper explores the relationships between three pairings of Harish-Chandra modules for real reductive groups, establishing their equivalence through index theory and connecting to character theory, thus extending known p-adic results to the archimedean setting.
Contribution
It demonstrates the equivalence of Euler-Poincaré, Dirac index, and elliptic pairings for Harish-Chandra modules using index theory and constructs index functions with specific orbital integral properties.
Findings
The Euler-Poincaré pairing equals the Dirac index pairing.
Both pairings are computed as indices of algebraic Fredholm pairs.
Index functions $f_X$ have orbital integrals matching module characters.
Abstract
Let be a connected real reductive group with maximal compact subgroup of equal rank, and let be the category of Harish-Chandra modules for . We relate three differentely defined pairings between two finite length modules and in : the Euler-Poincar\'e pairing, the natural pairing between the Dirac indices of and , and the elliptic pairing. (The Dirac index is a virtual finite dimensional representation of , the spin double cover of .) Analogy with the case of Hecke algebras and a formal (but not rigorous) computation lead us to conjecture that the first two pairings coincide. In the second part of the paper, we show that they are both computed as the indices of Fredholm pairs (defined here in an algebraic sense) of operators acting on the same spaces. We construct index functions for any finite length…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Geometry · Algebraic structures and combinatorial models · Algebraic Geometry and Number Theory
