S. D. V. Stephens

notes / Studies in Algebra and Group Theory / chapter 8: Presentations and the Modular Group / From my book

B12.3 The Braid Group

12.3.1 Definition and Braid Diagrams

Definition 12.3.1 (Braid group). For , the braid group on strands is

This is the presentation of in Theorem 3.6.18 without the relations . Two homomorphisms come straight from Proposition 3.6.14:

  • , , which is surjective because the adjacent transpositions generate . Its kernel is called the pure braid group .
  • , : both sides of each relation have the same number of letters. It sends to , so for the generator has infinite order and is infinite. In particular in .

Braids are best understood as pictures. A braid on strands consists of strands in space joining points on a top line to points on a bottom line, each strand moving steadily downward; in a drawing, one strand passes over the other at each crossing. Two braids are the same if one can be deformed into the other without moving the endpoints and without strands passing through each other (an isotopy). The generator is the braid in which the strand at position crosses over the strand at position , and is the one in which it crosses under:

Three-strand braid diagrams for the generators s1, its inverse, and s2.

As for permutations, the picture of a product is the picture of placed above that of . The relations of hold for pictures: because the two crossings can be pulled apart; for because crossings of strands far apart slide past each other; and the braid relation is the isotopy below, in which the middle strand slides across the crossing of the other two.

The braid relation: the three-strand braids s1s2s1 and s2s1s2 side by side with an equals sign.

Conversely, one can show that every braid is isotopic to a product of the , and that two products give isotopic braids only when they are equal in ; so is exactly the group of braids on strands. We will not prove this. The homomorphism forgets which strand passes over which and records only where each strand ends, so consists of the braids in which every strand ends where it started.

12.3.2 Closures of Braids

Definition 12.3.2 (Closure of a braid). The closure of a braid is obtained by joining each bottom endpoint to the top endpoint directly above it by an arc running around the right side of the picture, without creating new crossings.

The closure of a braid is a collection of closed curves in space: a knot if it is a single curve, and a link otherwise. For example, the closure of is the trefoil knot:

Diagram

Note. Markov’s theorem connects braids to knot theory. Every knot or link in is isotopic to the closure of a braid, and two braids have isotopic closures if and only if they are related by a sequence of moves of two kinds: conjugation, which replaces by with ; and stabilization, which replaces by , where sits inside as the braids in which the last strand runs straight down.

12.3.3 Permutation Braids and the Garside Normal Form

is much larger than , but its algorithmic questions can be approached by the method of Section 12.2. We describe the result without proofs.

A permutation braid is a braid in which any two strands cross at most once and every crossing is positive, that is, of the kind in rather than . For each there is exactly one permutation braid whose strands end at the positions given by : it is the product of the generators along any shortest word for . So permutation braids are in bijection with , and the starting and ending sets of are defined to be those of .

Let be the longest permutation braid, where is the longest element of (Corollary 12.2.4); in , , pictured above. Every lies in the starting set of , so for some permutation braid , and is again a permutation braid. Hence each is a permutation braid times . Moreover for every , so conjugation by permutes the generators, and powers of can be moved to the left of any word. Consequently every can be written as Moving letters to the left whenever possible, we can arrange that for each , the starting set of is contained in the ending set of . Otherwise the first letter of some shortest word for could be moved to the end of , and would still be a permutation braid. With as large as possible and no trivial, this expression is unique. It is the Garside normal form (Garside, 1969; Thurston and Elrifai–Morton, early 1990s), and computing it solves the word problem in .