In this paragraph, k denotes a field of characteristic zero. From no. 3 onwards, we assume that k=R.
1. Definition of a root system
Lemma 1
Let V be a vector space over k, R a finite subset of V generating V. For any α∈R such that α=0, there exists at most one reflection s of V such that s(α)=−α and s(R)=R.
Let G be the group of automorphisms of V leaving R stable. Since R generates V, G is isomorphic to a subgroup of the symmetric group of R, and hence is finite. Let s,s′ be reflections of V such that s(α)=s′(α)=−α, s(R)=R, s′(R)=R. Then t=ss′ belongs to G, and hence is of finite order m. On the other hand,
t(α)=αandt(x)≡xmod.kαfor all x∈V.
Hence, there exists a linear form f on V such that
t(x)=x+f(x)αfor all x∈V
and f(α)=0. By induction on n, it follows that
tn(x)=x+nf(x)α for all x∈V.
Taking n equal to m, we see that mf(x)=0 for all x∈V, so f=0, t=1 and s=s′.
Definition 1
Let V be a vector space over k, and R a subset of V. Then R is said to be a root system in V if the following conditions are satisfied:
(RS_I) R is finite, does not contain 0, and generates V. (RS_{II}) For all α∈R, there exists an element α∨ of the dual V∗ of V such that ⟨α,α∨⟩=2 and that the reflection sα,α∨ (cf. Chap. V, § 2) leaves R stable.
(RS_{\text{III}}) For all α∈R, α∼(R)⊆Z.
By Lemma 1, the reflection sα,α∼ (and hence also the linear form α∼) is determined uniquely by α, so (RS_{\text{III}}) makes sense. We put sα,α∼=sα. Then sα(x)=x−⟨α∼,x⟩α for all x∈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α is called the Weyl group of R and is denoted by W(R), or simply by W.
Remark 1
Let k′ be an extension of k. Identify V canonically with a subset of V⊗k′ and V∗ with a subset of V∗⊗k′=(V⊗k′)∗. Then, R is a root system in V⊗k′, and the α∼ are the same as before.
Lemma 2
Let R be a root system in V. Let (x∣y) be a symmetric bilinear form on V, non-degenerate and invariant under W(R). Identify V with V∗ by means of this form. If α∈R, then α is non-isotropic and
α∼=(α∣α)2α.
This follows from formula (4) of Chap. V, § 2, no. 3.
Proposition 1
Let VQ (resp. VQ∗) be the Q-vector subspace of V (resp. V∗) generated by the α (resp. the α∼). Then VQ (resp. VQ∗) is a Q-structure on V (resp. V∗) (Algebra, Chap. II, § 8, no. 1). The restriction to VQ×VQ∗ of the canonical bilinear form on V×V∗ gives an identification of each of the spaces VQ,VQ∗ with the dual of the other. The set R is a root system in VQ.
If k=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 α∼ generate V∗. By Remark 1, the α∼ again generate V∗ if k=Q. We now go to the general case. Put E = VQ. By (RS_{\text{III}}), each α∼ maps E to Q, and so defines an element α~ of E∗. It is immediate that R is a root system in E, and that the element corresponding to α in E∗ is α~. By what we said above, the α~ generate the vector space E∗. Consider the canonical homomorphism i:E⊗Qk→V, and its transpose ti:V∗→E∗⊗Qk. Since R generates V, ti is injective; but the image of ti contains the α~, so ti is surjective. From this we conclude finally that i and ti are isomorphisms. We can therefore identify V with E⊗k, V∗ with E∗⊗k, α∼ with α~, and VQ∗ with E∗. Thus, VQ (resp. VQ∗) is a Q-structure on V (resp. V∗). The restriction to VQ×VQ∗ of the canonical bilinear form on V×V∗ can be identified with the canonical bilinear form on E×E∗, hence the proposition.
Remark 2
Proposition 1 reduces the study of root systems to the case k=Q. Remark 1 reduces it further to the study of root systems in the real vector space VR=VQ⊗QR. The Weyl groups associated to these different systems are canonically identified.
Remark 3
Since the α~ generate V∗, the group W(R), considered as a subgroup of GL(VR), 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) are the sα.
Proposition 2
The α~ form a root system in V∗, and α~=α for all α∈R.
The α~ satisfy (RS_I) by Prop. 1. Since sα,α~ is an automorphism of the vector space V equipped with the subset R, t(sα,α~)−1 leaves the set R~ of the α~ stable; but t(sα,α~)−1=sα~,α, which proves that R~ satisfies (RS_{II}) and that α~=α. Finally, ⟨α~,β⟩∈Z for all α~∈R~ and β∈R, so R~ satisfies (RS_{III}).
The set R~ is called the inverse root system ofR. The map α↦α~ is a bijection from R to R~, called the canonical bijection fromRtoR~. Note that, if α,β are elements of R such that α+β∈R, then (α+β)~=α~+β~ in general.
Since sα(α)=−α, axiom (RS_{II}) shows that −R=R. Evidently (−α)~=−α~ and −1∈A(R) (but it is not always true that −1∈W(R)).
The equality t(sα,α~)−1=sα~,α shows that the map u↦tu−1 is an isomorphism from the group W(R) to the group W(R~). We identify these two groups by means of this isomorphism; in other words, we consider W(R) as acting both in V and in V∗. Similarly for A(R).
Proposition 3
For x,y∈V, put*
(x∣y)=α∈R∑⟨α~,x⟩⟨α~,y⟩.
Then(x∣y)is a non-degenerate symmetric bilinear form onV, invariant underA(R). Forx,y∈VQwe have(x∣y)∈Q. The canonical extension of(x∣y)to
VR=VQ⊗QR
is non-degenerate and positive.
It is clear that (x∣y) is a symmetric bilinear form on V. If g∈A(R),
(g(x)∣g(y))=α∈R∑⟨tg(α~),x⟩⟨tg(α~),y⟩=(x∣y)
since tg)(R~)=R~. If x,y∈VQ, then (x∣y)∈Q by (RS_{III}). If z∈VR, then (z∣z)=∑α∈R⟨α~,z⟩2≥0, and (z∣z)>0 if z=0 by Prop. 1, so the canonical extension of (x∣y) to VR is positive and non-degenerate. The restriction of (x∣y) to VQ is thus non-degenerate, and hence the form (x∣y) on V is non-degenerate.
Proposition 4
(i) *Let X be a subset of R, let VX be the vector subspace of V generated by X, and let VX′ be the vector subspace of V∗ generated by the α−, where α∈X. Then V is the direct sum of VX and the orthogonal complement of VX′; V∗ is the direct sum of VX′ and the orthogonal complement of VX, and VX′ is identified with the dual of VX.
(ii) R∩VX is a root system in VX, and the canonical bijection from R∩VX to its inverse root system is identified with the restriction of the map α↦α− to R∩VX.
By Remark 2, we can assume that k=R. Identify V with V∗ by means of the symmetric bilinear form of Prop. 3. We have α−=(α∣α)2α for all α∈R (Lemma 2). Every vector subspace of V is non-isotropic, and the proposition is now clear.
Corollary
Let V1 be a vector subspace of V, and let V2 be the vector subspace generated by R∩V1. Then R∩V1 is a root system in V2.
This follows from (ii) applied to X=R∩V1.
For α,β∈R, put
⟨α,β−⟩=n(α,β).
(1)
Then
n(α,α)=2
(2)
n(−α,β)=n(α,−β)=−n(α,β).
(3)
By (RSIII),
n(α,β)∈Z.
(4)
By the definition of n(α,β),
sβ(α)=α−n(α,β)β.
(5)
Formula (1) and Prop. 2 imply that
n(α,β)=n(β−,α−).
(6)
Let (x∣y) be a symmetric bilinear form on V, non-degenerate and invariant under W(R) (Prop. 3). By Lemma 2,
n(α,β)=(β∣β)2(α∣β).
(7)
It follows that
n(α,β)=0⟺n(β,α)=0⟺(α∣β)=0⟺sα and sβ commute.
(8)
If (α∣β)=0, then
n(α,β)n(β,α)=(α∣α)(β∣β).
(9)
2. Direct sum of root systems
Let V be a vector space over k that is the direct sum of a family (Vi)1≤i≤r of vector spaces. Identify V∗ with the direct sum of the Vi∗. For all i, let Ri be a root system in Vi. Then R=⋃iRi is a root system in V whose inverse system is R−=⋃iRi−; the canonical bijection from R to R− extends, for all i, the canonical bijection from Ri to Ri−. The set R is called the direct sum of the root systemsRi. Let α∈Ri. If j=i, the kernel of α− contains Vj, so sα induces the identity on Vj; on the other hand, kα⊆Vi, so sα leaves Vi stable. These remarks show that W(R)can be identified with∏i=1rW(Ri).
A root system R is said to be irreducible if R=∅ 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,…,Vr. Let R be a root system in V. PutRi=R∩Vi. The following three conditions are equivalent:
(i) theViare stable underW(R); (ii) R⊆V1∪V2∪⋯∪Vr; (iii) for alli, Riis a root system inVi, and R is the direct sum of theRi. (iii) ⟹ (i): this follows from what we said at the beginning of this number.
(i) ⟹ (ii): assume that the Vi are stable under W(R). Let α∈R and let H be the kernel of α−. By Prop. 3 of Chap. V, § 2, no. 2, each Vi is the sum of a subspace of H and a subspace of kα. Hence one of the Vi contains kα, so α∈V1∪V2∪⋯∪Vr.
(ii) ⟹ (iii): if condition (ii) is satisfied, Ri generates Vi for all i, so Ri is a root system in Vi (Prop. 4). It is clear that R is the direct sum of the Ri.
Corollary
Let R be a root system in V. The following conditions are equivalent*: (i) R is irreducible; (ii) theW(R)*-module* V is simple; (iii) theW(R)*-module* V is absolutely simple. (ii) ⟺ (i): this follows from Prop. 5 and Maschke's Theorem (Chap. V, Appendix, Prop. 2). (iii) ⟺ (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∈Iof irreducible root systems that is unique up to a bijection of the index set.
The existence of the Ri 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′′ such that Card R′< Card R, Card R′′< Card R, and the induction hypothesis applies to R′ and R′′. To prove uniqueness, it suffices to prove that, if R is the direct sum of R′ and R′′, every Ri is necessarily contained either in R′ or in R′′. Let V′,V′′,Vi′,Vi′′ be the vector subspaces of V generated by R′,R′′,R′∩Ri,R′′∩Ri. Since the sum V′+V′′ is direct, the sum Vi′+Vi′′ is direct. Since Ri⊆R′∪R′′, Ri is the direct sum of the root systems R′∩Ri and R′′∩Ri; hence either R′∩Ri=∅ or R′′∩Ri=∅, which proves the assertion.
The Ri are called the irreducible components of R. For any non-zero scalars λi, the union of the λiRi is a root system in V, whose inverse system is the union of the λi−1Ri, and whose Weyl group is W(R).
Proposition 7
Let R be a root system in V, (Ri) the family of its irreducible components, Vi the vector subspace of V generated by Ri, B the invariant symmetric bilinear form on V defined in Prop. 3, and B′ a symmetric bilinear form on V invariant under W(R). Then the Vi are pairwise orthogonal with respect to B′, and, for all i, the restrictions of B and B′ to Vi are proportional.
If vi∈Vi,vj∈Vj,i=j, and if w∈W(Rj), then
B′(vi,w(vj))=B′(vi,vj),
which shows that w(vj)−vj is orthogonal to vi with respect to B′. Since Vj is irreducible for W(Rj), it is generated by the w(vj)−vj, and it is therefore orthogonal to Vi.
The fact that the restrictions of B and B′ to each of the Vi are proportional follows from Prop. 1 of Chap. V, § 2, no. 1.
Remark
Choose a scalar product on VR invariant under 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 R.
3. Relation between two roots
Recall that we assume from now on thatk=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, R denotes a root system in a vector space V; and V is equipped with a scalar product (x,y)↦(x∣y) invariant under W(R), cf. Prop. 3.
Let α,β∈R. By formula (7) of no. 1,
n(α,β)n(β,α)=4cos2(α,β)≤4.
Thus, the integer n(α,β)n(β,α) 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 α and β:
1) n(α,β)=n(β,α)=0;
(α,β)=2π;sαsβ of order 2;
2) n(α,β)=n(β,α)=1;
(α,β)=3π;sαsβ of order 3;
∥α∥=∥β∥;
3) n(α,β)=n(β,α)=−1;
(α,β)=32π;sαsβ of order 3;
∥α∥=∥β∥;
4) n(α,β)=1,n(β,α)=2;
(α,β)=4π;sαsβ of order 4;
∥β∥=2∥α∥;
5) n(α,β)=−1,n(β,α)=−2;
(α,β)=43π;sαsβ of order 4;
∥β∥=2∥α∥;
6) n(α,β)=1,n(β,α)=3;
(α,β)=6π;sαsβ of order 6;
∥β∥=3∥α∥;
7) n(α,β)=−1,n(β,α)=−3;
(α,β)=65π;sαsβ of order 6;
∥β∥=3∥α∥;
8) n(α,β)=n(β,α)=2;
α=β;
9) n(α,β)=n(β,α)=−2;
α=−β;
10) n(α,β)=1,n(β,α)=4;
β=2α;
11) n(α,β)=−1,n(β,α)=−4;
β=−2α.
In particular:
Proposition 8
(i) *If two roots are proportional, the factor of proportionality can only be ±1,±21,±2.
(ii) If α and β are two non-proportional roots, and if ∥α∥≤∥β∥, then n(α,β) takes one of the values 0, 1, -1.
If a root α∈R is such that 21α∈/R, then α is called an indivisible root.
Theorem 1
Let α,β be two roots.
(i) If n(α,β)>0, α−β is a root unless α=β. (ii) If n(α,β)<0, α+β is a root unless α=−β.
If n(α,β)>0, the possibilities, by the list above, are the following:
1) n(α,β)=1; then α−β−sβ(α)∈R; 2) n(β,α)=1; then β−α=sα(β)∈R, so α−β∈R; 3) β=α.
This proves (i), and (ii) follows by changing β to −β.
Corollary
Let α and β be two roots.
(i) If(α∣β)>0, α−β is a root unless α=β. (ii) If(α∣β)<0, α+β is a root unless α=−β. (iii) Ifα−β∈/R∪{0} and α+β∈/R∪{0}, then(α∣β)=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, (α∣β)=0 (cf. Plate X, System B_2). When α−β∈/R∪{0} and α+β∈/R∪{0}, α and β are said to be strongly orthogonal.
Proposition 9
Let α and β be two non-proportional roots.
(i) The set I of integers j such thatβ+jαis a root is an interval[−q,p]inZcontaining 0. (ii) Let S be the set ofβ+jαforj∈I. Then,
sα(S)=Sandsα(β+pα)=β−qα.
(iii) p−q=−n(β,α).
Clearly, 0∈I. Let p (resp. −q) be the largest (resp. smallest) element of I. If not all the integers in [−q,p] belong to I, there exist two integers r,s in [−q,p] with the following properties: s>r+1,s∈I,r∈I,r+k∈/I for 1≤k≤s−r−1. With the notation of the Cor. of Th. 1, (α∣β+sα)≤0,(α∣β+rα)≥0, which is absurd because
(α∣β+sα)≤0>(α∣β+rα).
This proves (i).
We have sα(β+jα)=β−n(β,α)α−jα=β+j′α with j′=−j−n(β,α). Thus sα(S)⊆S and consequently sα(S)=S. Now j↦−j−n(β,α) is a decreasing bijection from I to I. It follows that, j′=−q when j=p, so that −q=−p−n(β,α). This proves (ii) and (iii).
The set S is called the α-chain of roots defined by β, β−qα is its origin, β+pα is its end, and p+q is its length.
Corollary
Let S be an α-chain of roots, and γ the origin of S. The length of S is −n(γ,α); it is equal to 0, 1, 2 or 3.
The first assertion follows from Prop. 9, (iii), applied to β=γ, and using the fact that q=0.
On the other hand, since γ is not proportional to α, the list given at the beginning of this no. shows that ∣n(γ,α)∣≤3, hence the corollary.
Remark
We retain the notation above. Then:
1) If the length of S is 0, then (α∣γ)=0.
2) If the length of S is 1, then n(γ,α)=−1, and there are three cases:
We shall see (Plate X, Systems A₂, B₂, G₂) that all these cases are actually realised.
Proposition 10
Let α,β be two non-proportional roots such that β+α is a root. Let p,q be the integers in Prop. 9. Then
(β∣β)(β+α∣β+α)=pq+1.
Let S be the α-chain defined by β,γ its origin; its length l is ≥1 since β+α is a root. The following cases are possible:
1) l=1; then β=γ,q=0,p=1,(β+α∣β+α)=(β∣β). 2) l=2,β=γ; then q=0,p=2,(β+α∣β+α)=21(β∣β). 3) l=2,β=γ+α; then q=1,p=1,(β+α∣β+α)=2(β∣β).
4) l=3,β=γ; then q=0,p=3,(β+α∣β+α)=31(β∣β). 5) l=3,β=γ+α; then q=1,p=2,(β+α∣β+α)=(β∣β). 6) l=3,β=γ+2α; then q=2,p=1,(β+α∣β+α)=3(β∣β).
In each case, the formula to be proved is satisfied.
Proposition 11
Assume that R is irreducible. Let α and β be two roots such that ∥α∥=∥β∥. There exists g∈W(R) such that g(α)=β.
The transforms of α by W(R) generate V (no. 2, Cor. of Prop. 5). Hence there exists g∈W(R) such that (g(α)∣β)=0. We assume from now on that (α∣β)=0. By formula (9) of no. 1, n(α,β)=n(β,α). Replacing β if necessary by sβ(β)=−β, we can assume that n(α,β)>0. Then, by the list at the beginning of no. 3, either α=β (in which case the proposition is clear), or n(α,β)=n(β,α)=1; in that case
sαsβsα(β)=sαsβ(β−α)=sα(−β−α+β)=α.
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 (α∣α)(β∣β) for α∈R,β∈R must take one of the values 1, 2, 21, 3, 31.
(ii) The set of the (α∣α) for α∈R has at most two elements.
Since R is irreducible, the transforms of a root by W(R) generate V (no. 2, Cor. of Prop. 5). Hence, for any roots α,β, there exists a root β′ such that (α∣β′)=0 and (β′∣β′)=(β∣β). By formula (9) of no. 1 and the list of no. 3, (α∣α)(β′∣β′) takes one of the values 1, 2, 21, 3, 31 (recall that the system is assumed to be reduced). By multiplying (x∣y) by a suitable scalar, we can assume that (α∣α)=1 for certain roots and that the other possible values of (β∣β) for β∈R are 2 and 3. The values 2 and 3 cannot both be attained, since in that case there would exist β∈R,γ∈R such that (β∣β)(γ∣γ)=23, contrary to what we have seen above.
Proposition 13
Assume that R is irreducible, non-reduced and of rank ≥2.
(i) The set R0 of indivisible roots is a root system in V; this system is irreducible and reduced; and W(R0)=W(R).
(ii) Let A be the set of roots α for which (α∣α) takes the smallest value λ. Then any two non-proportional elements of A are orthogonal.
(iii) Let B be the set of β∈R such that (β∣β)=2λ. Then B=∅, R0=A∪B, R=A∪B∪2A.
If α∈R−R0, then 21α∈R, but 21(21α)∈/R (Prop. 8), so 21α∈R0. This proves that R0 satisfies (RS1). It is clear that, for all α∈R, sα,α−(R0)=R0, so R0 satisfies (RSII) and (RSIII). Since α∈R−R0 implies that 21α∈R0 and since sα=sα/2, we have W(R)=W(R0). Thus R0 is irreducible (Cor. of Prop. 5), and it is evidently reduced.
Since R is not reduced, there exists α∈R0 such that 2α∈R. Since R0 is irreducible and dimV≥2, α cannot be proportional or orthogonal to every root. Let β∈R0 be such that n(β,α)=0 and β is not proportional to α. Changing β to −β if necessary, we can assume that n(β,α)>0. Now 21n(β,α)=n(β,2α)∈Z, so n(β,α)∈2Z. From the list in no. 3, n(β,α)=2, (β∣β)=2(α∣α). Since R0 is reduced, Prop. 12 shows that, for all γ∈R0, either (γ∣γ)=(α∣α) or (γ∣γ)=2(α∣α). Also, the above shows that, for all γ∈R−R0, the vector 21γ is an element of R0 such that (21γ∣21γ)=(α∣α). Thus, λ=(α∣α), B=∅, R0=A∪B, and R⊆A∪B∪2A; on the other hand, if γ∈A, there exists g∈W(R) such that γ=g(α) (Prop. 11), so 2γ=g(2α)∈R; thus 2A⊆R and R=A∪B∪2A. Finally, let γ,γ′ be two non-proportional elements of A. Then
n(2γ,γ′)=2n(γ,γ′)=4n(γ,2γ′)∈4Z,and∣n(γ,γ′)∣≤1
since γ and γ′ have the same length, so n(γ,γ′)=0 and (γ∣γ′)=0.
Proposition 14
Assume that R is irreducible and reduced, and that (α∣α) takes the values λ and 2λ for α∈R. Let A be the set of roots α such that (α∣α)=λ. Assume that any two non-proportional elements of A are orthogonal. Then R1=R∪2A is an irreducible non-reduced root system and R is the set of indivisible roots of R1.
It is clear that R1 satisfies (RS1) and (RSIII). We show that, if α,β∈R1, then ⟨α−,β⟩∈Z. This is clear if α∈R. Since (2α)−=21α− for α∈A, it is also immediate if α,β∈2A. Finally, assume that β∈R and that α=2γ with γ∈A.
1) If γ=±β, then ⟨α−,β⟩=±21⟨γ−,γ⟩=±1. 2) If γ is not proportional to β and if β∈A, the assumption on A implies that ⟨γ−,β⟩=0, so ⟨α−,β⟩=0. 3) If β∈R−A, then (β∣β)=2λ=2(γ∣γ), so ⟨β,γ−⟩ is equal to 0, 2 or -2 by the list in no. 3. Thus ⟨β,α−⟩=21⟨β,γ−⟩∈Z.
Thus R1 is a root system in V, and the other assertions are clear.
5. Chambers and bases of root systems
For all α∈R, let Lα be the hyperplane of V consisting of the points invariant under sα. The chambers in V determined by the set of the Lα (Chap. V, § 1, no. 3) are called the chambers of R. The bijection V→V∗ defined by the scalar product (x∣y) takes α to (α−∣α−)2α− for α∈R, hence Lα to Lα−, and hence the chambers of R to those of R−. If C is a chamber of R, the corresponding chamber of R− is denoted by C−. By Prop. 7 of no. 2, C− depends only on C and not on the choice of (x∣y).
Theorem 2
(i) The groupW(R)acts simply-transitively on the set of chambers.
(ii) LetCbe a chamber. ThenCis a fundamental domain forW(R).
(iii) Cis an open simplicial cone (Chap. V, § 1, no. 6).
(iv) LetL1,L2,…,Llbe the walls ofC. For alli, there exists a unique indivisible rootαisuch thatLi=Lαiand such thatαiis on the same side ofLiasC.
(v) The setB(C)={α1,…,αl}is a basis ofV.
(vi) Cis the set ofx∈Vsuch that⟨αi,x⟩>0for alli(or, equivalently, the set ofx∈Vsuch that(x∣αi)>0for alli).
(vii) LetSbe the set of thesαi. The pair(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 is orthogonal to Li, and αi− is identified with 2αi/(αi∣αi). Since 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) is generated by the reflections sαi.
Remark 2
If x,y∈C, then (x∣y)>0 (Chap. V, § 3, no. 5, Lemma 6), in other words the angle (x,y) is acute.
Remark 3
Let m(α,β) be the order of sαsβ (α,β∈B(C)). The matrix (m(α,β)) is identified with the Coxeter matrix (Chap. IV, § 1, no. 9) of (W,S). If α=β, Prop. 3 of Chap. V, § 3, no. 4 shows that the angle (α,β) is equal to π−m(α,β)π; in particular, this angle is either obtuse or equal to π, and (α∣β)≤0. By using the list in no. 3, it follows that m(α,β)is equal to 2, 3, 4 or 6.
Definition 2
A subset* BofRis called a basis ofRif there exists a chamberCofRsuch thatB=B(C). IfCis a chamber, B(C)is called the basis ofRdefined byC.
Remark 4
Assertion (vi) of Th. 2 shows that the map C↦B(C) is a bijection from the set of chambers to the set of bases. Consequently, W(R) acts simply-transitively on the set of bases.
Remark 5
Let C be a chamber of R, and let B be the corresponding basis. If α∈B, put φ(α)=α− if 2α∈/R and φ(α)=21α− if 2α∈R. Then φ(B)is the basis ofR−defined byC−; this follows from the fact that the walls of C− are the Lα−, for α∈B.
Definition 3
Let B be a basis of R. The Cartan matrix of R (relative to B) is the matrix (n(α,β))α,β∈B.
For all α∈B, n(α,α)=2. For α,β∈B,
n(α,β)=2(β∣β)(α∣β)=−2∥β∥∥α∥cosm(α,β)π,
where m(α,β) denotes as above the order of sαsβ. If α=β, n(α,β)=0,−1,−2 or −3 (cf. no. 3).
Remark 6
The Cartan matrix (n(α,β)) should not be confused with the Coxeter matrix (m(α,β)). Note in particular that the Cartan matrix is not necessarily symmetric.
Remark 7
Canonical indexing. If B and B′ are two bases of R, there exists a unique element w∈W such that w(B)=B′. We have
n(w(α),w(β))=n(α,β)andm(w(α),w(β))=m(α,β)
for α,β∈B. Consequently, the Cartan and Coxeter matrices associated to B can be obtained from those associated to B′ by composition with the bijection
α↦w(α)
from B to B′.
The Cartan and Coxeter matrices can actually be defined canonically in the following way. Let X be the set of pairs (B,α), where B is a basis of R and α∈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 in exactly one point. If I is the set of these orbits, each basis B admits a canonical indexing (αi)i∈I. Moreover, there exists a unique matrix N=(nij) (resp. M=(mij)), of type I×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 α an indivisible root. There exist β∈B and w∈W(R) such that α=w(β).
Let C be the chamber such that B=B(C). The hyperplane Lα is a wall of a chamber C′ of R, and there exists an element of W(R) that transforms C′ to C. We are therefore reduced to the case where Lα is a wall of C. Then α is proportional to an element β of R. Since α and β are indivisible, α=±β. If α=−β, then α=sβ(β), hence the proposition.
Corollary
Let R1 and R2 be two reduced root systems in vector spaces V1 and V2, and let B1 and B2 be bases of R1 and R2. Let f:B1→B2 be a bijection that transforms the Cartan matrix of R1 to that of R2. Then there exists an isomorphism F:V1→V2 that transforms R1 to R2 and α to f(α) for all α∈B1.
Let F be the isomorphism from V1 to V2 that takes α to f(α) for all α∈B1. Then F transforms sα to sf(α), hence W(R1) to W(R2) (Th. 2), and hence R1 to R2 (Prop. 15).
Proposition 16
Let B be a basis of R, and G the subgroup of A(R) consisting of the elements leaving B stable. Then W(R) is a normal subgroup of A(R) and A(R) is the semi-direct product of G and W(R).
If α∈R and t∈A(R), then tsαt−1=st(α); since W(R) is generated by the sα, we see that W(R) is a normal subgroup of A(R). By transport of structure, A(R) transforms a basis of R to a basis of R. Since W(R) acts simply-transitively on the set of bases, every element of A(R) can be written uniquely in the form g1g2, where g1∈W(R) and g2∈G.
Remark 8
Let R1,…,Rp be root systems in vector spaces V1,…,Vp, R the direct sum of the Ri in V=∏iVi, Ci a chamber of Ri, and Bi=B(Ci). It is immediate that C=∏iCi is a chamber of R and that B(C)=⋃iBi. It follows from Th. 2 that all the chambers and bases of R are obtained in this way.
6. Positive roots
Let C be a chamber of R, and let B(C)={α1,…,αl} be the corresponding basis of R. The order relation on V (resp. V∗) defined by C is the order relation compatible with the vector space structure of V (resp. V∗) for which the elements ≥0 are the linear combinations of the αi (resp. the αi∗) with coefficients ≥0. An element that is positive for one of these relations is said to be positive for C, or positive for the basis B(C). These order relations are also defined by C∗, as one sees by identifying V with V∗ by using a scalar product invariant under W(R). In view of Th. 2, no. 5, an element of V∗ is ≥0 if and only if its values on C are ≥0. An element x of V is ≥0 if and only if its values on C∗ are ≥0, or, equivalently, if (x∣y)≥0 for all y∈C.
The elements of C are ≥0 for C by Lemma 6 of Chap. V, § 3, no. 5. But the set of elements ≥0 for C is in general distinct from C (cf. Plate X, Systems A2,B2,G2).
Theorem 3
Every root is a linear combination with integer coefficients of the same sign of elements of B(C). In particular, every root is either positive or negative for C.
If α∈R, the kernel Lα of α does not meet C∗, so α is either >0 on the whole of C∗ or <0 on the whole of C∗, hence the second assertion. It remains to show that α is contained in the subgroup P of V generated by B(C); we can assume that α is indivisible. Now the group P is clearly stable under the sγ, for γ∈B(C), hence also under W(R) by Th. 2. Since α is of the form w(β), with w∈W(R) and β∈B(C) (cf. Prop. 15), we have α∈P. Q.E.D.
Denote by R+(C) the set of roots that are positive for C. Thus,
R=R+(C)∪(−R+(C))
is a partition of R.
Corollary
Let γ be a linear combination of roots with integer coefficients, and α an indivisible root. If γ is proportional to α, then γ∈Zα.
By Prop. 15 of no. 5, C can be chosen so that α∈B(C). By Th. 3,
γ=β∈B(C)∑nββwithnβ∈Z.
Thus, if γ is proportional to α, then γ=nαα, which proves the corollary.
Now let S be the set of reflections sα for α∈B(C) and let T be the union of the conjugates of S under W. For α∈B(C) and w∈W, the element t=wsαw−1 of T is the orthogonal reflection sβ associated to the root β=w(α); conversely, for any indivisible root β, there exists an element w∈W such that α=w−1(β)∈B(C) (Prop. 15) and sβ=wsαw−1∈T. It follows that a bijectionψ from the set of indivisible roots to {±1}×T is obtained by associating to an indivisible root β the pair (ε,sβ), where ε=+1 if β is positive and ε=−1 if β is negative.
On the other hand, (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 w is an element of W of length (with respect to S) equal to q, there exists a subset Tw of T, with q elements, such that, if w=s1…sq with si∈S and if
ti=s1…si−1sisi−1…s1
(for 1≤i≤q), then Tw={t1,…,tq}. Recall that we have also defined in no. 4 of § 1 a number η(w,t) (for w∈W and t∈T) equal to +1 if t∈/Tw and to −1 if t∈Tw. Finally, recall that, if we define a map Uw from the set {±1}×T to itself by the formula
Uw(ε,t)=(εη(w−1,t),wtw−1),
the map w↦Uw is a homomorphism from W to the group of permutations of the set {±1}×T (Chap. IV, § 1, no. 4, Lemma 1).
Proposition 17
Assume that R is reduced and let w∈W and α∈R.
(i) We have ψ(w(α))=Uw(ψ(α)). (ii) Assume that α is positive. The root w(α) is negative if and only if
η(w−1,sα)=−1,
in other words ifsα∈Tw−1.
(iii) We have η(w,sα)=−1 if and only if the chambers C and w(C) are on opposite sides of the hyperplane Lα. In other words, the set Tw consists of the reflections with respect to the walls separating C and w(C).
Let β∈B(C) and put s=sβ. Clearly Ts={s} and consequently
Us(ε,t)={(ε,sts−1)(−ε,s)if t=sif t=s.
On the other hand, let ρ=∑γ∈B(C)nγ(ρ)γ be a positive root. Put
s(ρ)=γ∈B(C)∑nγ(s(ρ))γ.
If ρ=β, there exists an element γ∈B(C) with γ=β, such that nγ(ρ)>0, and we have nγ(s(ρ))=nγ(ρ)>0 (no. 1, formula (5)). Hence s(ρ) is positive. We deduce immediately that
ψ(s(ε,ρ))={(ε,ssρs−1)(−ε,s)if ρ=βif ρ=β.
Comparison of (12) and (13) now shows that Us(ψ(γ))=ψ(s(γ)) for all roots γ and all s∈S. Since S generates W, (i) follows.
On the other hand, saying that w(α) is negative is equivalent to saying that
ψ(w(α))=(−1,wsαw−1),
or, by (i), that Uw(ψ(α))=(−1,wsαw−1). If in addition α is positive, then ψ(α)=(+1,sα) and Uw(ψ(α))=(η(w−1,sα),wsαw−1), hence (ii).
Finally, by (ii), η(w,sα)=−1 if and only if one of the roots α and w−1(α) is positive and the other negative. This is equivalent to saying that (α∣x).(w−1(α)∣x)=(α∣x).(w∣x)<0 for all x∈C, hence the first assertion in (iii). The second assertion in (iii) follows immediately.
Corollary 1
Let β∈B(C). The reflection sβ permutes the positive roots not proportional to β.
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β.
Corollary 2
Assume that R is reduced. Let w∈W, let q be the length of w with respect to S (Chap. IV, § 1, no. 1), and let w=s1…sq be a reduced decomposition of w. Let α1,…,αq be the elements of B(C) corresponding to s1,…,sq. Put
θi=sqsq−1…si+1(αi),i=1,…,q.
The roots θi are >0, pairwise distinct, w(θi)<0, and every root α>0 such that w(α)<0 is equal to one of the θi.
Let X be the set of α>0 such that w(α)<0. By (ii),
Card(X)=Card(Tw−1)=l(w−1)=l(w)=q.
On the other hand, if α∈X it is clear that there exists i∈{1,q} such that
si+1…sq(α)>0andsisi+1…sq(α)<0.
By Cor. 1, this implies that si+1…sq(α)=αi and hence that α=θi. The set X is thus contained in the set of θi. Since Card(X)=q, this is possible only if X is equal to the set of θi and these are pairwise distinct. Hence the corollary.
Corollary 3
Assume that R is reduced. There exists a unique longest element w0 in W. Its length is equal to the number of positive roots and w0 transforms the chamber C to −C. We have w02=1 and l(ww0)=l(w0)−l(w) for all w∈W.
It is clear that −C is a chamber. Hence there exists an element w0 of W that transforms C to −C. Then w0(α)<0 for all positive roots α and the first two assertions of Cor. 3 are immediate consequences of Cor. 2. We have w02(C)=C, so w02=1. Finally, if w∈W, the length l(w) (resp. l(ww0)) is equal, by Prop. 17 (iii), to the number of walls separating C and w(C) (resp. ww0(C)=−w(C)). Since w(C) and −w(C) are on opposite sides of every wall, the sum l(w)+l(w0) is equal to the total number of walls, that is to l(w0).
Proposition 18
Let x∈V. The following three properties are equivalent:
(i) x∈C; (ii) x≥sα(x) for all α∈B(C) (with respect to the order relation defined by C); (iii) x≥w(x) for all w∈W.
Since sα(x)=x−⟨x,α∨⟩α and since C is the set of elements x∈V such that ⟨x,α∨⟩≥0 for all α∈B(C), the equivalence of (i) and (ii) is obvious. On the other hand, it is clear that (iii) ⟹ (ii). We show that (i) ⟹ (iii). Let x∈C, and let w∈W. We argue by induction on the length l(w) of w. The case l(w)=0 is trivial. If l(w)≥1, w can be written in the form w=w′sα, with α∈B(C) and l(w′)=l(w)−1. Then
x−w(x)=x−w′(x)+w′(x−sα(x)).
The induction hypothesis shows that x−w′(x) is positive. On the other hand,
w′(x−sα(x))=w(sα(x)−x)=−⟨x,α∨⟩w(α).
Now sα∈Tw−1, and Prop. 17 (ii) shows that w(α)<0. Hence the result.
Corollary
An element x∈C if and only if x>w(x) for all w∈W such that w=1.
Proposition 19
Let (βi)1≤i≤n be a sequence of positive roots for the chamber C such that β1+β2+⋯+βn is a root. Then there exists a permutation π∈Sn such that, for all i∈{1,2,…,n}, βπ(1)+βπ(2)+⋯+βπ(i) is a root.
We argue by induction on n, the proposition being clear for n≤2. Put β=β1+⋯+βn. Then ∑i=1n(β∣βi)=(β∣β)>0, so there exists an index k such that (β∣βk)>0. If β=βk, then n=1 since βi>0 for all i. Otherwise β−βk is a root (no. 3, Cor. of Th. 1); it then suffices to apply the induction hypothesis to β−βk=∑i=kβi.
Corollary 1
Let α∈R+(C). Then α∈B(C) if and only if α is the sum of two positive roots.
If α is the sum of two positive roots, Th. 3 shows that α∈B(C). If α∈/B(C), Th. 3 shows that α=∑k=1nβk with βk∈B(C) for all k and n≥2.
Permuting the βk if necessary, we can assume that ∑k=1n−1 is a root (Prop. 19), and hence that α is the sum of the positive roots ∑k=1n−1βk and βn.
Corollary 2
Let φ be a map from R to a abelian group Γ having the following properties:
1) φ(−α)=−φ(α) for α∈R; 2) if α∈R,β∈R are such that α+β∈R, then φ(α+β)=φ(α)+φ(β).
Let Q be the subgroup of V generated by R. Then φ extends to a homomorphism from Q to Γ.
Let B be a basis of R. Let ψ be the unique homomorphism from Q to Γ that coincides with φ on B. It suffices to show that ψ(α)=φ(α) when α is a positive root relative to B. We have α=β1+⋯+βm with βi∈B for all i, and β1+⋯+βh∈R for all h (Prop. 19). We show that ψ(α)=φ(α) by induction on m. This is clear if m=1. The induction hypothesis gives
ψ(β1+⋯+βm−1)=φ(β1+⋯+βm−1),
and we have ψ(βm)=φ(βm), hence ψ(α)=φ(α), which proves the corollary.
For any root α=∑β∈B(C)nββ in R, denote by Y(α) the set of β∈B(C) such that nβ=0. Moreover, observe that B(C) can be identified with the set of vertices of the graph of the Coxeter system formed by W(R) and the sαi (cf. Chap. IV, § 1, no. 9 and Chap. V, § 3, no. 2).
Corollary 3
a) Let α∈R. Then Y(α) is a connected subset of B(C) (Chap. IV, Appendix).
b) Let Y be a non-empty connected subset of B(C). Then ∑β∈Yβ belongs to R.
To prove a), we can assume that α is positive. We argue by induction on Card(Y(α)), the assertion being trivial if Card(Y(α))=1. By Prop. 19, there exists β∈B(C) such that α−β∈R. Let p be the largest integer ⩾0 such that γ=α−pβ∈R. Since γ−β∈/R and γ+pβ∈R, (γ∣β)=0 (Prop. 9); thus β is linked to at least one element of Y(γ). But Y(α)=Y(γ)∪{β}, and Y(γ) is connected by the induction hypothesis. Thus Y(α) is connected, which proves a).
Now let Y be a non-empty connected subset of B(C); we show by induction on Card(Y) that ∑β∈Yβ is a root. The case in which Card(Y)⩽1 is trivial. Assume that Card(Y)⩾2. Since X is a forest (Chap. V, § 4, no. 8, Prop. 8), Y is a tree and has a terminal vertex β (Chap. IV, Appendix). The set Y−{β} is connected, and one of its element is linked to β. By the induction hypothesis, α=∑γ∈Y−{β}γ∈R, and since (α∣β)<0, it follows that α+β∈R (Th. 1). Q.E.D.
7. Closed sets of roots
Definition 4
Let P be a subset of R.
(i) P is said to be closed if the conditions α∈P,β∈P,α+β∈R imply α+β∈P.
(ii) P is said to be parabolic if P is closed and if P∪(−P)=R.
(iii) P is said to be symmetric if P=−P.
Lemma 3
Let C be a chamber of R and P a closed subset of R containing R+(C) (in the notation of no. 6). Let Σ=B(C)∩(−P), and let Q be the set of roots that are linear combinations of elements of Σ with non-positive integer coefficient. Then, P=R+(C)∪Q.
It is enough to show that P∩(−R+(C))=Q. Let −α∈Q. Then α is the sum of n elements of Σ. We show, by induction on n, that −α∈P. This is clear if n=1. If n>1, then by Prop. 19 of no. 6 we can write α=β+γ with γ∈Σ and β the sum of n−1 elements of Σ. By the induction hypothesis, −β∈P; since −γ∈P and since P is closed, −α∈P. Thus, Q⊆P∩(−R+(C)). Conversely, let −α∈P∩(−R+(C)). Then α is the sum of p elements of B(C). We show, by induction on p, that −α∈Q. This is clear if p=1. If p>1, then by Prop. 19, we can write α=β+γ with γ∈B(C) and β a root that is the sum of p−1 elements of B(C). Since −γ=β+(−α) and since P is closed, −γ∈P, hence γ∈Σ. Moreover, −β=γ+(−α) so −β∈P since P is closed. By the induction hypothesis, −β∈Q, so −α=−β−γ∈Q. Thus, P∩(−R+(C))⊆Q.
Proposition 20
Let P be a subset of R. The following conditions are equivalent*:
(i) Pis parabolic; (ii) Pis closed and there exists a chamber C of R such that P⊇R+(C); (iii) there exist a chamber C of R and a subset Σ of B(C) such that P is the union of R+(C) and the set Q of roots that are linear combinations of elements of Σ with non-positive integer coefficients.
(ii) ⟹ (iii): this follows from Lemma 3.
(iii) ⟹ (i): we adopt the assumptions and notation of (iii). It is clear that P∪(−P)=R. We show that, if α,β∈P are such that α+β∈R, then α+β∈P. This is obvious if the root α+β is positive. Assume that α+β is negative. Then α+β=∑γ∈B(C)nγγ, with nγ≤0. But the coefficient of every element γ of B(C)−Σ in α or β is ≥0; hence nγ=0 if γ∈B(C)−Σ, so α+β∈Q⊆P.
(i) ⟹ (ii): assume that P is parabolic. Let C be a chamber such that Card(P∩R+(C)) is as large as possible. Let α∈B(C) and assume that α∈P, so that −α∈P. For all β∈P∩R+(C), β is not proportional to α (for the hypothesis β=2α would imply that α=2α+(−α)∈P since P is closed). Thus sα(β)∈R+(C) (no. 6, Cor. 1 of Prop. 17). If we put C′=sα(C), then β=sα(sα(β))∈sα(R+(C))=R+(C), so −α∈P∩R+(C′) and hence Card(P∩R+(C′))>Card(P∩R+(C)). This is absurd, since α∈P. Thus B(C)⊆P, and consequently R+(C)⊆P by Prop. 19 and the fact that P is closed.
Corollary 1
Let P be a subset of R. The following conditions are equivalent*:
(i) there exists a chamber C such that P=R+(C); (ii) P is closed and {P,−P} is a partition of R.
The chamber C such that P=R+(C) is then unique.
If P=R+(C), C is the set of x∗∈V∗ such that ⟨x∗,x⟩>0 for all x∈P, hence the uniqueness of C.
Corollary 2
Assume that V is equipped with the structure of an ordered vector space such that, for this structure, every root of R is either positive or negative. Let P be the set of positive roots for this structure. Then there exists a unique chamber C of R such that P=R+(C)*.
Indeed, P satisfies condition (ii) of Cor. 1.
This corollary applies in particular when the order being considered is total, the condition on R then being automatically satisfied. Recall that such an order can be obtained, for example, by choosing a basis (ei)1≤i≤n of V and taking the lexicographic order on V, so x=∑iξiei is ≥0 if all the ξi are 0, or if ξi>0 for the smallest index i such that ξi=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. Since P satisfies condition (ii) of Cor. 1, there exists a chamber C such that P=R+(C); let B′=B(C), and let X and X′ be the convex cones generated by B and B′. Then
B⊆P⊆XandB′⊆P⊆X′,
which shows that X and X′ are both generated by P, and hence coincide. But the half-lines generated by the elements of B (resp. by B′) are the extreme generators of X (resp. X′); since such a half-line contains only one indivisible root, B=B′.
Corollary 4
Let B be a basis of R, B′ a subset of B, V′ the vector subspace of V generated by B′, and R′=R∩V′. Then B′ is a basis of the root system B′.
This follows immediately from Cor. 3 and the Cor. of Prop. 4.
We call R′ the root system generated by B′.
Corollary 5
Let B be a basis of R, A1,A2,…,Ar pairwise orthogonal subsets of B, and A=A1∪A2∪⋯∪Ar. Then every root α that is a linear combination of elements of A is actually a linear combination of elements of one of the Ai. In particular, if R is irreducible, there is no partition of B into pairwise orthogonal subsets.
Let E1,…,Er,E be the vector subspaces of V generated by A1,…,Ar,A, respectively. By Cor. 4, we can assume that E=V. Then, by Th. 2 (vii) of no. 5, the Ei are stable under W(R), so R is the union of the R∩Ei (no. 2, Prop. 5).
Corollary 6
We adopt the hypotheses and notation of Prop. 20. Let V1 be the vector subspace of V generated by Σ. Then P∩(−P)=Q∪(−Q)=V1∩R is a root system in V1 with basis Σ.
We have P∩(−P)=(R+(C)∪Q)∩((−R+(C))∪(−Q))=Q∪(−Q). Th. 3 proves that Q∪(−Q)=V1∩R. Finally, Σ is a basis of the root system V1∩R by Cor. 4.
Proposition 21
Let C (resp. C′) be a chamber of R, Σ (resp. Σ′) a subset of B(C) (resp. B(C′)), Q (resp. Q′) the set of linear combinations of elements of Σ (resp. Σ′) with negative integer coefficients, and P=Q∪R+(C) (resp. P′=Q′∪R+(C′)). If there exists an element of the Weyl group transforming P to P′, then there exists an element of the Weyl group transforming C to C′ and Σ to Σ′.
We reduce immediately to the case P=P′. Let V1 be the vector subspace of V generated by P∩(−P). Then Σ and Σ′ are bases of the root system R1=P∩(−P) in V1 (Cor. 6 of Prop. 20). Hence there exists g1∈W(R1) such that g1(Σ)=Σ′. It is clear that g1 is induced by an element g of W(R) that is a product of the symmetries sσ with σ∈Σ. Let γ=∑β∈B(C)cββ be an element of P−R1. Then cβ>0 for at least one β∈B(C)−Σ. Moreover, if σ∈Σ, then sσ(γ)−γ∈V1, so sσ(γ) has at least one coordinate >0 with respect to B(C) (no. 1, formula (5)), hence sσ(γ)∈R+(C) and finally sσ(γ)∈P−R1. It follows that P−R1 is stable under the sσ,σ∈Σ, and hence under g, so g(P)=P. We are thus reduced to proving the proposition when P=P′ and Σ=Σ′. In this case, Q=Q′, so R+(C)=P−Q=P−Q′=R+(C′), and hence C=C′ (Cor. 1 of Prop. 20).
Corollary
Let 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)⊆P and R+(C)⊆P′, then P=P′.
This follows from Lemma 3 and Prop. 21 since the only element of 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)=∅. Then there exists a chamber C of R such that P⊆R+(C).
1) In view of the Cor. of Th. 1, no. 3, the assumptions α∈P,β∈P,(α∣β)<0 imply that α+β∈P.
2) We show that no sum α1+⋯+αq (q⩾1) of elements of P is zero. We proceed by induction on q. The assertion being clear for q=1, assume that q⩾2. If α1+⋯+αq=0, then
−α1=α2+⋯+αq,
so (−α1∣α2+⋯+αq)>0, hence there exists j∈{2,q} such that (α1∣αj)<0. By part 1) of the proof, α1+αj∈P, and the relation (α1+αj)+∑i=1,jαi=0 contradicts the induction hypothesis.
3) We show that there exists a non-zero element γ in V such that (γ∣α)⩾0 for all α∈P. If not, the result of 1) would show that an infinite sequence α1,α2,… of elements of P could be found such that
βi=α1+⋯+αi∈P
for all i; there would exist two distinct integers i,j such that βi=β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 of V such that, for the lexicographic order defined by this basis, every element of P is >0. We proceed by induction on l=dimV, and assume that the proposition is established for all dimensions <l. Let γ∈V be such that γ=0 and (γ∣α)⩾0 for all α∈P (cf. 3)). Let L be the hyperplane orthogonal to γ, and V′ the subspace of L generated by R∩L. Then R∩L is a root system in V′ and P∩L is closed in R∩L. By the induction hypothesis, there exists a basis (β1,…,βl′) of V′ such that the elements of P∩L are >0 for the lexicographic order defined by this basis. Then any basis of V whose first l′+1 elements are γ,β1,…,βl′ and whose remaining elements are in L has the required property.
Proposition 23
Let P be a subset of R and V1 (resp. Γ) the vector subspace (resp. the subgroup) of V generated by P. The following conditions are equivalent:
(i) P is closed and symmetric; (ii) P is closed, and P is a root system in V1; (iii) Γ∩R=P.
Assume that these conditions are satisfied. For any α∈P, let α1~ be the restriction of α~ to V1. Then the map α↦α1~ is the canonical bijection from the root system P to P~.
(iii) ⟹ (i): clear.
(i) ⟹ (ii): assume that P is closed and symmetric. First, P satisfies (RS_I) in V1. We show that, if α,β∈P, then sα(β)∈P. This is clear if α and β are proportional. Otherwise, sα(β)=β−n(β,α)α and β−pα∈R for all rational integers p between 0 and n(β,α) (Prop. 9, no. 3), so
β−n(β,α)α∈P
since P is closed and symmetric. Thus, sα,α1(P)=P, and P satisfies (RS_{II}). It is clear that P satisfies (RS_{III}). Thus, P satisfies (ii), and we have proved the last assertion of the proposition at the same time.
(ii) ⟹ (iii): we show that, if condition (ii) is satisfied, then Γ∩R=P. It is clear that P⊆Γ∩R. Let β∈Γ∩R. Since β∈Γ and P=−P, β=α1+α2+⋯+αk with α1,…,αk∈P. We shall prove that β∈P. This is clear if k=1. We argue by induction on k. We have
0<(β∣β)=i=1∑k(β∣αi),
so (β∣αi)>0 for some index i. If β=αi, then β∈P. Otherwise, β−αi∈R (Cor. of Th. 1, no. 3), so β−αi∈P by the induction hypothesis, hence β∈P since P is closed.
The conditions of Prop. 23 can be realised with V1=V and yet P=R. For example, this is the case when R is a system of type G2 and P a system of type A2; cf. Plate X.
Proposition 24
Let R′ be the intersection of R with a vector subspace of V, so that R′ is a root system in the vector subspace V′ that it generates (cf. Cor. of Prop. 4, no. 1). Let B′ be a basis of R′.
(i) There exists a basis of R containing B′. (ii) R′ is the set of elements of R that are linear combinations of elements of B′.
Assertion (ii) is clear. We prove (i). Let (ε1,ε2,…,εl) be a basis of V such that B′=(εp+1,εp+2,…,εl). The lexicographic order on V corresponding to this basis defines a chamber C of R. It is clear that every element of B′ is minimal in R+(C). Thus B′⊆B(C).
8. Highest root
Proposition 25
Assume that R is irreducible. Let C be a chamber of R, and let B(C)={α1,…,αl} be the corresponding basis.
(i) There exists a root α~=∑i=1lniαi such that, for every root ∑i=1lpiαi, we have n1≥p1,n2≥p2,…,nl≥pl. In other words, R has a largest element for the ordering defined by C. (ii) We have α~∈C. (iii) We have (α~∣α~)≥(α∣α) for every root α. (iv) For every positive root α′ not proportional to α~, we have n(α′,α~)=0 or 1.
1) Let α=∑i=1lniαi, β=∑i=1lpiαi be two maximal roots for the ordering defined by C. We shall prove that α=β, which will establish (i).
2) If (α∣αi)<0 for some index i, it follows that either α+αi∈R or α=−αi (Cor. of Th. 1, no. 3), and both possibilities are absurd by the maximality of α. Thus (α∣αi)≥0 for all i.
3) If α<0, then α<−α, which is absurd. Thus ni≥0 for all i. Let J be the set of i such that ni>0, and J′ the complement of J in {1,2,…,l}. Then J=∅. If J′ were non-empty, there would exist an i∈J and an i′∈J′ such that (αi∣αi′)<0 (Cor. 5 of Prop. 20, no. 7); we would then have
(α∣αi′)=i∈I∑ni(αi∣αi′)<0
since (αj∣αk)≤0 whenever j and k are distinct, which would contradict 2). Thus J′=∅ and ni>0 for all i.
4) We have (β∣αi)≥0 for all i by 2). We cannot have (β∣αi)=0 for all i since β=0. We deduce from 3) that
(β∣α)=i∑ni(β∣αi)>0.
If γ=α−β∈R, either α>β or β>α (Th. 3, no. 6), which contradicts the maximality of α and β. Thus α=β (Cor. of Th. 1, no. 3).
5) By 2), α~∈C. We shall prove that (α′∣α′)≤(α~∣α~) for every α′∈R. Since C is a fundamental domain for W(R), we can assume that α′∈C. We have α~−α′≥0, so (α~−α′∣x)≥0 for all x∈C. In particular (α~−α′∣α~)≥0 and (α~−α′∣α′)≥0, hence (α~∣α~)≥(α′∣α~)≥(α′∣α′). Thus n(α′,α~) must be equal to 0, 1 or -1 if α′ is not proportional to α~. If α′≥0, then (α~∣α′)≥0 by 2), so n(α′,α~)≥0 and n(α′,α~) must be either 0 or 1. Q.E.D.
Remark
The root
α~=i∑niαi
in (i) is said to be the highest root of R (with respect to C). Note that, by (i), we have ni≥1 for all i.
9. Weights, radical weights
Let l=dimV. Denote by Q(R) the subgroup of V generated by R; the elements of Q(R) are called the radical weights of R. By Th. 3 of no. 6, Q(R) is a discrete subgroup of V of rank l, and every basis of R is a basis of Q(R).
Similarly, the group Q(R∗) is a discrete subgroup of V∗ of rank l.
Proposition 26
The set of x∈V such that ⟨x,y∗⟩∈Z for all y∗∈Q(R∗) (or, equivalently, for all y∗∈R∗) is a discrete subgroup G of V containing Q(R). If B′ is a basis of R∗, the basis of V dual to B′ is a basis of G*.
Let x∈V. The following three properties are equivalent:
(i) ⟨x,y∗⟩∈Z for all y∗∈Q(R∗); (ii) ⟨x,y∗⟩∈Z for all y∗∈B′; (iii) the coordinates of x with respect to the dual basis of B′ are in Z.
We deduce from this that the basis dual to B′ is a basis of G. On the other hand, (RSIII) proves that R⊆G, so Q(R)⊆G.
The group G of Prop. 26 is denoted by P(R), and its elements are called the weights of R. We can also consider the group P(R∗) of weights of R∗.
P(R)/Q(R),P(R~)/Q(R~)
are finite groups in duality over Q/Z, and hence are isomorphic. The common order of these two groups is called the connection index of R (or of R~).
If R is a direct sum of root systems Ri, the group Q(R) (resp. P(R)) is identified canonically with the direct sum of the Q(Ri) (resp. P(Ri)).
Proposition 27
Let R1 be a subset of R, Q1 the subgroup of Q(R) generated by R1, and W1 the subgroup of W(R) generated by the sα (α∈R1). If p∈P(R) and w∈W1, then p−w(p)∈Q1.
If w=sα with α∈R1, then
p−w(p)=⟨p,α∨⟩α∈Zα⊆Q1.
If w=sα1sα2…sαr, with α1,…,αr∈R1, it is still true that p−w(p)∈Q1, 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∨={α∨}α∈B is a basis of R∨. The dual basis(ωα)α∈B of B∨ 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), the corresponding fundamental weights are denoted by (ω1,…,ωl).
Let x∈V. Then, x∈C if and only if ⟨x,α∨⟩>0 for all α∈B. It follows that C is the set of linear combinations of the ωα with coefficients ≥0.
The entries n(α,β)=⟨α,β∨⟩ of the Cartan matrix are, for fixed α, the coordinates of α with respect to the basis (ωβ)β∈B:
α=β∈B∑n(α,β)ωβ.
The Cartan matrix is thus the transpose of the matrix of the canonical injection
Q(R)→P(R)
with respect to the bases B and (ωα)α∈B of the Z-modules Q(R) and P(R).
A weight ω is said to be dominant if it belongs to C, in other words if its coordinates with respect to (ωα)α∈B are integers ≥0, or equivalently if g(ω)≤ω for all g∈W(R) (no. 6, Prop. 18). Since C is a fundamental domain for W(R) (Th. 2), there exists, for any weight ω, a unique weight ω′ such that ω′ is a transform of ω by W(R).
We have
⟨ωα,β∨⟩=(ωα∣(β∣β)2β)=δαβ
for α,β∈B (δαβ denoting the Kronecker symbol), hence
sβ(ωα)=ωα−δαββand(ωα∣β)=21(β∣β)δαβ.
In other words, ωαis orthogonal toβforβ=α, and its orthogonal projection ontoRαis21α. Since ωα∈C, (ωα∣ωβ)⩾0 for α,β∈B, i.e. the angle (ωα,ωβ) is acute or a right angle. The dominant weights are the ω∈V such that 2(ω∣α)/(∣α∣α) is an integer ⩾0 for all α∈B.
Proposition 28
Let* Bbe a basis ofR, B′a subset ofB, V′the vector subspace ofVgenerated byB′, R′=R∩V′(which is a root system inV′*),* R′~the inverse root system (which is identified with the canonical image ofR′inR′~), V1the orthogonal complement ofR′~inV, andpthe projection ofVontoV′parallel toV1. Then,Q(R′)=Q(R)∩V′, P(R′)=p(P(R)). The set of dominant weights ofR′is the image underpof the set of dominant weights ofR.
Indeed, Q(R) is the subgroup of V with basis B, Q(R′) is the subgroup of V′ with basis B′ (no. 7, Cor. 4 of Prop. 20) from which Q(R′)=Q(R)∩V′ is immediate. If ω∈P(R) and α∈R′, ⟨p(ω),α∨⟩=⟨ω,α∨⟩∈Z, so p(ω)∈P(R′), and hence p(P(R))⊆P(R′). If ω′∈P(R′), ω′ extends to a linear form ω on V∗ vanishing on (B−B′)~; we have ⟨ω,α∨⟩∈Z for all α∈B, so ω∈P(R), and ω′=p(ω); hence P(R′)⊆p(P(R)). Thus P(R′)=p(P(R)), and the assertion about dominant weights is proved in the same way.
Proposition 29
Let* ρbe half the sum of the roots>0.
(i) ρ=∑α∈Bωα; this is an element ofC. (ii) sα(ρ)=ρ−αfor allα∈B. (iii) (2ρ∣α)=(α∣α)for allα∈B.
Since R is reduced, sα(R+(C)−{α})=R+(C)−{α} and sα(α)=−α for α∈B (no. 6, Cor. 1 of Prop. 17), so sα(2ρ)=2ρ−2α. Since sα(ρ)=ρ−⟨ρ,α∨⟩, we see that
⟨ρ,α∨⟩=1=⟨β∈B∑ωβ,α∨⟩.
Hence, ρ=∑βωβ, and consequently ρ∈C. Finally, (iii) is equivalent to ⟨ρ,α∨⟩=1.
Corollary
Let σ be half the sum of the elements >0 of R− (for B−). For all α∈V, the sum of the coordinates of α with respect to the basis B is ⟨α,σ⟩. If α∈R, this sum is equal to 21∑β∈R+(C)n(α,β).
Interchanging the roles of R and R− above, we have ⟨α,σ⟩=1 for all α∈B, hence the corollary.
11. Coxeter transformation
Let C be a chamber of R, let {α1,…,αl} be the corresponding basis of R, and let c=sα1⋯sαl. The element c of W is called the Coxeter transformation of W defined by C and the bijection i↦αi (Chap. V, § 6, no. 1). Its order h is called the Coxeter number of W (or of R).
Proposition 30
Assume that R is irreducible. Let m be an integer between 1 and h−1 and prime to h. Then exp(h2iπm) is an eigenvalue of c of multiplicity 1.
In particular, m is an exponent of W, cf. Chap. V, § 6, no. 2.
We first prove a lemma:
Lemma 4
For all w∈W, the characteristic polynomial of w has integer coefficients.
We know (no. 6, Th. 3) that {α1,…,αl} is a basis of the subgroup Q(R) of V generated by R. Since w leaves Q(R) stable, its matrix with respect to {α1,…,αl} has integer entries; hence its characteristic polynomial has integer coefficients.
Let P be the characteristic polynomial of c. The above lemma shows that the coefficients of P are integers. By Chap. V, § 6, no. 2, Cor. 2 of Prop. 3, the primitive hth root of unity z=exp(h2iπ) is a simple root of P. Every conjugate of z over Q is therefore also a simple root of P. But we know (Algebra, Chap. V) that the primitive hth roots of unity are conjugate over Q. They are thus all simple roots of P, which proves the proposition.
Proposition 31
Assume that R is irreducible and reduced, and let β=n1α1+⋯+nlαl be the highest root of R (cf. no. 8). Then n1+⋯+nl=h−1.
Let R+ be the set of positive roots relative to C. Then (no. 10, Cor. of Prop. 29):
Assume that R is irreducible, and that all roots have the same length. Let α∈R. The number of elements of R not orthogonal to α is 4h−6.
Let R′ be the set of roots not proportional to and not orthogonal to α. By Chap. V, § 6, no. 2, Cor. of Th. 1,
(α∣α)2+(α∣−α)2+β∈R′∑(α∣β)2=h(α∣α)2,
that is
β∈R′∑(α∣β)2=(h−2)(α∣α)2.
If β∈R′, then (α∣β)=±21(α∣α) by the list in no. 3. Hence
41CardR′=h−2,CardR′=4h−8,
and the number of roots not orthogonal to α is CardR′+2=4h−6.
Proposition 33
Assume that R is irreducible and reduced. Put sαi=si, and let Γ be the subgroup of W generated by c=s1…sl.
(i) Let θi=slsl−1…si+1(αi) (i=1,…,l). Then, θi>0,c(θi)<0. (ii) If α is a root >0 such that c(α)<0, then α is equal to one of the θi. (iii) The family (θi)1≤i≤l is a basis of Q(R). (iv) Let Ωi be the orbit of θi under Γ. The sets Ωi are pairwise disjoint, they are all the orbits of Γ on R, and each has h elements.
Observe first that (s1,…,sl) is a reduced decomposition of c (Chap. IV, § 1, no. 1) with respect to the set S of the si. Indeed, otherwise there would exist a subset X=S−{j} of l−1 elements of S such that c∈WX, which would contradict Cor. 2 of Prop. 7 of Chap. IV, § 1, no. 8.
Applying Cor. 2 of Prop. 17 of no. 6 to c gives assertions (i) and (ii).
Let Qi be the subgroup of Q(R) generated by the αj,j>i. It is immediate that Qi is stable under the sj,j>i, and that sj(αi)=αi mod. Qi for j>i. Hence:
θi=sl…si+1(αi)=αi mod. Qi.
In other words, there exist integers cij such that
θi=αi+j>i∑cijαj.
Part (iii) follows immediately.
Finally, let α be a root. The element ∑k=0h−1ck(α) is invariant under c, and hence zero (Chap. V, § 6, no. 2). The ck(α) cannot therefore all have the same sign, and there exists a k such that ck(α)>0 and ck+1(α)<0. By (ii), ck(α) is one of the θi. Thus every orbit of Γ on R is one of the Ωi. Extend (x∣y) to a hermitian form on V⊗C. Each orbit of Γ in R has at most h elements, and there are at most l distinct orbits, by the above remarks. Now (Chap. V, § 6, no. 2, Theorem 2, ii)), the cardinal of R is equal to hl, 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⟩
on V is non-degenerate and invariant under A(R). Interchanging the roles of R and R∗, it follows that the symmetric bilinear form (x∗,y∗)↦BR∗(x∗,y∗)=∑α∈R⟨α,x∗⟩⟨α,y∗⟩ on V∗ is non-degenerate and invariant under A(R).
The inverse form of BR∗ (resp. BR) on V (resp. V∗) will be called the canonical bilinear form on V (resp. V∗) and denoted by ΦR (resp. ΦR∗). It is non-degenerate and invariant under A(R). Let σ be the isomorphism from V to V∗ defined by BR∗. Then, for x∈V and y∈V:
ΦR(x,y)=BR∗(σ(x),σ(y))=α∈R∑⟨α,σ(x)⟩⟨α,σ(y)⟩.
But ⟨α,σ(x)⟩=BR∗(σ(α),σ(x))=ΦR(α,x). Hence,
ΦR(x,y)=α∈R∑ΦR(α,x)Φ(α,y).
(16) In view of Prop. 7 of no. 2, ΦR is the only non-zero symmetric bilinear form invariant under W(R) which satisfies the identity (16).
For β∈R, (16) gives
ΦR(β,β)=α∈R∑ΦR(α,β)2=41ΦR(β,β)2α∈R∑n(α,β)2,
hence
4ΦR(β,β)−1=α∈R∑n(α,β)2.
Moreover, by Lemma 2 of no. 1, we have, for x,y∈V:
Further, if all the roots of R have the same length λ for ΦR, (16) and (18) show that
γ(R)=λ−4.
(20)
Moreover, if h is the Coxeter number of W, the Cor. of Th. 1 of Chap. V, § 6, no. 2 shows that:
hΦR(x,x)=α∈R∑(x,λα)2 for all x∈V.
Comparing with (16), we deduce that
λ=h−1/2orγ(R)=h2.
(21)
Finally, formula (19) shows that the roots of R∼ have length λ for ΦR∼.
Exercises
All the root systems considered below are relative to real vector spaces. We denote by (x∣y) a scalar product invariant under the Weyl group (cf. no. 3).