Bourbaki

Exercise 20, § 1

Lie Groups and Lie Algebras, VI

Bourbaki marks this one as harder than the rest.

Let (α1,…,αl)(\alpha_1, \ldots, \alpha_l) be a basis of an irreducible reduced root system RR. Let rr and pp be two integers, with p≥2p \geq 2, such that:

(α1∣α1)=⋯=(αr∣αr)=p.(αr+1∣αr+1)=⋯=p.(αl∣αl). (\alpha_1|\alpha_1) = \cdots = (\alpha_r|\alpha_r) = p.(\alpha_{r+1}|\alpha_{r+1}) = \cdots = p.(\alpha_l|\alpha_l).

a) Let α=c1α1+⋯+clαl\alpha = c_1 \alpha_1 + \cdots + c_l \alpha_l be a root. Show that (α∣α)=(α1∣α1)(\alpha|\alpha) = (\alpha_1|\alpha_1) (in other words, that α\alpha is a long root) if and only if pp divides cr+1…clc_{r+1} \ldots c_l.

b) Let hh be the Coxeter number of W(R)W(R). Show that the number of longest (resp. shortest) roots of RR is equal to hrhr (resp. h(l−r)h(l-r)).

Solution

No solution has been written yet.

Transcribed from the printed volume. Not translated.