Braid group

File:5 Strand Braiding Technique.png

A regular braid on five strands. Each arrow composes two further elements of <math>B_5</math>.

In mathematics, the braid group on Template:Math strands (denoted <math>B_n</math>), also known as the Artin braid group,<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref> is the group whose elements are equivalence classes of [[Braid theory|Template:Mvar-braids]] (e.g. under ambient isotopy), and whose group operation is composition of braids (see Template:Section link). Example applications of braid groups include knot theory, where any knot may be represented as the closure of certain braids (a result known as Alexander's theorem); in mathematical physics where Artin's canonical presentation of the braid group corresponds to the Yang–Baxter equation (see Template:Section link); and in monodromy invariants of algebraic geometry.<ref>Template:Cite journal</ref>

Introduction

In this introduction let Template:Math; the generalization to other values of Template:Math 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 Template:Math and Template:Math is written as Template:Math.

The set of all braids on four strands is denoted by <math>B_4</math>. 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.)

Applications

Braid theory has recently been applied to fluid mechanics, specifically to the field of chaotic mixing in fluid flows. The braiding of (2 + 1)-dimensional space-time trajectories formed by motion of physical rods, periodic orbits or "ghost rods", and almost-invariant sets has been used to estimate the topological entropy of several engineered and naturally occurring fluid systems, via the use of Nielsen–Thurston classification.<ref>Template:Citation</ref><ref>Template:Citation</ref><ref>Template:Citation</ref>

Another field of intense investigation involving braid groups and related topological concepts in the context of quantum physics is in the theory and (conjectured) experimental implementation of the proposed particles anyons. These may well end up forming the basis for error-corrected quantum computing and so their abstract study is currently of fundamental importance in quantum information.

Formal treatment

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

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. Alternatively, one can define the braid group purely algebraically via the braid relations, keeping the pictures in mind only to guide the intuition.

To explain how to reduce a braid group in the sense of Artin to a fundamental group, we consider a connected manifold <math>X</math> of dimension at least 2. The symmetric product of <math>n</math> copies of <math>X</math> means the quotient of <math>X^n</math>, the <math>n</math>-fold Cartesian product of <math>X</math> by the permutation action of the symmetric group on <math>n</math> strands operating on the indices of coordinates. That is, an ordered <math>n</math>-tuple is in the same orbit as any other that is a re-ordered version of it.

A path in the <math>n</math>-fold symmetric product is the abstract way of discussing <math>n</math> points of <math>X</math>, considered as an unordered <math>n</math>-tuple, independently tracing out <math>n</math> strings. Since we must require that the strings never pass through each other, it is necessary that we pass to the subspace <math>Y</math> of the symmetric product, of orbits of <math>n</math>-tuples of distinct points. That is, we remove all the subspaces of <math>X^n</math> defined by conditions <math>x_i = x_j</math> for all <math>1\le i<j\le n</math>. This is invariant under the symmetric group, and <math>Y</math> is the quotient by the symmetric group of the non-excluded <math>n</math>-tuples. Under the dimension condition <math>Y</math> will be connected.

With this definition, then, we can call the braid group of <math>X</math> with <math>n</math> strings the fundamental group of <math>Y</math> (for any choice of base point – this is well-defined up to isomorphism). The case where <math>X</math> is the Euclidean plane is the original one of Artin. In some cases it can be shown that the higher homotopy groups of <math>Y</math> are trivial.

Closed braids

Template:See also When X is the plane, the braid can be closed, i.e., corresponding ends can be connected in pairs, to form a link, i.e., a possibly intertwined union of possibly knotted loops in three dimensions. The number of components of the link can be anything from 1 to n, depending on the permutation of strands determined by the link. A theorem of J. W. Alexander demonstrates that every link can be obtained in this way as the "closure" of a braid. Compare with string links.

Different braids can give rise to the same link, just as different crossing diagrams can give rise to the same knot. In 1935, Andrey Markov Jr. described two moves on braid diagrams that yield equivalence in the corresponding closed braids.<ref>Template:Citation</ref> A single-move version of Markov's theorem, was published by in 1997.<ref>Template:Citation</ref>

Vaughan Jones originally defined his polynomial as a braid invariant and then showed that it depended only on the class of the closed braid.

The Markov theorem gives necessary and sufficient conditions under which the closures of two braids are equivalent links.<ref>Template:Citation</ref>

Braid index

The "braid index" is the least number of strings needed to make a closed braid representation of a link. It is equal to the least number of Seifert circles in any projection of a knot.<ref name="Wolfram">{{#invoke:citation/CS1|citation |CitationClass=web }}</ref>

History

Braid groups were introduced explicitly by Emil Artin in 1925, although (as Wilhelm Magnus pointed out in 1974<ref>Template:Cite book</ref>) they were already implicit in Adolf Hurwitz's work on monodromy from 1891.

Braid groups may be described by explicit presentations, as was shown by Emil Artin in 1947.<ref name=Artin47>Template:Cite journal</ref> Braid groups are also understood by a deeper mathematical interpretation: as the fundamental group of certain configuration spaces.<ref name=Artin47/>

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.<ref>Template:Cite journal</ref>

Basic properties

Generators and relations

Consider the following three braids:

File:Braid s1r.png	File:Braid s2r.png	File:Braid s3r.png
<math>\sigma_1</math>	<math>\sigma_2</math>	<math>\sigma_3</math>

Every braid in <math>B_4</math> can be written as a composition of a number of these braids and their inverses. In other words, these three braids generate the group <math>B_4</math>. To see this, an arbitrary braid is scanned from left to right for crossings. Numbering the strands beginning at the top, whenever a crossing of strands <math>i</math> and <math>i+1</math> is encountered, <math>\sigma_i</math> or <math>\sigma_i^{-1}</math> is written down, depending on whether strand <math>i</math> moves over or under strand <math>i+1</math>. Upon reaching the right end, the braid has been written as a product of the <math>\sigma_i</math> and their inverses.

It is clear that

(i) <math>\sigma_1 \sigma_3 = \sigma_3 \sigma_1</math>,

while the following two relations are not quite as obvious:

(iia) <math>\sigma_1 \sigma_2 \sigma_1 = \sigma_2 \sigma_1 \sigma_2</math>,

(iib) <math>\sigma_2 \sigma_3 \sigma_2 = \sigma_3 \sigma_2 \sigma_3</math>

(these relations can be appreciated best by drawing the braid on a piece of paper). It can be shown that all other relations among the braids <math>\sigma_1</math>, <math>\sigma_2</math> and <math>\sigma_3</math> already follow from these relations and the group axioms.

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

<math>B_n= \left \langle \sigma_1,\ldots,\sigma_{n-1}\mid \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, </math>

where in the first group of relations <math>1 \le i\le n-2</math> and in the second group of relations <math>|i-j|\ge 2</math>.<ref>Template:Cite arXiv</ref><ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref> 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 equations.

Further properties

• The braid group <math>B_1</math> is trivial, <math>B_2</math> is the infinite cyclic group <math>\Z</math>, and <math>B_3</math> is isomorphic to the knot group of the trefoil knot – in particular, it is an infinite non-abelian group.
• The Template:Math-strand braid group <math>B_n</math> embeds as a subgroup into the <math>(n+1)</math>-strand braid group <math>B_{n+1}</math> by adding an extra strand that does not cross any of the first Template:Math strands. The increasing union of the braid groups with all <math>n \ge 1</math> is the infinite braid group <math>B_{\infty}</math>.
• All non-identity elements of <math>B_n</math> have infinite order; i.e., <math>B_n</math> is torsion-free.
• There is a left-invariant linear order on <math>B_n</math> called the Dehornoy order.
• For <math>n\ge 3</math>, <math>B_n</math> contains a subgroup isomorphic to the free group on two generators.
• There is a homomorphism <math>B_n \to \Z</math> defined by Template:Math. So for instance, the braid Template:Math is mapped to Template:Math. This map corresponds to the abelianization of the braid group. Since Template:Math, then Template:Math is the identity if and only if <math>k=0</math>. This proves that the generators have infinite order.

Interactions

Relation with symmetric group and the pure braid group

By forgetting how the strands twist and cross, every braid on Template:Math strands determines a permutation on Template:Math elements. This assignment is onto and compatible with composition, and therefore becomes a surjective group homomorphism Template:Math from the braid group onto the symmetric group. The image of the braid σ_i ∈ Template:Math is the transposition Template:Math. 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:

<math>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. </math>

The kernel of the homomorphism Template:Math is the subgroup of Template:Math called the pure braid group on Template:Math strands and denoted Template:Math. This can be seen as the fundamental group of the space of Template:Math-tuples of distinct points of the Euclidean plane. In a pure braid, the beginning and the end of each strand are in the same position. Pure braid groups fit into a short exact sequence

<math>1\to F_{n-1} \to P_n \to P_{n-1}\to 1.</math>

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

File:Braid-modular-group-cover.svg

<math>B_3</math> is the universal central extension of the modular group.

The braid group <math>B_3</math> is the universal central extension of the modular group <math>\mathrm{PSL}(2, \Z)</math>, with these sitting as lattices inside the (topological) universal covering group

<math>\overline{\mathrm{SL}(2,\R)} \to \mathrm{PSL}(2,\R)</math>.

Furthermore, the modular group has trivial center, and thus the modular group is isomorphic to the quotient group of <math>B_3</math> modulo its center, <math>Z(B_3),</math> and equivalently, to the group of inner automorphisms of <math>B_3</math>.

Here is a construction of this isomorphism. Define

<math>a = \sigma_1 \sigma_2 \sigma_1, \quad b = \sigma_1 \sigma_2</math>.

From the braid relations it follows that <math>a^2 = b^3</math>. Denoting this latter product as <math>c</math>, one may verify from the braid relations that

<math>\sigma_1 c \sigma_1^{-1} = \sigma_2 c \sigma_2^{-1}=c</math>

implying that <math>c</math> is in the center of <math>B_3</math>. Let <math>C</math> denote the subgroup of <math>B_3</math> generated by Template:Math, since Template:Math, it is a normal subgroup and one may take the quotient group Template:Math. We claim Template:Math; this isomorphism can be given an explicit form. The cosets Template:Math and Template:Math map to

<math>\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}</math>

where Template:Math and Template:Math 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

<math>\langle v,p\, |\, v^2=p^3=1\rangle</math>

where

<math>v=\begin{bmatrix}0 & 1 \\ -1 & 0 \end{bmatrix}, \qquad p=\begin{bmatrix}0 & 1 \\ -1 & 1 \end{bmatrix}.</math>

Mapping Template:Math to Template:Math and Template:Math to Template:Math yields a surjective group homomorphism Template:Math.

The center of Template:Math is equal to Template:Math, a consequence of the facts that Template:Math is in the center, the modular group has trivial center, and the above surjective homomorphism has kernel Template:Math.

Relationship to the mapping class group and classification of braids

The braid group Template:Math can be shown to be isomorphic to the mapping class group of a punctured disk with Template:Math 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 Template:Math, 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 Template:Math in terms of the generators Template:Math. (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 Template:Math 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.

In addition to the word problem, there are several known hard computational problems that could implement braid groups, applications in cryptography have been suggested.<ref>Template:Cite arXiv</ref>

Actions

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

<math> \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 ). </math>

Thus the elements Template:Math and Template:Math exchange places and, in addition, Template:Math is twisted by the inner automorphism corresponding to Template:Math – this ensures that the product of the components of Template:Math remains the identity element. It may be checked that the braid group relations are satisfied and this formula indeed defines a group action of Template:Math on Template:Math. 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 Template:Math 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 Template:Math. 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, Chetan Nayak and Frank Wilczek posited that in analogy to projective representations of Template:Math, the projective representations of the braid group have a physical meaning for certain quasiparticles in the fractional quantum hall effect.<ref>Template:Citation Some of Wilczek-Nayak's proposals subtly violate known physics; see the discussion Template:Citation</ref> Around 2001 Stephen Bigelow and Daan Krammer independently proved that all braid groups are linear. Their work used the Lawrence–Krammer representation of dimension <math>n(n-1)/2</math> depending on the variables Template:Math and Template:Math. By suitably specializing these variables, the braid group <math>B_n</math> 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 to take the direct limit of braid groups, where the attaching maps <math>f \colon B_n \to B_{n+1}</math> send the <math>n-1</math> generators of <math>B_{n}</math> to the first <math>n-1</math> generators of <math>B_{n+1}</math> (i.e., by attaching a trivial strand). This group, however, admits no metrizable topology while remaining continuous.

Paul Fabel has shown that there are two topologies that can be imposed on the resulting group each of whose completion yields a different group.<ref>

• Template:Citation
• Template:Citation</ref> The first 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 <math>(0, 1/n)</math> and the set of all braids—where a braid is defined to be a collection of paths from the points <math>(0, 1/n, 0)</math> to the points <math>(0, 1/n, 1)</math> 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 <math>P_n</math> and to the fundamental group of the Hilbert cube minus the set

<math>\{(x_i)_{i\in \mathbb{N}} \mid x_i=x_j\text{ for some }i\ne j\}.</math>

Cohomology

The cohomology of a group <math>G</math> is defined as the cohomology of the corresponding Eilenberg–MacLane classifying space, <math>K(G, 1)</math>, which is a CW complex uniquely determined by <math>G</math> up to homotopy. A classifying space for the braid group <math>B_n</math> is the Template:Var^th unordered configuration space of <math>\R^2</math>, that is, the space of all sets of <math>n</math> distinct unordered points in the plane:<ref>Template:Cite book</ref>

<math>\operatorname{UConf}_n(\R^2) = \{ \{u_1, ..., u_n\} : u_i \in \R^2, u_i \neq u_j \text{ for } i \neq j \}</math>.

So by definition

The calculations for coefficients in <math>\Z/2\Z</math> can be found in Fuks (1970).<ref>Template:Cite journal</ref>

Similarly, a classifying space for the pure braid group <math>P_n</math> is <math>\operatorname{Conf}_n(\R^2)</math>, the Template:Var^th ordered configuration space of <math>\R^2</math>. In 1968 Vladimir Arnold showed that the integral cohomology of the pure braid group <math>P_n</math> is the quotient of the exterior algebra generated by the collection of degree-one classes <math>\omega_{ij} \; \; 1 \leq i < j \leq n</math>, subject to the relations<ref>Template:Cite journal</ref>

<math>\omega_{k,\ell} \omega_{\ell,m} + \omega_{\ell,m} \omega_{m,k} + \omega_{m,k} \omega_{k,\ell} =0.</math>

See also

• Artin–Tits group
• Braided monoidal category
• Braided vector space
• Braided Hopf algebra
• Knot theory
• Non-commutative cryptography
• Spherical braid group

References

<references/>

Further reading

• Template:Citation. In Template:Harvnb
• Template:Citation
• Template:SpringerEOM
• Template:Citation
• Template:Citation
• Template:Citation
• Template:Citation

External links

• Template:Planetmath reference
• CRAG: CRyptography and Groups computation library from the Stevens University's Algebraic Cryptography Center
• Template:Cite serial
• {{#invoke:citation/CS1|citation

|CitationClass=web }}

• Template:Citation
• Template:Cite AV media
• Template:Cite serial expanded further in Behind the Math of "Dance Your PhD," Part 1: The Braid Groups.