Alphabeta Math
Pipeline-generated
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.

✓ 7 results · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 7 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Homological Gaussian Elimination

1 · Prerequisites

2 · Summary

This page develops Gaussian elimination for complexes over an additive category, in the form used in Khovanov homology computations: an invertible block of a differential is cancelled and the complex is replaced by its Schur-complement reduction, with an explicit strong deformation retract recording the comparison.

The page begins with cochain complexes, cochain maps, homotopies and contractibility over an additive category, and with the dictionary that reindexes them into the published chain convention of Weibel and of Clark–Morrison–Walker. It then fixes the block decomposition dn=(abcφ):A⊕U→B⊕V with invertible pivot φ, defines the candidate reduction with differential the Schur complement a−bφ−1c, and proves that the triangular basis changes L,R diagonalize the block, transmit the neighbouring differentials to (p;0) and (r 0), and make the reduced arrows square to zero even in the neighbouring degrees.

On that base the central theorem splits the complex as a chain isomorphism onto Xˉ∙⊕K with K the contractible two-term complex 0→U→φV→0, and the following proposition exhibits the resulting projection, section and contracting homotopy explicitly; the corollary records that the chosen maps are inverse in the homotopy category and, over an abelian category, induce inverse isomorphisms on homology objects. Finite iteration of current pivots composes the retract data as p=p2p1, ı=ı1ı2, h=h1+ı1h2p1, aggregate diagonal pivots may be cancelled in one step with the same result as successive cancellations, and different valid choices give homotopy equivalent reductions, which need not be equal. The page closes with the behaviour under an additive functor, which is exactness-free for the homotopy statement, and with transfer of cochain maps along chosen retracts, which is functorial on homotopy classes but not strictly functorial on cochain maps.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-27Open item page →

Complexes, homotopies and contractibility in an additive category

Definition

Additive setting. Fix an additive category A (Additive category): every hom-set is an abelian group, finite biproducts exist, and every object has an identity morphism. All morphisms below are morphisms of A, sums and negatives are taken in the hom-groups, and 0 denotes the zero morphism between the indicated objects.

Cochain complexes. A cochain complex C∙=(Cn,dn)n∈Z consists of objects Cn of A and morphisms dn:Cn→Cn+1 with dn+1dn=0for all n∈Z. The morphisms dn are the differentials of C∙. No boundedness, finiteness or nonvanishing condition is imposed on the family of objects.

Cochain maps. A cochain map f:C∙→D∙ is a family of morphisms fn:Cn→Dn with fn+1dCn=dDnfnfor all n∈Z. Identities and composites of cochain maps are cochain maps, so cochain complexes and cochain maps form a category; this category is written Ch⁡∙(A) when the ambient category needs to be recorded.

Homotopies. A homotopy h:f≃g between cochain maps f,g:C∙→D∙ is a family of morphisms hn:Cn→Dn−1, one in each degree, such that fn−gn=dDn−1hn+hn+1dCnfor all n∈Z. Thus h has degree −1, and the right-hand side is the n-th component of the graded map dh+hd:=(dDn−1hn+hn+1dCn)n∈Z, written with d on both sides. A null homotopy of a cochain map f:C∙→D∙ is a homotopy f≃0 to the zero map with the same source and target; D∙ need not be the zero complex. A map admitting such a homotopy is null-homotopic.

Homotopy equivalence. A cochain map f:C∙→D∙ is a homotopy equivalence when there is a cochain map g:D∙→C∙ with gf≃1C∙ and fg≃1D∙; the complexes are then homotopy equivalent. The maps f and g are homotopy inverses of one another.

Contractibility. A cochain complex C∙ is contractible when its identity is null-homotopic, 1C∙≃0: that is, when there is a family of morphisms hn:Cn→Cn−1 with 1Cn=dn−1hn+hn+1dnfor all n∈Z. A complex is contractible exactly when it is homotopy equivalent to the zero complex, since a homotopy equivalence onto the zero complex is a pair of null-homotopies of the identities.

Degreewise biproducts. If C∙ and D∙ are cochain complexes, then defining (C⊕D)n:=Cn⊕Dn,dC⊕Dn:=dCn⊕dDn gives a cochain complex, because (dCn+1⊕dDn+1)(dCn⊕dDn)=0⊕0=0. The degreewise injections and projections are cochain maps, and the biproduct identities hold in each degree and are therefore identities of cochain maps; hence C⊕D is a biproduct of C and D. Iterating, finite direct sums of cochain complexes are formed degreewise, and finite direct sums of cochain maps and of homotopies are formed degreewise as well. Under the reindexing below this is the additive structure on complexes over an additive category recorded in The category of complexes in an additive category is additive.

Dictionary with the published chain convention. Reindex by Cn:=C−n and dn:=d−n. Then dn:Cn→Cn−1 and dn−1dn=d−(n−1)d−n=d−n+1d−n=0, so (C∙,d∙) is an ordinary chain complex. A cochain map f becomes the chain map with components fn:=f−n, and a homotopy h:f≃g becomes the chain homotopy sn:=h−n:Cn→Dn+1, because substituting n↦−n into the displayed homotopy equation produces exactly fn−gn=dn+1Dsn+sn−1dnC. Consequently, when A is abelian, these definitions restrict under this dictionary to the published A chain homotopy and A contractible complex, which are stated for chain complexes in an abelian category. Reindexing reverses the sign of the differential degree (+1 for cochains, −1 for chains) and of the homotopy degree (−1 for cochains, +1 for chains), and introduces no further sign.

What is not asserted. The definitions use only zero morphisms, addition, negatives, composition and identities. No kernel, cokernel, image, homology object or exactness is assumed or defined, no linear structure on the hom-groups beyond the additive one is used, and no homology object is attached to a complex in an arbitrary additive category; contractibility is the existence of the displayed family h, not the vanishing of homology.

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-27Open item page →

An invertible cochain differential block and its candidate reduction

Definition

The block decomposition. Let X∙ be a cochain complex in an additive category A (Complexes, homotopies and contractibility in an additive category) and fix an integer n. Suppose that in degrees n and n+1 the objects of X are given as biproducts Xn=A⊕U,Xn+1=B⊕V, with the injections and projections of these biproducts fixed. With respect to these ordered decompositions write the differential at degree n as the block matrix dn=(abcφ):A⊕U→B⊕V, where the rows name B,V and the columns name A,U: thus a:A→B, b:U→B, c:A→V and φ:U→V 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 φ:U→V is a pivot when it is an isomorphism, with two-sided inverse φ−1:V→U. Only φ is assumed invertible; a,b,c are arbitrary morphisms. The objects A,U,B,V 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 U→V; in particular U and V need not be nonzero or indecomposable.

The neighbours. With respect to the same decompositions write the neighbouring differentials as dn−1=(pq):Xn−1→A⊕U,dn+1=(rs):B⊕V→Xn+2, so that p:Xn−1→A, q:Xn−1→U, r:B→Xn+2 and s:V→Xn+2 are the neighbouring components across the two pivot blocks.

The candidate reduction. The candidate reduction Xˉ∙ of X∙ at the pivot φ is the collection of objects and morphisms Xˉj:=Xj(j∉{n,n+1}),Xˉn:=A,Xˉn+1:=B, with differentials dˉj:=dj (j∉{n−1,n,n+1}),dˉn−1:=p,dˉn:=a−bφ−1c,dˉn+1:=r. The morphism a−bφ−1c:A→B is the Schur complement of the pivot φ in dn. In words: the objects and arrows outside degrees n,n+1 are retained verbatim; the pivot blocks U,V are discarded; and the differential at degree n is replaced by its Schur complement, while the neighbouring differentials lose their components through the discarded blocks and keep p and r.

Status of the construction. The words candidate and reduction are provisional: the definition alone does not assert that dˉndˉn−1=0 or dˉn+1dˉn=0, that is, that Xˉ∙ is a cochain complex. The next lemma verifies this, using the identities cp+φq=0 and rb+sφ=0 that follow from the square-zero composites dndn−1=0 and dn+1dn=0 of the given complex.

Homological convention and scope. For a homological, degree-lowering complex the same formulas apply after the reindexing n↦−n of Complexes, homotopies and contractibility in an additive category: in the chain convention the pivot is the corresponding invertible block of dn and the reduced differential is again the Schur complement of that block, with the contracting homotopy of the discarded two-term complex acquiring degree +1. 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.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-27Open item page →

Triangular basis changes diagonalize an invertible differential block

Statement

Let X∙ be a cochain complex in an additive category and let dn=(abcφ):A⊕U→B⊕V be an invertible-block decomposition as in An invertible cochain differential block and its candidate reduction: the pivot φ:U→V is an isomorphism, the neighbouring components are dn−1=(pq) and dn+1=(rs), and dˉ:=a−bφ−1c is the Schur complement. Put L=(1−bφ−101):B⊕V→B⊕V,R=(10−φ−1c1):A⊕U→A⊕U. Then:

  1. L and R are isomorphisms, with inverses L−1=(1bφ−101) and R−1=(10φ−1c1).
  2. LdnR=(dˉ00φ).
  3. cp+φq=0 and rb+sφ=0; consequently R−1(pq)=(p0) and (rs)L−1=(r0).
  4. dˉp=0 and rdˉ=0.
  5. The candidate reduction Xˉ∙ of An invertible cochain differential block and its candidate reduction is a cochain complex: all composites of consecutive reduced differentials vanish.

Facts & Assumptions

Given: A cochain complex X∙ in an additive category, an integer n, a pivot decomposition Xn=A⊕U, Xn+1=B⊕V with invertible block φ:U→V, neighbouring components p,q,r,s, the Schur complement dˉ=a−bφ−1c, and the morphisms L,R,L−1,R−1 displayed above.

[L1]

The components of dn,dn−1,dn+1 are the blocks a,b,c,φ and p,q,r,s, the pivot satisfies φφ−1=1V and φ−1φ=1U, and composition of morphisms between finite biproducts is matrix multiplication (An invertible cochain differential block and its candidate reduction, Composition of morphisms between finite biproducts is matrix multiplication).

[L2]

X∙ is a cochain complex, so dndn−1=0 and dn+1dn=0 (Complexes, homotopies and contractibility in an additive category).

Proof

technique · direct
1.1

Multiplying the two matrices with [L1], the first column of dnR is dn(1A;−φ−1c)=(a−bφ−1c;c−φφ−1c)=(dˉ;0) and the second is dn(0;1U)=(b;φ), so dnR=(dˉb0φ).

L1algebra
1.2

The displayed inverses work: LL−1=(1−bφ−101)(1bφ−101)=(1001), and symmetrically L−1L=1; likewise RR−1=(10−φ−1c1)(10φ−1c1)=(1001) and R−1R=1, all uses of φφ−1=1V cancelling the middle terms.

L1algebra
1.3

The composite dndn−1 is the block matrix (ap+bqcp+φq), so dndn−1=0 gives ap+bq=0 and cp+φq=0; applying φ−1 on the left to the second equation gives q=−φ−1cp.

L1L2algebra
1.4

The composite dn+1dn is the block matrix (ra+scrb+sφ), so dn+1dn=0 gives ra+sc=0 and rb+sφ=0; multiplying the second equation on the right by φ−1 gives rbφ−1=−s.

L1L2algebra
2.1

Applying L to that result, the first column is L(dˉ;0)=(dˉ−bφ−10;0)=(dˉ;0) and the second is L(b;φ)=(b−bφ−1φ;φ)=(0;φ), hence LdnR=(dˉ00φ).

step 1.1L1algebra
2.2

The first component of R−1(pq) is 1Ap+0⋅q=p and the second is φ−1cp+1Uq=φ−1cp+q=0 by step 1.3, so R−1(pq)=(p0).

step 1.3L1algebra
2.3

Similarly (rs)L−1=(r1B+s⋅0rbφ−1+s1V)=(rrbφ−1+s)=(r0) by step 1.4.

step 1.4L1algebra
2.4

dˉp=(a−bφ−1c)p=ap−bφ−1cp=ap+bq=0, substituting q=−φ−1cp from step 1.3 and then ap+bq=0.

step 1.3algebra
2.5

rdˉ=r(a−bφ−1c)=ra−rbφ−1c=ra+sc=0, substituting rbφ−1=−s from step 1.4 and then ra+sc=0.

step 1.4algebra
3.1

Every composite of consecutive differentials of Xˉ∙ vanishes. In the two modified degrees these are dˉndn−1=dˉp=0 by step 2.4 and dˉn+1dˉn=rdˉ=0 by step 2.5. In the remaining degrees the reduction either keeps the arrows of X or replaces dn−1 by its A-component p and dn+1 by its B-component r: thus p dn−2=pr⁡Adn−1dn−2=0 because dn−1dn−2=0, and dn+2r=dn+2dn+1ıB=0 because dn+2dn+1=0, where pr⁡A and ıB are the biproduct projection and injection recording the components p and r. All other composites are composites of consecutive differentials of X, hence vanish.

L1L2step 2.4step 2.5algebra
4.1

Step 1.2 proves clause 1; steps 1.1 and 2.1 prove clause 2; steps 1.3, 1.4, 2.2 and 2.3 prove clause 3; steps 2.4 and 2.5 prove clause 4; and step 3.1 proves clause 5. In particular the candidate reduction of the block decomposition is a genuine cochain complex with the neighbouring arrows p and r. ∎

step 1.2step 1.1step 2.1step 1.3step 1.4step 2.2step 2.3step 2.4step 2.5step 3.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-27Open item page →

Gaussian elimination splits a contractible two-term complex

Statement

Let X∙ be a cochain complex in an additive category with an invertible-block decomposition dn=(abcφ):A⊕U→B⊕V and Schur complement dˉ=a−bφ−1c, as in An invertible cochain differential block and its candidate reduction, and let Xˉ∙ be the candidate reduction. Let K be the two-term cochain complex with Kn=U, Kn+1=V, Kj=0 for j∉{n,n+1} and differential dKn=φ; write Xˉ⊕K for the degreewise biproduct.

  1. The cochain map T:X∙→Xˉ∙⊕K with components Tj=1 (j∉{n,n+1}),Tn=R−1=(10φ−1c1),Tn+1=L=(1−bφ−101) is an isomorphism of cochain complexes, with inverse the cochain map T−1 whose components are 1 in degrees j∉{n,n+1}, R in degree n and L−1 in degree n+1.
  2. K is contractible, with contracting homotopy kn+1=φ−1:V→U and kj=0 for j≠n+1.
  3. X∙ and Xˉ∙ are homotopy equivalent: the projection p~:Xˉ⊕K→Xˉ and the inclusion ı~:Xˉ→Xˉ⊕K satisfy p~ı~=1 and 1−ı~p~=dh~+h~d for the homotopy h~ vanishing except in degree n+1, where h~n+1=(000φ−1), so that p:=p~T and ı:=T−1ı~ are homotopy inverse cochain maps.
  4. The construction is a chain isomorphism followed by deletion of a contractible summand: it does not identify X∙ with Xˉ∙ before that summand is split off, and in general X∙ and Xˉ∙ do not even have the same objects.

Facts & Assumptions

Given: A cochain complex X∙ in an additive category with a pivot decomposition at degree n, its candidate reduction Xˉ∙, the two-term complex K, and the maps T,T−1,L,R,L−1,R−1,p~,ı~,h~ displayed above.

[L1]

The candidate reduction is a cochain complex; LdnR=(dˉ00φ); R−1(p;q)=(p;0), (r s)L−1=(r 0) and rbφ−1=−s (Triangular basis changes diagonalize an invertible differential block).

[L2]

The decomposition of X at degrees n,n+1, the candidate reduction Xˉ∙ with objects A,B in those degrees and the two-term complex K with differential φ are as in the block definition; in particular dˉn−1=p, dˉn=dˉ, dˉn+1=r and the differential of Xˉ⊕K in degree n is (dˉ00φ) (An invertible cochain differential block and its candidate reduction).

[L3]

Cochain maps, homotopies, homotopy equivalence, contractibility and degreewise biproducts are defined by componentwise equations, and the identity of a zero object is the zero morphism (Complexes, homotopies and contractibility in an additive category).

Proof

technique · direct
1.1

Away from degrees n−1,n,n+1 the components of T are identities and Xˉ∙⊕K agrees with X∙ in the two adjacent degrees of each such case, so T commutes with the differentials there; at degree n−1 one has Tndn−1=R−1(p;q)=(p;0)=dˉn−1Tn−1 by [L1] and [L2].

L1L2algebra
1.2

At degree n, Tn+1dn=Ldn=(dˉ00φ)R−1=dXˉ⊕KnTn, using LdnR=diag⁡(dˉ,φ) and R−1R=1 from [L1].

L1L2algebra
1.3

K is a cochain complex: its only composite of consecutive differentials is dKn+1dKn=0⋅φ=0, the differentials into and out of the zero objects Kj being zero morphisms.

L2L3algebra
1.4

K is contractible with the displayed k: in degree n one has dKn−1kn+kn+1dKn=0+φ−1φ=1U, in degree n+1 one has dKnkn+1+kn+2dKn+1=φφ−1+0=1V, and in every other degree both terms are zero morphisms on a zero object.

L3algebra
2.1

At degree n+1, Tn+2dn+1=(rs) and dXˉ⊕Kn+1Tn+1=(r0)L=(r−rbφ−1)=(rs), using rbφ−1=−s from [L1]. Hence T is a cochain map.

L1L2step 1.2algebra
2.2

The family T′ with components 1 in degrees j∉{n,n+1}, R in degree n and L−1 in degree n+1 is a two-sided inverse of T componentwise: T′nTn=RR−1=1, TnT′n=R−1R=1, T′n+1Tn+1=L−1L=1, Tn+1T′n+1=LL−1=1, and the remaining components are identities.

L1step 1.2algebra
2.3

In the biproduct Xˉ∙⊕K the projection p~ onto Xˉ and the inclusion ı~ of Xˉ satisfy p~ı~=1Xˉ. For the homotopy h~ that vanishes in all degrees except n+1, where h~n+1=(000φ−1) in the coordinates B⊕V→A⊕U, one computes degreewise: in degree n both 1−ı~p~=(0001U) and dh~+h~d=h~n+1(dˉ00φ)=(0001U); in degree n+1 both 1−ı~p~=(0001V) and dh~+h~d=(dˉ00φ)h~n+1=(0001V); in all other degrees h~=0 and ı~p~=1.

L2L3step 1.3algebra
3.1

The family T′ is a cochain map: for every j, using the equation Tj+1dj=dXˉ⊕KjTj for the cochain map T and the componentwise inverse identities of step 2.2, one has T′j+1dXˉ⊕Kj=T′j+1dXˉ⊕KjTjT′j=T′j+1Tj+1djT′j=djT′j. Hence T′=T−1 is the displayed inverse cochain map.

step 2.2step 1.1step 1.2step 2.1algebra
4.1

Define p:=p~T:X∙→Xˉ∙, ı:=T−1ı~:Xˉ∙→X∙ and h:=T−1h~T. Then pı=p~TT−1ı~=p~ı~=1 and 1−ıp=T−1(1−ı~p~)T=T−1(dh~+h~d)T=d(T−1h~T)+(T−1h~T)d=dh+hd, using Td=dT and T−1d=dT−1 for the chain isomorphisms T,T−1 of steps 1.1 to 2.2. Hence p and ı are cochain maps that are homotopy inverse, so X∙ and Xˉ∙ are homotopy equivalent.

step 2.3step 3.1algebra
5.1

Steps 1.1, 1.2 and 2.1 show that T is a cochain map and steps 2.2 and 3.1 show that T′ is a two-sided inverse cochain map, so T is an isomorphism of complexes with inverse T−1=T′; steps 1.3 and 1.4 show that K is a complex contractible via φ−1; and step 4.1 transports the direct-sum deformation retract along T to the homotopy equivalence of X∙ with Xˉ∙. Because the construction replaces the objects A⊕U, B⊕V by A, B and modifies the neighbouring differentials, it never asserts an equality of complexes between X∙ and Xˉ∙: the deletion of K is a homotopy equivalence only after the chain isomorphism T. ∎

step 1.1step 1.2step 2.1step 2.2step 3.1step 1.4step 4.1
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-27Open item page →

Explicit strong deformation retract from Gaussian cancellation

Statement

Let X∙ be a cochain complex in an additive category with an invertible-block decomposition dn=(abcφ):A⊕U→B⊕V and Schur complement dˉ=a−bφ−1c, let Xˉ∙ be the candidate reduction, and let X∙≃Xˉ∙ be the homotopy equivalence of Gaussian elimination splits a contractible two-term complex. Define graded maps p:X∙→Xˉ∙, ı:Xˉ∙→X∙ and h:X∙→X∙ by the components pn=(10),pn+1=(1−bφ−1),ın=(1−φ−1c),ın+1=(10), with all other components of p and ı identities, and by hn+1=(000φ−1),hj=0 (j≠n+1). Then p and ı are cochain maps, and with the conventions of Complexes, homotopies and contractibility in an additive category for the components of composites, pı=1Xˉ∙,1X∙−ıp=dh+hd,ph=0,hı=0,h2=0. Here (ph)j=pj−1hj, (hı)j=hjıj and (h2)j=hj−1hj, so each side condition is a statement about the indicated composite in the degree written. In particular p and ı are the homotopy inverses of the homotopy equivalence of the previous theorem, exhibited by the explicit homotopy h.

Facts & Assumptions

Given: A cochain complex X∙ in an additive category with the pivot decomposition at degree n, its reduction Xˉ∙, and the graded maps p,ı,h displayed above.

[L1]

The chain isomorphism T of Gaussian elimination splits a contractible two-term complex has components Tn=R−1=(10φ−1c1) and Tn+1=L=(1−bφ−101), identities elsewhere, and the transported homotopy equivalence has the form p=p~T, ı=T−1ı~, h=T−1h~T with h~n+1=(000φ−1) and p~,ı~ the projection onto and inclusion of the reduction summand.

[L2]

The blocks satisfy LdnR=diag⁡(dˉ,φ), R−1(p;q)=(p;0), (r s)L−1=(r 0), q=−φ−1cp, rbφ−1=−s, dˉp=0 and rdˉ=0 (Triangular basis changes diagonalize an invertible differential block, Gaussian elimination splits a contractible two-term complex).

[L3]

Composites of the graded maps above are formed degreewise — (ph)j=pj−1hj, (hı)j=hjıj and (h2)j=hj−1hj — and the components of p and ı in degrees j∉{n,n+1} are identities, so ıjpj=1Xj there, sums and negatives being those of the additive ambient category (Complexes, homotopies and contractibility in an additive category).

Proof

technique · direct
1.1

The components of p are those of p~T: in degree n, pn=(10)R−1=(10); in degree n+1, pn+1=(10)L=(1−bφ−1); and in the remaining degrees both factors are identities. Since p is a composite of cochain maps, it is a cochain map.

L1algebra
1.2

The components of ı are those of T−1ı~: in degree n, ın=R(10)=(1−φ−1c); in degree n+1, ın+1=L−1(10)=(10); and in the remaining degrees both factors are identities. So ı is a cochain map.

L1algebra
1.3

The components of h are those of h~ transported by the identities in degrees other than n+1: (T−1h~T)n+1=Rh~n+1L=(000φ−1), because L preserves the V-coordinate, h~n+1 records only it with φ−1, and R leaves the element (0;φ−1v) unchanged; in degree j≠n+1 one has h~j=0 and hence hj=0.

L1algebra
2.1

pı=1Xˉ∙: in degree n one has pnın=(10)(1−φ−1c)=1A; in degree n+1 one has pn+1ın+1=(1−bφ−1)(10)=1B; in every other degree pjıj=1⋅1=1.

step 1.1step 1.2algebra
2.2

(1−ıp)n=(1001)−(1−φ−1c)(10)=(00φ−1c1) and (dh+hd)n=dn−1hn+hn+1dn=(000φ−1)(abcφ)=(00φ−1c1), using hn=0 and the block form of dn.

step 1.3L2algebra
2.3

(1−ıp)n+1=(1001)−(10)(1−bφ−1)=(0bφ−101) and (dh+hd)n+1=dnhn+1+hn+2dn+1=(abcφ)(000φ−1)=(0bφ−101), using hn+2=0.

step 1.3L2algebra
2.4

(ph)j=pj−1hj=0 for all j: for j=n+1 this is pnhn+1=(10)(000φ−1)=(00), and for j≠n+1 the factor hj is zero.

step 1.1step 1.3L3algebra
2.5

(hı)j=hjıj=0 for all j: for j=n+1 this is hn+1ın+1=(000φ−1)(10)=(00), and for j≠n+1 the factor hj is zero.

step 1.2step 1.3L3algebra
2.6

(h2)j=hj−1hj=0 for all j: if j≠n+1 then hj=0, and if j=n+1 then hj−1=hn=0.

step 1.3L3algebra
3.1

In every degree j∉{n,n+1} one has hj=0 and ıjpj=1⋅1=1, hence (1−ıp)j=0=(dh+hd)j. Together with steps 2.2 and 2.3 this gives 1−ıp=dh+hd.

step 1.3step 2.2step 2.3L3algebra
4.1

Steps 2.1, 2.2, 2.3 and 3.1 show pı=1 and 1−ıp=dh+hd for the explicit cochain maps p,ı and homotopy h, and steps 2.4 to 2.6 verify the three side conditions ph=0, hı=0 and h2=0 in the degree conventions stated. Hence the displayed data is an explicit strong deformation retract of X∙ onto Xˉ∙: a chosen retraction, a chosen section and a chosen contracting homotopy with the side conditions above. ∎

step 2.1step 2.2step 2.3step 3.1step 2.4step 2.5step 2.6
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-27Open item page →

Gaussian cancellation preserves homotopy type and abelian-category homology

Statement

Let X∙ be a cochain complex in an additive category A with a pivot decomposition at degree n, let Xˉ∙ be the candidate reduction at that pivot, and let p:X∙→Xˉ∙,ı:Xˉ∙→X∙,h be the explicit cochain maps and contracting homotopy of Explicit strong deformation retract from Gaussian cancellation, so that pı=1Xˉ∙, 1X∙−ıp=dh+hd and ph=0=hı=h2.

  1. Homotopy type. Under the reindexing dictionary Cn:=C−n of Complexes, homotopies and contractibility in an additive category, the complexes X∙ and Xˉ∙ become chain complexes X∙ and Xˉ∙ and the maps p,ı become chain maps whose homotopy classes are mutually inverse isomorphisms in the homotopy category K(A) of The homotopy category of chain complexes. Thus X∙ and Xˉ∙ are isomorphic in the homotopy category, over every additive category A.
  2. Homology. If A is abelian, then for every integer n the induced maps on the homology objects of the reindexed chain complexes are inverse isomorphisms, Hn(ı)Hn(p)=1Hn(X),Hn(p)Hn(ı)=1Hn(Xˉ), where the homology objects are those of Homology object of a chain complex and, in the cochain indexing, are the homology objects of X∙ and Xˉ∙ in degree −n.
  3. What is not claimed. No identification of X∙ with Xˉ∙ as complexes is asserted before the contractible summand is split off: by Gaussian elimination splits a contractible two-term complex the isomorphism only exists after passing to the biproduct Xˉ∙⊕K with the contractible two-term complex K, and the objects of X∙ and Xˉ∙ in degrees n and n+1 are in general different.

Facts & Assumptions

Given: A cochain complex X∙ in an additive category A with the pivot decomposition at degree n, its candidate reduction Xˉ∙, the explicit cochain maps p,ı and contracting homotopy h of Explicit strong deformation retract from Gaussian cancellation, the chain isomorphism T of Gaussian elimination splits a contractible two-term complex, and — for clause 2 — the additional assumption that A is abelian.

[L1]

p and ı are cochain maps satisfying pı=1Xˉ∙ and 1X∙−ıp=dh+hd, with h of degree −1 and ph=0, hı=0, h2=0 (Explicit strong deformation retract from Gaussian cancellation).

[L2]

Reindexing Cn:=C−n, dn:=d−n turns a cochain complex over an additive category into a chain complex over the same category, a cochain map into a chain map and a degree-(−1) cochain homotopy h into the chain homotopy sn:=h−n of degree +1 with fn−gn=dn+1Dsn+sn−1dnC; no sign is inserted (Complexes, homotopies and contractibility in an additive category).

[L3]

For an additive category, K(A) has the chain complexes as objects and the homotopy classes [f] modulo null-homotopic chain maps as morphisms, with composition induced from representatives; [f]=[g] exactly when f−g is null-homotopic (The homotopy category of chain complexes, Homotopy classes of chain maps).

[L4]

In an abelian category, a chain complex has cycle subobjects Zn(C)=ker⁡(dn) with inclusions kn, boundary subobjects Bn(C)=im⁡(dn+1), the factorization dn+1=knβnen through the boundary-to-cycle map βn:Bn(C)→Zn(C), and homology objects Hn(C)=coker⁡(βn) with quotient qn:Zn(C)→Hn(C); a chain map u has a unique induced Hn(u) characterized by Hn(u)qnC=qnDZn(u), where Zn(u) is the cycle map carried by u; and Hn is additive, so Hn(1)=1 and Hn(u+v)=Hn(u)+Hn(v) (Chain complex in an abelian category, Cycle and boundary subobjects of a complex, The boundary subobject factors through the cycle subobject, Homology object of a chain complex, A chain map carries cycles to cycles and boundaries to boundaries, A chain map induces a well-defined map on homology, Homology is an additive functor).

[L5]

The cycle inclusion kn is a kernel and hence a monomorphism, and the homology quotient qn is a cokernel and hence an epimorphism (Kernels and cokernels in a category with zero morphisms as equalizers and coequalizers, Every equalizer is a monomorphism, and every coequalizer is an epimorphism).

[L6]

The isomorphism T:X∙→Xˉ∙⊕K has components Tn=R−1 and Tn+1=L in degrees n,n+1 and identities elsewhere, so it is not an isomorphism of X∙ with Xˉ∙ itself, and the objects in degrees n,n+1 are A⊕U,B⊕V on the source and A,B on the reduction (Gaussian elimination splits a contractible two-term complex, Explicit strong deformation retract from Gaussian cancellation).

Proof

technique · direct
1.1

Clause 1. By [L1], pı=1Xˉ∙ and ıp=1X∙−(dh+hd). Under the reindexing [L2] these are chain maps p∙,ı∙ between X∙ and Xˉ∙ with p∙ı∙=1 and ı∙p∙=1X∙−w, where wn:=dn+1sn+sn−1dn and sn:=h−n. The family s exhibits w≃0, so w is null-homotopic and 1X∙−ı∙p∙=w is null-homotopic; by [L3] therefore [ı∙][p∙]=[ı∙p∙]=[1X∙] and [p∙][ı∙]=[p∙ı∙]=[1Xˉ∙], so the two classes are mutually inverse isomorphisms in K(A).

L1L2L3algebra
1.2

Clause 2, first composite. Assume A abelian. By [L2] the reindexed complexes are chain complexes in A, and p∙ı∙=1Xˉ∙ strictly by [L1]. Functoriality and additivity of Hn in [L4] give Hn(p)Hn(ı)=Hn(p∙ı∙)=Hn(1Xˉ∙)=1Hn(Xˉ).

L1L2L4algebra
1.3

Cycle-level computation. Let kn:Zn(X)→Xn be the cycle inclusion, so dnkn=0, and let dn+1=knβnen be the factorization of [L4]. Then wnkn=dn+1snkn+sn−1dnkn=knβn(ensnkn), because the second summand vanishes and the first is dn+1(snkn). As a difference of the chain maps 1X∙ and ı∙p∙, the map w is a chain map, so [L4] gives a cycle map Zn(w) with knZn(w)=wnkn=knβn(ensnkn); by [L5] the inclusion kn is monic, so Zn(w)=βn(ensnkn).

L4L5algebra
2.1

The homotopy term induces zero. Applying the homology quotient qn:Zn(X)→Hn(X) to step 1.3 gives qnZn(w)=qnβn(ensnkn)=0, since qn is the cokernel of βn by [L4]. The characterizing property Hn(w)qn=qnZn(w) of [L4] therefore gives Hn(w)qn=0, and qn is epic by [L5], so Hn(w)=0 for every n.

L4L5step 1.3algebra
3.1

Clause 2, second composite. By [L1] and [L2], ı∙p∙=1X∙−w with w as in step 1.1, so functoriality and additivity of Hn in [L4] give Hn(ı)Hn(p)=Hn(1X∙)+Hn(−w)=1Hn(X)−Hn(w), which equals 1Hn(X) by step 2.1. Together with step 1.2 the two induced maps are inverse isomorphisms.

L1L2L4step 2.1algebra
4.1

Conclusion. Step 1.1 proves clause 1: the classes are inverse in K(A) over an arbitrary additive category. Steps 1.2 and 2.1, 3.1 prove clause 2: over an abelian category Hn(p) and Hn(ı) are mutually inverse isomorphisms on every homology object. Clause 3 is the qualification carried by [L6]: the displayed identities are those of the deformation retract of X∙ onto Xˉ∙ and of the chain isomorphism onto Xˉ∙⊕K, so no equality or canonical identification of the complexes X∙ and Xˉ∙ is being asserted. ∎

step 1.1step 1.2step 2.1step 3.1L6
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-27Open item page →

Finite iteration of current invertible-block cancellations

Statement

Let X∙ be a cochain complex in an additive category.

  1. Iteration. Suppose a finite sequence of Gaussian cancellations is performed on X∙, 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 X∙ onto the final reduction, with the explicit data described in clause 2.
  2. Composition of retract data. If X∙⇄Y∙ has data (p1,ı1,h1) and Y∙⇄Z∙ has data (p2,ı2,h2) in the sense of Explicit strong deformation retract from Gaussian cancellation, then p=p2p1,ı=ı1ı2,h=h1+ı1h2p1 satisfy pı=1Z∙, 1X∙−ıp=dh+hd, ph=0, hı=0 and h2=0, so they are strong deformation retract data of X∙ onto Z∙.
  3. Aggregate pivots. If a decomposition of Xn,Xn+1 is presented with pivot blocks that are finite biproducts U=U1⊕⋯⊕Uk, V=V1⊕⋯⊕Vk and a block-diagonal isomorphism Φ=diag⁡(φ1,…,φk):U→V, then a single cancellation with pivot Φ is available, and the resulting reduction is the complex obtained by cancelling φ1,…,φk successively in the current Schur-complement complexes.
  4. 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 X∙ 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.

[L1]

A single cancellation with pivot φ:U→V in the current complex gives cochain maps p,ı and a homotopy h of degree −1 with pı=1 and 1−ıp=dh+hd, ph=0, hı=0, h2=0 (Explicit strong deformation retract from Gaussian cancellation).

[L2]

The candidate reduction at the pivot replaces the objects A⊕U,B⊕V in degrees n,n+1 by A,B, keeps all other objects and arrows, keeps the neighbouring components p of dn−1 and r of dn+1, and replaces dn by the Schur complement a−bφ−1c; the pivot blocks U,V may themselves be biproducts and φ may be any isomorphism between them (An invertible cochain differential block and its candidate reduction).

[L3]

The candidate reduction is a cochain complex, and the identities LdnR=diag⁡(dˉ,φ), R−1(p;q)=(p;0), (r s)L−1=(r 0) hold for every pivot (Triangular basis changes diagonalize an invertible differential block).

[L4]

Composition of morphisms between finite biproducts is matrix multiplication, and finite biproducts may be reassociated: splitting A⊕U1⊕U′ as (A⊕U′)⊕U1 and B⊕V1⊕V′ as (B⊕V′)⊕V1 is a biproduct decomposition again (Composition of morphisms between finite biproducts is matrix multiplication, An invertible cochain differential block and its candidate reduction).

[L5]

Cochain maps are closed under composition, the equations pı=1, 1−ıp=dh+hd, ph=0, hı=0, h2=0 are degreewise identities of morphisms, and a cochain map u satisfies du=ud in the graded sense (Complexes, homotopies and contractibility in an additive category).

Proof

technique · direct
1.1

Composition of retract data. Assume p1ı1=1Y, ı1p1=1X−(dh1+h1d), p2ı2=1Z and ı2p2=1Y−(dh2+h2d), and put p=p2p1, ı=ı1ı2, h=h1+ı1h2p1. Then pı=p2p1ı1ı2=p21Yı2=p2ı2=1Z; moreover ıp=ı1ı2p2p1=ı1(1Y−dh2−h2d)p1=ı1p1−ı1dh2p1−ı1h2dp1, so 1X−ıp=(1X−ı1p1)+ı1dh2p1+ı1h2dp1=dh1+h1d+ı1dh2p1+ı1h2dp1. On the other hand dh+hd=d(h1+ı1h2p1)+(h1+ı1h2p1)d=dh1+h1d+dı1h2p1+ı1h2p1d, and dı1=ı1d, p1d=dp1 because ı1,p1 are cochain maps, so the two expressions coincide and 1X−ıp=dh+hd.

L1L5algebra
1.2

Aggregate pivots. Let Xn=A⊕U1⊕U′ and Xn+1=B⊕V1⊕V′ with pivot blocks U=U1⊕U′, V=V1⊕V′ and Φ=diag⁡(φ1,Φ′), where φ1:U1→V1 and Φ′:U′→V′ are isomorphisms; write dn as the block matrix with rows B,V1,V′ and columns A,U1,U′ as (ab1b′c1φ10c′0Φ′), and write dn−1=(p;q1;q′) and dn+1=(r s1 s′) accordingly. Cancelling Φ at once, Φ−1=diag⁡(φ1−1,Φ′−1) multiplies out to bΦ−1c=b1φ1−1c1+b′Φ′−1c′, so by [L2] the reduced differential is a−b1φ1−1c1−b′Φ′−1c′ and the neighbouring arrows are p and r. Cancelling first φ1 in the reassociated decomposition (A⊕U′)⊕U1, (B⊕V′)⊕V1 of [L4], the pivot matrix is (a~b~c~φ1) with a~=(ab′c′Φ′), b~=(b1;0), c~=(c1 0), so the new Schur complement is a~−b~φ1−1c~=(a−b1φ1−1c1b′c′Φ′), a complex by [L3], whose (U′,V′)-pivot is Φ′ and whose neighbouring arrows are (p;q′) and (r s′); cancelling Φ′ there gives reduced differential a−b1φ1−1c1−b′Φ′−1c′, incoming arrow p and outgoing arrow r. The two orders therefore produce the same objects and the same three reduced arrows; iterating the two-block comparison cancels diag⁡(φ1,…,φk) in one step with the same result as the successive cancellations.

L2L3L4algebra
2.1

Side conditions of the composite. With the data of step 1.1, ph=p2p1h1+p2p1ı1h2p1=p2⋅0+p2⋅1Y⋅h2p1=p2h2p1=0, using p1h1=0 and p2h2=0; likewise hı=h1ı1ı2+ı1h2p1ı1ı2=0+ı1h2⋅1Y⋅ı2=ı1h2ı2=0, using h1ı1=0 and h2ı2=0; and h2=h12+h1ı1h2p1+ı1h2p1h1+ı1h2p1ı1h2p1=0+0+ı1h2(p1h1)+ı1h2⋅1Y⋅h2p1=ı1h22p1=0, using h12=0 and h22=0. Hence the composite data satisfies all three side conditions of [L1].

L1L5step 1.1algebra
3.1

Finite iteration. A sequence of length one is a single cancellation, which is [L1]. For a sequence of length m≥2, apply the inductive hypothesis to the first m−1 cancellations, obtaining a strong deformation retract of X∙ onto the intermediate complex Y∙ given by data (p1,ı1,h1), and let (p2,ı2,h2) be the data of the last cancellation, performed in the current complex Y∙ with an invertible pivot, so that it is a strong deformation retract of Y∙ onto the final reduction Z∙; such data is supplied by [L1] for that pivot. Steps 1.1 and 2.1 then show that p=p2p1, ı=ı1ı2, h=h1+ı1h2p1 are strong deformation retract data of X∙ onto Z∙. By induction on the length, every finite sequence of cancellations with invertible current pivots yields such a composite retract.

L1step 1.1step 2.1algebra
4.1

Different choices. Suppose two finite sequences of cancellations lead from X∙ to reductions Xˉ∙ and Xˉ′∙; by step 3.1 there are strong deformation retract data (p,ı,h) of X∙ onto Xˉ∙ and (p′,ı′,h′) of X∙ onto Xˉ′∙. Define u:=p′ı:Xˉ∙→Xˉ′∙ and v:=pı′:Xˉ′∙→Xˉ∙; then uv=p′ıpı′=p′(1X∙−(dh+hd))ı′=1Xˉ′−d(p′hı′)−(p′hı′)d and similarly vu=1Xˉ−d(ph′ı)−(ph′ı)d, using that p′,ı,p,ı′ are cochain maps and p′ı′=1, pı=1. Hence the two reductions are homotopy equivalent, with explicit comparison maps. They need not be equal: in the complex k→1k→0k→1k over a field, cancelling at degree 0 leaves the two-term complex with k in degrees 2,3 and cancelling at degree 2 leaves the two-term complex with k in degrees 0,1; these complexes are both contractible, hence homotopy equivalent, but their degree-0 objects are 0 and k, so they are not equal.

L1L2step 3.1algebra
5.1

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. ∎

step 1.1step 2.1step 1.2step 3.1step 4.1L2
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-27Open item page →

Additive functors preserve chosen Gaussian cancellations

Statement

Let F:A→B be an additive functor between additive categories, let X∙ be a cochain complex in A with a pivot decomposition at degree n, Schur complement dˉ=a−bφ−1c, candidate reduction Xˉ∙ and two-term complex K as in An invertible cochain differential block and its candidate reduction and Gaussian elimination splits a contractible two-term complex, and let (p,ı,h) be the strong deformation retract data of Explicit strong deformation retract from Gaussian cancellation.

  1. Complexes and pivots. F(X∙), with differentials F(dn), is a cochain complex in B; the pivot F(φ) is invertible with inverse F(φ−1); and with respect to the biproduct decompositions F(Xn)=F(A)⊕F(U), F(Xn+1)=F(B)⊕F(V) whose structure maps are the F-images of those of X∙, the differential F(dn) has the entrywise image matrix (F(a)F(b)F(c)F(φ)).
  2. The corresponding cancellation. The reduction of F(X∙) at the pivot F(φ) is F(Xˉ∙): its objects and neighbouring arrows are the F-images of those of Xˉ∙, and its differential in degree n is the Schur complement F(a)−F(b)F(φ)−1F(c)=F(dˉ).
  3. Retract data. The images F(p),F(ı),F(h) satisfy F(p)F(ı)=1, 1−F(ı)F(p)=F(d)F(h)+F(h)F(d), F(p)F(h)=0, F(h)F(ı)=0 and F(h)2=0, so they are strong deformation retract data of F(X∙) onto F(Xˉ∙). Moreover F(K) is the two-term complex F(U)→F(φ)F(V) with vanishing neighbouring terms, contractible via F(φ−1), and F(T),F(T−1) remain mutually inverse cochain isomorphisms between F(X∙) and F(Xˉ∙⊕K).
  4. Scope. Clauses 1 to 3 use only additivity: no exactness of F is assumed or needed. If B is abelian, the image retract maps induce inverse isomorphisms on the homology of F(X∙) and F(Xˉ∙), by Gaussian cancellation preserves homotopy type and abelian-category homology. No comparison of F(Hn(X)) with Hn(F(X)) is asserted; these expressions both make sense when A and B are abelian, but comparing them is a separate question about commuting F with homology.

Facts & Assumptions

Given: An additive functor F:A→B between additive categories, a cochain complex X∙ in A with the pivot decomposition at degree n, its reduction Xˉ∙, the two-term complex K, the chain isomorphism T, and the explicit cochain maps p,ı and homotopy h of the strong deformation retract.

[L1]

p,ı are cochain maps and h has degree −1, with pı=1Xˉ∙, 1X∙−ıp=dh+hd, ph=0, hı=0 and h2=0 (Explicit strong deformation retract from Gaussian cancellation).

[L2]

The decomposition Xn=A⊕U, Xn+1=B⊕V has φ:U→V invertible, dn=(abcφ), dn−1=(p;q), dn+1=(r s), and the candidate reduction replaces degrees n,n+1 by A,B with dn replaced by dˉ=a−bφ−1c and neighbouring arrows p and r (An invertible cochain differential block and its candidate reduction).

[L3]

T:X∙→Xˉ∙⊕K is an isomorphism of cochain complexes with inverse T−1, where K has Kn=U, Kn+1=V, vanishing terms elsewhere and differential φ, and K is contractible with contracting homotopy φ−1 in degree n+1 (Gaussian elimination splits a contractible two-term complex).

[L4]

An additive functor preserves composition and identities, and its induced maps on hom-groups are homomorphisms: F(f+g)=F(f)+F(g) and hence F(−f)=−F(f) (Additive functor).

[L5]

An additive functor preserves finite biproducts, so the F-images of the injections and projections of a finite biproduct exhibit F(A⊕U) as a biproduct F(A)⊕F(U) with the same identity-sum relations; it also preserves zero morphisms; and composition of morphisms between finite biproducts is matrix multiplication (An additive functor preserves finite biproducts, An additive functor preserves zero morphisms, Composition of morphisms between finite biproducts is matrix multiplication, Complexes, homotopies and contractibility in an additive category).

[L6]

In an abelian category, the maps of a Gaussian strong deformation retract induce mutually inverse maps on every homology object of the reindexed chain complexes (Gaussian cancellation preserves homotopy type and abelian-category homology).

Proof

technique · direct
1.1

Complex and pivot. Since dn+1dn=0 in X∙, [L4] gives F(dn+1)F(dn)=F(dn+1dn)=F(0Xn,Xn+2), which is the zero morphism by [L5]; thus F(X∙) is a cochain complex. Likewise F(φ)F(φ−1)=F(φφ−1)=F(1V)=1F(V) and F(φ−1)F(φ)=1F(U), so F(φ) is invertible with the displayed inverse.

L4L5algebra
1.2

Image matrices. By [L5] the F-images of the injections and projections of Xn=A⊕U and Xn+1=B⊕V exhibit F(Xn) as F(A)⊕F(U) and F(Xn+1) as F(B)⊕F(V). Writing dn=iBapA+iBbpU+iVcpA+iVφpU with the biproduct structure maps [L2], additivity of F on hom-groups, preservation of composition and the biproduct relations give F(dn)=F(iB)F(a)F(pA)+F(iB)F(b)F(pU)+F(iV)F(c)F(pA)+F(iV)F(φ)F(pU), whose matrix with respect to the image decompositions is (F(a)F(b)F(c)F(φ)) by the matrix convention of [L5]. The same computation applies to dn−1 and dn+1, giving the image neighbouring components F(p),F(q),F(r),F(s).

L4L5algebra
1.3

Retract identities are preserved. Applying [L4] to the identities of [L1] and using [L5] for the zero morphisms: F(p)F(ı)=F(pı)=F(1Xˉ∙)=1F(Xˉ∙); F(d)F(h)+F(h)F(d)=F(dh+hd)=F(1X∙−ıp)=1F(X∙)−F(ı)F(p); F(p)F(h)=F(ph)=F(0)=0; F(h)F(ı)=F(hı)=0; and F(h)2=F(h2)=F(0)=0. Since p,ı are cochain maps, F(p),F(ı) are cochain maps by [L4].

L1L4L5algebra
2.1

The contractible summand and the isomorphism. By [L3] and [L4], F(T)F(T−1)=F(TT−1)=F(1)=1 and F(T−1)F(T)=1, so F(T) is an isomorphism of complexes with inverse F(T−1); and F(K) has objects F(U),F(V) in degrees n,n+1, vanishing terms elsewhere with zero differentials, and differential F(φ), with F(φ)F(φ−1)=1F(V) and F(φ−1)F(φ)=1F(U) from step 1.1, so F(φ−1) is a contracting homotopy for F(K).

L3L4L5step 1.1algebra
2.2

The reduction of F(X∙) is F(Xˉ∙). By step 1.2 the reduction problem for F(X∙) in degrees n,n+1 is the image matrix (F(a)F(b)F(c)F(φ)) with pivot F(φ), and by step 1.1 that pivot is invertible; [L4] gives F(a)−F(b)F(φ−1)F(c)=F(a−bφ−1c)=F(dˉ), and applying F to the remaining data of [L2] gives objects F(A),F(B) in degrees n,n+1, neighbouring arrows F(p),F(r) and the unchanged images of the outside objects and arrows. Hence the candidate reduction of F(X∙) at this pivot is exactly F(Xˉ∙), its differential in degree n being the image F(dˉ) of the Schur complement.

L2L4step 1.1step 1.2algebra
3.1

Conclusion. Step 1.1 shows that F(X∙) is a complex with invertible pivot F(φ), step 1.2 computes the image matrices, and step 2.2 identifies the reduction of F(X∙) with F(Xˉ∙), which is clause 2 and the matrix assertion of clause 1. Step 1.3 verifies all five strong deformation retract identities for F(p),F(ı),F(h), and step 2.1 shows that F(K) is contractible via F(φ−1) and that F(T) is an isomorphism, which is clause 3. Only additivity, preservation of finite biproducts and preservation of zero morphisms are used, so no exactness hypothesis enters; if B is abelian, [L6] applied to the image cancellation identified in step 2.2 gives inverse homology maps. This compares the homology of the two image complexes, not the image under F of a homology object in A. ∎

L6step 2.1step 2.2step 1.3step 1.2step 1.1algebra
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-27Open item page →

Transferred maps are functorial up to homotopy, with strict naturality limits

Statement

Let A be an additive category and let chosen strong deformation retract data be given as in Explicit strong deformation retract from Gaussian cancellation: (pX,ıX,hX) for X∙ onto Xˉ∙,(pY,ıY,hY) for Y∙ onto Yˉ∙,(pZ,ıZ,hZ) for Z∙ onto Zˉ∙. For every cochain map f:X∙→Y∙ define the transfer fˉ:=pYfıX:Xˉ∙→Yˉ∙, and for every homotopy s:f≃g define sˉ:=pYsıX.

  1. Maps and homotopies. Each transfer fˉ is a cochain map, each sˉ is a homotopy fˉ≃gˉ of degree −1, and consequently transfer is well defined on homotopy classes of cochain maps.
  2. Functoriality up to homotopy. The identity transfers strictly, 1X∙‾=1Xˉ∙, and for composable cochain maps f:X∙→Y∙, g:Y∙→Z∙, (gf)‾−gˉfˉ=dk+kd,k:=pZghYfıX, so (gf)‾≃gˉfˉ: transfer preserves identities and composition on homotopy classes, but it is not asserted to be a strict functor on cochain maps.
  3. Strictness fails. Transfer need not preserve composition strictly: for over a field k, take Y∙=K=(k→1k) in degrees 0,1 and X∙=Y∙⊕K. The split-off retract onto Xˉ∙=Y∙ admits cochain maps f,g with fˉ=0=gˉ and (gf)‾=1Xˉ∙, so (gf)‾−gˉfˉ≠0.
  4. Strict naturality, and what is not claimed. If cochain maps f:X∙→Y∙ and g:Y∙→Z∙ commute with the chosen retract data, that is fıX=ıYfˉ, pYf=fˉpX, gıY=ıZgˉ and pZg=gˉpY, then (gf)‾=gˉfˉ strictly. Transfer depends on the chosen retracts and homotopies; no choice-free, canonical or confluent transfer, and no independence of the chosen data, is claimed.

Facts & Assumptions

Given: An additive category A with three chosen strong deformation retract data (pX,ıX,hX), (pY,ıY,hY), (pZ,ıZ,hZ) as in the statement, composable cochain maps f:X∙→Y∙ and g:Y∙→Z∙, and, separately, parallel cochain maps u,v:X∙→Y∙ with a homotopy s:u≃v.

[L1]

For each of the three pairs, p and ı are cochain maps, h has degree −1, and pı=1, 1−ıp=dh+hd, ph=0, hı=0, h2=0 (Explicit strong deformation retract from Gaussian cancellation).

[L2]

The split-off retract of the theorem: if X∙=Xˉ∙⊕K is a biproduct in which K is the contractible two-term complex with differential the identity in degrees n,n+1, then the projection p, the inclusion ı and the homotopy h with hn+1=(0001) and hj=0 for j≠n+1 are strong deformation retract data of X∙ onto Xˉ∙ (Gaussian elimination splits a contractible two-term complex, Explicit strong deformation retract from Gaussian cancellation).

[L3]

A homotopy s of degree −1 between cochain maps satisfies f−g=ds+sd; composites and sums of cochain maps are cochain maps, and a cochain map u satisfies du=ud in the graded sense; homotopy is an equivalence relation compatible with composition, so the homotopy classes of cochain maps are the morphisms of the homotopy category under the reindexing dictionary of Complexes, homotopies and contractibility in an additive category (Homotopy classes of chain maps, The homotopy category of chain complexes).

Proof

technique · direct
1.1

Transfer of maps and homotopies. The composite fˉ=pYfıX of cochain maps is a cochain map, so dfˉ=fˉd by [L3]. If f−g=ds+sd, then fˉ−gˉ=pY(f−g)ıX=pYdsıX+pYsdıX=d(pYsıX)+(pYsıX)d, using pYd=dpY and dıX=ıXd; hence sˉ=pYsıX is a degree-(−1) homotopy fˉ≃gˉ. Therefore homotopic maps have homotopic transfers, and transfer is well defined on homotopy classes.

L1L3algebra
1.2

Functoriality up to homotopy. The identity transfers strictly: 1X∙‾=pX1X∙ıX=pXıX=1Xˉ∙. For composable f,g set k:=pZghYfıX; then gˉfˉ=pZgıYpYfıX=pZg(1Y∙−(dhY+hYd))fıX=(gf)‾−(pZgdhYfıX+pZghYdfıX), and since pZ,g,f,ıX are cochain maps the two correction terms are d(pZghYfıX) and (pZghYfıX)d, that is dk and kd. Hence gˉfˉ=(gf)‾−(dk+kd), equivalently (gf)‾−gˉfˉ=dk+kd, so (gf)‾≃gˉfˉ with this sign convention.

L1L3algebra
1.3

Strictness fails. Take A the category of vector spaces over a field, let K be the two-term complex k→1k concentrated in degrees 0,1 with zero neighbouring terms, let Xˉ∙ be a second copy of it and X∙=Xˉ∙⊕K, and use the split-off retract of [L2] with ı the inclusion of the first summand, p the projection onto it and h1=(0001), h0=h2=0. In each degree let f=(0010) and g=(0100) in the coordinates Xˉ0⊕K0 respectively Xˉ1⊕K1; the components in degrees 0 and 1 agree, so both maps commute with the only nonzero differential d0=1, so f and g are cochain maps. Then gf=(1000)=ıp, and the transfers are fˉ=pfı=0 and gˉ=pgı=0 because fı and gı land in the complementary summand killed by p, while (gf)‾=p(gf)ı=pı=1Xˉ∙. Hence (gf)‾−gˉfˉ=1Xˉ∙≠0, so transfer is not a strict functor on cochain maps.

L2L3algebra
1.4

Strict naturality for commuting morphisms. Let f:X∙→Y∙ and g:Y∙→Z∙ satisfy fıX=ıYfˉ, pYf=fˉpX, gıY=ıZgˉ and pZg=gˉpY. Then (gf)‾=pZgfıX=pZgıYfˉ=gˉpYıYfˉ=gˉfˉ, the last step by [L1]; under these hypotheses the transfer pYfıX=fˉpXıX=fˉ is the given fˉ, so the computation compares the transfer of the composite with the composite of the transfers. In this situation identity and composition are preserved strictly, not merely up to homotopy.

L1L3algebra
2.1

Conclusion. Step 1.1 shows that transfer sends cochain maps to cochain maps and homotopic maps to homotopic maps, so it is well defined on homotopy classes of cochain maps; step 1.2 shows that it preserves identities strictly and composition up to the explicit homotopy pZghYfıX, so it is functorial on homotopy classes while not being a strict functor on cochain maps; step 1.3 exhibits cochain maps with fˉ=gˉ=0 and (gf)‾=1, which establishes that failure; and step 1.4 gives strict functoriality on the subcategory of morphisms commuting with the chosen retract data. Since the transfer uses the chosen projections and inclusions, while the displayed comparison homotopy also uses the chosen homotopies, clause 4 records that no choice-free, canonical or confluent transfer and no independence of the chosen data is being claimed. ∎

step 1.1step 1.2step 1.3step 1.4L3

5 · Examples, counterexamples and false statements

None yet.

Sources