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.
Quandles and knot-diagram colorings
Definition
A quandle is a set with a binary operation such that:
- for every ;
- for every , the right translation , , is a bijection;
- for all .
Write for the unique element satisfying . Let be a regular oriented link diagram. An arc of is a connected strand segment cut at each crossing where that strand passes under; an overstrand continues through its crossing. Orient the projection plane. Along an oriented overarc with tangent , let be the unit normal in the plane for which is positively oriented. At each crossing, call the underarc from which points the source underarc and the underarc toward which points the target underarc. A quandle coloring of by is an assignment of an element of to every arc such that, at each crossing, if the source, over, and target colors are , then . Equivalently, when the source and target are named in the opposite order, . Write for the set of all such assignments.
The local convention is shown below. The overarc is oriented from southwest to northeast, so its positive normal points northwest; the underarc is oriented from southeast to northwest. Thus is the source color, is the overarc color, and is the target color. The gap marks the underpassing strand.
Depends on
Used by
- Compute dihedral Fox colorings by row reduction Algorithm
- A finite failed move search is not a negative certificate Counterexample
- Encoded diagram size and exact output Definition
- Racks, diagram fundamental quandles, and adjoint groups Definition
- Eight-crossing state count and trefoil Fox 3-colorings Example
- The square knot is a nontrivial ribbon knot Example
- Dihedral Fox coloring counts are preserved by Reidemeister moves Lemma
- The dihedral operation is a quandle Lemma
- Quandle colorings are invariant under oriented Reidemeister moves Theorem
- Rack colorings are framed Reidemeister invariants Theorem
Dependency tree · two levels
4 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–5.2, printed pp. 49–55 (standard reference, not scraped)
- J. Scott Carter, A Survey of Quandle Ideas, §§2 and 2.1, arXiv:1002.4429v2, pp. 3–8 (standard reference, not scraped)
- Józef H. Przytycki, 3-coloring and other elementary invariants of knots, §§1–2, arXiv:math/0608172, pp. 2–11 (standard reference, not scraped)