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.
Khovanov chain complex from a diagram
Definition
Input: a nonempty finite regular oriented link diagram and a total order on its crossing set. A diagram object is supplied as mathematical input; this procedure does not parse a serialized string.
Output: the normalized bigraded Khovanov cochain module and its candidate differential , constructed by the following finite instructions.
- Enumerate every state once. Form the crossingless resolution by using the A-smoothing at and the B-smoothing at .
- For each state, create one tensor factor of the integral Frobenius algebra for each resolution circle and place the resulting tensor product in cohomological degree and quantum degree for its circle labels .
- For each state and each crossing with , create the edge to . Apply multiplication if that smoothing change merges two circles, comultiplication if it splits one circle, the identity on other tensor factors, and the sign . Sum the edge maps out of every state to obtain .
- Return the finite direct sum of the state modules with these degrees and maps. The square-zero property is the separate local lemma named by
justified_by.
Definition references
Regular diagram crossing set and A/B smoothing chart
Frobenius algebra, edge maps, and grading conventions
Khovanov, A categorification of the Jones polynomial (1999), §§3.3–4.2
Bar-Natan, On Khovanov's categorification of the Jones polynomial (2002), §3
Depends on
Used by
- Omitting Khovanov normalization breaks Reidemeister I and the Jones Euler characteristic Counterexample
- Reduced Khovanov cohomology of a based link over F2 Definition
- Reduced Khovanov cohomology of a knot Definition
- Reduced Khovanov ranks of the unknot and the three-crossing two-braid Example
- Unknot Khovanov and reduced Khovanov groups Example
- Lee computations for the Conway knot and its Piccirillo partner Lemma
- Lee filtration, spectral sequence, and orientation classes Lemma
- Odd Khovanov and Bar–Natan LEO foundations Lemma
- Reduced Khovanov homology over F2 is independent of the chosen link component Lemma
- The graded Euler characteristics have the Jones normalization Lemma
- The Hedden–Ording t=2 positive Whitehead double has tau zero and s two Lemma
- The Khovanov cube differential squares to zero Lemma
- The reduced Khovanov homology of a trefoil has rank three Lemma
- The Khovanov diagram procedure terminates and returns a finite cochain complex Theorem
Dependency tree · two levels
6 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, A categorification of the Jones polynomial, arXiv:math/9908171v2, §§3.3–4.2 (standard reference, not scraped)
- Dror Bar-Natan, On Khovanov's categorification of the Jones polynomial, Algebraic & Geometric Topology 2 (2002), §3 (standard reference, not scraped)
- Louis H. Kauffman, An Introduction to Khovanov Homology, arXiv:1107.1524v2 (2022), §4 (standard reference, not scraped)
- Melissa Zhang, Notes on Khovanov homology, arXiv:2501.03115v1, §§3.5–3.7 (standard reference, not scraped)