• Aucun résultat trouvé

Questions on surface braid groups

N/A
N/A
Protected

Academic year: 2021

Partager "Questions on surface braid groups"

Copied!
14
0
0

Texte intégral

(1)

HAL Id: hal-00004548

https://hal.archives-ouvertes.fr/hal-00004548

Preprint submitted on 29 Mar 2005

HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci- entific research documents, whether they are pub- lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Questions on surface braid groups

Paolo Bellingeri, Eddy Godelle

To cite this version:

Paolo Bellingeri, Eddy Godelle. Questions on surface braid groups. 2005. �hal-00004548�

(2)

ccsd-00004548, version 1 - 29 Mar 2005

PAOLO BELLINGERI AND EDDY GODELLE

Abstract. We provide new group presentations for surface braid groups which are positive. We study some properties of such presentations and we solve the conjugacy problem in a particular case.

1. Introduction and Motivation

Let Σg,p be an orientable surface of genusg withpboundary components. For instance, Σ0,0

is the 2-sphere, Σ1,0 is the torus, and Σ0,1corresponds to the disk.

A geometric braid on Σg,p based at P is a collection B = (ψ1, . . . , ψn) of n 2 paths from [0,1] to Σg,p such that ψi(0) = Pi, ψi(1) ∈ P and 1(t), . . . , ψn(t)} are distinct points for all t[0,1]. Two braids are considered as equivalent if they are isotopic. The usual product of paths defines a group structure on the equivalence classes of braids. This group doesnot depend, up to isomorphism, on the choice ofP. It is called the (surface) braid group on n strands on Σg,p

and denoted byBng,p). The groupBn0,1) is the classical braid groupBn onnstrings. Some elements ofBng,p) are shown in Figure 1. The braidσicorresponds to the standard generator of Bn and it can be represented by a geometric braid on Σg,pwhere all the strands are trivial except thei-th one and the (i+ 1)-th one. Thei-th strand goes fromPi toPi+1 and the (i+ 1)-th strand goes from Pi+1 to Pi according to Figure 1. The loops δ1, . . . , δp+2g1 based on P1 in Figure 1 represent standard generators of π1g,p). By its definition, B1g,p) is isomorphic toπ1g,p).

We can also consider δ1, . . . , δp+2g1 as braids on n strands on Σ, where lastn1 strands are trivial.

It is well known since E. Artin ([2]) that the braid groupBn has a positive presentation (see for instance [17] Chapter 2 Theorem 2.2), i.e. a group presentation which involves only generators and not their inverses. Hence one can associate a (braid) monoidB+n with the same presentation, but as a monoid presentation. It turns out that the braid monoid Bn+ is a Garside monoid (see [8]), that is a monoid with a good divisibility structure, and that the braid groupBn is the group of fractions of the monoidBn+. As a consequence, the natural morphism of monoids from Bn+ to Bn is into, and we can solve the word problem, the conjugacy problem and obtain normal forms inBn(see [4, 6, 8, 10, 12]). These results extend to Artin-Tits groups of spherical type which are a well-known algebraic generalization of the braid groupBn ([4, 6, 8, 10]).

In the case of surface braid groupsBng,p), some group presentations are known but they are not positive. Furthermore, questions as the conjugacy problem are not solved in the general case.

The word problem in surface braid groups is known to be solvable (see [14]) even if algorithms are not as efficient as the ones proposed for the braid groupBn.

In this note we provide positive presentations for Bng,p) and we address questions related to the conjugacy problem of surface braid groups. We do not discuss the case ofBn0,0), the braid group on the 2-sphere; this is a particular case with specific properties. For instance if Σ is an oriented surface, the surface braid group Bn(Σ) has torsion elements only and only if Σ is the

1

(3)

2-sphere (see [13] page 277, [11] page 255, and [19] proposition 1.5).

In Section 2 and 3 we focus on braid groups on surfaces with boundary components and without boundary components respectively. In Section 4, we investigate the special case ofB21,0) and we solve the word problem and the conjugacy problem for this group.

00 11 00 11 00 11 00 11 0000 1111

0000 00 1111 11

00 0 11 1 00 0 11 1 00 0 11 1 00 0 11 1

δ δ

δp+2g−1 1

δp−1

p

σj

Figure 1: some braid elements

2. Braid groups on surfaces with boundary components

In this section we investigate braid groups on oriented surfaces with a positive number of boundary components. Our first objective is to prove Theorem 2.1:

Theorem 2.1. Let nandpbe positive integers. Let gbe a non negative integer. Then, the group Bng,p)admits the following group presentation:

Generators: σ1, . . . , σn1, δ1,· · · , δ2g+p1;

Relations:

-Braid relations:

(BR1) σiσj =σjσi for |ij| ≥2;

(BR2) σiσi+1σi=σi+1σiσi+1 for 1in1.

- Commutative relations between surface braids:

(CR1) δrσi =σiδr for i6= 1;1r2g+p1;

(CR2) δrσ1δrσ1=σ1δrσ1δr 1r2g+p1;

(CR3) δrσ1δrδsσ1=σ1δrδsσ1δr for 1r < s2g+p1 with

(r, s)6= (p+ 2i, p+ 2i+ 1),0ig1.

- Skew commutative relations on the handles:

(SCR1) σ1δr+1σ1δrσ1=δrσ1δr+1 for r=p+ 2iwhere0ig1.

The above presentation can be compared to the presentation ofBg,n given in [15] page 18.

Proof. Let us denote byB^ng,p) the group defined by the presentation given in Theorem 2.1. We prove that the groupB^ng,p) is isomorphic to the groupBng,p) using the presentation given in

(4)

Theorem A.1. Let ψ : 1, . . . , σn1, a1, . . . , ag, b1, . . . , bg, z1, . . . , zp1} → {σ1, . . . , σn1, δ1,· · ·, δ2g+p1} be the set-map defined by ψ(σi) =σi for i= 1, . . . , n1,ψ(ar) =δp+2(r1 1), ψ(br) = δp+2(r1 1)+1 forr= 1, . . . , g and ψ(zj) =δj1 forj = 1, . . . , p1. We claim that ψextends to a homomorphism of groupsψ:Bng,p)Bn^g,p). We have to verify that the image byψof the braid relations and of the relations of type (R1)-(R8) are true in B^ng,p). It is enough to verify that

σ11δr1σ1δs1=δs1σ11δr1σ1

(†)

for 1r < s2g+p1 and (r, s)6= (p+ 2k, p+ 2k+ 1) which corresponds to the image by ψ in Bn^g,p) of the relations of type (R3), (R6) and (R7); the other cases are true as they are relations of the presentation ofBn^g,p).

The relations of type (CR3) can be writtenδrσ1δrδs=σ1δrδsσ1δrσ11. From the relations of type (CR1) we deduce that, in Bn^g,p), the equalitiesδrσ1δrδs = δrσ1δrσ1σ11δs =σ1δrσ1δrσ11δs

holds. Hence we obtain σ1δrδsσ1δrσ11 = σ1δrσ1δrσ11δs. From this equality, we derive that δsσ1δrσ11=σ1δrσ11δs, and finally we get the relations (†).

On the other hand, consider ψ the set-map defined from 1, . . . , σn1, δ1,· · · , δ2g+p1} to 1, . . . , σn1, a1, . . . , ag, b1, . . . , bg, z1, . . . , zp1} by ψ(σi) =σi for i= 1, . . . , n1,ψ(δj) =zj1 for j = 1, . . . , p1, ψ(δp+2(r1)) =ar1 and ψ(δp+2(r1)+1) = br1 for r = 1, . . . , g. We prove that ψextends to an homomorphism of groups fromB^ng,p) to Bng,p). Since braid relations and the images byψ of the relations of type (ER), (CR1) and (CR2) are verified, it suffices to check that the equalities corresponding to relations of type (CR3) hold inBng,p). We verify that the equalityar1σ1ar1as1σ1=σ1ar1as1σ1ar1for (1r > s g) holds inBng,p). The other cases can easily be verified by the reader. From the relations of type (R2), it follows that ar1σ1ar1 =σ1ar1σ1ar1σ11; thus we have ar1σ1ar1as1σ1 =σ1ar1σ1ar1σ11as1σ1. Applying relations of type (R3) we deduce that ar1σ11as1σ1=σ11as1σ1ar1 and therefore the equalities ar1σ1ar1as1σ1 =σ1ar1as1σ1ar1 hold in Bng,p). Then, the morphismψ from B^ng,p) to Bng,p) is well defined and it is the inverse ofψ. Hence,Bng,p) is isomorphic toB^ng,p). 2

We remark that the presentation given in Theorem 2.1 is positive and has less types of relations than the presentation given in Theorem A.1.

Lemma 2.2. Let Gbe a group and letσ, δ, δ be in G.

(i) If (a) δ(σδδσ) = (σδδσ)δ, (b) σδσδ = δσδσ and (c) σδσδ = δσδσ then δ(σδδσ) = (σδδσ)δ.

(ii) If (a)δ(σδδσ) =σ(δδσδ), (b) δ(σδδσ) = (σδδσ)δ and (c) σδσδ =δσδσ then σδσδ = δσδσ.

(iii) In the presentation of Theorem 2.1, we can replace relation(CR3) by:

(CR3)δsσ1δrδsσ1=σ1δrδsσ1δs

for 1r < s2g+p1with (r, s)6= (p+ 2i, p+ 2i+ 1),0ig1.

Proof. (i) Assume (a) δσδδσ = σδδσδ, (b) σδσδ = δσδσ and (c) σδσδ = δσδσ. Then, δσδδσ = δ1σ1σδδσδδσ = δ1σ1δσδδσδσ = δ1σ1δσδσδσδ = δ1σ1σδσδδσδ = σδδσδ.

(ii) Assume (a)δ(σδδσ) =σ(δδσδ), (b)δ(σδδσ) = (σδδσ)δ and (c)σδσδ=δσδσ. Then

(5)

σδσδ=σδδσδ(δσδ)1σδ=δσδδσδ1σ1δ′−1σδ=δσδ(σδσδσ1δ′−11σ1δ′−1σδ= δσδσδσδδ′−1σ1δ′−1δ1σ1σδ=δσδσ.

(iii) is a consequence of (i). 2

Since the relations of the presentation ofBng,p) are positive, one can define a monoid with the same presentation but as a monoid presentation. It is easy to see that the monoid we obtain doesnot inject inBng,p), even if we add the relations of type (CR3) to the presentation given in Theorem 2.1. In fact the following relations,

(CR3)k δrσ1δrδksσ1=σ1δrδskσ1δr

for 1r < s2g+p1 with (r, s)6= (p+ 2i, p+ 2i+ 1), 0ig1 andkN, and (CR3)k δsσ1δkrδsσ1=σ1δrkδsσ1δs

for 1r < s2g+p1 with (r, s)6= (p+ 2i, p+ 2i+ 1), 0i g1 andkN, are true in Bng,p) for each positive integerk, but they are false in the monoid for kgreater than 1: no relation of the presentation can be applied to the left side of the equalities. Then starting from the left side of the equality fork >1, we cannot obtain the right side of the equality by using the relations of the monoid presentation only.

Question 1. Let Bng,p) be the monoid defined by the presentation of Theorem 2.1 with the extra relations(CR3)k,(CR3)k forkN. Is the canonical homomorphism ϕfromBng,p)to Bng,p)into ?

We remark that we can define a length functiononBng,p): ifFis the free monoid based on σ1· · ·, σn1, δ1,· · · , δ2g, ifl:F Nis the canonical length function and ifw7→wis the canon- ical morphism from F ontoBng,p) then, for eachg in Bng,p), one hassup{l(w)|wF ; w=g}<+∞; furthermore if we set ℓ(g) = sup{l(w)|w F}, then for g1, g2 in Bng,p) we haveℓ(g1g2)ℓ(g1) +ℓ(g2).

Now, let us consider the particular case of planar surfaces.

Proposition 2.3. Letn, pbe positive integers withnp1. LetI⊂ {1,· · ·, n}withCard(I) = p1.

Then Bn0,p) admits the following presentation:

Generators : σ1,· · · , σn1 andρi for iI;

Relations:

(BR1) σiσj =σjσi for 1i, jn1with |ij| ≥2;

(BR1) ρrρs=ρsρr r, sI,r6=s;

(BR1)′′ ρrσi=σiρr rI;1in1,i6=r1, r.

(BR2) σiσi+1σi =σi+1σiσi+1 for 1in1;

(BR3) σiρrσiρr=ρrσiρrσi rI,i=r, r1;

(BR3) r1σrrσr1ρr=ρrr1σrrσr1 rI ;r6= 1, n.

(6)

Proof. Consider the presentation of Theorem 2.1. Let I = {r1 < r2· · · < rp1} and set ρrj = r1· · ·σ1pjr1· · ·σ1)1. Relations (BR1)′′ are equivalent to relations (CR1) withi6=r, by using braid relations. Using (CR2), we get (BR1) ⇐⇒ (CR3). Using braid relations (BR1) and (BR2), the relations (CR2) are equivalent to relations (BR3) by conjugation by r1σr)· · ·1σ2) and (σr2σr1)· · ·1σ2) wheni=r−1 andi=rrespectively . Now consider the relation (CR1) fori=r. By conjugation byσr1· · ·σ1, we getσr1σrσr11ρr=ρrσr1σrσr11 and, then σr1σrρrσr1 =σrρrσr1σr. It follows that the relations of type (CR1) for i=r is equivalent to the relationσr1σrρrσr1=σrρrσr1σr. This last relation is equivalent to relation (BR3) using relation (BR3):

σr1σrρrσr1=σrρrσr1σr ⇐⇒ σr1σrρrσr1ρrσr1=σrρrσr1σrρrσr1 ⇐⇒

σr1σrσr1ρrσr1ρr=σrρrσr1σrρrσr1 ⇐⇒ σrσr1σrρrσr1ρr=σrρrσr1σrρrσr1 ⇐⇒

σr1σrρrσr1ρr=ρrσr1σrρrσr1.

2

Corollary 2.4. ([1]Table 1.1)

Bn0,3)is isomorphic to the Affine Artin group of type B(n˜ + 1) for n2.

Proof. We apply Proposition 2.3 withI={1, n}. 2

Recall that a monoidM is cancellative if the property “∀x, y, z, tM,(xyz=xtz)(y=t)”

holds inM.

Question 2. LetB+n0,p)the monoid defined by the presentation given in Proposition 2.3, con- sidered as a monoid presentation.

(i) Is the monoid Bn+0,p)cancellative ?

(ii) is the natural homomorphism fromB+n0,p)toBn0,p)injective ?

For p = 1 and p = 2, the groups Bn0,p) are isomorphic to the braid group Bn and the Artin-Tits group of type B respectively. Hence, the answer to above questions are positive. In the case of Bn0,3), the answers are also positive (see [7] and [18]). Note that the relations of the presentation of Bn0,p) are homogeneous. Therefore we can define a length function on Bn+0,p) such thatℓ(g1g2) =ℓ(g1) +ℓ(g2) for everyg1, g2Bn+0,p).

3. Braid groups on closed surfaces

In this section, we consider braid groups on closed surfaces, that is without boundary compo- nents. In particular, we prove Corollaries 3.2 and 3.3.

Proposition 3.1. Let n, g be positive integers. The groupBng,0)admits the following presen- tation:

Generators: σ1· · ·, σn1, δ1,· · ·, δ2g;

(7)

Relations

-Braid relations: (BR1) σiσj=σjσi for |ij| ≥2.

(BR2) σiσi+1σi =σi+1σiσi+1 1in1;

-Commutative relation between surface braids:

(CR1) σiδr=δrσi 3in1; 1r2g;

(CR4) σ1δ2r=δr2σ1 1r2g;

σ2δ2r1σ2=δ2r1σ2σ1 1r2g;

σ1δ2rσ2=σ2δ2rσ1 1r2g;

-Skew commutative relations on the handles:

(SCR2)σ1δrδr+2sσ1=δr+2sδr 1r < r+ 2s2g;

(SCR3) δ2rσ1δ2s1δ2rσ1=δ2s1δ22r 1srg;

σ1δ2sδ2r1σ1δ2s=δ22sδ2r1 1s < rg;

-Relation associated to the fundamental group of the surface:

(FGR)2· · ·σn2σn21σn2· · ·σ21δ1δ2· · ·δ2gσ1=δ2g· · ·δ2δ1.

Proof. Starting from the presentation of Theorem A.2, we setσi=θi1,δ2r=b2rθ11andδ2r1= θ1b2r11; we obtain easily the required presentation. 2 Corollary 3.2. Letnandgbe positive integers withg2. Then, the groupBng,0)admits the following group presentation:

Generators: σ1, . . . , σn1, δ1,· · · , δ2g;

Relations:

-Braid relations:

(BR1) σiσj =σjσi for 1i, jn1with |ij| ≥2;

(BR2) σiσi+1σi=σi+1σiσi+1 for 1in1.

- Commutative relations between surface braids:

(CR1) δrσi =σiδr for2< i;1r2g;

(CR4) δr2σ1=σ1δ2r for1r2g;

σ2δ2r1σ2=δ2r1σ2σ1; σ1δ2rσ2=σ2δ2rσ1;

(CR5) (δ2rσ1)(δ2s1δ2s) = (δ2s1δ2s)(δ2rσ1) 1s < rg;

1δ2r)(δ2sδ2s1) = (δ2sδ2s1)(σ1δ2r) 1r < sg;

2rσ1)(δ2r1δ2s) = (δ2r1δ2s)(δ2rσ1) 1s < rg;

1δ2r1)(δ2s1δ2r) = (δ2s1δ2r)(σ1δ2r1) 1r < sg;

-Skew commutative relations on the handles

(SCR2) σ1δrδr+2sσ1=δr+2sδr 1r < r+ 2s2g;

-Relation associated to the fundamental group of the surface (F GR) (σ2· · ·σn2σn21σn2· · ·σ21δ1δ2· · ·δ2gσ1=δ2g· · ·δ2δ1.

Corollary 3.3. Let n be positive integer. Then, the groupBn1,0) admits the following group presentation:

Generators: σ1, . . . , σn1, δ1, δ2;

Références

Documents relatifs

However, many natural questions about word reversing remain open, even in the basic case of the standard presentation of Artin’s braid group B n. There are two types of word

As we saw in the proof of Proposition 32, it suffices to study the subsystems obtained from equation (34) that correspond to the orbits of the action of conjugation by δ.. This

Using Theorem 25, we now identify these groups with those given in the classification of 4-dimensional almost-Bieberbach groups with 2-step nilpotent sub- group given in [De,

As a consequence of Theorem 1.1 and some basic facts about the lower central series of surface braid groups, we give an elementary proof of [11, Theorem 1.2] in Corollary 2.11, and

The following result says that the inclusion of classical mixed braid groups in surface mixed braid groups induces an embedding on the level of metabelian quotients.. As we saw

In [GG5], we showed that the isomorphism classes of the maximal finite subgroups of B n p S 2 q are comprised of cyclic, dicyclic (or generalised quaternion) and binary

We show a simple and easily implementable solution to the word problem for virtual braid groups.. AMS

These groups are subgroups of punctured mapping class groups of closed surfaces and are related to the study of link theory in a closed 3-manifold.. In this paper we define and study