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.
An invertible cochain differential block and its candidate reduction
Definition
The block decomposition. Let be a cochain complex in an additive category (Complexes, homotopies and contractibility in an additive category) and fix an integer . Suppose that in degrees and the objects of are given as biproducts with the injections and projections of these biproducts fixed. With respect to these ordered decompositions write the differential at degree as the block matrix where the rows name and the columns name : thus , , and are the four components, and composition of such block matrices is matrix multiplication (Composition of morphisms between finite biproducts is matrix multiplication).
The pivot. The block is a pivot when it is an isomorphism, with two-sided inverse . Only is assumed invertible; are arbitrary morphisms. The objects may themselves be biproducts of several objects, in which case is an invertible matrix of morphisms and is still required to be a single isomorphism ; in particular and need not be nonzero or indecomposable.
The neighbours. With respect to the same decompositions write the neighbouring differentials as so that , , and are the neighbouring components across the two pivot blocks.
The candidate reduction. The candidate reduction of at the pivot is the collection of objects and morphisms with differentials The morphism is the Schur complement of the pivot in . In words: the objects and arrows outside degrees are retained verbatim; the pivot blocks are discarded; and the differential at degree is replaced by its Schur complement, while the neighbouring differentials lose their components through the discarded blocks and keep and .
Status of the construction. The words candidate and reduction are provisional: the definition alone does not assert that or , that is, that is a cochain complex. The next lemma verifies this, using the identities and that follow from the square-zero composites and of the given complex.
Homological convention and scope. For a homological, degree-lowering complex the same formulas apply after the reindexing of Complexes, homotopies and contractibility in an additive category: in the chain convention the pivot is the corresponding invertible block of and the reduced differential is again the Schur complement of that block, with the contracting homotopy of the discarded two-term complex acquiring degree . No sign is inserted. The construction uses only the additive structure; it assumes no abelian category, no exactness, no projectivity, no boundedness and no homology object.
Depends on
Used by
- The isolated differential 2 on the integers cannot be cancelled Counterexample
- A unit pivot forces the minus Schur sign Example
- Neighboring differentials transform with the pivot basis changes Example
- Two adjacent noncomposable Gaussian pivots in either finite order Example
- Triangular basis changes diagonalize an invertible differential block Lemma
- Additive functors preserve chosen Gaussian cancellations Proposition
- Finite iteration of current invertible-block cancellations Theorem
- Gaussian elimination splits a contractible two-term complex Theorem
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
- Dror Bar-Natan, Fast Khovanov Homology Computations, section 4 Lemma 4.2 and section 5, printed 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)