Warm Up 1. Name all sides and angles of ∆ FGH . 2. What is true about K and L ? Why?
Why G31 is K(pi,1)
-
Upload
david-bessis -
Category
Documents
-
view
240 -
download
1
description
Transcript of Why G31 is K(pi,1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Why G31 is K (π, 1)
David Bessis
Bochum, 22/2/2013
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Conjecture (Brieskorn and ???, early 1970s)
Let W ⊆ GL(V ) be a finite group generated by complexreflections. Let A be the reflection arrangement of W .Then V −⋃H∈AH is a K (π, 1) space.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Brieskorn stated the conjecture in 1971 for complexified realreflection groups.
Deligne solved this case in 1972.
It’s not clear who stated it first in the general complex case.
Candidates for ???: Arnold, Brieskorn, Orlik, Saito...
The conjecture is mentioned in Orlik-Terao’s book (1992).
As of 1992, all but 6 exceptional cases had been solved:Deligne (1972), Nakamura (1983), Orlik-Solomon (1988).
The six missing cases were G24, G27, G29, G31, G33 and G34.
Remark:
K (π, 1)⇔ connected and universal cover is contractible
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Brieskorn stated the conjecture in 1971 for complexified realreflection groups.
Deligne solved this case in 1972.
It’s not clear who stated it first in the general complex case.
Candidates for ???: Arnold, Brieskorn, Orlik, Saito...
The conjecture is mentioned in Orlik-Terao’s book (1992).
As of 1992, all but 6 exceptional cases had been solved:Deligne (1972), Nakamura (1983), Orlik-Solomon (1988).
The six missing cases were G24, G27, G29, G31, G33 and G34.
Remark:
K (π, 1)⇔ connected and universal cover is contractible
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Brieskorn stated the conjecture in 1971 for complexified realreflection groups.
Deligne solved this case in 1972.
It’s not clear who stated it first in the general complex case.
Candidates for ???: Arnold, Brieskorn, Orlik, Saito...
The conjecture is mentioned in Orlik-Terao’s book (1992).
As of 1992, all but 6 exceptional cases had been solved:Deligne (1972), Nakamura (1983), Orlik-Solomon (1988).
The six missing cases were G24, G27, G29, G31, G33 and G34.
Remark:
K (π, 1)⇔ connected and universal cover is contractible
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Brieskorn stated the conjecture in 1971 for complexified realreflection groups.
Deligne solved this case in 1972.
It’s not clear who stated it first in the general complex case.
Candidates for ???: Arnold, Brieskorn, Orlik, Saito...
The conjecture is mentioned in Orlik-Terao’s book (1992).
As of 1992, all but 6 exceptional cases had been solved:Deligne (1972), Nakamura (1983), Orlik-Solomon (1988).
The six missing cases were G24, G27, G29, G31, G33 and G34.
Remark:
K (π, 1)⇔ connected and universal cover is contractible
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Brieskorn stated the conjecture in 1971 for complexified realreflection groups.
Deligne solved this case in 1972.
It’s not clear who stated it first in the general complex case.
Candidates for ???: Arnold, Brieskorn, Orlik, Saito...
The conjecture is mentioned in Orlik-Terao’s book (1992).
As of 1992, all but 6 exceptional cases had been solved:Deligne (1972), Nakamura (1983), Orlik-Solomon (1988).
The six missing cases were G24, G27, G29, G31, G33 and G34.
Remark:
K (π, 1)⇔ connected and universal cover is contractible
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Brieskorn stated the conjecture in 1971 for complexified realreflection groups.
Deligne solved this case in 1972.
It’s not clear who stated it first in the general complex case.
Candidates for ???: Arnold, Brieskorn, Orlik, Saito...
The conjecture is mentioned in Orlik-Terao’s book (1992).
As of 1992, all but 6 exceptional cases had been solved:Deligne (1972), Nakamura (1983), Orlik-Solomon (1988).
The six missing cases were G24, G27, G29, G31, G33 and G34.
Remark:
K (π, 1)⇔ connected and universal cover is contractible
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Let’s begin with an interesting case of the conjecture:
Theorem (K (π, 1) conjecture for the A1 arrangement)
The punctured complex line C∗ is a K (π, 1) space.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
To prove this, we need:
scissors
glue
imagination
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
A recipe for constructing the universal cover of C∗:1 slice open C∗ along the negative imaginary half-line below 0
2 call this basic piece U0
3 make copies (Uk)k∈Z4 glue the copies together in a daisy-chain: each copy Uk get
glued along its “left-of-the-cut” side onto the“right-of-the-cut” side of Uk+1.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Disclaimer:
don’t try this at home!
it will fall apart
you cannot glue along a half-line
basic safety principle for a robust glueing:always glue along an open set
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Disclaimer:
don’t try this at home!
it will fall apart
you cannot glue along a half-line
basic safety principle for a robust glueing:always glue along an open set
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Disclaimer:
don’t try this at home!
it will fall apart
you cannot glue along a half-line
basic safety principle for a robust glueing:always glue along an open set
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Disclaimer:
don’t try this at home!
it will fall apart
you cannot glue along a half-line
basic safety principle for a robust glueing:always glue along an open set
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Definition (fat basepoint trick)
Let X be a topological space. Let U be a contractible subspace ofX . Let π1(X ) be the fundamental groupoid of X .The fundamental group of X with respect to the fat basepoint U isdefined as the transitive limit
π1(X ,U) := lim−→
u,v∈UHomπ1(X )(u, v)
for the transitive system of isomorphisms given by homotopyclasses of paths within U .
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
If you don’t like transitive limits, just remember this:
any path starting in u ∈ U and ending in v ∈ U represents anelement of π1(X ,U)
if your intuition requires you to really see a loop, draw a pathwithin U connecting u and v
the product of an element represented by a path withendpoints u, v ∈ U with an element represented by a pathwith endpoints u′, v ′ ∈ U is well-defined
if your intuition requires you to see this product asconcatenation, draw a path within U connecting v and u′
because U is contractible, all the paths you can draw within Uare homotopic
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Let X be (path-connected, locally simply-connected) space and letx0 ∈ X be a “basepoint”.To construct the (or rather a) universal cover of X , onetraditionally proceeds as follows:
let π1(X ) be the fundamental groupoid of X
consider Xx0 = x g→ y ∈ Ω(X )|x = x0this set can be equipped with a natural topology(neighborhoods around y)
the group π1(X , x0) naturally acts on it (by concatenation onthe left)
the map (xg→ y) 7→ y is a natural covering whose fibers are
transitively permuted by π1(X , x0)
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
The same construction works if we replace the basepoint x0 by afat basepoint U :
XU = x g→ y ∈ Ω(X )|x ∈ Ucan naturally be viewed as a universal cover of X .
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Let’s go back to the first theorem we want to prove:
Theorem (K (π, 1) conjecture for the A1 arrangement)
The punctured complex line C∗ is a K (π, 1) space.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
We choose as fat basepoint for C∗ the complement of the negativeimaginary half-line:
U = a +√−1b ∈ C∗|a = 0⇒ b > 0.
This fat basepoint is used to define “the” universal group and“the” universal cover.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Definition (tunnels and simples of type A1)
Let x ∈ U and L ∈ R≥0. Assume that the whole affine segment[x , x + L] is within C∗. Then we say that the path [0, 1]→ C∗,t 7→ x + tL is a semitunnel of length L.If in addition x + L ∈ U , we say that the semitunnel is a tunnel.A simple element in π1(C∗,U) is an element that can berepresented by a tunnel.The set of simple elements is denoted by S .
Clearly,S = 0, 1.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Semitunnels represent a certain subspace
U0
within the universal cover:
C∗U = x g→ y ∈ Ω(C∗)|x ∈ U.
Intuitively: U0 is an open patch of five-quarters of a turn. Theadditional quarter can be used to glue copies of it.The fundamental group
π1(C∗,U) ' Z
acts on C∗U by left concatenation. For k ∈ Z, we set
Uk := kU0.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Lemma
If k ∈ Z is simple, then U0 ∩ Uk 6= ∅
Proof: k can be represented by a tunnel from x to x + L (= anelement of U0) can be viewed as the concatenation of a tunnelfrom x to x + L (= a simple) and a tunnnel from x + L to x + L(= an element of U0).The concatenation of a simple and an element of U0, byconstruction, an element of Uk .
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Lemma
If k ∈ Z is simple, then U0 ∩ Uk 6= ∅
Proof: k can be represented by a tunnel from x to x + L (= anelement of U0) can be viewed as the concatenation of a tunnelfrom x to x + L (= a simple) and a tunnnel from x + L to x + L(= an element of U0).The concatenation of a simple and an element of U0, byconstruction, an element of Uk .
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Lemma (“the glueing goes well”)
1 the subspaces(Uk)k∈Z
are open sets in C∗U
2 we have C∗U =⋃
k∈Z Uk3 for all non-empty A ⊆ Z, the intersection
⋂k∈A Uk is either
empty or contractible:
Uk is contractible (“five quarters of a turn”)
Uk ∩ Uk+1 is contractible (“one quarter of a turn”)other intersections are empty.
In other words: S controls the combinatorics of the glueing rule.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Lemma (“the glueing goes well”)
1 the subspaces(Uk)k∈Z
are open sets in C∗U
2 we have C∗U =⋃
k∈Z Uk
3 for all non-empty A ⊆ Z, the intersection⋂
k∈A Uk is eitherempty or contractible:
Uk is contractible (“five quarters of a turn”)
Uk ∩ Uk+1 is contractible (“one quarter of a turn”)other intersections are empty.
In other words: S controls the combinatorics of the glueing rule.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Lemma (“the glueing goes well”)
1 the subspaces(Uk)k∈Z
are open sets in C∗U
2 we have C∗U =⋃
k∈Z Uk3 for all non-empty A ⊆ Z, the intersection
⋂k∈A Uk is either
empty or contractible:
Uk is contractible (“five quarters of a turn”)
Uk ∩ Uk+1 is contractible (“one quarter of a turn”)other intersections are empty.
In other words: S controls the combinatorics of the glueing rule.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Lemma (“the glueing goes well”)
1 the subspaces(Uk)k∈Z
are open sets in C∗U
2 we have C∗U =⋃
k∈Z Uk3 for all non-empty A ⊆ Z, the intersection
⋂k∈A Uk is either
empty or contractible:
Uk is contractible (“five quarters of a turn”)
Uk ∩ Uk+1 is contractible (“one quarter of a turn”)other intersections are empty.
In other words: S controls the combinatorics of the glueing rule.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Lemma (“the glueing goes well”)
1 the subspaces(Uk)k∈Z
are open sets in C∗U
2 we have C∗U =⋃
k∈Z Uk3 for all non-empty A ⊆ Z, the intersection
⋂k∈A Uk is either
empty or contractible:
Uk is contractible (“five quarters of a turn”)
Uk ∩ Uk+1 is contractible (“one quarter of a turn”)
other intersections are empty.
In other words: S controls the combinatorics of the glueing rule.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Lemma (“the glueing goes well”)
1 the subspaces(Uk)k∈Z
are open sets in C∗U
2 we have C∗U =⋃
k∈Z Uk3 for all non-empty A ⊆ Z, the intersection
⋂k∈A Uk is either
empty or contractible:
Uk is contractible (“five quarters of a turn”)
Uk ∩ Uk+1 is contractible (“one quarter of a turn”)other intersections are empty.
In other words: S controls the combinatorics of the glueing rule.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Lemma (“the glueing goes well”)
1 the subspaces(Uk)k∈Z
are open sets in C∗U
2 we have C∗U =⋃
k∈Z Uk3 for all non-empty A ⊆ Z, the intersection
⋂k∈A Uk is either
empty or contractible:
Uk is contractible (“five quarters of a turn”)
Uk ∩ Uk+1 is contractible (“one quarter of a turn”)other intersections are empty.
In other words: S controls the combinatorics of the glueing rule.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Theorem (“Topology is a myth, only combinatorics matter.”)
Let C be a collection of open subsets of X , such that:
X =⋃
U∈C U
for all A ⊆ C , the intersection⋂
U∈A U is either empty ofcontractible.
Then X is homotopy equivalent to the geometric realization of thenerve of C (the simplicial complex NC whose k-simplices are setsA ⊆ C such that
⋂U∈A U 6= ∅ and |A| = k + 1).
Disclaimer:
actually, for this to hold, X ought to be paracompact
the saying is: “Unless things are locally horrible, topology is amyth, and only combinatorics matter.”
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Theorem (“Topology is a myth, only combinatorics matter.”)
Let C be a collection of open subsets of X , such that:
X =⋃
U∈C U
for all A ⊆ C , the intersection⋂
U∈A U is either empty ofcontractible.
Then X is homotopy equivalent to the geometric realization of thenerve of C (the simplicial complex NC whose k-simplices are setsA ⊆ C such that
⋂U∈A U 6= ∅ and |A| = k + 1).
Disclaimer:
actually, for this to hold, X ought to be paracompact
the saying is: “Unless things are locally horrible, topology is amyth, and only combinatorics matter.”
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Corollary (“great, now it’s group theory”)
The universal cover of C∗ is homotopy-equivalent to the Cayleygraph of Z with respect to the generating set 1.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Definition
Let G be a group. A Garside structure on G consists of a finite setS of simple elements satisfying the following axioms:
1 S generates G ,
2 the partial ordering of S defined by
∀s, t ∈ S , (s 4 t)⇔ (∃u ∈ S , su = t)
is a lattice structure,
3 conjugacy by ∆, the maximum element in S , is anautomorphism of S .
A Garside group is a group that admits a Garside structure.The element ∆ is said to be a Garside element.The submonoid generated by S is said to be a Garside monoid.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Definition
Let G be a group. A Garside structure on G consists of a finite setS of simple elements satisfying the following axioms:
1 S generates G ,
2 the partial ordering of S defined by
∀s, t ∈ S , (s 4 t)⇔ (∃u ∈ S , su = t)
is a lattice structure,
3 conjugacy by ∆, the maximum element in S , is anautomorphism of S .
A Garside group is a group that admits a Garside structure.The element ∆ is said to be a Garside element.The submonoid generated by S is said to be a Garside monoid.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Definition
Let G be a group. A Garside structure on G consists of a finite setS of simple elements satisfying the following axioms:
1 S generates G ,
2 the partial ordering of S defined by
∀s, t ∈ S , (s 4 t)⇔ (∃u ∈ S , su = t)
is a lattice structure,
3 conjugacy by ∆, the maximum element in S , is anautomorphism of S .
A Garside group is a group that admits a Garside structure.The element ∆ is said to be a Garside element.The submonoid generated by S is said to be a Garside monoid.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Definition
Let G be a group. A Garside structure on G consists of a finite setS of simple elements satisfying the following axioms:
1 S generates G ,
2 the partial ordering of S defined by
∀s, t ∈ S , (s 4 t)⇔ (∃u ∈ S , su = t)
is a lattice structure,
3 conjugacy by ∆, the maximum element in S , is anautomorphism of S .
A Garside group is a group that admits a Garside structure.The element ∆ is said to be a Garside element.The submonoid generated by S is said to be a Garside monoid.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Definition
Let G be a group. A Garside structure on G consists of a finite setS of simple elements satisfying the following axioms:
1 S generates G ,
2 the partial ordering of S defined by
∀s, t ∈ S , (s 4 t)⇔ (∃u ∈ S , su = t)
is a lattice structure,
3 conjugacy by ∆, the maximum element in S , is anautomorphism of S .
A Garside group is a group that admits a Garside structure.The element ∆ is said to be a Garside element.The submonoid generated by S is said to be a Garside monoid.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Examples of Garside structures:
S = 0, 1 is a Garside structure on Z,
when W is a finite Coxeter group with associated Artin groupA(W ), the Tits section Σ of W into A(W ) is a Garsidestructure on A(W ).
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Examples of Garside structures:
S = 0, 1 is a Garside structure on Z,
when W is a finite Coxeter group with associated Artin groupA(W ), the Tits section Σ of W into A(W ) is a Garsidestructure on A(W ).
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Theorem (Deligne / Bestvina / Charney-Meier-Whittlesey)
Let G be a group with a Garside structure S .The geometric realization of Flag(G ,S) is K (π, 1).
The flag complex of (G ,S) is the simplicial complex whose:
the 0-skeleton is G ,
the 1-skeleton consists of all g , gs, with g ∈ G and s ∈ S ,
any fully-connected tuple g0, . . . , gk spans a k-simplex.
Corollary
The Cayley graph of Z with respect to 1 is K (π, 1).
Corollary
The punctured complex line C∗ is a K (π, 1) space.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Theorem (Deligne / Bestvina / Charney-Meier-Whittlesey)
Let G be a group with a Garside structure S .The geometric realization of Flag(G ,S) is K (π, 1).
The flag complex of (G ,S) is the simplicial complex whose:
the 0-skeleton is G ,
the 1-skeleton consists of all g , gs, with g ∈ G and s ∈ S ,
any fully-connected tuple g0, . . . , gk spans a k-simplex.
Corollary
The Cayley graph of Z with respect to 1 is K (π, 1).
Corollary
The punctured complex line C∗ is a K (π, 1) space.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Theorem (Deligne / Bestvina / Charney-Meier-Whittlesey)
Let G be a group with a Garside structure S .The geometric realization of Flag(G ,S) is K (π, 1).
The flag complex of (G ,S) is the simplicial complex whose:
the 0-skeleton is G ,
the 1-skeleton consists of all g , gs, with g ∈ G and s ∈ S ,
any fully-connected tuple g0, . . . , gk spans a k-simplex.
Corollary
The Cayley graph of Z with respect to 1 is K (π, 1).
Corollary
The punctured complex line C∗ is a K (π, 1) space.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Summary:
We want to prove that the space X = C∗ is K (π, 1).
We choose a fat basepoint U .
There is a natural notion of positive real direction in X .
We use this to define semitunnels, tunnels and simples.
This gives rise to an open covering (Ug )g∈G of the universalcover of X , indexed by G = π1(X ,U).
The covering has nice properties (intersections are empty orcontractible).
The set S of simples happens to:
encode the combinatorics of non-empty intersections,be a Garside structure on G .
We’re done!
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Definition
An irreducible finite complex reflection group W ⊆ GL(V ) iswell-generated if it can be generated by dimV reflections.
Remark: this case includes
all complexified real reflection groups;
5 of the nasty exceptional groups: G24, G27, G29, G33 and G34.
The remaining nasty group G31 is not well-generated: although itis a group of rank 4, it needs 5 reflections to be generated.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Definition
An irreducible finite complex reflection group W ⊆ GL(V ) iswell-generated if it can be generated by dimV reflections.
Remark: this case includes
all complexified real reflection groups;
5 of the nasty exceptional groups: G24, G27, G29, G33 and G34.
The remaining nasty group G31 is not well-generated: although itis a group of rank 4, it needs 5 reflections to be generated.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Definition
An irreducible finite complex reflection group W ⊆ GL(V ) iswell-generated if it can be generated by dimV reflections.
Remark: this case includes
all complexified real reflection groups;
5 of the nasty exceptional groups: G24, G27, G29, G33 and G34.
The remaining nasty group G31 is not well-generated: although itis a group of rank 4, it needs 5 reflections to be generated.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Definition
An irreducible finite complex reflection group W ⊆ GL(V ) iswell-generated if it can be generated by dimV reflections.
Remark: this case includes
all complexified real reflection groups;
5 of the nasty exceptional groups: G24, G27, G29, G33 and G34.
The remaining nasty group G31 is not well-generated: although itis a group of rank 4, it needs 5 reflections to be generated.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Let W ⊆ GL(V ) be an irreducible complex reflection group of rankn. Let p1, . . . , pn be a system of basic invariants of degreesd1 ≤ · · · ≤ dn: we have
C[V ]W = C[p1, . . . , pn] ' C[X1, . . . ,Xn].
The discriminant H of W is the image of⋃
H∈AH via theprojection V W \V .
Lemma (after Saito)
The group W is well-generated if and only if the equation of H inC[V ]W can be written
X nn + α2X
n−2n + · · ·+ αn = 0,
where α2, . . . , αn ∈ C[X1, . . . ,Xn−1].
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Let W ⊆ GL(V ) be an irreducible complex reflection group of rankn. Let p1, . . . , pn be a system of basic invariants of degreesd1 ≤ · · · ≤ dn: we have
C[V ]W = C[p1, . . . , pn] ' C[X1, . . . ,Xn].
The discriminant H of W is the image of⋃
H∈AH via theprojection V W \V .
Lemma (after Saito)
The group W is well-generated if and only if the equation of H inC[V ]W can be written
X nn + α2X
n−2n + · · ·+ αn = 0,
where α2, . . . , αn ∈ C[X1, . . . ,Xn−1].
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
The group W acts without fixed points on the hyperplane complex
V reg := V −⋃
H∈AH,
and the quotient is
W \V reg = W \V −H.
Because of the fibration long exact sequence of this Galoiscovering, proving that V reg is K (π, 1) is equivalent to proving thatW \V −H is K (π, 1).
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
To pick a point in W \V −H, where H has equation
X nn + α2X
n−2n + · · ·+ αn = 0,
we proceed as follows:
first, we pick a point y in the “space of vertical lines”:choosing y amongs to choosing values for X1, . . . ,Xn−1;
choosing a point of within W \V −H this vertical line Lyamounts to picking the value z for the remaining coordinateXn, avoiding the n solutions to the equation.
Definition
The Lyashko-Looijenga morphism LL is the algebraic morphismsending y to the configuration of n (not necessarily distinct) pointsin C, solutions of
X n + α2(y)X n−2 + · · ·+ αn(y) = 0.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
To pick a point in W \V −H, where H has equation
X nn + α2X
n−2n + · · ·+ αn = 0,
we proceed as follows:
first, we pick a point y in the “space of vertical lines”:choosing y amongs to choosing values for X1, . . . ,Xn−1;
choosing a point of within W \V −H this vertical line Lyamounts to picking the value z for the remaining coordinateXn, avoiding the n solutions to the equation.
Definition
The Lyashko-Looijenga morphism LL is the algebraic morphismsending y to the configuration of n (not necessarily distinct) pointsin C, solutions of
X n + α2(y)X n−2 + · · ·+ αn(y) = 0.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Definition
As fat basepoint for W \V −H, we take the open set U consistingof pairs (y , z) such that “z isn’t included in the negative imaginarylines below the points in LL(y)”, i.e.,
U := (y , z)|∀x ∈ LL(y), re(z) = re(x)⇒ im(z) > im(x).
The fundamental group π1(W \V ,U) is called braid group of W ,and denoted by B.
••
••
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Definition (tunnels and simples of type W )
Let (y , z) ∈ U and let L ∈ R≥0. Assume that the whole affinesegment [(y , z), (y , z + L)] is within W \V −H. Then we say thatthe path [0, 1]→ C∗, t 7→ (y , z + tL) is a semitunnel of length L.If in addition (y , z +L) ∈ U , we say that the semitunnel is a tunnel.A simple element in B is an element that can be represented by atunnel.The set of simple elements is denoted by S .
••
••//z z+L
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Exactly like we did for C∗:semitunnels yield a basic patch U1 in the universal cover,
we get an open covering(Ub)b∈B
:=(bU1
)b∈B
the intersections are either empty or contractible (this isnon-trivial),
the non-empty intersections correspond to chains of simples,
the hypersurface complement is homotopy equivalent toFlag(B, S),
the set S is a Garside structure on B
the associated monoid is the dual braid monoid:
S ' non-crossing partitions.
Corollary
The hyperplane complement of a well-generated complex reflectiongroup is K (π, 1).
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Exactly like we did for C∗:semitunnels yield a basic patch U1 in the universal cover,
we get an open covering(Ub)b∈B
:=(bU1
)b∈B
the intersections are either empty or contractible (this isnon-trivial),
the non-empty intersections correspond to chains of simples,
the hypersurface complement is homotopy equivalent toFlag(B, S),
the set S is a Garside structure on B
the associated monoid is the dual braid monoid:
S ' non-crossing partitions.
Corollary
The hyperplane complement of a well-generated complex reflectiongroup is K (π, 1).
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Proposition (after Springer)
Consider the complex reflection group W of type E8, in its actionon V ' C8.The natural scalar action of µ4 on V induces an action on
W \V −H
such that(W \V −H)µ4
is isomorphic to the complement of the discriminant hypersurfacefor the complex reflection group W ′ of type G31.
Generic pattern: for any complex reflection group W , whenever(W \V −H)µd is non-empty (“d is regular”), it is the discriminantcomplement of some other W ′.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Proposition (after Springer)
Consider the complex reflection group W of type E8, in its actionon V ' C8.The natural scalar action of µ4 on V induces an action on
W \V −H
such that(W \V −H)µ4
is isomorphic to the complement of the discriminant hypersurfacefor the complex reflection group W ′ of type G31.
Generic pattern: for any complex reflection group W , whenever(W \V −H)µd is non-empty (“d is regular”), it is the discriminantcomplement of some other W ′.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Dreaming of a relative version of the construction:
we would take Uµ4 as fat basepoint for G31,
a dual braid monoid of type G31 would be obtained by takingthe fixed points of a “diagram automorphism” of order 4 ofthe dual braid monoid for E8.
Similarly, one can view the Artin monoid of type F4 within theArtin monoid of type E6, as fixed points of a diagramautomorphism:
4 DAVID BESSIS
w0 on W is a diagram automorphism (i.e., it is induced by a permutation of S) and thecentraliser W ! := CW (w0) is a Coxeter group with Coxeter generating set S ! indexed byw0-conjugacy orbits on S. At the level of Artin groups, one shows (see for example [28])that
A(W !, S !) ! CA(W,S)(!),
which is an algebraic reformulation of the case p = 1, q = 2 of Question 3 (applied toW\V reg, as in Example 0.2).
Example 0.4. When A(W, S) is a Artin group of type E6, the !-conjugacy action is thenon-trivial diagram automorphism and the centraliser is an Artin group of type F4.
• •• •
• •s1 s2
s3 s4
s!3 s!
4
!!!!!!!!!!
""""""""""
!!
!
""
,
!!
!
""
• • • •s1 s2 s3s
!3 s4s
!4
The main strategy throughout this article is to construct Garside structures with suf-ficient symmetries, so that centralisers of periodic elements can be computed as easily asin Example 0.4.
Birman-Ko-Lee showed that the classical braid group Bn admits, in addition to thetype An"1 Artin group structure, another Garside group structure where the Garsideelement is a rotation ! of angle 2" 1
n. In [5], we used this Garside structure to compute
the centralisers of powers of !, which solves Question 3 for Bn and q|n. Thanks to somerather miraculous diagram chasing, we were also able to obtain the remaining case q|n"1.
Whenever G is a group and ! # G is the Garside element of a certain Garside structure,the centraliser CG(!) is again a Garside group, and is easy to compute. Note that thenotion of periodic element may be extended to this setting: we say that # # G is p
q-periodic
if#q = !p.
This of course is relative to the choice of a particular Garside structure. However, for Bn,the Artin Garside element ! and the Birman-Ko-Lee Garside element ! are commensu-rable
!2 = !n.
In particular, whether a given element # is periodic or not does not depend on the choicebetween the two standard Garside structures (although the actual p and q may vary).
As the above particular case illustrates, it is very easy to compute centraliser of Garsideelements in Garside groups. In particular, when trying to answer Questions 3 and 3’ in aspace whose fundamental group is a Garside group, it is very tempting to expect to builda proof on a positive answer to:
Question 4. Let G be a Garside group with Garside element !. Let # # Gbe a periodic element with respect to !. Does G admit a Garside structurewith Garside element #?
Note that a positive answer to Question 4 would imply that the following question alsoadmits a positive answer:
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Dreaming of a relative version of the construction:
we would take Uµ4 as fat basepoint for G31,
a dual braid monoid of type G31 would be obtained by takingthe fixed points of a “diagram automorphism” of order 4 ofthe dual braid monoid for E8.
Similarly, one can view the Artin monoid of type F4 within theArtin monoid of type E6, as fixed points of a diagramautomorphism:
4 DAVID BESSIS
w0 on W is a diagram automorphism (i.e., it is induced by a permutation of S) and thecentraliser W ! := CW (w0) is a Coxeter group with Coxeter generating set S ! indexed byw0-conjugacy orbits on S. At the level of Artin groups, one shows (see for example [28])that
A(W !, S !) ! CA(W,S)(!),
which is an algebraic reformulation of the case p = 1, q = 2 of Question 3 (applied toW\V reg, as in Example 0.2).
Example 0.4. When A(W, S) is a Artin group of type E6, the !-conjugacy action is thenon-trivial diagram automorphism and the centraliser is an Artin group of type F4.
• •• •
• •s1 s2
s3 s4
s!3 s!
4
!!!!!!!!!!
""""""""""
!!
!
""
,
!!
!
""
• • • •s1 s2 s3s
!3 s4s
!4
The main strategy throughout this article is to construct Garside structures with suf-ficient symmetries, so that centralisers of periodic elements can be computed as easily asin Example 0.4.
Birman-Ko-Lee showed that the classical braid group Bn admits, in addition to thetype An"1 Artin group structure, another Garside group structure where the Garsideelement is a rotation ! of angle 2" 1
n. In [5], we used this Garside structure to compute
the centralisers of powers of !, which solves Question 3 for Bn and q|n. Thanks to somerather miraculous diagram chasing, we were also able to obtain the remaining case q|n"1.
Whenever G is a group and ! # G is the Garside element of a certain Garside structure,the centraliser CG(!) is again a Garside group, and is easy to compute. Note that thenotion of periodic element may be extended to this setting: we say that # # G is p
q-periodic
if#q = !p.
This of course is relative to the choice of a particular Garside structure. However, for Bn,the Artin Garside element ! and the Birman-Ko-Lee Garside element ! are commensu-rable
!2 = !n.
In particular, whether a given element # is periodic or not does not depend on the choicebetween the two standard Garside structures (although the actual p and q may vary).
As the above particular case illustrates, it is very easy to compute centraliser of Garsideelements in Garside groups. In particular, when trying to answer Questions 3 and 3’ in aspace whose fundamental group is a Garside group, it is very tempting to expect to builda proof on a positive answer to:
Question 4. Let G be a Garside group with Garside element !. Let # # Gbe a periodic element with respect to !. Does G admit a Garside structurewith Garside element #?
Note that a positive answer to Question 4 would imply that the following question alsoadmits a positive answer:
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Dreaming of a relative version of the construction:
we would take Uµ4 as fat basepoint for G31,
a dual braid monoid of type G31 would be obtained by takingthe fixed points of a “diagram automorphism” of order 4 ofthe dual braid monoid for E8.
Similarly, one can view the Artin monoid of type F4 within theArtin monoid of type E6, as fixed points of a diagramautomorphism:
4 DAVID BESSIS
w0 on W is a diagram automorphism (i.e., it is induced by a permutation of S) and thecentraliser W ! := CW (w0) is a Coxeter group with Coxeter generating set S ! indexed byw0-conjugacy orbits on S. At the level of Artin groups, one shows (see for example [28])that
A(W !, S !) ! CA(W,S)(!),
which is an algebraic reformulation of the case p = 1, q = 2 of Question 3 (applied toW\V reg, as in Example 0.2).
Example 0.4. When A(W, S) is a Artin group of type E6, the !-conjugacy action is thenon-trivial diagram automorphism and the centraliser is an Artin group of type F4.
• •• •
• •s1 s2
s3 s4
s!3 s!
4
!!!!!!!!!!
""""""""""
!!
!
""
,
!!
!
""
• • • •s1 s2 s3s
!3 s4s
!4
The main strategy throughout this article is to construct Garside structures with suf-ficient symmetries, so that centralisers of periodic elements can be computed as easily asin Example 0.4.
Birman-Ko-Lee showed that the classical braid group Bn admits, in addition to thetype An"1 Artin group structure, another Garside group structure where the Garsideelement is a rotation ! of angle 2" 1
n. In [5], we used this Garside structure to compute
the centralisers of powers of !, which solves Question 3 for Bn and q|n. Thanks to somerather miraculous diagram chasing, we were also able to obtain the remaining case q|n"1.
Whenever G is a group and ! # G is the Garside element of a certain Garside structure,the centraliser CG(!) is again a Garside group, and is easy to compute. Note that thenotion of periodic element may be extended to this setting: we say that # # G is p
q-periodic
if#q = !p.
This of course is relative to the choice of a particular Garside structure. However, for Bn,the Artin Garside element ! and the Birman-Ko-Lee Garside element ! are commensu-rable
!2 = !n.
In particular, whether a given element # is periodic or not does not depend on the choicebetween the two standard Garside structures (although the actual p and q may vary).
As the above particular case illustrates, it is very easy to compute centraliser of Garsideelements in Garside groups. In particular, when trying to answer Questions 3 and 3’ in aspace whose fundamental group is a Garside group, it is very tempting to expect to builda proof on a positive answer to:
Question 4. Let G be a Garside group with Garside element !. Let # # Gbe a periodic element with respect to !. Does G admit a Garside structurewith Garside element #?
Note that a positive answer to Question 4 would imply that the following question alsoadmits a positive answer:
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Dreaming of a relative version of the construction:
we would take Uµ4 as fat basepoint for G31,
a dual braid monoid of type G31 would be obtained by takingthe fixed points of a “diagram automorphism” of order 4 ofthe dual braid monoid for E8.
Similarly, one can view the Artin monoid of type F4 within theArtin monoid of type E6, as fixed points of a diagramautomorphism:
4 DAVID BESSIS
w0 on W is a diagram automorphism (i.e., it is induced by a permutation of S) and thecentraliser W ! := CW (w0) is a Coxeter group with Coxeter generating set S ! indexed byw0-conjugacy orbits on S. At the level of Artin groups, one shows (see for example [28])that
A(W !, S !) ! CA(W,S)(!),
which is an algebraic reformulation of the case p = 1, q = 2 of Question 3 (applied toW\V reg, as in Example 0.2).
Example 0.4. When A(W, S) is a Artin group of type E6, the !-conjugacy action is thenon-trivial diagram automorphism and the centraliser is an Artin group of type F4.
• •• •
• •s1 s2
s3 s4
s!3 s!
4
!!!!!!!!!!
""""""""""
!!
!
""
,
!!
!
""
• • • •s1 s2 s3s
!3 s4s
!4
The main strategy throughout this article is to construct Garside structures with suf-ficient symmetries, so that centralisers of periodic elements can be computed as easily asin Example 0.4.
Birman-Ko-Lee showed that the classical braid group Bn admits, in addition to thetype An"1 Artin group structure, another Garside group structure where the Garsideelement is a rotation ! of angle 2" 1
n. In [5], we used this Garside structure to compute
the centralisers of powers of !, which solves Question 3 for Bn and q|n. Thanks to somerather miraculous diagram chasing, we were also able to obtain the remaining case q|n"1.
Whenever G is a group and ! # G is the Garside element of a certain Garside structure,the centraliser CG(!) is again a Garside group, and is easy to compute. Note that thenotion of periodic element may be extended to this setting: we say that # # G is p
q-periodic
if#q = !p.
This of course is relative to the choice of a particular Garside structure. However, for Bn,the Artin Garside element ! and the Birman-Ko-Lee Garside element ! are commensu-rable
!2 = !n.
In particular, whether a given element # is periodic or not does not depend on the choicebetween the two standard Garside structures (although the actual p and q may vary).
As the above particular case illustrates, it is very easy to compute centraliser of Garsideelements in Garside groups. In particular, when trying to answer Questions 3 and 3’ in aspace whose fundamental group is a Garside group, it is very tempting to expect to builda proof on a positive answer to:
Question 4. Let G be a Garside group with Garside element !. Let # # Gbe a periodic element with respect to !. Does G admit a Garside structurewith Garside element #?
Note that a positive answer to Question 4 would imply that the following question alsoadmits a positive answer:
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Proposition (“a series of depressing news”)
The dual braid monoid has no automorphism of order 4 (theCoxeter number of type E8 is 30),
the fixed subspace Uµ4 of the fat basepoint of type E8 isn’teven connected!
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Proposition (“a series of depressing news”)
The dual braid monoid has no automorphism of order 4 (theCoxeter number of type E8 is 30),
the fixed subspace Uµ4 of the fat basepoint of type E8 isn’teven connected!
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Proposition (“a series of depressing news”)
The dual braid monoid has no automorphism of order 4 (theCoxeter number of type E8 is 30),
the fixed subspace Uµ4 of the fat basepoint of type E8 isn’teven connected!
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Lemma (Broue-Michel)
Let W be an irreducible complex reflection group, and d be aregular degree, i.e., a integer such that
(W \V −H)µd 6= ∅.
Then B admits d-periodic elements (elements γ ∈ B such that γd
is central).
Example: when W is real,
the classical Garside element ∆ is 2-periodic,
the dual Garside element δ is h-periodic,
indeed, ∆2 = δh generates the center of the pure braid group.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Lemma (Broue-Michel)
Let W be an irreducible complex reflection group, and d be aregular degree, i.e., a integer such that
(W \V −H)µd 6= ∅.
Then B admits d-periodic elements (elements γ ∈ B such that γd
is central).
Example: when W is real,
the classical Garside element ∆ is 2-periodic,
the dual Garside element δ is h-periodic,
indeed, ∆2 = δh generates the center of the pure braid group.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Missing braid monoids?
678 D. BESSIS
LEMMA 5.1.1. – For any positive integer m, set
tm :=
!m"
i=1
si
#!m!1"
i=1
si
#!1
.
We have T = t1, . . . , tN, and
w0 =N"
m=1
tN!m+1.
Proof. – Set tm := p(tm). By [4], Ch. V, §6 Ex. 2, pp. 139–140, we have T = t1, . . . , tN.Using the commutation relations within L, we see that, when 1 ! m ! k, tm = sm. When
k + 1 ! m ! n, the commutation relations within R yield
tm = s1 . . .sm!1sms!1m!1 . . .s!1
1 = s1 . . .snsms!1n . . .s!1
1 = csmc!1.
We have proved$s1, . . . , sk,csk+1c
!1, . . . ,csnc!1%
= t1, . . . , tn.
For all m, we have tm+n = ctmc!1. From this and the above description of t1, . . . , tn, wededuceT = t1, . . . , tN.From the Bourbaki exercice quoted above, we also get w0 =
&Nm=1 sm. Since
(s1, . . . , sN ) ! RedS(w0),
we have w0 =&N
m=1 sm =&N
m=1 tN!m+1. !These facts are summarized in Table 1.The final line has the following explanation: in [1], a certain class of presentations of braid
groups is constructed. Each of these presentations corresponds to a regular degree d. The productof the generators, raised to the power d (which is the order of the image of this product in thereflection group), is always central.For an irreducible Coxeter group, 2 and h are the respectively smallest and largest degrees;
they are always regular; it is possible to choose intermediate regular degrees but they do not seemto yield Garside monoids.
Table 1
Classical monoid Dual monoid
Set of atoms S T
Number of atoms n N
! w0 c
Length of! N n
Order of p(!) 2 h
Product of the atoms c w0
Regular degree h 2
4e SÉRIE – TOME 36 – 2003 – N! 5
-
80
. . . ?
For E8, in addition to 2 and 30, there are other regular degrees,including 24.Should we expect a Garside structure with a symmetry of order 24?
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
As observed by Krammer (and in related independent work byDigne-Michel), Garside theory works equally well in a categoricalsetup.The game is played as follows:
Replace “monoid” by “category” and “group” by “groupoid.”
Lattice property: existence of limits and colimits.
Category automorphism φ (= diagram automorphism.)
Categorify the conjugacy relation
φ(g) = ∆−1g∆
by taking ∆ to be a natural transformation from the identityfunctor to φ.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
As observed by Krammer (and in related independent work byDigne-Michel), Garside theory works equally well in a categoricalsetup.The game is played as follows:
Replace “monoid” by “category” and “group” by “groupoid.”
Lattice property: existence of limits and colimits.
Category automorphism φ (= diagram automorphism.)
Categorify the conjugacy relation
φ(g) = ∆−1g∆
by taking ∆ to be a natural transformation from the identityfunctor to φ.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
As observed by Krammer (and in related independent work byDigne-Michel), Garside theory works equally well in a categoricalsetup.The game is played as follows:
Replace “monoid” by “category” and “group” by “groupoid.”
Lattice property: existence of limits and colimits.
Category automorphism φ (= diagram automorphism.)
Categorify the conjugacy relation
φ(g) = ∆−1g∆
by taking ∆ to be a natural transformation from the identityfunctor to φ.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
As observed by Krammer (and in related independent work byDigne-Michel), Garside theory works equally well in a categoricalsetup.The game is played as follows:
Replace “monoid” by “category” and “group” by “groupoid.”
Lattice property: existence of limits and colimits.
Category automorphism φ (= diagram automorphism.)
Categorify the conjugacy relation
φ(g) = ∆−1g∆
by taking ∆ to be a natural transformation from the identityfunctor to φ.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Theorem (D.B., 2006)
Let C be a Garside category with groupoid of fractions G . Let dbe a positive integer. There exists a Garside category Cd withgroupoid of fractions Gd , together with a functor
θd : C → Cd ,
inducing an equivalence of categories
G → Gd ,
and such that, for any d-periodic loop γ ∈ C , the image θd(γ) isconjugate to a Garside element (= a morphism in the naturalfamily ∆d).
The categories C and Cd are not equivalent (the whole point is toconstruct Garside structures with new symmetries.)
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Geometry & Topology GGGGGGGG G GGGG
GG
T TTTTTT
TTTTTTTT
Volume 3 (1999) 269–302
Published: 11 September 1999
Non-positively curved aspects of Artin groupsof finite type
Mladen Bestvina
Department of Mathematics, University of UtahSalt Lake City, UT 84112, USA
Email: [email protected]
Abstract
Artin groups of finite type are not as well understood as braid groups. This isdue to the additional geometric properties of braid groups coming from theirclose connection to mapping class groups. For each Artin group of finite type,we construct a space (simplicial complex) analogous to Teichmuller space thatsatisfies a weak nonpositive curvature condition and also a space “at infinity”analogous to the space of projective measured laminations. Using these con-structs, we deduce several group-theoretic properties of Artin groups of finitetype that are well-known in the case of braid groups.
AMS Classification numbers Primary: 20F32, 20F36
Secondary: 55P20
Keywords: Artin groups, nonpositive curvature
Proposed: Walter Neumann Received: 27 November 1998
Seconded: Wolfgang Metzler, Joan Birman Revised: 5 August 1999
ISSN 1364-0380
Copyright Geometry and Topology
269
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
a
a.a
a.a.aa.a.ab
a.ab a.ab.b
a.ab.ba
a.ab.ba.ab
a.ab.b.b
a.ab.b.ba
ab
ab.bab.ba
!
b
ba
b.b
ba.ab
b.ba
Figure 1: X(G) for G = A/!2 , A = !a, b | aba = bab"
a single !, and in the latter case we agree to push this ! to the last slot. Thereis an oriented edge from a vertex v to a vertex w if the special representativeof w is obtained from the special representative of v by rightmultiplying byan atom. The simplicial complex X !(G) is defined to be the flag complexdetermined by the resulting graph, ie, a collection of vertices spans a simplexprovided all pairs span an edge. The natural quotient map G # G/!!" extendsto a simplicial map p : X !(G) # X(G). The preimage of the basepoint $ %X(G) is the edge [$,!] & X !(G). More generally, the preimage of a simplex! is the (triangulated) prism ! ' [0, 1]. There is a global homeomorphismX !(G) (= X(G) ' [0, 1]. In the first coordinate this homeomorphism is given byp and in the second it is the simplicial map that sends the vertices whose specialrepresentative has no !’s to 0 and the vertices whose special representative hasone ! to 1.
Analogously, there is a complex X(A) with vertex set A and similarly definedsimplicial structure: edges are drawn from $ to the atoms and extended equiv-ariantly, and then the higher-dimensional simplices are filled in. The quotientmap extends to the natural simplicial map q : X(A) # X(G) and there is aglobal homeomorphism X(A) (= X(G) ' R in the first coordinate given by qand in the second it is the map that is linear on each simplex and sends a vertex
Mladen Bestvina
Geometry and Topology, Volume 3 (1999)
280
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
4.2 Finite subgroups of G
It is well-known to the experts that all finite subgroups of G are cyclic, and infact the kernel of the homomorphism G ! Z/2! is torsion-free, where ! = ||!||and the homomorphism is the length modulo 2! . (Note that the argument ofTheorem 4.1 gives another proof of this fact.)
In this section we will use the geometric structure of X(G) to give a classificationof finite subgroups of G up to conjugacy.
Theorem 4.5 Every finite subgroup H < G is cyclic. Moreover, after con-jugation, H transitively permutes the vertices of a simplex " " X(G) thatcontains # and H has one of the following two forms:
Type 1 The order of H is even, say 2m. It is generated by an atom B . Thevertices of " are #, B,B2, · · · , Bm!1 (all atoms) and Bm = !. Necessarily,B = B (since ! fixes the whole simplex).
Type 2 The order m of H is odd, the group is generated by B! for anatom B , and the vertices #, B,BB,BBB, · · · , (BB)(m!1)/2B (all atoms) arepermuted cyclically and faithfully by the group (so the dimension of " is m$1).Since m is odd, the square BB of the generator also generates H .
An example of a type 1 group is %B& for B = "1"3"2 in the braid group B4/%!2&(of order 4). An example of a type 2 group is %"1!& in B3/%!2& (of order 3).
The key to this is:
Lemma 4.6 The set of vertices of any simplex " in X admits a cyclic orderthat is preserved by the stabilizer Stab(") < G .
Proof We can translate " so that # is one of its vertices. Let the cyclicorder be induced from the linear order # < B1 < B2 < · · · < Bk given bythe orientations of the edges of " (equivalently, by the lengths of the atomsBi ). We need to argue that the left translation by B!1
i is going to pro-duce the same cyclic order. We can write Bi+1 = BiCi for atoms Ci , sothat the vertices of " are #, C1, C1C2, · · · , C1 · · · Ck . After translation by B!1
1
the vertices are B!11 , #, C2, C2C3, · · · , C2 · · · Ck , where B!1
1 should be replacedby the special representative of the coset B!1
1 %!&. Let Y be the atom withC1C2 · · · CkY = !. Then B!1
1 ! = C!11 ! = C2C3 · · · CkY and C2C3 · · · CkY
is this canonical representative (it is a subword of !, so it is an atom). SinceC2 · · · Ck < C2 · · · CkY , it follows that the induced ordering on the vertices is acyclic permutation of the old one. Repeating this i times gives the claim.
Non-positively curved aspects of Artin groups of finite type
Geometry and Topology, Volume 3 (1999)
293
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Bestvina’s complex, redux: with enough basepoints, any finitesubgroup of C/∆ fixes a vertex:
a
a.a
a.a.aa.a.ab
a.ab a.ab.b
a.ab.ba
a.ab.ba.ab
a.ab.b.b
a.ab.b.ba
ab
ab.bab.ba
!
b
ba
b.b
ba.ab
b.ba
Figure 1: X(G) for G = A/!2 , A = !a, b | aba = bab"
a single !, and in the latter case we agree to push this ! to the last slot. Thereis an oriented edge from a vertex v to a vertex w if the special representativeof w is obtained from the special representative of v by rightmultiplying byan atom. The simplicial complex X !(G) is defined to be the flag complexdetermined by the resulting graph, ie, a collection of vertices spans a simplexprovided all pairs span an edge. The natural quotient map G # G/!!" extendsto a simplicial map p : X !(G) # X(G). The preimage of the basepoint $ %X(G) is the edge [$,!] & X !(G). More generally, the preimage of a simplex! is the (triangulated) prism ! ' [0, 1]. There is a global homeomorphismX !(G) (= X(G) ' [0, 1]. In the first coordinate this homeomorphism is given byp and in the second it is the simplicial map that sends the vertices whose specialrepresentative has no !’s to 0 and the vertices whose special representative hasone ! to 1.
Analogously, there is a complex X(A) with vertex set A and similarly definedsimplicial structure: edges are drawn from $ to the atoms and extended equiv-ariantly, and then the higher-dimensional simplices are filled in. The quotientmap extends to the natural simplicial map q : X(A) # X(G) and there is aglobal homeomorphism X(A) (= X(G) ' R in the first coordinate given by qand in the second it is the map that is linear on each simplex and sends a vertex
Mladen Bestvina
Geometry and Topology, Volume 3 (1999)
280
Adding more basepoints = thinking up to equivalence of categories.
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Back to the complex reflection group of type E8:
Proposition (“a series of excellent news”)
The theorem is constructive.
Applying the construction starting from the dual braid monoidof type E8, one gets a Garside category with symmetry oforder d = 4.
This category has 88 objects.
The fixed subpace Uµ4 has 88 connected components, innatural bijection with these objects.
Working out the details (adequate tunnels, contractility ofintersections,...), one eventually reaches:
Theorem
Finite complex reflection arrangements are K (π, 1).
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Back to the complex reflection group of type E8:
Proposition (“a series of excellent news”)
The theorem is constructive.
Applying the construction starting from the dual braid monoidof type E8, one gets a Garside category with symmetry oforder d = 4.
This category has 88 objects.
The fixed subpace Uµ4 has 88 connected components, innatural bijection with these objects.
Working out the details (adequate tunnels, contractility ofintersections,...), one eventually reaches:
Theorem
Finite complex reflection arrangements are K (π, 1).
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Back to the complex reflection group of type E8:
Proposition (“a series of excellent news”)
The theorem is constructive.
Applying the construction starting from the dual braid monoidof type E8, one gets a Garside category with symmetry oforder d = 4.
This category has 88 objects.
The fixed subpace Uµ4 has 88 connected components, innatural bijection with these objects.
Working out the details (adequate tunnels, contractility ofintersections,...), one eventually reaches:
Theorem
Finite complex reflection arrangements are K (π, 1).
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Back to the complex reflection group of type E8:
Proposition (“a series of excellent news”)
The theorem is constructive.
Applying the construction starting from the dual braid monoidof type E8, one gets a Garside category with symmetry oforder d = 4.
This category has 88 objects.
The fixed subpace Uµ4 has 88 connected components, innatural bijection with these objects.
Working out the details (adequate tunnels, contractility ofintersections,...), one eventually reaches:
Theorem
Finite complex reflection arrangements are K (π, 1).
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Back to the complex reflection group of type E8:
Proposition (“a series of excellent news”)
The theorem is constructive.
Applying the construction starting from the dual braid monoidof type E8, one gets a Garside category with symmetry oforder d = 4.
This category has 88 objects.
The fixed subpace Uµ4 has 88 connected components, innatural bijection with these objects.
Working out the details (adequate tunnels, contractility ofintersections,...), one eventually reaches:
Theorem
Finite complex reflection arrangements are K (π, 1).
David Bessis Why G31 is K(π, 1)
the K(π, 1) conjecture for complex reflection arrangementsscissors and glue
well-generated complex reflection arrangements are K(π, 1)abstract nonsense
Back to the complex reflection group of type E8:
Proposition (“a series of excellent news”)
The theorem is constructive.
Applying the construction starting from the dual braid monoidof type E8, one gets a Garside category with symmetry oforder d = 4.
This category has 88 objects.
The fixed subpace Uµ4 has 88 connected components, innatural bijection with these objects.
Working out the details (adequate tunnels, contractility ofintersections,...), one eventually reaches:
Theorem
Finite complex reflection arrangements are K (π, 1).
David Bessis Why G31 is K(π, 1)