How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Wirtinger presentations and knot groups
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Covering Spaces and Lifting
- Cw Complexes and Cellular Homology
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Exterior Powers, Orientation and Hodge Duality
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Free Products and Amalgamation
- Fubini and Change of Variables
- Function Space Topologies and the Exponential Law
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Hereditary and Productive Behaviour of the Separation Axioms
- Higher Homotopy Groups and Cofiber Sequences
- Homology Axioms Degree and Classical Applications
- Homotopy and Homotopy Equivalence
- Hurewicz Whitehead Freudenthal and Cw Approximation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Manifolds with Boundary Collars and Orientations
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Oriented Links, Braid Closures, and Markov Equivalence
- Partitions of Unity and Paracompactness
- Plane Graphs, Euler's Formula and the Five Colour Theorem
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Properties of the Integral and the Working FTC
- Rank Theorems and Embedded Submanifolds
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sard Theorem and Transversality
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Smooth Manifolds and Smooth Maps
- Smooth Partitions of Unity and Exhaustions
- Smooth Vector Bundles and Sections
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tangent Cotangent and the Differential
- Tensor Fields Exterior Algebra and Differential Forms
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Group
- The Fundamental Group of the Circle
- The Fundamental Theorems of Calculus
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Seifert–van Kampen Theorem
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Whitney Embedding Tubular Neighbourhoods and Approximation
2 · Logical flowchart
3 · Definitions, theorems and proofs
Finite planar codes for oriented knot diagrams
Definition
Work with smooth oriented knots in the standard oriented three-sphere; a knot is a one-component oriented link. A finite planar code for an oriented knot diagram consists of finite vertex and edge sets, incidence data, a cyclic order of the four half-edges at every crossing vertex, a pairing of opposite half-edges into the two local branches, an orientation of each edge, and a choice of which branch is over at each crossing. Every other vertex is a bend vertex of valence two. The code includes a finite plane-drawing certificate: rational coordinates for the vertices and bends, and a finite polygonal path for every edge. The certificate must realize the incidences and cyclic orders, have no edge self-intersection, and have pairwise disjoint edge interiors except at the specified bend and crossing vertices; at a crossing the two branches must be transverse. These conditions are checked by finitely many exact segment-intersection tests. Edge orientations must join coherently across each paired branch and each bend vertex, and following the edges through the crossing pairings and the degree-two bend vertices must give one oriented circle. Thus an admissible code represents a connected regular oriented diagram of a single knot. If there are no crossing vertices, the code is one oriented polygonal circle and has one arc. Smooth each bend in a small disk disjoint from all crossings and other edges; the resulting smooth diagram has the same crossing data.
An under-arc is a maximal portion of the oriented circle between consecutive points where the knot passes under at a crossing; the over branch is not cut. With no crossings the entire circle is the unique under-arc. A positive meridian of an oriented branch is the oriented boundary of a small normal disk, with disk orientation chosen so that the oriented tangent to the branch followed by the disk orientation agrees with the ambient orientation of . Planarity, incidence, orientation consistency, one-component tracing and the over/under data are input validity conditions; a procedure receiving an invalid finite record must report invalid input rather than repair it. The code stores no algebraic crossing sign: the oriented plane and the direction of the over branch determine which incident under branch is on its left and which is on its right.
A compact smooth knot has a choice-free normal tube
Statement
Let be the image of a compact smooth embedded circle, and let be the Euclidean normal-addition map . There is a real such that restricts to a diffeomorphism from onto an open neighborhood of . Moreover, strongly deformation retracts onto by pushing each nonzero normal vector radially to length . The construction uses only a finite cover of the compact circle and no choice axiom.
Statement references
Facts & Assumptions
Given: A compact smooth embedded circle and its Euclidean normal-addition map.
Normal addition is on the orthogonal normal bundle. The normal addition map for a Euclidean submanifold
At each zero vector , the differential of normal addition is an isomorphism, so the map is a local diffeomorphism near that point. Normal addition is a local diffeomorphism along the zero section
Every open cover of a compact metric space has a positive Lebesgue number: any subset of sufficiently small diameter lies in one member of the cover. Every open cover of a compact metric space has a Lebesgue number: a such that every nonempty subset of diameter less than lies inside a single member of the cover
A deformation retraction consists of a retraction and a homotopy from the identity to inclusion followed by retraction that fixes the retract pointwise. Retractions and deformation retracts, with a deformation retraction required to fix the retract pointwise
Proof
For each , [F2] supplies a local inverse neighborhood for . Form the set of all tuples consisting of a local trivialization, an open base set containing its center, and a radius such that lies in that injectivity neighborhood. These base sets cover . Compactness gives finitely many such tuples whose base sets cover ; their recorded radii have a positive finite minimum . The tuples are collected as a set of all witnesses and only a finite subfamily is extracted, so no point-indexed choice is used.
Apply [F3] to the finite cover of the metric space , obtaining . Choose . If with , then . Thus lies in one , and both and lie in the same recorded neighborhood where is injective; hence . Every point of the radius- tube also lies in one of those local-diffeomorphism neighborhoods, so the restriction is an injective local diffeomorphism.
An injective local diffeomorphism is open and has smooth local inverses that agree on overlaps. Therefore is a diffeomorphism onto its open image , which contains by [F1].
For , define and set for . The normal coordinates are unique by step 3.1, and the formula approaches the identity at , so these clauses paste continuously. It fixes the exterior pointwise and at sends every point in the punctured tube to its radius- boundary. Thus it is a deformation retraction of onto . Only finitely many local neighborhoods and a finite minimum were used.
A crossing-ball cover of a knot complement
Statement
Let be a smooth oriented knot with a regular diagram represented by a valid finite planar code, and let be its number of crossings. For , choose the closed tubular disk-bundle neighborhood formed from one product cap about each underpass and one product tube along each intervening upper arc, attached in the cyclic order of the knot and rounded in disjoint charts. Put . There is a subspace , fixed pointwise by a strong deformation retraction of , with a finite relative-open cover The space deformation retracts to a wedge of circles. With a common basepoint in the collar above the diagram and access paths in that collar extended into the arc charts, the positive under-arc meridians are its free basis. Each is contractible, is an open annulus around the -th crossing attachment, and distinct are disjoint. Thus meets and any previously attached crossing pieces precisely in .
For , choose a sufficiently small Euclidean normal tube and let be its exterior. The Euclidean complement has homotopy type , with the circle represented by the positive meridian. In particular its fundamental group is infinite cyclic; the extra sphere at infinity must not be discarded. In both cases the punctured chosen disk-bundle tube retracts radially to its boundary, giving a strong deformation retraction . These constructions require only finitely many charts and no choice axiom.
Statement references
Facts & Assumptions
Given: The knot, its finite diagram code, and a sufficiently small normal tube.
A finite regular code has underpassing points and, for , maximal under-arcs. Its finite drawing separates every pair of disjoint closed arc pieces by a positive distance. Finite planar codes for oriented knot diagrams
The compact-tube construction supplies Euclidean normal coordinates for the flat curve used in the zero-crossing reduction and a Euclidean normal tube when . A compact smooth knot has a choice-free normal tube
A CW subcomplex whose inclusion is a homotopy equivalence is a strong deformation retract; homotopic attaching maps of a CW pair give homotopy equivalent adjunction spaces. Cw homotopy equivalence inclusions are strong deformation retracts
Collapsing a supplied contractible CW subcomplex gives a homotopy equivalence. CW quotients and collapse of a contractible subcomplex
A simple polygon has its bounded polygonal region and the crossing-parity side structure. Polygonal Jordan curve theorem: a polygon has exactly two complementary regions and is the frontier of each
Wedges of circles have the free group on their circle loops, and the sphere is simply connected. The fundamental group of a finite wedge of circles is free of that rank, is simply connected for every , Seifert–van Kampen identifies the fundamental group with a group pushout
Proof
Cut out disjoint small underpass intervals, one in each crossing box. The remaining projected arcs are embedded and pairwise disjoint: an interior double point would have an underpassing preimage, which has been removed. Put these arcs at height , their ends in the plane , and join each pair of ends of a removed underpass below that plane. This normalization preserves the complement pair. Indeed, inside a crossing box the two branches retain a strict height inequality while their heights interpolate; away from these boxes projection is injective and vertical interpolation cannot introduce intersections. A change of height on a strand extends to a local ambient map , subdividing the interpolation so that . Finitely many disjoint strip charts, smooth cutoffs and parameter subdivisions suffice. Planar bends can likewise be straightened in their disjoint strip charts. All these maps are the identity in a common high collar.
For , first compare the actual smooth knot with a polygon, rather than identifying embeddings merely from the code. Its projection is a smooth embedded circle , so the knot is . Apply the finite compact-tube construction [F2] to the flat curve : the planar slice of its normal tube is an injective strip , with the positive unit planar normal. In this strip the ambient map , with and zero near the strip boundary, is a homeomorphism for each (it is a translation on every vertical fibre), and is the identity outside the strip. It flattens the actual knot. Uniform continuity of the tangent and the finite tube bounds then give a sufficiently fine inscribed polygon: each chord stays in the strip and its projection to the circle is strictly increasing, since its tangent has positive scalar product with the nearby oriented circle tangents. The polygonal projection has one full turn, so it is bijective, and the polygon is the normal graph . Choose the subdivision so . The fibre maps are strictly increasing homeomorphisms fixing the strip boundary; extended by the identity, they give an ambient planar isotopy carrying to this polygon. Its product with the identity in is an ambient three-dimensional isotopy. All subdivisions and bounds use a finite cover and one sufficiently large subdivision number. This relates the actual embedding to the polygon without any later diagram-code supplier.
Here is a precise convenient tunnel model for the normalized knot. In each crossing box choose a small convex polygonal footprint and a convex lower cap where is piecewise linear, negative inside and zero on its boundary. Take the lower arc to be the two straight segments from its two interior top-face endpoints to one interior point of . This replacement of the underpass is realized by vertical interpolation of its negative graph, fixing its endpoints. Each is a product neighborhood of that arc: radial coordinates from the interior vertex identify with a ball; on its boundary send two disjoint disks around the endpoints of a diameter to small disks around the two top endpoints, and extend radially. Such a boundary map is constructed by joining the disk centers by simple polygonal arcs, taking rectangular strips around those arcs, and using affine maps on a finite common triangulation; outside the strips it is the identity. Thus it identifies a standard cylinder core with the two-segment arc and its two end disks with the designated exits. Attach product tubes along the disjoint upper arcs to those exits. The resulting neighborhood has one cap and one upper tube per underpass, joined in the same single cycle as . The disk fibers on the caps and tubes use the specified exit-disk maps as transition maps, so they fit along the finite cyclic core to give a disk bundle over the circle; this verifies the tube structure rather than assuming an arbitrary regular neighborhood. Corners and the core bends can be rounded inside disjoint smaller charts; retain the polygonal cap boundary, which is only used topologically.
The polygon's bounded side is supplied by [F6]. Triangulate it by diagonals: at a convex vertex use its neighbor triangle if it contains no other vertex; otherwise join it to a vertex in that triangle farthest from the opposite side. The smaller open triangle contains no intervening vertex, so the diagonal is internal; induction on the vertex count yields a finite triangulation. A leaf of its triangle-adjacency tree is an ear , with ear tip and base . Remove any collinear vertices before this step. Put in the interior of . Choose and , with small positive , so the convex quadrilateral meets the rest of the polygon only at . Such bounds exist because the closed ear has no other polygon points, nonadjacent edges have positive separation, and the two remaining incident edges have a positive angle away from the ear; finite determinant and distance comparisons select the bounds. Both and are interior to . Triangulate by the fan from . On each fan triangle map its apex to , fix its two boundary vertices, and interpolate affinely. Since is convex and is always interior, the image triangles are a nondegenerate fan partition of the same quadrilateral. The resulting map is therefore injective, surjective and piecewise linear, fixes the whole boundary, and extends by the identity to an ambient plane isotopy. At it sends the two ear edges onto , while fixing all other polygon edges. This is an ambient straightening, not a collapse of a triangle to its base. Inductively remove the ears until a triangle remains. From an interior point of that triangle its boundary has a continuous positive radial-distance function ; the plane homeomorphism multiplying each ray's radius by sends it to a round circle. The products of these plane maps with the identity in identify the actual knot complement with the round-circle complement.
For , transport the rounded product disk-bundle neighborhood of step 2.1 back through the ambient normalization in step 1.1 and use it as . In each disk fiber of this tube write the normalized radial coordinate as . The homotopy fixes the fiber boundary and sends every nonzero fiber point to that boundary at ; extend it by the identity outside the tube. The formulas agree continuously at and fix the target pointwise, so they give a strong deformation retraction of onto . For , the same radial formula in the Euclidean normal coordinates of [F2] gives the stated retraction.
Take a large ball containing . Outside it, the homotopy , with the interior fixed, retracts the exterior to its truncation in . Its outer sphere is retained. Write . Below the plane, the exterior is exactly where on and is zero elsewhere; enlarge so every cap lies above the lower hemisphere. The top plates of the caps belong to as tube-boundary faces, except for the two exits occupied by upper tubes. Thus and is the equatorial disk with the interiors of the removed. On use and on the identity. These maps agree on the overlap, remain in the indicated vertical intervals, and paste continuously because the two sets are closed in . They fix their target pointwise. This proves the global strong deformation retraction, including the lower region and infinity.
The upper region is a ball with the neighborhoods of disjoint boundary-parallel arcs removed. The parallelism disks are the vertical curtains beneath their disjoint projected arcs. Their strip neighborhoods are disjoint. Cutting these strips off the upper half-ball leaves a ball with finitely many boundary indentations: flatten each indentation in its rectangular strip coordinate, fixing the other faces. The strip containing an arc is a ball with a straight diameter tube removed. In cylindrical coordinates this last space is whose second factor is a convex disk. Hence is a boundary connected sum of solid tori, glued through specified disks to the remaining ball. For an actual bouquet spine, cut each solid torus across a meridian disk and absorb its remaining ball into the central ball. The result is a central ball with product one-handles. Join the centers of the attaching disks to an interior point by disjoint star arms in that ball; after flattening the finitely many boundary disks, these are radial arms from their centers to the central point. Add the one-handle core intervals. The resulting embedded graph is a bouquet of circles, since every vertex other than the central one has degree two. To specify the CW structure for the relative contraction, use a finite polyhedral ball model for the central ball. Triangulate its boundary so that each attaching disk is a subcomplex and its center is a vertex, then cone that boundary triangulation to one interior vertex. Each radial star arm is an edge of this cone triangulation. The union of the attaching disks and these star edges is a finite CW subcomplex. It is contractible by contracting each disk to its center and then the star to the interior vertex. The central ball and are both nonempty and contractible, so the inclusion is a homotopy equivalence. By [F3], strongly deformation retracts onto , fixing pointwise; HEP alone is not being used to assert a contraction. Next contract every attaching disk linearly to its center, and contract the transverse disk factor of each product one-handle by the same linear factor. These formulas agree on the end disks and fix the star edges and handle cores, so they paste to a strong deformation retraction onto the stated bouquet. For each drilled arc, orient its graph loop to represent the based positive meridian. In an oriented normal-disk chart along the oriented knot tangent, choose the disk orientation so that tangent followed by disk orientation agrees with the ambient orientation, and traverse the disk boundary in its induced positive direction. In the complement product of the drilled tube, this boundary is the factor; contracting the disk factor and using the retained collar access path carries it to the corresponding bouquet loop. Thus the chosen generator is the positive meridian, not its inverse. Each such loop crosses precisely its own curtain once. Consequently [F5] identifies these positively oriented meridians as the free basis, rather than merely normal generators.
Fix disk coordinates and constants . In set and let be the complement of the union of the closed disks . These sets are relative-open: the cap interiors have their ordinary disk topology, their closures away from their boundary are disjoint from , and the omitted closed disks are closed in . They cover because . Each is an open disk, different are disjoint, and their overlaps with are exactly the annuli . On each outer collar, increasing its radius by retracts to , fixing . Step 5.1 supplies its meridian basis. Transfer these sets and the composed homotopies back through the finite normalizations in steps 1.1, 2.1 and 3.1. They give the stated subspace and cover in the original exterior.
For the resulting round circle use , , and infinity . Choose the angular coordinate so that increasing gives the positively oriented meridian (replace by if the carried knot orientation requires it). The map identifies with , and with . Choose a center-preserving homeomorphism from to . For , put and define The homotopy stays in the open square, fixes , and preserves . Therefore is a strong deformation retraction of onto : when , every point in the punctured fiber has , and is a positive scalar multiple of , so the homotopy never reaches the puncture. Rescaling the square gives . Write with the puncture at circle coordinate . For , the homotopy retracts onto the cube boundary, fixes both identified end faces pointwise, and therefore descends to the product quotient. Its image is a finite CW complex: the lateral faces form the torus , and the two square end faces become one disk attached along . Give its product CW structure with as a subcomplex; then is a contractible CW subcomplex of . By [F4], collapsing it is a homotopy equivalence, and the quotient is with collapsed. Cutting along gives a cylinder; after the two boundary copies of are collapsed to their common point, the quotient is a sphere with its two poles identified. To identify its homotopy type explicitly, let be with an interval attached at its two distinct poles. Give the finite CW structure in which the interval is a 1-cell and its endpoints are 0-cells, so the interval is a contractible subcomplex. Collapsing it identifies the poles, so [F4] makes homotopy equivalent to the sphere-with-poles-identified quotient. The two endpoint maps of the interval into are homotopic along a fixed path; choose this path to be the meridian cut at . By the attaching-map clause of [F3], is homotopy equivalent to the adjunction space with both endpoints attached at one pole, namely , and the new circle is the retained positive meridian. For this wedge with wedge point , choose and , and set These are open in the wedge topology and cover . The first deformation retracts to , the second to , so both are path-connected; their overlap is nonempty and contracts to by contracting each punctured summand to . Thus the sets and overlap satisfy the path-connected open-cover hypotheses of van Kampen [F5], which gives , generated by the positive meridian circle. Finally step 3.1 gives the asserted retraction onto in both cases.
Local meridian conjugacy at a Wirtinger crossing
Statement
Orient the projection plane by the viewing normal and the ambient orientation. At an oriented crossing let be the over-arc, and let be its positive in-plane normal: the ordered pair consisting of the over-tangent and is positive. Call the under-side from which points the source , and the side toward which it points the target . A positive meridian is the oriented boundary of a small normal disk whose orientation, preceded by the oriented knot tangent, is the ambient orientation. With the common upper-collar basing paths, the based positive meridians satisfy This side-based equation is independent of the direction of the understrand. In an oriented chart with over-tangent rightward, the target is the upper side and source the lower side , so equivalently . In incoming/outgoing notation, the outgoing under-meridian is if the under-tangent points along , and is otherwise. Reversing a chosen meridian loop inverts its class. Changing every common access path by the same based loop conjugates all three classes simultaneously.
Statement references
Local crossing chart
In the unrotated coordinates used in the proof, a rightward overstrand has upward positive normal, so its lower side is the source and its upper side the target. The drawing rotates that chart; the source and target are marked directly.
In this rotated chart the positive normal points northwest, from to . The equations, rather than the drawing, fix the convention.
Facts & Assumptions
Given: The oriented local crossing, the positive-meridian disk convention in the Statement, and common upper-collar access paths.
The crossing has the annular attachment and meridian-region paths of the crossing-ball construction. A crossing-ball cover of a knot complement
Fundamental-group multiplication is represented by loop concatenation; inverse paths give inverses and homotopic based loops give the same element. Based loops and the fundamental group, Loop classes form the group under concatenation
Attaching the contractible crossing region kills the image of its annular core normally. Seifert–van Kampen identifies the fundamental group with a group pushout, A group pushout is the quotient of a free product by the amalgamating relations
Proof
Take ambient coordinates with overstrand tangent , viewing normal , and positive projection basis . Source has and target , with the understrand below the overstrand. Parameterize the under-core from source to target by , whether or not this agrees with the knot orientation. Choose its product tube so that the oriented knot tangent followed by the ordered normal frame is ambient-positive; take the first normal-frame vector toward the positive- side of the understrand and the second to complete that orientation. Thus increasing angle from gives the positive meridian even when runs opposite to the knot orientation. Choose a small positive radius . The path used here is the push-off , from source to target; it never lies on the knot core. The two meridian loops are the boundaries , based at the endpoints of . For exterior paths take at least the removed tube radius; shrink that radius first if necessary. Choose the product tube disjoint from the overstrand and other arc pieces, and smaller than the crossing-chart separation bounds. Choose upper-collar paths to these actual boundary points. In the normal plane of the overstrand, their concatenation follows a small perturbation of the polygon , which has positive signed area. The polygon and a sufficiently small surrounding strip avoid the origin; the chosen radius makes the perturbation lie in that strip, so its winding is still . For explicit complement control, straighten the local under-core to in the product chart and take its upper push-off at . The access triangle is then entirely above , while the over-core projects to the origin. Radial interpolation of its positive polar-distance function to a sufficiently small circle about the origin stays inside that triangle minus the origin, hence above the under-core as well. Retain the positive-radius angular access in the under-tube until reaching these straightened paths. Thus the resulting homotopy is to one counterclockwise over-meridian and avoids both strands throughout. Thus all paths and homotopies lie in the complement, the loop represents , and rel endpoints there.
The positive-radius cylinder transports the boundary meridians, with its basepoint edge equal to . Its image misses the knot core and, by the separated tube choice, the overstrand and every other arc. Reading the boundary of this cylinder gives in the complement; its disk orientation is transported continuously even when the source-to-target direction opposes the knot orientation. Therefore . Equivalently the annular-core word bounds the cap of [F1], consistently with [F3]. Reversing the understrand orientation inverts both its meridians, so inversion gives the same side-based equation, rather than a switch of the conjugating direction.
The under-tangent follows exactly when incoming is source and outgoing is target, giving the first incoming/outgoing equation. Otherwise solve the same equation for to obtain the second. A reversed meridian is the inverse loop by [F2]. If a common access path is replaced by , the class becomes ; this holds for each of the three meridians. These observations prove all remaining assertions.
Removing the point at infinity preserves the knot group
Statement
Let be a compact smooth knot and let . The inclusion induces an isomorphism
Statement references
Facts & Assumptions
Given: A compact knot and a basepoint in its complement.
When a valid finite diagram code is supplied, the crossing-ball construction gives a path-connected knot complement. A crossing-ball cover of a knot complement
The two-sphere is simply connected at every basepoint. is simply connected for every
A path-connected space is simply connected when its fundamental group is trivial. Simply connected topological spaces
Van Kampen computes a path-connected open cover by a group pushout. Seifert–van Kampen identifies the fundamental group with a group pushout
If one open set and the overlap are simply connected, inclusion from the other set induces an isomorphism. A simply connected overlap turns the van Kampen pushout into a free product
A pointed inclusion induces a homomorphism on fundamental groups. The homomorphism on fundamental groups induced by a pointed continuous map
Induced fundamental-group maps are functorial under composition. Induced fundamental-group maps are well defined, functorial and invariant under based homotopy
Fundamental-group multiplication is induced by path concatenation, and inverse classes are represented by reversed loops. Loop classes form the group under concatenation
Proof
Since is compact, choose with and in the open ball . Put and . Then is an open ball about infinity, disjoint from , and . First verify that is path-connected without assuming a diagram code. Parameterize the smooth embedded circle by . For , the cone has three-dimensional outer volume zero: on each of finitely many smooth coordinate intervals of and each bounded interval , the defining map is Lipschitz on a compact rectangle; subdividing into squares of side covers its image by balls of radius , whose total three-dimensional volume is . Thus each truncated image has outer volume zero. For each , the finite chart and derivative bounds give an explicit cover volume after mesh size ; choosing makes the th truncated images of both cones have total cover volume below . These formula-defined mesh sizes give a cover of with total volume below for every , so the union has outer volume zero without a choice of covers. An open ball contains a cube of positive volume, so choose in an open ball outside . If the segment met at , then for some , contrary to ; similarly misses . The broken line from to to lies in . Under inversion , extended by , the set is the open ball of radius about . The radial homotopy contracts it to , so it is nonempty and path-connected. Since this ball is convex, every based loop contracts to its own basepoint by the straight-line homotopy inside the ball; [F3] therefore makes simply connected. The same inversion identifies with . Fix ; the puncture-preserving radial homotopy is a strong deformation retraction of this punctured ball onto the sphere . The punctured ball is path-connected. Choose , let be inclusion, and let be the radial retraction. Since the radial deformation fixes pointwise, [F7] and functoriality make and inverse isomorphisms at . By [F2], is trivial. For any other basepoint in the punctured ball, choose a path from to and use . Concatenation and reparameterization preserve endpoint-fixed homotopies, so this is a well-defined homomorphism. The inverse uses ; the inserted pairs and contract by the piecewise retracing homotopy, so the homomorphism is an isomorphism. Thus every basepoint group of the overlap is trivial; its nonemptiness and path-connectedness with [F3] make simply connected.
Choose . The open sets cover ; [F4] applies by the path-connectedness in step 1.1. Since and are simply connected by step 1.1, the special case [F5] shows that inclusion induces an isomorphism .
The inclusion induces the based map by [F6]. Choose a path in from to , which exists by step 1.1. The formula defines isomorphisms between the fundamental groups at these basepoints by the concatenation and retracing argument in step 1.1. Using the same path in makes the square with inclusion commute, since postcomposing the concatenated path gives the same loop. Thus the inclusion map at is conjugate by isomorphisms to the isomorphism at .
Wirtinger presentation from a finite diagram code
Definition
The input is a finite record and a designated starting under-arc of one oriented knot. First check that the vertex, edge, and segment lists are finite; that every vertex, bend, and point on an edge polyline has rational coordinates; and that each polyline has the prescribed incident endpoints. Before geometric tests, delete consecutive repeated coordinates from each polyline; reject an edge with no positive-length segment or a crossing with a zero-length incident ray. Check that every crossing has four incident half-edges, a recorded cyclic order and a pairing into alternating opposite branches, and one designated over-branch; every other vertex must be a valence-two bend. Check that edge orientations agree at bends and continue coherently through each paired branch, and that following these pairings and bends traces one oriented circle. If is not one of the resulting under-arcs, or any structural check fails, return invalid-input.
For every unordered pair of line segments, compute the determinant of their rational direction vectors. If it is nonzero, solve the two-coordinate intersection equations over and check whether the solution lies on both closed segments. If the determinant is zero, test collinearity and overlap by exact rational determinant and endpoint-order comparisons. Reject every positive-length overlap. Allow a singleton intersection only at the common endpoint of consecutive segments in one edge polyline, or at a shared declared bend or crossing vertex with the recorded endpoint incidences. Reject all other intersections, including all other self-intersections. At each crossing, sort the four nonzero incident rays by half-plane and exact determinant comparisons; reject the input if two rays have the same direction, if this geometric cyclic order disagrees with the recorded order, or if the paired branches do not alternate. These checks are finite.
After validation, traverse the oriented knot once from , label the maximal under-arcs , and introduce one symbol for the positive meridian of each . At each crossing, let the outgoing over-half-edge be the ray in the direction of the oriented over-tangent. In the verified counterclockwise cyclic order, the under-half-edge immediately following it is the target side ; the other under-half-edge is the source side . Read the over-arc and append exactly the relator . This rule uses the positive in-plane normal, which points counterclockwise from the oriented over-tangent, and does not depend on the under-strand direction. The orientation of each positive meridian is fixed by requiring the oriented knot tangent followed by its normal-disk orientation to give the ambient orientation. Use the diagram's common upper-collar access paths to base all meridians at one point in that collar. If the chosen complement basepoint lies elsewhere, prepend the same path from it to the collar basepoint to every access path. Interpret as the resulting based positive meridian. Return the finite group presentation with generators and one relator per crossing.
Correctness of the Wirtinger presentation
Statement
Let be a smooth oriented knot, let be a valid finite planar code for a regular diagram of , choose a basepoint in the complement, and designate a starting under-arc. The finite procedure terminates and returns a presentation with one positive-meridian generator for each under-arc and one crossing conjugacy relator for each crossing. For the based meridians determined by the diagram's common upper-collar paths from , the homomorphism from the presented group to that sends each generator to its corresponding based positive meridian is an isomorphism. Changing the designated starting under-arc only relabels the same finite cyclic arc set and gives an isomorphic presentation. If all basing paths are changed by prepending the same based loop, every generator image is conjugated by the same element, so the isomorphism type is unchanged.
Statement references
Facts & Assumptions
Given: A smooth oriented knot, its valid finite diagram code, a basepoint in the complement, and a designated base under-arc.
For , the exterior retracts to a cover by the meridian region and contractible crossing regions with annular overlaps; the meridian region retracts to the free meridian wedge. For , the Euclidean complement has homotopy type , with the circle represented by the positive meridian; its fundamental group is infinite cyclic on that meridian. A crossing-ball cover of a knot complement
With common upper-collar paths, the positive meridians satisfy ; reversed meridian orientation gives the inverse, and a common basing-path change conjugates all generators simultaneously. Local meridian conjugacy at a Wirtinger crossing
The open-cover fundamental group is the pushout of the inclusion maps. Seifert–van Kampen identifies the fundamental group with a group pushout
The pushout with a trivial crossing-piece group kills the normal closure of the annular-core image. A group pushout is the quotient of a free product by the amalgamating relations
The fundamental group of the meridian-region wedge is free on its standard loops. The fundamental group of a finite wedge of circles is free of that rank
A free group is the free object on its declared generator set. Free group on a set of generators
The returned presentation is the free group on its generators modulo the normal closure of its relators. Group presentation by generators and relations
A quotient by the relator normal closure has the presentation's universal property. A homomorphism that kills a normal subgroup factors uniquely through the quotient group
The inclusion from the Euclidean knot complement into the three-sphere complement induces an isomorphism. Removing the point at infinity preserves the knot group
The constructor checks the finite planar code, traverses its one component from the designated arc, and appends the stated meridian generators and crossing relators. Wirtinger presentation from a finite diagram code
The fundamental group of a circle is infinite cyclic on its once-around loop. is an isomorphism
Fundamental-group multiplication is induced by path concatenation, and inverse classes are represented by reversed loops. Loop classes form the group under concatenation
Proof
The input code has finite vertex, edge, segment and crossing lists, so the rational-coordinate, incidence, cyclic-order and starting-arc checks are finite. Each pairwise segment test uses terminating rational determinant, intersection and endpoint-order operations. A failed validation returns invalid-input. If validation succeeds, the one-component tracing follows the finite cyclic list of edges and paired half-edges from , returns to after finitely many steps, and labels each maximal under-arc once. The crossing pass then visits the finite crossing list once, reads each source and target from its verified cyclic order, appends exactly the corresponding positive-meridian relator, and returns the finite presentation. Thus the procedure terminates with one generator per under-arc and one relator per crossing, as claimed. If , the explicit punctured-product model in [F1] gives its fundamental group as infinite cyclic on the positive meridian (the sphere factor is simply connected), while [F6]–[F8] identify the returned one-generator empty-relator presentation with the same free cyclic group. If , [F1] and [F5] give the free meridian basis for the meridian region.
Assume and order the crossings . Let be the common collar basepoint in , and let and . For each , the relative-open cover has intersection , the annulus specified in [F1]. Choose on its core and use the supplied collar access path in from to . Concatenation and reparameterization make a well-defined homomorphism from loops based at to loops based at . Its inverse uses , since the inserted path-reversal pairs contract by the piecewise retracing homotopy. The same concatenation formula commutes with inclusion. Apply [F3] at : since is contractible, [F4] identifies with modulo the normal closure of the annular-core image. Compute that image in , before attaching any crossing piece. In the cap model of [F1], push its boundary to the top plate at ; deleting the two exit disks makes this plate a disk with two holes. Let be the exit meridians, and let run from their basepoints across the plate between the exits, below the over-arc. The oriented knot enters one exit and leaves the other, so their positive meridians have opposite planar orientations. Cutting the two-holed plate along access arcs reads its outer boundary, up to orientation and basing conjugacy, as . All these paths lie in . For the common collar paths , the loop represents in : in the over-normal plane it runs from the high collar down the source side, across below the over-arc, and back up the target side, winding once positively. Its straightening to the over-meridian stays above the plate and avoids both exit tubes and the over-tube. This is the same local path calculation as [F2], performed entirely in the upper region, without using an attached cap. Therefore the outer-boundary image is, up to conjugacy and inversion, . Its normal closure is exactly that of the constructor's relator, whether or not the understrand orientation follows the source-to-target direction. This computes the attaching word in the free group, rather than inferring it from an equation in the final complement. Distinct are disjoint, so these are precisely the intersections at every stage. Repeating over the finite crossing list kills exactly the normal closure of the constructor's relators.
By [F6] and [F7], the quotient in step 2.1 is the returned presentation group; [F8] identifies the quotient map with the homomorphism sending each symbol to its positive meridian. It is an isomorphism onto the group of the covered exterior by the pushout construction.
For , step 1.1 already identifies the returned cyclic presentation with the Euclidean complement group on the positive meridian. For , step 3.1 identifies the presentation with the covered exterior group, and the compact-tube retraction identifies that group with . In both cases [F9] then gives the isomorphism to , with exactly the stated positive-meridian assignment.
By [F2], replacing the common basing path conjugates every generator image by the same element. Simultaneous conjugation is an inner automorphism of the target group, so the resulting presentation group remains isomorphic to .
Changing the designated start arc reindexes the same finite list of under-arcs. The induced bijection of generator symbols carries each crossing's over/under labels, and therefore each constructor relator, to the corresponding relator in the new indexing. It extends to an isomorphism of the free groups and carries one relator normal closure onto the other; [F7] and [F8] give an isomorphism of the presented quotients.
Explicit unknot and figure-eight oriented Wirtinger codes
Statement
There are the following explicit valid finite planar codes, with the standard right/up orientation of the plane and positive based meridians using compatible common upper-collar access paths.
The counterclockwise square with vertices is a crossing-free unknot code. It has one under-arc and gives , with the positive meridian.
An oriented figure-eight code has crossings . The letters mean over and under, and mean incoming and outgoing. Its integer plane-drawing certificate is
The complete cyclic visit list is For every successive pair in this list, including the last-to-first pair, use the three straight segments of the route . At each crossing pair with , and with ; the first pair is over. Smooth the degree-two bends in disjoint small disks. The cyclic orders at crossings are the counterclockwise lists for and for .
Label the under-arcs , , , . In each oriented over-branch chart, let denote its left under-side (target of the positive in-plane normal), and its right under-side (source). The exact crossing table is
| crossing | over | (target) | (source) | under traversal | |
|---|---|---|---|---|---|
| target to source | |||||
| source to target | |||||
| source to target | |||||
| target to source |
Thus its actual positive-meridian presentation is The last relation follows from the first three. Starting on , the underpasses occur at , and the self-writhe is zero. All drawing data, validations and algebra in this statement are finite and use no choice axiom.
Statement references
Facts & Assumptions
Given: The integer coordinates, routes, orientation, branch pairings, over/under choices and square specified in the statement.
Finite planar codes for oriented knot diagrams specifies the exact rational drawing tests, one-component tracing, smoothing and under-arc convention.
Wirtinger presentation from a finite diagram code checks this finite input and emits one positive-meridian generator per under-arc, with crossing relation .
Local meridian conjugacy at a Wirtinger crossing proves that the over-tangent's positive in-plane normal points from source to target , and gives exactly the based positive-meridian rule in [F2].
Correctness of the Wirtinger presentation identifies that presentation with the fundamental group of the actual smooth knot complement, with these positive meridians.
Free group on a set of generators and Group presentation by generators and relations give the universal properties of the free group and of imposing the listed relators.
Every simple polygon admits a triangulation constructs a finite face-to-face triangulation of a simple filled polygon by vertical slabs and convex cells. Its finite polygon construction is used only to extend the paired face boundaries in the figure-eight admission.
Proof
The eight stated routes give 24 segments, 16 degree-two ports and four crossing vertices. Here is an exact reproducible intersection test for the displayed integers. For segments , with and , their intersection parameters are Retain the intersection just when . If , the test detects collinearity, and comparison of the two closed endpoint intervals in either nonconstant coordinate detects overlap. Applying these formulas to the table gives 276 unordered segment pairs: precisely 40 meet, each solely at its common declared endpoint, and the other 236 are disjoint. The 40 consist of one pair at each of the 16 ports and six pairs at each of the four crossing centers. No pair overlaps in positive length. At each center the and triples are collinear with the center strictly between the ports. The determinants of the full oriented over/under vectors are respectively , so those are transverse opposite pairs with exactly the stated cyclic orders. The cyclic visit list uses every branch once, and following the paired branches gives that single list, not several circles. Hence every validity condition in [F1] holds. Finitely many nonincident compact segments have positive distance, so sufficiently small disjoint bend disks introduce no new crossing; over/under height separation in the crossing disks realizes the smooth knot.
The geometric figure-eight admission can be checked without inferring knot type from a group presentation. Draw the downward three-strand braid with successive crossings , where a positive generator has its left strand over, and close corresponding endpoints outside the braid rectangle without additional crossings. Number its successive crossings . Following its first top strand through the closure gives exactly . In right/up plane coordinates its positive-generator over and under tangents point respectively down-right and down-left, giving negative determinant; the negative generator reverses that sign. Thus the four labeled determinants are . Together with the visit list these determine precisely the cyclic orders in the statement. For an additional check, the six face boundary cycles, listing each departure port and then taking the next counterclockwise port after traversing its edge, are These are the same two bigons and four triangular faces of that closed braid drawing; the table merely subdivides its eight edges at their ports. To see that this comparison concerns embeddings, take small crossing disks and narrow edge rectangles in each drawing. The identical cyclic orders identify these neighborhoods respecting over/under pairs. The six face boundaries are simple polygonal circles. Their disk coordinates can be obtained by the elementary finite polygon construction: use the vertical-slab convex-cell triangulation of [F6] and peel boundary triangles to identify the filled polygon with a disk. At each peeling step a triangle with one boundary edge and interior opposite vertex leaves a disk; if all vertices of the remaining triangulation are on its boundary, the dual is a finite tree and a leaf triangle has two boundary edges. Reversing these elementary triangle attachments gives disk coordinates with the prescribed boundary parametrization. Matching the resulting boundary circle coordinates extends over the disk by . Applying this to each paired face extends the neighborhood identification over every face; the exterior is treated as a disk on the sphere. After rounding, this is the same regular spherical diagram, and choosing the same outer face gives the planar diagram. The closed braid just described is the standard two-clasp four-crossing figure-eight diagram (equivalently its usual alternating closed-three-braid description). This verifies admission by the full embedded diagram, not solely its under-arc relators.
Cutting the oriented visit circle at its four visits gives the four claimed under-arcs. The intervening visits put on , on , on , and on . For a direct side check, let . The values of are ; those of are . Positive values are the left side. This proves every entry of the crossing table, including which underpass follows the positive normal. By [F2] and [F3], is equivalently . Substitution of the four rows gives exactly as displayed. By [F4] these are the actual complement group and positive meridians. Starting at the underpasses are and the corresponding crossing signs sum to .
In the group with the first three relators, left-multiply by and then use and to obtain Right cancellation gives , which is precisely . Conversely imposing all four imposes the first three, so [F5] gives inverse identity-on-generator quotient maps. Thus deletion of the fourth relator changes neither the group nor the meridian assignment.
The square is a simple crossing-free polygon with coherent counterclockwise orientation and one component, so it is a valid code with a single under-arc and no crossing scan. Rounding it gives the ordinary planar unknot. By [F2] and [F4] its complement group is . Define the homomorphism from this free group to by , using [F5], and the homomorphism back by . Their composites fix the generator and all integers, respectively, and are identities; the first claim also follows from uniqueness in [F5]. This proves the asserted infinite cyclic group on the positive meridian without imposing any nonexistent crossing relator.
4 · Examples, counterexamples and false statements
None yet.
Sources
- Danny Calegari, Introduction to Knot Theory, §4.2, pp. 34–36
- Cole Charbonneau, Computing the Wirtinger Presentation of a Knot Group from a Knot Diagram, §§1.2–3.2
- John Stillwell, Classical Topology and Combinatorial Group Theory, §4.2.4, Wirtinger presentation proof
- Cole Charbonneau, Computing the Wirtinger Presentation of a Knot Group from a Knot Diagram, §2
- Stefan Friedl, Knot Theory, §5.3, proof of the Wirtinger Presentation Proposition
- Danny Calegari, Introduction to Knot Theory, §4.2, printed pp. 34–36
- John Stillwell, Classical Topology and Combinatorial Group Theory, §4.2.4
- Cole Charbonneau, Computing the Wirtinger Presentation of a Knot Group from a Knot Diagram, §§2–3
- Stefan Friedl, Knot Theory, Lemma 5.8, printed/PDF p. 74