A Steinberg Cross-Section for Non-Connected Affine Kac-Moody Groups

Mathematics – Representation Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

37 pages, 5 tables

Scientific paper

We generalise the concept of a Steinberg cross-section to non-connected Kac-Moody group. As in the connected case, which was treated by G. Br\"uchert, a quotient map w.r.t the conjugacy action exists only on a certain submonoid of the Kac-Moody group. Non-connected Kac-Moody groups appear naturally as semidirect product of \C^* with a central extension of loop groups LG, where the underlying simple group G is no longer simply connected and might even be non-connected. In contrast to the connected case, the understanding of central extensions of non-connected loop groups is a rather complicated issue. Following the approach of V. Toledano Laredo, who dealt with the case of automorphisms coming from the fundamental group pi_1(G), we classify all of these central extensions for cyclic component group of LG. Then, we define the quotient map w.r.t conjugacy action. Furthermore, we construct the cross-section in every connected component of LG and show that, due the one-dimensional centre, it carries a natural \C^*-action which does not exist in the finite dimensional case.

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

A Steinberg Cross-Section for Non-Connected Affine Kac-Moody Groups 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 A Steinberg Cross-Section for Non-Connected Affine Kac-Moody Groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Steinberg Cross-Section for Non-Connected Affine Kac-Moody Groups will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-585686

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