0% found this document useful (0 votes)
84 views2 pages

Braid Groups and Their Applications

Uploaded by

Cù Băm
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
84 views2 pages

Braid Groups and Their Applications

Uploaded by

Cù Băm
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Princeton Companion to Mathematics Proof 1

1 1
Braid Groups
By F. E. A. Johnson
2 2
Take two parallel planes, each punctured at
n points. Label the holes 1 to n in each plane, and
run a string from each hole in the first plane to one 3 3
in the second, in such a way that no two strings go

} }
to the same hole. The result is an n-braid. Two X
different 3-braids, shown in two-dimensional pro-
jection in a similar manner to knot diagrams, are 1 1
given in Figure 1.1 (cross-reference to ‘knots’).
As the diagrams suggest, we insist that the
strings go from left to right without “doubling 2 2
back”; so for example a knotted string is not
allowed.
In describing the “same” braid in different ways,
a certain freedom is allowed. Subject to the restric- 3 3
tions that string ends remain fixed and that strings Y
neither break nor pass through each other, strings
are allowed to stretch, contract, bend, and other- Figure 1.1. Two 3-braids.
wise move about in three dimensions. This notion
of “sameness” is called “braid isotopy.” 1 1
Braids may be composed as follows: arrange a
pair of braids end to end to abut in a common
(middle) plane; join up the strings and remove the
middle plane. For X, Y above, the composition 2 2
XY is given in Figure 1.2.
With this notion of composition, n-braids form
a group Bn . In the above example, Y = X −1 , since 3 3
by “pulling all strings tight” XY is isotopic to the
}
}
trivial braid (Figure 1.3), which acts as the iden- X Y
tity.
As a group, Bn is generated by elements Figure 1.2. Braid composition.
(σi )1in−1 , where σi is formed from the trivial
braid by crossing the ith string over the (i + 1)st
as in Figure 1.4. The reader may perceive a similar- Artin showed that multiplication in Bn is com-
ity between the σi and the adjacent transpositions pletely described by the relations
which generate the group Sn of permutations of
σi σj = σj σi (|i − j|  2),
{1, . . . , n}. Indeed, any braid determines a permu-
tation by the rule σ i i+1 σi = σi+1 σi σi+1 .
σ

i → right hand label of ith string. These relations have subsequently acquired impor-
tance in statistical physics, where they are known
Ignoring all behaviour except that at the ends gives as the “Yang–Baxter equations.”
a surjective homomorphism Bn → Sn , which maps In groups defined by generators and relations it
σi to the transposition (i, i + 1). This is not an is usually difficult (there being no method which
isomorphism, however, as Bn is infinite. In fact, σi works uniformly in all cases) to decide whether
has infinite order, whereas (i, i + 1)2 = Id. In his an arbitrary word in the generators represents
celebrated 1925 paper “Theorie der Zöpfe,” Emil the identity element (cross-reference to ‘word
2 Princeton Companion to Mathematics Proof

1 1

2 2

3 3

Figure 1.3. The trivial braid.

i−1 i−1

i i

i+1 i+1

i+2 i+2
}
σi

Figure 1.4. The generator σi .

problem’). For Bn , Artin solved this problem geo-


metrically, by “combing the braid.” An alterna-
tive algebraic method, due to Garside (1967), also
decides when two elements in Bn are conjugate.
In relation to the decidability of such questions,
and in many other respects, braid groups display
close affinities with linear groups; that is, groups
in which all elements behave as if they were invert-
ible N × N matrices. Although such similarities
suggested that it should be possible to prove that
braid groups genuinely are linear, the problem of
doing so remained unsolved for many years, until
in 2001 a proof was eventually found by Bigelow
and independently by Krammer.
The groups described here are, strictly speak-
ing, braid groups of the plane, the plane being
the object punctured. Other braid groups also
occur, often in surprising contexts. The connec-
tion with statistical physics has already been men-
tioned. They arise also in algebraic geometry, when
algebraic curves become punctured by discard-
ing exceptional points. Thus, though originating
in topology, braids may intervene significantly in
problems, for example “constructive Galois the-
ory,” which seem, at first sight, to be purely alge-
braic.

Common questions

Powered by AI

In algebraic geometry, braid groups play roles when considering algebraic curves that become punctured by exceptional points, influencing the determination of monodromy representations that elucidate covering map properties and Galois connections. In statistical physics, braid groups are connected through the Yang-Baxter equations, which are essential in understanding particle interactions and statistical models. These applications show braid groups as bridges connecting topology with other mathematical fields, revealing deeper symmetries and solving high-dimensional problems beyond their original topological context .

Braids and knots are fundamentally different due to braids requiring specific endpoints fixed on parallel planes, which prohibits any one string going back on itself, while knots are closed and do not have fixed endpoints. They are similar in their dimensional projection, as both can be represented visually using two-dimensional diagrams where the over and under crossings denote the spatial relation between strands. Braids can transform into knots by joining corresponding endpoints, creating a closed loop. Thus, while they retain unique topological properties, the visualization technique and compositional similarities link them .

Braid groups demonstrate a connection to linear groups because they exhibit structural properties analogous to those found in groups of invertible matrices. For example, like linear groups, elements in braid groups can display behaviors as if they possess invertible matrix characteristics, especially in solving algebraic and geometric problems. Although considered topological constructs, the operation and properties of braid groups have lead Garside and, later, Bigelow and Krammer, to show they can be represented as linear groups, confirming their broad mathematical applicability across different contexts .

The fundamental structural difference between a braid group Bn and the permutation group Sn is that Bn is infinite while Sn is finite. Specifically, in Bn, the generators σi have infinite order, whereas, in Sn, the elementary transpositions have a finite order of 2 ((i, i+1)² = Id). This infinite nature stems from the fact that braid groups describe more complex interweaving behaviors compared to mere permutations where each element eventually returns to its starting point after a finite number of transpositions .

Emil Artin's paper "Theorie der Zöpfe" provided foundational insights into the structure of braid groups, particularly by establishing how multiplication within these groups is defined by specific relations such as σiσj = σjσi (|i − j| ≥ 2) and σiσi+1σi = σi+1σiσi+1. These relations laid down the basis for later developments in algebraic representation and problem-solving within braid groups. Artin’s work elucidated how braids could transform and combine, a theory now central to both mathematical theory and practical applications like in statistical mechanics .

Braid isotopy contributes to defining "sameness" by providing a set of allowable moves — stretching, contracting, bending — that can transform a braid without changing its essential structure, so long as the endpoints remain fixed and strands do not intersect each other. This concept allows two braids to be considered equivalent if one can be transformed into the other through these isotopic moves, thereby maintaining the braid’s overall topology. This formalization creates a structured framework within which braids can be classified and compared .

Braid groups Bn are considered non-isomorphic to the symmetric group Sn because, although there is a surjective homomorphism from Bn to Sn (mapping braid generators σi to the transpositions (i, i+1)), Bn has infinite order for each braid generator σi, whereas Sn is finite with each transposition having an order of 2. That means the braid's algebraic complexity and topology cannot be captured entirely by the finite nature of symmetric groups, affirming a wider range of structural possibilities within braid groups .

The significance of Bigelow and Krammer's work lies in their proof that braid groups can genuinely be represented as linear groups. This resolved a long-standing question, confirming that the abstract algebraic properties and complex interactions in braid groups could be represented by matrices, thereby expanding their applicability and understanding in both theoretical investigations and practical affairs. Their work showed how braid behavior could be embedded within linear algebra, offering concrete tools for handling apparent topological complexities .

Braid composition differs from standard group composition in its geometric complexity. In braids, composition involves physically joining two braids end-to-end by abutting the strings in a common middle plane and then removing it. This operation is non-commutative and sensitive to the spatial order and interweaving of strands, unlike typical group operations, which are more abstract and algebraically defined. The composition specifically respects the topological rules set by braid isotopy, maintaining the integrity of the string connections without intersections or endpoint violations .

The Yang-Baxter equations are important relations in statistical mechanics and the algebraic study of braid groups. These equations describe the important property of braid relations, specifically the interactions and order of crossing strands in a way that is consistent with the group's axioms. In the context of braid groups, these equations manifest as the relations σiσj = σjσi for |i − j| ≥ 2 and σiσi+1σi = σi+1σiσi+1, governing the non-commutative structure of braids to ensure consistent solutions across different mathematical and physical systems .

You might also like