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 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 , diagrams of ambient-isotopic oriented links have bijective coloring sets; if 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.
Statement references
Facts & Assumptions
Given: A quandle , regular oriented diagrams, and for the ambient-isotopy conclusion.
Quandles and knot-diagram colorings: a quandle is idempotent, each right translation is bijective, and the operation is right self-distributive.
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.
Reidemeister's theorem for oriented diagrams: assuming , two regular oriented diagrams represent equivalent oriented links exactly when related by a finite sequence of planar isotopies and oriented Reidemeister moves.
Oriented Reidemeister moves: all local orientation variants of R1, R2, and R3 are included, with their over/under data.
The Axiom of Countable Choice (): asserts that every sequence of nonempty sets has a choice function.
Proof
An R1 kink adds one underarc color to the unchanged boundary arc color . Depending on the local orientation, the crossing equation is or . In the first case idempotency gives the unique extension ; in the second case and right invertibility give the unique solution . Removing the kink is the inverse bijection.
At an R2 move, fix the color on the strand passing over the other strand. The understrand's color changes by at one crossing and by 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.
For the braid-like R3 orientation, the local crossing map is and its inverse is . Starting from , the two sides of R3 give respectively and ; these are equal by right self-distributivity. For every , , so preserves . If , then ; applying the bijection gives , and uniqueness of right division yields . Hence preserves too, and its inverse preserves both operations. Thus for either operation , . 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.
For the converse, the R1 extension property gives for every : on the kink side, the boundary color can extend only when this equality holds.
In an R2 tangle with over-color , the under-color map is . Unique extension for every incoming color makes a function defined everywhere; unique extension in the reverse direction means each target color has exactly one preimage. Hence is bijective for every .
In the braid-like R3 tangle, arbitrary boundary colors yield the outputs and . Unique extension to the same boundary coloring forces these outputs to agree for all triples, which is right self-distributivity.
Thus the local axioms are necessary and sufficient for the stated local extension property. Under , [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
- One Fox coloring prime does not classify knots Counterexample
- Trefoil and unknot Fox-coloring counts Example
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
- V. O. Manturov, Knot Theory, Chapter 5, §5.1, printed pp. 49–52 (standard reference, not scraped)
- J. Scott Carter, A Survey of Quandle Ideas, §2, arXiv:1002.4429v2, pp. 3–9 (standard reference, not scraped)
- Józef H. Przytycki, 3-coloring and other elementary invariants of knots, §1, arXiv:math/0608172, pp. 2–3 (standard reference, not scraped)