##  [Chain Complex](/chain-complex-0) 

 Definition

A graded sequence of abelian groups or modules ...C_n... connected by boundary maps d_n: C_n → C_{n-1} with d_{n-1} ∘ d_n = 0 for all n; used to define homology groups H_n = ker d_n / im d_{n+1}.

 

 

 

 

 

 





## Principle

Principle

The organizing rule is 'the boundary of a boundary is zero': successive boundary maps compose to zero, which isolates cycles and boundaries and allows quotienting to form homology.

 

 

 

 

 





## Demonstration

Demonstration

The singular chain complex of a topological space has C_n generated by continuous maps from the standard n-simplex into the space and boundary maps induced by restriction to faces, producing singular homology.

 

 

 

 

## Misapplication

Misapplication

Forgetting grading signs or composing maps in the wrong degree, or treating chain maps that are only quasi-isomorphisms as honest isomorphisms of homology without verifying induced maps on homology.

 

 

 

 

 





## Consequence

Consequence

Correct construction yields homology groups that are homotopy-invariant invariants of spaces or objects, supports long exact sequences from short exact sequences of complexes, and enables derived functor calculations.

 

 

 

 

## Reversal

Reversal

Reversing arrows and grading produces a cochain complex: coboundary maps increase degree and cohomology groups arise from kernels modulo images in the opposite grading direction.

 

 

 

 

 





## Boundary

Boundary

Requires an additive category (typically abelian groups or modules) to form kernels, images, and quotients; non-graded chains or non-additive settings are outside this definition unless a suitable analogue is specified.

 

 

 

 

 





## Semantic Tension

Semantic Tension

Tension exists between plain chain complexes and differential graded algebras or modules: the latter add multiplicative structure and higher coherence, changing available constructions and invariants.

 

 

 

 

 





## Synthesis

Synthesis

A chain complex is a graded additive object with boundary maps whose square is zero; cycles and boundaries defined by these maps produce homology groups that encode algebraic-topological information about the original object.