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.

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

Depends on

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