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.
Khovanov-Rozansky braid homology is an oriented link invariant up to shift
Statement
Assume the Axiom of Choice The Axiom of Choice. Let and be braid diagrams (clockwise-oriented, with admissible markings) whose closures are ambient-isotopic oriented links in (Oriented links in the three-sphere and ambient isotopy). Then there exists a trigrading shift , depending only on the two diagrams and the sequence of Markov moves between them, such that for all . Thus "the trigraded cohomology of a braid diagram" is an invariant of the oriented link , well defined up to an overall trigrading shift.
The shift is not absolute: the type IA stabilization contributes the shift and the type IB stabilization contributes none, so the total shift is the product of the shifts attached to the stabilization/destabilization moves in the chosen Markov sequence; no normalization of the grading is asserted here.
Caveats: the Axiom of Choice is used only through Markov's theorem for braid closures (Markov's theorem); the shift is not canonical without fixing conventions, and the source itself only claims invariance up to an overall shift.
Facts & Assumptions
Given: two braid diagrams whose closures are ambient-isotopic oriented links, with the Markov moves of Markov conjugation and stabilization moves available.
Markov's closed-braid equivalence theorem: two braid closures are ambient-isotopic oriented links if and only if the braids are related by a finite sequence of Markov moves (a) conjugation, (b) braid-group transformations, (c) stabilization/destabilization; the theorem assumes the Axiom of Choice (Markov's theorem for braid closures).
Conjugation of braid words leaves unchanged up to isomorphism with no shift (Invariance under braid conjugation).
The braid-like Reidemeister IIa move (which covers inverse cancellations) and the braid-like III move with coherent orientations leave unchanged up to isomorphism with no shift (Invariance under the braid-like Reidemeister IIa move, Invariance under the braid-like Reidemeister III move).
The two oriented stabilizations/destabilizations give for type IA and for type IB (Oriented kink shifts for braid diagrams).
Changing the marks of a diagram changes by a chain homotopy equivalence with no grading shift, compatibly with the crossing differentials (Markings do not change the Khovanov-Rozansky complex).
Each crossing complex is a two-term complex of local matrix factorizations; tensor products use the usual parity sign for the factorization differential and the cohomological sign for the crossing-complex differential. Local potentials add (Bigraded matrix factorizations with a potential, The positive and negative Khovanov-Rozansky crossing complexes).
Proof
Distant crossings commute. When , the two crossings involve disjoint pairs of strands. Give their incident edges separate variables and keep all other straight-edge factors fixed. Their local crossing complexes are therefore external tensor factors over their respective polynomial variable blocks, extended to the common commutative coefficient ring. For factors of outer cochain degrees and inner parities , the map is the signed tensor flip. The two standard tensor sign rules of [F6] show separately that it commutes with the outer and inner differentials; it preserves all internal degrees and the sum of the potentials, and its square is the identity. Reattach the unchanged factors and rename each edge variable to the same geometric edge on the other side. This gives a no-shift isomorphism for distant crossing commutation, for either sign of each crossing.
Each Markov move acts by an isomorphism with a computable shift. Since the closures of and are ambient-isotopic, [F1] provides a finite sequence of Markov moves connecting them; it suffices to show that each move induces an isomorphism of complexes in with an explicit shift. Move (a), conjugation , has no shift by [F2]. For move (b), far commutations are the no-shift signed flips of step 1.1, inverse cancellations and are the braid-like IIa move and the braid relation is the braid-like III move, both with no shift by [F3]; the marking changes required to realize the moves are no-shift chain homotopy equivalences by [F5]. For move (c), the type IA stabilization/destabilization contributes inner parity reversal in addition to the shift , and the type IB one contributes neither by [F4].
Composing along the Markov sequence. Choose a Markov sequence from to , and for each move choose the isomorphism supplied by step 2.1; composing the chain maps gives an isomorphism for the product of the shifts of the moves in the sequence, where counts the type IA moves modulo , because composing bigrading and cohomological shifts adds their exponents and . The total shift depends only on the two diagrams and the chosen sequence, and the composed maps are a chain homotopy equivalence after this shift; the conventions and give the stated target index shifts ; taking termwise cohomology, summing its two inner parity components, and then taking outer cohomology forgets and gives for all .
Choice and conclusion. The only step that uses the Axiom of Choice is the invocation of Markov's theorem [F1], which is the passage from an ambient isotopy of the closures to a finite sequence of Markov moves; steps 1.1 and 2.1 are explicit constructions and use no choice. The source's Proposition 2 supplies the underlying invariance of under the braid moves and the shift bookkeeping of the stabilizations, and Theorem 1 of the source is the resulting statement. Since the type IA and IB moves have different shifts, the total shift depends on the chosen Markov sequence and no absolute normalization is claimed.
Depends on
- Markings do not change the Khovanov-Rozansky complex
- Oriented kink shifts for braid diagrams
- Invariance under the braid-like Reidemeister IIa move
- Invariance under the braid-like Reidemeister III move
- Invariance under braid conjugation
- Markov's theorem for braid closures
- The closure of a geometric braid
- Markov conjugation and stabilization moves
- Oriented links in the three-sphere and ambient isotopy
- The Axiom of Choice
- Bigraded matrix factorizations with a potential
- The positive and negative Khovanov-Rozansky crossing complexes
Used by
- HHH is an oriented-link invariant up to an overall trigrading shift Corollary
- The normalized Khovanov-Rozansky HOMFLYPT Euler series Definition
- The reduced Khovanov-Rozansky homology Definition
- Why the Khovanov-Rozansky II invariance proof stays in the braid-diagram calculus Example
- Khovanov-Rozansky homology categorifies the HOMFLYPT polynomial Theorem
Dependency tree · two levels
43 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
- Mikhail Khovanov and Lev Rozansky, Matrix factorizations and link homology II, arXiv:math/0505056v2 (2006), section 1, Theorem 1 and the Markov move list, printed pp. 8-9; published as Geom. Topol. 12 (2008) 1387-1425 (standard reference, not scraped)
- Mikhail Khovanov and Lev Rozansky, Matrix factorizations and link homology II, Geom. Topol. 12 (2008) 1387-1425 (published version of record), Theorem 1 and its proof, printed pp. 1397-1398 (standard reference, not scraped)
- Tina Kanstrup (notes by Corina Keller and Wai-kit Yeung), Knot homologies and matrix factorizations, ICMS summer school lecture notes (2019), Lecture 3, Markov invariance (standard reference, not scraped)