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.
Reduced Khovanov homology over F2 is independent of the chosen link component
Statement
Let be a finite regular diagram of an oriented link and let be any two points of away from crossings, possibly on different link components. Over , the reduced Khovanov cohomology groups defined using and are isomorphic as bigraded vector spaces. The isomorphism need not be canonical; no diagram-change invariance is asserted here.
Statement references
Facts & Assumptions
Given: The finite Khovanov cube and two basepoints away from its crossings.
The circle algebra and all edge maps are the Frobenius multiplication and comultiplication specified in Khovanov Frobenius algebra and cube of resolutions and Khovanov chain complex from a diagram.
The cube is a finite cochain complex with (The Khovanov cube differential squares to zero, The Khovanov diagram procedure terminates and returns a finite cochain complex).
The based reduced complex is the quotient by with the stated one-degree shift (Reduced Khovanov cohomology of a based link over F2).
Proof
On define and , and on a state tensor define as the sum of this operation over its circle factors. For multiplication, direct evaluation on gives . For comultiplication, evaluation at gives , and evaluation at gives . Thus commutes with each saddle map and hence with . Also : applying twice to one circle gives zero, and every pair of distinct circles occurs twice, hence cancels over .
For a basepoint , multiplication is a chain map and . The local operators on the circle containing satisfy on that factor; terms of on all other circles commute with and occur twice in the sum, so the identity holds on every state tensor.
Put and . The identity in step 2.1 and imply , , , and . Both maps commute with by step 1.1. Moreover : one inclusion follows from , and gives the reverse inclusion. Hence the chain module splits as .
The quotient map identifies with . The restriction is an isomorphism with inverse , since is the identity on and is the identity on . The map lowers raw quantum degree by two, while [F3] lowers the quotient grading by one. Thus, for each cohomological degree , if is the dimension of unreduced cohomology in raw degree and the dimension of reduced cohomology in reduced degree , then .
The diagram has finitely many cube generators, so the sequences and have finite support. Rewrite step 4.1 as . For each parity of , start above the largest supported reduced degree, where the latter term is zero, and recurse downward by two; this uniquely determines all reduced dimensions from the unreduced dimensions. Therefore in every bidegree. Finite-dimensional vector spaces with equal dimensions are isomorphic in each bidegree; only finitely many bidegrees occur, so these isomorphisms assemble without an infinite choice principle.
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
- Shumakovitch, Torsion of the Khovanov homology, §§3.1–3.2 (standard reference, not scraped)
- Ozsváth and Szabó, On the Heegaard Floer homology of branched double-covers, §5 (standard reference, not scraped)
- Turner, A hitchhiker’s guide to Khovanov homology, §1.2 (standard reference, not scraped)