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.
Explicit strong deformation retract from Gaussian cancellation
Statement
Let be a cochain complex in an additive category with an invertible-block decomposition and Schur complement , let be the candidate reduction, and let be the homotopy equivalence of Gaussian elimination splits a contractible two-term complex. Define graded maps , and by the components with all other components of and identities, and by Then and are cochain maps, and with the conventions of Complexes, homotopies and contractibility in an additive category for the components of composites, Here , and , so each side condition is a statement about the indicated composite in the degree written. In particular and are the homotopy inverses of the homotopy equivalence of the previous theorem, exhibited by the explicit homotopy .
Facts & Assumptions
Given: A cochain complex in an additive category with the pivot decomposition at degree , its reduction , and the graded maps displayed above.
The chain isomorphism of Gaussian elimination splits a contractible two-term complex has components and , identities elsewhere, and the transported homotopy equivalence has the form , , with and the projection onto and inclusion of the reduction summand.
The blocks satisfy , , , , , and (Triangular basis changes diagonalize an invertible differential block, Gaussian elimination splits a contractible two-term complex).
Composites of the graded maps above are formed degreewise — , and — and the components of and in degrees are identities, so there, sums and negatives being those of the additive ambient category (Complexes, homotopies and contractibility in an additive category).
Proof
The components of are those of : in degree , ; in degree , ; and in the remaining degrees both factors are identities. Since is a composite of cochain maps, it is a cochain map.
The components of are those of : in degree , ; in degree , ; and in the remaining degrees both factors are identities. So is a cochain map.
The components of are those of transported by the identities in degrees other than : , because preserves the -coordinate, records only it with , and leaves the element unchanged; in degree one has and hence .
: in degree one has ; in degree one has ; in every other degree .
and , using and the block form of .
and , using .
for all : for this is , and for the factor is zero.
for all : for this is , and for the factor is zero.
for all : if then , and if then .
In every degree one has and , hence . Together with steps 2.2 and 2.3 this gives .
Steps 2.1, 2.2, 2.3 and 3.1 show and for the explicit cochain maps and homotopy , and steps 2.4 to 2.6 verify the three side conditions , and in the degree conventions stated. Hence the displayed data is an explicit strong deformation retract of onto : a chosen retraction, a chosen section and a chosen contracting homotopy with the side conditions above. ∎
Depends on
Used by
- Gaussian cancellation preserves homotopy type and abelian-category homology Corollary
- Two adjacent noncomposable Gaussian pivots in either finite order Example
- Additive functors preserve chosen Gaussian cancellations Proposition
- Transferred maps are functorial up to homotopy, with strict naturality limits Proposition
- Finite iteration of current invertible-block cancellations Theorem
Dependency tree · two levels
9 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
- David Clark, Scott Morrison and Kevin Walker, Fixing the Functoriality of Khovanov Homology, Appendix A.1, printed pp. 1562-1563 (standard reference, not scraped)
- Dror Bar-Natan, Fast Khovanov Homology Computations, section 4 Lemma 4.2 and section 5, printed p. 5 (standard reference, not scraped)