Burau representation
In mathematics the Burau representation is a representation of the braid groups, named after and originally studied by the German mathematician Werner Burau[1] during the 1930s. The Burau representation has two common and near-equivalent formulations, the reduced and unreduced Burau representations.
Definition

Consider the braid group Template:Math to be the mapping class group of a disc with Template:Mvar marked points Template:Math. The homology group Template:Math is free abelian of rank Template:Mvar. Moreover, the invariant subspace of Template:Math (under the action of Template:Math) is primitive and infinite cyclic. Let Template:Math be the projection onto this invariant subspace. Then there is a covering space Template:Math corresponding to this projection map. Much like in the construction of the Alexander polynomial, consider Template:Math as a module over the group-ring of covering transformations Template:Math, which is isomorphic to the ring of Laurent polynomials Template:Math. As a Template:Math-module, Template:Math is free of rank Template:Math. By the basic theory of covering spaces, Template:Math acts on Template:Math, and this representation is called the reduced Burau representation.
The unreduced Burau representation has a similar definition, namely one replaces Template:Math with its (real, oriented) blow-up at the marked points. Then instead of considering Template:Math one considers the relative homology Template:Math where Template:Math is the part of the boundary of Template:Math corresponding to the blow-up operation together with one point on the disc's boundary. Template:Math denotes the lift of Template:Math to Template:Math. As a Template:Math-module this is free of rank Template:Mvar.
By the homology long exact sequence of a pair, the Burau representations fit into a short exact sequence
where Template:Math (resp. Template:Math) is the reduced (resp. unreduced) Burau Template:Math-module and Template:Math is the complement to the diagonal subspace, in other words:
and Template:Math acts on Template:Math by the permutation representation.
Explicit matrices
Let Template:Math denote the standard generators of the braid group Template:Math. Then the unreduced Burau representation may be given explicitly by mapping
for Template:Math, where Template:Math denotes the Template:Math identity matrix. Likewise, for Template:Math the reduced Burau representation is given by
while for Template:Math, it maps
Bowling alley interpretation
Vaughan Jones[2] gave the following interpretation of the unreduced Burau representation of positive braids for Template:Math in Template:Math – i.e. for braids that are words in the standard braid group generators containing no inverses – which follows immediately from the above explicit description:
Given a positive braid Template:Math on Template:Math strands, interpret it as a bowling alley with Template:Math intertwining lanes. Now throw a bowling ball down one of the lanes and assume that at every crossing where its path crosses over another lane, it falls down with probability Template:Math and continues along the lower lane. Then the Template:Math'th entry of the unreduced Burau representation of Template:Math is the probability that a ball thrown into the Template:Math'th lane ends up in the Template:Math'th lane.
Relation to the Alexander polynomial
If a knot Template:Mvar is the closure of a braid Template:Mvar in Template:Math, then, up to multiplication by a unit in Template:Math, the Alexander polynomial Template:Math of Template:Math is given by
where Template:Math is the reduced Burau representation of the braid Template:Mvar.
For example, if Template:Math in Template:Math, one finds by using the explicit matrices above that
and the closure of Template:Math is the unknot whose Alexander polynomial is Template:Math.
Faithfulness
The first nonfaithful Burau representations were found by John A. Moody without the use of computer, using a notion of winding number or contour integration.[3] A more conceptual understanding, due to Darren D. Long and Mark Paton[4] interprets the linking or winding as coming from Poincaré duality in first homology relative to the basepoint of a covering space, and uses the intersection form (traditionally called Squier's Form as Craig Squier was the first to explore its properties).[5] Stephen Bigelow combined computer techniques and the Long–Paton theorem to show that the Burau representation is not faithful for Template:Math.[6][7][8] Bigelow moreover provides an explicit non-trivial element in the kernel as a word in the standard generators of the braid group: let
Then an element of the kernel is given by the commutator
The Burau representation for Template:Math has been known to be faithful for some time. The faithfulness of the Burau representation when Template:Math is an open problem. The Burau representation appears as a summand of the Jones representation, and for Template:Math, the faithfulness of the Burau representation is equivalent to that of the Jones representation, which on the other hand is related to the question of whether or not the Jones polynomial is an unknot detector.[9]
Geometry
Craig Squier showed that the Burau representation preserves a sesquilinear form.[5] Moreover, when the variable Template:Mvar is chosen to be a transcendental unit complex number near Template:Math, it is a positive-definite Hermitian pairing. Thus the Burau representation of the braid group Template:Math can be thought of as a map into the unitary group U(n).
References
External links
- ↑ Template:Cite journal
- ↑ Template:Cite journal
- ↑ Template:Citation
- ↑ Template:Citation
- ↑ 5.0 5.1 Template:Cite journal
- ↑ Template:Cite journal
- ↑ S. Bigelow, International Congress of Mathematicians, Beijing, 2002
- ↑ Vladimir Turaev, Faithful representations of the braid groups, Bourbaki 1999-2000
- ↑ Template:Cite journal