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.
Finite iteration of current invertible-block cancellations
Statement
Let be a cochain complex in an additive category.
- Iteration. Suppose a finite sequence of Gaussian cancellations is performed on , each step cancelling an invertible pivot block in the current complex, so that each step is a block decomposition as in An invertible cochain differential block and its candidate reduction and the current complex is replaced by its candidate reduction. Then the composite of the steps is a strong deformation retract of onto the final reduction, with the explicit data described in clause 2.
- Composition of retract data. If has data and has data in the sense of Explicit strong deformation retract from Gaussian cancellation, then satisfy , , , and , so they are strong deformation retract data of onto .
- Aggregate pivots. If a decomposition of is presented with pivot blocks that are finite biproducts , and a block-diagonal isomorphism , then a single cancellation with pivot is available, and the resulting reduction is the complex obtained by cancelling successively in the current Schur-complement complexes.
- Choices and limits. Different valid finite choices of cancellations yield reductions that are homotopy equivalent but not generally equal complexes: there is no canonical reduced complex, no guarantee that a reduction is smaller, and no assertion about infinite sequences of cancellations.
Facts & Assumptions
Given: A cochain complex in an additive category, its invertible-block decompositions at the chosen degrees, the explicit strong deformation retracts attached to single cancellations, and the composites described in the statement.
A single cancellation with pivot in the current complex gives cochain maps and a homotopy of degree with and , , , (Explicit strong deformation retract from Gaussian cancellation).
The candidate reduction at the pivot replaces the objects in degrees by , keeps all other objects and arrows, keeps the neighbouring components of and of , and replaces by the Schur complement ; the pivot blocks may themselves be biproducts and may be any isomorphism between them (An invertible cochain differential block and its candidate reduction).
The candidate reduction is a cochain complex, and the identities , , hold for every pivot (Triangular basis changes diagonalize an invertible differential block).
Composition of morphisms between finite biproducts is matrix multiplication, and finite biproducts may be reassociated: splitting as and as is a biproduct decomposition again (Composition of morphisms between finite biproducts is matrix multiplication, An invertible cochain differential block and its candidate reduction).
Cochain maps are closed under composition, the equations , , , , are degreewise identities of morphisms, and a cochain map satisfies in the graded sense (Complexes, homotopies and contractibility in an additive category).
Proof
Composition of retract data. Assume , , and , and put , , . Then ; moreover , so . On the other hand , and , because are cochain maps, so the two expressions coincide and .
Aggregate pivots. Let and with pivot blocks , and , where and are isomorphisms; write as the block matrix with rows and columns as , and write and accordingly. Cancelling at once, multiplies out to , so by [L2] the reduced differential is and the neighbouring arrows are and . Cancelling first in the reassociated decomposition , of [L4], the pivot matrix is with , , , so the new Schur complement is , a complex by [L3], whose -pivot is and whose neighbouring arrows are and ; cancelling there gives reduced differential , incoming arrow and outgoing arrow . The two orders therefore produce the same objects and the same three reduced arrows; iterating the two-block comparison cancels in one step with the same result as the successive cancellations.
Side conditions of the composite. With the data of step 1.1, , using and ; likewise , using and ; and , using and . Hence the composite data satisfies all three side conditions of [L1].
Finite iteration. A sequence of length one is a single cancellation, which is [L1]. For a sequence of length , apply the inductive hypothesis to the first cancellations, obtaining a strong deformation retract of onto the intermediate complex given by data , and let be the data of the last cancellation, performed in the current complex with an invertible pivot, so that it is a strong deformation retract of onto the final reduction ; such data is supplied by [L1] for that pivot. Steps 1.1 and 2.1 then show that , , are strong deformation retract data of onto . By induction on the length, every finite sequence of cancellations with invertible current pivots yields such a composite retract.
Different choices. Suppose two finite sequences of cancellations lead from to reductions and ; by step 3.1 there are strong deformation retract data of onto and of onto . Define and ; then and similarly , using that are cochain maps and , . Hence the two reductions are homotopy equivalent, with explicit comparison maps. They need not be equal: in the complex over a field, cancelling at degree leaves the two-term complex with in degrees and cancelling at degree leaves the two-term complex with in degrees ; these complexes are both contractible, hence homotopy equivalent, but their degree- objects are and , so they are not equal.
Conclusion. Step 1.1 and step 2.1 give the composition formulas of clause 2 together with all five identities; step 3.1 gives clause 1 by induction; step 1.2 verifies clause 3, including that a block-diagonal aggregate pivot may be cancelled in one step with the same outcome as the successive cancellations; and step 4.1 gives clause 4, producing explicit homotopy inverse comparison maps between reductions obtained from different choices and an example where the reductions are not equal. The statement asserts nothing about infinite sequences of cancellations, about termination of any automatic procedure, or about the size of the reduction when no invertible pivot is available at a chosen degree. ∎
Depends on
- Explicit strong deformation retract from Gaussian cancellation
- An invertible cochain differential block and its candidate reduction
- Triangular basis changes diagonalize an invertible differential block
- Complexes, homotopies and contractibility in an additive category
- Composition of morphisms between finite biproducts is matrix multiplication
Used by
Dependency tree · two levels
11 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)