06.08.2013 Views

subregular nilpotent representations of lie algebras in prime ...

subregular nilpotent representations of lie algebras in prime ...

subregular nilpotent representations of lie algebras in prime ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Proposition: Suppose that R has type Bn, Cn, orF4; ifR has type F4, assume<br />

that p>h+1. Let 2 C 0 0 , let be a long root with 2 J( ). If is <strong>subregular</strong>,<br />

then A( ) permutes transitively the isomorphism classes <strong>of</strong> simple modules <strong>in</strong> C<br />

with <strong>in</strong>variant f g.<br />

Remarks: 1)Wehave A( ) ' Z=2Z for the groups considered <strong>in</strong> the proposition,<br />

at least if p is large, see [20], 7.5. (In types Bn and Cn it su ces to assume that<br />

p>2, see [21], IV.2.26.)<br />

2) The claim is <strong>of</strong> course trivial <strong>in</strong> the (unexpected) case that there is only one<br />

isomorphism class <strong>of</strong> such modules. If however there are two and if L and L 0 are<br />

representatives for these classes, then the proposition imp<strong>lie</strong>s [by B.13(3)] that<br />

L and L 0 occur with the same multiplicity <strong>in</strong>Z ( ) <strong>in</strong> case (b + )=0. That<br />

multiplicity has then to be equal to m =2 <strong>in</strong> the notation from D.6(1).<br />

F.8. We look rstattype Bn. I shall now use freely the notations and assumptions<br />

from [10], Section 3. In particular, we have <strong>subregular</strong> with (x, ) 6= 0if<br />

and only if 2f 2; 3;:::; ng. Wework with an arbitrary 2 C0.<br />

We can nd <strong>in</strong> NG(T ) a representative g <strong>of</strong> s"1 with g = . (Each representative<br />

g will satisfy Ad(g)x, i 2 Kx, i for all i>1 s<strong>in</strong>ce s"1 i = i. Multiply<strong>in</strong>g<br />

g with a suitable element <strong>in</strong>T we can get Ad(g)x, i = x, i for all i>1. Then<br />

g = holds.)<br />

Claim: Suppose that 1 i 2n with bi

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!