Math 2.0

Manifolds and cell complexes Definition

Unknotting number

Builds on KnotUnknot

Definition

Let KK be a tame knot in ℝ3\R^3, and let DD be a diagram of KK. A crossing change at a crossing of DD exchanges the over-strand and the under-strand at that crossing. Let u(D)u(D) be the least number of crossings of DD whose simultaneous change gives a diagram of the unknot. The unknotting number of KK is u(K)=min⁡{u(D):D is a diagram of K}.u(K) = \min \set{u(D) : D \text{ is a diagram of } K}.

Remarks

The number u(D)u(D) is finite: changing suitable crossings of any diagram gives a diagram of the unknot. Example: the standard three-crossing diagram of the trefoil knot becomes a diagram of the unknot after one crossing change. The trefoil is not the unknot, so its unknotting number is 11. Non-example of the minimum: a single diagram may need more changes than u(K)u(K), so u(D)u(D) for one fixed diagram DD is only an upper bound for u(K)u(K). A knot has u(K)=0u(K) = 0 if and only if it is the unknot. The unknotting number of the torus knot T(p,q)T(p, q) with coprime p,q≥2p, q \ge 2 is (p−1)(q−1)/2(p-1)(q-1)/2; this is the Milnor conjecture.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Knot concept
  2. Unknot example
  3. Unknotting number definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Unknotting_number
About this page
TagMCPFA4DC9Z
URIm2://MCPFA4DC9Z
Kinddefinition
WritingW0 stub
MSC57K10
DefinesUnknotting number
UsesKnot, Unknot
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.