Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)
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.

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.

Depends on

Used by

Dependency tree · two levels

58 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources