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.
The rack kink map is bijective
Statement
Let be a rack, with right translations . The kink map , , is a bijection. Its inverse is .
Statement references
Facts & Assumptions
Given: A rack and .
Racks, diagram fundamental quandles, and adjoint groups: every right translation is bijective and .
Proof
Self-distributivity gives for every . Thus . Since is surjective, the two permutations agree: , or .
Fix and put , which exists by [F1]. Then . Self-distributivity says . Cancel the bijection on the left to obtain . Therefore , so is surjective and the displayed formula gives a preimage of every .
If , then step 1.1 gives . Hence . Since is injective, . Thus is injective as well as surjective, and step 1.2's formula is its inverse. If is empty, the unique map is bijective and the conclusion is vacuous.
Depends on
Used by
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
- Sam Nelson, Link invariants from finite racks, §§2.1 and 3, arXiv:0808.0029v3, pp. 2–7 (standard reference, not scraped)
- V. O. Manturov, Knot Theory, Chapter 5, §5.1, printed pp. 49–52 (standard reference, not scraped)