Generalized Harish-Chandra descent, Gelfand pairs and an Archimedean analog of Jacquet-Rallis' Theorem

Mathematics – Representation Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

A merge of arXiv:0803.3395 and arXiv:0803.3397 (with no additional material). Appendix D by Avraham Aizenbud, Dmitry Gourevitc

Scientific paper

10.1215/00127094-2009-044

In the first part of the paper we generalize a descent technique due to Harish-Chandra to the case of a reductive group acting on a smooth affine variety both defined over an arbitrary local field F of characteristic zero. Our main tool is the Luna Slice Theorem. In the second part of the paper we apply this technique to symmetric pairs. In particular we prove that the pairs (GL(n+k,F), GL(n,F) x GL(k,F)) and (GL(n,E), GL(n,F)) are Gelfand pairs for any local field F and its quadratic extension E. In the non-Archimedean case, the first result was proven earlier by Jacquet and Rallis and the second by Flicker. We also prove that any conjugation invariant distribution on GL(n,F) is invariant with respect to transposition. For non-Archimedean F the latter is a classical theorem of Gelfand and Kazhdan.

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

Generalized Harish-Chandra descent, Gelfand pairs and an Archimedean analog of Jacquet-Rallis' Theorem 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 Generalized Harish-Chandra descent, Gelfand pairs and an Archimedean analog of Jacquet-Rallis' Theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalized Harish-Chandra descent, Gelfand pairs and an Archimedean analog of Jacquet-Rallis' Theorem will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-117801

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