Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: 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.

Equal abelianizations do not classify knots

Statement refuted

Write G(K):=π1(S3∖K) for the group of a smooth oriented knot K. The claim is that for every pair of such knots K1,K2, an isomorphism G(K1)ab≅G(K2)ab implies that K1 and K2 are ambient isotopic.

Diagram

The diagram is the closure of the displayed braid; the arrows give the knot orientation, each white gap marks an underpass, and the strand drawn continuously over a gap is the overpass. View along +y in the geometric braid chart, with positive projection basis (∂t,∂x). The right-starting branch is over at each crossing. The triples (o,L,R) list the overarc, target under-side and source under-side; they are not incoming/outgoing names.

abc

Facts & Assumptions

Given: The crossing-free unknot code and the standard three-crossing trefoil diagram, with their Wirtinger presentations.

[F1]

The constructor returns one meridian generator per under-arc and one relator per crossing. Wirtinger presentation from a finite diagram code

[F2]

The over- and under-meridians at an oriented crossing satisfy the conjugacy relation determined by its chart. Local meridian conjugacy at a Wirtinger crossing

[F3]

The constructor's presentation group is isomorphic to the knot complement group. Correctness of the Wirtinger presentation

[F4]

A group presentation is a quotient of the free group on the generators by the relator normal closure. Group presentation by generators and relations

[F5]

The free group on one generator is isomorphic to Z by exponent sum. Free group on a set of generators

[F6]

Quotient maps from free groups factor uniquely through their relator normal closures. A homomorphism that kills a normal subgroup factors uniquely through the quotient group

[F7]

The commutator subgroup is generated by [g,h]=ghg−1h−1. Commutators [g,h]=ghg−1h−1 and the commutator subgroup [G,G]

[F8]

The quotient Gab=G/[G,G] is abelian and universal among homomorphisms to abelian groups. The derived subgroup is characteristic and the abelianization is universal

[F9]

An ambient isotopy of knots induces a homeomorphism of their complements. Oriented links in the three-sphere and ambient isotopy

[F10]

A pointed homeomorphism induces a fundamental-group isomorphism. The homomorphism on fundamental groups induced by a pointed continuous map

[F11]

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

Counterexample

Let GJ:=π1(S3∖J) for a knot J. Let U be the crossing-free unknot and let T be the closed three-crossing diagram displayed above, formed from two oriented strands and the two exterior closure arcs. With the shown orientation and under-arc labels a,b,c, its crossing triples (o,L,R) are (b,c,a), (c,a,b), and (a,b,c), so its crossing equations are b=cac−1, a=bcb−1, and c=aba−1. Eliminating c gives GT≅⟨a,b∣aba=bab⟩. The map a↦(12), b↦(23) is a surjection of GT onto the nonabelian permutation group S3. Consequently GU≅Z and GT is noncyclic. Their abelianizations are both Z, so they are not distinguished by abelianization. Ambient-isotopic knots have isomorphic complement groups, hence U and T are not ambient isotopic. Thus abelianization alone does not classify knots.

1.1givenF1F3F4F5F7F8algebra

By [F1] and [F3], the crossing-free unknot group is ⟨x∣ ⟩, the free group on one generator. By [F5] it is isomorphic to Z. All commutators in Z are trivial by [F7], so [Z,Z]=1 and [F8] identifies its abelianization with Z.

1.2givenF1F2F3F4algebra

A valid rational code for the displayed trefoil uses the two diagonals from (±1,3−j) to (∓1,2−j) for j=0,1,2, subdivided at their crossing (0,5/2−j), with the right-starting branch over and both diagonals oriented downward. Close the left endpoints by (−1,0)→(−2,0)→(−2,3)→(−1,3) and the right endpoints by the reflected route. Each strip has just its one transverse crossing, distinct strip interiors and the two exterior closure routes are disjoint, and the three swaps trace one circle. Thus these integer and half-integer vertices give admissible input for [F1]; rounding the bends gives the displayed diagram. The trefoil's displayed crossing triples and [F2] give b=cac−1, a=bcb−1, and c=aba−1. Substituting the last into the second yields a=baba−1b−1; right multiplication by ba gives aba=bab. Under this relation, cac−1=abab−1a−1=b, so the first equation follows. Thus eliminating c gives ⟨a,b∣aba=bab⟩, and [F3] identifies it with GT.

2.1F8step 1.2algebra

In the abelian quotient of [F8], written additively, aba=bab gives 2[a]+[b]=[a]+2[b], hence [a]=[b] and the abelianization is generated by [a]. The map GT→Z sending a,b to 1 respects the relator and is surjective; by [F8] it factors through the abelianization. The map Z→GTab sending 1 to [a] is inverse, so GTab≅Z.

2.2F4F5F6step 1.2algebra

The map a↦(12), b↦(23) respects aba=bab, since both sides equal (13). Its image contains two adjacent transpositions and hence all six elements of S3, so it is surjective by [F4] and [F6]. Since S3 is nonabelian, GT is nonabelian; every quotient of the cyclic group Z is cyclic, so GT≇Z≅GU.

3.1F9F10F11step 1.1step 2.1step 2.2∎

If U and T were ambient isotopic, [F9] would give a homeomorphism of their complements; [F10] and [F11] would induce a fundamental-group isomorphism. Step 2.2 rules this out. Their abelianizations nevertheless agree by steps 1.1 and 2.1, proving the stated counterexample.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

40 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