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.
A unit pivot forces the minus Schur sign
Example
Work over and let This is a two-term cochain complex, since . Decompose and with the first coordinates and the second coordinates, so that the four blocks of are and the lower-right entry of is the identity, an invertible pivot.
The example compares the two candidate signs in the Schur complement : the correct minus sign gives the reduced differential on , whose kernel and cokernel are both one-dimensional and agree with those of , while the plus sign gives multiplication by , whose kernel and cokernel both vanish.
Facts & Assumptions
Given: The two-term complex displayed above with the coordinate decomposition at degree , and the candidate reduction at the pivot .
With and one has , , and ; the candidate reduction is a cochain complex (Triangular basis changes diagonalize an invertible differential block).
The candidate reduction keeps for , replaces by and by , and its differentials at degrees are , and where and (An invertible cochain differential block and its candidate reduction).
Over an abelian category the reduction is homotopy equivalent to by a strong deformation retract, and the induced maps on homology objects of the reindexed chain complexes are inverse isomorphisms; in particular isomorphic homology objects in every degree (Gaussian cancellation preserves homotopy type and abelian-category homology).
The homology object of a chain complex is the cokernel of the boundary-to-cycle map ; for a two-term complex the homology at the source is the kernel of its outgoing differential, and at the target it is the cokernel of its incoming differential (Homology object of a chain complex).
Verification
The lower-left block of is in the rows and columns , so and the pivot is the lower-right identity, invertible with .
The Schur complement is , so by [L1] the reduction has differential ; its neighbouring arrows are and , because and have no components into or out of the discarded summands. Hence is in degrees .
Under the reindexing the two-term complex becomes the chain complex concentrated in degrees , so by [L4] its homology is and , corresponding to cochain degrees and . For the reduction these are and ; for they are , since , and . The two complexes therefore have isomorphic one-dimensional homology, as [L3] requires.
With the plus sign, the candidate differential would be , the map with and ; its homology would vanish in both degrees, whereas has one-dimensional homology in both degrees and is homotopy equivalent to its reduction by [L3]. The plus sign is therefore impossible, and the example exhibits the minus sign in the Schur complement. ∎
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
18 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
- Dror Bar-Natan, Fast Khovanov Homology Computations, section 4 Lemma 4.2 and section 5, printed p. 5 (PDF p. 5) (standard reference, not scraped)
- David Clark, Scott Morrison and Kevin Walker, Fixing the Functoriality of Khovanov Homology, Appendix A.1, printed pp. 1562-1563 (standard reference, not scraped)