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.
Rack colorings are framed Reidemeister invariants
Statement
Assume for the smooth framing statements. Let be a rack and let be its kink map. Rack-coloring sets are in bijection across every oriented R2 or R3 move and planar isotopy. Across a single oriented R1 curl, the label transported along the affected strand changes by or according to the curl orientation. Consequently, an opposite-kink pair on the same component whose two signed framing changes cancel induces a bijection on colorings. A single unframed R1 move has a unique extension for every boundary color exactly when is the identity, which is the quandle idempotency axiom. Thus finite rack coloring counts are invariant under R2, R3, planar isotopy, and framing-preserving opposite-kink compensation; the unframed R1 move is covered when the rack is a quandle.
Statement references
Facts & Assumptions
Given: A rack , its kink map , the positive-normal crossing convention, and when smooth framings are used.
Racks, diagram fundamental quandles, and adjoint groups: every right translation is bijective, right self-distributivity holds, and the coloring relation uses the overarc action.
The rack kink map is bijective: the map is bijective with inverse .
Oriented Reidemeister moves: oriented R2 and R3 moves have all local orientation and height-order variants.
The crossing sign is ; blackboard self-linking equals self-writhe. Therefore an R1 creation with sign changes blackboard self-linking by . Oriented crossing signs, diagram writhe, and blackboard framing, Blackboard self-linking equals diagram self-writhe
is used only for the supplied smooth-framing/self-linking results. The Axiom of Countable Choice ()
Proof
At an R2 move, hold the overarc color fixed. The underarc label is changed by at one crossing and by at the other, so the two boundary colorings determine one another uniquely. Reversing the move gives the inverse correspondence.
For a braid-like R3 move, use the crossing map . Its inverse is by right invertibility. The two sides send respectively to and ; the last coordinates agree by rack self-distributivity. For every , , so preserves . If , then ; applying gives , and uniqueness of right division yields . Thus and its inverse preserve both operations. For either operation , this gives , the corresponding mixed R3 equation. The bijective crossing maps then give the extension bijection for every orientation variant. A planar isotopy transports arc labels.
Write the under-tangent as . Its determinant sign is the sign of , so at a positive crossing the oriented underpass goes from source to target. In a positive curl with incoming label and outgoing label , either the overarc is the incoming arc and , or it is the outgoing arc and . In the latter case self-distributivity gives , hence ; therefore . Conversely solves the equation since by the kink-map proof. Thus both positive curl shapes have unique transport . In a negative curl the same equations are read backwards and give . This checks both choices of which boundary arc is the overarc, independently of a picture.
For a single unframed curl with boundary color , extension requires ; if is the identity, this condition holds uniquely for every . Conversely, if every boundary color extends uniquely, every is fixed by , so for all and the rack is a quandle.
The kink shift propagates through any crossing. Self-distributivity gives , hence . It also gives for every . Since is surjective, this implies . By [F2], is bijective, so these identities hold for its inverse as well: and for all and . In particular, if a crossing obeys , independently shifting its two under-colors by the same and its over-color by preserves it, because . The reversed crossing relation is preserved by the same calculation with .
A compensated pair creates two curls on the same oriented component, or removes their inverse configuration. If its blackboard framing is preserved, [F4] forces the two created crossing signs to sum to zero; the same holds when opposite signed framing changes are specified directly. Choose either of the two component intervals between the sites and traverse it in the component orientation, writing for the sign of its first curl; the second has sign . Starting from an old coloring, retain every color off this interval and replace every old color on it by of that color, splitting an old under-arc at the two sites if needed. Insert the unique local curl labels from step1.3. At the first site the transport changes the old incoming label to its -shift; at the second the transport restores the old outgoing label. Thus the prescribed labels agree along every new maximal under-arc.
At any old crossing, the selected component interval contains both local halves of the underpassing branch or neither, since its endpoints are away from crossings. Thus the source and target under-colors have the same shift exponent . Independently the overpassing branch has shift exponent . Step1.5 preserves the crossing relation for all four possibilities, including a self-crossing at which the interval contains exactly one of the two visits. The old crossing relations therefore all hold after the recoloring. Conversely, start with any coloring of the twice-curled diagram, undo the shift on that same marked component interval, and remove the two uniquely determined curl portions using step1.3; step1.5 again preserves every intervening relation. The endpoint transports now cancel in the inverse order. These constructions are inverse on every arc label, so give the required bijection for arbitrarily separated opposite curls, not only adjacent curls. The removal move uses the inverse bijection.
Steps 1.1–1.2 give the R2, R3 and planar-isotopy bijections; steps 2.1, 3.1 give the compensation bijection. A finite rack admits only finitely many assignments on a finite diagram, so the cardinalities are preserved. Step 1.4 proves exactly when the individual unframed R1 bijection is available. The algebraic assertions use no choice; only the smooth framing interpretation uses [A1].
Depends on
- Quandles and knot-diagram colorings
- Racks, diagram fundamental quandles, and adjoint groups
- The rack kink map is bijective
- Oriented Reidemeister moves
- Oriented crossing signs, diagram writhe, and blackboard framing
- Framed knots, self-linking, and the Seifert framing
- Blackboard self-linking equals diagram self-writhe
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
26 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
- Sam Nelson, Link invariants from finite racks, §§2.1–2.2, arXiv:0808.0029v3, pp. 2–5 (standard reference, not scraped)
- 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–8 (standard reference, not scraped)