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 reduced Khovanov homology of a trefoil has rank three
Statement
Let be the oriented closure of the two-strand braid , with both strands directed downward and the positive generator drawn with its southwest-to-northeast strand over its northwest-to-southeast strand. Mark a point away from the three crossings, use the A-smoothing (zero-resolution) as the through pairing, and use the B-smoothing (one-resolution) as the cap-cup pairing. The normalized reduced Khovanov cohomology of over has total rank . The normalized cohomological and quantum grading shifts do not change this total rank.
Statement references
Facts & Assumptions
Given: The three-crossing two-strand braid closure, a basepoint, and its reduced cube over .
The based reduced state space removes the marked-circle factor, and a split of that circle maps its surviving label to on the unmarked output. The supplier proof verifies that the marked action commutes with every edge map, so the quotient is a cochain complex (Reduced Khovanov cohomology of a based link over F2).
The circle algebra has , multiplication , and comultiplication , (Khovanov Frobenius algebra and cube of resolutions).
The signed Khovanov differential squares to zero, and the finite diagram procedure outputs a finite cochain complex (The Khovanov cube differential squares to zero, The Khovanov diagram procedure terminates and returns a finite cochain complex).
The diagram procedure enumerates all smoothing states and assigns the merge or split edge map at each crossing change (Khovanov chain complex from a diagram).
Proof
Let be the number of one-resolutions. The all-through closure has two circles; for , the first cap-cup gives one circle and each additional cap-cup contributes one closed circle. Thus the eight state circle counts in lexicographic order are . Removing the marked circle gives reduced state dimensions , so the cube cochain dimensions are .
Order states within each cohomological degree lexicographically and order free circle factors by their first encounter in a fixed diagram scan, with before . The quotient by the marked-circle action in [F1], the Frobenius maps in [F2], and the edge procedure in [F4] give , , and . In each merge sends and . In each target gets two marked-circle splits . For , on target basis the three source-state maps are , , and . These are exactly the marked quotient split maps and the ordinary Frobenius split map, in the stated basis order.
The matrix has rank . In , the first two columns are independent and their sum is the third, so . The last matrix has three independent nonzero rows, so . By [F1] the quotient is a cochain complex, and [F3] gives its finite support; hence its cohomology dimensions are , , , and . The total rank is therefore , and grading shifts preserve total dimension.
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
- Ozsváth and Szabó, On the Heegaard Floer homology of branched double-covers, §6 (standard reference, not scraped)
- Shumakovitch, Torsion of the Khovanov homology, §2.2 (standard reference, not scraped)