Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 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.

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.

Depends on

Used by

Dependency tree · two levels

7 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