Exposé XXIII. Reductive groups: uniqueness of pinned groups

by M. Demazure

1

The aim of this Exposé is the proof of the uniqueness theorem (Theorem 4.1). This was proved by Chevalley in the case of an algebraically closed field; the method of reduction to rank two used here is also due to Chevalley (see Bible, Exp. 23 and 24). Along the way, we obtain an explicit description of reductive groups by generators and relations (3.5).

1. Pinnings

Definition 1.1. Let be a scheme and an -split group (XXII, 1.13). One calls pinning[^N.D.E-XXIII-butterfly] of this split group the datum of a system of simple roots of and, for each , a section .[^N.D.E-XXIII-butterfly-anchor]

In other words, a pinning of the reductive group over the nonempty scheme is the datum of:

(i) a maximal torus ,

(ii) an abelian group and an isomorphism ,

(iii) a system of roots of with respect to ,

(iv) a system of simple roots of ,

(v) an for every , that is, of a

u_α = exp_α(X_α) ∈ U_α^×(S)    for every α ∈ Δ,

satisfying condition (D 1) of Exp. XXII, 1.13 (indeed condition (D 2) of loc. cit. is automatically satisfied2).

Every split group admits a pinning; in particular, every reductive group is locally pinnable for the étale topology.

1.2.

If is a pinned -group — that is, an -split group equipped with a pinning — it is canonically endowed with the system of positive roots defined by , the corresponding Borel subgroup , the opposite Borel subgroup , the unipotent groups , , the open set , etc. Likewise, for each , one has a canonical isomorphism of vector groups

p_α : G_{a, S} ⥲ U_α,    x ↦ exp_α(x X_α) = u_α^x,

normalized by with multiplier , and whose datum is equivalent to that of (Exp. XXII, 1.1).

By duality, one deduces an and an isomorphism

p_{-α} : G_{a, S} ⥲ U_{-α}

which is the contragredient of the preceding one (Exp. XXII, 1.3). We shall set (Exp. XX, 3.1)

w_α = w_α(X_α) = p_α(1) p_{-α}(-1) p_α(1) = p_{-α}(-1) p_α(1) p_{-α}(-1).

One then has (loc. cit. 3.1, 3.7)

w_α^2 = α^*(-1),    int(w_α) t = s_α(t) = t · α^*(α(t)^{-1}),
int(w_α) p_α(x) = p_{-α}(-x) = p_{-α}(x)^{-1},
Ad(w_α) X_α = -X_{-α},
int(w_α) p_{-α}(x) = p_α(-x) = p_α(x)^{-1},
Ad(w_α) X_{-α} = -X_α.

We shall use the preceding notation systematically in what follows.

Definition 1.3. Let be a scheme and and two pinned -groups. One says that the morphism of split groups (Exp. XXII, 4.2.1)

is compatible with the pinnings, or that it defines a morphism of pinned groups, if the bijection associated with it (cf. loc. cit.) satisfies and if, for every , one has

f(exp_α(X_α)) = exp_{d(α)}(X'_{d(α)}),    i.e.    f(u_α) = u'_{d(α)}.

3

1.4.

If we denote by the integer of loc. cit., we therefore have

f(p_α(x)) = p'_{d(α)}(x^{q(α)})    for    α ∈ Δ,

and consequently

f(p_{-α}(x)) = p'_{-d(α)}(x^{q(α)}),    f(w_α) = w'_{d(α)}.

Recall (Exp. XXII, 4.2) that, for every and all , ,

f(α^*(z)) = d(α)^*(z)^{q(α)} = d(α)^*(z^{q(α)}),    d(α)(f(t)) = α(t)^{q(α)}.

1.5.

We shall call a pinned root datum a root datum endowed with a system of simple roots, and a -morphism of pinned root data a -morphism of root data (Exp. XXI, 6.8) sending simple roots to simple roots.

If is a pinned -group, we denote by the corresponding pinned root datum (this is the root datum of Exp. XXII, 1.14 equipped with ). Let be the integer defined in Exp. XXII, 4.2.2. One then has:

Scholium 1.6. The correspondence defines a functor from the category of pinned reductive -groups to that of pinned root data (with -morphisms as morphisms).

1.7. The pinned groups

Let be a subset of the system of simple roots of the pinned group . Let be the maximal torus of ; set

Set ; one knows (Exp. XXII, 5.10.7) that is a reductive -group with radical , that (T, M, R') is a splitting of it, and a system of simple roots. It follows that is a pinned -group. We shall always equip with this pinning. In particular, we shall consider the groups

Z_α = Z_{{α}},    Z_{αβ} = Z_{{α, β}}.

We denote by ; one knows (loc. cit.) that this is the canonical Borel subgroup4 of , and that its unipotent part is . In particular,

We shall denote

U_{αβ} = U_{{α, β}} = U ∩ Z_{αβ} = ∏_{γ ∈ R^+_{αβ}} U_γ,

where denotes the set of positive roots that are linear combinations of and .

Now let be a morphism of pinned -groups. If is the corresponding bijection and if is a subset of , then is a subset of , and it is clear that sends into , hence into . The corresponding -morphism

is compatible with the canonical pinnings; it defines a morphism of pinned root data

R(f_{Δ_1}) : R(Z_{Δ_1}, T, M, …) → R(Z_{Δ'_1}, T', M', …)

and the underlying morphisms of and coincide.

1.8. Study of the group

For each pair of simple roots, denote by the order of the element of the Weyl group . In particular, . One has therefore .

Definition 1.8.1. For every , one sets

t_{αβ} = (w_α w_β)^{n_{αβ}} ∈ T(S).

Moreover, one sets (Exp. XX, 3.1)

t_α = t_{αα} = w_α^2 = α^*(-1) ∈ T(S).

Proposition 1.8.2. Let be an -functor in groups transforming direct sums of schemes into products (for example a sheaf for the Zariski topology). Let

be a morphism of groups and elements of . In order that there exist a morphism of groups (necessarily unique)

inducing on and such that for , it is necessary and sufficient that the following two conditions be satisfied:

(i) For every ,

f_T(s_α(t)) = h_α f_T(t) h_α^{-1}

for every , (i.e. ).

(ii) For every ,

Proof. Indeed, equip (Sch) with the topology generated by the pretopology whose covering families are the direct sums; the hypothesis of the statement says that is a -sheaf. Let be the free group with generators and L_1 the invariant subgroup generated by the elements , . Let be the morphism defined by ; one knows (Exp. XXI, 5.1) that induces an isomorphism of onto . Make act on through (or, equivalently, by ). Let L_S be the constant group defined by ; consider the semidirect product for the preceding operation. One has a morphism of -groups

h : T · L_S = N → Norm_G(T)

unique such that , for every , . Let N_1 be the invariant subsheaf of groups of generated by the

t_{αβ}^{-1} · (m_α m_β)^{n_{αβ}},    (α, β) ∈ Δ × Δ.

One evidently has ; consider the induced morphism

Let us prove that is an isomorphism. Since induces on the canonical immersion, which is a monomorphism, the canonical morphism

is also a monomorphism, hence induces an isomorphism of onto . For the same reason, induces an isomorphism of onto ; to prove that is an isomorphism, it therefore suffices to verify that the corresponding morphism

is an isomorphism. Now TN_1 is the invariant -subsheaf of groups of generated by and the , that is, the -subsheaf generated by and L_1, that is, . The morphism is therefore identified with the morphism

which is an isomorphism by construction.

The proof of 1.8.2 is now easy; the conditions are evidently necessary. Let us prove that they are sufficient. Condition (i) shows that there exists a morphism

such that for , and . Condition (ii) says that vanishes on N_1, which yields the result at once.

1.9. Faithfulness of the functor

Proposition 1.9.1. The functor of 1.6 is faithful: if

f, g : G ⇒ G'

are two morphisms of pinned groups such that , then .

Indeed, and coincide on , and ; it therefore suffices to apply:

Lemma 1.9.2. Let be a scheme, a pinned reductive -group, an -presheaf in groups, separated for (fppf). Let

f, g : G ⇒ H

be two morphisms of -groups. The following conditions are equivalent:

(i) .

(ii) and coincide on , on each , on each .

(iii) and coincide on , on each , and for each .

Indeed, (i) ⇒ (ii) is trivial, (ii) ⇒ (iii) follows at once from the definition of (1.2). It remains to prove (iii) ⇒ (i). If , there exists a sequence with , hence

U_α = int(w_{α_1} ⋯ w_{α_n}) U_{α_{n+1}},

which shows that and coincide on each . It follows that and coincide on , hence coincide (Exp. XXII, 4.1.11).

Remark 1.9.3. If is semisimple, one may, in (ii) and (iii), drop the hypothesis that and coincide on . Indeed, is generated as an (fppf) sheaf by the , (Exp. XXII, 6.2.2 (a)).

2. Generators and relations for a pinned group

In this section, we fix a pinned -group . If , we shall use the notation , , , of 1.7.

Theorem 2.1. Let be a scheme, a pinned -group, an -sheaf in groups for (fppf). Let

f_N : Norm_G(T) → H,    f_α : U_α → H,    α ∈ R,

be morphisms of groups. In order that there exist a morphism of groups (necessarily unique)

extending and the , it is necessary and sufficient that the following conditions be satisfied:

(i) For every and every ,

int(f_N(w_α)) ∘ f_β = f_{s_α(β)} ∘ int(w_α).

(ii) For every , there exists a morphism of groups

extending , and .

(iii) For every pair , there exists a morphism of groups inducing on for every (i.e. ).

2.1.1. Proof

The conditions of the statement are evidently necessary. Choose on the other hand a structure of totally ordered group on such that the roots > 0 are the elements of (Exp. XXI, 3.5.6); every product indexed by a subset of will be taken relative to this order.

Denote by the restriction of to , and consider the morphism

defined set-theoretically by

f(∏_{α ∈ R^-} y_α · t · ∏_{α ∈ R^+} x_α) = ∏ f_α(y_α) · f_T(t) · ∏ f_α(x_α).

Any morphism satisfying the conditions of the statement must extend ; on the other hand any morphism of groups extending also extends : indeed, extending and , it satisfies , and it extends by hypothesis. By Exp. XXII, 4.1.11 (ii), one is therefore reduced to proving:

Proposition 2.1.2. The morphism defined above is "generically multiplicative"; more precisely, for every and all such that , one has .

Lemma 2.1.3. Let , , and let be such that (i.e. ); then

int(f_N(n)) ∘ f_α = f_β ∘ int(n).

Indeed, it suffices to verify the formula for a system of generators of the sheaf ; it is true for each , (by 2.1 (i)), so it suffices to do it for . This is trivial by 2.1 (ii) if is simple; otherwise, one takes a such that ; writing as a product of simple reflections,5 one is reduced to proving that if the formula is true for and for every , it is also true for and , where . Now, by 2.1 (i),

int(f_N(t)) ∘ f_{w_{α_0}(α)} = int(f_N(t w_{α_0})) ∘ f_α ∘ int(w_{α_0}^{-1})
                             = f_{w_{α_0}(α)} ∘ int(t w_{α_0}) ∘ int(w_{α_0}^{-1}).

Lemma 2.1.4. The restriction of to (resp. ) is a morphism of groups. In particular, this restriction is independent of the order chosen on the roots.

It suffices to give the proof for . By virtue of Exp. XXII, 5.5.8, it suffices to verify that for every pair of positive roots, one has for all , , ,

f_β(x_β) f_α(x_α) f_β(x_β^{-1}) = f(x_β x_α x_β^{-1}).

By Exp. XXII, 5.5.2, there exist (, , 6) such that

x_β x_α x_β^{-1} = ∏_γ x_γ,

and we must therefore verify the relation

f_β(x_β) f_α(x_α) f_β(x_β^{-1}) = ∏_{γ = iα + jβ, i > 0, j ⩾ 0} f_γ(x_γ).

By Exp. XXI, 3.5.4, there exists such that , (notation of 1.7), where . Lifting to an (by Exp. XXII, 3.8), it suffices to verify the preceding relation after conjugation by . By 2.1.3, one is therefore reduced to the case , a case in which we conclude by condition 2.1 (iii).

Lemma 2.1.5. Let be such that (i.e. is the symmetry of the Weyl group7 (Exp. XXI, 3.6.14)). For every , (resp. , ), one has

f(n u n^{-1}) = f_N(n) f(u) f_N(n^{-1}).

Immediate by 2.1.3 and 2.1.4.

Lemma 2.1.6. Let , , , . Then

f(v g u) = f(v) f(g) f(u).

Indeed, set , , , with , , . One has

f(v) f(g) f(u) = f(v_1) f_T(t_1) f(v_2) f_T(t_2) f(u_2) f_T(t_3) f(u_3),

on the one hand, and

f(v g u) = f(v_1 t_1 v_2 t_1^{-1} t_1 t_2 t_3 t_3^{-1} u_2 t_3 u_3)
         = f(v_1 · t_1 v_2 t_1^{-1}) f_T(t_1 t_2 t_3) f(t_3^{-1} u_2 t_3 · u_3).

Using 2.1.4 to decompose the two extreme terms of this last expression, one obtains

f(v g u) = f(v_1) f(t_1 v_2 t_1^{-1}) f_T(t_1 t_2 t_3) f(t_3^{-1} u_2 t_3) f(u_3).

One is then reduced to the obvious formulas

f(t_1 v_2 t_1^{-1}) = f_T(t_1) f(v_2) f_T(t_1)^{-1},    f(t_3^{-1} u_2 t_3) = f_T(t_3)^{-1} f(u_2) f_T(t_3),

which follow from the definition of and from 2.1.3.

Lemma 2.1.7. Let and , . Then

f(w_α g w_α^{-1}) = f_N(w_α) f(g) f_N(w_α)^{-1}.

Indeed, let , . Write, by Exp. XXII, 5.6.8,

g = a x_{-α} t x_α b,

with , , , , . By 2.1.3, 2.1.4 and the fact that permutes the positive roots (cf. Exp. XXI, 3.3.2), one has

int(w_α) a ∈ U_{-α̂}^-(S'),    int(w_α) b ∈ U_{α̂}(S')

and the formula to be proved is true for or . By 2.1.6, one is therefore reduced to proving the asserted formula when . But then "everything happens in ", and one concludes by condition (ii) of 2.1.

Lemma 2.1.8. Let . For every and every such that , one has

f(n g n^{-1}) = f_N(n) f(g) f_N(n)^{-1}.

This is trivial if (by 2.1.3). The two sides of the preceding formula define morphisms of into ; to verify that they coincide, it suffices to verify that there exists an open of containing the unit section such that , and that and coincide on . By virtue of the structure of , it suffices to prove that if the preceding assertion is true for an and if , it is true for . Set

V_n = Ω ∩ int(w_α)^{-1} V_{n'}.

One has . If , then

int(n) g = int(n') int(w_α) g.

Now , hence by hypothesis

f(int(n') int(w_α) g) = int(f_N(n')) f(int(w_α) g);

since , one may apply 2.1.7, which gives

f(int(w_α) g) = int(f_N(w_α)) f(g),

and one concludes at once.

Let us now prove 2.1.2. Let ; write as usual

x = v t u,    x' = v' t' u',

whence

x x' = v t (u v') t' u'.

By 2.1.6 and the relation , one is reduced to proving that if , then . Let be as in 2.1.5 (ii). One has

f(u) = f_N(n)^{-1} f(n u n^{-1}) f_N(n),    f(v') = f_N(n)^{-1} f(n v' n^{-1}) f_N(n),

by loc. cit., whence

f(u) f(v') = f_N(n)^{-1} f(n u n^{-1}) f(n v' n^{-1}) f_N(n).

But , , so that

f(n u n^{-1}) f(n v' n^{-1}) = f((n u n^{-1})(n v' n^{-1})) = f(n u v' n^{-1}),

which gives

f(u) f(v') = f_N(n)^{-1} f(n u v' n^{-1}) f_N(n).

If , one may apply 2.1.8 and one is done.

Remark 2.2. Instead of giving oneself , one may give oneself a morphism of groups and sections satisfying the conditions of 1.8.2. One must then replace condition (ii) of the theorem by:

(ii') There exists a morphism of groups extending

f_α,    f_{-α},    f_T    and satisfying    F_α(w_α) = h_α.

We shall now give the preceding theorem a more explicit form. Keep the preceding notation.

Theorem 2.3. Let be a scheme, a pinned -group. Let be an -sheaf in groups for (fppf),

f_T : T → H,    f_α : U_α → H,    α ∈ Δ,

morphisms of groups, and

h_α ∈ H(S),    (α ∈ Δ),

sections of . In order that there exist a morphism of groups

(necessarily unique) inducing and the and satisfying for every , it is necessary and sufficient that the following conditions be satisfied:

(i) For every , every , every and every ,

f_T(t) f_α(x) f_T(t)^{-1} = f_α(int(t) x).            (1)

(ii) For every , every , every ,

h_α f_T(t) h_α^{-1} = f_T(s_α(t)) = f_T(t · α^* α(t)^{-1}).            (2)

(iii) For every ,

(iv) For every , (recall that we write )

(v) For every , , there exists a morphism of groups

satisfying the two following conditions:

a) One has

f_{αβ}|_{U_α} = f_α,    f_{αβ}|_{U_β} = f_β,            (5)

b) For every , (resp. ), and every , ,

int(h_α) f_{αβ}(x) = f_{αβ}(int(w_α) x),                                       (6)
(resp. int(h_β) f_{αβ}(x) = f_{αβ}(int(w_α) x)).

Proof. The uniqueness is clear by 1.9.2. Let us prove existence.

Lemma 2.3.1. There exists a morphism of groups

extending and satisfying .

This is precisely what is asserted by 1.8.2, taking into account conditions (2) and (3).

Lemma 2.3.2. There exists a morphism of groups

F_α : Z_α → H,    α ∈ Δ,

extending , and satisfying , hence extending .

This is clear from Exp. XX, 6.2 and conditions (1), (3) and (4).

Lemma 2.3.3. For every , , every such that (resp. ), i.e. (resp. ), every and every ,

int(f_N(n)) f_α(x) = f_α(int(n) x)

(resp.

int(f_N(n)) f_α(x) = f_β(int(n) x)).

Indeed, there exist a and a sequence such that . The condition is satisfied for by condition (1). One may therefore suppose . We proceed by induction on , i.e. we suppose the assertion proved for every which can be written as a product of fewer than simple reflections (and satisfies the hypotheses of the lemma). Consider the roots

If all the are positive, i.e. belong to , one may apply condition (v) of 2.3; using the notation of 2.3 (v), one concludes at once by induction that

int(f_N(w_{α_i} ⋯ w_{α_1})) f_α(x) = f_{αβ}(int(w_{α_i} ⋯ w_{α_1}) x),

which for is the desired property. If not all the are positive, there exists an index such that

γ_j ∈ R^+,    γ_{j+1} ∉ R^+.

Since , it follows at once that , by Exp. XXI, 3.3.2, hence that is or , and one may decompose as

and n'' satisfying the hypotheses of the lemma and being a product of fewer than reflections, hence satisfying by the induction hypothesis the conclusion of the lemma.

Lemma 2.3.4. Let . If and satisfy and , one has

int(f_T(n)^{-1}) f_β(n x n^{-1}) = int(f_T(n')^{-1}) f_{β'}(n' x n'^{-1}),

for every , .

It suffices to verify that if , , then . Now, by Tits's lemma (Exp. XXI, 5.6), there exists a sequence of simple roots , and a sequence of elements , , with

n = w_{m-1} ⋯ w_0,
w_i(α_i) = α_{i+1},    i = 0, 1, …, m - 1,

the following condition being moreover satisfied: for every , there exists a simple root such that

w_i ∈ W_{α_i β_i},    α_{i+1} = α_i    or    β_i.

One is then reduced by induction to the case treated in the preceding lemma.

Lemma 2.3.5. There exists a family of morphisms of groups , , satisfying

(i) For , and , where is defined in 2.3.2.

(ii) For and , .

(iii) For every and such that ,

int(f_N(n)) f'_α(x) = f'_β(int(n) x)

for every , .

For every root , there exists an such that . Then define as the expression of 2.3.4. This is independent of the choice of , and is indeed a morphism of groups. Property (iii) is satisfied by construction. The first assertion of (i) is clear (take ), the second too (take and apply 2.3.2); if (), there exists such that or ; one then applies (iii) and conditions (5) and (6) and has proved (ii).

2.3.6.

Let us now prove the theorem by showing that the conditions of 2.1 are satisfied, for the morphisms and , .

  • 2.1 (i) follows from 2.3.5 (iii),
  • 2.1 (ii) follows from 2.3.5 (i) and 2.3.2,
  • 2.1 (iii) follows from 2.3.5 (ii) and from the fact that is a morphism of groups.

An obvious corollary is:

Corollary 2.4. Let be a scheme, a pinned -group of semisimple rank , an (fppf) -sheaf in groups. For each , let

be a morphism of groups. In order that there exist a morphism of groups

inducing the , it is necessary and sufficient that for every ,

The condition is evidently necessary. Suppose it satisfied. Set (which does not depend on , since ). Set

p_α = F_{αα}|_{U_α},    h_α = F_{αα}(w_α),    f_{αβ} = F_{αβ}|_{U_{αβ}}.

The conditions of 2.3 are evidently satisfied: (1), (2), (4) "are verified" in , (3), (5) and (6) in . There therefore exists a morphism extending , the and satisfying ; it coincides with on generators of , hence satisfies .

One also has the following technical corollary.

Corollary 2.5. Let be a scheme, and two pinned -groups of semisimple rank 2, an integer > 0 such that is an endomorphism of , a -morphism of pinned root data. Choose for each an and an (extending the canonical choices for ). Suppose the following conditions are realized:

(i) If , then .

(ii) For every and every , (whence ), if is defined by

Ad(w_α) X_β = z X_{s_α(β)},

one has also

Ad(w'_{d(α)}) X'_{d(β)} = z^{q(β)} X'_{d(s_α(β))}.

(iii) There exists a morphism of groups such that for every ,

f(exp(x X_α)) = exp(x^{q(α)} X'_{d(α)})

for every , `S' → S.

Then there exists a morphism of pinned groups such that .

Indeed, one defines by

f_α(exp(x X_α)) = exp(x^{q(α)} X'_{d(α)});

one sets , . The conditions of 2.3 are satisfied (note that (Exp. XXI, 6.8.4) and that one always has ), and one concludes at once.

Remark 2.6. One may make condition (v) of 2.3 more precise as follows. One must first verify:

(a) For every word in and such that the corresponding word transforms or into or , the relation of type 2.3.3 corresponding is satisfied. In fact the proof of 2.3.3 shows that it suffices to verify it for the words in and that are minimal (in the sense that any nontrivial initial sub-word does not satisfy the imposed conditions).

If condition (a) is satisfied, one may now define for each an as in 2.3.5; one must then write:

(b) The morphism defined by the

U_{αβ} = ∏_{γ ∈ R^+_{αβ}} U_γ → H

is a morphism of groups. By Exp. XXII, 5.5.8, (b) is entailed by:

(b') The preceding morphism respects the commutation relations between and for , (i.e. the relations in of Exp. XII, 5.5.2).

It is clear that conversely the set of conditions (a) and (b') is equivalent to (v).

One may even reduce the preceding conditions to conditions bearing only on the elements , , , of . A condition of type (a) will be written for example, if :

int(h_α h_β h_α) f_β(x) = f_α(int(w_α w_β w_α) x);            (1)

for every , . In particular, for , one has for a certain section of , and the preceding relation will give

int(h_α h_β h_α) f_β(u_β) = f_α(u_α)^z.            (1')

Let us show that, conversely, taking into account conditions (i) to (iv) of 2.3, (1') entails (1). If , , make act on (1'); taking into account conditions (i) and (ii), one obtains (1) for . It suffices to remark now that is faithfully flat, hence that condition (1) is certainly true for , . Since it is additive in , and every section of can be locally written as a sum of two sections of , one concludes that (1') + (i) + (ii) ⇒ (1).

One reasons similarly with conditions of type (b). It is then necessary to use the fact that if and are two distinct (hence linearly independent over ) positive roots, the morphism of components and is faithfully flat. We leave the details of this transposition to the reader.

3. Groups of semisimple rank 2

3.1. Generalities

Lemma 3.1.1. Let be a scheme, a pinned -group, and two roots of , with .

(i) If , then

exp(X_α) exp(X_β) = exp(X_β) exp(X_α)

for all , , .

(ii) If and are not roots, then

w_α(z_α) exp(X_β) w_α(z_α)^{-1} = exp(X_β)

for all , , , and

w_α(z_α) w_β(z_β) = w_β(z_β) w_α(z_α)

for all and , .

(iii) Let , , and such that ; define by

Ad(w) X_α = z X_β.

Then

int(w) exp(x X_α) = exp(x z X_β),
int(w) exp(y X_α^{-1}) = exp(y z^{-1} X_β^{-1}),
int(w) w_α(X_α) = β^*(z) w_β(X_β).

In particular, if , then

(iv) If one sets , , then

s_α(t_β) = t_β t_α^{(β^*, α)},    β(t_α) = (-1)^{(α^*, β)}.

Proof. (i) follows at once from Exp. XXII, 5.5.2; (ii) from Exp. XX, 3.1 and from (i) applied to , , , ; (iii) is evident from the definitions. For the last assertion of (iii), note that . Finally, (iv) is trivial.

Proposition 3.1.2 (Groups of type ). Let be a scheme, a pinned -group of type , and denote .

(i) One has

t_{αβ} = (w_α w_β)^2 = t_α t_β = (w_β w_α)^2 = t_{βα}.

(ii) One has

Ad(w_α) X_β = X_β,    Ad(w_β) X_α = X_α.

(iii) and commute (i.e. is commutative).

Indeed, by assertion (ii) of the lemma, , whence , which is (i). By assertion (ii) of the lemma, one has also (ii); finally, (iii) is assertion (i) of the lemma.

3.1.3.

Let us make condition (v) of 2.3 explicit here. Using the method exposed in 2.6, one obtains the two following groups of conditions, setting for :

(A)   h_α v_β h_α^{-1} = v_β,           (B)   v_α v_β = v_β v_α.
      h_β v_α h_β^{-1} = v_α

3.2. Groups of type A_2

Proposition 3.2.1. Let be a scheme, a pinned -group of type A_2, and denote , .

(i) One has

t_{αβ} = (w_α w_β)^3 = e = (w_β w_α)^3 = t_{βα}.

(ii) Set . Then

Ad(w_α) X_β = -X_{α + β},    Ad(w_α) X_{α + β} = X_β,    Ad(w_β) X_{α + β} = -X_α.

(iii) Set . Then

p_β(y) p_α(x) = p_α(x) p_β(y) p_{α + β}(x y).

3.2.2.

The proof occupies Nos. 3.2.2 to 3.2.7. First, , whence .

Set ; one has at once

Ad(w_β) X_{α + β} = α(t_β) X_α = -X_α.

Set

Ad(w_α) X_β = z X_{α + β},    z ∈ G_m(S),

whence

Ad(w_α) X_{α + β} = β(t_α) z^{-1} X_β = -z^{-1} X_β.

We know (Exp. XXII, 5.5.2) that there exists a unique section such that

p_β(y) p_α(x) = p_α(x) p_β(y) p_{α + β}(A x y).            (+)

To prove (ii) and (iii), it therefore remains to show that .

3.2.3.

Make act on the preceding formula (+); one obtains:

p_{-β}(-y) p_{α + β}(x) = p_{α + β}(x) p_{-β}(-y) p_α(-A x y).            (++)

3.2.4.

By definition of ,

w_β p_α(x) w_β^{-1} = p_{α + β}(x),

which is written

p_β(1) p_{-β}(-1) p_β(1) p_α(x) p_β(-1) p_{-β}(1) p_β(-1) = p_{α + β}(x).

Since and commute, not being a root, this is also written

p_β(1) p_α(x) p_β(-1) = p_{-β}(1) p_{α + β}(x) p_{-β}(-1).

Using now (+) in the left member and (++) in the right, one obtains:

p_α(x) p_β(1) p_{α + β}(A x) p_β(-1) = p_{α + β}(x) p_{-β}(1) p_α(A x) p_{-β}(-1).

Since (resp. ) is not a root, the left (resp. right) member is written

p_α(x) p_{α + β}(A x)    resp. p_{α + β}(x) p_α(A x)

and the right-hand term equals , since is not a root. Therefore

p_α(x) p_{α + β}(A x) = p_α(A x) p_{α + β}(x),

which gives (by XXII 4.1.3) .

3.2.5.

Now make act on formula (+); using the fact that , one finds

p_{α + β}(z y) p_{-α}(-x) = p_{-α}(-x) p_{α + β}(z y) p_β(-z^{-1} x y).            (+++)

3.2.6.

Write now, as a moment ago,

w_α p_β(y) w_α^{-1} = p_{α + β}(z y),

whence, since and commute,

p_α(1) p_β(y) p_α(-1) = p_{-α}(1) p_{α + β}(z y) p_{-α}(-1).

Using now (+) and (+++), this is also written

p_β(y) p_{α + β}(-y) = p_{α + β}(z y) p_β(-z^{-1} y),

and since and commute, this gives .

3.2.7.

We have therefore proved (ii) and (iii). Let us prove (i). One has

w_α w_β w_α = w_α w_β w_α^{-1} w_α^2 = w_{α + β}^{-1} t_α,

whence

w_β w_α w_β w_α w_β = w_β w_{α + β}^{-1} t_α w_β = w_β w_{α + β}^{-1} w_β^{-1} · s_β(t_α) · t_β
                    = w_α · t_α t_β · t_β = w_α t_α = w_α^{-1},

which gives

(w_α w_β)^3 = (w_β w_α)^3 = e,

which completes the proof.

Remark 3.2.8. Condition (v) of 2.3 translates here as (setting ):

(A)   int(h_α h_β h_α) v_β = vβ → h_α v_β h_α^{-1} = h_β v_α h_β^{-1}      (B)
      int(h_β h_α h_β) v_α = vα                                                  v_β v_α = v_α v_β · h_β v_α h_β^{-1},
                                                                                 v_β · h_β v_α h_β^{-1} = h_β v_α h_β^{-1} · v_β,
                                                                                 v_α · h_β v_α h_β^{-1} = h_β v_α h_β^{-1} · v_α.

Setting , the three last conditions are also written

(B)   v_β v_α = v_α v_β v_{α + β},
      v_α v_{α + β} = v_{α + β} v_α,
      v_β v_{α + β} = v_{α + β} v_β.

3.3. Groups of type B_2

Proposition 3.3.1. Let be a scheme, a pinned -group of type B_2, and denote , .

(i) One has

t_{αβ} = (w_α w_β)^4 = t_α = (w_β w_α)^4 = t_{βα}.

(ii) If one sets

Ad(w_β) X_α = X_{α + β},    Ad(w_α) X_β = X_{2α + β},

one has:

Ad(w_α) X_{α + β} = -X_{α + β},
Ad(w_α) X_{2α + β} = X_β,
Ad(w_β) X_{α + β} = -X_α,
Ad(w_β) X_{2α + β} = X_{2α + β}.

(iii) Set

p_{α + β}(x) = exp(x X_{α + β}) = int(w_β) p_α(x),
p_{2α + β}(x) = exp(x X_{2α + β}) = int(w_α) p_β(x).

Then:

p_β(y) p_α(x) = p_α(x) p_β(y) p_{α + β}(x y) p_{2α + β}(x^2 y),
p_{α + β}(y) p_α(x) = p_α(x) p_{α + β}(y) p_{2α + β}(2 x y).

3.3.2.

The proof occupies Nos. 3.3.2 to 3.3.6. One has , , whence , .

Note in passing that , which shows that is a section of . Set

Ad(w_β) X_α = X_{α + β},    Ad(w_α) X_β = X_{2α + β}.

One has at once

Ad(w_β) X_{α + β} = α(t_β) X_α = -X_α,
Ad(w_α) X_{2α + β} = β(t_α) X_β = X_β.

Since and are not roots,

Ad(w_β) X_{2α + β} = X_{2α + β}.

There exists a scalar such that

Ad(w_α) X_{α + β} = k X_{α + β}.

On the other hand, by Exp. XXII, 5.5.2, there exist sections such that

p_β(y) p_α(x) = p_α(x) p_β(y) p_{α + β}(A x y) p_{2α + β}(B x^2 y),       (1)
p_{α + β}(y) p_α(x) = p_α(x) p_{α + β}(y) p_{2α + β}(C x y).               (2)

It is therefore necessary, in (ii) and (iii), to prove that , , .

3.3.3.

Make act on formula (2). One finds

p_{2α + β}(y) p_{-α}(-x) = p_{-α}(-x) p_{2α + β}(y) p_{α + β}(A k x y) p_β(B x^2 y).       (3)

Transforming (2) likewise, one obtains

p_{α + β}(k y) p_{-α}(-x) = p_{-α}(-x) p_{α + β}(k y) p_β(C x y).       (4)

Transforming (1) by ,

p_{-β}(-y) p_{α + β}(x) = p_{α + β}(x) p_{-β}(-y) p_α(-A x y) p_{2α + β}(B x^2 y).       (5)

3.3.4.

Write

w_β p_α(x) w_β^{-1} = p_{α + β}(x).

Since is not a root, this gives

p_β(1) p_α(x) p_β(-1) = p_{-β}(1) p_{α + β}(x) p_{-β}(-1).

Using (1) in the left member and (5) in the right, one obtains

p_α(x) p_β(1) p_{α + β}(A x) p_{2α + β}(B x^2) p_β(-1) =
    p_{α + β}(x) p_{-β}(1) p_α(A x) p_{2α + β}(-B x^2) p_{-β}(-1).

Since commutes with and on the one hand, and commutes with and on the other hand, this is written

p_α(x) p_{α + β}(A x) p_{2α + β}(B x^2) = p_{α + β}(x) p_α(A x) p_{2α + β}(-B x^2).

Transforming the right member by (2), one obtains

p_α(x) p_{α + β}(A x) p_{2α + β}(B x^2) = p_α(A x) p_{α + β}(x) p_{2α + β}((A C - B) x^2),

which gives

A = 1,    C = 2 B.

3.3.5.

Write now

w_α p_β(y) w_α^{-1} = p_{2α + β}(y).

Since is not a root, this gives

p_α(1) p_β(y) p_α(-1) = p_{-α}(1) p_{2α + β}(y) p_{-α}(-1).

Using (1) in the left member, (3) in the right, one obtains

p_β(y) p_{α + β}(-A y) p_{2α + β}(B y) = p_{2α + β}(y) p_{α + β}(A k y) p_β(B y).

Since , and commute, this gives at once

B = 1,    -A = A k,

whence finally

A = 1,    B = 1,    C = 2,    k = -1.

3.3.6.

We have therefore proved (ii) and (iii). Let us prove (i). Taking into account the equality (since ),8 one has successively:

w_α w_β w_α = w_α w_β w_α^{-1} t_α = w_{2α + β} t_α,
w_β w_α w_β w_α w_β = w_β w_{2α + β} w_β^{-1} · s_β(t_α) · t_β = w_{2α + β} t_α t_β,
w_α w_β w_α w_β w_α w_β w_α = w_α w_{2α + β} w_α^{-1} · s_α(t_α t_β) · t_α = w_β · t_α · t_β t_α · t_α
                            = w_β^{-1} t_α,

whence

and

(w_α w_β)^4 = s_β(t_α) = t_α,

which completes the proof.

Remark 3.3.7. Condition (v) of 2.3 translates here as follows, setting and :

(A)   int(h_α h_β h_α) v_β = v_β,        (B)   v_β v_α = v_α v_β v_{α + β} v_{2α + β},
      int(h_β h_α h_β) v_α = v_α,              v_{α + β} v_α = v_α v_{α + β} v_{2α + β}^2,
                                               v_{α + β} v_β = v_β v_{α + β},
                                               v_{2α + β} v_α = v_α v_{2α + β},
                                               v_{2α + β} v_β = v_β v_{2α + β},
                                               v_{2α + β} v_{α + β} = v_{α + β} v_{2α + β}.

3.4. Groups of type G_2

Proposition 3.4.1. Let be a scheme, a pinned -group of type G_2, and denote , .

(i) One has

t_{αβ} = (w_α w_β)^6 = e = (w_β w_α)^6 = t_{βα}.

(ii) If one sets

Ad(w_β) X_α = X_{α + β},    Ad(w_α) X_{α + β} = X_{2α + β},
Ad(w_α) X_β = -X_{3α + β},    Ad(w_β) X_{3α + β} = X_{3α + 2β},

one has:

Ad(w_α) X_{2α + β} = -X_{α + β},    Ad(w_α) X_{3α + β} = X_β,
Ad(w_α) X_{3α + 2β} = X_{3α + 2β},    Ad(w_β) X_{α + β} = -X_α,
Ad(w_β) X_{2α + β} = X_{2α + β},    Ad(w_β) X_{3α + 2β} = -X_{3α + β}.

(iii) If one sets

p_{α + β}(x) = exp(x X_{α + β}) = int(w_β) p_α(x),
p_{2α + β}(x) = exp(x X_{2α + β}) = int(w_α w_β) p_α(x),
p_{3α + β}(x) = exp(x X_{3α + β}) = int(w_α) p_β(-x),
p_{3α + 2β}(x) = exp(x X_{3α + 2β}) = int(w_β w_α) p_β(-x),

one has:

p_β(y) p_α(x) = p_α(x) p_β(y) p_{α + β}(x y) p_{2α + β}(x^2 y) p_{3α + β}(x^3 y) p_{3α + 2β}(x^3 y^2),
p_{α + β}(y) p_α(x) = p_α(x) p_{α + β}(y) p_{2α + β}(2 x y) p_{3α + β}(3 x^2 y) p_{3α + 2β}(3 x y^2),
p_{2α + β}(y) p_α(x) = p_α(x) p_{2α + β}(y) p_{3α + β}(3 x y),
p_{3α + β}(y) p_β(x) = p_β(x) p_{3α + β}(y) p_{3α + 2β}(-x y),
p_{2α + β}(y) p_{α + β}(x) = p_{α + β}(x) p_{2α + β}(y) p_{3α + 2β}(3 x y).

3.4.2.

The proof occupies Nos. 3.4.2 to 3.4.9. One has , , whence . Define , , and as in (ii). One has at once

Ad(w_β) X_{α + β} = α(t_β) X_α = -X_α,
Ad(w_α) X_{2α + β} = α(t_α) β(t_α) X_{α + β} = -X_{α + β},
Ad(w_α) X_{3α + β} = -β(t_α) X_β = X_β,
Ad(w_β) X_{3α + 2β} = α(t_β)^3 β(t_β) X_{3α + β} = -X_{3α + β}.

Finally, since and are not roots,

Ad(w_α) X_{3α + 2β} = X_{3α + 2β},    Ad(w_β) X_{2α + β} = X_{2α + β},

which completes the proof of (ii).

3.4.3.

By virtue of Exp. XXII, 5.5.2, there exist scalars9

A, B, C, D, E, F, G, H, J ∈ G_a(S),

such that

p_β(y) p_α(x) = p_α(x) p_β(y) p_{α + β}(A x y) p_{2α + β}(B x^2 y) p_{3α + β}(C x^3 y) p_{3α + 2β}(D x^3 y^2),   (1)
p_{α + β}(y) p_α(x) = p_α(x) p_{α + β}(y) p_{2α + β}(E x y) p_{3α + β}(F x^2 y) p_{3α + 2β}(G x y^2),           (2)
p_{2α + β}(y) p_α(x) = p_α(x) p_{2α + β}(y) p_{3α + β}(H x y),                                                  (3)
p_{3α + β}(y) p_β(x) = p_β(x) p_{3α + β}(y) p_{3α + 2β}(J x y).                                                 (4)

3.4.4.

Make act on (1), (3) and (4):

p_{-β}(-y) p_{α + β}(x) =
    p_{α + β}(x) p_{-β}(-y) p_α(-A x y) p_{2α + β}(B x^2 y) p_{3α + 2β}(C x^3 y) p_{3α + β}(-D x^3 y^2),       (5)
p_{2α + β}(y) p_{α + β}(x) = p_{α + β}(x) p_{2α + β}(y) p_{3α + 2β}(H x y),                                    (6)
p_{3α + 2β}(y) p_{-β}(-x) = p_{-β}(-x) p_{3α + 2β}(y) p_{3α + β}(-J x y).                                       (7)

Making act on (1), one finds

p_{3α + β}(-y) p_{-α}(-x) =
    p_{-α}(-x) p_{3α + β}(-y) p_{2α + β}(A x y) p_{α + β}(-B x^2 y) p_β(C x^3 y) p_{3α + β}(D x^3 y^2).        (8)

3.4.5.

Write

w_β p_α(x) w_β^{-1} = p_{α + β}(x),

that is, not being a root,

p_β(1) p_α(x) p_α(-1) = p_{-β}(1) p_{α + β}(x) p_{-β}(-1).            (9)

Transforming the left member of (9) by (1), then (4), one obtains:

p_β(1) p_α(x) p_β(-1)
   = p_α(x) p_β(1) p_{α + β}(A x) p_{2α + β}(B x^2) p_{3α + β}(C x^3) p_{3α + 2β}(D x^3) p_β(-1)
   = p_α(x) p_β(1) p_{α + β}(A x) p_{2α + β}(B x^2) p_β(-1) p_{3α + β}(C x^3) p_{3α + 2β}((D - C J) x^3)
   = p_α(x) p_{α + β}(A x) p_{2α + β}(B x^2) p_{3α + β}(C x^3) p_{3α + 2β}((D - C J) x^3).            (10)

Transforming the right member of (9) by (5), then (7):

p_{-β}(1) p_{α + β}(x) p_{-β}(-1)
   = p_{α + β}(x) p_{-β}(1) p_α(A x) p_{2α + β}(-B x^2) p_{3α + 2β}(-C x^3) p_{3α + β}(-D x^3) p_{-β}(-1)
   = p_{α + β}(x) p_α(A x) p_{2α + β}(-B x^2) p_{3α + 2β}(-C x^3) p_{3α + β}((C J - D) x^3).            (11)

Using now (2), this right member becomes

p_α(A x) p_{α + β}(x) p_{2α + β}(A E x^2) p_{3α + β}(A^2 F x^3) p_{3α + 2β}(A G x^3) ×
    p_{2α + β}(-B x^2) p_{3α + 2β}(-C x^3) p_{3α + β}((C J - D) x^3)
= p_α(A x) p_{α + β}(x) p_{2α + β}((A E - B) x^2) p_{3α + β}((A^2 F + C J - D) x^3) p_{3α + 2β}((A G - C) x^3). (12)

So (9) rewrites:

p_α(x) p_{α + β}(A x) p_{2α + β}(B x^2) p_{3α + β}(C x^3) p_{3α + 2β}((D - C J) x^3) =
   p_α(A x) p_{α + β}(x) p_{2α + β}((A E - B) x^2) p_{3α + β}((A^2 F + C J - D) x^3) p_{3α + 2β}((A G - C) x^3),

which gives

A = 1,    E = 2 B,    C + D = F + C J,    F = G.

3.4.6.

Write now

w_α p_β(y) w_α^{-1} = p_{3α + β}(-y),

that is, not being a root,

p_α(1) p_β(y) p_α(-1) = p_{-α}(1) p_{3α + β}(-y) p_{-α}(-1).            (13)

Transform the left member by (1):

p_α(1) p_β(y) p_α(-1) = p_β(y) p_{α + β}(-A y) p_{2α + β}(B y) p_{3α + β}(-C y) p_{3α + 2β}(-D y^2).

Transform the right member of (13) successively by (8), (6) and (4):

p_{-α}(1) p_{3α + β}(-y) p_{-α}(-1)
   = p_{3α + β}(-y) p_{2α + β}(A y) p_{α + β}(-B y) p_β(C y) p_{3α + 2β}(D y^2)
   = p_{3α + β}(-y) p_{α + β}(-B y) p_{2α + β}(A y) p_{3α + 2β}(-A B H y^2) p_β(C y) p_{3α + 2β}(D y^2)
   = p_β(C y) p_{3α + β}(-y) p_{α + β}(-B y) p_{2α + β}(A y) p_{3α + 2β}((D - C J - A B H) y^2)
   = p_β(C y) p_{α + β}(-B y) p_{2α + β}(A y) p_{3α + β}(-y) p_{3α + 2β}((D - C J - A B H) y^2).

So (13) rewrites:

p_β(C y) p_{α + β}(-B y) p_{2α + β}(A y) p_{3α + β}(-y) p_{3α + 2β}((D - C J - A B H) y^2) =
   p_β(y) p_{α + β}(-A y) p_{2α + β}(B y) p_{3α + β}(-C y) p_{3α + 2β}(-D y^2),

whence

C = 1,    A = B,    D - C J - A B H = -D.

Taking into account the results already obtained:

A = B = C = 1,    E = 2,    F = G,    D + 1 = F + J,    2 D = H + J.

3.4.7.

Write

w_β p_{3α + β}(x) w_β^{-1} = p_{3α + 2β}(x),

that is,

p_β(1) p_{3α + β}(x) p_β(-1) = p_{-β}(1) p_{3α + 2β}(x) p_{-β}(-1).

Transforming the left member by (4), the right by (7), one obtains:

p_{3α + β}(x) p_{3α + 2β}(-J x) = p_{3α + 2β}(x) p_{3α + β}(-J x),

so .

3.4.8.

Write finally

w_α p_{α + β}(y) w_α^{-1} = p_{2α + β}(y),

that is,

p_α(1) p_{α + β}(y) p_α(-1) = p_{-α}(1) p_α(-1) p_{2α + β}(y) p_α(1) p_{-α}(-1).

Transforming the left member by (2), the right by (3), one obtains:

p_{α + β}(y) p_{2α + β}(-E y) p_{3α + β}(F y) p_{3α + 2β}(-G y^2) =
    p_{-α}(1) p_{2α + β}(y) p_{3α + β}(H y) p_{-α}(-1).

It is immediate to see that, if one makes commute with , then , one does not introduce in the right member any new terms in . The latter therefore writes, denoting by empty parentheses quantities whose exact value does not matter to us:

p_{α + β}( ) p_{2α + β}( ) p_β( ) p_{3α + β}(H y) p_{3α + 2β}( ).

Comparing with the left member, one has at once , whence by the previous results , so , and finally , which completes the determination of the coefficients and the proof of (iii).

3.4.9.

Let us prove (i) finally, in the usual manner. One has successively:

w_α w_β w_α = w_α w_β w_α^{-1} t_α = w_{3α + β}^{-1} · t_α,
w_β (w_α w_β)^2 = w_β w_{3α + β}^{-1} w_β^{-1} · s_β(t_α) · t_β = w_{3α + 2β}^{-1} · t_α t_β · t_β = w_{3α + 2β}^{-1} · t_α,
w_α (w_β w_α)^3 = w_α w_{3α + 2β}^{-1} w_α^{-1} = w_{3α + 2β}^{-1},
w_β (w_α w_β)^4 = w_β w_{3α + 2β}^{-1} w_β^{-1} · t_β = w_{3α + β} · t_β,
w_α (w_β w_α)^5 = w_α w_{3α + β} w_α^{-1} · s_α(t_β) · t_β = w_β · t_β t_α · t_α = w_β^{-1}.

Whence

(w_α w_β)^6 = (w_β w_α)^6 = e.

Remark 3.4.10. Condition (v) of 2.4 is composed of

(A)   int(h_α h_β h_α h_β h_α) v_β = v_β,
      int(h_β h_α h_β h_α h_β) v_α = v_α,

and, setting

v_{α + β} = int(h_β) v_α,    v_{2α + β} = int(h_α h_β) v_α,
v_{3α + β} = int(h_α) v_β^{-1},    v_{3α + 2β} = int(h_β h_α) v_β^{-1},

the commutation relations:

(B)   v_β v_α = v_α v_β v_{α + β} v_{2α + β} v_{3α + β} v_{3α + 2β},
      v_{α + β} v_α = v_α v_{α + β} v_{2α + β}^2 v_{3α + β}^3 v_{3α + 2β}^3,
      v_{2α + β} v_α = v_α v_{2α + β} v_{3α + β}^3,
      v_{3α + β} v_α = v_α v_{3α + β},
      v_{3α + 2β} v_α = v_α v_{3α + 2β},
      v_{α + β} v_β = v_β v_{α + β},
      v_{2α + β} v_β = v_β v_{2α + β},
      v_{3α + β} v_β = v_β v_{3α + β} v_{3α + 2β}^{-1},
      v_{3α + 2β} v_β = v_β v_{3α + 2β},
      v_{2α + β} v_{α + β} = v_{α + β} v_{2α + β} v_{3α + 2β}^3,
      v_{3α + β} v_{α + β} = v_{α + β} v_{3α + β},
      v_{3α + 2β} v_{α + β} = v_{α + β} v_{3α + 2β},
      v_{3α + β} v_{2α + β} = v_{2α + β} v_{3α + β},
      v_{3α + 2β} v_{2α + β} = v_{2α + β} v_{3α + 2β},
      v_{3α + 2β} v_{3α + β} = v_{3α + β} v_{3α + 2β}.

3.5. Explicit form of the generators-and-relations theorem

Theorem 3.5.1. Let be a scheme, a pinned -group, its maximal torus, its system of simple roots, and the elements defined by the pinning (). Let

f_T : T → H,    f_α : U_α → H,    α ∈ Δ

be morphisms of groups, being an -sheaf in groups for (fppf); let , () be sections of , and set , . In order that there exist a morphism of groups

extending , and satisfying () (and then necessarily unique), it is necessary and sufficient that the following conditions be satisfied:

(i) For every , every , every and every ,

int(f_T(t)) f_α(x) = f_α(int(t) x) = f_α(x^{α(t)}).            (1)

(ii) For every , every and every ,

int(h_α) f_T(t) = f_T(s_α(t)) = f_T(t · α^* α(t)^{-1}).            (2)

(iii) For every ,10

(iv) For all , , such that (resp. , resp. , resp. ):

(a) the relation

(h_α h_β)^2 = f_T(α^*(-1) β^*(-1))     if (α^*, β) = 0;
(h_α h_β)^3 = e,                       if (α^*, β) = -1;        (3₂)
(h_α h_β)^4 = f_T(α^*(-1)),            if (α^*, β) = -2;
(h_α h_β)^6 = e,                       if (α^*, β) = -3.

(b) The relations (A) and (B) of 3.1.3 (resp. 3.2.8, resp. 3.3.7, resp. 3.4.10).

This follows at once from 2.3, 2.6 and the calculations done in each particular case.

Remark 3.5.2. One may present the preceding results in a slightly different way: one gives oneself morphisms, for ,

a_α : T · U_α → H,    b_α : Norm_{Z_α}(T) → H,

and one sets

h_α = b_α(w_α),    v_α = a_α(u_α);

then the conditions to be verified are the following:

(1) all the and all the have the same restriction to ;

(2) conditions (4) and (iv) of 3.5.1 above are satisfied.

3.5.3.

Various applications of this theorem will be given in the following Exposé. Let us mention one here: Theorem 3.5.1 gives a description by generators and relations of in the category of -sheaves for (fppf); in other words, consider for each the group generated by , , , and , , subjected to relations analogous to (1), (2), (3₁), (4), (3₂), (A), (B); then is none other than the sheaf associated with the presheaf .

In particular, if is the spectrum of an algebraically closed field , one has (an immediate consequence of the Nullstellensatz in the form: "a sieve over an algebraically closed field, covering for (fppf), is trivial"), so that 3.5.1 yields at once an explicit description by generators and relations of the "abstract" group .11

4. Uniqueness of pinned groups: fundamental theorem

Theorem 4.1. Let be a nonempty scheme. The functor of 1.6 is fully faithful: let and be two pinned -groups, 12 an integer > 0 such that is an endomorphism of , and a -morphism of pinned root data. There exists a unique morphism of pinned groups

such that .

The uniqueness is proved in 1.9. It suffices to prove existence. By hypothesis, one has a bijection and a map such that

h(d(α)) = q(α) α    and    ^t h(α^*) = q(α) d(α)^*

for every . In particular, the semisimple ranks of and coincide.

4.1.1.

Suppose . Then and are tori: one has , and is simply a morphism of ordinary groups . One then takes .

4.1.2.

Suppose . Consider then

f_T = D_S(h) : T → T'.

By hypothesis, one has a commutative diagram, where :

G_{m, S} ──α^*──→ T ──α──→ G_{m, S}
   │              │            │
 q(α)            f_T          q(α)
   │              │            │
   ↓              ↓            ↓
G_{m, S} ──α'^*──→ T' ──α'──→ G_{m, S}.

One then applies Exp. XX, 4.1.

4.1.3.

Suppose . Then, by Exp. XXI, 7.5.3, one knows all the possibilities for . Let us examine them successively, verifying each time the conditions of 2.5.

Denote , in such a way that , .

4.1.4. and of type

One has

h(α') = q α,    h(β') = q_1 β.

Let us show that the conditions of 2.5 are satisfied: (ii) and (iii) follow from 3.1.2 (ii) and (iii); let us prove (i).

One has13

D_S(h) t_{αβ} = D_S(h)(t_α t_β) = ^t h(α^*)(-1) · ^t h(β^*)(-1) = α'^*((-1)^q) · β'^*((-1)^{q_1}).

Now, the hypothesis that is an endomorphism of (and ) entails that or that is of characteristic ; in all cases (if is even, and 1 = -1). Consequently,

D_S(h) t_{αβ} = α'^*(-1) · β'^*(-1) = t'_{α' β'}.

This shows that condition 2.5 (i) is satisfied.

4.1.5. and of type A_2

One has

h(α') = q α,    h(β') = q β.

Set and . Let us verify the conditions of 2.5. For (i), one reasons as above, using 3.2.1 (i); for (ii), it is immediate by 3.2.1 (ii); it remains to verify (iii). We must check that

p_α(x) p_β(y) p_{α + β}(z) ↦ p'_{α'}(x^q) p'_{β'}(y^q) p'_{α' + β'}(z^q)

is a morphism of groups. The only nontrivial commutation relation is that of 3.2.1 (iii), which is written

p_β(y) p_α(x) = p_α(x) p_β(y) p_{α + β}(x y),
p'_{β'}(y^q) p'_{α'}(x^q) = p'_{α'}(x^q) p'_{β'}(y^q) p'_{α' + β'}(x^q y^q).

4.1.6.

One reasons similarly for and of type B_2 (resp. G_2), when the radicial exponents are equal, using 3.3.1 (resp. 3.4.1); it remains, therefore, to treat — in order to complete the case of groups of rank 2 — the two exceptional cases of Exp. XXI, 7.5.3.

4.1.7. and of type B_2, of characteristic 2, ,

The positive roots are and (note that the "short" simple roots are and ). One has

h(α') = 2 q α,    h(β') = q β,    h(α' + β') = q(2α + β),    h(α' + 2β') = 2 q(α + β),

which gives

d(α + β) = α' + 2β',    q(α + β) = 2 q,
d(2α + β) = α' + β',    q(2α + β) = q.

Set

X_{α + β} = Ad(w_β) X_α,    X_{2α + β} = Ad(w_α) X_β,
X'_{α' + β'} = Ad(w'_{α'}) X'_{β'},    X'_{α' + 2β'} = Ad(w'_{β'}) X'_{α'}.

Let us now verify the conditions of 2.5.

(i) Since is of characteristic 2, one has -1 = 1 on , hence (cf. 3.3.1 (i)).

(ii) One has by construction

Ad(w_α) X_β = X_{2α + β},    Ad(w'_{α'}) X'_{β'} = X'_{α' + β'} = X'_{d(2α + β)};
Ad(w_β) X_α = X_{α + β},    Ad(w'_{β'}) X'_{α'} = X'_{α' + 2β'} = X'_{d(α + β)}.

By 3.3.1 (ii) and the fact that -1 = 1 on , one has on each side

Ad(w_α) X_{α + β} = X_{α + β},    Ad(w'_{α'}) X'_{d(α + β)} = Ad(w'_{α'}) X'_{α' + 2β'} = X'_{α' + 2β'} = X'_{d(α + β)};
Ad(w_α) X_{2α + β} = X_β,    Ad(w'_{α'}) X'_{d(2α + β)} = Ad(w'_{α'}) X'_{α' + β'} = X'_{β'} = X'_{d(β)};
Ad(w_β) X_{α + β} = X_α,    Ad(w'_{β'}) X'_{d(α + β)} = Ad(w'_{β'}) X'_{α' + 2β'} = X'_{α'} = X'_{d(α)};
Ad(w_β) X_{2α + β} = X_{2α + β},    Ad(w'_{β'}) X'_{d(2α + β)} = Ad(w'_{β'}) X'_{α' + β'} = X'_{α' + β'} = X'_{d(2α + β)}.

(iii) By 3.3.1 (iii), one sees that the only nontrivial commutation relation in (resp. ) is

p_β(y) p_α(x) = p_α(x) p_β(y) p_{α + β}(x y) p_{2α + β}(x^2 y),

resp.

p'_{α'}(y') p'_{β'}(x') = p'_{β'}(x') p'_{α'}(y') p'_{α' + β'}(x' y') p'_{α' + 2β'}(x' y'^2).

We must verify that the morphism

p_α(x) p_β(y) p_{α + β}(z) p_{2α + β}(t) ↦ p'_{α'}(x^{2q}) p'_{β'}(y^q) p'_{α' + 2β'}(z^{2q}) p'_{α' + β'}(t^q)

is a morphism of groups; one sees at once that this amounts to seeing that

p'_{β'}(y^q) p'_{α'}(x^{2q}) = p'_{α'}(x^{2q}) p'_{β'}(y^q) p'_{α' + 2β'}((x y)^{2q}) p'_{α' + β'}((x^2 y)^q),

which is none other than the second relation above (setting , ).

4.1.8. and of type G_2, of characteristic 3, ,

The positive roots are on the one hand, on the other (as in the preceding case, the short simple roots are and ). One has

h(α') = 3 q α,    h(β') = q β,    h(α' + β') = q(3α + β),
h(α' + 2β') = q(3α + 2β),    h(α' + 3β') = 3 q(α + β),
h(2α' + 3β') = 3 q(2α + β),

which gives

d(α + β) = α' + 3β',    q(α + β) = 3 q,
d(2α + β) = 2α' + 3β',    q(2α + β) = 3 q,
d(3α + β) = α' + β',    q(3α + β) = q,
d(3α + 2β) = α' + 2β',    q(3α + 2β) = q.

Set

X_{α + β} = Ad(w_β) X_α,    X_{2α + β} = Ad(w_α) X_{α + β},
X_{3α + β} = -Ad(w_α) X_β,    X_{3α + 2β} = Ad(w_β) X_{3α + β};
X'_{α' + β'} = -Ad(w'_{α'}) X'_{β'},    X'_{α' + 2β'} = Ad(w'_{β'}) X'_{α' + β'},
X'_{α' + 3β'} = Ad(w'_{β'}) X'_{α'},    X'_{2α' + 3β'} = Ad(w'_{α'}) X'_{α' + 3β'}.

Let us now verify the conditions of 2.5.

(i) and by 3.4.1 (i).

(ii) One has by construction

Ad(w_β) X_α = X_{α + β},    Ad(w'_{β'}) X'_{α'} = X'_{α' + 3β'} = X'_{d(α + β)};
Ad(w_α) X_β = -X_{3α + β},    Ad(w'_{α'}) X'_{β'} = -X'_{α' + β'} = -X'_{d(3α + β)};
Ad(w_β) X_{3α + β} = X_{3α + 2β},    Ad(w'_{β'}) X'_{d(3α + β)} = Ad(w'_{β'}) X'_{α' + β'} = X'_{α' + 2β'} = X'_{d(3α + 2β)};
Ad(w_α) X_{α + β} = X_{2α + β},    Ad(w'_{α'}) X'_{d(α + β)} = Ad(w'_{α'}) X'_{α' + 3β'} = X'_{2α' + 3β'} = X'_{d(2α + β)}.

By 3.4.1 (ii), one has on each side:

Ad(w_α) X_{2α + β} = -X_{α + β},    Ad(w'_{α'}) X'_{d(2α + β)} = Ad(w'_{α'}) X'_{2α' + 3β'} = -X'_{α' + 3β'} = -X'_{d(α + β)};
       …                                          …
Ad(w_β) X_{3α + 2β} = -X_{3α + β},    Ad(w'_{β'}) X'_{d(3α + 2β)} = Ad(w'_{β'}) X'_{α' + 2β'} = -X'_{α' + β'} = -X'_{d(3α + β)}.

(The dots replace four verifications of the same kind.)

(iii) The only nontrivial commutation relations in and are, by 3.4.1 (iii) (and taking into account 3 = 0 on ):

p_β(y) p_α(x) = p_α(x) p_β(y) p_{α + β}(x y) p_{2α + β}(x^2 y) p_{3α + β}(x^3 y) p_{3α + 2β}(x^3 y^2),
p_{α + β}(y) p_α(x) = p_α(x) p_{α + β}(y) p_{2α + β}(-x y),
p_{3α + β}(y) p_β(x) = p_β(x) p_{3α + β}(y) p_{3α + 2β}(-x y);

p'_{α'}(y') p'_{β'}(x') =
    p'_{β'}(x') p'_{α'}(y') p'_{α' + β'}(-x' y') p'_{α' + 2β'}(-x'^2 y') p'_{α' + 3β'}(-x'^3 y') p'_{2α' + 3β'}(-x'^3 y'^2),
p'_{α' + β'}(y') p'_{β'}(x') = p'_{β'}(x') p'_{α' + β'}(y') p'_{α' + 2β'}(x' y'),
p'_{α' + 3β'}(y') p'_{α'}(x') = p'_{α'}(x') p'_{α' + 3β'}(y') p'_{2α' + 3β'}(x' y').

We must verify that the morphism defined by

φ(p_α(x) p_β(y) p_{α + β}(t) p_{2α + β}(u) p_{3α + β}(v) p_{3α + 2β}(w))
  = p'_{α'}(x^{3q}) p'_{β'}(y^q) p'_{α' + 3β'}(t^{3q}) p'_{2α' + 3β'}(u^{3q}) p'_{α' + β'}(v^q) p'_{α' + 2β'}(w^q)

is a morphism of groups. Now one verifies immediately that the three last commutation relations are also written

p'_{β'}(y^q) p'_{α'}(x^{3q}) =
    p'_{α'}(x^{3q}) p'_{β'}(y^q) p'_{α' + 3β'}((x y)^{3q}) p'_{2α' + 3β'}((x^2 y)^{3q}) p'_{α' + β'}((x^3 y)^q) p'_{α' + 2β'}((x^3 y^2)^q),
p'_{α' + 3β'}(y^{3q}) p'_{α'}(x^{3q}) = p'_{α'}(x^{3q}) p'_{α' + 3β'}(y^{3q}) p'_{2α' + 3β'}(-(x y)^{3q}),
p'_{α' + β'}(y^q) p'_{β'}(x^q) = p'_{β'}(x^q) p'_{α' + β'}(y^q) p'_{α' + 2β'}(-(x y)^q);

which shows that is indeed a morphism of groups and completes the proof of 4.1.7.

4.1.9. Case where and are of semisimple rank > 2

For each root , denote . For each , consider the pinned groups of semisimple rank , and . The morphism of groups underlying defines a -morphism of root data

h_{αβ} : R(Z_{αβ}) → R(Z'_{α' β'}).

By virtue of the preceding results, there exists therefore a morphism of pinned groups

f_{αβ} : Z_{αβ} → Z'_{α' β'}

such that . Let us prove that the satisfy the gluing condition of 2.5; indeed and are two morphisms of pinned groups

corresponding to the same morphism of pinned root data, and therefore coincide by the uniqueness result already proved. By 2.5 there exists therefore a morphism of groups

extending the . This is evidently a morphism of pinned groups such that , which completes the proof of Theorem 4.1.

5. Corollaries of the fundamental theorem

The most important is:

Corollary 5.1. Let be a nonempty scheme, and two pinned -groups, an isomorphism of pinned root data

There exists a unique isomorphism of pinned -groups

such that .

Note that 5.1 also follows from 3.5.1 (the relations of 3.5.1 may be written using only the datum of ); note also that 5.1 follows from the most elementary part of the proof of 4.1 (one does not need to consider the "exceptional isogenies" of 4.1.7 and 4.1.8).

Corollary 5.2 ("Uniqueness theorem"). Let be a scheme, and two splittable -groups (Exp. XXII, 1.13). If and are of the same type (Exp. XXII, 2.6), they are isomorphic.

Corollary 5.3. Let be a scheme, and two splittable -groups. The following conditions are equivalent:

(i) and are isomorphic.

(ii) and are isomorphic locally for the (fpqc) topology.

(iii) There exists an such that the -groups and are of the same type.

Indeed, one evidently has (i) ⇒ (ii) ⇒ (iii). On the other hand, (iii) entails that , hence that and satisfy the condition of 5.2.

Corollary 5.4 ("Uniqueness of the Chevalley schemes"). Let and be two reductive groups over possessing split maximal tori.14 The following conditions are equivalent:

(i) and are isomorphic.

(ii) There exists such that and are of the same type.

(iii) and are of the same type.

Indeed, and are splittable by Exp. XXII, 2.2.

Corollary 5.5 ("Existence of outer automorphisms"). Let be a scheme, a pinned -group, an automorphism of the pinned root datum . There exists a unique automorphism of respecting its pinning and such that .

Let us make the preceding corollary explicit.

Corollary 5.5.bis. Let be a scheme, a split reductive -group, a system of positive roots of .

Choose for each simple root an isomorphism of vector groups . Let be an automorphism of permuting the positive roots and the corresponding coroots: if , and . There exists a unique automorphism of inducing on and such that for every simple root .

Corollary 5.6. Let and be two reductive -groups. The following conditions are equivalent:

(i) and are isomorphic locally for the (fpqc) topology.

(i bis) and are isomorphic locally for the étale topology.

(ii) For every , and are isomorphic.

(iii) The functions type of and type of are equal.

Indeed (i bis) ⇒ (i) trivially, (i) ⇒ (ii) by the principle of finite extension (EGA IV₃, 9.1.4), (ii) ⇒ (iii) trivially; it remains to prove (iii) ⇒ (i bis). Now one may suppose and splittable (Exp. XXII, 2.3), in which case the assertion follows from 5.3.

Corollary 5.7. Let be a scheme, a reductive -group, an -group that is affine, smooth, and with connected fibers. Let be such that and are isomorphic; there exists then an étale covering such that and are isomorphic.

Indeed, by Exp. XIX 2.5 and Exp. XXII 2.1, one may suppose and reductive splittable and one is reduced to 5.3.

In the case where is the spectrum of a field, one deduces from 5.6 and 5.7:

Corollary 5.8. Let be a field and and two reductive -groups. The following conditions are equivalent:15

(i) and are of the same type.

(ii) and are isomorphic.

(iii) There exists a finite separable extension of such that and are isomorphic.

Corollary 5.9. Let be a nonempty scheme and a root datum. The following conditions are equivalent:16

(i) There exists a pinned -group of type .

(ii) There exists an -group of type .

(iii) There exists locally for (fpqc) a reductive -group of type .

It is evidently a matter of proving (iii) ⇒ (i). To simplify the proof, suppose that there exist a faithfully flat quasi-compact morphism and a reductive -group of type . One may suppose splittable; fix a pinning of ; denote . The two pullbacks of (G', E') to are pinned groups , ; one has canonical isomorphisms , whence an isomorphism

p = p_2^{-1} ∘ p_1 : R(G''_1, E''_1) → R(G''_2, E''_2).

By the uniqueness theorem, there exists a unique isomorphism

f : (G''_1, E''_1) ⥲ (G''_2, E''_2)

such that . One has therefore on a gluing datum; this is a descent datum.

Indeed, one must verify a compatibility condition between the pullbacks of on S''', but it suffices to make this verification on the transforms of these arrows by the functor , since the latter is fully faithful. Now is indeed a descent datum, by construction, which shows that is one too. Since is affine, this descent datum is effective; since the pinning of is stable under the descent datum, one verifies easily that there exists a pinned -group which gives (G', E') by base extension and which is therefore of type .

N.B. Naturally, in the language of fibered categories, the preceding proof simplifies (and becomes intelligible).

Corollary 5.10. Let be a nonempty scheme. Let be a pinned root datum such that there exists a reductive -group of type . Then there exists a pinned -group of type , unique up to a unique isomorphism.

Definition 5.11. Under the preceding conditions, we shall denote by the unique pinned -group of type , by its canonical maximal torus, by its canonical Borel subgroup, etc.

If one has a morphism ( nonempty), one may identify with , etc. In particular, if exists (we shall see that this is always the case), one denotes it , and one has

Ép_S(R) = Ép(R) ×_{Spec(ℤ)} S.

One says that is the Chevalley group scheme of type .

5.12.

It therefore comes to the same thing to say that the -sheaf in groups is a reductive -group of type , or to say that it is locally isomorphic (for the étale or (fpqc) topology) to . Likewise, by virtue of the conjugation theorems, it comes to the same thing to say that is a reductive -group of type equipped with a maximal torus, or to say that it is locally isomorphic to ; likewise with Borel subgroups or Killing couples.

6. Chevalley systems

The explicit calculations of No. 3 have important numerical consequences. We first lay down the following definition.

Definition 6.1. Let be a scheme, a split -group. One calls Chevalley system of a family of elements

satisfying the following condition:

(SC) for every pair ,

Recall (Exp. XX, 3.1) that

w_α(X_α) = exp(X_α) exp(-X_α^{-1}) exp(X_α).

Note that (SC) entails in particular for , by virtue of the relation (Exp. XX, 3.7) .

Proposition 6.2. Every split group admits a Chevalley system. More precisely, let be a pinning (1.1) of the split group ; there exists then a Chevalley system of such that for .

Let us first show that it suffices to verify condition (SC) for ; for every , there exists a sequence such that , whence, applying condition (SC) for each of the ,

X_α = ± Ad(w_{α_1}(X_{α_1}) ⋯ w_{α_n}(X_{α_n})) X_{α_{n+1}}.

By 3.1.1 (iii),

w_{α_1}(X_{α_1}) ⋯ w_{α_n}(X_{α_n}) w_{α_{n+1}}(X_{α_{n+1}}) w_{α_n}(X_{α_n})^{-1} ⋯ w_{α_1}(X_{α_1})^{-1}
    = α^*(±1) w_α(X_α).

Now, it suffices to note that and that for every pair of roots , , which entails that if (SC) is satisfied for the pairs (), it is so for every pair , ().

Let us now construct a system in the following manner. For every , choose a sequence as above, and define by

X_α = Ad(w_{α_i}(X_{α_1}) ⋯ w_{α_n}(X_{α_n})) X'_{α_{n+1}}.

To verify (SC), it suffices to prove:

Lemma 6.3. Let be a pinned -group; let be a sequence of simple roots such that

Then

Ad(w_{α_1} ⋯ w_{α_n}) X_{α_{n+1}} = ± X_{α_0}.

Reasoning as in 2.3.4 with the help of Tits's lemma (Exp. XXI 5.6), one is reduced to verifying lemma 6.3 in the two following cases:

a) is of semisimple rank at most 2, or b) is a section of .

In case a), note that 6.3 is a consequence of 6.2 and that 6.2 has been verified in part (i) of 3.1.2 (resp. 3.2.1, resp. 3.3.1, resp. 3.4.1).

It therefore remains to prove 6.3 in case b), or, what amounts to the same thing, that if is a sequence of simple roots such that , then satisfies for every root . By virtue of the structure of the Weyl group (Exp. XXI, 5.1), the word in the free group generated by the , , is in the invariant subgroup generated by the , . One is therefore reduced to the case where is of the form

s_{α_1} ⋯ s_{α_i} (s_{α_{i+1}} s_{α_{i+2}})^{n_{α_{i+1} α_{i+2}}} s_{α_i} ⋯ s_{α_1}.

Then

t = s_{α_1} ⋯ s_{α_i}(t_{α_{i+1} α_{i+2}}),

and one is reduced to verifying that for every pair of simple roots and every root , , which is trivial, in view of the values of calculated in No. 3 (part (i) of 3.1.2, 3.2.1, 3.3.1, 3.4.1).

Proposition 6.4. Let be a split -group, a Chevalley system of . Let and be two non-proportional roots; suppose

long(α) ⩽ long(β),    i.e.    |(β^*, α)| ⩽ |(α^*, β)|.

Let and be the integers such that the set of roots of the form , , is

{β - (p - 1) α, …, β, …, β + q α}.

(cf. Exp. XXI, 2.3.5; by loc. cit., one has therefore ). Then the commutation relation between and is given by the following table (which exhausts the possible cases, since the length of the preceding root chain is ),

where, for each , one writes :

(p, q)    p_β(y) p_α(x) p_β(-y) p_α(-x)
(-, 0)     = e
(1, 1)     = p_{α + β}(± x y)
(1, 2)     = p_{α + β}(± x y) p_{2α + β}(± x^2 y)
(1, 3)     = p_{α + β}(± x y) p_{2α + β}(± x^2 y) p_{3α + β}(± x^3 y) p_{3α + 2β}(± x^3 y^2)
(2, 1)     = p_{α + β}(± 2 x y)
(2, 2)     = p_{α + β}(± 2 x y) p_{2α + β}(± 3 x^2 y) p_{α + 2β}(± 3 x y^2)
(3, 1)     = p_{α + β}(± 3 x y).

Proof. By virtue of Exp. XXI, 3.5.4, there exists a system of simple roots of satisfying: , and there exist and such that . Consider the pinning of . The commutation relation to be verified is a relation between elements of ; one is therefore reduced to the explicit calculations of No. 3, and one concludes at once by condition (SC).

Corollary 6.5 (Chevalley's rule). Let be a scheme, a Chevalley system of the split -group . If , then

[X_α, X_β] = ± p X_{α + β},

where is the smallest integer > 0 such that is not a root.

Indeed, since the assertion is symmetric in and , one may suppose , and one is reduced to 6.4.

Corollary 6.6. Let be a scheme such that and a split -group. If is a subset of such that

g_{R'} = t ⊕ ⨁_{α ∈ R'} g_α            (*)

is a Lie subalgebra of , then is a closed subset of (Exp. XXI, 3.1.4).

17 Indeed, let be a Chevalley system of , and let be such that . By 6.5 and 6.4,

[X_α, X_β] = ± p X_{α + β},    with p ∈ {1, 2, 3}

and since neither 2 nor 3 are zero on , this entails, by (*), that contains , hence .18

6.7.

It is possible to make explicit the exact value of the various of this section, thanks to the study of the group , and more precisely of the "extended Weyl group":

W^* = N(ℤ),    where N = Norm_{Ép_ℤ(R)}(T_ℤ(R))

(cf. 5.11), which is an extension of by an abelian group of type , which is "responsible for the signs".19 20

Remark 6.7.1.21 Note that, by point (i) of 3.1.2 and 3.n.1 (), the elements and of satisfy the "braid relations":

w_α w_β ⋯ = w_β w_α ⋯    (n_{αβ} factors in each term).

(See also [Ti66], [BLie], § IX.4, Ex. 12, and [Sp98], 9.3.2.)

Bibliography

22

[BLie] N. Bourbaki, Groupes et algèbres de Lie, Chap. IX, Masson, 1982.

[Ja87] J. C. Jantzen, Representations of algebraic groups, Academic Press, 1987; 2nd ed., Amer. Math. Soc., 2003.

[Sp98] T. A. Springer, Linear algebraic groups, 2nd ed., Birkhäuser, 1998.

[St62] R. Steinberg, Générateurs, relations et revêtements de groupes algébriques, Colloque sur la théorie des groupes algébriques (Bruxelles 1962), Univ. Louvain & Gauthier-Villars, 1962 (pp. 133–147 in R. Steinberg Collected Papers, Amer. Math. Soc., 1997).

[St67] R. Steinberg, Lectures on Chevalley groups, Yale University (1967).

[Ta83] M. Takeuchi, A hyperalgebraic proof of the isomorphism and isogeny theorems for reductive groups, J. Algebra 85 (1983), 179–196.

[Ti66] J. Tits, Normalisateurs de tores I. Groupes de Coxeter étendus, J. Algebra 4 (1969), 96–116.

1

N.D.E.: Version of 13/10/2024.

2

N.D.E.: It is implied by condition (v), i.e. the existence of a section .

3

N.D.E.: We have denoted by the bijection (instead of ), in order to avoid the notation .

4

N.D.E.: i.e., the Borel subgroup of corresponding to .

5

N.D.E.: We have replaced "fundamental symmetries" by "simple reflections".

6

N.D.E.: We have corrected to , (since appears in the product on the right).

7

N.D.E.: relative to .

8

In the source: "since ". The correct expression was used in the previous section; here Demazure exploits the resulting formula (using , which holds in B_2).

9

N.D.E.: We introduce here absolute constants . These constants will be determined in the pages that follow; their values are , , , , cf. 3.4.8.

10

N.D.E.: The relations (3₁) and (3₂) form the description of the normalizer of the torus, (3₁) being, like (4), in a group of rank 1, while (3₂) is in a group of rank 2.

11

N.D.E.: For an arbitrary field and simply connected, R. Steinberg gave a presentation of the group in [St62], Th. 3.2, see also [St67], § 6, Th. 8.

12

N.D.E.: To avoid a notational problem later on, we have replaced by , so that in what follows, (resp. ) is an arbitrary power of .

13

N.D.E.: We have spelled out what follows.

14

In fact, one may prove that every -torus is split.23

15

N.D.E.: Another proof of this corollary, not using the reduction to the case of groups of rank 2, was given by M. Takeuchi ([Ta83], Th. 4.6); see also [Ja87], II 1.14.

16

N.D.E.: This corollary is rendered superfluous by Exp. XXV, which shows the existence of a split group of type over , hence over any base . (In fact, after XXV 1.3 one finds a reference to the present corollary to ensure that the reductive -group obtained is split, but this already follows from XXII 2.2; cf. N.D.E. (3) of XXV.)

17

N.D.E.: We have added the following proof. Note that it suffices that 2 and 3 be nonzero on ; for example the result is valid for .

18

N.D.E.: On the other hand, let us point out that if 2 = 0 on and is of type , then the set of short roots (which is a root system of type ) is not closed in , but is a part of type (R) of , symmetric (cf. XXII 5.4.2 and 5.4.10), i.e. it corresponds to a subgroup of type (R) of with reductive fibers: this is in particular the case for the natural embedding (in characteristic 2) of into . Likewise, if 2 = 0 on and is of type F_4 (resp. if 3 = 0 on and is of type G_2), the set of short roots (which is a root system of type D_4 (resp. A_2)) is not closed in , but corresponds to a subgroup of type (R) of , with reductive fibers.

19

Cf. J. Tits, Sur les constantes de structure et le théorème d'existence des algèbres de Lie semi-simples, Publ. Math. I.H.É.S. 31 (1966), 21–58.

20

N.D.E.: see also [Ti66].

21

N.D.E.: We have added this remark.

22

N.D.E.: additional references cited in this Exposé.

23

N.D.E.: this follows from the fact that every -torus is isotrivial (Exp. X, 5.16) and from the fact that every étale covering of is trivial.