Mathematics Advanced Free Analysis

A Simple Way To Measure Knots Has Come Unraveled

Leila Sloman Β· Quanta Magazine September 22, 2025 8 min read ~1,600 words

Why Read This

What Makes This Article Worth Your Time

Summary

What This Article Is About

Mathematicians Susan Hermiller and Mark Brittenham have disproved a century-old conjecture about the unknotting numberβ€”a measurement of how many crossing changes are required to transform a tangled knot into a simple loop. The additivity conjecture, first proposed by German mathematician Hilmar Wendt in 1937, predicted that when two knots are combined, the unknotting number of the resulting knot should equal the sum of the individual unknotting numbers.

Using a decade-long computational project involving dozens of computers running sophisticated knot-identification software called SnapPy, the pair discovered a counterexample: the (2,7) torus knot combined with its mirror image requires only five crossing changes to unknot, not six as the conjecture predicted. This discovery reveals that knot complexity is far more chaotic and unpredictable than mathematicians hoped, fundamentally complicating our understanding of these deceptively simple mathematical objects.

Key Points

Main Takeaways

Historic Conjecture Disproved

The additivity conjecture, which stood for nearly a century, has been definitively disproven using computational methods.

Decade of Computational Research

Brittenham and Hermiller used dozens of computers over ten years, creating unknotting sequences for millions of knot diagrams.

Surprisingly Simple Counterexample

The torus knot and its mirror image provide a shockingly elegant violation of what mathematicians expected.

Unknotting Number Remains Mysterious

Computing unknotting numbers is notoriously difficult, with no clear relationship to a knot’s apparent visual complexity.

Infinite Family of Violations

The discovery led to infinitely many other counterexamples, including almost any torus knot with its mirror image.

Chaos Over Order

The result demonstrates that knot complexity is far more unpredictable and chaotic than mathematicians had hoped.

Master Reading Comprehension

Practice with 365 curated articles and 2,400+ questions across 9 RC types.

Start Learning

Article Analysis

Breaking Down the Elements

Main Idea

The Unpredictability of Mathematical Simplicity

The article demonstrates that a seemingly straightforward measurement in knot theoryβ€”the unknotting numberβ€”is far more complex and chaotic than mathematicians believed. The disproof of the additivity conjecture reveals that combining knots doesn’t follow the intuitive arithmetic that researchers expected, fundamentally complicating how we understand and measure knot complexity.

Purpose

To Report a Paradigm-Shifting Discovery

The author aims to communicate a significant mathematical breakthrough to a general audience, explaining both the historical context of the problem and the methods used to solve it. The article seeks to convey the excitement and implications of discovering that mathematical reality is messier and more interesting than hoped.

Structure

Historical Context β†’ Problem Development β†’ Solution Narrative

The article begins with Peter Guthrie Tait’s 19th-century work establishing the unknotting number, then traces the development of the additivity conjecture through the 20th century. It culminates in a detailed narrative of Brittenham and Hermiller’s decade-long computational project, building suspense before revealing their counterexample and discussing its implications for the field.

Tone

Explanatory, Enthusiastic & Accessible

The writing balances technical precision with engaging storytelling, using vivid details like computers catching fire and the dramatic “CONNECT SUM BROKEN” message. Expert quotes convey both disappointment and excitement about the discovery, while the author maintains an accessible tone that makes advanced mathematics comprehensible to non-specialists.

Key Terms

Vocabulary from the Article

Click each card to reveal the definition

Conjecture
noun
Click to reveal
A mathematical proposition that is believed to be true but has not yet been proven or disproven.
Topology
noun
Click to reveal
The mathematical study of properties that remain unchanged under continuous deformations such as stretching and twisting.
Counterexample
noun
Click to reveal
A specific example that disproves a general statement or conjecture by demonstrating an exception to the proposed rule.
Additivity
noun
Click to reveal
A property where the combination of two quantities equals the sum of their individual values.
Invariant
noun
Click to reveal
A mathematical property or quantity that remains unchanged under specified transformations or operations.
Diagram
noun
Click to reveal
In knot theory, a two-dimensional representation of a knot showing how the string crosses over itself.
Tantalizing
adjective
Click to reveal
Teasingly attractive or interesting, arousing desire or curiosity while remaining just out of reach.
Stymied
verb
Click to reveal
Prevented from making progress; blocked or thwarted in one’s efforts to understand or accomplish something.

Build your vocabulary systematically

Each article in our course includes 8-12 vocabulary words with contextual usage.

View Course

Tough Words

Challenging Vocabulary

Tap each card to flip and see the definition

Beknottedness bih-NOT-ed-ness Tap to flip
Definition

The degree to which something is knotted or tangled; a measure of knot complexity.

“Peter Guthrie Tait set out to measure what he called the ‘beknottedness’ of knots.”

Paradigm PAIR-uh-dime Tap to flip
Definition

A fundamental framework or model that shapes how we understand and approach a subject.

“The result demonstrates that knot complexity doesn’t follow the neat paradigm mathematicians hoped for.”

Heuristic hyoo-RIS-tik Tap to flip
Definition

A practical approach to problem-solving using methods that may not be perfect but are sufficient for immediate goals.

“Mathematicians developed heuristic methods for approximating unknotting numbers when exact computation proved impossible.”

Intractable in-TRAK-tuh-bul Tap to flip
Definition

Extremely difficult or impossible to solve, manage, or deal with using available methods.

“Computing the unknotting number remains an intractable problem for most complicated knots.”

Homeomorphic HO-mee-oh-MOR-fik Tap to flip
Definition

Having the same topological properties; able to be continuously deformed into one another without cutting or tearing.

“Two knots are homeomorphic if one can be transformed into the other through stretching and twisting.”

Algorithmic al-guh-RITH-mik Tap to flip
Definition

Relating to or using a step-by-step computational procedure for solving a problem or performing a calculation.

“Brittenham and Hermiller used algorithmic approaches to systematically apply crossing changes to millions of knot diagrams.”

1 of 6

Reading Comprehension

Test Your Understanding

5 questions covering different RC question types

True / False Q1 of 5

1According to the article, two knots are considered the same if one can be twisted and stretched into the other without cutting the string.

Multiple Choice Q2 of 5

2What was the main computational challenge that Brittenham and Hermiller faced in their research?

Text Highlight Q3 of 5

3Which sentence best captures why mathematicians wanted the additivity conjecture to be true?

Multi-Statement T/F Q4 of 5

4Evaluate these statements about Peter Guthrie Tait’s contribution to knot theory:

Tait introduced the concept of “beknottedness” to measure knot complexity.

Tait successfully proved that his unknotting numbers could distinguish all different knots.

Tait expressed uncertainty about whether he was missing something important in his approach.

Select True or False for all three statements, then click “Check Answers”

Inference Q5 of 5

5Based on the article’s discussion of reactions to the disproved conjecture, what can we infer about the nature of mathematical progress?

0%

Keep Practicing!

0 correct Β· 0 incorrect

Get More Practice

FAQ

Frequently Asked Questions

A crossing change is the fundamental operation in knot theory where you lay a knot flat, find a spot where the string crosses over itself, cut the string, swap the positions of the strands, and glue everything back together. This operation is crucial because the unknotting numberβ€”the minimum number of crossing changes needed to transform a knot into a simple loopβ€”provides a measure of knot complexity.

The additivity conjecture promised mathematical order and predictability. If true, it would have meant that once mathematicians knew the unknotting numbers of prime knots (the building blocks), they could calculate the unknotting numbers for all knots simply by addition. This would have provided a neat, hierarchical organization of knot complexity, making what is currently an impossibly difficult computational problem much more tractable.

The counterexample was surprisingly simple and elegant. The (2,7) torus knotβ€”made by winding two strings around each other three and a half timesβ€”has an unknotting number of 3, as does its mirror image. The additivity conjecture predicted their connect sum should require 6 crossing changes, but it actually only needs 5. After nearly a century of searching, mathematicians discovered that this relatively basic knot type violated a fundamental assumption about knot behavior.

Readlite provides curated articles with comprehensive analysis including summaries, key points, vocabulary building, and practice questions across 9 different RC question types. Our Ultimate Reading Course offers 365 articles with 2,400+ questions to systematically improve your reading comprehension skills.

This is an Advanced-level article requiring sophisticated mathematical vocabulary and the ability to follow complex abstract reasoning. It assumes familiarity with mathematical proof concepts, computational methods, and topological thinking. The article demands readers track multiple interconnected ideas across historical context, technical explanations, and philosophical implications about the nature of mathematical knowledge and discovery.

The computational challenge was enormous because Brittenham and Hermiller had to work through millions of knot diagrams corresponding to hundreds of thousands of unique knots. Each knot could be represented by countless different diagrams, and finding the minimum unknotting sequence often requires non-obvious diagram choices. The counterexample was, as Hermiller described, ‘a needle in a haystack’β€”requiring systematic exploration of an astronomical search space that even modern supercomputers needed years to navigate.

The Ultimate Reading Course covers 9 RC question types: Multiple Choice, True/False, Multi-Statement T/F, Text Highlight, Fill in the Blanks, Matching, Sequencing, Error Spotting, and Short Answer. This comprehensive coverage prepares you for any reading comprehension format you might encounter.

Complete Bundle - Exceptional Value

Everything you need for reading mastery in one comprehensive package

Why This Bundle Is Worth It

πŸ“š

6 Complete Courses

100-120 hours of structured learning from theory to advanced practice. Worth β‚Ή5,000+ individually.

πŸ“„

365 Premium Articles

Each with 4-part analysis (PDF + RC + Podcast + Video). 1,460 content pieces total. Unmatched depth.

πŸ’¬

1 Year Community Access

1,000-1,500+ fresh articles, peer discussions, instructor support. Practice until exam day.

❓

2,400+ Practice Questions

Comprehensive question bank covering all RC types. More practice than any other course.

🎯

Multi-Format Learning

Video, audio, PDF, quizzes, discussions. Learn the way that works best for you.

πŸ† Complete Bundle
β‚Ή2,499

One-time payment. No subscription.

✨ Everything Included:

  • βœ“ 6 Complete Courses
  • βœ“ 365 Fully-Analyzed Articles
  • βœ“ 1 Year Community Access
  • βœ“ 1,000-1,500+ Fresh Articles
  • βœ“ 2,400+ Practice Questions
  • βœ“ FREE Diagnostic Test
  • βœ“ Multi-Format Learning
  • βœ“ Progress Tracking
  • βœ“ Expert Support
  • βœ“ Certificate of Completion
Enroll Now β†’
πŸ”’ 100% Money-Back Guarantee
Prashant Chadha

Connect with Prashant

Founder, WordPandit & The Learning Inc Network

With 18+ years of teaching experience and a passion for making learning accessible, I'm here to help you navigate competitive exams. Whether it's UPSC, SSC, Banking, or CAT prepβ€”let's connect and solve it together.

18+
Years Teaching
50,000+
Students Guided
8
Learning Platforms

Stuck on a Topic? Let's Solve It Together! πŸ’‘

Don't let doubts slow you down. Whether it's reading comprehension, vocabulary building, or exam strategyβ€”I'm here to help. Choose your preferred way to connect and let's tackle your challenges head-on.

🌟 Explore The Learning Inc. Network

8 specialized platforms. 1 mission: Your success in competitive exams.

Trusted by 50,000+ learners across India
×