## You are here

Homebraid group

## Primary tabs

# braid group

Let $C_{n}$ be the space of unordered $n$-tuples of distinct points in the complex plane. The braid group $B_{n}$ is the fundamental group of $C_{n}$.

A closed path $\gamma$ on this space is a set of $n$ paths $\gamma_{i}:[0,1]\to\mathbb{C}$ with $\gamma_{i}(t)\neq\gamma_{j}(t)$, and $\gamma_{i}(1)=\gamma_{{\sigma(i)}}(0)$, where $\sigma$ is some permutation of $\{1,\ldots,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 $\phi:B_{n}\to S_{n}$, where $S_{n}$ is the symmetric group on $n$ letters. For $\gamma\in B_{n}$, we get an element of $S_{n}$ from map sending $i\mapsto\gamma_{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 $\phi$ 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 $P_{n}$. Hence, we have a short exact sequence

$1\to P_{n}\to B_{n}\to S_{n}\to 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 $F_{n}(M)=\{(a_{1},\ldots,a_{n})\in M^{n}\mid a_{i}\neq a_{j}\mbox{for}i\neq j\}$. The group $S_{n}$ acts on $F_{n}(M)$ by permuting coordinates, and the corresponding quotient space $C_{n}(M)=F_{n}(M)/S_{n}$ is called the configuration space of $n$ unordered points on $M$. In the case that $M=\mathbb{C}$, we obtain the regular and pure braid groups as $\pi_{1}(C_{n}(M))$ and $\pi_{1}(F_{n}(M))$ respectively.

The group $B_{n}$ 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 $\sigma_{i}$ be the braid that twists strands $i$ and $i+1$, with $i$ passing beneath $i+1$. Then the $\sigma_{i}$ generate $B_{n}$, and the only relations needed are

$\begin{array}[]{cccl}\sigma_{i}\sigma_{j}&=&\sigma_{j}\sigma_{i}&\mbox{for }\>% |i-j|\geq 2,\>1\leq i,j\leq n-1\\ \sigma_{i}\sigma_{{i+1}}\sigma_{i}&=&\sigma_{{i+1}}\sigma_{i}\sigma_{{i+1}}&% \mbox{for }\>1\leq i\leq n-2\\ \end{array}$ |

The pure braid group has a presentation with

$\mbox{generators}a_{{ij}}=\sigma_{{j-1}}\sigma_{{j-2}}\cdots\sigma_{{i+1}}% \sigma_{{i}}^{2}\sigma_{{i+1}}^{{-1}}\cdots\sigma_{{j-2}}^{{-1}}\sigma_{{j-1}}% ^{{-1}}\mbox{ for }1\leq i<j\leq n$ |

that is, $a_{{ij}}$ wraps the ith strand around the jth strand, and defining relations

$a_{{rs}}^{{-1}}a_{{ij}}a_{{rs}}=\begin{cases}a_{{ij}}&\text{if $i<r<s<j\mbox{ % or }r<s<i<j$}\\ a_{{rj}}a_{{ij}}a_{{rj}}^{{-1}}&\text{if $r<i=s<j$}\\ a_{{rj}}a_{{sj}}a_{{ij}}a_{{sj}}^{{-1}}a_{{rj}}^{{-1}}&\text{if $i=r<s<j$}\\ a_{{rj}}a_{{sj}}a_{{rj}}^{{-1}}a_{{sj}}^{{-1}}a_{{ij}}a_{{sj}}a_{{rj}}a_{{sj}}% ^{{-1}}a_{{rj}}^{{-1}}&\text{if $r<i<s<j$}\end{cases}$ |

# 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.

## Mathematics Subject Classification

20F36*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff

## Recent Activity

new question: numerical method (implicit) for nonlinear pde by roozbe

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella