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.
Kauffman regular-isotopy and Dubrovnik conventions
Definition
Let where is not inverted. A nonempty unoriented regular link diagram is a finite generic planar projection of one or more circles with only transverse double crossings and an over/under marking at each crossing. Use the crossing chart in which the over-strand runs southwest to northeast. Its smoothing joins the left endpoints and the right endpoints (the through pairing), and its smoothing joins the two top endpoints and the two bottom endpoints (the cup-cap pairing). Thus is the orientation-preserving smoothing when both crossing strands point downward and the displayed crossing has positive determinant sign. These are respectively the - and -smoothings in the stated bracket chart. A positive curl is a type-I kink whose oriented crossing has determinant sign ; a negative curl has determinant sign . The sign is unchanged if the orientation of the whole component is reversed.
The Dubrovnik regular-isotopy evaluation is normalized by , , positive and negative curl factors and , and Here and differ only by switching the displayed crossing. For a nonempty oriented link diagram , let be its number of components and let be the sum of the determinant crossing signs. Define and Thus has unknot value , and the universal relation defining is retained even when is not invertible. These are conventions and normalizations; ambient-isotopy invariance of is a separate theorem.
Definition references
Determinant crossing sign and writhe
Kauffman bracket smoothing chart
Scalar regular-isotopy evaluation and universal coefficient relation
Kauffman, An Invariant of Regular Isotopy (1990)
Goodman and Hauschild, Affine Birman–Wenzl–Murakami Algebras and Tangles in the Solid Torus
Poulain d’Andecy, Fusion for the Yang–Baxter Equation and the Braid Group (2020)
Depends on
Used by
- Compute the Kauffman polynomial from a BMW braid closure Algorithm
- The leading minus sign in the Dubrovnik conversion is necessary Counterexample
- BMW coefficient extension for Dubrovnik parameters Definition
- Ordinary Dubrovnik tangle skein algebra Definition
- BMW Kauffman and Dubrovnik worked cases Example
- BMW relations in the Dubrovnik parameter convention Lemma
- BMW tangle skein spanning by descending matchings Lemma
- Kauffman and Dubrovnik writhe-component conversion Lemma
- The BMW presentation maps to the Dubrovnik tangle algebra Lemma
- The BMW Markov trace gives the Dubrovnik link invariant Theorem
- The Kauffman and Dubrovnik polynomials agree under the stated conversion Theorem
Dependency tree · two levels
13 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
- Louis H. Kauffman, An Invariant of Regular Isotopy, Transactions of the AMS 318(2) (1990), §§II, VI, VII, printed pp. 420–429 and 452–469 (standard reference, not scraped)
- Frederick M. Goodman and Holly Hauschild, Affine Birman–Wenzl–Murakami Algebras and Tangles in the Solid Torus, §§2.1–2.3 and Definition 3.1 (standard reference, not scraped)
- Loïc Poulain d’Andecy, Fusion for the Yang–Baxter Equation and the Braid Group, Winter Braids Lecture Notes 7 (2020), §2.2 (standard reference, not scraped)