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 factorization of a marked MOY graph
Definition
Let be a finite planar graph in a disk whose edges are either oriented arcs between marks (including boundary points) or wide (thick) edges, each wide edge bounded by four oriented edge-ends, as in the Khovanov-Rozansky diagrams. Place finitely many marks, with at least one on every internal edge and every circle of , place any finite number of marks (possibly none) on each boundary edge, and label all marks and boundary points by distinct variables ; the boundary points carry orientations . With and the arc and wide-edge factorizations of Arc and wide-edge Khovanov-Rozansky factorizations, define
the tensor product taken over with all variables shared (the tensor product of the two-term factorizations of the local pieces, with the Koszul sign convention), and view as a factorization over the smaller polynomial ring : the variables at internal marks are internal and are forgotten. Its potential is
The sum is over the boundary points: every internal label occurs at exactly two edge-ends with opposite signs, whose contributions and cancel, while a boundary label occurs at exactly one edge-end, and the local potentials of the arc and wide-edge factorizations add to .
If is closed (no boundary points), then and is a -periodic complex of bigraded -modules, whose cohomology is denoted . Each term is a free bigraded -module, generally of infinite rank. Contractible summands may be removed without changing its cohomology, but no finite-rank representative over is asserted: already a one-mark circle has cohomology . For a nonempty closed graph, the row reduction proved below shows that acts trivially on . For the empty graph the empty tensor product is in even parity, and need not act trivially. Caveats: has infinite rank as an -module whenever internal marks are present; the marks are auxiliary data, and a marking change alters by a chain homotopy equivalence (proved later on this page); the potential vanishes exactly for closed graphs, which is why is a genuine complex in that case.
Depends on
Used by
- The Khovanov-Rozansky complex and trigraded braid homology Definition
- The reduced Khovanov-Rozansky homology Definition
- The wide-edge morphisms chi-zero and chi-one Definition
- A positive crossing factorization complex Example
- The Khovanov-Rozansky factorization of the unknot Example
- Koszul row operations and variable exclusion preserve homotopy type Lemma
- Setting a to zero in a closed KR factorization gives the layer-by-layer Koszul complex Lemma
- Markings do not change the Khovanov-Rozansky complex Theorem
Dependency tree · two levels
2 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. 4-5; published as Geom. Topol. 12 (2008) 1387-1425 (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)
- Tina Kanstrup (notes by Corina Keller and Wai-kit Yeung), Knot homologies and matrix factorizations, ICMS summer school lecture notes (2019), Lecture 2 (standard reference, not scraped)