24.06.2013 Views

For printing - MSP

For printing - MSP

For printing - MSP

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

38 CARINA BOYALLIAN<br />

where k ≤ [ n<br />

2 ] − 1.<br />

In order to complete this proof, we will need the following:<br />

Lemma 3.4. Take ν as above and consider R(0) ≥ 1 (otherwise, ν ≡ 0 by<br />

(1)). Then<br />

⎛<br />

⎞<br />

(3.5)<br />

i<br />

2(k − i) − 2 < n − ⎝2 R(k − j) ⎠ + 1 where i = 0, . . . , k − 1.<br />

j=0<br />

Proof. Since n = 2 k−1 j=0 R(k − j) + R(0) we have<br />

2(k − i) − 2 ≤ 2<br />

k−1<br />

j=i+1<br />

Then, (3.5) has been proved.<br />

R(k − j) + R(0) = n − 2<br />

< n − 2<br />

i<br />

R(k − j)<br />

j=0<br />

i<br />

R(k − j) + 1.<br />

j=0<br />

Proof of Proposition 3.2 (Continuation). Let define<br />

m−1 t=0 R(k − t),<br />

T (m) =<br />

0,<br />

if m > 0<br />

if m = 0 .<br />

(3.6)<br />

Now, it is easy to check, that Lemma 3.4 allows us to rewrite ν as follows:<br />

ν = 1<br />

<br />

k−1<br />

R(k−m) <br />

(eT (m)+j − en−T 2<br />

(m)−j+1)<br />

m=0 j=1<br />

<br />

2(k−m)−2+T (m)+j <br />

+<br />

[(eT (m)+j − es+1) + (es+1 − en−T (m)−j+1)]<br />

s=T (m)+j<br />

And so, Proposition 3.2 is proved. <br />

Proof of Theorem 2.1 for Sl(n, F) with F = R, C. This is immediate from<br />

Proposition 3.2, Theorem 3.1 and Proposition 1.5. <br />

4. Case Sp(2n, F), n > 2 with F = R, C.<br />

Now, assume that G = Sp(2n, R) or G = Sp(2n, C). In this case, Σ(g0, a0)<br />

is of type Cn, and identifying a C n we have that the restricted roots are<br />

{±ei ± ej, ±2el}. Put r = dimR F.<br />

Here, J G (ν) has integral infinitesimal character if and only if νi ∈ rZ.<br />

Take ν ∈ a ∗ , and replace it by a Weyl group conjugate, then we may assume<br />

.

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

Saved successfully!

Ooh no, something went wrong!