Math 2.0

Manifolds and cell complexes Knot theory Theorem

Wirtinger presentation

Builds on KnotKnot groupPresentation of a group

Statement

Let KK be an oriented tame knot in ℝ3\R^3, with a diagram that has n≥1n \ge 1 crossings. The diagram breaks into nn arcs a1,…,ana_1, \ldots, a_n, each running from one undercrossing to the next. Take a base point above the plane of the diagram. For each arc aia_i, let xix_i be the class of a loop from the base point that passes once under aia_i, by the right-hand rule. At a crossing, let aka_k be the over-arc, let aia_i be the incoming under-arc and let aja_j be the outgoing under-arc. Let ε=±1\varepsilon = \pm 1 be the sign of the crossing. Write rr for the relation xj=xkεxixk−εx_j = x_k^{\varepsilon} x_i x_k^{-\varepsilon} at this crossing. Then the knot group of KK has the presentation π1(ℝ3∖K)≅⟨x1,…,xn∣r1,…,rn⟩,\pi_1(\R^3 \setminus K) \cong \langle x_1, \ldots, x_n \mid r_1, \ldots, r_n \rangle, with one relation rcr_c for each crossing cc. Any one of the relations may be omitted.

Remarks

The proof applies the Seifert–van Kampen theorem to the complement, cut into the half-space above the diagram plane and small pieces near the crossings. The half-space above, with tunnels under the arcs, gives a free group on the xix_i, and each crossing adds one relation. The sign convention for ε\varepsilon depends on the orientation chosen for the loops xix_i; with the opposite choice, ε\varepsilon becomes −ε-\varepsilon. For the trefoil with arcs a1,a2,a3a_1, a_2, a_3, the relations read x3=x1x2x1−1x_3 = x_1 x_2 x_1^{-1}, x1=x2x3x2−1x_1 = x_2 x_3 x_2^{-1} and x2=x3x1x3−1x_2 = x_3 x_1 x_3^{-1} for one orientation. Eliminating x3x_3 and dropping the last relation gives ⟨x1,x2∣x1x2x1=x2x1x2⟩\langle x_1, x_2 \mid x_1 x_2 x_1 = x_2 x_1 x_2 \rangle. All generators are conjugate, because each relation conjugates one generator to another and the arcs are connected by the knot. The hypothesis n≥1n \ge 1 is needed: a diagram of the unknot with no crossings has one arc and no crossing, and its group is ℤ\Z.

Going deeper

For a student

It is the standard way to compute knot groups and their invariants. Representations of the knot group into a finite group can be found from it by assigning elements to arcs. Tricolorability is the case of the symmetric group on three letters. The Alexander polynomial can be computed from it by Fox calculus. The presentation has deficiency one, with one more generator than essential relations.

Reading path

To understand this page from the ground up, read these 4 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. Knot group concept
  3. Presentation of a group concept
  4. Wirtinger presentation statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Wirtinger_presentation
About this page
TagP6GR8ZQCK3
URIm2://P6GR8ZQCK3
Kindstatement, theorem
WritingW0 stub
MSC57K10, 57M05
StatusThis copy of the site has no build data. Run m2 status P6GR8ZQCK3.
AboutKnot group
UsesKnot, Knot group, Presentation of a group
Same as
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • 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.