Bourbaki

Proposition 9

Tag 0AUN, permanent. Cite it as [Bourbaki, Tag 0AUN].

Lie Groups and Lie Algebras, chapter VI, § 1. Root systems

Let α\alpha and β\beta be two non-proportional roots.

(i) The set I of integers j such that β+jα\beta + j\alpha is a root is an interval [−q,p][ -q, p ] in Z\mathbf{Z} containing 0. (ii) Let S be the set of β+jα\beta + j\alpha for j∈Ij \in \mathrm{I}. Then,

sα(S)=Sandsα(β+pα)=β−qα. s_{\alpha}(S) = S \quad \text{and} \quad s_{\alpha}(\beta + p\alpha) = \beta - q\alpha.
(iii) p−q=−n(β,α)p - q = -n(\beta, \alpha).

Clearly, 0∈I0 \in \mathrm{I}. Let pp (resp. −q-q) be the largest (resp. smallest) element of I. If not all the integers in [−q,p][ -q, p ] belong to I, there exist two integers r,sr, s in [−q,p][ -q, p ] with the following properties: s>r+1,s∈I,r∈I,r+k∉Is > r + 1, s \in \mathrm{I}, r \in \mathrm{I}, r + k \notin \mathrm{I} for 1≤k≤s−r−11 \leq k \leq s - r - 1. With the notation of the Cor. of Th. 1, (α∣β+sα)≤0,(α∣β+rα)≥0(\alpha|\beta + s\alpha) \leq 0, (\alpha|\beta + r\alpha) \geq 0, which is absurd because

(α∣β+sα)≤0>(α∣β+rα). (\alpha|\beta + s\alpha) \leq 0 > (\alpha|\beta + r\alpha).
This proves (i).

We have sα(β+jα)=β−n(β,α)α−jα=β+j′αs_{\alpha}(\beta + j\alpha) = \beta - n(\beta, \alpha)\alpha - j\alpha = \beta + j'\alpha with j′=−j−n(β,α)j' = -j - n(\beta, \alpha). Thus sα(S)⊆Ss_{\alpha}(S) \subseteq S and consequently sα(S)=Ss_{\alpha}(S) = S. Now j↦−j−n(β,α)j \mapsto -j - n(\beta, \alpha) is a decreasing bijection from I to I. It follows that, j′=−qj' = -q when j=pj = p, so that −q=−p−n(β,α)-q = -p - n(\beta, \alpha). This proves (ii) and (iii).

The set S is called the α\alpha-chain of roots defined by β\beta, β−qα\beta - q\alpha is its origin, β+pα\beta + p\alpha is its end, and p+qp + q is its length.

Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.

Cited by

Cites

Transcribed from the printed volume. Not translated.