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 positive and negative Khovanov-Rozansky crossing complexes
Definition
With and as in The wide-edge morphisms chi-zero and chi-one, assign to a crossing of a tangle diagram the following two-term complex of matrix factorizations, using the integer grading of arXiv:math/0505056v2, Figure 6.
Positive crossing. with in cohomological degree (so sits in degree ); the shift makes the differential bidegree-preserving.
Negative crossing. with in cohomological degree and in degree ; the overall shift is the normalization required by the Reidemeister IIa move.
In both cases the differential is or and has bidegree as a map of the shifted terms.
Recorded source conflict and regrading. The arXiv prose before Figure 6 incorrectly displays the negative crossing with in the opposite direction. Its Figure 6, the bidegrees of the matrices (5)-(6), and the negative-crossing Euler relation in section 7 agree with the -cone above. The published version of record corrects the direction but also changes the grading: writing and for the two complexes above, formulas (12)-(13) on printed p. 1393 give Here ; the displayed identifications specify term degrees and maps, with the usual compatible shift signs. Both published cones have outer degrees . Their respective term shifts are for the positive cone and on both terms of the negative cone.
Caveat: no absolute normalization is claimed; the shift is fixed only by the source's IIa normalization.
Facts & Assumptions
Given: the four diagrams of a positive and a negative crossing, the morphisms with their matrix presentations, bidegrees and shifts, and the two displayed two-term complexes.
is a morphism of factorizations of bidegree and is a morphism of bidegree , all with respect to the displayed term shifts , , , (The wide-edge morphisms chi-zero and chi-one).
Proof
The positive complex is a complex of factorizations. In a two-term complex the composite of its two differentials is zero on one side because there is nothing to compose on the other, so the complex condition in is automatic; the term lies in cohomological degree and in degree , and both terms are objects of with potential because the source and target of have that potential. The differential has bidegree by [F1], and the shift on its source subtracts from the bidegree of the map of shifted terms, so the differential of has bidegree as required.
The negative complex is a complex of factorizations. Likewise the two-term complex has zero composite on the one composable side, its terms are objects of , and has bidegree by [F1]; the overall shift is applied to both terms, so it shifts the grading of both terms alike and leaves the differential bidegree-preserving. With in degree and in degree , the two terms are exactly the cone of .
The source conflict and the grading comparison. In the integer grading, the negative cone has Euler characteristic , as in arXiv section 7, whereas reversing its two terms changes the sign; moreover the printed with equal shifts would still have bidegree by [F1]. Thus that prose display is incompatible with both the bidegree condition and Figure 6. For the published positive cone, shifting the outer degrees by gives , and adding to the internal shifts gives and , exactly formula (12). For the negative cone, moves degrees to , and adding to both internal shifts gives , exactly formula (13). The maps remain , up to compatible shift signs; agreement with the published cones therefore requires the recorded regrading.
Depends on
Used by
- The Khovanov-Rozansky complex and trigraded braid homology Definition
- A positive crossing factorization complex Example
- A two-crossing closed braid factorization complex Example
- The Koszul-Hochschild comparison respects crossing differentials and trigradings Lemma
- HHH is isomorphic to reduced Khovanov-Rozansky homology Theorem
- Invariance under the braid-like Reidemeister III move Theorem
- Khovanov-Rozansky braid homology is an oriented link invariant up to shift Theorem
- Khovanov-Rozansky homology categorifies the HOMFLYPT polynomial Theorem
Dependency tree · two levels
3 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, printed pp. 5-6; 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), formulas (12)-(13) and Figure 6, printed pp. 1393-1394 (standard reference, not scraped)
- Khovanov and Rozansky, Matrix factorizations and link homology, arXiv:math/0401268v2, introduction printed pp. 6-12: fixed-n sl(n) analogue with different potentials and gradings, not the parameter-a formulas of KR II (standard reference, not scraped)