Forks, Noodles and the Burau representation for $n=4$
A. Beridze, P. Traczyk

TL;DR
This paper investigates the faithfulness of the Burau representation for four-strand braids using homological techniques, proposing a conjecture and providing computational and geometric evidence.
Contribution
It introduces a new approach using forks and noodles homological techniques to analyze the Burau representation at n=4, including a conjecture on its faithfulness.
Findings
Proposes a conjecture implying faithfulness for n=4
Provides geometric examples and computational data
Offers arguments supporting the conjecture's validity
Abstract
\begin{abstract} The reduced Burau representation is a natural action of the braid group on the first homology group of a suitable infinite cyclic covering space of the --punctured disc . It is known that the Burau representation is faithful for and that it is not faithful for . We use forks and noodles homological techniques and Bokut--Vesnin generators to analyze the problem for . We present a Conjecture implying faithfulness and a Lemma explaining the implication. We give some arguments suggesting why we expect the Conjecture to be true. Also, we give some geometrically calculated examples and information about data gathered using a C\texttt{++} program.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Forks, Noodles and the Burau Representation
for
A. Beridze and P. Traczyk
Abstract
The reduced Burau representation is a natural action of the braid group on the first homology group of a suitable infinite cyclic covering space of the –punctured disc . It is known that the Burau representation is faithful for and that it is not faithful for . We use forks and noodles homological techniques and Bokut–Vesnin generators to analyze the problem for . We present a Conjecture implying faithfulness and a Lemma explaining the implication. We give some arguments suggesting why we expect the Conjecture to be true. Also, we give some geometrically calculated examples and information about data gathered using a C++ program.
1 Introduction
Let us recall the definition of the reduced Burau representation in terms of the first homology group of a suitable infinite cyclic covering space of the -punctured disc . Let be the unit closed disc on the plane with center and four punctures at: , , , (see Figure 1).
The braid group is the group of all equivalence classes of orientation preserving homeomorphisms which fix the boundary pointwise, where equivalence relation is isotopy relative to . Let be the fundamental group of the 4–punctured disc with respect to the basepoint . Consider the map which sends a loop to , where is the winding number of around punctured points (meaning: the sum of the four winding numbers for individual points). Let be the infinite cyclic covering space corresponding to the kernel of the map . Let be any fixed basepoint which is a lift of the basepoint . In this case is free –module of rank 3 (see [3]). Let be a homeomorphism representing of an element . It can be lifted to a map which fixes the fiber over Therefore it induces a –module automorphism . Consequently, the reduced Burau representation
[TABLE]
is given [3] by
[TABLE]
It is known that the Burau representation is faithful for [1], [2] and it is not faithful for [2], [6], [7]. Therefore, the problem is open for . In this paper, we use the Bokut-Vesnin generators of a certain free subgroup of (see [4]) and a technique developed in [3], to prove the crucial lemma, which gives the opportunity to decompose entries and of the Burau matrix as a sum of three uniquely determined polynomials and the formula to calculate and polynomials using the given decomposition. Besides, we formulate Conjecture 4.2, which implies that if a non–trivial braid has a certain additional property, then there exists a sufficiently large with respect to the length of (to be explained in Section 3, Corollary 3.2) and a sufficiently large such that for each and the difference of lowest degrees of polynomials and is . We will present arguments and experimental data showing why we expect the conjecture to be true. Also, we will consider several examples calculated geometrically. We will show that the conjecture implies faithfulness of the Burau representation for .
2 The Burau representation, Forks and Noodles
The Burau representation for was defined by (1.1) and (1.2). On the other hand is a free –module of rank 3 and if we take a basis of it, then can be identified with . For this reason we will review the definition of the forks.
Definition 2.1**.**
A fork is an embedded oriented tree in the disc with four vertices and , where such that (see [3]):
* meets the puncture points only at and ;* 2. 2.
* meets the boundary only at ;* 3. 3.
All three edges of have as a common vertex.
The edge of which contains is called the handle. The union of the other two edges is denoted by and it is called tine of . Orient so that the handle of lies to the right of (see Figure 2) [3].
For a given fork , let be the handle of , viewed as a path in and take a lift of so that . Let be the connected component of which contains the point . In this case any element of can be viewed as a homology class of and it is denoted by [3].
Standard fork F_{i},\ \ i=1,2,3\ is the fork whose tine edge is the straight arc connecting the i-th and the (i+1)-st punctured points and whose handle has the form as in Figure 3. It is known that if and are the corresponding homology classes, then they form a basis of (see [3]).
Using the basis derived from , any automorphism can be viewed as a matrix with elements in the free –module [3]. If is representing an element , then we need to write the matrix in terms of homology (algebraic) intersection pairing
[TABLE]
For this aim we need to define the noodles which represent relative homology classes in .
Definition 2.2**.**
A noodle is an embedded oriented arc in , which begins at the base point and ends at some point of the boundary [3].
For each and we should take the corresponding fork and noodle and define the polynomial . It does not depend on the choice of representatives of homology classes and so
[TABLE]
is well-defined [3]. The map defined by the above formula is called the noodle–fork paring. Note that geometrically it can be computed in the following way: Let be a fork and be a noodle, such that intersects transversely. Let be the intersection points. For each point let be the sign of the intersection between and at (the intersection is positive if going from tine to noodle according to the chosen directions means turning left) and be the winding number of the loop around the puncture points , where is the composition of three paths , and :
is a path from to along the handle of (see Figure 4a); 2. 2.
is a path from to along the tine (see Figure 4b); 3. 3.
is a path from to along the noodle (see Figure 4c).
In such case the noodle-fork pairing of and is given by (see [3]):
[TABLE]
Let , and be the noodles given in Figure 5. These are called standard noodles. For each braid , the corresponding Burau matrix can be computed using noodle-fork pairing of standard noodles and standard forks. In particular the following is true.
Lemma 2.3**.**
(see [5]). Let . Then for , the entry of its Burau matrix is given by
[TABLE]
Note that under the convention adopted here we have
[TABLE]
and
[TABLE]
For example, to calculate entry of the matrix see the corresponding Figure 6. Note that intersection of the tine of the fork and the noodle at point is negative which means that (see Figure 6a). On the other hand the winding number of the loop (see Figure 6b) around puncture points equals because the considered loop misses and and it goes around once in anti–clockwise direction. Therefore
[TABLE]
3 The Bokut-Vesnin generators and kernel elements of the Burau representation
The braid groups and are defined by the following standard presentations [1]:
[TABLE]
[TABLE]
Let be the homomorphism defined by
[TABLE]
The kernel of is known to be a free group of two generators [4];
[TABLE]
This was proved by L. Bokut and A. Vesnin [4]. We will refer to and as the Bokut–Vesnin generators. The generators and are in fact much more similar than they look at the first glance. This becomes obvious when we interpret as the mapping class group of the –punctured disc. In this well–known approach a braid is an isotopy class of homeomorphisms of the punctured disc fixing the boundary. Figure 7 shows and as homeomorphisms of the punctured disc. The punctures are arranged to make the similarity more visible. Another advantage of this approach is that it gives natural interpretation to various actions of to be considered later in this paper.
The following Proposition is crucial to our considerations.
Proposition 3.1**.**
**
Proof.
Let us make a slight detour into the realm of the Temperley-Lieb algebras and . The Temperley-Lieb algebra is defined as an algebra over . It has generators , and the following relations:
(TL1)
(TL2) for
(TL3) for
Let us consider the homomorphism defined by
[TABLE]
Also, we need to use the Jones’ representation defined by sending to . It is known (see [3], Proposition 1.5) that for we have . Moreover, the following diagram is obviously commutative:
B_{4}$$TL_{4}$$B_{3}$$TL_{3}$$\theta_{4}$$\varphi$$\theta_{3}$$\psi
On the other hand the representation is faithful and therefore . ∎
Corollary 3.2**.**
All kernel elements of the Burau representation may be written as words in the Bokut–Vesnin generators , , , . Moreover, all possible elements in the kernel may be written as reduced words of positive length.
We will use this fact in the next section.
We present for future use the images of , , and under the Burau representation:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
4 Faithfulness Problem of the Burau representation
Let us outline the strategy for analyzing in general terms. Consider a braid that is a candidate for a non–trivial kernel element of the Burau representation. Of course we can exclude from our considerations all those non–trivial braids for which we know for whatever reason that they do not belong to the kernel. Also, we can adjust the remaining candidates in some ways — like replacing with a suitably chosen conjugate of . For such a suitably chosen braid we need to give some argument which shows that and should be non–zero and that , where denotes the exponent of the lowest degree term in the considered Laurent polynomial.
To simplify notation we will denote by the partial sum of the geometric series with initial term and quotient or (e.g. ).
Lemma 4.1**.**
*For each braid there exists , such that
(1) the and entries of the Burau matrix can be decomposed as a sum of three uniquely determined polynomials*
[TABLE]
[TABLE]
*such that
(2) for each we have*
[TABLE]
[TABLE]
(3) Moreover, if is a pure braid, then the polynomial is non–zero.
Proof.
First of all let us observe that uniqueness of and follows from properties (1) and (2) and general algebra. This means that we only need to prove existence and property (3). While it is possible to give specific algebraic formulas for and we prefer to prove existence using forks and noodles. We will always assume that the fork/noodle configuration considered is irreducible.
Let be any braid. By Lemma 2.3 and . On the other hand is a bilinear form, so and . It follows that
[TABLE]
[TABLE]
Let us consider , the image of the standard noodle under the action of . is a path in that begins at the base point and ends at the point . By the definition of the standard noodle it is clear that divides into two components, such that there is one puncture point in one component and three puncture points in the other. Let us assume that the single point is . For example see Figure 8.
We intend to define and by grouping some terms in the sum originally used to define the representation in terms of fork/noodle pairing. The pairing is defined as a certain sum (2.1) of terms corresponding to crossings between forks and noodles. We will choose some of the crossings to define and some other to define . In order to do this we will need some preparations.
Let be the boundary of the square whose vertices are the puncture points. We denote the sides with , where connects with the next crossing (clockwise). We would like to work with a fork/noodle arrangement that has certain special properties. We need the pair (of a fork and a noodle) to be irreducible. We need the fork to be drawn in the standard way. We need the noodle to intersect transversally with minimum possible number of intersection points. And finally we need the tine of the fork to intersect all segments at which the noodle intersects and . While general position arguments show that we can take care of the first three conditions, there is no possibility of the fourth being satisfied without some further adjustments. Figure 9 shows an example.
However it is automatically corrected if we increase the exponent . The effect is just that we add a number of turns around two pairs of punctures. They do not affect the three properties already dealt with and with sufficient increase of we obtain the fourth property. So we are interested in strings between puncture points which has transversal intersection with (see Figure 10).
Note that it is possible to be no such string between and or and , but by our assumption ( is in the first component) there is an odd number of strings between and and an odd number between and (this guaranties that and are not zero).
The pictures of and are as given in Figure 11. Therefore, they differ from each other by just one string and by the direction. The number of strings around , and , is for and for .
If we take curves and in the same and assume that their intersection is transversal, then it is possible that does not intersect all strings between and or and . For example see Figure 9.
In this case we must take more numbers of ’s and finally we will obtain the curves and such that we can find neighborhoods and of and respectively, with the following picture, illustrated in Figure 12a.
In this case for Figure 12a the polynomial corresponding to intersections inside and can be written as and respectively. Let , then we have
[TABLE]
On the other hand if we look at Figure 12b and keep in mind that directions of and are different we can say that
[TABLE]
After that if we multiply the braid by on the left side then we obtain the following picture, illustrated in Figure 13.
Therefore we will have
[TABLE]
[TABLE]
[TABLE]
Note that the same argument it sufficient to complete the proof. ∎
Example 1. Let , then for we have
[TABLE]
[TABLE]
[TABLE]
See Figure 14. Let , then we can see that
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Example 2. Let , then for we have
[TABLE]
[TABLE]
[TABLE]
See Figure 15 Let then we can see that
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Example 3. Let , then for we have
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
See Figure 16 Let then we can see that
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
We formulate a conjecture that describes a certain regularity, experimentally observed for images (matrices) of braids of a special form. For future reference let us state clearly that what we mean by regularity is that the and entries in the considered matrix are non–zero Laurent polynomials and that the difference of the degrees of lowest degree terms is equal to .
Conjecture 4.2**.**
Let be any non–trivial pure braid which is not equivalent to for some We assume that acts non–trivially on Then there exists a sufficiently large with respect to the length of and a sufficiently large such that for each the difference of the lowest degrees of the polynomials and is equal to and the polynomials are non-zero.
While experimental data suggest that the Conjecture is true as formulated, we are really interested in the situation when is a product of Bokut–Vesnin generators. Therefore we may refer to the length of , meaning the length of as a reduced word in . Now, we give some arguments showing why we expect the Conjecture to be true. Take a sufficiently large with respect to the length of . Consider the curves and neighborhood of inside of which it looks as in Figure 17:
Apply to the curve the transformation corresponding to the braid . Note that is sufficiently large with respect to the length of and so in the curve almost all parallel lines to line are followed by the curve . On the other hand the transformation corresponding to the braid acts non–trivially on the line . Therefore the final image does not have problematic strings around , as in Figure 18:
In general, if we take any braid , then may have the strings in the form illustrated in Figure 18. For example if or then the corresponding curves are shown in Figure 19.
Because the curve does not have any problematic strings for the intersection of curves and inside the neighbourhoods and of and looks as in Figure 13. So the and entries of the Burau matrix can be written as
[TABLE]
[TABLE]
where polynomial is not zero and for each we have
\begin{array}[]{lclll}{\rho}_{11}\left(a^{3+m^{\prime}}\sigma a^{-{l_{0}}}\right)&=&\hphantom{-}P\left(t,t^{-1}\right)\left(S_{m^{\prime}+1}(t^{-1})\right)&+Q\left(t,t^{-1}\right)\cr&&+R\left(t,t^{-1}\right)\left(S_{m^{\prime}+1}(t)\right),\cr{\rho}_{31}\left(a^{3+m^{\prime}}\sigma a^{-l_{0}}\right)&=&-P\left(t,t^{-1}\right)\left(S_{m^{\prime}}(t^{-1})\right)&-Q\left(t,t^{-1}\right)\cr&&-R\left(t,t^{-1}\right)\left(S_{m^{\prime}}(t)\right).\cr\end{array}
On the other hand if we compare the curves and (see Figure 20), it is clear that they differ only by strings around .
Moreover, if we consider the intersections of curves and with the strings between the puncture points and as in Figure 21, then corresponding polynomials up to sign and multiplications have the forms:
[TABLE]
[TABLE]
Therefore their lowest degrees are equal. Note that, is sufficiently large with respect to the length of and so the pictures of curves and ‘globally’ are the same. That means that in some ’local’ pictures there are just different numbers of strings. Now we must look at pictures and inside a neighborhood of as it was done in the previous proof (see Figure 10). Note that by the arguments in the proof of Lemma 4.1 and same ‘global’ picture of the curves and we have
[TABLE]
[TABLE]
and for each we have:
\begin{array}[]{lclll}{\rho}_{11}\left(a^{3+m^{\prime}}\sigma a^{-l_{0}-1}\right)&=&\hphantom{-}P^{\prime}\left(t,t^{-1}\right)\left(S_{m^{\prime}+1}(t^{-1})\right)&+Q^{\prime}\left(t,t^{-1}\right)\cr&&+R^{\prime}\left(t,t^{-1}\right)\left(S_{m^{\prime}+}(t)\right),\cr{\rho}_{31}\left(a^{3+m^{\prime}}\sigma a^{-l_{0}-1}\right)&=&-P^{\prime}\left(t,t^{-1}\right)\left(S_{m^{\prime}}(t^{-1})\right)&-Q^{\prime}\left(t,t^{-1}\right)\cr&&-R^{\prime}\left(t,t^{-1}\right)\left(S_{m^{\prime}+}(t)\right).\end{array}
Take a large such that the difference of lowest degrees of polynomials and is equal to and these lowest degrees come from the lowest degree of the polynomial . By (*) and (**) the polynomials and , and and also and have the same lowest degrees and so the same regularity will be true for the polynomials and . By induction on the length of it will be true for the braid as well.
Example 4. Let . Our aim is to find which satisfies the conditions of Lemma 4.1 and to calculate the corresponding polynomials , and . Then we will take any (In our case we consider ) and will show that lowest degrees of the corresponding polynomials do not change. For the given braid it is difficult to see the picture and write down the polynomials , and . Therefore we will use the following method: If (in our case ) is a number as in Lemma 4.1, then we have
[TABLE]
[TABLE]
Therefore
[TABLE]
[TABLE]
In this way we can see that for the braid we have
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Similarly, for the braid we obtain
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Therefore the lowest degrees of polynomials and (same situation is with the polynomials and or and ) are equal.
Theorem 4.3**.**
Conjecture 4.2 implies faithfulness of the Burau representation for .
Proof.
Let us consider a nontrivial braid written as a reduced word in the Bokut–Vesnin generators. We may assume that it begins and ends with or (otherwise we will conjugate by a suitable power of ).
If we interpret the braid group as the mapping class group, then there is a natural induced action on the set of isotopy classes of forks. Let act non–trivially on . Then by Lemma 4.1 it is possible to find sufficiently large with respect to the length of and sufficiently large , such that for each and the difference of lowest degrees of the polynomials and is equal to and the polynomials are both non-zero. In particular, we can assume that and so and are both non-zero which contradicts the assumption that .
The general case (when we do not assume that acts non–trivially on ) is easily reduced to the one discussed above. The reason is that if acts trivially on all four segments, then is a power of which is not possible if is a product of the Bokut–Vesnin generators. And if acts non–trivially on at least one of the four segments, then we can rotate the whole disc to make the action non–trivial for .
∎
Remark 4.4**.**
We have a C++ program checking whether our regularity works or not for randomly generated examples. We calculated millions of examples and the regularity was always confirmed. In fact we considered examples of type , where is a reduced word in the Bokut–Vesnin generators. Such a version of Proposition 3.1 is sufficient for the Burau representation faithfulness problem.
Acknowledgements:
Most of this research was conducted while the first author was a postdoc at the University of Warsaw during the Spring 2014 semester, with support of Erasmus Mundus Project (WEBB).
REFERENCES
Joan S Birman. Braids, links, and mapping class groups. Annals of Mathematics Studies, No. 82, Princeton University Press, Princeton, NJ (1974) 2. 2.
Stephen Bigelow. The Burau representation is not faithful for . Geom. Topol. 3 (1999), 397-404 3. 3.
Stephen Bigelow. Does the Jones polynomial detect the unknot? J. Knot Theory and Ramifications (4) 11 (2002), 493-505 4. 4.
Leonid Bokut and Andrei Vesnin. New rewriting system for the braid group . * in: Proceedings of Symposium in honor of Bruno Buchberger’s 60th birthday ”Logic, Mathematics and Computer Sciences: Intersections”, Research Institute for Symbolic Computations, Linz, Austia, 2002, Report Series No. 02-60, 48-60 * 5. 5.
Matthieu Calvez and Tetsuya Ito. Garside-theoretic analysis of Burau representations. * arXiv:1401.2677v2 * 6. 6.
D. D.Long and M. Paton. The Burau representation is not faithful for . Topology **32 **(1993), no. 2, 439—447 7. 7.
John Atwell Moody. The Burau representation of the braid group is unfaithful for large . Bull. Amer. Math. Soc. (N.S.) **25 **(1991) no. 2, 379–384
Authors’ addresses:
Anzor Beridze,
Department of Mathematics,
Batumi ShotaRustaveli State University,
35, Ninoshvili St., Batumi 6010,
Georgia
Pawel Traczyk,
Institute of Mathematics,
University of Warsaw,
Banacha 2, 02-097 Warszawa,
Poland
