Braid group

In mathematics, the braid group on n strands, denoted by B_n, is a group that generalizes the symmetric group S_n. Here, n is a natural number, representing a number of points to be permuted. Each element of the symmetric group defines a permutation of these points from the initial to final configuration. An element of the braid group describes the initial and final configuration of these points, as well as how to get there by continuously moving the initial points to their final configurations. If n > 1, then B_n is an infinite group.

Braid groups find applications in knot theory, since any knot may be represented as the closure of certain braids.

Introduction

Intuitive description

In this introduction let n = 4; the generalization to other values of n will be straightforward. Consider two sets of four items lying on a table, with the items in each set being arranged in a vertical line, and such that one set sits next to the other. (In the illustrations below, these are the black dots.) Using four strands, each item of the first set is connected with an item of the second set so that a one-to-one correspondence results. Such a connection is called a braid. Often some strands will have to pass over or under others, and this is crucial: the following two connections are different braids:

The braid sigma_1^(-1)

is different from

The braid sigma_1

On the other hand, two such connections which can be made to look the same by "pulling the strands" are considered the same braid:

The braid sigma_1^(-1)

is the same as

Another representation of sigma_1^(-1)

All strands are required to move from left to right; knots like the following are not considered braids:

Not a braid

is not a braid

Any two braids can be composed by drawing the first next to the second, identifying the four items in the middle, and connecting corresponding strands:

File:Braid s3.png

composed with

File:Braid s2.png

yields

File:Braid s3s2.png

Another example:

File:Braid s1 inv s3 inv.png

composed with

File:Braid s1 s3 inv.png

yields

File:Braid s3 inv squared.png

The composition of the braids σ and τ is written as στ.

The set of all braids on four strands is denoted by B₄. The above composition of braids is indeed a group operation. The identity element is the braid consisting of four parallel horizontal strands, and the inverse of a braid consists of that braid which "undoes" whatever the first braid did, which is obtained by flipping a diagram such as the ones above across a vertical line going through its centre. (The first two example braids above are inverses of each other.)

Formal treatment

To put the above informal discussion of braid groups on firm ground, one needs to use the homotopy concept of algebraic topology, defining braid groups as fundamental groups of a configuration space. This is outlined in the article on braid theory.

Alternatively, one can define the braid group purely algebraically via the braid relations, keeping the pictures in mind only to guide the intuition.

History

Braid groups were introduced explicitly by Emil Artin in 1925, although (as Wilhelm Magnus pointed out in 1974) they were already implicit in Adolf Hurwitz's work on monodromy (1891). In fact, as Magnus says, Hurwitz gave the interpretation of a braid group as the fundamental group of a configuration space (cf. braid theory), an interpretation that was lost from view until it was rediscovered by Ralph Fox and Lee Neuwirth in 1962.

Basic properties

Generators and relations

Consider the following three braids:

File:Braid s1.png	File:Braid s2.png	File:Braid s3.png
σ1	σ2	σ3

Every braid in B₄ can be written as a composition of a number of these braids and their inverses. In other words, these three braids generate the group B₄. To see this, an arbitrary braid is scanned from left to right for crossings; beginning at the top, whenever a crossing of strands i and i + 1 is encountered, σ_i or σ_i⁻¹ is written down, depending on whether strand i moves under or over strand i + 1. Upon reaching the right hand end, the braid has been written as a product of the σ's and their inverses.

It is clear that

(i) σ₁σ₃ = σ₃σ₁,

while the following two relations are not quite as obvious:

(iia) σ₁σ₂σ₁ = σ₂σ₁σ₂,

(iib) σ₂σ₃σ₂ = σ₃σ₂σ₃

(these can be appreciated best by drawing the braid on a piece of paper). It can be shown that all other relations among the braids σ₁, σ₂ and σ₃ already follow from these relations and the group axioms.

Generalising this example to n strands, the group B_n can be abstractly defined via the following presentation:

$B_n= \left \langle \sigma_1,\ldots,\sigma_{n-1}| \sigma_i\sigma_{i+1}\sigma_i=\sigma_{i+1}\sigma_i\sigma_{i+1}, \sigma_i\sigma_j=\sigma_j\sigma_i \right \rangle,$

where in the first group of relations 1 ≤ i ≤ n−2 and in the second group of relations, |i − j| ≥ 2. This presentation leads to generalisations of braid groups called Artin groups. The cubic relations, known as the braid relations, play an important role in the theory of Yang–Baxter equation.

Further properties

• The braid group B₁ is trivial, B₂ is an infinite cyclic group Z, and B₃ is isomorphic to the knot group of the trefoil knot – in particular, it is an infinite non-abelian group.
• The n-strand braid group B_n embeds as a subgroup into the (n+1)-strand braid group B_n+1 by adding an extra strand that does not cross any of the first n strands. The increasing union of the braid groups with all n ≥ 1 is the infinite braid group B_∞.
• All non-identity elements of B_n have infinite order; i.e., B_n is torsion-free.
• There is a left-invariant linear order on B_n called the Dehornoy order.
• For n ≥ 3, B_n contains a subgroup isomorphic to the free group on two generators.
• There is a homomorphism B_n → Z defined by σ_i ↦ 1. So for instance, the braid σ₂σ₃σ₁⁻¹σ₂σ₃ is mapped to 1 + 1 − 1 + 1 + 1 = 3. This map corresponds to the abelianization of the braid group.

Interactions of braid groups

Relation with symmetric group and the pure braid group

By forgetting how the strands twist and cross, every braid on n strands determines a permutation on n elements. This assignment is onto, compatible with composition, and therefore becomes a surjective group homomorphism B_n → S_n from the braid group into the symmetric group. The image of the braid σ_i ∈ B_n is the transposition s_i = (i, i+1) ∈ S_n. These transpositions generate the symmetric group, satisfy the braid group relations, and have order 2. This transforms the Artin presentation of the braid group into the Coxeter presentation of the symmetric group:

$S_n = \left \langle s_1,\ldots,s_{n-1}| s_i s_{i+1} s_i=s_{i+1} s_i s_{i+1}, s_i s_j = s_j s_i \text{ for } |i-j|\geq 2, s_i^2=1 \right\rangle.$

The kernel of the homomorphism B_n → S_n is the subgroup of B_n called the pure braid group on n strands and denoted P_n. In a pure braid, the beginning and the end of each strand are in the like positions. Pure braid groups fit into a short exact sequence

$1\to F_{n-1} \to P_n \to P_{n-1}\to 1.$

This sequence splits and therefore pure braid groups are realized as iterated semi-direct products of free groups.

Relation between B₃ and the modular group

B₃ is the universal central extension of the modular group.

The braid group B₃ is the universal central extension of the modular group PSL(2, Z), with these sitting as lattices inside the (topological) universal covering group

$\overline{\mathrm{SL}(2,\mathbf{R})} \to \mathrm{PSL}(2,\mathbf{R}).$

Furthermore, the modular group has trivial center, and thus the modular group is isomorphic to the quotient group of B₃ modulo its center, Z(B₃), and equivalently, to the group of inner automorphisms of B₃.

Here is a construction of this isomorphism. Define

$a = \sigma_1 \sigma_2 \sigma_1, \quad b = \sigma_1 \sigma_2.$

From the braid relations it follows that a² = b³. Denoting this latter product as c, one may verify from the braid relations that

$\sigma_1 c \sigma_1^{-1} = \sigma_2 c \sigma_2^{-1}=c$

implying that c is in the center of B₃. Let C denote the subgroup of B₃ generated by c, since C ⊂ Z(B₃), it is a normal subgroup and one may take the quotient group B₃/C. We claim B₃/C ≅ PSL(2, Z); this isomorphism can be given an explicit form. The cosets σ₁C and σ₂C map to

$\sigma_1C \mapsto R=\begin{bmatrix}1 & 1 \\ 0 & 1 \end{bmatrix} \qquad \sigma_2C \mapsto L^{-1}=\begin{bmatrix}1 & 0 \\ -1 & 1 \end{bmatrix}$

where L and R are the standard left and right moves on the Stern-Brocot tree; it is well known that these moves generate the modular group.

Alternately, one common presentation for the modular group is

$\langle v,p\, |\, v^2=p^3=1\rangle$

where

$v=\begin{bmatrix}0 & 1 \\ -1 & 0 \end{bmatrix}, \qquad p=\begin{bmatrix}0 & 1 \\ -1 & 1 \end{bmatrix}.$

Mapping a to v and b to p yields a surjective group homomorphism B₃ → PSL(2, Z).

The center of B₃ is equal to C, a consequence of the facts that c is in the center, the modular group has trivial center, and the above surjective homomorphism has kernel C.

Relationship to the mapping class group and classification of braids

The braid group B_n can be shown to be isomorphic to the mapping class group of a punctured disk with n punctures. This is most easily visualized by imagining each puncture as being connected by a string to the boundary of the disk; each mapping homomorphism that permutes two of the punctures can then be seen to be a homotopy of the strings, that is, a braiding of these strings.

Via this mapping class group interpretation of braids, each braid may be classified as periodic, reducible or pseudo-Anosov.

Connection to knot theory

If a braid is given and one connects the first left-hand item to the first right-hand item using a new string, the second left-hand item to the second right-hand item etc. (without creating any braids in the new strings), one obtains a link, and sometimes a knot. Alexander's theorem in braid theory states that the converse is true as well: every knot and every link arises in this fashion from at least one braid; such a braid can be obtained by cutting the link. Since braids can be concretely given as words in the generators σ_i, this is often the preferred method of entering knots into computer programs.

Computational aspects

The word problem for the braid relations is efficiently solvable and there exists a normal form for elements of B_n in terms of the generators σ₁, ..., σ_n−1. (In essence, computing the normal form of a braid is the algebraic analogue of "pulling the strands" as illustrated in our second set of images above.) The free GAP computer algebra system can carry out computations in B_n if the elements are given in terms of these generators. There is also a package called CHEVIE for GAP3 with special support for braid groups. The word problem is also efficiently solved via the Lawrence-Krammer representation.

Since there are nevertheless several hard computational problems about braid groups, applications in cryptography have been suggested.

Actions of braid groups

In analogy with the action of the symmetric group by permutations, in various mathematical settings there exists a natural action the braid group on n-tuples of objects or on the n-folded tensor product that involves some "twists". Consider an arbitrary group G and let X be the set of all n-tuples of elements of G whose product is the identity element of G. Then B_n acts on X in the following fashion:

$\sigma_i \left (x_1,\ldots,x_{i-1},x_i, x_{i+1},\ldots, x_n \right)= \left (x_1,\ldots, x_{i-1}, x_{i+1}, x_{i+1}^{-1}x_i x_{i+1}, x_{i+2},\ldots,x_n \right ).$

Thus the elements x_i and x_i+1 exchange places and, in addition, x_i is twisted by the inner automorphism corresponding to x_i+1 — this ensures that the product of the components of x remains the identity element. It may be checked that the braid group relations are satisfied and this formula indeed defines a group action of B_n on X. As another example, a braided monoidal category is a monoidal category with a braid group action. Such structures play an important role in modern mathematical physics and lead to quantum knot invariants.

Representations

Elements of the braid group B_n can be represented more concretely by matrices. One classical such representation is Burau representation, where the matrix entries are single variable Laurent polynomials. It had been a long-standing question whether Burau representation was faithful, but the answer turned out to be negative for n ≥ 5. More generally, it was a major open problem whether braid groups were linear. In 1990, Ruth Lawrence described a family of more general "Lawrence representations" depending on several parameters. In 1996, C. Nayak and Frank Wilczek posited that in analogy to projective representations of SO(3), the projective representations of the braid group have a physical meaning for certain quasiparticles in the fractional quantum hall effect. Around 2001 Stephen Bigelow and Daan Krammer independently proved that all braid groups are linear. Their work used the Lawrence–Krammer representation of dimension n(n−1)/2 depending on the variables q and t. By suitably specializing these variables, the braid group B_n may be realized as a subgroup of the general linear group over the complex numbers.

Infinitely generated braid groups

There are many ways to generalize this notion to an infinite number of strands. The simplest way is take the direct limit of braid groups, where the attaching maps f : B_n → B_n+1 send the n−1 generators of B_n to the first n−1 generators of B_n+1 (i.e., by attaching a trivial strand). Fabel has shown that there are two topologies that can be imposed on the resulting group each of whose completion yields a different group. One is a very tame group and is isomorphic to the mapping class group of the infinitely punctured disk — a discrete set of punctures limiting to the boundary of the disk.

The second group can be thought of the same as with finite braid groups. Place a strand at each of the points (0, 1/n) and the set of all braids — where a braid is defined to be a collection of paths from the points (0, 1/n, 0) to the points (0, 1/n, 1) so that the function yields a permutation on endpoints — is isomorphic to this wilder group. An interesting fact is that the pure braid group in this group is isomorphic to both the inverse limit of finite pure braid groups P_n and to the fundamental group of the Hilbert cube minus the set

$\{(x_i)_{i\in \Bbb{N}} \mid x_i=x_j\text{ for some }i\ne j\}.$

See also

• Non-commutative cryptography

Further reading

• . In Menasco & Thistlethwaite 2005

External links

• Braid group at PlanetMath.org.
• CRAG: CRyptography and Groups at Algebraic Cryptography Center Contains extensive library for computations with Braid Groups
• Stephen Bigelow's exploration of B5 Java applet.
• — connection of projective braid group representations to the fractional quantum Hall effect
• Presentation for FradkinFest by C. V. Nayak [1]
• — criticism of the reality of Wilczek-Nayak representation
• Braid group: List of Authority Articles on arxiv.org.fr:Tresses (mathématiques)