Alphabeta Math
Pipeline-generated
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.

✓ 6 results · all verified · 3 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full by a delegated reviewing agent on the owner's instruction; the judge is an additional, independent cross-model AI review of the proofs. The 3 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Wirtinger presentations and knot groups

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

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 S3. 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.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

A compact smooth knot has a choice-free normal tube

Statement

Let K⊂R3 be the image of a compact smooth embedded circle, and let E:N⊥K→R3 be the Euclidean normal-addition map E(p,v)=p+v. There is a real ε>0 such that E restricts to a diffeomorphism from {(p,v):∥v∥<ε} onto an open neighborhood Nε of K. Moreover, R3∖K strongly deformation retracts onto R3∖Nε by pushing each nonzero normal vector radially to length ε. The construction uses only a finite cover of the compact circle and no choice axiom.

Facts & Assumptions

Given: A compact smooth embedded circle K⊂R3 and its Euclidean normal-addition map.

[F1]

Normal addition is E(p,v)=p+v on the orthogonal normal bundle. The normal addition map for a Euclidean submanifold

[F2]

At each zero vector (p,0), 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

[F3]

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 δ>0 such that every nonempty subset of diameter less than δ lies inside a single member of the cover

[F4]

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

1.1givenF2choose

For each p∈K, [F2] supplies a local inverse neighborhood for E. Form the set of all tuples consisting of a local trivialization, an open base set O containing its center, and a radius r>0 such that O×{v:∥v∥<r} lies in that injectivity neighborhood. These base sets cover K. Compactness gives finitely many such tuples whose base sets Oi cover K; their recorded radii have a positive finite minimum r0. The tuples are collected as a set of all witnesses and only a finite subfamily is extracted, so no point-indexed choice is used.

2.1F2F3step 1.1choosealgebra

Apply [F3] to the finite cover {Oi} of the metric space K, obtaining δ>0. Choose 0<ε<min⁡{r0,δ/3}. If E(p,v)=E(q,w) with ∥v∥,∥w∥<ε, then ∥p−q∥=∥w−v∥<2ε<δ. Thus {p,q} lies in one Oi, and both (p,v) and (q,w) lie in the same recorded neighborhood where E is injective; hence (p,v)=(q,w). Every point of the radius-ε tube also lies in one of those local-diffeomorphism neighborhoods, so the restriction is an injective local diffeomorphism.

3.1F1step 2.1

An injective local diffeomorphism is open and has smooth local inverses that agree on overlaps. Therefore E is a diffeomorphism onto its open image Nε, which contains K by [F1].

4.1F1F4step 3.1construct∎

For x=E(p,v)∈Nε∖K, define Ht(x)=E ⁣(p,(1−t)∥v∥+tε∥v∥v),0≤t≤1, and set Ht(x)=x for x∉Nε. The normal coordinates are unique by step 3.1, and the formula approaches the identity at ∥v∥=ε, so these clauses paste continuously. It fixes the exterior pointwise and at t=1 sends every point in the punctured tube to its radius-ε boundary. Thus it is a deformation retraction of R3∖K onto R3∖Nε. Only finitely many local neighborhoods and a finite minimum were used.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

A crossing-ball cover of a knot complement

Statement

Let K⊂R3 be a smooth oriented knot with a regular diagram represented by a valid finite planar code, and let c be its number of crossings. For c>0, choose the closed tubular disk-bundle neighborhood N(K) 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 EK=R3∖int⁡N(K). There is a subspace Y⊂EK, fixed pointwise by a strong deformation retraction of EK, with a finite relative-open cover Y=U∪V1∪⋯∪Vc. The space U deformation retracts to a wedge of c 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 Vi is contractible, U∩Vi is an open annulus around the i-th crossing attachment, and distinct Vi are disjoint. Thus Vi meets U and any previously attached crossing pieces precisely in U∩Vi.

For c=0, choose a sufficiently small Euclidean normal tube and let EK be its exterior. The Euclidean complement has homotopy type S1∨S2, 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 R3∖K→EK. These constructions require only finitely many charts and no choice axiom.

Facts & Assumptions

Given: The knot, its finite diagram code, and a sufficiently small normal tube.

[F1]

A finite regular code has c underpassing points and, for c>0, c 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

[F2]

The compact-tube construction supplies Euclidean normal coordinates for the flat curve used in the zero-crossing reduction and a Euclidean normal tube when c=0. A compact smooth knot has a choice-free normal tube

[F3]

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

[F4]

Collapsing a supplied contractible CW subcomplex gives a homotopy equivalence. CW quotients and collapse of a contractible subcomplex

[F6]

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

Proof

1.1givenF1construct

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 1, their ends in the plane z=0, 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 d(q) on a strand extends to a local ambient map (q,z)↦(q,z+χ(z)d(q)), subdividing the interpolation so that 1+χ′(z)d(q)>0. 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.

1.2F1F2construct

For c=0, 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 (γ(s),g(s)). Apply the finite compact-tube construction [F2] to the flat curve (γ(s),0): the planar slice of its normal tube is an injective strip Ψ(s,r)=γ(s)+rn(s), with n the positive unit planar normal. In this strip the ambient map (Ψ(s,r),z)↦(Ψ(s,r),z−tχ(r)g(s)), with χ(0)=1 and χ zero near the strip boundary, is a homeomorphism for each t (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 r=f(s). Choose the subdivision so ∥f∥∞∥χ′∥∞<1. The fibre maps r↦r+tχ(r)f(s) 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 z 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.

2.1F1step 1.1construct

Here is a precise convenient tunnel model for the normalized knot. In each crossing box choose a small convex polygonal footprint Fi and a convex lower cap Ci={(q,z):q∈Fi, hi(q)≤z≤0}, where hi is piecewise linear, negative inside Fi 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 Ci. This replacement of the underpass is realized by vertical interpolation of its negative graph, fixing its endpoints. Each Ci is a product neighborhood of that arc: radial coordinates from the interior vertex identify Ci 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 N∗ has one cap and one upper tube per underpass, joined in the same single cycle as K. 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.

2.2F1F6step 1.2construct

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 uvw, with ear tip v and base uw. Remove any collinear vertices before this step. Put q in the interior of uw. Choose z+=q+(1+η)(v−q) and z−=q−ϵ(v−q), with small positive η,ϵ, so the convex quadrilateral Q=(u,z+,w,z−) meets the rest of the polygon only at u,w. 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 v and q are interior to Q. Triangulate Q by the fan from v. On each fan triangle map its apex v to vt=(1−t)v+tq, fix its two boundary vertices, and interpolate affinely. Since Q is convex and vt 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 t=1 it sends the two ear edges uv,vw onto uq,qw, 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 R(θ); the plane homeomorphism multiplying each ray's radius by 1/R(θ) sends it to a round circle. The products of these plane maps with the identity in z identify the actual knot complement with the round-circle complement.

3.1F2step 1.1step 2.1construct

For c>0, transport the rounded product disk-bundle neighborhood N∗ of step 2.1 back through the ambient normalization in step 1.1 and use it as N(K). In each disk fiber of this tube write the normalized radial coordinate as r∈[0,1]. The homotopy r↦(1−s)r+s fixes the fiber boundary and sends every nonzero fiber point to that boundary at s=1; extend it by the identity outside the tube. The formulas agree continuously at r=1 and fix the target pointwise, so they give a strong deformation retraction of R3∖K onto EK. For c=0, the same radial formula in the Euclidean normal coordinates of [F2] gives the stated retraction.

4.1step 2.1step 3.1construct

Take a large ball BR containing N∗. Outside it, the homotopy x↦((1−s)+sR/∣x∣)x, with the interior fixed, retracts the exterior to its truncation X in BR. Its outer sphere is retained. Write A=X∩{z≥0}. Below the plane, the exterior is exactly B={(q,z):−R2−∣q∣2≤z≤h(q)}, where h=hi on Fi and is zero elsewhere; enlarge R so every cap lies above the lower hemisphere. The top plates of the caps belong to A as tube-boundary faces, except for the two exits occupied by upper tubes. Thus X=A∪B and A∩B is the equatorial disk with the interiors of the Fi removed. On B use (q,z)↦(q,(1−s)z+sh(q)) and on A the identity. These maps agree on the overlap, remain in the indicated vertical intervals, and paste continuously because the two sets are closed in X. They fix their target Y∗=A∪⋃iDi,Di={(q,hi(q)):q∈Fi}, pointwise. This proves the global strong deformation retraction, including the lower region and infinity.

5.1F3F5step 1.1step 4.1construct

The upper region A is a ball with the neighborhoods of c 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 S1×{(r,z):r≥ϵ, r2+z2≤1}, whose second factor is a convex disk. Hence A is a boundary connected sum of c 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 c product one-handles. Join the centers of the 2c 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 c 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 C 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 B0 and C are both nonempty and contractible, so the inclusion C↪B0 is a homotopy equivalence. By [F3], B0 strongly deformation retracts onto C, fixing C 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 S1×D2 of the drilled tube, this boundary is the S1 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.

6.1step 4.1step 5.1construct

Fix disk coordinates ϕi:D‾2→Di and constants 0<r0<r1<1. In Y∗ set Vi=ϕi({∣v∣<r1}) and let U be the complement of the union of the closed disks ϕi({∣v∣≤r0}). These sets are relative-open: the cap interiors have their ordinary disk topology, their closures away from their boundary are disjoint from A, and the omitted closed disks are closed in Y∗. They cover because r0<r1. Each Vi is an open disk, different Vi are disjoint, and their overlaps with U are exactly the annuli r0<∣v∣<r1. On each outer collar, increasing its radius by r↦(1−s)r+s retracts U to A, fixing A. 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.

7.1F3F4F5step 1.2step 2.2step 3.1construct∎

For the resulting round circle use S3⊂C2, K={z1=0}, and infinity p=(1,0). Choose the angular coordinate so that increasing t gives the positively oriented meridian (replace t by −t if the carried knot orientation requires it). The map (w,eit)⟼(1−∣w∣2eit,w) identifies S3∖K with D∘×S1, and p with (0,1). Choose a center-preserving homeomorphism from D∘ to (−1,1)2. For q∈(−1,1)2, put r=∥q∥∞ and define c(q)={q,r≤12,q/(2r),r>12. The homotopy Cs(q)=(1−s)q+sc(q) stays in the open square, fixes [−12,12]2, and preserves q=0. Therefore (q,z)↦(Cs(q),z) is a strong deformation retraction of (D∘×S1)∖{(0,1)} onto ([−1/2,1/2]2×S1)∖{(0,1)}: when z=1, every point in the punctured fiber has q≠0, and Cs(q) is a positive scalar multiple of q, so the homotopy never reaches the puncture. Rescaling the square gives ([−1,1]2×S1)∖{(0,1)}. Write S1=[−1,1]/(−1∼1) with the puncture at circle coordinate 0. For v∈[−1,1]3∖{0}, the homotopy Hs(v)=(1−s+s∥v∥∞)v retracts onto the cube boundary, fixes both identified end faces pointwise, and therefore descends to the product quotient. Its image X0 is a finite CW complex: the lateral faces form the torus T=∂[−1,1]2×S1, and the two square end faces become one disk D2 attached along ℓ=∂[−1,1]2×{1}. Give T its product CW structure with ℓ as a subcomplex; then D2 is a contractible CW subcomplex of X0. By [F4], collapsing it is a homotopy equivalence, and the quotient is T with ℓ collapsed. Cutting T 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 Z be S2 with an interval attached at its two distinct poles. Give Z 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 Z homotopy equivalent to the sphere-with-poles-identified quotient. The two endpoint maps of the interval into S2 are homotopic along a fixed path; choose this path to be the eit meridian cut at t=0. By the attaching-map clause of [F3], Z is homotopy equivalent to the adjunction space with both endpoints attached at one pole, namely S2∨S1, and the new circle is the retained positive meridian. For this wedge with wedge point w, choose q∈S2∖{w} and r∈S1∖{w}, and set A=S1∪(S2∖{q}),B′=(S1∖{r})∪S2. These are open in the wedge topology and cover S1∨S2. The first deformation retracts to S1, the second to S2, so both are path-connected; their overlap (S1∖{r})∪(S2∖{q}) is nonempty and contracts to w by contracting each punctured summand to w. Thus the sets and overlap satisfy the path-connected open-cover hypotheses of van Kampen [F5], which gives π1(S1∨S2,w)≅π1(S1,w)∗π1(S2,w)≅Z∗1≅Z, generated by the positive meridian circle. Finally step 3.1 gives the asserted retraction onto EK in both cases.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

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 o be the over-arc, and let no be its positive in-plane normal: the ordered pair consisting of the over-tangent and no is positive. Call the under-side from which no points the source s, and the side toward which it points the target t. 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 mt=mo−1msmo. 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 L and source the lower side R, so equivalently mR=momLmo−1. In incoming/outgoing notation, the outgoing under-meridian is mo−1minmo if the under-tangent points along no, and is mominmo−1 otherwise. Reversing a chosen meridian loop inverts its class. Changing every common access path by the same based loop conjugates all three classes simultaneously.

Local crossing chart

In the unrotated coordinates used in the proof, a rightward overstrand has upward positive normal, so its lower side R is the source and its upper side L the target. The drawing rotates that chart; the source and target are marked directly.

sto

In this rotated chart the positive normal points northwest, from s to t. 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.

[F1]

The crossing has the annular attachment and meridian-region paths of the crossing-ball construction. A crossing-ball cover of a knot complement

[F2]

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 π1(X,x0) under concatenation

Proof

1.1givenF1F2construct

Take ambient coordinates (x,y,z) with overstrand tangent +∂x, viewing normal +∂z, and positive projection basis (∂x,∂y). Source has y<0 and target y>0, with the understrand below the overstrand. Parameterize the under-core from source to target by u, whether or not this agrees with the knot orientation. Choose its product tube Φ(u,v) so that the oriented knot tangent followed by the ordered normal frame is ambient-positive; take the first normal-frame vector toward the positive-z side of the understrand and the second to complete that orientation. Thus increasing angle from θ0=0 gives the positive meridian even when u runs opposite to the knot orientation. Choose a small positive radius r. The path used here is the push-off β(u)=Φ(u,r(cos⁡θ0,sin⁡θ0)), from source to target; it never lies on the knot core. The two meridian loops are the boundaries μu(τ)=Φ(u,r(cos⁡(θ0+2πτ),sin⁡(θ0+2πτ))), based at the endpoints of β. For exterior paths take r 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 r smaller than the crossing-chart separation bounds. Choose upper-collar paths αs,αt to these actual boundary points. In the normal (y,z) plane of the overstrand, their concatenation αsβαt−1 follows a small perturbation of the polygon (0,H),(−d,−h),(d,−h),(0,H), 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 +1. For explicit complement control, straighten the local under-core to x=0,z=−h in the product chart and take its upper push-off at z=−h+r. The access triangle is then entirely above z=−h, 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 mo, and αt≃mo−1αsβ rel endpoints there.

2.1F1F2F3step 1.1algebra

The positive-radius cylinder (u,τ)↦Φ(u,r(cos⁡(θ0+2πτ),sin⁡(θ0+2πτ))) 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 βμtβ−1≃μs in the complement; its disk orientation is transported continuously even when the source-to-target direction opposes the knot orientation. Therefore [αtμtαt−1]=mo−1[αsβμtβ−1αs−1]mo=mo−1msmo. Equivalently the annular-core word mo−1msmomt−1 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.

3.1F2step 2.1algebra∎

The under-tangent follows no exactly when incoming is source and outgoing is target, giving the first incoming/outgoing equation. Otherwise solve the same equation for ms to obtain the second. A reversed meridian is the inverse loop by [F2]. If a common access path α is replaced by λα, the class [αμα−1] becomes [λ][αμα−1][λ]−1; this holds for each of the three meridians. These observations prove all remaining assertions.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Removing the point at infinity preserves the knot group

Statement

Let K⊂R3 be a compact smooth knot and let b∈R3∖K. The inclusion R3∖K↪S3∖K induces an isomorphism π1(R3∖K,b)→ ≅ π1(S3∖K,b).

Facts & Assumptions

Given: A compact knot K⊂R3 and a basepoint b in its complement.

[F1]

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

[F2]

The two-sphere is simply connected at every basepoint. Sn is simply connected for every n≥2

[F3]

A path-connected space is simply connected when its fundamental group is trivial. Simply connected topological spaces

[F4]

Van Kampen computes a path-connected open cover by a group pushout. Seifert–van Kampen identifies the fundamental group with a group pushout

[F5]

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

[F6]

A pointed inclusion induces a homomorphism on fundamental groups. The homomorphism on fundamental groups induced by a pointed continuous map

[F7]

Induced fundamental-group maps are functorial under composition. Induced fundamental-group maps are well defined, functorial and invariant under based homotopy

[F8]

Fundamental-group multiplication is induced by path concatenation, and inverse classes are represented by reversed loops. Loop classes form the group π1(X,x0) under concatenation

Proof

1.1givenF2F3F7F8chooseconstruct

Since K is compact, choose R>0 with K and b in the open ball D=BR(0). Put U=S3∖(K∪{∞})=R3∖K and V=S3∖D‾. Then V is an open ball about infinity, disjoint from K, and U∩V=V∖{∞}. First verify that U is path-connected without assuming a diagram code. Parameterize the smooth embedded circle by k:S1→K. For p∈U, the cone Cp={p+t(k(s)−p):s∈S1, t≥1} has three-dimensional outer volume zero: on each of finitely many smooth coordinate intervals of S1 and each bounded interval 1≤t≤n, the defining map is Lipschitz on a compact rectangle; subdividing into O(N2) squares of side 1/N covers its image by balls of radius O(1/N), whose total three-dimensional volume is O(1/N). Thus each truncated image has outer volume zero. For each n, the finite chart and derivative bounds give an explicit cover volume An/N after mesh size 1/N; choosing Nn>2n+2An/ϵ makes the nth truncated images of both cones have total cover volume below ϵ2−n−1. These formula-defined mesh sizes give a cover of Cp∪Cq with total volume below ϵ for every ϵ>0, so the union has outer volume zero without a choice of covers. An open ball contains a cube of positive volume, so choose r in an open ball outside Cp∪Cq. If the segment [p,r] met K at k(s), then r=p+t(k(s)−p) for some t≥1, contrary to r∉Cp; similarly [q,r] misses K. The broken line from p to r to q lies in U. Under inversion J(x)=x/∥x∥2, extended by J(∞)=0, the set V is the open ball of radius 1/R about 0. The radial homotopy y↦(1−t)y contracts it to 0, 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 V simply connected. The same inversion identifies U∩V with 0<∥y∥<1/R. Fix ρ=1/(2R); the puncture-preserving radial homotopy y⟼((1−t)+tρ∥y∥)y is a strong deformation retraction of this punctured ball onto the sphere Sρ2. The punctured ball is path-connected. Choose y0∈Sρ2, let i:Sρ2↪U∩V be inclusion, and let r be the radial retraction. Since the radial deformation fixes Sρ2 pointwise, [F7] and functoriality make i∗ and r∗ inverse isomorphisms at y0. By [F2], π1(Sρ2,y0) is trivial. For any other basepoint y in the punctured ball, choose a path γ from y to y0 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 U∩V simply connected.

2.1F4F5step 1.1

Choose b0∈U∩V. The open sets U,V cover S3∖K; [F4] applies by the path-connectedness in step 1.1. Since V and U∩V are simply connected by step 1.1, the special case [F5] shows that inclusion induces an isomorphism π1(U,b0)→π1(S3∖K,b0).

3.1F6F7F8step 1.1step 2.1construct∎

The inclusion induces the based map by [F6]. Choose a path γ in U from b to b0, 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 S3∖K makes the square with inclusion commute, since postcomposing the concatenated path gives the same loop. Thus the inclusion map at b is conjugate by isomorphisms to the isomorphism at b0.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicableprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Wirtinger presentation from a finite diagram code

Definition

The input is a finite record D and a designated starting under-arc a0 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 a0 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 Q 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 a0, label the maximal under-arcs a1,…,am, and introduce one symbol xi for the positive meridian of each ai. 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 at; the other under-half-edge is the source side as. Read the over-arc ao and append exactly the relator xo−1xsxoxt−1. 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 xi as the resulting based positive meridian. Return the finite group presentation with generators x1,…,xm and one relator per crossing.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Correctness of the Wirtinger presentation

Statement

Let K⊂S3 be a smooth oriented knot, let D be a valid finite planar code for a regular diagram of K, choose a basepoint b in the complement, and designate a starting under-arc. The finite procedure Wirtinger(D,a0) 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 b, the homomorphism from the presented group to π1(S3∖K,b) 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.

Facts & Assumptions

Given: A smooth oriented knot, its valid finite diagram code, a basepoint in the complement, and a designated base under-arc.

[F1]

For c>0, 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 c=0, the Euclidean complement has homotopy type S1∨S2, 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

[F2]

With common upper-collar paths, the positive meridians satisfy mt=mo−1msmo; reversed meridian orientation gives the inverse, and a common basing-path change conjugates all generators simultaneously. Local meridian conjugacy at a Wirtinger crossing

[F3]

The open-cover fundamental group is the pushout of the inclusion maps. Seifert–van Kampen identifies the fundamental group with a group pushout

[F4]

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

[F5]

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

[F6]

A free group is the free object on its declared generator set. Free group on a set of generators

[F7]

The returned presentation is the free group on its generators modulo the normal closure of its relators. Group presentation by generators and relations

[F8]

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

[F9]

The inclusion from the Euclidean knot complement into the three-sphere complement induces an isomorphism. Removing the point at infinity preserves the knot group

[F10]

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

[F11]

The fundamental group of a circle is infinite cyclic on its once-around loop. Deg⁡:π1(R/Z,[0])→(Z,+) is an isomorphism

[F12]

Fundamental-group multiplication is induced by path concatenation, and inverse classes are represented by reversed loops. Loop classes form the group π1(X,x0) under concatenation

Proof

1.1F1F5F6F7F8F10F11givenconstructalgebra

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 a0, returns to a0 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 c=0, 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 c>0, [F1] and [F5] give the free meridian basis for the meridian region.

2.1F1F2F3F4F12step 1.1constructalgebra

Assume c>0 and order the crossings v1,…,vc. Let b∗ be the common collar basepoint in U, and let X0=U and Xi=U∪V1∪⋯∪Vi. For each i, the relative-open cover Xi=Xi−1∪Vi has intersection Ai=U∩Vi, the annulus specified in [F1]. Choose qi on its core and use the supplied collar access path γi in U from b∗ to qi. Concatenation and reparameterization make [α]↦[γˉi∗α∗γi] a well-defined homomorphism from loops based at b∗ to loops based at qi. Its inverse uses γˉi, since the inserted path-reversal pairs contract by the piecewise retracing homotopy. The same concatenation formula commutes with inclusion. Apply [F3] at qi: since Vi is contractible, [F4] identifies π1(Xi,qi) with π1(Xi−1,qi) modulo the normal closure of the annular-core image. Compute that image in π1(U,b∗), before attaching any crossing piece. In the cap model of [F1], push its boundary to the top plate at z=0; deleting the two exit disks makes this plate a disk with two holes. Let μs,μt 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 μsημt−1η−1. All these paths lie in A⊂U. For the common collar paths αs,αt, the loop αsηαt−1 represents mo in U: in the over-normal (y,z) 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, msmomt−1mo−1=mo(mo−1msmomt−1)mo−1. 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 Vi 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.

3.1F3F4F6F7F8step 2.1algebra

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.

4.1F1F9step 1.1step 3.1algebra

For c=0, step 1.1 already identifies the returned cyclic presentation with the Euclidean complement group on the positive meridian. For c>0, step 3.1 identifies the presentation with the covered exterior group, and the compact-tube retraction identifies that group with π1(R3∖K). In both cases [F9] then gives the isomorphism to π1(S3∖K), with exactly the stated positive-meridian assignment.

5.1F2step 4.1algebra

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 π1(S3∖K).

6.1F7F8F10algebra∎

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.

LemmaStatement: AI-adaptedProof: AI-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

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 (0,0),(1,0),(1,1),(0,1) is a crossing-free unknot code. It has one under-arc and gives π1(S3∖U)=⟨x∣ ⟩≅Z, with x the positive meridian.

An oriented figure-eight code has crossings C1,C2,C3,C4. The letters O,U mean over and under, and i,o mean incoming and outgoing. Its integer plane-drawing certificate is

rCrrOirOorUirUo
1(−423,0)(−627,102)(−363,−30)(−363,30)(−627,−102)
2(0,−9)(−33,−6)(99,−18)(−99,−18)(33,−6)
3(0,9)(33,6)(−99,18)(99,18)(−33,6)
4(423,0)(627,−102)(363,30)(363,−30)(627,102)

The complete cyclic visit list is 1O, 2U, 3O, 1U, 4O, 3U, 2O, 4U. For every successive pair rB,sD in this list, including the last-to-first pair, use the three straight segments of the route Cr→rBo→sDi→Cs. At each crossing pair rOi with rOo, and rUi with rUo; the first pair is over. Smooth the degree-two bends in disjoint small disks. The cyclic orders at crossings are the counterclockwise lists (rOo,rUi,rOi,rUo) for r=1,4 and (rOo,rUo,rOi,rUi) for r=2,3.

Label the under-arcs x1:U4→U2, x2:U2→U1, x3:U1→U3, x4:U3→U4. In each oriented over-branch chart, let L denote its left under-side (target of the positive in-plane normal), and R its right under-side (source). The exact crossing table is

crossingoverL (target)R (source)under traversalsign⁡det⁡(over,under)
R1x1x2x3target to source−1
R2x4x2x1source to target+1
R3x2x4x3source to target+1
R4x3x4x1target to source−1

Thus its actual positive-meridian presentation is π1(S3∖41)=⟨x1,x2,x3,x4∣x1x2=x3x1, x1x4=x4x2, x3x2=x2x4, x3x4=x1x3⟩. The last relation follows from the first three. Starting on x1, the underpasses occur at R2,R1,R3,R4, and the self-writhe is zero. All drawing data, validations and algebra in this statement are finite and use no choice axiom.

Facts & Assumptions

Given: The integer coordinates, routes, orientation, branch pairings, over/under choices and square specified in the statement.

[F1]

Finite planar codes for oriented knot diagrams specifies the exact rational drawing tests, one-component tracing, smoothing and under-arc convention.

[F2]

Wirtinger presentation from a finite diagram code checks this finite input and emits one positive-meridian generator per under-arc, with crossing relation xo−1xRxoxL−1=1.

[F3]

Local meridian conjugacy at a Wirtinger crossing proves that the over-tangent's positive in-plane normal points from source R to target L, and gives exactly the based positive-meridian rule in [F2].

[F4]

Correctness of the Wirtinger presentation identifies that presentation with the fundamental group of the actual smooth knot complement, with these positive meridians.

[F5]

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.

[F6]

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

1.1F1givenconstructalgebra

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 a+tu,b+sv, with u=a′−a,v=b′−b and Δ=det⁡(u,v)≠0, their intersection parameters are t=det⁡(b−a,v)/Δ,s=det⁡(b−a,u)/Δ. Retain the intersection just when 0≤t,s≤1. If Δ=0, the test det⁡(b−a,u)=0 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 Oi,C,Oo and Ui,C,Uo triples are collinear with the center strictly between the ports. The determinants of the full oriented over/under vectors are respectively −69696,3168,3168,−69696, 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.

2.1F6givenstep 1.1constructalgebra

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 σ1,σ2−1,σ1,σ2−1, where a positive generator has its left strand over, and close corresponding endpoints outside the braid rectangle without additional crossings. Number its successive crossings 1,2,4,3. Following its first top strand through the closure gives exactly 1O,2U,3O,1U,4O,3U,2O,4U. 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 (1Oo,2Oo,4Oi), (1Ui,3Uo,2Ui), (1Oi,4Oo,3Oo), (1Uo,4Uo), (2Uo,3Ui,4Ui), (2Oi,3Oi). 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 (r,z)↦(r,h(z)). 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.

3.1F2F3F4step 1.1step 2.1constructalgebra

Cutting the oriented visit circle at its four U visits gives the four claimed under-arcs. The intervening O visits put O1 on x1, O3 on x2, O4 on x3, and O2 on x4. For a direct side check, let or=rOo−rOi. The values of det⁡(or,rUi−Cr) are 15840,−2376,−2376,15840; those of det⁡(or,rUo−Cr) are −53856,792,792,−53856. 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], xo−1xRxoxL−1=1 is equivalently xoxL=xRxo. Substitution of the four rows gives exactly R1,R2,R3,R4 as displayed. By [F4] these are the actual complement group and positive meridians. Starting at x1 the underpasses are R2,R1,R3,R4 and the corresponding crossing signs sum to 1−1+1−1=0.

4.1F5step 3.1constructalgebra

In the group with the first three relators, left-multiply R3 by x1 and then use R1 and R2 to obtain x1x3x2=x1x2x4=x3x1x4=x3x4x2. Right cancellation gives x1x3=x3x4, which is precisely R4. 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.

5.1F1F2F4F5givenconstructalgebra∎

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 ⟨x∣ ⟩. Define the homomorphism from this free group to Z by x↦1, using [F5], and the homomorphism back by n↦xn. 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