Chevalley's restriction theorem for reductive symmetric superpairs

Mathematics – Representation Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

35 pages; v4: revised submission to J.Alg., accepted for publication under the proviso of revision

Scientific paper

10.1016/j.jalgebra.2009.11.014

Let (g,k) be a reductive symmetric superpair of even type, i.e. so that there exists an even Cartan subspace a in p. The restriction map S(p^*)^k->S(a^*)^W where W=W(g_0:a) is the Weyl group, is injective. We determine its image explicitly. In particular, our theorem applies to the case of a symmetric superpair of group type, i.e. (k+k,k) with the flip involution where k is a classical Lie superalgebra with a non-degenerate invariant even form (equivalently, a finite-dimensional contragredient Lie superalgebra). Thus, we obtain a new proof of the generalisation of Chevalley's restriction theorem due to Sergeev and Kac, Gorelik. For general symmetric superpairs, the invariants exhibit a new and surprising behaviour. We illustrate this phenomenon by a detailed discussion in the example g=C(q+1)=osp(2|2q,C), endowed with a special involution. In this case, the invariant algebra defines a singular algebraic curve.

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

Chevalley's restriction theorem for reductive symmetric superpairs 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 Chevalley's restriction theorem for reductive symmetric superpairs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Chevalley's restriction theorem for reductive symmetric superpairs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-173343

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