braid group
Let Cn be the space of unordered n-tuples of distinct points in the complex plane. The braid group Bn is the fundamental group
of Cn.
A closed path γ on this space is a set of n paths γi:[0,1]→ℂ with γi(t)≠γj(t), and γi(1)=γσ(i)(0), where σ is some permutation of {1,…,n}. Drawing the graphs of all these paths in 3 space, what we see is n strands between the z=0 and z=1 planes, possibly tangled, with composition
given by stacking these braids on top of each other. Homotopy corresponds to isotopy of the braid, homotopies of the strands such that none of them cross. This is the origin of the name “braid group”
The braid group determines a homomorphism ϕ:Bn→Sn, where Sn is the symmetric group
on n letters. For γ∈Bn, we get an element of Sn from map sending i↦γi(1). This works because of our requirement on the points that the braids start and end, and since our homotopies fix basepoints. The kernel of ϕ consists of the braids that bring each strand to its original order. This kernel gives us the pure braid group on n strands, and is denoted by Pn. Hence, we have a short exact sequence
1→Pn→Bn→Sn→1. |
We can also describe braid groups in more generality. Let M be a manifold. The configuration space of n ordered points on M is defined to be Fn(M)={(a1,…,an)∈Mn∣ai≠ajfori≠j}. The group Sn acts on Fn(M) by permuting coordinates, and the corresponding quotient space Cn(M)=Fn(M)/Sn is called the configuration space of n unordered points on M. In the case that M=ℂ, we obtain the regular
and pure braid groups as π1(Cn(M)) and π1(Fn(M)) respectively.
The group Bn can be given the following presentation. The presentation was given in Artin’s first paper [1] on the braid group. Label the braids 1 through n as before. Let σi be the braid that twists strands i and i+1, with i passing beneath i+1. Then the σi generate Bn, and the only relations
needed are
σiσj=σjσifor |i-j|≥2, 1≤i,j≤n-1σiσi+1σi=σi+1σiσi+1for 1≤i≤n-2 |
The pure braid group has a presentation with
generatorsaij=σj-1σj-2⋯σi+1σ2iσ-1i+1⋯σ-1j-2σ-1j-1 for 1≤i<j≤n |
that is, aij wraps the ith strand around the jth strand, and defining relations
a-1rsaijars={aijif i<r<s<j or r<s<i<jarjaija-1rjif r<i=s<jarjasjaija-1sja-1rjif i=r<s<jarjasja-1rja-1sjaijasjarja-1sja-1rjif r<i<s<j |
References
- 1 E. Artin Theorie der Zöpfe. Abh. Math. Sem. Univ. Hamburg 4(1925), 42-72.
- 2 V.L. Hansen Braids and Coverings. London Mathematical Society Student Texts 18. Cambridge University Press. 1989.
Title | braid group |
---|---|
Canonical name | BraidGroup |
Date of creation | 2013-03-22 13:51:51 |
Last modified on | 2013-03-22 13:51:51 |
Owner | bwebste (988) |
Last modified by | bwebste (988) |
Numerical id | 15 |
Author | bwebste (988) |
Entry type | Topic |
Classification | msc 20F36 |
Synonym | Artin’s braid group |
Related topic | Tangle |
Defines | pure braid group |
Defines | braid |
Defines | configuration space |