Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Quandle colorings are invariant under oriented Reidemeister moves

Statement

Let Q be a quandle and color regular oriented link diagrams by the normal-to-overarc rule in the Definition. Every oriented Reidemeister move and planar isotopy induces a canonical bijection between the two coloring sets. Consequently, under ACω, diagrams of ambient-isotopic oriented links have bijective coloring sets; if Q is finite, their coloring counts are equal. Conversely, suppose a set with a binary operation uses this crossing rule and every oriented local R1, R2, and R3 replacement gives a unique coloring extension in both directions for every boundary coloring. Then the operation is idempotent, every right translation is bijective, and the operation is right self-distributive. This converse requires local extension bijections, not equality of total coloring counts alone. No claim that a coloring count classifies knots is made.

Facts & Assumptions

Given: A quandle Q, regular oriented diagrams, and ACω for the ambient-isotopy conclusion.

[F1]

Quandles and knot-diagram colorings: a quandle is idempotent, each right translation is bijective, and the operation is right self-distributive.

[F2]

Quandles and knot-diagram colorings: the normal to the oriented overarc determines the source and target underarcs, and the target color is the source color acted on by the overarc color.

[F3]

Reidemeister's theorem for oriented diagrams: assuming ACω, two regular oriented diagrams represent equivalent oriented links exactly when related by a finite sequence of planar isotopies and oriented Reidemeister moves.

[F4]

Oriented Reidemeister moves: all local orientation variants of R1, R2, and R3 are included, with their over/under data.

[A1]

The Axiom of Countable Choice (ACω): ACω asserts that every sequence of nonempty sets has a choice function.

Proof

1.1F1F2F4given

An R1 kink adds one underarc color y to the unchanged boundary arc color x. Depending on the local orientation, the crossing equation is y=x∗x or x=y∗x. In the first case idempotency gives the unique extension y=x; in the second case x=x∗x and right invertibility give the unique solution y=x. Removing the kink is the inverse bijection.

1.2F1F2F4

At an R2 move, fix the color y on the strand passing over the other strand. The understrand's color changes by Ry at one crossing and by Ry−1 at the other; these maps are inverse bijections by [F1]. Thus every boundary coloring extends uniquely across the two-crossing side, and the inverse R2 move gives the inverse map.

1.3F1F2F4algebra

For the braid-like R3 orientation, the local crossing map is B(x,y)=(y,x∗y) and its inverse is B−1(u,v)=(v∗ˉu,u). Starting from (x,y,z), the two sides of R3 give respectively (z,y∗z,(x∗y)∗z) and (z,y∗z,(x∗z)∗(y∗z)); these are equal by right self-distributivity. For every z, Rz(x∗y)=(x∗y)∗z=(x∗z)∗(y∗z), so Rz preserves ∗. If u=a∗ˉb, then u∗b=a; applying the bijection Rz gives Rz(u)∗Rz(b)=Rz(a), and uniqueness of right division yields Rz(u)=Rz(a)∗ˉRz(b). Hence Rz preserves ∗ˉ too, and its inverse preserves both operations. Thus for either operation ⋆1,⋆2∈{∗,∗ˉ}, (x⋆1y)⋆2z=(x⋆2z)⋆1(y⋆2z). These four identities give the R3 relation for every choice of crossing direction, and the bijective crossing maps give the corresponding extension bijections. A planar isotopy simply transports each arc label.

1.4givenF2F4

For the converse, the R1 extension property gives x∗x=x for every x: on the kink side, the boundary color x can extend only when this equality holds.

1.5givenF2F4

In an R2 tangle with over-color y, the under-color map is Ry. Unique extension for every incoming color makes Ry a function defined everywhere; unique extension in the reverse direction means each target color has exactly one preimage. Hence Ry is bijective for every y.

1.6givenF2F4

In the braid-like R3 tangle, arbitrary boundary colors x,y,z yield the outputs (x∗y)∗z and (x∗z)∗(y∗z). Unique extension to the same boundary coloring forces these outputs to agree for all triples, which is right self-distributivity.

2.1A1F1F3step 1.1step 1.2step 1.3step 1.4step 1.5step 1.6∎

Thus the local axioms are necessary and sufficient for the stated local extension property. Under ACω, [F3] connects diagrams of the same oriented link by finitely many such moves; composing the local bijections gives a bijection of coloring sets. A finite quandle has finitely many assignments on a finite diagram, so the bijection preserves their counts. Countable choice is used only through [F3]; the move-by-move calculations in steps 1.1–1.6 are choice-free.

Depends on

Used by

Dependency tree · two levels

18 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