Home InternationalA Simple Way To Measure Knots Has Come Unraveled...
International⭐ Featured

A Simple Way To Measure Knots Has Come Unraveled

Two mathematicians have proved that a straightforward question — how hard is it to untie a knot? — has a complicated answer. The post A Simple Way To Measure Knots Has Come Unraveled first appeared on Quanta Magazine

6 April 2026 at 06:06 pm
1 views
A Simple Way To Measure Knots Has Come Unraveled

In 1876, Peter Guthrie Tait, a Scottish mathematician whose work laid the foundation for modern knot theory, set out to measure what he called the "beknottedness" of knots. Tait was attempting to find a way to distinguish between different knots, a task that had proven to be notoriously difficult in the field of mathematics. In mathematics, a knot is defined as a tangled piece of string with its ends glued together. Two knots are considered the same if one can be transformed into the other through a series of twists and stretches, a process known as ambient isotopy.

Tait's quest for a simple method to measure the complexity of knots led him to propose a conjecture that would shape the field for decades to come. He hypothesized that any knot could be untangled by a finite number of moves, known as Reidemeister moves, which involve twisting the string in specific ways. This conjecture, now known as Tait's conjecture, suggested that the minimum number of moves required to untangle a knot could be used as a measure of its "beknottedness."

For many years, mathematicians worked to either prove or disprove Tait's conjecture. The idea of using a finite number of moves to untangle a knot seemed intuitive, but the complexity of knots made it challenging to determine whether this was always possible. Some mathematicians believed that Tait's conjecture was correct, while others were skeptical, arguing that there might be knots that required an infinite number of moves to untangle.

Recently, two mathematicians have proved that the straightforward question of how hard it is to untie a knot has a complicated answer. Their findings have shown that Tait's conjecture is false, meaning that there exist knots that cannot be untangled using a finite number of Reidemeister moves. This discovery has come as a surprise to many in the field, as it challenges the long-held belief that knots could be untangled through a finite process.

The mathematicians' proof relies on advanced techniques from algebraic topology and combinatorial group theory. They constructed a specific example of a knot, known as a "hyperbolic knot," which requires an infinite number of moves to untangle. This counterexample demonstrates that the initial assumption about the finiteness of untangling moves was incorrect.

The implications of this discovery are significant for the field of knot theory. It highlights the complexity of knots and underscores the need for more sophisticated methods to measure their intrinsic difficulty. The failure of Tait's conjecture has opened up new avenues of research, prompting mathematicians to explore alternative approaches to understanding the untangling process.

One possible direction for future research is to develop new invariants that can distinguish between knots with different untangling complexities. These invariants could provide a more nuanced understanding of the "beknottedness" of knots, going beyond the simplistic measure proposed by Tait. Additionally, the discovery may inspire new algorithms for untangling knots, which could have practical applications in fields such as robotics and materials science.

In conclusion, the recent proof that Tait's conjecture is false has unraveled a long-standing mystery in knot theory. The idea that knots could be untangled through a finite number of moves has been shown to be incorrect, revealing the intricate and complex nature of these mathematical objects. As mathematicians continue to explore the world of knots, this newfound understanding will undoubtedly shape the future of the field, leading to further breakthroughs and discoveries.

📰 Related News
Ollama 0.2.6 Released with Native Gemma 4 Support and Enhanced Performance
Ollama 0.2.6 Released with Native Gemma 4 Support and Enhanced Performance
Ollama 0.2.6 is now live, featuring native support for Google's Gemma 4 models and improved local inference performance for Windows, macOS, and Linux.
14 Apr
Weekly news roundup: Shortages spread to MLCCs; SK Hynix reportedly in talks with Microsoft and Google
Weekly news roundup: Shortages spread to MLCCs; SK Hynix reportedly in talks with Microsoft and Google
Below are the most-read DIGITIMES Asia stories from the week of April 6-April 13, 2026:
14 Apr
sparkstat added to PyPI
sparkstat added to PyPI
Real-time GPU monitor for NVIDIA DGX Spark and other unified memory (UMA) systems
14 Apr
sparkstat 0.1.0
sparkstat 0.1.0
Real-time GPU monitor for NVIDIA DGX Spark and other unified memory (UMA) systems
14 Apr
sparkstat 0.1.1
sparkstat 0.1.1
Real-time GPU monitor for NVIDIA DGX Spark and other unified memory (UMA) systems
14 Apr
cutile-stencil 0.2.0
cutile-stencil 0.2.0
An xDSL-based stencil compiler that generates optimized GPU kernels via NVIDIA cuTile
14 Apr
gswarp 1.0.3
gswarp 1.0.3
Pure-Python NVIDIA Warp backend for 3D Gaussian Splatting
14 Apr
merlin-llm added to PyPI
merlin-llm added to PyPI
Merlin — a fast local LLM for agentic coding on Apple Silicon
14 Apr
Fluent Cut - Craft and compose videos programmatically in PHP with an elegant fluent API
Fluent Cut - Craft and compose videos programmatically in PHP with an elegant fluent API
Craft and compose videos programmatically in PHP with an elegant fluent API - b7s/fluentcut
14 Apr
Crypto Investor at Center of Trump Corruption Allegations Now Sees Himself as ‘Victim’
Crypto Investor at Center of Trump Corruption Allegations Now Sees Himself as ‘Victim’
Justin Sun has accused Trump-affiliated World Liberty Financial of misconduct and a general lack of transparency.
14 Apr