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.
Invariance under the braid-like Reidemeister IIa move
Statement
Let be the two oriented diagrams of the braid-like Reidemeister IIa move of Khovanov-Rozansky II, Figure 15 (the move available inside braid diagrams), with potential . Then in ; in particular there is no grading shift, and the trigraded cohomology of a braid diagram is unchanged by an IIa move. The same holds for the mirror-image move with the orientations reversed and replaced by its negative.
Caveat: only the braid-like IIa move is claimed. The IIb move is neither used nor claimed on this page; the source states (printed p. 9) that it did not prove IIb invariance and does not need it for braid closures.
Facts & Assumptions
Given: the two diagrams of Figure 15, the four resolutions of with the resolution of , their Koszul matrices over , and the maps , of the resolution cube.
is the tensor product of the crossing complexes and arc factors; it is an object of with for the diagrams of Figure 15, and (The Khovanov-Rozansky complex and trigraded braid homology).
The morphisms of the crossing complexes are the flip morphisms in the Koszul forms of the resolutions; the differential of a resolution cube is a sum of such morphisms, and the element acts by the identity on the first term and by multiplication by on the middle term (The wide-edge morphisms chi-zero and chi-one).
Elementary row operations are isomorphisms of factorizations; a row with internal may be deleted with substituted in all remaining rows, yielding a chain homotopy equivalent factorization over the smaller ring (Koszul row operations and variable exclusion preserve homotopy type).
Proof
The splitting criterion. The four resolution corners form a complex with in degree , in degree and in degree , with the shifts supplied by the crossing cones. Suppose identifies with a summand of , and is invertible. Elementary changes of coordinates first cancel the block and then the block . For an invertible block , subtracting its other row and column entries using makes the differential block diagonal; the surviving block is the Schur complement. The equation makes adjacent components to the canceled pair zero in these coordinates, so its identity pair is contractible. Here the sole final term is in degree , and it has zero differential; off-diagonal cube maps introduce no further term. Thus the two invertible blocks suffice to prove .
Koszul form of the diagram and its first reduction. In the standard Koszul bases the three factorizations have four rows: has rows , , , ; has the same rows with second row ; has the same rows as with last row ; the maps are and . Apply the row operation to all three matrices simultaneously: the first rows become and the third rows in all three; the common third rows can be deleted and the internal variable excluded by . The diagram becomes the tensor product of the row with the diagram of two-row matrices over , , where and ; each step is an isomorphism or a chain homotopy equivalence by [F2].
Quadratic polynomial division. Put , and . Its leading coefficient is the unit , so polynomial division gives an -module decomposition . In the zero-first-entry Koszul row , multiplication by maps the odd copy of isomorphically to in the even copy. Cancel these pairs over ; the surviving even copy is , free over on . In tensoring this row with another zero-first-entry row , the same cancellation gives the surviving differential induced by on : the quotient map commutes with multiplication by , and the invertible block removes all its complementary components by the elementary Schur-complement calculation of step 1.1. Apply this simultaneously to the first two factorizations and their coefficient maps. The third bottom row reduces by the linear exclusion lemma [F3] to evaluation . The reduced diagram thus has first differential multiplication by on , second differential multiplication by on that same rank-two module, and third differential multiplication by this last element on . Its vertical maps are and on the respective components of , and evaluation on both components of . The quadratic reduction is polynomial division, rather than an application of the linear exclusion clause.
Splitting the reduced diagram. In the reduced diagram the first factorization has a contractible summand , whose removal leaves the rank-one row ; the middle factorization is the direct sum of the two factorizations and , isomorphic to the first up to a grading shift; and the third factorization is the rank-one row over with differential . The map takes the reduced first factorization isomorphically onto the second summand of the middle factorization, and restricts to an isomorphism from the first summand of the middle factorization onto the third factorization; thus is an isomorphism onto a direct summand and restricts to an isomorphism from a complement, as required by step 1.1, so is isomorphic in to the direct sum of two contractible complexes and . Every map in the computation is homogeneous of bidegree between the shifted rows, so no grading shift occurs.
Conclusion and mirror image. Steps 1.2-3.1 verify the splitting criterion of step 1.1 for the pair of Figure 15, giving in with no shift of the trigrading, hence an isomorphism of trigraded cohomology for the two braid-like IIa diagrams. The mirror-image move is the same computation with the signs of all potentials reversed and the roles of the two sides exchanged, which leaves the conclusion unchanged; both diagrams have potential in Figure 15 and potential after all orientations are reversed, and no step of the argument uses the Axiom of Choice.
Depends on
Used by
Dependency tree · two levels
8 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 2, subsection 5, Proposition 6, Figures 15-16, printed pp. 21-24; 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), Proposition 2, printed pp. 1397-1398 (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)