Bourbaki

§ 1. Root systems

In this paragraph, kk denotes a field of characteristic zero. From no. 3 onwards, we assume that k=Rk = \mathbf{R}.

1. Definition of a root system

Lemma 1

Let VV be a vector space over kk, RR a finite subset of VV generating VV. For any α∈R\alpha \in R such that α≠0\alpha \neq 0, there exists at most one reflection ss of VV such that s(α)=−αs(\alpha) = -\alpha and s(R)=Rs(R) = R.

Let GG be the group of automorphisms of VV leaving RR stable. Since RR generates VV, GG is isomorphic to a subgroup of the symmetric group of RR, and hence is finite. Let s,s′s, s' be reflections of VV such that s(α)=s′(α)=−αs(\alpha) = s'(\alpha) = -\alpha, s(R)=Rs(R) = R, s′(R)=Rs'(R) = R. Then t=ss′t = ss' belongs to GG, and hence is of finite order mm. On the other hand,

t(α)=αandt(x)≡xmod  .kαfor all x∈V. t(\alpha) = \alpha \quad \text{and} \quad t(x) \equiv x \mod. k\alpha \quad \text{for all } x \in V.

Hence, there exists a linear form ff on VV such that

t(x)=x+f(x)αfor all x∈V t(x) = x + f(x)\alpha \quad \text{for all } x \in V

and f(α)=0f(\alpha) = 0. By induction on nn, it follows that

tn(x)=x+nf(x)α for all x∈V. t^n(x) = x + nf(x)\alpha \text{ for all } x \in V.

Taking nn equal to mm, we see that mf(x)=0mf(x) = 0 for all x∈Vx \in V, so f=0f = 0, t=1t = 1 and s=s′s = s'.

Definition 1

Let VV be a vector space over kk, and RR a subset of VV. Then RR is said to be a root system in VV if the following conditions are satisfied:

(RS_I) RR is finite, does not contain 0, and generates VV. (RS_{II}) For all α∈R\alpha \in R, there exists an element α∨\alpha^\vee of the dual V∗V^* of VV such that ⟨α,α∨⟩=2\langle \alpha, \alpha^\vee \rangle = 2 and that the reflection sα,α∨s_{\alpha, \alpha^\vee} (cf. Chap. V, § 2) leaves RR stable.

(RS_{\text{III}}) For all α∈R\alpha \in \mathbf{R}, α∼(R)⊆Z\alpha^{\sim}(R) \subseteq \mathbf{Z}.

By Lemma 1, the reflection sα,α∼s_{\alpha,\alpha^{\sim}} (and hence also the linear form α∼\alpha^{\sim}) is determined uniquely by α\alpha, so (RS_{\text{III}}) makes sense. We put sα,α∼=sαs_{\alpha,\alpha^{\sim}} = s_{\alpha}. Then sα(x)=x−⟨α∼,x⟩αs_{\alpha}(x) = x - \langle \alpha^{\sim}, x \rangle \alpha for all x∈Vx \in V.

The elements of R are called the roots (of the system considered). The dimension of V is called the rank of the system.

The automorphisms of V that leave R stable are called the automorphisms of R. They form a finite group denoted by A(R). The subgroup of A(R) generated by the sαs_{\alpha} is called the Weyl group of R and is denoted by W(R), or simply by W.

Remark 1

Let k′k' be an extension of kk. Identify V canonically with a subset of V⊗k′V \otimes k' and V∗V^* with a subset of V∗⊗k′=(V⊗k′)∗V^* \otimes k' = (V \otimes k')^*. Then, R is a root system in V⊗k′V \otimes k', and the α∼\alpha^{\sim} are the same as before.

Lemma 2

Let R be a root system in V. Let (x∣y)(x|y) be a symmetric bilinear form on V, non-degenerate and invariant under W(R). Identify V with V∗V^* by means of this form. If α∈R\alpha \in R, then α\alpha is non-isotropic and

α∼=2α(α∣α). \alpha^{\sim} = \frac{2\alpha}{(\alpha|\alpha)}.

This follows from formula (4) of Chap. V, § 2, no. 3.

Proposition 1

Let VQV_Q (resp. VQ∗V_Q^*) be the Q-vector subspace of V (resp. V∗V^*) generated by the α\alpha (resp. the α∼\alpha^{\sim}). Then VQV_Q (resp. VQ∗V_Q^*) is a Q-structure on V (resp. V∗V^*) (Algebra, Chap. II, § 8, no. 1). The restriction to VQ×VQ∗V_Q \times V_Q^* of the canonical bilinear form on V×V∗V \times V^* gives an identification of each of the spaces VQ,VQ∗V_Q, V_Q^* with the dual of the other. The set R is a root system in VQV_Q.

If k=Rk = \mathbf{R}, there exists a scalar product on V invariant under W(R) (Integration, Chap. VII, § 3, no. 1, Prop. 1); Lemma 2 now shows that the α∼\alpha^{\sim} generate V∗V^*. By Remark 1, the α∼\alpha^{\sim} again generate V∗V^* if k=Qk = \mathbf{Q}. We now go to the general case. Put E = VQV_Q. By (RS_{\text{III}}), each α∼\alpha^{\sim} maps E to Q\mathbf{Q}, and so defines an element α~\tilde{\alpha} of E∗E^*. It is immediate that R is a root system in E, and that the element corresponding to α\alpha in E∗E^* is α~\tilde{\alpha}. By what we said above, the α~\tilde{\alpha} generate the vector space E∗E^*. Consider the canonical homomorphism i:E⊗Qk→Vi : E \otimes_Q k \to V, and its transpose ti:V∗→E∗⊗Qk^t i : V^* \to E^* \otimes_Q k. Since R generates V, ti^t i is injective; but the image of ti^t i contains the α~\tilde{\alpha}, so ti^t i is surjective. From this we conclude finally that i and ti^t i are isomorphisms. We can therefore identify V with E⊗kE \otimes k, V∗V^* with E∗⊗kE^* \otimes k, α∼\alpha^{\sim} with α~\tilde{\alpha}, and VQ∗V_Q^* with E∗E^*. Thus, VQV_Q (resp. VQ∗V_Q^*) is a Q-structure on V (resp. V∗V^*). The restriction to VQ×VQ∗V_Q \times V_Q^* of the canonical bilinear form on V×V∗V \times V^* can be identified with the canonical bilinear form on E×E∗E \times E^*, hence the proposition.

Remark 2

Proposition 1 reduces the study of root systems to the case k=Qk = \mathbf{Q}. Remark 1 reduces it further to the study of root systems in the real vector space VR=VQ⊗QRV_{\mathbf{R}} = V_{\mathbf{Q}} \otimes_{\mathbf{Q}} \mathbf{R}. The Weyl groups associated to these different systems are canonically identified.

Remark 3

Since the α~\alpha \tilde{} generate V∗V^*, the group W(R)W(R), considered as a subgroup of GL(VR)\mathbf{GL}(V_{\mathbf{R}}), is essential (Chap. V, § 3, no. 7). Moreover, the Cor. of Th. 1 of Chap. V, § 3, no. 2 shows that the only reflections belonging to W(R)W(R) are the sαs_{\alpha}.

Proposition 2

The α~\alpha \tilde{} form a root system in V∗V^*, and α~=α\alpha \tilde{} = \alpha for all α∈R\alpha \in R.

The α~\alpha \tilde{} satisfy (RS_I) by Prop. 1. Since sα,α~s_{\alpha, \alpha \tilde{}} is an automorphism of the vector space VV equipped with the subset RR, t(sα,α~)−1{}^t(s_{\alpha, \alpha \tilde{}})^{-1} leaves the set R~R \tilde{} of the α~\alpha \tilde{} stable; but t(sα,α~)−1=sα~,α{}^t(s_{\alpha, \alpha \tilde{}})^{-1} = s_{\alpha \tilde{}, \alpha}, which proves that R~R \tilde{} satisfies (RS_{II}) and that α~=α\alpha \tilde{} = \alpha. Finally, ⟨α~,β⟩∈Z\langle \alpha \tilde{}, \beta \rangle \in \mathbf{Z} for all α~∈R~\alpha \tilde{} \in R \tilde{} and β∈R\beta \in R, so R~R \tilde{} satisfies (RS_{III}).

The set R~R \tilde{} is called the inverse root system of RR. The map α↦α~\alpha \mapsto \alpha \tilde{} is a bijection from RR to R~R \tilde{}, called the canonical bijection from RR to R~R \tilde{}. Note that, if α,β\alpha, \beta are elements of RR such that α+β∈R\alpha + \beta \in R, then (α+β)~≠α~+β~(\alpha + \beta) \tilde{} \neq \alpha \tilde{} + \beta \tilde{} in general.

Since sα(α)=−αs_{\alpha}(\alpha) = -\alpha, axiom (RS_{II}) shows that −R=R-R = R. Evidently (−α)~=−α~(-\alpha) \tilde{} = -\alpha \tilde{} and −1∈A(R)-1 \in A(R) (but it is not always true that −1∈W(R)-1 \in W(R)).

The equality t(sα,α~)−1=sα~,α{}^t(s_{\alpha, \alpha \tilde{}})^{-1} = s_{\alpha \tilde{}, \alpha} shows that the map u↦tu−1u \mapsto {}^t u^{-1} is an isomorphism from the group W(R)W(R) to the group W(R~)W(R \tilde{}). We identify these two groups by means of this isomorphism; in other words, we consider W(R)W(R) as acting both in VV and in V∗V^*. Similarly for A(R)A(R).

Proposition 3

For x,y∈Vx, y \in V, put*

(x∣y)=∑α∈R⟨α~,x⟩⟨α~,y⟩. (x|y) = \sum_{\alpha \in R} \langle \alpha \tilde{}, x \rangle \langle \alpha \tilde{}, y \rangle.
Then (x∣y)(x|y) is a non-degenerate symmetric bilinear form on VV, invariant under A(R)A(R). For x,y∈VQx, y \in V_{\mathbf{Q}} we have (x∣y)∈Q(x|y) \in \mathbf{Q}. The canonical extension of (x∣y)(x|y) to
VR=VQ⊗QR V_{\mathbf{R}} = V_{\mathbf{Q}} \otimes_{\mathbf{Q}} \mathbf{R}
is non-degenerate and positive.

It is clear that (x∣y)(x|y) is a symmetric bilinear form on VV. If g∈A(R)g \in A(R),

(g(x)∣g(y))=∑α∈R⟨tg(α~),x⟩⟨tg(α~),y⟩=(x∣y) (g(x)|g(y)) = \sum_{\alpha \in R} \langle {}^t g(\alpha \tilde{}), x \rangle \langle {}^t g(\alpha \tilde{}), y \rangle = (x|y)
since tg)(R~)=R~{}^t g)(R \tilde{}) = R \tilde{}. If x,y∈VQx, y \in V_{\mathbf{Q}}, then (x∣y)∈Q(x|y) \in \mathbf{Q} by (RS_{III}). If z∈VRz \in V_{\mathbf{R}}, then (z∣z)=∑α∈R⟨α~,z⟩2≥0(z|z) = \sum_{\alpha \in R} \langle \alpha \tilde{}, z \rangle^2 \geq 0, and (z∣z)>0(z|z) > 0 if z≠0z \neq 0 by Prop. 1, so the canonical extension of (x∣y)(x|y) to VRV_{\mathbf{R}} is positive and non-degenerate. The restriction of (x∣y)(x|y) to VQV_{\mathbf{Q}} is thus non-degenerate, and hence the form (x∣y)(x|y) on VV is non-degenerate.

Proposition 4

(i) *Let XX be a subset of R\mathbf{R}, let VXV_X be the vector subspace of VV generated by XX, and let VX′V'_X be the vector subspace of V∗V^* generated by the α−\alpha^-, where α∈X\alpha \in X. Then VV is the direct sum of VXV_X and the orthogonal complement of VX′V'_X; V∗V^* is the direct sum of VX′V'_X and the orthogonal complement of VXV_X, and VX′V'_X is identified with the dual of VXV_X.

(ii) R∩VXR \cap V_X is a root system in VXV_X, and the canonical bijection from R∩VXR \cap V_X to its inverse root system is identified with the restriction of the map α↦α−\alpha \mapsto \alpha^- to R∩VXR \cap V_X.

By Remark 2, we can assume that k=Rk = \mathbf{R}. Identify VV with V∗V^* by means of the symmetric bilinear form of Prop. 3. We have α−=2α(α∣α)\alpha^- = \frac{2\alpha}{(\alpha|\alpha)} for all α∈R\alpha \in R (Lemma 2). Every vector subspace of VV is non-isotropic, and the proposition is now clear.

Corollary

Let V1V_1 be a vector subspace of VV, and let V2V_2 be the vector subspace generated by R∩V1R \cap V_1. Then R∩V1R \cap V_1 is a root system in V2V_2.

This follows from (ii) applied to X=R∩V1X = R \cap V_1.

For α,β∈R\alpha, \beta \in R, put

⟨α,β−⟩=n(α,β). \langle \alpha, \beta^- \rangle = n(\alpha, \beta).
(1)

Then

n(α,α)=2 n(\alpha, \alpha) = 2
(2)
n(−α,β)=n(α,−β)=−n(α,β). n(-\alpha, \beta) = n(\alpha, -\beta) = -n(\alpha, \beta).
(3)

By (RSIII),

n(α,β)∈Z. n(\alpha, \beta) \in \mathbf{Z}.
(4)

By the definition of n(α,β)n(\alpha, \beta),

sβ(α)=α−n(α,β)β. s_\beta(\alpha) = \alpha - n(\alpha, \beta)\beta.
(5)

Formula (1) and Prop. 2 imply that

n(α,β)=n(β−,α−). n(\alpha, \beta) = n(\beta^-, \alpha^-).
(6)

Let (x∣y)(x|y) be a symmetric bilinear form on VV, non-degenerate and invariant under W(R)W(R) (Prop. 3). By Lemma 2,

n(α,β)=2(α∣β)(β∣β). n(\alpha, \beta) = \frac{2(\alpha|\beta)}{(\beta|\beta)}.
(7)

It follows that

n(α,β)=0  ⟺  n(β,α)=0  ⟺  (α∣β)=0  ⟺  sα and sβ commute. n(\alpha, \beta) = 0 \iff n(\beta, \alpha) = 0 \iff (\alpha|\beta) = 0 \iff s_\alpha \text{ and } s_\beta \text{ commute.}
(8)

If (α∣β)≠0(\alpha|\beta) \neq 0, then

n(β,α)n(α,β)=(β∣β)(α∣α). \frac{n(\beta, \alpha)}{n(\alpha, \beta)} = \frac{(\beta|\beta)}{(\alpha|\alpha)}.
(9)

2. Direct sum of root systems

Let V be a vector space over kk that is the direct sum of a family (Vi)1≤i≤r(V_i)_{1 \leq i \leq r} of vector spaces. Identify V∗V^* with the direct sum of the Vi∗V_i^*. For all ii, let RiR_i be a root system in ViV_i. Then R=⋃iRiR = \bigcup_i R_i is a root system in V whose inverse system is R−=⋃iRi−R^- = \bigcup_i R_i^-; the canonical bijection from R to R−R^- extends, for all ii, the canonical bijection from RiR_i to Ri−R_i^-. The set R is called the direct sum of the root systems RiR_i. Let α∈Ri\alpha \in R_i. If j≠ij \neq i, the kernel of α−\alpha^- contains VjV_j, so sαs_\alpha induces the identity on VjV_j; on the other hand, kα⊆Vik\alpha \subseteq V_i, so sαs_\alpha leaves ViV_i stable. These remarks show that W(R)W(R) can be identified with ∏i=1rW(Ri)\prod_{i=1}^r W(R_i).

A root system R is said to be irreducible if R≠∅R \neq \varnothing and if R is not the direct sum of two non-empty root systems.

Proposition 5

Let V be a vector space over k that is the direct sum of vector spaces* V1,…,VrV_1, \ldots, V_r. Let R be a root system in V. Put Ri=R∩ViR_i = R \cap V_i. The following three conditions are equivalent:

(i) the ViV_i are stable under W(R)W(R); (ii) R⊆V1∪V2∪⋯∪VrR \subseteq V_1 \cup V_2 \cup \cdots \cup V_r; (iii) for all ii, RiR_i is a root system in ViV_i, and R is the direct sum of the RiR_i. (iii) ⟹\Longrightarrow (i): this follows from what we said at the beginning of this number.

(i) ⟹\Longrightarrow (ii): assume that the ViV_i are stable under W(R)W(R). Let α∈R\alpha \in R and let H be the kernel of α−\alpha^-. By Prop. 3 of Chap. V, § 2, no. 2, each ViV_i is the sum of a subspace of H and a subspace of kαk\alpha. Hence one of the ViV_i contains kαk\alpha, so α∈V1∪V2∪⋯∪Vr\alpha \in V_1 \cup V_2 \cup \cdots \cup V_r.

(ii) ⟹\Longrightarrow (iii): if condition (ii) is satisfied, RiR_i generates ViV_i for all ii, so RiR_i is a root system in ViV_i (Prop. 4). It is clear that R is the direct sum of the RiR_i.

Corollary

Let R be a root system in V. The following conditions are equivalent*: (i) R is irreducible; (ii) the W(R)W(R)*-module* V is simple; (iii) the W(R)W(R)*-module* V is absolutely simple. (ii) ⟺\Longleftrightarrow (i): this follows from Prop. 5 and Maschke's Theorem (Chap. V, Appendix, Prop. 2). (iii) ⟺\Longleftrightarrow (ii): this follows from Prop. 1 of Chap. V, § 2, no. 1.

Proposition 6

Every root system* R in V is the direct sum of a family (Ri)i∈I(R_i)_{i \in I} of irreducible root systems that is unique up to a bijection of the index set.

The existence of the RiR_i is proved by induction on Card R: if R is non-empty and not irreducible, R is the direct sum of two root systems R′,R′′R', R'' such that Card R′<R' < Card RR, Card R′′<R'' < Card RR, and the induction hypothesis applies to R′R' and R′′R''. To prove uniqueness, it suffices to prove that, if RR is the direct sum of R′R' and R′′R'', every RiR_i is necessarily contained either in R′R' or in R′′R''. Let V′,V′′,Vi′,Vi′′V', V'', V'_i, V''_i be the vector subspaces of VV generated by R′,R′′,R′∩Ri,R′′∩RiR', R'', R' \cap R_i, R'' \cap R_i. Since the sum V′+V′′V' + V'' is direct, the sum Vi′+Vi′′V'_i + V''_i is direct. Since Ri⊆R′∪R′′R_i \subseteq R' \cup R'', RiR_i is the direct sum of the root systems R′∩RiR' \cap R_i and R′′∩RiR'' \cap R_i; hence either R′∩Ri=∅R' \cap R_i = \varnothing or R′′∩Ri=∅R'' \cap R_i = \varnothing, which proves the assertion.

The RiR_i are called the irreducible components of RR. For any non-zero scalars λi\lambda_i, the union of the λiRi\lambda_i R_i is a root system in VV, whose inverse system is the union of the λi−1Ri\lambda_i^{-1} R_i, and whose Weyl group is W(R)W(R).

Proposition 7

Let RR be a root system in VV, (Ri)(R_i) the family of its irreducible components, ViV_i the vector subspace of VV generated by RiR_i, BB the invariant symmetric bilinear form on VV defined in Prop. 3, and B′B' a symmetric bilinear form on VV invariant under W(R)W(R). Then the ViV_i are pairwise orthogonal with respect to B′B', and, for all ii, the restrictions of BB and B′B' to ViV_i are proportional.

If vi∈Vi,vj∈Vj,i≠jv_i \in V_i, v_j \in V_j, i \neq j, and if w∈W(Rj)w \in W(R_j), then

B′(vi,w(vj))=B′(vi,vj), B'(v_i, w(v_j)) = B'(v_i, v_j),
which shows that w(vj)−vjw(v_j) - v_j is orthogonal to viv_i with respect to B′B'. Since VjV_j is irreducible for W(Rj)W(R_j), it is generated by the w(vj)−vjw(v_j) - v_j, and it is therefore orthogonal to ViV_i.

The fact that the restrictions of BB and B′B' to each of the ViV_i are proportional follows from Prop. 1 of Chap. V, § 2, no. 1.

Remark

Choose a scalar product on VRV_R invariant under W(R)W(R). It is then possible to speak of the length of a root and the angle between two roots. Prop. 7 shows that this angle is independent of the choice of scalar product, as is the ratio of the lengths of two roots, provided they belong to the same irreducible component of RR.

3. Relation between two roots

Recall that we assume from now on that k=Rk = \mathbf{R}. (We leave to the reader the task of extending the definitions and results to the general case, by using the method indicated in Remark 2 of no. 1.)

Throughout the following, RR denotes a root system in a vector space VV; and VV is equipped with a scalar product (x,y)↦(x∣y)(x, y) \mapsto (x|y) invariant under W(R)W(R), cf. Prop. 3.

Let α,β∈R\alpha, \beta \in R. By formula (7) of no. 1,

n(α,β)n(β,α)=4cos⁡2(α,β^)≤4. n(\alpha, \beta)n(\beta, \alpha) = 4 \cos^2 (\widehat{\alpha, \beta}) \leq 4.

Thus, the integer n(α,β)n(β,α)n(\alpha, \beta)n(\beta, \alpha) must take one of the values 0, 1, 2, 3, 4. In view of Chap. V, § 2, no. 5, Cor. of Prop. 6, and of the footnote on the page of Chap. V, § 4, no. 8, we see that the only possibilities are the following, up to interchanging α\alpha and β\beta:

1) n(α,β)=n(β,α)=0;n(\alpha, \beta) = n(\beta, \alpha) = 0;

(α,β‾)=π2;sαsβ of order 2; (\overline{\alpha, \beta}) = \frac{\pi}{2}; \quad s_{\alpha}s_{\beta} \text{ of order } 2;
2) n(α,β)=n(β,α)=1;n(\alpha, \beta) = n(\beta, \alpha) = 1;
(α,β‾)=π3;sαsβ of order 3; (\overline{\alpha, \beta}) = \frac{\pi}{3}; \quad s_{\alpha}s_{\beta} \text{ of order } 3;
∥α∥=∥β∥; \| \alpha \| = \| \beta \|;
3) n(α,β)=n(β,α)=−1;n(\alpha, \beta) = n(\beta, \alpha) = -1;
(α,β‾)=2π3;sαsβ of order 3; (\overline{\alpha, \beta}) = \frac{2\pi}{3}; \quad s_{\alpha}s_{\beta} \text{ of order } 3;
∥α∥=∥β∥; \| \alpha \| = \| \beta \|;
4) n(α,β)=1, n(β,α)=2;n(\alpha, \beta) = 1,\ n(\beta, \alpha) = 2;
(α,β‾)=π4;sαsβ of order 4; (\overline{\alpha, \beta}) = \frac{\pi}{4}; \quad s_{\alpha}s_{\beta} \text{ of order } 4;
∥β∥=2 ∥α∥; \| \beta \| = \sqrt{2}\ \| \alpha \|;
5) n(α,β)=−1, n(β,α)=−2;n(\alpha, \beta) = -1,\ n(\beta, \alpha) = -2;
(α,β‾)=3π4;sαsβ of order 4; (\overline{\alpha, \beta}) = \frac{3\pi}{4}; \quad s_{\alpha}s_{\beta} \text{ of order } 4;
∥β∥=2 ∥α∥; \| \beta \| = \sqrt{2}\ \| \alpha \|;
6) n(α,β)=1, n(β,α)=3;n(\alpha, \beta) = 1,\ n(\beta, \alpha) = 3;
(α,β‾)=π6;sαsβ of order 6; (\overline{\alpha, \beta}) = \frac{\pi}{6}; \quad s_{\alpha}s_{\beta} \text{ of order } 6;
∥β∥=3 ∥α∥; \| \beta \| = \sqrt{3}\ \| \alpha \|;
7) n(α,β)=−1, n(β,α)=−3;n(\alpha, \beta) = -1,\ n(\beta, \alpha) = -3;
(α,β‾)=5π6;sαsβ of order 6; (\overline{\alpha, \beta}) = \frac{5\pi}{6}; \quad s_{\alpha}s_{\beta} \text{ of order } 6;
∥β∥=3 ∥α∥; \| \beta \| = \sqrt{3}\ \| \alpha \|;
8) n(α,β)=n(β,α)=2;n(\alpha, \beta) = n(\beta, \alpha) = 2;
α=β; \alpha = \beta;
9) n(α,β)=n(β,α)=−2;n(\alpha, \beta) = n(\beta, \alpha) = -2;
α=−β; \alpha = -\beta;
10) n(α,β)=1, n(β,α)=4;n(\alpha, \beta) = 1,\ n(\beta, \alpha) = 4;
β=2α; \beta = 2\alpha;
11) n(α,β)=−1, n(β,α)=−4;n(\alpha, \beta) = -1,\ n(\beta, \alpha) = -4;
β=−2α. \beta = -2\alpha.

In particular:

Proposition 8

(i) *If two roots are proportional, the factor of proportionality can only be ±1,±12,±2\pm 1, \pm \frac{1}{2}, \pm 2.

(ii) If α\alpha and β\beta are two non-proportional roots, and if ∥α∥≤∥β∥\| \alpha \| \leq \| \beta \|, then n(α,β)n(\alpha, \beta) takes one of the values 0, 1, -1.

If a root α∈R\alpha \in \mathbf{R} is such that 12α∉R\frac{1}{2}\alpha \notin \mathbf{R}, then α\alpha is called an indivisible root.

Theorem 1

Let α,β\alpha, \beta be two roots.

(i) If n(α,β)>0n(\alpha, \beta) > 0, α−β\alpha - \beta is a root unless α=β\alpha = \beta. (ii) If n(α,β)<0n(\alpha, \beta) < 0, α+β\alpha + \beta is a root unless α=−β\alpha = -\beta.

If n(α,β)>0n(\alpha, \beta) > 0, the possibilities, by the list above, are the following:

1) n(α,β)=1n(\alpha, \beta) = 1; then α−β−sβ(α)∈R\alpha - \beta - s_{\beta}(\alpha) \in \mathbf{R}; 2) n(β,α)=1n(\beta, \alpha) = 1; then β−α=sα(β)∈R\beta - \alpha = s_{\alpha}(\beta) \in \mathbf{R}, so α−β∈R\alpha - \beta \in \mathbf{R}; 3) β=α\beta = \alpha.

This proves (i), and (ii) follows by changing β\beta to −β-\beta.

Corollary

Let α\alpha and β\beta be two roots.

(i) If (α∣β)>0(\alpha|\beta) > 0, α−β\alpha - \beta is a root unless α=β\alpha = \beta. (ii) If (α∣β)<0(\alpha|\beta) < 0, α+β\alpha + \beta is a root unless α=−β\alpha = -\beta. (iii) If α−β∉R∪{0}\alpha - \beta \notin \mathbf{R} \cup \{0\} and α+β∉R∪{0}\alpha + \beta \notin \mathbf{R} \cup \{0\}, then (α∣β)=0(\alpha|\beta) = 0.

Assertions (i) and (ii) follow from Th. 1 and formula (7) of no. 1. Assertion (iii) follows from (i) and (ii).

It is possible that α+β∈R\alpha + \beta \in \mathbf{R}, (α∣β)=0(\alpha|\beta) = 0 (cf. Plate X, System B_2). When α−β∉R∪{0}\alpha - \beta \notin \mathbf{R} \cup \{0\} and α+β∉R∪{0}\alpha + \beta \notin \mathbf{R} \cup \{0\}, α\alpha and β\beta are said to be strongly orthogonal.

Proposition 9

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.

Corollary

Let S be an α\alpha-chain of roots, and γ\gamma the origin of S. The length of S is −n(γ,α)-n(\gamma, \alpha); it is equal to 0, 1, 2 or 3.

The first assertion follows from Prop. 9, (iii), applied to β=γ\beta = \gamma, and using the fact that q=0q = 0.

On the other hand, since γ\gamma is not proportional to α\alpha, the list given at the beginning of this no. shows that ∣n(γ,α)∣≤3|n(\gamma, \alpha)| \leq 3, hence the corollary.

Remark

We retain the notation above. Then:

1) If the length of S is 0, then (α∣γ)=0(\alpha|\gamma) = 0.

2) If the length of S is 1, then n(γ,α)=−1n(\gamma, \alpha) = -1, and there are three cases:

n(α,γ)=−1,(α∣α)=(γ∣γ),(α∣γ)=−12(α∣α),(α,γ‾)=2π3 n(\alpha, \gamma) = -1, \quad (\alpha|\alpha) = (\gamma|\gamma), \quad (\alpha|\gamma) = -\frac{1}{2}(\alpha|\alpha), \quad (\overline{\alpha, \gamma}) = \frac{2\pi}{3}
n(α,γ)=−2,(α∣α)=2(γ∣γ),(α∣γ)=−12(α∣α),(α,γ‾)=3π4 n(\alpha, \gamma) = -2, \quad (\alpha|\alpha) = 2(\gamma|\gamma), \quad (\alpha|\gamma) = -\frac{1}{2}(\alpha|\alpha), \quad (\overline{\alpha, \gamma}) = \frac{3\pi}{4}
n(α,γ)=−3,(α∣α)=3(γ∣γ),(α∣γ)=−12(α∣α),(α,γ‾)=5π6 n(\alpha, \gamma) = -3, \quad (\alpha|\alpha) = 3(\gamma|\gamma), \quad (\alpha|\gamma) = -\frac{1}{2}(\alpha|\alpha), \quad (\overline{\alpha, \gamma}) = \frac{5\pi}{6}

!Three diagrams showing root systems with angles labeled π/3, π/4, 2π/3, and vectors γ + α, γ, γ + 2α

3) If the length of S is 2, then n(γ,α)=−2n(\gamma, \alpha) = -2, so

n(α,γ)=−1,(α∣α)=12(γ∣γ),(α∣γ)=−(α∣α),(α,γ‾)=3π4. n(\alpha, \gamma) = -1, \quad (\alpha|\alpha) = \frac{1}{2}(\gamma|\gamma), \quad (\alpha|\gamma) = -(\alpha|\alpha), \quad (\overline{\alpha, \gamma}) = \frac{3\pi}{4}.

!Diagram showing root system with angles π/4, π/4, and vectors γ, γ + α, γ + 2α

4) If the length of S is 3, then n(γ,α)=−3n(\gamma, \alpha) = -3, so

n(α,γ)=−1,(α∣α)=13(γ∣γ),(α∣γ)=−32(α∣α),(α,γ‾)=5π6. n(\alpha, \gamma) = -1, \quad (\alpha|\alpha) = \frac{1}{3}(\gamma|\gamma), \quad (\alpha|\gamma) = -\frac{3}{2}(\alpha|\alpha), \quad (\overline{\alpha, \gamma}) = \frac{5\pi}{6}.

!Diagram showing root system with angles π/6, π/3, π/6, and vectors γ, γ + α, γ + 2α, γ + 3α

We shall see (Plate X, Systems A₂, B₂, G₂) that all these cases are actually realised.

Proposition 10

Let α,β\alpha, \beta be two non-proportional roots such that β+α\beta + \alpha is a root. Let p,qp, q be the integers in Prop. 9. Then

(β+α∣β+α)(β∣β)=q+1p. \frac{(\beta + \alpha|\beta + \alpha)}{(\beta|\beta)} = \frac{q + 1}{p}.

Let S be the α\alpha-chain defined by β,γ\beta, \gamma its origin; its length ll is ≥1\geq 1 since β+α\beta + \alpha is a root. The following cases are possible:

1) l=1l = 1; then β=γ,q=0,p=1,(β+α∣β+α)=(β∣β)\beta = \gamma, q = 0, p = 1, (\beta + \alpha|\beta + \alpha) = (\beta|\beta). 2) l=2,β=γl = 2, \beta = \gamma; then q=0,p=2,(β+α∣β+α)=12(β∣β)q = 0, p = 2, (\beta + \alpha|\beta + \alpha) = \frac{1}{2}(\beta|\beta). 3) l=2,β=γ+αl = 2, \beta = \gamma + \alpha; then q=1,p=1,(β+α∣β+α)=2(β∣β)q = 1, p = 1, (\beta + \alpha|\beta + \alpha) = 2(\beta|\beta).

4) l=3,β=γl = 3, \beta = \gamma; then q=0,p=3,(β+α∣β+α)=13(β∣β)q = 0, p = 3, (\beta + \alpha|\beta + \alpha) = \frac{1}{3}(\beta|\beta). 5) l=3,β=γ+αl = 3, \beta = \gamma + \alpha; then q=1,p=2,(β+α∣β+α)=(β∣β)q = 1, p = 2, (\beta + \alpha|\beta + \alpha) = (\beta|\beta). 6) l=3,β=γ+2αl = 3, \beta = \gamma + 2\alpha; then q=2,p=1,(β+α∣β+α)=3(β∣β)q = 2, p = 1, (\beta + \alpha|\beta + \alpha) = 3(\beta|\beta).

In each case, the formula to be proved is satisfied.

Proposition 11

Assume that R is irreducible. Let α\alpha and β\beta be two roots such that ∥α∥=∥β∥\| \alpha \| = \| \beta \|. There exists g∈W(R)g \in W(R) such that g(α)=βg(\alpha) = \beta.

The transforms of α\alpha by W(R)W(R) generate V (no. 2, Cor. of Prop. 5). Hence there exists g∈W(R)g \in W(R) such that (g(α)∣β)≠0(g(\alpha)|\beta) \neq 0. We assume from now on that (α∣β)≠0(\alpha|\beta) \neq 0. By formula (9) of no. 1, n(α,β)=n(β,α)n(\alpha, \beta) = n(\beta, \alpha). Replacing β\beta if necessary by sβ(β)=−βs_\beta(\beta) = -\beta, we can assume that n(α,β)>0n(\alpha, \beta) > 0. Then, by the list at the beginning of no. 3, either α=β\alpha = \beta (in which case the proposition is clear), or n(α,β)=n(β,α)=1n(\alpha, \beta) = n(\beta, \alpha) = 1; in that case

sαsβsα(β)=sαsβ(β−α)=sα(−β−α+β)=α. s_\alpha s_\beta s_\alpha(\beta) = s_\alpha s_\beta(\beta - \alpha) = s_\alpha(-\beta - \alpha + \beta) = \alpha.

4. Reduced root systems

A root system is said to be reduced if every root of the system is indivisible (no. 3).

Proposition 12

Assume that R is irreducible and reduced.

(i) The ratio (β∣β)(α∣α)\frac{(\beta|\beta)}{(\alpha|\alpha)} for α∈R,β∈R\alpha \in R, \beta \in R must take one of the values 1, 2, 12\frac{1}{2}, 3, 13\frac{1}{3}.

(ii) The set of the (α∣α)(\alpha|\alpha) for α∈R\alpha \in R has at most two elements.

Since R is irreducible, the transforms of a root by W(R)W(R) generate V (no. 2, Cor. of Prop. 5). Hence, for any roots α,β\alpha, \beta, there exists a root β′\beta' such that (α∣β′)≠0(\alpha|\beta') \neq 0 and (β′∣β′)=(β∣β)(\beta'|\beta') = (\beta|\beta). By formula (9) of no. 1 and the list of no. 3, (β′∣β′)(α∣α)\frac{(\beta'|\beta')}{(\alpha|\alpha)} takes one of the values 1, 2, 12\frac{1}{2}, 3, 13\frac{1}{3} (recall that the system is assumed to be reduced). By multiplying (x∣y)(x|y) by a suitable scalar, we can assume that (α∣α)=1(\alpha|\alpha) = 1 for certain roots and that the other possible values of (β∣β)(\beta|\beta) for β∈R\beta \in R are 2 and 3. The values 2 and 3 cannot both be attained, since in that case there would exist β∈R,γ∈R\beta \in R, \gamma \in R such that (γ∣γ)(β∣β)=32\frac{(\gamma|\gamma)}{(\beta|\beta)} = \frac{3}{2}, contrary to what we have seen above.

Proposition 13

Assume that R is irreducible, non-reduced and of rank ≥2\geq 2.

(i) The set R0R_0 of indivisible roots is a root system in V; this system is irreducible and reduced; and W(R0)=W(R)W(R_0) = W(R).

(ii) Let A be the set of roots α\alpha for which (α∣α)(\alpha|\alpha) takes the smallest value λ\lambda. Then any two non-proportional elements of A are orthogonal.

(iii) Let B be the set of β∈R\beta \in R such that (β∣β)=2λ(\beta|\beta) = 2\lambda. Then B≠∅B \neq \varnothing, R0=A∪BR_0 = A \cup B, R=A∪B∪2AR = A \cup B \cup 2A.

If α∈R−R0\alpha \in R - R_0, then 12α∈R\frac{1}{2} \alpha \in R, but 12(12α)∉R\frac{1}{2} (\frac{1}{2} \alpha) \notin R (Prop. 8), so 12α∈R0\frac{1}{2} \alpha \in R_0. This proves that R0R_0 satisfies (RS1_1). It is clear that, for all α∈R\alpha \in R, sα,α−(R0)=R0s_{\alpha, \alpha^-}(R_0) = R_0, so R0R_0 satisfies (RSII_{II}) and (RSIII_{III}). Since α∈R−R0\alpha \in R - R_0 implies that 12α∈R0\frac{1}{2} \alpha \in R_0 and since sα=sα/2s_\alpha = s_{\alpha/2}, we have W(R)=W(R0)W(R) = W(R_0). Thus R0R_0 is irreducible (Cor. of Prop. 5), and it is evidently reduced.

Since RR is not reduced, there exists α∈R0\alpha \in R_0 such that 2α∈R2\alpha \in R. Since R0R_0 is irreducible and dim⁡V≥2\dim V \geq 2, α\alpha cannot be proportional or orthogonal to every root. Let β∈R0\beta \in R_0 be such that n(β,α)≠0n(\beta, \alpha) \neq 0 and β\beta is not proportional to α\alpha. Changing β\beta to −β-\beta if necessary, we can assume that n(β,α)>0n(\beta, \alpha) > 0. Now 12n(β,α)=n(β,2α)∈Z\frac{1}{2} n(\beta, \alpha) = n(\beta, 2\alpha) \in \mathbf{Z}, so n(β,α)∈2Zn(\beta, \alpha) \in 2\mathbf{Z}. From the list in no. 3, n(β,α)=2n(\beta, \alpha) = 2, (β∣β)=2(α∣α)(\beta|\beta) = 2(\alpha|\alpha). Since R0R_0 is reduced, Prop. 12 shows that, for all γ∈R0\gamma \in R_0, either (γ∣γ)=(α∣α)(\gamma|\gamma) = (\alpha|\alpha) or (γ∣γ)=2(α∣α)(\gamma|\gamma) = 2(\alpha|\alpha). Also, the above shows that, for all γ∈R−R0\gamma \in R - R_0, the vector 12γ\frac{1}{2} \gamma is an element of R0R_0 such that (12γ∣12γ)=(α∣α)(\frac{1}{2} \gamma|\frac{1}{2} \gamma) = (\alpha|\alpha). Thus, λ=(α∣α)\lambda = (\alpha|\alpha), B≠∅B \neq \varnothing, R0=A∪BR_0 = A \cup B, and R⊆A∪B∪2AR \subseteq A \cup B \cup 2A; on the other hand, if γ∈A\gamma \in A, there exists g∈W(R)g \in W(R) such that γ=g(α)\gamma = g(\alpha) (Prop. 11), so 2γ=g(2α)∈R2\gamma = g(2\alpha) \in R; thus 2A⊆R2A \subseteq R and R=A∪B∪2AR = A \cup B \cup 2A. Finally, let γ,γ′\gamma, \gamma' be two non-proportional elements of AA. Then

n(2γ,γ′)=2n(γ,γ′)=4n(γ,2γ′)∈4Z,and∣n(γ,γ′)∣≤1 n(2\gamma, \gamma') = 2n(\gamma, \gamma') = 4n(\gamma, 2\gamma') \in 4\mathbf{Z}, \quad \text{and} \quad |n(\gamma, \gamma')| \leq 1

since γ\gamma and γ′\gamma' have the same length, so n(γ,γ′)=0n(\gamma, \gamma') = 0 and (γ∣γ′)=0(\gamma|\gamma') = 0.

Proposition 14

Assume that RR is irreducible and reduced, and that (α∣α)(\alpha|\alpha) takes the values λ\lambda and 2λ2\lambda for α∈R\alpha \in R. Let AA be the set of roots α\alpha such that (α∣α)=λ(\alpha|\alpha) = \lambda. Assume that any two non-proportional elements of AA are orthogonal. Then R1=R∪2AR_1 = R \cup 2A is an irreducible non-reduced root system and RR is the set of indivisible roots of R1R_1.

It is clear that R1R_1 satisfies (RS1_1) and (RSIII_{III}). We show that, if α,β∈R1\alpha, \beta \in R_1, then ⟨α−,β⟩∈Z\langle \alpha^-, \beta \rangle \in \mathbf{Z}. This is clear if α∈R\alpha \in R. Since (2α)−=12α−(2\alpha)^- = \frac{1}{2} \alpha^- for α∈A\alpha \in A, it is also immediate if α,β∈2A\alpha, \beta \in 2A. Finally, assume that β∈R\beta \in R and that α=2γ\alpha = 2\gamma with γ∈A\gamma \in A.

1) If γ=±β\gamma = \pm \beta, then ⟨α−,β⟩=±12⟨γ−,γ⟩=±1\langle \alpha^-, \beta \rangle = \pm \frac{1}{2} \langle \gamma^-, \gamma \rangle = \pm 1. 2) If γ\gamma is not proportional to β\beta and if β∈A\beta \in A, the assumption on AA implies that ⟨γ−,β⟩=0\langle \gamma^-, \beta \rangle = 0, so ⟨α−,β⟩=0\langle \alpha^-, \beta \rangle = 0. 3) If β∈R−A\beta \in R - A, then (β∣β)=2λ=2(γ∣γ)(\beta|\beta) = 2\lambda = 2(\gamma|\gamma), so ⟨β,γ−⟩\langle \beta, \gamma^- \rangle is equal to 0, 2 or -2 by the list in no. 3. Thus ⟨β,α−⟩=12⟨β,γ−⟩∈Z\langle \beta, \alpha^- \rangle = \frac{1}{2} \langle \beta, \gamma^- \rangle \in \mathbf{Z}.

Thus R1R_1 is a root system in VV, and the other assertions are clear.

5. Chambers and bases of root systems

For all α∈R\alpha \in R, let LαL_\alpha be the hyperplane of VV consisting of the points invariant under sαs_\alpha. The chambers in VV determined by the set of the LαL_\alpha (Chap. V, § 1, no. 3) are called the chambers of RR. The bijection V→V∗V \to V^* defined by the scalar product (x∣y)(x|y) takes α\alpha to 2α−(α−∣α−)\frac{2\alpha^-}{(\alpha^-|\alpha^-)} for α∈R\alpha \in R, hence LαL_\alpha to Lα−L_{\alpha^-}, and hence the chambers of RR to those of R−R^-. If CC is a chamber of RR, the corresponding chamber of R−R^- is denoted by C−C^-. By Prop. 7 of no. 2, C−C^- depends only on CC and not on the choice of (x∣y)(x|y).

Theorem 2

(i) The group W(R)W(R) acts simply-transitively on the set of chambers.

(ii) Let CC be a chamber. Then C‾\overline{C} is a fundamental domain for W(R)W(R).

(iii) CC is an open simplicial cone (Chap. V, § 1, no. 6).

(iv) Let L1,L2,…,LlL_1, L_2, \ldots, L_l be the walls of CC. For all ii, there exists a unique indivisible root αi\alpha_i such that Li=LαiL_i = L_{\alpha_i} and such that αi\alpha_i is on the same side of LiL_i as CC.

(v) The set B(C)={α1,…,αl}B(C) = \{ \alpha_1, \ldots, \alpha_l \} is a basis of VV.

(vi) CC is the set of x∈Vx \in V such that ⟨αi,x⟩>0\langle \alpha_i, x \rangle > 0 for all ii (or, equivalently, the set of x∈Vx \in V such that (x∣αi)>0(x|\alpha_i) > 0 for all ii).

(vii) Let SS be the set of the sαis_{\alpha_i}. The pair (W(R),S)(W(R), S) is a Coxeter system (Chap. IV, § 1, no. 3).

Assertions (i) and (vii) follow from Chap. V, § 3, no. 2, Th. 1. Assertion (ii) follows from Chap. V, § 3, no. 3, Th. 2. Assertion (iv) is clear. The root αi\alpha_i is orthogonal to LiL_i, and αi−\alpha_i^- is identified with 2αi/(αi∣αi)2\alpha_i / (\alpha_i|\alpha_i). Since W(R)W(R) is essential (no. 1, Remark 3), assertions (iii), (v) and (vi) follow from Chap. V, § 3, no. 9, Prop. 7.

Remark 1

Assertion (vii) shows in particular that W(R)W(R) is generated by the reflections sαis_{\alpha_i}.

Remark 2

If x,y∈Cx, y \in C, then (x∣y)>0(x|y) > 0 (Chap. V, § 3, no. 5, Lemma 6), in other words the angle (x,y)(x, y) is acute.

Remark 3

Let m(α,β)m(\alpha, \beta) be the order of sαsβs_{\alpha} s_{\beta} (α,β∈B(C)\alpha, \beta \in B(C)). The matrix (m(α,β))(m(\alpha, \beta)) is identified with the Coxeter matrix (Chap. IV, § 1, no. 9) of (W,S)(W, S). If α≠β\alpha \neq \beta, Prop. 3 of Chap. V, § 3, no. 4 shows that the angle (α,β)(\alpha, \beta) is equal to π−πm(α,β)\pi - \frac{\pi}{m(\alpha, \beta)}; in particular, this angle is either obtuse or equal to π\pi, and (α∣β)≤0(\alpha|\beta) \leq 0. By using the list in no. 3, it follows that m(α,β)m(\alpha, \beta) is equal to 2, 3, 4 or 6.

Definition 2

A subset* BB of RR is called a basis of RR if there exists a chamber CC of RR such that B=B(C)B = B(C). If CC is a chamber, B(C)B(C) is called the basis of RR defined by CC.

Remark 4

Assertion (vi) of Th. 2 shows that the map C↦B(C)C \mapsto B(C) is a bijection from the set of chambers to the set of bases. Consequently, W(R)W(R) acts simply-transitively on the set of bases.

Remark 5

Let CC be a chamber of RR, and let BB be the corresponding basis. If α∈B\alpha \in B, put φ(α)=α−\varphi(\alpha) = \alpha^- if 2α∉R2\alpha \notin R and φ(α)=12α−\varphi(\alpha) = \frac{1}{2}\alpha^- if 2α∈R2\alpha \in R. Then φ(B)\varphi(B) is the basis of R−R^- defined by C−C^-; this follows from the fact that the walls of C−C^- are the Lα−L_{\alpha^-}, for α∈B\alpha \in B.

Definition 3

Let B be a basis of R. The Cartan matrix of R (relative to B) is the matrix (n(α,β))α,β∈B(n(\alpha, \beta))_{\alpha, \beta \in B}.

For all α∈B\alpha \in B, n(α,α)=2n(\alpha, \alpha) = 2. For α,β∈B\alpha, \beta \in B,

n(α,β)=2(α∣β)(β∣β)=−2∥α∥∥β∥cos⁡πm(α,β), n(\alpha, \beta) = 2 \frac{(\alpha|\beta)}{(\beta|\beta)} = -2 \frac{\|\alpha\|}{\|\beta\|} \cos \frac{\pi}{m(\alpha, \beta)},

where m(α,β)m(\alpha, \beta) denotes as above the order of sαsβs_\alpha s_\beta. If α≠β\alpha \neq \beta, n(α,β)=0,−1,−2n(\alpha, \beta) = 0, -1, -2 or −3-3 (cf. no. 3).

Remark 6

The Cartan matrix (n(α,β))(n(\alpha, \beta)) should not be confused with the Coxeter matrix (m(α,β))(m(\alpha, \beta)). Note in particular that the Cartan matrix is not necessarily symmetric.

Remark 7

Canonical indexing. If B and B′B' are two bases of R, there exists a unique element w∈Ww \in W such that w(B)=B′w(B) = B'. We have

n(w(α),w(β))=n(α,β)andm(w(α),w(β))=m(α,β) n(w(\alpha), w(\beta)) = n(\alpha, \beta) \quad \text{and} \quad m(w(\alpha), w(\beta)) = m(\alpha, \beta)

for α,β∈B\alpha, \beta \in B. Consequently, the Cartan and Coxeter matrices associated to B can be obtained from those associated to B′B' by composition with the bijection

α↦w(α) \alpha \mapsto w(\alpha)

from B to B′B'.

The Cartan and Coxeter matrices can actually be defined canonically in the following way. Let X be the set of pairs (B,α)(B, \alpha), where B is a basis of R and α∈B\alpha \in B. The group W acts in an obvious way on X and each orbit of W on X meets each of the sets {B}×B\{B\} \times B in exactly one point. If I is the set of these orbits, each basis B admits a canonical indexing (αi)i∈I(\alpha_i)_{i \in I}. Moreover, there exists a unique matrix N=(nij)N = (n_{ij}) (resp. M=(mij)M = (m_{ij})), of type I×II \times I, such that for any basis B, the Cartan (resp. Coxeter) matrix associated to B can be obtained from N (resp. M) by composing with the canonical indexing of B; it is called the canonical Cartan matrix (resp. Coxeter matrix) of R.

Proposition 15

Let B be a basis of R and α\alpha an indivisible root. There exist β∈B\beta \in B and w∈W(R)w \in W(R) such that α=w(β)\alpha = w(\beta).

Let C be the chamber such that B=B(C)B = B(C). The hyperplane LαL_\alpha is a wall of a chamber C′C' of R, and there exists an element of W(R)W(R) that transforms C′C' to C. We are therefore reduced to the case where LαL_\alpha is a wall of C. Then α\alpha is proportional to an element β\beta of R. Since α\alpha and β\beta are indivisible, α=±β\alpha = \pm \beta. If α=−β\alpha = -\beta, then α=sβ(β)\alpha = s_\beta(\beta), hence the proposition.

Corollary

Let R1R_1 and R2R_2 be two reduced root systems in vector spaces V1V_1 and V2V_2, and let B1B_1 and B2B_2 be bases of R1R_1 and R2R_2. Let f:B1→B2f : B_1 \to B_2 be a bijection that transforms the Cartan matrix of R1R_1 to that of R2R_2. Then there exists an isomorphism F:V1→V2F : V_1 \to V_2 that transforms R1R_1 to R2R_2 and α\alpha to f(α)f(\alpha) for all α∈B1\alpha \in B_1.

Let FF be the isomorphism from V1V_1 to V2V_2 that takes α\alpha to f(α)f(\alpha) for all α∈B1\alpha \in B_1. Then FF transforms sαs_\alpha to sf(α)s_{f(\alpha)}, hence W(R1)W(R_1) to W(R2)W(R_2) (Th. 2), and hence R1R_1 to R2R_2 (Prop. 15).

Proposition 16

Let BB be a basis of RR, and GG the subgroup of A(R)A(R) consisting of the elements leaving BB stable. Then W(R)W(R) is a normal subgroup of A(R)A(R) and A(R)A(R) is the semi-direct product of GG and W(R)W(R).

If α∈R\alpha \in R and t∈A(R)t \in A(R), then tsαt−1=st(α)ts_\alpha t^{-1} = s_{t(\alpha)}; since W(R)W(R) is generated by the sαs_\alpha, we see that W(R)W(R) is a normal subgroup of A(R)A(R). By transport of structure, A(R)A(R) transforms a basis of RR to a basis of RR. Since W(R)W(R) acts simply-transitively on the set of bases, every element of A(R)A(R) can be written uniquely in the form g1g2g_1 g_2, where g1∈W(R)g_1 \in W(R) and g2∈Gg_2 \in G.

Remark 8

Let R1,…,RpR_1, \ldots, R_p be root systems in vector spaces V1,…,VpV_1, \ldots, V_p, RR the direct sum of the RiR_i in V=∏iViV = \prod_i V_i, CiC_i a chamber of RiR_i, and Bi=B(Ci)B_i = B(C_i). It is immediate that C=∏iCiC = \prod_i C_i is a chamber of RR and that B(C)=⋃iBiB(C) = \bigcup_i B_i. It follows from Th. 2 that all the chambers and bases of RR are obtained in this way.

6. Positive roots

Let CC be a chamber of RR, and let B(C)={α1,…,αl}B(C) = \{ \alpha_1, \ldots, \alpha_l \} be the corresponding basis of RR. The order relation on VV (resp. V∗V^*) defined by CC is the order relation compatible with the vector space structure of VV (resp. V∗V^*) for which the elements ≥0\geq 0 are the linear combinations of the αi\alpha_i (resp. the αi∗\alpha_i^*) with coefficients ≥0\geq 0. An element that is positive for one of these relations is said to be positive for CC, or positive for the basis B(C)B(C). These order relations are also defined by C∗C^*, as one sees by identifying VV with V∗V^* by using a scalar product invariant under W(R)W(R). In view of Th. 2, no. 5, an element of V∗V^* is ≥0\geq 0 if and only if its values on CC are ≥0\geq 0. An element xx of VV is ≥0\geq 0 if and only if its values on C∗C^* are ≥0\geq 0, or, equivalently, if (x∣y)≥0(x|y) \geq 0 for all y∈Cy \in C.

The elements of C‾\overline{C} are ≥0\geq 0 for CC by Lemma 6 of Chap. V, § 3, no. 5. But the set of elements ≥0\geq 0 for CC is in general distinct from C‾\overline{C} (cf. Plate X, Systems A2,B2,G2A_2, B_2, G_2).

Theorem 3

Every root is a linear combination with integer coefficients of the same sign of elements of B(C)B(C). In particular, every root is either positive or negative for CC.

If α∈R\alpha \in R, the kernel LαL_\alpha of α\alpha does not meet C∗C^*, so α\alpha is either >0> 0 on the whole of C∗C^* or <0< 0 on the whole of C∗C^*, hence the second assertion. It remains to show that α\alpha is contained in the subgroup PP of VV generated by B(C)B(C); we can assume that α\alpha is indivisible. Now the group PP is clearly stable under the sγs_{\gamma}, for γ∈B(C)\gamma \in B(C), hence also under W(R)W(R) by Th. 2. Since α\alpha is of the form w(β)w(\beta), with w∈W(R)w \in W(R) and β∈B(C)\beta \in B(C) (cf. Prop. 15), we have α∈P\alpha \in P. Q.E.D.

Denote by R+(C)R_+(C) the set of roots that are positive for CC. Thus,

R=R+(C)∪(−R+(C)) R = R_+(C) \cup (-R_+(C))
is a partition of RR.

Corollary

Let γ\gamma be a linear combination of roots with integer coefficients, and α\alpha an indivisible root. If γ\gamma is proportional to α\alpha, then γ∈Zα\gamma \in \mathbf{Z}\alpha.

By Prop. 15 of no. 5, CC can be chosen so that α∈B(C)\alpha \in B(C). By Th. 3,

γ=∑β∈B(C)nββwithnβ∈Z. \gamma = \sum_{\beta \in B(C)} n_{\beta} \beta \quad \text{with} \quad n_{\beta} \in \mathbf{Z}.
Thus, if γ\gamma is proportional to α\alpha, then γ=nαα\gamma = n_{\alpha} \alpha, which proves the corollary.

Now let SS be the set of reflections sαs_{\alpha} for α∈B(C)\alpha \in B(C) and let TT be the union of the conjugates of SS under WW. For α∈B(C)\alpha \in B(C) and w∈Ww \in W, the element t=wsαw−1t = ws_{\alpha}w^{-1} of TT is the orthogonal reflection sβs_{\beta} associated to the root β=w(α)\beta = w(\alpha); conversely, for any indivisible root β\beta, there exists an element w∈Ww \in W such that α=w−1(β)∈B(C)\alpha = w^{-1}(\beta) \in B(C) (Prop. 15) and sβ=wsαw−1∈Ts_{\beta} = ws_{\alpha}w^{-1} \in T. It follows that a bijection ψ\psi from the set of indivisible roots to {±1}×T\{\pm 1\} \times T is obtained by associating to an indivisible root β\beta the pair (ε,sβ)(\varepsilon, s_{\beta}), where ε=+1\varepsilon = +1 if β\beta is positive and ε=−1\varepsilon = -1 if β\beta is negative.

On the other hand, (W,S)(W, S) is a Coxeter system (Th. 2) and the results of Chap. IV, § 1, no. 4 can be applied. We have seen that, if ww is an element of WW of length (with respect to SS) equal to qq, there exists a subset TwT_w of TT, with qq elements, such that, if w=s1…sqw = s_1 \ldots s_q with si∈Ss_i \in S and if

ti=s1…si−1sisi−1…s1 t_i = s_1 \ldots s_{i-1} s_i s_{i-1} \ldots s_1
(for 1≤i≤q1 \leq i \leq q), then Tw={t1,…,tq}T_w = \{t_1, \ldots, t_q\}. Recall that we have also defined in no. 4 of § 1 a number η(w,t)\eta(w, t) (for w∈Ww \in W and t∈Tt \in T) equal to +1+1 if t∉Twt \notin T_w and to −1-1 if t∈Twt \in T_w. Finally, recall that, if we define a map UwU_w from the set {±1}×T\{\pm 1\} \times T to itself by the formula
Uw(ε,t)=(εη(w−1,t),wtw−1), U_w(\varepsilon, t) = (\varepsilon \eta(w^{-1}, t), wt w^{-1}),
the map w↦Uww \mapsto U_w is a homomorphism from WW to the group of permutations of the set {±1}×T\{\pm 1\} \times T (Chap. IV, § 1, no. 4, Lemma 1).

Proposition 17

Assume that RR is reduced and let w∈Ww \in W and α∈R\alpha \in R.

(i) We have ψ(w(α))=Uw(ψ(α))\psi(w(\alpha)) = U_w(\psi(\alpha)). (ii) Assume that α\alpha is positive. The root w(α)w(\alpha) is negative if and only if

η(w−1,sα)=−1, \eta(w^{-1}, s_{\alpha}) = -1,
in other words if sα∈Tw−1s_{\alpha} \in T_{w^{-1}}.

(iii) We have η(w,sα)=−1\eta(w, s_\alpha) = -1 if and only if the chambers C and w(C)w(C) are on opposite sides of the hyperplane LαL_\alpha. In other words, the set TwT_w consists of the reflections with respect to the walls separating C and w(C)w(C).

Let β∈B(C)\beta \in B(C) and put s=sβs = s_\beta. Clearly Ts={s}T_s = \{ s \} and consequently

Us(ε,t)={(ε,sts−1)if t≠s(−ε,s)if t=s. U_s(\varepsilon, t) = \begin{cases} (\varepsilon, st s^{-1}) & \text{if } t \neq s \\ (-\varepsilon, s) & \text{if } t = s. \end{cases}

On the other hand, let ρ=∑γ∈B(C)nγ(ρ)γ\rho = \sum_{\gamma \in B(C)} n_\gamma(\rho) \gamma be a positive root. Put

s(ρ)=∑γ∈B(C)nγ(s(ρ))γ. s(\rho) = \sum_{\gamma \in B(C)} n_\gamma(s(\rho)) \gamma.

If ρ≠β\rho \neq \beta, there exists an element γ∈B(C)\gamma \in B(C) with γ≠β\gamma \neq \beta, such that nγ(ρ)>0n_\gamma(\rho) > 0, and we have nγ(s(ρ))=nγ(ρ)>0n_\gamma(s(\rho)) = n_\gamma(\rho) > 0 (no. 1, formula (5)). Hence s(ρ)s(\rho) is positive. We deduce immediately that

ψ(s(ε,ρ))={(ε,ssρs−1)if ρ≠β(−ε,s)if ρ=β. \psi(s(\varepsilon, \rho)) = \begin{cases} (\varepsilon, ss_\rho s^{-1}) & \text{if } \rho \neq \beta \\ (-\varepsilon, s) & \text{if } \rho = \beta. \end{cases}

Comparison of (12) and (13) now shows that Us(ψ(γ))=ψ(s(γ))U_s(\psi(\gamma)) = \psi(s(\gamma)) for all roots γ\gamma and all s∈Ss \in S. Since S generates W, (i) follows.

On the other hand, saying that w(α)w(\alpha) is negative is equivalent to saying that

ψ(w(α))=(−1,wsαw−1), \psi(w(\alpha)) = (-1, ws_\alpha w^{-1}),

or, by (i), that Uw(ψ(α))=(−1,wsαw−1)U_w(\psi(\alpha)) = (-1, ws_\alpha w^{-1}). If in addition α\alpha is positive, then ψ(α)=(+1,sα)\psi(\alpha) = (+1, s_\alpha) and Uw(ψ(α))=(η(w−1,sα),wsαw−1)U_w(\psi(\alpha)) = (\eta(w^{-1}, s_\alpha), ws_\alpha w^{-1}), hence (ii).

Finally, by (ii), η(w,sα)=−1\eta(w, s_\alpha) = -1 if and only if one of the roots α\alpha and w−1(α)w^{-1}(\alpha) is positive and the other negative. This is equivalent to saying that (α∣x).(w−1(α)∣x)=(α∣x).(w∣x)<0(\alpha|x).(w^{-1}(\alpha)|x) = (\alpha|x).(w|x) < 0 for all x∈Cx \in C, hence the first assertion in (iii). The second assertion in (iii) follows immediately.

Corollary 1

Let β∈B(C)\beta \in B(C). The reflection sβs_\beta permutes the positive roots not proportional to β\beta.

We reduce immediately to the case in which R is reduced. In that case, our assertion follows from (ii) and the fact that Tsβ=sβT_{s_\beta} = s_\beta.

Corollary 2

Assume that R is reduced. Let w∈Ww \in W, let q be the length of ww with respect to S (Chap. IV, § 1, no. 1), and let w=s1…sqw = s_1 \ldots s_q be a reduced decomposition of ww. Let α1,…,αq\alpha_1, \ldots, \alpha_q be the elements of B(C)B(C) corresponding to s1,…,sqs_1, \ldots, s_q. Put

θi=sqsq−1…si+1(αi),i=1,…,q. \theta_i = s_q s_{q-1} \ldots s_{i+1}(\alpha_i), \quad i = 1, \ldots, q.

The roots θi\theta_i are >0> 0, pairwise distinct, w(θi)<0w(\theta_i) < 0, and every root α>0\alpha > 0 such that w(α)<0w(\alpha) < 0 is equal to one of the θi\theta_i.

Let X be the set of α>0\alpha > 0 such that w(α)<0w(\alpha) < 0. By (ii),

Card⁡(X)=Card⁡(Tw−1)=l(w−1)=l(w)=q. \operatorname{Card}(X) = \operatorname{Card}(T_{w^{-1}}) = l(w^{-1}) = l(w) = q.

On the other hand, if α∈X\alpha \in X it is clear that there exists i∈{1,q}i \in \{1, q\} such that

si+1…sq(α)>0andsisi+1…sq(α)<0. s_{i+1} \ldots s_q(\alpha) > 0 \quad \text{and} \quad s_i s_{i+1} \ldots s_q(\alpha) < 0.

By Cor. 1, this implies that si+1…sq(α)=αis_{i+1} \ldots s_q(\alpha) = \alpha_i and hence that α=θi\alpha = \theta_i. The set X is thus contained in the set of θi\theta_i. Since Card⁡(X)=q\operatorname{Card}(X) = q, this is possible only if X is equal to the set of θi\theta_i and these are pairwise distinct. Hence the corollary.

Corollary 3

Assume that R is reduced. There exists a unique longest element w0w_0 in W. Its length is equal to the number of positive roots and w0w_0 transforms the chamber C to −C-C. We have w02=1w_0^2 = 1 and l(ww0)=l(w0)−l(w)l(ww_0) = l(w_0) - l(w) for all w∈Ww \in W.

It is clear that −C-C is a chamber. Hence there exists an element w0w_0 of W that transforms C to −C-C. Then w0(α)<0w_0(\alpha) < 0 for all positive roots α\alpha and the first two assertions of Cor. 3 are immediate consequences of Cor. 2. We have w02(C)=Cw_0^2(C) = C, so w02=1w_0^2 = 1. Finally, if w∈Ww \in W, the length l(w)l(w) (resp. l(ww0)l(ww_0)) is equal, by Prop. 17 (iii), to the number of walls separating C and w(C)w(C) (resp. ww0(C)=−w(C)ww_0(C) = -w(C)). Since w(C)w(C) and −w(C)-w(C) are on opposite sides of every wall, the sum l(w)+l(w0)l(w) + l(w_0) is equal to the total number of walls, that is to l(w0)l(w_0).

Proposition 18

Let x∈Vx \in V. The following three properties are equivalent:

(i) x∈C‾x \in \overline{C}; (ii) x≥sα(x)x \geq s_\alpha(x) for all α∈B(C)\alpha \in B(C) (with respect to the order relation defined by C); (iii) x≥w(x)x \geq w(x) for all w∈Ww \in W.

Since sα(x)=x−⟨x,α∨⟩αs_\alpha(x) = x - \langle x, \alpha^\vee \rangle \alpha and since C‾\overline{C} is the set of elements x∈Vx \in V such that ⟨x,α∨⟩≥0\langle x, \alpha^\vee \rangle \geq 0 for all α∈B(C)\alpha \in B(C), the equivalence of (i) and (ii) is obvious. On the other hand, it is clear that (iii) ⟹\Longrightarrow (ii). We show that (i) ⟹\Longrightarrow (iii). Let x∈C‾x \in \overline{C}, and let w∈Ww \in W. We argue by induction on the length l(w)l(w) of ww. The case l(w)=0l(w) = 0 is trivial. If l(w)≥1l(w) \geq 1, ww can be written in the form w=w′sαw = w' s_\alpha, with α∈B(C)\alpha \in B(C) and l(w′)=l(w)−1l(w') = l(w) - 1. Then

x−w(x)=x−w′(x)+w′(x−sα(x)). x - w(x) = x - w'(x) + w'(x - s_\alpha(x)).

The induction hypothesis shows that x−w′(x)x - w'(x) is positive. On the other hand,

w′(x−sα(x))=w(sα(x)−x)=−⟨x,α∨⟩w(α). w'(x - s_\alpha(x)) = w(s_\alpha(x) - x) = -\langle x, \alpha^\vee \rangle w(\alpha).

Now sα∈Tw−1s_\alpha \in T_{w^{-1}}, and Prop. 17 (ii) shows that w(α)<0w(\alpha) < 0. Hence the result.

Corollary

An element x∈Cx \in C if and only if x>w(x)x > w(x) for all w∈Ww \in W such that w≠1w \neq 1.

Proposition 19

Let (βi)1≤i≤n(\beta_i)_{1 \leq i \leq n} be a sequence of positive roots for the chamber CC such that β1+β2+⋯+βn\beta_1 + \beta_2 + \cdots + \beta_n is a root. Then there exists a permutation π∈Sn\pi \in S_n such that, for all i∈{1,2,…,n}i \in \{1, 2, \ldots, n\}, βπ(1)+βπ(2)+⋯+βπ(i)\beta_{\pi(1)} + \beta_{\pi(2)} + \cdots + \beta_{\pi(i)} is a root.

We argue by induction on nn, the proposition being clear for n≤2n \leq 2. Put β=β1+⋯+βn\beta = \beta_1 + \cdots + \beta_n. Then ∑i=1n(β∣βi)=(β∣β)>0\sum_{i=1}^n (\beta|\beta_i) = (\beta|\beta) > 0, so there exists an index kk such that (β∣βk)>0(\beta|\beta_k) > 0. If β=βk\beta = \beta_k, then n=1n = 1 since βi>0\beta_i > 0 for all ii. Otherwise β−βk\beta - \beta_k is a root (no. 3, Cor. of Th. 1); it then suffices to apply the induction hypothesis to β−βk=∑i≠kβi\beta - \beta_k = \sum_{i \neq k} \beta_i.

Corollary 1

Let α∈R+(C)\alpha \in R_+(C). Then α∈B(C)\alpha \in B(C) if and only if α\alpha is the sum of two positive roots.

If α\alpha is the sum of two positive roots, Th. 3 shows that α∈B(C)\alpha \in B(C). If α∉B(C)\alpha \notin B(C), Th. 3 shows that α=∑k=1nβk\alpha = \sum_{k=1}^n \beta_k with βk∈B(C)\beta_k \in B(C) for all kk and n≥2n \geq 2.

Permuting the βk\beta_k if necessary, we can assume that ∑k=1n−1\sum_{k=1}^{n-1} is a root (Prop. 19), and hence that α\alpha is the sum of the positive roots ∑k=1n−1βk\sum_{k=1}^{n-1} \beta_k and βn\beta_n.

Corollary 2

Let φ\varphi be a map from RR to a abelian group Γ\Gamma having the following properties:

1) φ(−α)=−φ(α)\varphi(-\alpha) = -\varphi(\alpha) for α∈R\alpha \in R; 2) if α∈R,β∈R\alpha \in R, \beta \in R are such that α+β∈R\alpha + \beta \in R, then φ(α+β)=φ(α)+φ(β)\varphi(\alpha + \beta) = \varphi(\alpha) + \varphi(\beta).

Let QQ be the subgroup of VV generated by RR. Then φ\varphi extends to a homomorphism from QQ to Γ\Gamma.

Let BB be a basis of RR. Let ψ\psi be the unique homomorphism from QQ to Γ\Gamma that coincides with φ\varphi on BB. It suffices to show that ψ(α)=φ(α)\psi(\alpha) = \varphi(\alpha) when α\alpha is a positive root relative to BB. We have α=β1+⋯+βm\alpha = \beta_1 + \cdots + \beta_m with βi∈B\beta_i \in B for all ii, and β1+⋯+βh∈R\beta_1 + \cdots + \beta_h \in R for all hh (Prop. 19). We show that ψ(α)=φ(α)\psi(\alpha) = \varphi(\alpha) by induction on mm. This is clear if m=1m = 1. The induction hypothesis gives

ψ(β1+⋯+βm−1)=φ(β1+⋯+βm−1), \psi(\beta_1 + \cdots + \beta_{m-1}) = \varphi(\beta_1 + \cdots + \beta_{m-1}),

and we have ψ(βm)=φ(βm)\psi(\beta_m) = \varphi(\beta_m), hence ψ(α)=φ(α)\psi(\alpha) = \varphi(\alpha), which proves the corollary.

For any root α=∑β∈B(C)nββ\alpha = \sum_{\beta \in B(C)} n_\beta \beta in RR, denote by Y(α)Y(\alpha) the set of β∈B(C)\beta \in B(C) such that nβ≠0n_\beta \neq 0. Moreover, observe that B(C)B(C) can be identified with the set of vertices of the graph of the Coxeter system formed by W(R)W(R) and the sαis_{\alpha_i} (cf. Chap. IV, § 1, no. 9 and Chap. V, § 3, no. 2).

Corollary 3

a) Let α∈R\alpha \in \mathbf{R}. Then Y(α)Y(\alpha) is a connected subset of B(C)B(C) (Chap. IV, Appendix).

b) Let YY be a non-empty connected subset of B(C)B(C). Then ∑β∈Yβ\sum_{\beta \in Y} \beta belongs to R\mathbf{R}.

To prove a), we can assume that α\alpha is positive. We argue by induction on Card(Y(α))\mathrm{Card}(Y(\alpha)), the assertion being trivial if Card(Y(α))=1\mathrm{Card}(Y(\alpha)) = 1. By Prop. 19, there exists β∈B(C)\beta \in B(C) such that α−β∈R\alpha - \beta \in \mathbf{R}. Let pp be the largest integer ⩾0\geqslant 0 such that γ=α−pβ∈R\gamma = \alpha - p\beta \in \mathbf{R}. Since γ−β∉R\gamma - \beta \notin \mathbf{R} and γ+pβ∈R\gamma + p\beta \in \mathbf{R}, (γ∣β)≠0(\gamma|\beta) \neq 0 (Prop. 9); thus β\beta is linked to at least one element of Y(γ)Y(\gamma). But Y(α)=Y(γ)∪{β}Y(\alpha) = Y(\gamma) \cup \{\beta\}, and Y(γ)Y(\gamma) is connected by the induction hypothesis. Thus Y(α)Y(\alpha) is connected, which proves a).

Now let YY be a non-empty connected subset of B(C)B(C); we show by induction on Card(Y)\mathrm{Card}(Y) that ∑β∈Yβ\sum_{\beta \in Y} \beta is a root. The case in which Card(Y)⩽1\mathrm{Card}(Y) \leqslant 1 is trivial. Assume that Card(Y)⩾2\mathrm{Card}(Y) \geqslant 2. Since XX is a forest (Chap. V, § 4, no. 8, Prop. 8), YY is a tree and has a terminal vertex β\beta (Chap. IV, Appendix). The set Y−{β}Y - \{\beta\} is connected, and one of its element is linked to β\beta. By the induction hypothesis, α=∑γ∈Y−{β}γ∈R\alpha = \sum_{\gamma \in Y - \{\beta\}} \gamma \in \mathbf{R}, and since (α∣β)<0(\alpha|\beta) < 0, it follows that α+β∈R\alpha + \beta \in \mathbf{R} (Th. 1). Q.E.D.

7. Closed sets of roots

Definition 4

Let PP be a subset of R\mathbf{R}.

(i) PP is said to be closed if the conditions α∈P,β∈P,α+β∈R\alpha \in P, \beta \in P, \alpha + \beta \in \mathbf{R} imply α+β∈P\alpha + \beta \in P.

(ii) PP is said to be parabolic if PP is closed and if P∪(−P)=RP \cup (-P) = \mathbf{R}.

(iii) PP is said to be symmetric if P=−PP = -P.

Lemma 3

Let CC be a chamber of R\mathbf{R} and PP a closed subset of R\mathbf{R} containing R+(C)R_+(C) (in the notation of no. 6). Let Σ=B(C)∩(−P)\Sigma = B(C) \cap (-P), and let QQ be the set of roots that are linear combinations of elements of Σ\Sigma with non-positive integer coefficient. Then, P=R+(C)∪QP = R_+(C) \cup Q.

It is enough to show that P∩(−R+(C))=QP \cap (-R_+(C)) = Q. Let −α∈Q-\alpha \in Q. Then α\alpha is the sum of nn elements of Σ\Sigma. We show, by induction on nn, that −α∈P-\alpha \in P. This is clear if n=1n = 1. If n>1n > 1, then by Prop. 19 of no. 6 we can write α=β+γ\alpha = \beta + \gamma with γ∈Σ\gamma \in \Sigma and β\beta the sum of n−1n - 1 elements of Σ\Sigma. By the induction hypothesis, −β∈P-\beta \in P; since −γ∈P-\gamma \in P and since PP is closed, −α∈P-\alpha \in P. Thus, Q⊆P∩(−R+(C))Q \subseteq P \cap (-R_+(C)). Conversely, let −α∈P∩(−R+(C))-\alpha \in P \cap (-R_+(C)). Then α\alpha is the sum of pp elements of B(C)B(C). We show, by induction on pp, that −α∈Q-\alpha \in Q. This is clear if p=1p = 1. If p>1p > 1, then by Prop. 19, we can write α=β+γ\alpha = \beta + \gamma with γ∈B(C)\gamma \in B(C) and β\beta a root that is the sum of p−1p - 1 elements of B(C)B(C). Since −γ=β+(−α)-\gamma = \beta + (-\alpha) and since PP is closed, −γ∈P-\gamma \in P, hence γ∈Σ\gamma \in \Sigma. Moreover, −β=γ+(−α)-\beta = \gamma + (-\alpha) so −β∈P-\beta \in P since PP is closed. By the induction hypothesis, −β∈Q-\beta \in Q, so −α=−β−γ∈Q-\alpha = -\beta - \gamma \in Q. Thus, P∩(−R+(C))⊆QP \cap (-R_+(C)) \subseteq Q.

Proposition 20

Let PP be a subset of RR. The following conditions are equivalent*:

(i) PP is parabolic; (ii) PP is closed and there exists a chamber CC of RR such that P⊇R+(C)P \supseteq R_+(C); (iii) there exist a chamber CC of RR and a subset Σ\Sigma of B(C)B(C) such that PP is the union of R+(C)R_+(C) and the set QQ of roots that are linear combinations of elements of Σ\Sigma with non-positive integer coefficients.

(ii) ⟹\Longrightarrow (iii): this follows from Lemma 3.

(iii) ⟹\Longrightarrow (i): we adopt the assumptions and notation of (iii). It is clear that P∪(−P)=RP \cup (-P) = R. We show that, if α,β∈P\alpha, \beta \in P are such that α+β∈R\alpha + \beta \in R, then α+β∈P\alpha + \beta \in P. This is obvious if the root α+β\alpha + \beta is positive. Assume that α+β\alpha + \beta is negative. Then α+β=∑γ∈B(C)nγγ\alpha + \beta = \sum_{\gamma \in B(C)} n_\gamma \gamma, with nγ≤0n_\gamma \leq 0. But the coefficient of every element γ\gamma of B(C)−ΣB(C) - \Sigma in α\alpha or β\beta is ≥0\geq 0; hence nγ=0n_\gamma = 0 if γ∈B(C)−Σ\gamma \in B(C) - \Sigma, so α+β∈Q⊆P\alpha + \beta \in Q \subseteq P.

(i) ⟹\Longrightarrow (ii): assume that PP is parabolic. Let CC be a chamber such that Card(P∩R+(C))\mathrm{Card}(P \cap R_+(C)) is as large as possible. Let α∈B(C)\alpha \in B(C) and assume that α∈P\alpha \in P, so that −α∈P-\alpha \in P. For all β∈P∩R+(C)\beta \in P \cap R_+(C), β\beta is not proportional to α\alpha (for the hypothesis β=2α\beta = 2\alpha would imply that α=2α+(−α)∈P\alpha = 2\alpha + (-\alpha) \in P since PP is closed). Thus sα(β)∈R+(C)s_\alpha(\beta) \in R_+(C) (no. 6, Cor. 1 of Prop. 17). If we put C′=sα(C)C' = s_\alpha(C), then β=sα(sα(β))∈sα(R+(C))=R+(C)\beta = s_\alpha(s_\alpha(\beta)) \in s_\alpha(R_+(C)) = R_+(C), so −α∈P∩R+(C′)-\alpha \in P \cap R_+(C') and hence Card(P∩R+(C′))>Card(P∩R+(C))\mathrm{Card}(P \cap R_+(C')) > \mathrm{Card}(P \cap R_+(C)). This is absurd, since α∈P\alpha \in P. Thus B(C)⊆PB(C) \subseteq P, and consequently R+(C)⊆PR_+(C) \subseteq P by Prop. 19 and the fact that PP is closed.

Corollary 1

Let PP be a subset of RR. The following conditions are equivalent*:

(i) there exists a chamber CC such that P=R+(C)P = R_+(C); (ii) PP is closed and {P,−P}\{P, -P\} is a partition of RR.

The chamber CC such that P=R+(C)P = R_+(C) is then unique.

If P=R+(C)P = R_+(C), CC is the set of x∗∈V∗x^* \in V^* such that ⟨x∗,x⟩>0\langle x^*, x \rangle > 0 for all x∈Px \in P, hence the uniqueness of CC.

Corollary 2

Assume that VV is equipped with the structure of an ordered vector space such that, for this structure, every root of RR is either positive or negative. Let PP be the set of positive roots for this structure. Then there exists a unique chamber CC of RR such that P=R+(C)P = R_+(C)*.

Indeed, PP satisfies condition (ii) of Cor. 1.

This corollary applies in particular when the order being considered is total, the condition on RR then being automatically satisfied. Recall that such an order can be obtained, for example, by choosing a basis (ei)1≤i≤n(e_i)_{1 \leq i \leq n} of VV and taking the lexicographic order on VV, so x=∑iξieix = \sum_i \xi_i e_i is ≥0\geq 0 if all the ξi\xi_i are 0, or if ξi>0\xi_i > 0 for the smallest index ii such that ξi≠0\xi_i \neq 0.

Corollary 3

A subset B of R is a basis of R if and only if the following conditions are satisfied:

(i) the elements of B are linearly independent; (ii) every root of R is a linear combination of elements of B in which the coefficients are either all positive or all negative; (iii) every root of B is indivisible.

We already know that the conditions are necessary (no. 5, Th. 2, and no. 6, Th. 3). Assume that conditions (i), (ii), (iii) are satisfied. Let P be the set of roots that are linear combinations of elements of B with coefficients ≥0\geq 0. Since P satisfies condition (ii) of Cor. 1, there exists a chamber C such that P=R+(C)P = R_+(C); let B′=B(C)B' = B(C), and let X and X′X' be the convex cones generated by B and B′B'. Then

B⊆P⊆XandB′⊆P⊆X′, B \subseteq P \subseteq X \quad \text{and} \quad B' \subseteq P \subseteq X',

which shows that X and X′X' are both generated by P, and hence coincide. But the half-lines generated by the elements of B (resp. by B′B') are the extreme generators of X (resp. X′X'); since such a half-line contains only one indivisible root, B=B′B = B'.

Corollary 4

Let B be a basis of R, B′B' a subset of B, V′V' the vector subspace of V generated by B′B', and R′=R∩V′R' = R \cap V'. Then B′B' is a basis of the root system B′B'.

This follows immediately from Cor. 3 and the Cor. of Prop. 4.

We call R′R' the root system generated by B′B'.

Corollary 5

Let B be a basis of R, A1,A2,…,ArA_1, A_2, \ldots, A_r pairwise orthogonal subsets of B, and A=A1∪A2∪⋯∪ArA = A_1 \cup A_2 \cup \cdots \cup A_r. Then every root α\alpha that is a linear combination of elements of A is actually a linear combination of elements of one of the AiA_i. In particular, if R is irreducible, there is no partition of B into pairwise orthogonal subsets.

Let E1,…,Er,EE_1, \ldots, E_r, E be the vector subspaces of V generated by A1,…,Ar,AA_1, \ldots, A_r, A, respectively. By Cor. 4, we can assume that E=VE = V. Then, by Th. 2 (vii) of no. 5, the EiE_i are stable under W(R)W(R), so R is the union of the R∩EiR \cap E_i (no. 2, Prop. 5).

Corollary 6

We adopt the hypotheses and notation of Prop. 20. Let V1V_1 be the vector subspace of V generated by Σ\Sigma. Then P∩(−P)=Q∪(−Q)=V1∩RP \cap (-P) = Q \cup (-Q) = V_1 \cap R is a root system in V1V_1 with basis Σ\Sigma.

We have P∩(−P)=(R+(C)∪Q)∩((−R+(C))∪(−Q))=Q∪(−Q)P \cap (-P) = (R_+(C) \cup Q) \cap ((-R_+(C)) \cup (-Q)) = Q \cup (-Q). Th. 3 proves that Q∪(−Q)=V1∩RQ \cup (-Q) = V_1 \cap R. Finally, Σ\Sigma is a basis of the root system V1∩RV_1 \cap R by Cor. 4.

Proposition 21

Let C (resp. C′C') be a chamber of R, Σ\Sigma (resp. Σ′\Sigma') a subset of B(C)B(C) (resp. B(C′)B(C')), Q (resp. Q′Q') the set of linear combinations of elements of Σ\Sigma (resp. Σ′\Sigma') with negative integer coefficients, and P=Q∪R+(C)P = Q \cup R_+(C) (resp. P′=Q′∪R+(C′)P' = Q' \cup R_+(C')). If there exists an element of the Weyl group transforming P to P′P', then there exists an element of the Weyl group transforming C to C′C' and Σ\Sigma to Σ′\Sigma'.

We reduce immediately to the case P=P′P = P'. Let V1V_1 be the vector subspace of V generated by P∩(−P)P \cap (-P). Then Σ\Sigma and Σ′\Sigma' are bases of the root system R1=P∩(−P)R_1 = P \cap (-P) in V1V_1 (Cor. 6 of Prop. 20). Hence there exists g1∈W(R1)g_1 \in W(R_1) such that g1(Σ)=Σ′g_1(\Sigma) = \Sigma'. It is clear that g1g_1 is induced by an element gg of W(R)W(R) that is a product of the symmetries sσs_\sigma with σ∈Σ\sigma \in \Sigma. Let γ=∑β∈B(C)cββ\gamma = \sum_{\beta \in B(C)} c_\beta \beta be an element of P−R1P - R_1. Then cβ>0c_\beta > 0 for at least one β∈B(C)−Σ\beta \in B(C) - \Sigma. Moreover, if σ∈Σ\sigma \in \Sigma, then sσ(γ)−γ∈V1s_\sigma(\gamma) - \gamma \in V_1, so sσ(γ)s_\sigma(\gamma) has at least one coordinate >0> 0 with respect to B(C)B(C) (no. 1, formula (5)), hence sσ(γ)∈R+(C)s_\sigma(\gamma) \in R_+(C) and finally sσ(γ)∈P−R1s_\sigma(\gamma) \in P - R_1. It follows that P−R1P - R_1 is stable under the sσ,σ∈Σs_\sigma, \sigma \in \Sigma, and hence under gg, so g(P)=Pg(P) = P. We are thus reduced to proving the proposition when P=P′P = P' and Σ=Σ′\Sigma = \Sigma'. In this case, Q=Q′Q = Q', so R+(C)=P−Q=P−Q′=R+(C′)R_+(C) = P - Q = P - Q' = R_+(C'), and hence C=C′C = C' (Cor. 1 of Prop. 20).

Corollary

Let P, P′P' be two parabolic subsets of R transformed into each other by an element of the Weyl group. If there exists a chamber C of R such that R+(C)⊆PR_+(C) \subseteq P and R+(C)⊆P′R_+(C) \subseteq P', then P=P′P = P'.

This follows from Lemma 3 and Prop. 21 since the only element of W(R)W(R) transforming C to C is 1, cf. no. 5, Th. 2.

Proposition 22

Let P be a closed subset of R such that P∩(−P)=∅P \cap (-P) = \varnothing. Then there exists a chamber C of R such that P⊆R+(C)P \subseteq R_+(C).

1) In view of the Cor. of Th. 1, no. 3, the assumptions α∈P,β∈P,(α∣β)<0\alpha \in P, \beta \in P, (\alpha|\beta) < 0 imply that α+β∈P\alpha + \beta \in P.

2) We show that no sum α1+⋯+αq\alpha_1 + \cdots + \alpha_q (q⩾1q \geqslant 1) of elements of P is zero. We proceed by induction on qq. The assertion being clear for q=1q = 1, assume that q⩾2q \geqslant 2. If α1+⋯+αq=0\alpha_1 + \cdots + \alpha_q = 0, then

−α1=α2+⋯+αq, -\alpha_1 = \alpha_2 + \cdots + \alpha_q,

so (−α1∣α2+⋯+αq)>0(-\alpha_1|\alpha_2 + \cdots + \alpha_q) > 0, hence there exists j∈{2,q}j \in \{2, q\} such that (α1∣αj)<0(\alpha_1|\alpha_j) < 0. By part 1) of the proof, α1+αj∈P\alpha_1 + \alpha_j \in P, and the relation (α1+αj)+∑i≠1,jαi=0(\alpha_1 + \alpha_j) + \sum_{i \neq 1, j} \alpha_i = 0 contradicts the induction hypothesis.

3) We show that there exists a non-zero element γ\gamma in VV such that (γ∣α)⩾0(\gamma|\alpha) \geqslant 0 for all α∈P\alpha \in P. If not, the result of 1) would show that an infinite sequence α1,α2,…\alpha_1, \alpha_2, \ldots of elements of PP could be found such that

βi=α1+⋯+αi∈P \beta_i = \alpha_1 + \cdots + \alpha_i \in P
for all ii; there would exist two distinct integers i,ji, j such that βi=βj\beta_i = \beta_j, which would contradict the result of 2).

4) To prove the proposition, it is enough (Cor. 2 of Prop. 20) to show that there exists a basis (αk)1≤k≤l(\alpha_k)_{1 \leq k \leq l} of VV such that, for the lexicographic order defined by this basis, every element of PP is >0> 0. We proceed by induction on l=dim⁡Vl = \dim V, and assume that the proposition is established for all dimensions <l< l. Let γ∈V\gamma \in V be such that γ≠0\gamma \neq 0 and (γ∣α)⩾0(\gamma|\alpha) \geqslant 0 for all α∈P\alpha \in P (cf. 3)). Let LL be the hyperplane orthogonal to γ\gamma, and V′V' the subspace of LL generated by R∩LR \cap L. Then R∩LR \cap L is a root system in V′V' and P∩LP \cap L is closed in R∩LR \cap L. By the induction hypothesis, there exists a basis (β1,…,βl′)(\beta_1, \ldots, \beta_{l'}) of V′V' such that the elements of P∩LP \cap L are >0> 0 for the lexicographic order defined by this basis. Then any basis of VV whose first l′+1l' + 1 elements are γ,β1,…,βl′\gamma, \beta_1, \ldots, \beta_{l'} and whose remaining elements are in LL has the required property.

Proposition 23

Let PP be a subset of RR and V1V_1 (resp. Γ\Gamma) the vector subspace (resp. the subgroup) of VV generated by PP. The following conditions are equivalent:

(i) P is closed and symmetric; (ii) P is closed, and P is a root system in V1V_1; (iii) Γ∩R=P\Gamma \cap R = P.

Assume that these conditions are satisfied. For any α∈P\alpha \in P, let α1~\alpha_1 \tilde{} be the restriction of α~\alpha \tilde{} to V1V_1. Then the map α↦α1~\alpha \mapsto \alpha_1 \tilde{} is the canonical bijection from the root system PP to P~P \tilde{}.

(iii) ⟹\Longrightarrow (i): clear.

(i) ⟹\Longrightarrow (ii): assume that PP is closed and symmetric. First, PP satisfies (RS_I) in V1V_1. We show that, if α,β∈P\alpha, \beta \in P, then sα(β)∈Ps_\alpha(\beta) \in P. This is clear if α\alpha and β\beta are proportional. Otherwise, sα(β)=β−n(β,α)αs_\alpha(\beta) = \beta - n(\beta, \alpha)\alpha and β−pα∈R\beta - p\alpha \in R for all rational integers pp between 0 and n(β,α)n(\beta, \alpha) (Prop. 9, no. 3), so

β−n(β,α)α∈P \beta - n(\beta, \alpha)\alpha \in P
since PP is closed and symmetric. Thus, sα,α1(P)=Ps_{\alpha, \alpha_1}(P) = P, and PP satisfies (RS_{II}). It is clear that PP satisfies (RS_{III}). Thus, PP satisfies (ii), and we have proved the last assertion of the proposition at the same time.

(ii) ⟹\Longrightarrow (iii): we show that, if condition (ii) is satisfied, then Γ∩R=P\Gamma \cap R = P. It is clear that P⊆Γ∩RP \subseteq \Gamma \cap R. Let β∈Γ∩R\beta \in \Gamma \cap R. Since β∈Γ\beta \in \Gamma and P=−PP = -P, β=α1+α2+⋯+αk\beta = \alpha_1 + \alpha_2 + \cdots + \alpha_k with α1,…,αk∈P\alpha_1, \ldots, \alpha_k \in P. We shall prove that β∈P\beta \in P. This is clear if k=1k = 1. We argue by induction on kk. We have

0<(β∣β)=∑i=1k(β∣αi), 0 < (\beta|\beta) = \sum_{i=1}^{k} (\beta|\alpha_i),
so (β∣αi)>0(\beta|\alpha_i) > 0 for some index ii. If β=αi\beta = \alpha_i, then β∈P\beta \in P. Otherwise, β−αi∈R\beta - \alpha_i \in R (Cor. of Th. 1, no. 3), so β−αi∈P\beta - \alpha_i \in P by the induction hypothesis, hence β∈P\beta \in P since PP is closed.

The conditions of Prop. 23 can be realised with V1=VV_1 = V and yet P≠RP \neq R. For example, this is the case when RR is a system of type G2G_2 and PP a system of type A2A_2; cf. Plate X.

Proposition 24

Let R′R' be the intersection of RR with a vector subspace of VV, so that R′R' is a root system in the vector subspace V′V' that it generates (cf. Cor. of Prop. 4, no. 1). Let B′B' be a basis of R′R'.

(i) There exists a basis of RR containing B′B'. (ii) R′R' is the set of elements of RR that are linear combinations of elements of B′B'.

Assertion (ii) is clear. We prove (i). Let (ε1,ε2,…,εl)(\varepsilon_1, \varepsilon_2, \ldots, \varepsilon_l) be a basis of VV such that B′=(εp+1,εp+2,…,εl)B' = (\varepsilon_{p+1}, \varepsilon_{p+2}, \ldots, \varepsilon_l). The lexicographic order on VV corresponding to this basis defines a chamber CC of RR. It is clear that every element of B′B' is minimal in R+(C)R_+(C). Thus B′⊆B(C)B' \subseteq B(C).

8. Highest root

Proposition 25

Assume that RR is irreducible. Let CC be a chamber of RR, and let B(C)={α1,…,αl}B(C) = \{\alpha_1, \ldots, \alpha_l\} be the corresponding basis.

(i) There exists a root α~=∑i=1lniαi\tilde{\alpha} = \sum_{i=1}^{l} n_i \alpha_i such that, for every root ∑i=1lpiαi\sum_{i=1}^{l} p_i \alpha_i, we have n1≥p1,n2≥p2,…,nl≥pln_1 \geq p_1, n_2 \geq p_2, \ldots, n_l \geq p_l. In other words, RR has a largest element for the ordering defined by CC. (ii) We have α~∈C‾\tilde{\alpha} \in \overline{C}. (iii) We have (α~∣α~)≥(α∣α)(\tilde{\alpha}|\tilde{\alpha}) \geq (\alpha|\alpha) for every root α\alpha. (iv) For every positive root α′\alpha' not proportional to α~\tilde{\alpha}, we have n(α′,α~)=0n(\alpha', \tilde{\alpha}) = 0 or 11.

1) Let α=∑i=1lniαi\alpha = \sum_{i=1}^{l} n_i \alpha_i, β=∑i=1lpiαi\beta = \sum_{i=1}^{l} p_i \alpha_i be two maximal roots for the ordering defined by CC. We shall prove that α=β\alpha = \beta, which will establish (i).

2) If (α∣αi)<0(\alpha|\alpha_i) < 0 for some index ii, it follows that either α+αi∈R\alpha + \alpha_i \in R or α=−αi\alpha = -\alpha_i (Cor. of Th. 1, no. 3), and both possibilities are absurd by the maximality of α\alpha. Thus (α∣αi)≥0(\alpha|\alpha_i) \geq 0 for all ii.

3) If α<0\alpha < 0, then α<−α\alpha < -\alpha, which is absurd. Thus ni≥0n_i \geq 0 for all ii. Let JJ be the set of ii such that ni>0n_i > 0, and J′J' the complement of JJ in {1,2,…,l}\{1, 2, \ldots, l\}. Then J≠∅J \neq \varnothing. If J′J' were non-empty, there would exist an i∈Ji \in J and an i′∈J′i' \in J' such that (αi∣αi′)<0(\alpha_i|\alpha_{i'}) < 0 (Cor. 5 of Prop. 20, no. 7); we would then have

(α∣αi′)=∑i∈Ini(αi∣αi′)<0(\alpha | \alpha_{i'}) = \sum_{i \in I} n_i (\alpha_i | \alpha_{i'}) < 0

since (αj∣αk)≤0(\alpha_j | \alpha_k) \leq 0 whenever jj and kk are distinct, which would contradict 2). Thus J′=∅J' = \varnothing and ni>0n_i > 0 for all ii.

4) We have (β∣αi)≥0(\beta | \alpha_i) \geq 0 for all ii by 2). We cannot have (β∣αi)=0(\beta | \alpha_i) = 0 for all ii since β≠0\beta \neq 0. We deduce from 3) that

(β∣α)=∑ini(β∣αi)>0.(\beta | \alpha) = \sum_i n_i (\beta | \alpha_i) > 0.

If γ=α−β∈R\gamma = \alpha - \beta \in \mathbf{R}, either α>β\alpha > \beta or β>α\beta > \alpha (Th. 3, no. 6), which contradicts the maximality of α\alpha and β\beta. Thus α=β\alpha = \beta (Cor. of Th. 1, no. 3).

5) By 2), α~∈C‾\tilde{\alpha} \in \overline{C}. We shall prove that (α′∣α′)≤(α~∣α~)(\alpha' | \alpha') \leq (\tilde{\alpha} | \tilde{\alpha}) for every α′∈R\alpha' \in \mathbf{R}. Since C‾\overline{C} is a fundamental domain for W(R)W(\mathbf{R}), we can assume that α′∈C‾\alpha' \in \overline{C}. We have α~−α′≥0\tilde{\alpha} - \alpha' \geq 0, so (α~−α′∣x)≥0(\tilde{\alpha} - \alpha' | x) \geq 0 for all x∈C‾x \in \overline{C}. In particular (α~−α′∣α~)≥0(\tilde{\alpha} - \alpha' | \tilde{\alpha}) \geq 0 and (α~−α′∣α′)≥0(\tilde{\alpha} - \alpha' | \alpha') \geq 0, hence (α~∣α~)≥(α′∣α~)≥(α′∣α′)(\tilde{\alpha} | \tilde{\alpha}) \geq (\alpha' | \tilde{\alpha}) \geq (\alpha' | \alpha'). Thus n(α′,α~)n(\alpha', \tilde{\alpha}) must be equal to 0, 1 or -1 if α′\alpha' is not proportional to α~\tilde{\alpha}. If α′≥0\alpha' \geq 0, then (α~∣α′)≥0(\tilde{\alpha} | \alpha') \geq 0 by 2), so n(α′,α~)≥0n(\alpha', \tilde{\alpha}) \geq 0 and n(α′,α~)n(\alpha', \tilde{\alpha}) must be either 0 or 1. Q.E.D.

Remark

The root

α~=∑iniαi\tilde{\alpha} = \sum_i n_i \alpha_i

in (i) is said to be the highest root of R\mathbf{R} (with respect to CC). Note that, by (i), we have ni≥1n_i \geq 1 for all ii.

9. Weights, radical weights

Let l=dim⁡Vl = \dim V. Denote by Q(R)Q(\mathbf{R}) the subgroup of VV generated by R\mathbf{R}; the elements of Q(R)Q(\mathbf{R}) are called the radical weights of R\mathbf{R}. By Th. 3 of no. 6, Q(R)Q(\mathbf{R}) is a discrete subgroup of VV of rank ll, and every basis of R\mathbf{R} is a basis of Q(R)Q(\mathbf{R}).

Similarly, the group Q(R∗)Q(\mathbf{R}^*) is a discrete subgroup of V∗V^* of rank ll.

Proposition 26

The set of x∈Vx \in V such that ⟨x,y∗⟩∈Z\langle x, y^* \rangle \in \mathbf{Z} for all y∗∈Q(R∗)y^* \in Q(\mathbf{R}^*) (or, equivalently, for all y∗∈R∗y^* \in \mathbf{R}^*) is a discrete subgroup GG of VV containing Q(R)Q(\mathbf{R}). If B′B' is a basis of R∗\mathbf{R}^*, the basis of VV dual to B′B' is a basis of GG*.

Let x∈Vx \in V. The following three properties are equivalent:

(i) ⟨x,y∗⟩∈Z\langle x, y^* \rangle \in \mathbf{Z} for all y∗∈Q(R∗)y^* \in Q(\mathbf{R}^*); (ii) ⟨x,y∗⟩∈Z\langle x, y^* \rangle \in \mathbf{Z} for all y∗∈B′y^* \in B'; (iii) the coordinates of xx with respect to the dual basis of B′B' are in Z\mathbf{Z}.

We deduce from this that the basis dual to B′B' is a basis of GG. On the other hand, (RSIII) proves that R⊆G\mathbf{R} \subseteq G, so Q(R)⊆GQ(\mathbf{R}) \subseteq G.

The group GG of Prop. 26 is denoted by P(R)P(\mathbf{R}), and its elements are called the weights of R\mathbf{R}. We can also consider the group P(R∗)P(\mathbf{R}^*) of weights of R∗\mathbf{R}^*.

P(R)/Q(R),P(R~)/Q(R~) P(R)/Q(R), \quad P(\tilde{R})/Q(\tilde{R})

are finite groups in duality over Q/Z\mathbf{Q}/\mathbf{Z}, and hence are isomorphic. The common order of these two groups is called the connection index of R (or of R~\tilde{R}).

If R is a direct sum of root systems RiR_i, the group Q(R) (resp. P(R)) is identified canonically with the direct sum of the Q(RiR_i) (resp. P(RiR_i)).

Proposition 27

Let R1R_1 be a subset of R, Q1Q_1 the subgroup of Q(R) generated by R1R_1, and W1W_1 the subgroup of W(R) generated by the sαs_\alpha (α∈R1\alpha \in R_1). If p∈P(R)p \in P(R) and w∈W1w \in W_1, then p−w(p)∈Q1p - w(p) \in Q_1.

If w=sαw = s_\alpha with α∈R1\alpha \in R_1, then

p−w(p)=⟨p,α∨⟩α∈Zα⊆Q1. p - w(p) = \langle p, \alpha^\vee \rangle \alpha \in \mathbf{Z}\alpha \subseteq Q_1.

If w=sα1sα2…sαrw = s_{\alpha_1} s_{\alpha_2} \ldots s_{\alpha_r}, with α1,…,αr∈R1\alpha_1, \ldots, \alpha_r \in R_1, it is still true that p−w(p)∈Q1p - w(p) \in Q_1, as we see by induction on r.

The group A(R) leaves P(R) and Q(R) invariant, and hence acts on the quotient P(R)/Q(R). By Prop. 27, the group W(R) acts trivially on P(R)/Q(R). Passing to the quotient, we see that the quotient group A(R)/W(R) (cf. Prop. 16, no. 5) acts canonically on P(R)/Q(R).

10. Fundamental weights, dominant weights

Assume that R is reduced. Let C be a chamber of R, and let B be the corresponding basis of R. Since R is reduced, B∨={α∨}α∈BB^\vee = \{ \alpha^\vee \}_{\alpha \in B} is a basis of R∨R^\vee. The dual basis (ω‾α)α∈B(\overline{\omega}_\alpha)_{\alpha \in B} of B∨B^\vee is thus a basis of the group of weights; its elements are called the fundamental weights (relative to B, or to C); if the elements of B are denoted by (α1,…,αl)(\alpha_1, \ldots, \alpha_l), the corresponding fundamental weights are denoted by (ω‾1,…,ω‾l)(\overline{\omega}_1, \ldots, \overline{\omega}_l).

Let x∈Vx \in V. Then, x∈Cx \in C if and only if ⟨x,α∨⟩>0\langle x, \alpha^\vee \rangle > 0 for all α∈B\alpha \in B. It follows that C is the set of linear combinations of the ω‾α\overline{\omega}_\alpha with coefficients ≥0\geq 0.

The entries n(α,β)=⟨α,β∨⟩n(\alpha, \beta) = \langle \alpha, \beta^\vee \rangle of the Cartan matrix are, for fixed α\alpha, the coordinates of α\alpha with respect to the basis (ω‾β)β∈B(\overline{\omega}_\beta)_{\beta \in B}:

α=∑β∈Bn(α,β)ω‾β. \alpha = \sum_{\beta \in B} n(\alpha, \beta) \overline{\omega}_\beta.

The Cartan matrix is thus the transpose of the matrix of the canonical injection

Q(R)→P(R) Q(R) \to P(R)

with respect to the bases B and (ω‾α)α∈B(\overline{\omega}_\alpha)_{\alpha \in B} of the Z\mathbf{Z}-modules Q(R) and P(R).

A weight ω‾\overline{\omega} is said to be dominant if it belongs to C‾\overline{C}, in other words if its coordinates with respect to (ω‾α)α∈B(\overline{\omega}_\alpha)_{\alpha \in B} are integers ≥0\geq 0, or equivalently if g(ω‾)≤ω‾g(\overline{\omega}) \leq \overline{\omega} for all g∈W(R)g \in W(R) (no. 6, Prop. 18). Since C‾\overline{C} is a fundamental domain for W(R)W(R) (Th. 2), there exists, for any weight ω‾\overline{\omega}, a unique weight ω‾′\overline{\omega}' such that ω‾′\overline{\omega}' is a transform of ω‾\overline{\omega} by W(R)W(R).

We have

⟨ω‾α,β∨⟩=(ω‾α∣2β(β∣β))=δαβ \langle \overline{\omega}_\alpha, \beta^\vee \rangle = (\overline{\omega}_\alpha | \frac{2\beta}{(\beta|\beta)}) = \delta_{\alpha\beta}
for α,β∈B\alpha, \beta \in B (δαβ\delta_{\alpha\beta} denoting the Kronecker symbol), hence
sβ(ω‾α)=ω‾α−δαββand(ω‾α∣β)=12(β∣β)δαβ. s_\beta(\overline{\omega}_\alpha) = \overline{\omega}_\alpha - \delta_{\alpha\beta}\beta \quad \text{and} \quad (\overline{\omega}_\alpha |\beta) = \frac{1}{2}(\beta|\beta)\delta_{\alpha\beta}.
In other words, ω‾α\overline{\omega}_\alpha is orthogonal to β\beta for β≠α\beta \neq \alpha, and its orthogonal projection onto RαR\alpha is 12α\frac{1}{2}\alpha. Since ω‾α∈C‾\overline{\omega}_\alpha \in \overline{C}, (ω‾α∣ω‾β)⩾0(\overline{\omega}_\alpha |\overline{\omega}_\beta) \geqslant 0 for α,β∈B\alpha, \beta \in B, i.e. the angle (ω‾α,ω‾β)(\overline{\omega}_\alpha, \overline{\omega}_\beta) is acute or a right angle. The dominant weights are the ω‾∈V\overline{\omega} \in V such that 2(ω‾∣α)/(∣α∣α)2(\overline{\omega}|\alpha)/(|\alpha|\alpha) is an integer ⩾0\geqslant 0 for all α∈B\alpha \in B.

Proposition 28

Let* BB be a basis of RR, B′B' a subset of BB, V′V' the vector subspace of VV generated by B′B', R′=R∩V′R' = R \cap V' (which is a root system in V′V'*),* R′~R'\tilde{} the inverse root system (which is identified with the canonical image of R′R' in R′~R'\tilde{}), V1V_1 the orthogonal complement of R′~R'\tilde{} in VV, and pp the projection of VV onto V′V' parallel to V1V_1. Then, Q(R′)=Q(R)∩V′Q(R') = Q(R) \cap V', P(R′)=p(P(R))P(R') = p(P(R)). The set of dominant weights of R′R' is the image under pp of the set of dominant weights of RR.

Indeed, Q(R)Q(R) is the subgroup of VV with basis BB, Q(R′)Q(R') is the subgroup of V′V' with basis B′B' (no. 7, Cor. 4 of Prop. 20) from which Q(R′)=Q(R)∩V′Q(R') = Q(R) \cap V' is immediate. If ω‾∈P(R)\overline{\omega} \in P(R) and α∈R′\alpha \in R', ⟨p(ω‾),α∨⟩=⟨ω‾,α∨⟩∈Z\langle p(\overline{\omega}), \alpha^\vee \rangle = \langle \overline{\omega}, \alpha^\vee \rangle \in \mathbf{Z}, so p(ω‾)∈P(R′)p(\overline{\omega}) \in P(R'), and hence p(P(R))⊆P(R′)p(P(R)) \subseteq P(R'). If ω‾′∈P(R′)\overline{\omega}' \in P(R'), ω‾′\overline{\omega}' extends to a linear form ω‾\overline{\omega} on V∗V^* vanishing on (B−B′)~(B - B')\tilde{}; we have ⟨ω‾,α∨⟩∈Z\langle \overline{\omega}, \alpha^\vee \rangle \in \mathbf{Z} for all α∈B\alpha \in B, so ω‾∈P(R)\overline{\omega} \in P(R), and ω‾′=p(ω‾)\overline{\omega}' = p(\overline{\omega}); hence P(R′)⊆p(P(R))P(R') \subseteq p(P(R)). Thus P(R′)=p(P(R))P(R') = p(P(R)), and the assertion about dominant weights is proved in the same way.

Proposition 29

Let* ρ\rho be half the sum of the roots >0> 0.

(i) ρ=∑α∈Bω‾α\rho = \sum_{\alpha \in B} \overline{\omega}_\alpha; this is an element of CC. (ii) sα(ρ)=ρ−αs_\alpha(\rho) = \rho - \alpha for all α∈B\alpha \in B. (iii) (2ρ∣α)=(α∣α)(2\rho|\alpha) = (\alpha|\alpha) for all α∈B\alpha \in B.

Since RR is reduced, sα(R+(C)−{α})=R+(C)−{α}s_\alpha(R_+(C) - \{\alpha\}) = R_+(C) - \{\alpha\} and sα(α)=−αs_\alpha(\alpha) = -\alpha for α∈B\alpha \in B (no. 6, Cor. 1 of Prop. 17), so sα(2ρ)=2ρ−2αs_\alpha(2\rho) = 2\rho - 2\alpha. Since sα(ρ)=ρ−⟨ρ,α∨⟩s_\alpha(\rho) = \rho - \langle \rho, \alpha^\vee \rangle, we see that

⟨ρ,α∨⟩=1=⟨∑β∈Bω‾β,α∨⟩. \langle \rho, \alpha^\vee \rangle = 1 = \langle \sum_{\beta \in B} \overline{\omega}_\beta, \alpha^\vee \rangle.
Hence, ρ=∑βω‾β\rho = \sum_{\beta} \overline{\omega}_\beta, and consequently ρ∈C\rho \in C. Finally, (iii) is equivalent to ⟨ρ,α∨⟩=1\langle \rho, \alpha^\vee \rangle = 1.

Corollary

Let σ\sigma be half the sum of the elements >0> 0 of R−R^- (for B−B^-). For all α∈V\alpha \in V, the sum of the coordinates of α\alpha with respect to the basis BB is ⟨α,σ⟩\langle \alpha, \sigma \rangle. If α∈R\alpha \in R, this sum is equal to 12∑β∈R+(C)n(α,β)\frac{1}{2} \sum_{\beta \in R_+ (\mathbf{C})} n(\alpha, \beta).

Interchanging the roles of RR and R−R^- above, we have ⟨α,σ⟩=1\langle \alpha, \sigma \rangle = 1 for all α∈B\alpha \in B, hence the corollary.

11. Coxeter transformation

Let CC be a chamber of RR, let {α1,…,αl}\{ \alpha_1, \ldots, \alpha_l \} be the corresponding basis of RR, and let c=sα1⋯sαlc = s_{\alpha_1} \cdots s_{\alpha_l}. The element cc of WW is called the Coxeter transformation of WW defined by CC and the bijection i↦αii \mapsto \alpha_i (Chap. V, § 6, no. 1). Its order hh is called the Coxeter number of WW (or of RR).

Proposition 30

Assume that RR is irreducible. Let mm be an integer between 1 and h−1h - 1 and prime to hh. Then exp⁡(2iπmh)\exp(\frac{2i\pi m}{h}) is an eigenvalue of cc of multiplicity 1.

In particular, mm is an exponent of WW, cf. Chap. V, § 6, no. 2.

We first prove a lemma:

Lemma 4

For all w∈Ww \in W, the characteristic polynomial of ww has integer coefficients.

We know (no. 6, Th. 3) that {α1,…,αl}\{ \alpha_1, \ldots, \alpha_l \} is a basis of the subgroup Q(R)Q(R) of VV generated by RR. Since ww leaves Q(R)Q(R) stable, its matrix with respect to {α1,…,αl}\{ \alpha_1, \ldots, \alpha_l \} has integer entries; hence its characteristic polynomial has integer coefficients.

Let PP be the characteristic polynomial of cc. The above lemma shows that the coefficients of PP are integers. By Chap. V, § 6, no. 2, Cor. 2 of Prop. 3, the primitive hhth root of unity z=exp⁡(2iπh)z = \exp(\frac{2i\pi}{h}) is a simple root of PP. Every conjugate of zz over Q\mathbf{Q} is therefore also a simple root of PP. But we know (Algebra, Chap. V) that the primitive hhth roots of unity are conjugate over Q\mathbf{Q}. They are thus all simple roots of PP, which proves the proposition.

Proposition 31

Assume that RR is irreducible and reduced, and let β=n1α1+⋯+nlαl\beta = n_1 \alpha_1 + \cdots + n_l \alpha_l be the highest root of RR (cf. no. 8). Then n1+⋯+nl=h−1n_1 + \cdots + n_l = h - 1.

Let R+R_+ be the set of positive roots relative to CC. Then (no. 10, Cor. of Prop. 29):

n1+⋯+nl=12∑α∈R+n(β,α) n_1 + \cdots + n_l = \frac{1}{2} \sum_{\alpha \in R_+} n(\beta, \alpha)
=1+12∑α∈R+,α≠βn(β,α)=1+∑α∈R+,α≠β(α∣β)(α∣α) = 1 + \frac{1}{2} \sum_{\alpha \in R_+, \alpha \neq \beta} n(\beta, \alpha) = 1 + \sum_{\alpha \in R_+, \alpha \neq \beta} \frac{(\alpha | \beta)}{(\alpha | \alpha)}

By no. 8, Prop. 25 (iv), for all α∈R+\alpha \in R_+ and α≠β\alpha \neq \beta, n(α,β)=0n(\alpha, \beta) = 0 or 1, so n(α,β)2=n(α,β)n(\alpha, \beta)^2 = n(\alpha, \beta), that is 4(α∣β)2(β∣β)2=2(α∣β)(β∣β)\frac{4(\alpha | \beta)^2}{(\beta | \beta)^2} = \frac{2(\alpha | \beta)}{(\beta | \beta)}. Hence:

n1+⋯+nl+1=2+2∑α∈R+,α≠β(α∣β)2(α∣α)(β∣β)=2∑α∈R+(α∣β)2(α∣α)(β∣β)=(β∣β)−1∑α∈R(α∥α∥∣β)2. n_1 + \cdots + n_l + 1 = 2 + 2 \sum_{\alpha \in R_+, \alpha \neq \beta} \frac{(\alpha | \beta)^2}{(\alpha | \alpha)(\beta | \beta)} = 2 \sum_{\alpha \in R_+} \frac{(\alpha | \beta)^2}{(\alpha | \alpha)(\beta | \beta)} = (\beta | \beta)^{-1} \sum_{\alpha \in R} \left( \frac{\alpha}{\| \alpha \|} | \beta \right)^2.

By Chap. V, § 6, no. 2, Cor. of Th. 1,

∑α∈R(α∥α∥∣β)2=h(β∣β) \sum_{\alpha \in R} \left( \frac{\alpha}{\| \alpha \|} | \beta \right)^2 = h(\beta | \beta)

so n1+⋯+nl+1=hn_1 + \cdots + n_l + 1 = h.

Proposition 32

Assume that R is irreducible, and that all roots have the same length. Let α∈R\alpha \in R. The number of elements of R not orthogonal to α\alpha is 4h−64h - 6.

Let R′R' be the set of roots not proportional to and not orthogonal to α\alpha. By Chap. V, § 6, no. 2, Cor. of Th. 1,

(α∣α)2+(α∣−α)2+∑β∈R′(α∣β)2=h(α∣α)2, (\alpha | \alpha)^2 + (\alpha | -\alpha)^2 + \sum_{\beta \in R'} (\alpha | \beta)^2 = h(\alpha | \alpha)^2,

that is

∑β∈R′(α∣β)2=(h−2)(α∣α)2. \sum_{\beta \in R'} (\alpha | \beta)^2 = (h - 2)(\alpha | \alpha)^2.

If β∈R′\beta \in R', then (α∣β)=±12(α∣α)(\alpha | \beta) = \pm \frac{1}{2} (\alpha | \alpha) by the list in no. 3. Hence

14Card⁡R′=h−2,Card⁡R′=4h−8, \frac{1}{4} \operatorname{Card} R' = h - 2, \quad \operatorname{Card} R' = 4h - 8,

and the number of roots not orthogonal to α\alpha is Card⁡R′+2=4h−6\operatorname{Card} R' + 2 = 4h - 6.

Proposition 33

Assume that R is irreducible and reduced. Put sαi=sis_{\alpha_i} = s_i, and let Γ\Gamma be the subgroup of W generated by c=s1…slc = s_1 \ldots s_l.

(i) Let θi=slsl−1…si+1(αi)\theta_i = s_l s_{l-1} \ldots s_{i+1} (\alpha_i) (i=1,…,li = 1, \ldots, l). Then, θi>0,c(θi)<0\theta_i > 0, c(\theta_i) < 0. (ii) If α\alpha is a root >0> 0 such that c(α)<0c(\alpha) < 0, then α\alpha is equal to one of the θi\theta_i. (iii) The family (θi)1≤i≤l(\theta_i)_{1 \leq i \leq l} is a basis of Q(R). (iv) Let Ωi\Omega_i be the orbit of θi\theta_i under Γ\Gamma. The sets Ωi\Omega_i are pairwise disjoint, they are all the orbits of Γ\Gamma on R, and each has h elements.

Observe first that (s1,…,sl)(s_1, \ldots, s_l) is a reduced decomposition of cc (Chap. IV, § 1, no. 1) with respect to the set S of the sis_i. Indeed, otherwise there would exist a subset X=S−{j}X = S - \{ j \} of l−1l - 1 elements of S such that c∈WXc \in W_X, which would contradict Cor. 2 of Prop. 7 of Chap. IV, § 1, no. 8.

Applying Cor. 2 of Prop. 17 of no. 6 to cc gives assertions (i) and (ii).

Let QiQ_i be the subgroup of Q(R) generated by the αj,j>i\alpha_j, j > i. It is immediate that QiQ_i is stable under the sj,j>is_j, j > i, and that sj(αi)=αis_j (\alpha_i) = \alpha_i mod. QiQ_i for j>ij > i. Hence:

θi=sl…si+1(αi)=αi mod. Qi. \theta_i = s_l \ldots s_{i+1} (\alpha_i) = \alpha_i \text{ mod. } Q_i.

In other words, there exist integers cijc_{ij} such that

θi=αi+∑j>icijαj. \theta_i = \alpha_i + \sum_{j > i} c_{ij} \alpha_j.
Part (iii) follows immediately.

Finally, let α\alpha be a root. The element ∑k=0h−1ck(α)\sum_{k=0}^{h-1} c^k(\alpha) is invariant under cc, and hence zero (Chap. V, § 6, no. 2). The ck(α)c^k(\alpha) cannot therefore all have the same sign, and there exists a kk such that ck(α)>0c^k(\alpha) > 0 and ck+1(α)<0c^{k+1}(\alpha) < 0. By (ii), ck(α)c^k(\alpha) is one of the θi\theta_i. Thus every orbit of Γ\Gamma on RR is one of the Ωi\Omega_i. Extend (x∣y)(x|y) to a hermitian form on V⊗CV \otimes \mathbf{C}. Each orbit of Γ\Gamma in RR has at most hh elements, and there are at most ll distinct orbits, by the above remarks. Now (Chap. V, § 6, no. 2, Theorem 2, ii)), the cardinal of RR is equal to hlhl, which immediately implies (iv).

12. Canonical bilinear form

We have seen (no. 1, Prop. 3) that the symmetric bilinear form

(x,y)↦BR(x,y)=∑α∈R⟨α∗,x⟩⟨α∗,y⟩ (x, y) \mapsto B_R(x, y) = \sum_{\alpha \in R} \langle \alpha^*, x \rangle \langle \alpha^*, y \rangle
on VV is non-degenerate and invariant under A(R)A(R). Interchanging the roles of RR and R∗R^*, it follows that the symmetric bilinear form (x∗,y∗)↦BR∗(x∗,y∗)=∑α∈R⟨α,x∗⟩⟨α,y∗⟩(x^*, y^*) \mapsto B_{R^*}(x^*, y^*) = \sum_{\alpha \in R} \langle \alpha, x^* \rangle \langle \alpha, y^* \rangle on V∗V^* is non-degenerate and invariant under A(R)A(R).

The inverse form of BR∗B_{R^*} (resp. BRB_R) on VV (resp. V∗V^*) will be called the canonical bilinear form on VV (resp. V∗V^*) and denoted by ΦR\Phi_R (resp. ΦR∗\Phi_{R^*}). It is non-degenerate and invariant under A(R)A(R). Let σ\sigma be the isomorphism from VV to V∗V^* defined by BR∗B_{R^*}. Then, for x∈Vx \in V and y∈Vy \in V:

ΦR(x,y)=BR∗(σ(x),σ(y))=∑α∈R⟨α,σ(x)⟩⟨α,σ(y)⟩. \Phi_R(x, y) = B_{R^*}(\sigma(x), \sigma(y)) = \sum_{\alpha \in R} \langle \alpha, \sigma(x) \rangle \langle \alpha, \sigma(y) \rangle.
But ⟨α,σ(x)⟩=BR∗(σ(α),σ(x))=ΦR(α,x)\langle \alpha, \sigma(x) \rangle = B_{R^*}(\sigma(\alpha), \sigma(x)) = \Phi_R(\alpha, x). Hence,
ΦR(x,y)=∑α∈RΦR(α,x)Φ(α,y). \Phi_R(x, y) = \sum_{\alpha \in R} \Phi_R(\alpha, x) \Phi(\alpha, y).
(16) In view of Prop. 7 of no. 2, ΦR\Phi_R is the only non-zero symmetric bilinear form invariant under W(R)W(R) which satisfies the identity (16).

For β∈R\beta \in R, (16) gives

ΦR(β,β)=∑α∈RΦR(α,β)2=14ΦR(β,β)2∑α∈Rn(α,β)2, \Phi_R(\beta, \beta) = \sum_{\alpha \in R} \Phi_R(\alpha, \beta)^2 = \frac{1}{4} \Phi_R(\beta, \beta)^2 \sum_{\alpha \in R} n(\alpha, \beta)^2,
hence
4ΦR(β,β)−1=∑α∈Rn(α,β)2. 4 \Phi_R(\beta, \beta)^{-1} = \sum_{\alpha \in R} n(\alpha, \beta)^2.
Moreover, by Lemma 2 of no. 1, we have, for x,y∈Vx, y \in V:

BR(x,y)=∑α∈RΦR(2αΦR(α,α),x)(2αΦR(α,α),y)=4∑α∈RΦR(α,x)ΦR(α,y)ΦR(α,α)−2. B_R(x, y) = \sum_{\alpha \in R} \Phi_R \left( \frac{2\alpha}{\Phi_R(\alpha, \alpha)}, x \right) \left( \frac{2\alpha}{\Phi_R(\alpha, \alpha)}, y \right) = 4 \sum_{\alpha \in R} \Phi_R(\alpha, x) \Phi_R(\alpha, y) \Phi_R(\alpha, \alpha)^{-2}.

It follows that, if RR is irreducible, there exists a constant γ(R)>0\gamma(R) > 0 such that

∑α∈RΦR(α,x)ΦR(α,y)ΦR(α,α)−2=γ(R)ΦR(x,y). \sum_{\alpha \in R} \Phi_R(\alpha, x) \Phi_R(\alpha, y) \Phi_R(\alpha, \alpha)^{-2} = \gamma(R) \Phi_R(x, y).
(18)

By the definition of γ(R)\gamma(R), we have BR(x,y)=4γ(R)ΦR(x,y)B_R(x, y) = 4\gamma(R) \Phi_R(x, y), so

ΦR∼(x∗,y∗)=(4γ(R))−1BR∼(x∗,y∗) \Phi_{R^{\sim}}(x^*, y^*) = (4\gamma(R))^{-1} B_{R^{\sim}}(x^*, y^*)

for x∗,y∗∈V∗x^*, y^* \in V^*. This proves that γ(R)=γ(R∼)\gamma(R) = \gamma(R^{\sim}). On the other hand, for β∈R\beta \in R,

ΦR∼(β∼,β∼)=(4γ(R))−1∑α∈R⟨β∼,α⟩2=γ(R)−1∑α∈RΦR(α,β)2ΦR(β,β)2 \Phi_{R^{\sim}}(\beta^{\sim}, \beta^{\sim}) = (4\gamma(R))^{-1} \sum_{\alpha \in R} \langle \beta^{\sim}, \alpha \rangle^2 = \gamma(R)^{-1} \sum_{\alpha \in R} \frac{\Phi_R(\alpha, \beta)^2}{\Phi_R(\beta, \beta)^2}

so, by (16),

ΦR∼(β∼,β∼)=γ(R)−1ΦR(β,β)−2ΦR(β,β) \Phi_{R^{\sim}}(\beta^{\sim}, \beta^{\sim}) = \gamma(R)^{-1} \Phi_R(\beta, \beta)^{-2} \Phi_R(\beta, \beta)

or finally

ΦR(β,β)ΦR∼(β∼,β∼)=γ(R)−1. \Phi_R(\beta, \beta) \Phi_{R^{\sim}}(\beta^{\sim}, \beta^{\sim}) = \gamma(R)^{-1}.
(19)

Further, if all the roots of RR have the same length λ\lambda for ΦR\Phi_R, (16) and (18) show that

γ(R)=λ−4. \gamma(R) = \lambda^{-4}.
(20)

Moreover, if hh is the Coxeter number of WW, the Cor. of Th. 1 of Chap. V, § 6, no. 2 shows that:

hΦR(x,x)=∑α∈R(x,αλ)2 for all x∈V. h \Phi_R(x, x) = \sum_{\alpha \in R} \left( x, \frac{\alpha}{\lambda} \right)^2 \text{ for all } x \in V.

Comparing with (16), we deduce that

λ=h−1/2orγ(R)=h2. \lambda = h^{-1/2} \quad \text{or} \quad \gamma(R) = h^2.
(21)

Finally, formula (19) shows that the roots of R∼R^{\sim} have length λ\lambda for ΦR∼\Phi_{R^{\sim}}.

Exercises

All the root systems considered below are relative to real vector spaces. We denote by (x∣y)(x|y) a scalar product invariant under the Weyl group (cf. no. 3).

See the exercises for § 1.

Transcribed from the printed volume. Not translated.