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 BMW Markov trace gives the Dubrovnik link invariant
Statement
Assume the Axiom of Choice. For every nonempty oriented link and every finite signed Artin braid word whose oriented closure represents , the corrected BMW trace value where is the strand count, is the number of closure components, and is the determinant writhe, is independent of the braid representative. It equals the declared writhe-normalized Kauffman ambient-isotopy invariant of at , .
Here denotes , where is obtained by replacing each letter by in the same order.
Statement references
BMW closure trace and stabilization scalars
BMW generator images in the tangle algebra
Dubrovnik and Kauffman conventions
Writhe-component conversion and Reidemeister invariance
Markov equivalence of braid closures
Existence of closed-braid representatives
Oriented Reidemeister equivalence
Goodman and Hauschild, Affine Birman–Wenzl–Murakami Algebras and Tangles in the Solid Torus
Facts & Assumptions
Given: AC, a nonempty oriented link in , and a finite signed Artin braid word whose closure represents it.
Assume the Axiom of Choice (The Axiom of Choice).
Every oriented link is equivalent to the closure of a finite geometric braid; AC is the stated hypothesis (Alexander's theorem: every link is a closed braid).
Two braids have equivalent oriented closures if and only if they are related by finitely many conjugations and positive or negative stabilizations/destabilizations; AC is the stated hypothesis (Markov's theorem for braid closures).
The trace is cyclic, tower-compatible, and has stabilization factors for (BMW closure trace and stabilization scalars).
The closure has one component for each cycle of its strand permutation; the Markov-move convention identifies each Artin generator with the positive geometric half twist, which contributes determinant sign , and its inverse contributes . The word exponent sum is the signed sum of these generator exponents (The closure of a geometric braid, Markov conjugation and stabilization moves, Oriented crossing signs, diagram writhe, and blackboard framing, The exponent sum of a braid).
The Markov moves are conjugation and the two signed stabilizations, with inverses allowed (Markov conjugation and stabilization moves).
The scalar Dubrovnik value on a nonempty diagram is , and while (Kauffman regular-isotopy and Dubrovnik conventions, Kauffman and Dubrovnik writhe-component conversion).
The BMW-to-tangle homomorphism sends each to the corresponding positive or negative Artin crossing (The BMW presentation maps to the Dubrovnik tangle algebra).
AC implies AC by restriction to countable indexed families, and under AC equivalent oriented link diagrams are connected by finitely many planar isotopies and oriented Reidemeister moves (The Axiom of Choice, Reidemeister's theorem for oriented diagrams).
Proof
Fix an oriented link . By [F1], choose a finite signed braid word whose oriented closure represents . This use of existence is valid under [A1], as required by [F1]. Define by the formula in the statement for every braid word with closure equivalent to .
A conjugation leaves the closure component count unchanged because the strand permutation is conjugated, and leaves writhe unchanged because the exponent sum of cancels with that of . Cyclicity in [F3] gives . Thus is unchanged by conjugation.
For positive stabilization , the new transposition involving strand joins that new strand to the cycle containing strand , so . The exponent sum increases by one, hence . By [F3], . Therefore For negative stabilization the cycle count is again unchanged, the writhe becomes , and ; substituting gives Thus both stabilizations and their inverse moves preserve .
By [F2], any two braid words whose oriented closures represent are Markov equivalent. Each move in a finite Markov sequence preserves by steps 2.1 and 2.2, so is independent of the braid representative. For a representative , [F7] identifies with its oriented closure diagram. By [F3], . Hence by [F6]. Applying the conversion in [F6] gives The scalar conversion lemma proves that is unchanged by each oriented Reidemeister move; [F8] therefore identifies this fixed-diagram value with the declared ambient-isotopy value of . AC is used in [F1], [F2], and [F8]; the trace and local formula calculations are choice-free.
Depends on
- BMW algebra in a fixed Kauffman skein convention
- Kauffman regular-isotopy and Dubrovnik conventions
- Oriented crossing signs, diagram writhe, and blackboard framing
- The exponent sum of a braid
- BMW closure trace and stabilization scalars
- The BMW presentation maps to the Dubrovnik tangle algebra
- Kauffman and Dubrovnik writhe-component conversion
- Markov's theorem for braid closures
- Alexander's theorem: every link is a closed braid
- Reidemeister's theorem for oriented diagrams
- Markov conjugation and stabilization moves
- The closure of a geometric braid
- The Axiom of Choice
Used by
Dependency tree · two levels
52 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
- Frederick M. Goodman and Holly Hauschild, Affine Birman–Wenzl–Murakami Algebras and Tangles in the Solid Torus, §§2.3 and 5.1–5.5 (standard reference, not scraped)
- Joan S. Birman and Tara E. Brendle, Braids: A Survey, Handbook of Knot Theory chapter, Theorems 2 and 4 (standard reference, not scraped)
- Louis H. Kauffman, An Invariant of Regular Isotopy, Transactions of the AMS 318(2) (1990), §§VI–VII (standard reference, not scraped)