Affine Jacquet functors and Harish-Chandra categories

Mathematics – Representation Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

29 pages, AMS-Latex, v2 contains several minor changes

Scientific paper

We define an affine Jacquet functor and use it to describe the structure of induced affine Harish-Chandra modules at noncritical levels, extending the theorem of Kac and Kazhdan [KK] on the structure of Verma modules in the Bernstein-Gelfand-Gelfand categories O for Kac-Moody algebras. This is combined with a vanishing result for certain extension groups to construct a block decomposition of the categories of affine Harish-Chandra modules of Lian and Zuckerman [LZ]. The latter provides an extension of the works of Rocha-Caridi, Wallach [RW] and Deodhar, Gabber, Kac [DGK] on block decompositions of BGG categories for Kac-Moody algebras. We also prove a compatibility relation between the affine Jacquet functor and the Kazhdan-Lusztig tensor product. A modification of this is used to prove that the affine Harish-Chandra category is stable under fusion tensoring with the Kazhdan-Lusztig category (a case of our finiteness result [Y]) and will be further applied in studying translation functors for Kac-Moody algebras, based on the fusion tensor product.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Affine Jacquet functors and Harish-Chandra categories does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Affine Jacquet functors and Harish-Chandra categories, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Affine Jacquet functors and Harish-Chandra categories will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-37849

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.