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.
Koszul row operations and variable exclusion preserve homotopy type
Statement
Work over a polynomial ring and write for the Koszul factorization with rows , so that its total differential squares to . The row operations are first statements about ungraded factorizations. In the bigraded setting of Bigraded matrix factorizations with a potential, require the entries, substitutions and basis changes to be homogeneous of the degrees determined by the row shifts; only such operations give bigrading-preserving maps. Then:
(1) Row operations. For the replacement of two rows by , all other rows unchanged, is an isomorphism of factorizations (it is the change of basis on the tensor product of the two rows).
(2) Variable exclusion. Let , let (so is internal), and suppose one row of has the form with . Let be the Koszul factorization over obtained by deleting that row and substituting in all other rows, and let be restricted to (an infinite-rank factorization). Then in : the -complex splits into the contractible complexes for and the rank-one complex .
(3) Graph factorizations. For a nonempty planar marked graph with arcs and wide edges the Koszul matrix of has linear rows ( linear in the ) and quadratic rows ; applying the row operations of (1) with against the first linear row turns the first row into over the boundary points and all other linear rows into ; if is closed the first row becomes and, after restricting scalars to and deleting that row with its odd parity and internal shift retained, the remaining rows are for the other linear entries and for all the quadratic entries. Their Koszul complex computes , with the parity and internal shift contributed by the removed row retained and the cyclic grading collapsed to a bigrading, and acts trivially on .
Caveats: (2) is a chain homotopy equivalence, not an isomorphism of factorizations over ; the substitution must be applied to every remaining row simultaneously; the collapse in (3) loses the cyclic (homological) grading because the differential has nonzero bidegree. Source: Khovanov-Rozansky II, section 2, printed pp. 12-14, and the cyclic Koszul algebra of Khovanov-Rozansky I, section 2, printed pp. 13-17. Removing here computes cohomology after restricting scalars; it does not give a free representative of that cohomology in .
Facts & Assumptions
Given: a polynomial ring , a Koszul factorization with potential , and a marked planar graph with its factorization .
The category has objects with of bidegree , , and morphisms of bidegree commuting with , and is its homotopy category, with homotopies of bidegree (Bigraded matrix factorizations with a potential).
is the tensor product over the shared polynomial ring of the arc rows and the wide-edge rows and , has potential over the boundary points, and internal labels occur with cancelling signs (The factorization of a marked MOY graph).
Proof
Row operations. Model the Koszul factorization on the exterior algebra of a free module with basis , with differential , where is contraction by the dual basis. The exterior and contraction operators anticommute for distinct indices and satisfy , giving . The basis change , induces an invertible exterior-algebra map. Expressing in that basis gives exactly . This intertwines the differentials; in the graded case it preserves the grading precisely under the degree compatibility stated above.
Polynomial remainders. Replace by to reduce to . For every other row write and , where are the values at and are polynomial quotients; no linearity in is assumed. Since the excluded row has product zero and , subtraction of the value at zero yields . Multiplication by is injective in , so .
Exclusion of the row. Pair with the distinguished row using step 1.1 with parameter . After doing this for every , the rows become and . Swap the entries of the distinguished row, with the corresponding parity shift, and use the dual row operation . This dual operation is another exterior-basis change (or the previous operation after exchanging wedge and contraction), and preserves the product. The ordinary rows now equal , while the distinguished row equals by step 1.2. Undoing its entry swap cancels the parity shift and leaves . Thus the original factorization is isomorphic to over .
Standard form of graph factorizations. By [F2] the matrix of has the linear rows contributed by the arcs and the first row of each wide edge, and the quadratic rows contributed by the second row of each wide edge; permute rows so the linear rows come first. Applying the operation of clause (1) to the first row and each further linear row with replaces the pair by , so afterwards the first row is and every other linear row is with its original . The internal labels occur twice with opposite signs and cancel in the sum, while each boundary label occurs once, so the first row is ; the quadratic rows are untouched.
The splitting. Over the row presents the complex , which is the direct sum of the two-term complexes for and the rank-one complex ; for the map is an isomorphism, so those summands are contractible and contribute nothing to the homotopy type. In a tensor product with the contractible summands remain contractible, hence in , which proves clause (2); the equivalence forgets the variable and is not an isomorphism of -factorizations because has infinite rank over .
Closed graphs. If is closed, step 2.2 makes the first row and every other row has first entry zero. The latter rows include both the remaining linear entries and every quadratic entry; write their tensor product as . The first row is . Its cohomology is the odd-parity copy of . More explicitly, as a complex over it is the direct sum of contractible pairs and the remaining constant in odd parity. Since has no in its entries, tensoring this splitting with leaves its specialization at , with the first row's shift and odd parity retained. This is exactly the Koszul complex on all remaining linear and quadratic entries, with its cyclic grading folded into parity; multiplication by is zero on the resulting cohomology.
Depends on
Used by
- The Khovanov-Rozansky complex and trigraded braid homology Definition
- The normalized Khovanov-Rozansky HOMFLYPT Euler series Definition
- The reduced Khovanov-Rozansky homology Definition
- The wide-edge morphisms chi-zero and chi-one Definition
- A closed MOY resolution's Koszul complex computes Hochschild homology of its Soergel bimodule Lemma
- Oriented kink shifts for braid diagrams Lemma
- Invariance under the braid-like Reidemeister IIa move Theorem
- Invariance under the braid-like Reidemeister III move Theorem
- Khovanov-Rozansky homology categorifies the HOMFLYPT polynomial Theorem
- Markings do not change the Khovanov-Rozansky complex Theorem
Dependency tree · two levels
5 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 'Product factorizations, graph homology and Koszul complexes', Proposition 3, printed pp. 12-15; published as Geom. Topol. 12 (2008) 1387-1425 (standard reference, not scraped)
- Khovanov and Rozansky, Matrix factorizations and link homology, arXiv:math/0401268v2, section 2, printed pp. 13-17 (cyclic Koszul algebra) (standard reference, not scraped)