Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-27
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.

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

Depends on

Used by

Dependency tree · two levels

8 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