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 Khovanov-Rozansky factorization of the unknot
Example
Take the closed planar graph consisting of a single circle with one mark, labelled , and one oriented arc from the mark to itself. Its Khovanov-Rozansky complex (the factorization of The factorization of a marked MOY graph) is the potential is because the graph is closed, and the differential squares to zero. Its cohomology is : the -multiplication is injective on the first term and has cokernel on the second, so all cohomology sits in one degree and acts trivially. Consequently the Euler characteristic of the one-strand unknot diagram is in the integer grading of The Khovanov-Rozansky complex and trigraded braid homology.
Caveat: this is the factorization attached to the one-mark circle; it is a rank-one-in-each-parity representative over , of infinite rank over the closed graph's ground ring , and it is the base normalization of the categorification theorem, not an absolute normalization of the trigrading (Khovanov-Rozansky II, printed p. 4).
Facts & Assumptions
Given: the closed graph consisting of one circle with one mark labelled and the arc from the mark to itself, so that the two endpoint labels of the arc coincide.
An arc with endpoint labels has factorization with potential ; a closed graph has potential and its factorization is a -periodic complex whose cohomology is written (The factorization of a marked MOY graph).
The Euler characteristic of a closed braid diagram is in the integer grading (The Khovanov-Rozansky complex and trigraded braid homology).
Verification
The factorization. The circle carries one mark and one arc whose two endpoint labels are both , so the arc factors of [F1] specialize to : the differentials are multiplication by and by , the middle term carries the shift , and the square of the differential is , which is the potential of the closed graph. Hence the complex is exactly .
Cohomology. In odd inner-factorization parity the cohomology is , since and multiplication by is injective on . In even inner-factorization parity the cohomology is because multiplication by the nonzerodivisor is injective. So , all of it in odd inner parity and outer cochain degree , and acts as zero on it.
Euler characteristic. The graded pieces of have for , each of dimension over , all in cohomological degree ; substituting into the Euler characteristic of [F2] gives . Since , this is ; and with one has , the same value. This is the unknot normalization used as the base case of the categorification theorem, and it is read off the displayed representative, finite free over and infinite free over .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
7 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 p. 4, and section 7, printed p. 36; 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)