Weyl groups, affine Weyl groups and
reflection groups
Raphaél Rouquier
UMR 9994 du CNRS, Université Paris 7-Denis Diderot, Case 7012, 2 Place
Jussieu, F-75251 Paris Cedex 05, France
1 Introduction
This paper is a survey of some of the basic results pertaining to reflection
groups.
In §2, we start with the basic concepts and properties of Coxeter groups,
such as the Exchange Lemma and in §4 we construct the geometric represen-
tation. Sections 3 and 5 are devoted to finite real reflection groups and finite
Coxeter groups and §6 concerns Weyl groups, which are crystallographic re-
flection groups. Weyl groups give rise to affine Weyl groups, studied in §7.
The Iwahori-Hecke algebra of a Coxeter group is introduced in §8, after a
discussion on braid groups. Finite complex reflection groups are the subject
of §9, where we describe the infinite families. Finally, we explain in §10 how
the topology of the hyperplane complement allows us to define braid groups
and Iwahori-Hecke algebras for finite complex reflection groups.
This paper is expository : most proofs are to be found in [Bki] or [Hu] for
§2-8 and in [BrMaRo] for §9-10.
2 Coxeter groups
Let W be a group and S a set of (distinct) generators of W of order 2. For
s,s! € S, we denote by my, € {1,2,...} U {oo} the order of the product ss’,
Definition 2.1 The pair (W,S) is a Coxeter system if W has a presentation
by generators and relations given by the set of generators S and the relations :
s=1 forse S,
gs'ss'-+; = g'ss's++; for those 8,8" S such that m, is finite
my terms my, terms
2122 Rouquier
We then say also that W is a Coxeter group.
The relations ss'ss’-++ = s/ss's-++ are called braid relations.
The rank of the system is the cardinality of S.
The matrix of the Coxeter system (W, S) is (ma
{1,2,.--} U {oo}.
This is a symmetric matrix with diagonal entries 1 and off-diagonal entries
at least 2. A matrix with such properties is called a Cozeter matriz. We
will see (Theorem 4.1) that every Coxeter matrix is the matrix of a Coxeter
system (in a group given by generators and relations as in the definition, with
(m,,) an abstract Coxeter matrix, it isn’t obvious that ss’ will have order
mas).
The graph associated with (W,S) is the graph with set of vertices S and
edges {s, s"} when m,, > 3. Furthermore, the edge is then labelled by m,,y.
Some examples.
(i) The symmetric group G, = G({1,2,... ,n}). Let 9; = (i,¢+ 1) and
Seq = {1,---,Sn-1}- Then, (G,,S6,) is a Coxeter system (of type
A,_1) with graph
OO ——O (the label is omitted when it is 3).
2 83 Sno? Sn=1
It has rank n—1.
(ii) The hyperoctahedral group By, i.e., the group of nxn monomial matri-
ces with non-zero entries in {+1}. It contains 6,, viewed as the group
of permutation matrices, as a subgroup. Let so = diag(—1,1,...,1) and
Sp, = {80,81,-++ ySn-a}; With 5;, i> 1 as in (i). Then, (Ba, Sp,) is a
Coxeter system of rank n with graph
Omni (where o=0 stands for 0-40),
So 1 $2 $3 Sn-2 Sn-1
i) The dihedral group I(m) : this is the symmetry group of a regular
m-gon (i.e., the subgroup of the group of isometries of the plane fixing
the m-gon), m > 2.
Hp oWeyl groups and reflection groups 23
Let H, be a line containing the center of the polygon and one of its
vertices. Let Hy be a line containing the center of the polygon and
such that the angle between Hy and Hz is 7/m. I;(m) is generated
by the orthogonal reflections ¢, and tz with respect to H, and Hy.
(La(m), {t1,t2}) is a Coxeter system with graph
o@o(m>3) or 0 o(m=2).
t, te tot,
The group I;(m) has a decomposition I(m) = (titz) » (£1). The sub-
group (tit2) is the subgroup of rotations, it has order m. The action of
(ti) = {41} on Z/mZ in this decomposition is given by multiplication.
This suggests a construction for m = oo : we denote by A, the group
Z » {£1}, where {+1} acts by multiplication on Z. Let t, = (0,—1)
and t = (-1,—1). Then, (Aj,{t1,t2}) is a Coxeter system with graph
oko
ns
The dihedral groups are the groups I,(m), 2 < m < oo and Ay,
Note that every rank 2 Coxeter system is isomorphic to the Coxeter system
of a dihedral group. In particular, the Coxeter systems for G3 and [9(3) are
isomorphic, as well as these for Bz and I,(4).
‘The following theorem [Bki, Chap. IV, §1, Théoréme 2] is an easy conse-
quence of Theorem 4.1 below :
Theorem 2.2 Let (W,S) be a Cozeter system, 5’ a subset of S and W’ the
subgroup of W generated by S'. Then, (W',S!) is a Cozeter system with
Coxeter matriz the submatrix of the Cozeter matrix of (W,S) given by S'.
A Coxeter system is irreducible if its associated graph is connected. All
systems in the previous examples are irreducible, except I2(2).
If $ is the disjoint union of two subsets S; and $; and no vertex of S; is
connected to a vertex of S2, then W = W, x Ws, where W; is the subgroup
of W generated by Si.
Remark 1 Note that for m odd, I,(2m) ~ Ip(m) x Ga, but (Ia(2m), {s,5"})
is nevertheless irreducible form > 1 !
Let w € W. The length of w, I(w), is the smallest integer m such that w
is the product of m elements of S.
A decomposition w = 81 +++ 8m with $1... 58m € Sis reduced if m = I(w).24 Rouquier
Theorem 2.3 Let w= 81 +-+ 8, with s1,...,8m €S. Then, there is a subset
1 = {i < in < +++ < ig} of {1,...,m)} with k = Iw) elements such that
was; :
This theorem is a direct consequence of the exchange lemma [Bki, Chap.
IV, §1, Proposition 4] :
Lemma 2.4 Let w = 51-++5m be a reduced decomposition (81,... 8m € S).
Let 8 € S. Then, one of the following assertion holds :
(i) (sw) = Ww) +1 and 851 --- 3m is a reduced decomposition of sw
(ii) (sw) = I(w) — 1 and there exists j € {1,... ,m} such that
$1°++8}-18}41° ++ 8m 18 a reduced decomposition of sw and
$81 °**8)-18j41 "+ Sm i8 a reduced decomposition of w.
This lemma actually characterizes the Coxeter systems amongst the pairs
(W,S), where S is a set of generators of order 2 of a group W [Bki, Chap.
IV, §1, Théoréme 1].
3 Real reflection groups
Let V be a finite dimensional real vector space. A reflection of V is an
automorphism of order 2 whose set of fixed points is a hyperplane. A finite
reflection group W in V is a finite subgroup of GL(V) generated by reflections.
The group W is crystallographic if there is 2 W-invariant Z-lattice of V,
i.e, if there exists a free Z-submodule L of V stable under W such that the
canonical map L @zR — V is an isomorphism.
Note that this amounts to the existence of a W-stable Q-structure on V,
i.e, a Q-subspace Va of V stable under W such that the canonical map
Vq @qR — V is an isomorphism [Bki, Chap. VI, §2, Proposition 9].
Let A be the set of reflecting hyperplanes of W — i.e., the set of ker(s—1),
where s is a reflection of W.
Then, V—Uye. H is in general non-connected : its connected components
are the chambers of W.
Theorem 8.1 ({Bki, Chap. V, §3, Théorémes 1 et 2]) The group W
acts simply transitively on the set of chambers ; the closure of a chamber is a
fundamental domain for the action of W on V.
Let C; be a chamber and $ the set of reflections with respect to the walls
of C; (a wall of C, is a hyperplane in A whose intersection with the closure
of C has codimension 1 in V).Weyl groups and reflection groups 25
Theorem 3.2 ([Bki, Chap. V, §3, Théoréme 1]) The pair (W,S) is a
Coxeter system.
Taking into account the choice of the chamber Ci, the chambers are now
parametrized by W. The chamber C, corresponding to w € W is w(C,).
A gallery of length n is a sequence Do... , Dn of adjacent chambers (i.e.,
the intersection of the closures of D; and Dis, has codimension 1 in V). The
following result can be deduced from [Bki, Chap. V, §3, Théoréme 1] :
Proposition 8.3 The minimal length of a gallery from Co to Cy is I(w).
Example: the chamber system for the group A.
Here, s; is the orthogonal reflection with respect to Hj. The group W gener-
ated by s, and s2 is a Coxeter group of type Ag.
4 Coxeter groups as reflection groups
Let S be a set and M = (msy)eses 2 Coxeter matrix. Let V = R® and
denote by {e,}ses its canonical basis.
Define a bilinear form By on V by
Bu (és, €s') = — cos .
(ente) = —con
(Note that Bus(es,¢s) = 1).
Let p, be the reflection in V given by
pat) = @ — 2Bu(ea,z)es.
One has V = Re, @ H,, where H, is the hyperplane orthogonal to ey.26 Rouquier
Let W be the group with set of generators 5 and relations
sal
$s'88 g'ss's-+, for those s,s’ € S such that m,,y # 00.
my terms myyr terms
Theorem 4.1 ([Bki, Chap. V, §4.3 et §4.4]) The map s ++ p, extends
to an injective group morphism W —+ GL(V), the reflection representation of
W. Furthermore, (W,S) is a Cozeter system.
When S is finite, By is positive definite if and only if W is finite.
Summarizing Theorems 3.2 and 4.1, we deduce
‘Theorem 4.2 The constructions of §3 and §4 give rise to inverse bijections
between the set of conjugacy classes of finite subgroups of GLn(R) generated
by reflections and the set of those rank n Coxeter matrices giving rise to a
finite Coxeter group.
5 Finite Coxeter groups
The classification of Coxeter graphs giving rise to irreducible finite Coxeter
groups is the following [Bki, Chap. VI, §4, Théoréme 1] (the number attached
to the name of the diagram is the number of nodes of the diagram) :
An
O00 0
Be
Da > oS
Es a
Ey ee
Es nnn
Ky o—o—=0—o
G.= (6) como
Hs —
Hs o5.—o—o
him) 9 Mo (m=5orm2>7)Weyl groups and reflection groups 27
In the list above, all the groups are crystallographic except Hs, Hy and
I,m), m = 5 or m > 7.
6 Root systems and Weyl groups
Let V be a finite dimensional real vector space, ® a finite subset of V and &Y
a finite subset of V* parametrized by ©: @ + OY, arr a’.
Assume
(1) the vector space V is generated by ©
(2) for all a € &, we have (a,a) = 2 and the reflection 2 : V + V,
r+ 2—(aY,z)a stabilizes B
(3) we have a¥() C Z for allac ®
(4) for « € &, we have 2a ¢ &.
Then, ® is a root system in V (sometimes called reduced, because of (4)).
Note that given , there is at most one set ®Y parametrized by ® with the
required properties.
If 6 = 4, U&, and 4; (together with SY = {a”}ace,) is a root system
in Vj, the subspace of V generated by ;, for i € {1,2}, then we say that
© is the direct sum of the root systems ©, and 2. The root system & is
irreducible if it is non-empty and it is not the direct sum of two non-empty
root systems.
The Weyl group of the root system & is the subgroup of GL(V) generated
by the reflections sq for a € &. Note that W is a crystallographic finite
reflection group with Z-lattice the Z-submodule of V generated by ®. A
converse actually holds [Bki, Ch. VI, §2, Proposition 9] :
Proposition 6.1 Let W be a crystallographic teflection group in a finite di-
mensional real vector space V. Then, there is a root system ® in V with Weyl
group W.
Note that if W is irreducible, then the root system ® is unique up to
isomorphism if and only if W is not of type B,, n > 3 (cf Remark 2).
Let C be a chamber of W with walls L,..., Zn. Then, there is a unique
root a; € ® orthogonal to L; and lying in the same half-space determined by
L,asC.
The set A = {ai}i ign is called a basis of &.
Let 6+ = {a € Bla = DY nia, n; > 0} (the positive roots) and 6 = {a €
Bla = YO niai, ni < 0} (the negative roots).28 Rouquier
Proposition 6.2 ({Bki, Chap. VI, §1, Théorémes 2 et 3]) The set A
is a basis of V and ® = 6+ UO.
The Cartan matriz is ((a, 8”) )asea-
Define S = {sa}aca. Then, (W,S) is a Coxeter system.
The rank 2 root systems
Type Ai x Ay Type Az
a2 a
—az a + a2
a1 a
a; —ap an
—a2 a
Type By = C2 Type Gz
3a; +202
a2 a, +az 2a, +a
a3 Darton Sartor
msai-as ~tna2 no
2a; —e1— a2 ~ap
301-202
The action of W on © gives another interpretation of the length function
[Bki, Chap. VI, §1, Corollaire 2 de la Proposition 17] :
Proposition 6.3 Let w € W. The cardinality of &- 1 w(#*) is the length
Iw).
The set © defines a root system in V* (the root system inverse or dual to
4). There is an isomorphism of groups
W(e) + Wo"),
uty
sending sq on s,v. Through this isomorphism, W(4) operates on V*.Weyl groups and reflection groups 29
Remark 2 Note that the root systems (V,®) and (V*, ®*) are not isomorphic
in general : for example, the root system of type C', is the inverse of the root
system of type B, ; when n > 3, these root systems are not isomorphic.
7 Affine Wey! groups
Let & be a root system in a finite dimensional real vector space V. We
construct a subgroup of the group Aff(V*) of affine transformations of V* as
follows :
For a € ® and k € Z, let Ha. be the affine hyperplane of V* defined by
Hap = {2 € V"|(a,2) =k}.
Let sa, be the orthogonal reflection with respect to Ha,t :
Sak() = x —((a,2) — k)a’.
‘The affine Weyl group associated to is the subgroup W of Aff(V*) generated
by the sax,a€%, k EZ.
Let @ be the subgroup of Aff(V*) generated by the translations by elements
of OY,
Proposition 7.1 ({Bki, Chap. VI, §2, Proposition 1]) We have W =
Qxw.
An alcove is a connected component of V*—Uneoser Hank (note that the
set {Hop}aco,sez is the set of reflecting hyperplanes of W).
Theorem 7.2 ([Bki, Chap. VI, §2.1]) The group W acts simply transi-
tively on the set of alcoves. The closure of an alcove is a fundamental domain
for the action of W on V*.
Let C be a chamber for W. Then, there is a unique alcove A C C such
that 0 is in the closure of A.
Let 5 be the set of reflections with respect to the walls of A. The pair
(W, 8) is Coxeter group.
If @ is irreducible, there is a root & = Donia; in © such that if 8 € %,
B= DC myaj, then m; < nj: & is the highest root. This root is orthogonal to
the wall of A which doesn’t contain 0 [Bki, Chap. VI, §1, Proposition 25].
‘The length of an element w € W (relatively to $) is the minimal length of
a gallery of alcoves from A to w(A).Example : Type
WAY
AAV AVAVAN
aphs)
Ai o®o
4, an (n>2)
B, < (n>3)
oo (ne 2)
Senn eee
Cn OO —0-
D, > < (24)
Ee
LLADAL”
The classification of the irreducible affine Weyl groups (or of their Coxeter
graphs) is the following [Bki, Chap. VI, §4, Théoréme 4] :Weyl groups and reflection groups 31
Es seen acorn
f, tee roars “cose anaenaees cee
OG on —o
8 Braid groups and Iwahori-Hecke algebras
Let (W,S) be a Coxeter system.
Definition 8.1 The braid monoid Bj, associated with (W,S) is the monoid
with set of generators {ot }.es and relations :
otofotot--.=ctotchot--. for s,s' €S such that m,y is finite.
See
1,4 ferme maar ferme
The braid group By associated with (W, S) is the group with set of generators
{o}ses and relations :
ou0,-++ for s,s! €S such that my, is finite.
im, qr terme, m, 4 terms
The following result is due to Deligne [De, Proposition 4.17] and Brieskorn-
Saito [BrSa, Proposition 5.5] :
Theorem 8.2 Assume W is finite. Then, the morphism Bf, + By given
by of +4 9, is injective.
Thanks to this result, we can identify Bi, with the submonoid of Bw
consisting of those elements which can be written as products of generators
o,, when W is finite.
Let p: By, + W be given by o, +4 5.
The exchange lemma (Lemma 2.4) has the following consequence [Bki,
Chapitre IV, §1, Proposition 5] :
Proposition 8.3 Let w = s1--- $m = 81-++ 8), be two reduced expressions of
weW. Then, of ---of, =
This allows the construction of a very nice section q of p (q is not multi-
plicative !) given w EW and w= 617+5n a reduced expression of w, we
put q(w) = of "Thanks to the last proposition, this is independent of
the choice of the hee expression of w. We have pq(w) = w.32 Rouquier
Let 5 be the set of equivalence classes for the relation defined by : s,t € S
are equivalent if there is a sequence t = to, t1,-.- ;tm = $ such that m(ti, tis)
is finite and odd. For s € S, we denote by 3 its class in 5.
One can then read off conjugacy amongst generators of W and By from
the Coxeter diagram. Two elements s,t € S are conjugate in W if and only
if § = 1%. Similarly, o, and ¢, are conjugate in By if and only if 5 = 7. So, we
have :
Proposition 8.4 The map o,++ 13 extends to a group morphism By — Z°.
Its kernel is the derived subgroup of By, ie., this morphism identifies the
largest abelian quotient Bg of By with ZS. Similarly, W* is isomorphic to
(Z/2Z)°.
Examples (using the notations from the examples of §2).
© 6: $= {a}.
© By: 5 = {55,1} (n > 2).
@ L(m): § = {i} for odd m, 5 = {f, 22} for even m.
Let {qs}zes and {9/}seg be two sets of indeterminates. Let O = Z[qs, dilses-
‘The Iwahori-Hecke algebra H = H(W) of (W,S) is the O-algebra with
generators T,, € S, and relations
(T. — qs)(Ts — G3) = 0 forse S
TiTyToTu ++, = TvTiToTs +: for 8,3" € 5 such that my, is finite.
aoe ao en
This is the quotient of the monoid algebra OB}, by the ideal generated
by the elements (T; — qz)(T; — 45) for s € S. Let Ty be the image of of for
wew.
The next theorem shows that H is a deformation of ZW [Bki, Chap. IV,
§2, Exercice 23] :
Theorem 8.5 The algebra Ht is free over O, with basis {Tu}wew. The mor-
phism H @5 O/(qs— 1,4, + I)ses + ZW, Tu @ 1+ w, is an isomorphism.
We assume from now on that W is finite.
Let S' be a subset of $ and W’ be the subgroup of W generated by 5’.
Then, by [De],
© the submonoid of By, generated by {o+},es" is isomorphic to By,,,Weyl groups and reflection groups 33
@ the subgroup of By generated by {o,}s¢s: is isomorphic to Bw,
© the specialization of the subalgebra of H(W) generated by {T.},es"
obtained by sending to 0 those parameters not associated to elements
5,8 € S', is isomorphic to the specialization of H1(W’) given by identify-
ing those parameters associated to elements of $’ which become equal
in 5.
In several applications, the Iwahori-Hecke algebra arises with invertible
parameters. Then, without loss of generality, one may assume one of the two
parameters qs, q5 to be —1. So, let O = Olay "Ises/(% + Uses ~ Zlas, 95 'lses
and H = H@5 0.
The Iwahori-Hecke algebra has a trace map 7 : H + O given by r(T) =
Siwy (ive, we have 7(hh’) = 7(h'h) for h, h! € H).
Denote by “ind” the one-dimensional representation H -+ © given by
ind(T,) = gs.
Proposition 8.6 Given w,w' € W, one has r(TuTw) = by-1,wind(Tu).
This means that the set {ind(7..)~!Ty-1}wew is the dual basis of {Ty }uew
with respect to 7.
More conceptually, the trace 7 gives a structure of symmetric algebra to
HL, i.e., the morphism :
H > Homo(H, 0)
hiv (hi! 7(hh'))
is an isomorphism.
Together with the fact that # is a deformation of ZW, this explains the
structure of # over an algebraic closure K of the field of fractions of © (Tits’
deformation theorem) [Bki, Chap. IV, §2, Exercice 27] :
Theorem 8.7 The algebra H @o K is semi-simple and isomorphic to KW.
Much more precise is the following rationality theorem (Benard, Springer,
Benson-Curtis, Hoefsmit, Lusztig... cf (Gel) :
Theorem 8.8 Assume W is a finite Weyl group. Then, the algebra QW
is isomorphic to a direct product of matriz algebras over Q and the algebra
H @0 QUVaa)ses #8 isomorphic to a direct product of matriz algebras over
WVa)ses-
The theorem above generalizes to finite Coxeter groups : if W is a finite
reflection group over K C R, then KW is isomorphic to a product of matrix
algebras over K and H @o K(/@)ses is isomorphic to a direct product of
matrix algebras over K(/@)se3-34 Rouquier
9 Pseudo-reflection groups
Let V be a finite dimensional vector space over a characteristic zero field K.
A pseudo-reflection of V is an automorphism of finite order whose set of fixed
points is a hyperplane.
Let G be a finite subgroup of GL(V).
We denote by S(V) the symmetric algebra of V.
The following theorem is due to Shephard-Todd and Chevalley. It shows
that the regularity of the ring of invariants S(V)° characterizes pseudo-
reflection groups [Bens, Theorem 7.2.1] :
Theorem 9.1 The following assertions are equivalent :
(i) The algebra S(V)S is a polynomial algebra.
(ii) The group G is generated by pseudo-reflections.
(iii) The $(V)°[G]-module $(V) is free of rank one.
When K Cc R, a pseudo-reflection is actually a reflection. When K = C,
a pseudo-reflection need not have order 2 ; a group generated by complex
pseudo-reflections is then called a complex reflection group.
The rationality theorem 8.8 for representations of Weyl groups or finite
Coxeter groups extends to pseudo-reflection groups : the group algebra of G
over K is a direct product of matrix algebras over K [Bena, Bes].
The irreducible complex reflection groups have been classified by Shephard
and Todd [ShTo]. There are two infinite series : the groups A, ~ G41, the
groups G(p,q,n) and 34 exceptional groups (the dimension of an exceptional
group is at most 8).
Let us describe the groups G(p,q,n) (p > 1, ¢ > 1, n > 1 and qlp).
It turns out that these groups have nice presentations, generalizing in some
sense the presentation of Coxeter groups and sharing some of their properties.
In particular, these groups have a presentation given by a set S consisting of
nor n+1 pseudo-reflections and two kinds of relations :
® braid relations (homogeneous relations)
© finite order relations.
The group given by the same presentation, but without the finite order re-
lations can be seen as an analog of the braid group defined in §8 for real
reflection groups. We will come back to this in §10.Weyl groups and reflection groups 35
9.1 G(p,1,n)
First, G(p, 1,2) is the group of n by n monomial complex matrices whose
non-zero entries are p-th roots of unity. This group has a semi-direct product
decomposition G(p,1,n) = (Z/pZ)" » G, ~ (Z/pZ) 1G, where G, is the
subgroup of permutation matrices and (Z/pZ)" is the subgroup of diagonal
matrices.
Let so = diag(¢,1,... ,1), where ¢ is a primitive p-th root of unity. Keep-
ing the notations of §2, Example (i), one sees that G(p,1,n) is generated
by the set of pseudo-reflections {s0, 51,--. , Sn-1}- They satisfy the following
relations :
$0818081 = $1 $9180
braid relations ¢ 3;3; iffi—g)>1
i418i6ier for i> 1
SiSi4 181
k=l
=
finite order relations {
fori> 1.
Actually, this gives a presentation for G(p,1,n) by generators and relations.
A convenient way to encode the relations is to use a generalization of the
Coxeter diagrams :
O=O-O—-O O—O
S$ Si 2 Sno? Sno1
Note that G(2,1,n) = B, and the presentation above is the Coxeter presen-
tation.
Now, for qlp, we define G(p,q,n) as the subgroup of G(p,1,n) consisting
of matrices where the product of the non-zero entries is a (p/q)-th root of
unity.
9.2 G(p,p,n)
Let us now look at G(p, p,nj. It is generated by the set of pseudo-reflections
{s1,51,-++ )$n—1} where si = s95159'. They satisfy the following relations :
$18; = 835: if |i-j|>1
$18; = 8:81 fori > 3
Si8i4 181 = S141 Si5i41 fori>1
braid relations ¢ s{s.s, = s281 52
$281 81828481 = 8481828} 8152
8181818) +++ = 345151810"
eieee lng cist tls
p terms P terms36 Rouquier
12
eee
finite order relations 4°! .
stl fori2.
This gives a presentation of G(p,p,n) by generators and relations. The
relations may be encoded in the following diagram :
P|
3 8 Sn-2 Snot
a
Note that G(p, p,2) = J,(p) and the presentation above is a Coxeter pre-
sentation. Also, G(2,2,n) = Dp and the presentation above is a Coxeter
presentation.
9.3 G(p,q,n)
Finally, let us consider G(p,q,n) for qlp, ¢ # p and q #1. We put d = p/q.
This group is generated by the set of pseudo-reflections {8}, 84, 81,--. 8-1}
where sj, = sf. They satisfy the following relations :
oa iffi—j|>1
as; = 86h fori >2
88; = 818} fori>3
SiSi418i = Si41SiSit1 fori > 1
braid relations 4 s‘.s2s = 328/82
898181 = 845155
$28}$1828}1 = $181$28} 5152
518581818151 +++ = 54815154515) +>
qt vere GH terme
ot =i
finite order relations 4 s,? = 1
sf =1fori2l.
We have obtained a presentation of G(p,q,n) by generators and relations
which we encode in the following diagram :
Sn-2 SaatWeyl groups and reflection groups 37
10 Topological construction of braid groups
and Iwahori-Hecke algebras
Let V be a finite dimensional complex vector space and G’ a finite subgroup
of GL(V) generated by pseudo-reflections. Let .A be the set of reflecting
hyperplanes of G and X = V—UneaH. Let p: X -» X/G be the projection
map.
The following result is due to Steinberg [St] :
Theorem 10.1 The group G acts freely on X, i.e., p is an unramified Galois
covering.
Let 0 € X. The braid group associated to G is Bg = 1\(X/G, p(o)) and
the pure braid group associated to G is Po = Ml,(X,z0). Then, thanks to
Steinberg’s theorem, we have an exact sequence :
03 Pe + Be 3G 1.
10.1 The real case
Assume G is the complexification of a real reflection group, i.e., there is a real
vector space V! with V = V'@c R and such that G is a subgroup of GL(V’).
Let C; be a chamber of G (a connected component of V’—Uye, HOV") and
take to € Cy. Let S be the set of reflections of G with respect to the walls of
C\. For s € S, let , be the path [0,1] + X defined by
walt) = 22 +a) = = gles) et,
Let 7, be the class in Bg of p(s).
Brieskorn [Br] and Deligne [De] have proved the following theorem :
Theorem 10.2 The map a, ++ 7, induces an isomorphism Bg -> Ba.
10.2 The complex case
Let H € A. Let ej be the order of the pointwise stabilizer of H in G. This is
a cyclic group, generated by a pseudo-reflection s with non-trivial eigenvalue
exp(2in/ey). Let ry € X. Let yy be the intersection of H with the affine
line containing x} and s(x). We assume zy is close enough to H so that
the closed ball with center yy and radius ||z1 — yu|| does not intersect any
H', HA, H' # H. Let a bea path from zo to 2 in X. Let \ be the path
in X from ty to s(xy) defined by
MO) = vir + (eH — yeni.38 Rouquier
We define the path + from zo to s(z0) by
a(3t) for 0
También podría gustarte
Isomorfismos
Aún no hay calificaciones
Isomorfismos
27 páginas
Untitled
Aún no hay calificaciones
Untitled
439 páginas
Ccolque TF
Aún no hay calificaciones
Ccolque TF
170 páginas