Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)verified 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.

One Fox coloring prime does not classify knots

Statement refuted

For a fixed odd prime p, equality of the Fox p-coloring counts of two knots implies that the knots are ambient-isotopic.

Facts & Assumptions

Given: The unknot and trefoil diagrams and crossing equations in the Counterexample, and ACω.

[F1]

Compute dihedral Fox colorings by row reduction: the Fox system has one variable per arc and one equation 2xo−xi−xj=0 per crossing.

[F2]

The Fox-coloring algorithm terminates and returns all colorings: the algorithm computes all solutions of that system.

[F3]

Quandle colorings are invariant under oriented Reidemeister moves: under ACω, the coloring counts are invariants of oriented knot type.

[F4]

Under the stated choice hypothesis, the diagram quandle adjoint group is the positive-meridian Wirtinger group and hence the knot group. Diagram fundamental quandles and adjoint groups from Wirtinger data

[A1]

The Axiom of Countable Choice (ACω): ACω supplies a choice function for every sequence of nonempty sets.

Counterexample

Take p=5, the standard one-arc unknot diagram, and the standard three-crossing trefoil diagram with crossing equations 2a=b+c, 2b=c+a, and 2c=a+b. Both diagrams have exactly five Fox 5-colorings, all constant. The knots are nevertheless non-equivalent: their Fox 3-coloring counts are 3 and 9, and those counts are ambient isotopy invariants under ACω. Their groups also differ: the unknot group is infinite cyclic, while the trefoil group surjects onto the nonabelian group S3.

1.1F1givenalgebra

By [F1], the trefoil system over F5 consists of the crossing equations in the Counterexample. Subtract the second equation 2b−c−a=0 from the first 2a−b−c=0. This gives 3(a−b)=0; since 3−1=2 in F5, a=b. Substitution into the first equation then gives c=a. Conversely, every constant triple solves all three equations, so there are exactly five solutions, all constant.

1.2F2givenalgebra

The unknot diagram has one arc and no crossings, so its single arc may receive any of the five residues; it has exactly five colorings, all constant. By [F2] these are the algorithmic Fox counts.

2.1A1F3step 1.1step 1.2algebra

Over F3, the same trefoil equations reduce to the single condition a+b+c=0, giving nine solutions, while the unknot has three. By [F3] and [A1] these counts are ambient-isotopy invariants; because they differ, the two knots are not ambient-isotopic. Thus they disprove the refuted statement at p=5.

3.1A1F4constructalgebra∎

For completeness compute the groups in the same diagrams. The crossing-free diagram gives GU=⟨x∣ ⟩≅Z. Label the trefoil meridians so its three crossing relations are c=aba−1, a=bcb−1 and b=cac−1 (the last is the first crossing in the cyclic order used for its Fox system). Eliminating c from the first two gives aba=bab; under that relation the third follows since cac−1=abab−1a−1=b. Thus [F4] gives GT≅⟨a,b∣aba=bab⟩. The assignments a↦(12) and b↦(23) satisfy this relation, because both triple products equal (13), and generate S3. This defines a surjection onto a nonabelian group, so GT is nonabelian and cannot be isomorphic to GU. This group computation supplements, and agrees with, the Fox-count distinction.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

21 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