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 and Dubrovnik writhe-component conversion
Statement
For each nonempty oriented regular link diagram , let be its determinant writhe and its number of components, and define by the conventions stated for this page. Then The value assigned to is independent of reversing the orientation of any whole component. The Dubrovnik value has the stated difference-skein, curl and circle rules; the Kauffman value has the sum-skein, curl and circle rules; and is unchanged by planar isotopy and every oriented Reidemeister move of types I, II, and III. The claim concerns these finite diagram moves and uses the universal coefficient relations without dividing by a skein variable.
Statement references
Facts & Assumptions
Given: A nonempty regular oriented link diagram, its determinant crossing signs, and the Dubrovnik scalar evaluation.
The Dubrovnik scalar is regular-isotopy invariant, has , positive/negative curl factors , loop factor , and skein over (Scalar evaluation of framed Kauffman link diagrams).
The determinant writhe is the signed sum of crossing signs; reversing one strand negates that crossing sign, while reversing both strands preserves it (Oriented crossing signs, diagram writhe, and blackboard framing).
A regular oriented diagram is a finite generic planar projection with only transverse double crossings and no triple points; distinct component shadows therefore have finitely many transverse intersections (Regular oriented link diagrams).
A type-I move changes one self-crossing, type II adds or removes two opposite-sign crossings, and type III preserves its three crossing signs (Oriented Reidemeister moves).
In the stated polynomial convention, on nonempty diagrams, , and (Kauffman regular-isotopy and Dubrovnik conventions).
Proof
Fix distinct components and let their projected shadows be . Smooth each of the finitely many self-crossings of inside a small disk disjoint from ; the disk exists because there are no triple points, and the smoothing leaves every mixed intersection with unchanged. After finitely many such smoothings, is a finite disjoint union of embedded circles. As traverses any embedded circle, every transverse intersection changes whether it is inside or outside that circle, and the closed traversal returns to its initial region. Hence the original number of mixed intersections of is even. Each determinant crossing sign is or , both congruent to modulo , so the signed mixed-crossing sum is even. Summing over shows that the total mixed-crossing sum involving is even. Reversing leaves its self-crossing signs fixed by [F2] and negates its mixed crossing signs, so changes by . Thus is unchanged; and the unoriented value are unchanged as well. Therefore the formula defining is independent of reversing , and repeating for every component proves orientation independence.
For a positive curl, gains a factor and increases by ; substituting and in [F5] shows that gains the factor . For a negative curl, gains and decreases by , so gains . Adding a disjoint trivial circle increases by and multiplies by , so the factor makes acquire the factor . Set . Under and , the coefficient relation becomes , hence . This gives the Kauffman circle rule using the universal relation without inverting .
Consider a positive crossing and write and . Switching it gives and leaves fixed. Each smoothing deletes that crossing, so before any orientation adjustment its writhe is . The orientation-preserving smoothing has components at a self-crossing and at a mixed crossing. The other smoothing has components at a self-crossing and at a mixed crossing. To orient at a self-crossing, first use the orientation-preserving smoothing to split the original component into two closed components, then join their arcs by the other smoothing and reverse one of the two orientations. This changes signs at exactly the crossings between that component and the other split component or any remaining component; the pairwise sums are even by step 1.1, so . At a mixed crossing, reverse one whole incident component in the original diagram. Its writhe changes by minus twice a mixed-crossing sum, which is divisible by by step 1.1; this reversal changes the displayed crossing from positive to negative and makes the orientation-preserving smoothing. Removing that negative crossing raises writhe by , so . By [F5], the phase multiplying the Dubrovnik value changes by the factor on and by on . It also changes sign when the crossing is switched, since . Therefore the Dubrovnik difference skein in [F1] becomes the Kauffman sum skein after substituting and , equivalently and . The calculation uses the positive member of the crossing pair; since the resulting sum-skein is symmetric in and , it applies whether the input diagram displays the positive or negative member.
By [F1], is unchanged under planar isotopy and Reidemeister II and III. The determinant writhe is unchanged under II and III by [F2, F4], so the formula in [F5] gives the corresponding regular-isotopy rules for . The positive and negative curl factors are those computed in step 1.2.
For a positive type-I move, for a negative type-I move, Moves II and III leave unchanged, hence also preserve . Therefore is unchanged by every listed move, while the conversion identity is the defining relation in [F5].
Depends on
Used by
- The BMW Markov trace gives the Dubrovnik link invariant Theorem
- The Kauffman and Dubrovnik polynomials agree under the stated conversion Theorem
Cited to discharge well-definedness by Kauffman regular-isotopy and Dubrovnik conventions.
Dependency tree · two levels
17 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 (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 (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)