Manifolds and cell complexes Knot theory Theorem
Wirtinger presentation
Builds on KnotKnot groupPresentation of a group
Statement
Let be an oriented tame knot in , with a diagram that has crossings. The diagram breaks into arcs , each running from one undercrossing to the next. Take a base point above the plane of the diagram. For each arc , let be the class of a loop from the base point that passes once under , by the right-hand rule. At a crossing, let be the over-arc, let be the incoming under-arc and let be the outgoing under-arc. Let be the sign of the crossing. Write for the relation at this crossing. Then the knot group of has the presentation with one relation for each crossing . 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 , and each crossing adds one relation. The sign convention for depends on the orientation chosen for the loops ; with the opposite choice, becomes . For the trefoil with arcs , the relations read , and for one orientation. Eliminating and dropping the last relation gives . All generators are conjugate, because each relation conjugates one generator to another and the arcs are connected by the knot. The hypothesis is needed: a diagram of the unknot with no crossings has one arc and no crossing, and its group is .
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
- no evidence level
- Knot concept
- Knot group concept
- Presentation of a group concept
- Wirtinger presentation statement
Further reading
About this page
| Tag | P6GR8ZQCK3 |
|---|---|
| URI | m2://P6GR8ZQCK3 |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 57K10, 57M05 |
| Status | This copy of the site has no build data. Run m2 status P6GR8ZQCK3. |
| About | Knot group |
| Uses | Knot, Knot group, Presentation of a group |
| Same as | |
| Changed | 2 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.