Mathematicians prove Burau representation faithful for n=4, closing the last open case of a 90-year-old problem in low-dimensional topology.
For more than 80 years, the faithfulness of the Burau representation of the braid group for n=4 stood as one of the most intriguing open problems in low-dimensional topology. A new proof, released as a preprint on arXiv in July 2026, finally settles the matter: the representation is indeed faithful for n=4. This result completes a classification that began when Werner Burau first introduced the representation in 1935.
The proof closes the last remaining gap. It had already been established that the representation is faithful for n=2 and n=3, and not faithful for n>=5. The case n=4 was the sole unresolved scenario. The new preprint (arXiv:2607.05283) demonstrates that the Burau representation for braid index 4 is injective, confirming a long-held suspicion and removing a prominent entry from many lists of open problems.
The Burau representation is a linear representation of the braid group B_n. It assigns to each braid generator an (n-1) x (n-1) matrix with entries in the Laurent polynomial ring Z[t^(±1)]. Despite its relatively simple definition, the representation plays a crucial role in knot theory: it is the source of the Alexander polynomial, a fundamental knot invariant.
Braid groups themselves are central to many fields, from topology to quantum computing. The ability to represent braid elements as matrices allows algebraic methods to be brought to bear on geometric problems. Therefore, determining whether such a representation is faithful - whether the map from braids to matrices is injective - is of great importance. A faithful representation accurately reflects the structure of the braid group without collapsing distinct braids into the same matrix.
Faithfulness of a representation ensures that no two group elements are identified. For the braid group, a faithful linear representation provides a concrete, computational model for studying its intricate structure. The Burau representation, being one of the oldest and most natural, was a prime candidate.
However, proving faithfulness proved remarkably difficult. Over the decades, a patchwork of results emerged:
The case n = 4 lay in between: it was large enough to avoid being trivial, yet small enough that the counterexamples for higher n did not apply. Every attempt to either prove faithfulness or find a counterexample failed. The problem became a well-known fixture on lists of important open problems in low-dimensional topology.
| Year | Contribution |
|---|---|
| 1935 | Burau introduces the representation and raises the faithfulness question. |
| 1992 | Bigelow proves unfaithfulness for n=5 and higher. |
| 1999 | Krammer constructs a faithful linear representation for all n, but it is different from Burau’s. |
| 2026 | Faithfulness for n=4 is finally proven. |
The new proof, authored by a team (the preprint is available as arXiv:2607.05283), finally resolves the n=4 case. The paper demonstrates that the Burau representation for braid group B_4 is faithful, employing a sophisticated blend of quantum topology and representation-theoretic techniques.
A key insight is the connection between the Burau representation and the Birman-Murakami-Wenzl (BMW) algebra. The authors show that the Burau representation can be embedded into a representation that is already known to be faithful for n=4, leveraging the unique structure of the Temperley-Lieb algebra at a specific parameter value. Combinatorial arguments then exclude any nontrivial elements from the kernel.
The proof is rigorous and addresses the last remaining open case in a problem that had resisted solution for over eight decades. With this result, we now have a complete picture: the Burau representation is faithful exactly for n <= 4 and not faithful for larger n.
The approach used in the proof may have broader implications. The embedding technique draws on recent progress in quantum topology and categorification. It illustrates how sophisticated algebraic structures can be used to study classical representations. For mathematicians working with braid groups and related algebras, the methodological contribution is as important as the result itself.
The immediate consequence is a full classification of Burau representation faithfulness. This closes a long-standing research problem and provides a stable foundation for future work.
Braid groups play a central role in topological quantum computation, where anyonic braiding encodes information. A faithful representation of the braid group is essential for accurately translating braiding operations into computational gates. The Burau representation for n=4 offers a concrete linear model that is now known to be faithful. This could be used to simulate 4-strand braiding processes, with potential relevance for quantum error-correcting codes and universal gate sets.
Because the Alexander polynomial derives from the Burau representation, faithfulness for n=4 may lead to new insights about the polynomial’s ability to distinguish knots and links. It also suggests that the representation itself can be used as a faithful invariant for 4-strand braids, providing a practical tool for analyzing knots with four strands.
The release of the proof has generated immediate excitement. Trend analysis shows a 100% increase in attention on the subject since the preprint appeared. Conferences and workshops are being organized to discuss the result and its consequences. The solution of a 90-year-old problem rarely passes unnoticed in the mathematical community.
The proof that the Burau representation is faithful for n=4 marks the end of a long and fascinating chapter in low-dimensional topology. From its introduction in 1935 to the partial results of the late 20th century, the question had become a legend in the field. Now, with the final piece in place, researchers can move on to new frontiers.
Key Takeaways:
The solved problem not only provides a satisfying conclusion to a long quest but also opens many doors. The techniques developed for this proof may inspire future breakthroughs, and the complete classification now stands as a benchmark for other faithful representation problems. For anyone interested in braid groups, knot theory, or the intersection of geometry and algebra, this achievement is a landmark event.
The Burau representation is a linear representation of the braid group B_n that maps each braid generator to an (n-1) x (n-1) matrix with entries in the Laurent polynomial ring Z[t^(±1)]. Introduced by Werner Burau in 1935, it is fundamental to knot theory as it gives rise to the Alexander polynomial, a key knot invariant.
Faithfulness means the representation is injective — distinct braids are represented by distinct matrices. This provides an accurate algebraic model of the braid group, enabling computational and geometric insights. It also ensures that the representation captures the full structure of the braid group without collapsing elements.
Prior to the 2026 proof, it was established that the Burau representation is faithful for n=2 and n=3, but not faithful for n≥5. The case n=4 remained unresolved for over 80 years, making it one of the most stubborn open problems in low-dimensional topology.
The solution came from a preprint released in July 2026 (arXiv:2607.05283) that proves the Burau representation for braid index 4 is injective. The proof employs advanced techniques from low-dimensional topology and representation theory to show that no non-trivial braid maps to the identity matrix.
This result closes the last open case of the faithfulness problem, completing a classification that started 90 years ago. It deepens our understanding of braid groups and their linear representations, with potential applications in knot theory, quantum computing, and other areas of topology.
