Chain complex

A graded sequence of modules with differentials d lowering degree and satisfying d∘d=0.
Chain complex

Definition

Let RR be a ring and let {Cn}nZ\{C_n\}_{n\in\mathbb Z} be a family of . A chain complex (C,d) (C_\bullet, d) is a collection of RR-linear maps (called differentials)

dn:CnCn1(nZ) d_n : C_n \longrightarrow C_{n-1}\qquad (n\in\mathbb Z)

such that

dn1dn=0for all n. d_{n-1}\circ d_n = 0\quad\text{for all }n.

Equivalently, im(dn)ker(dn1)\operatorname{im}(d_n)\subseteq \ker(d_{n-1}) for all nn.

The associated homology modules are

Hn(C)=ker(dn)/im(dn+1), H_n(C_\bullet)=\ker(d_n)/\operatorname{im}(d_{n+1}),

see .

  • Morphisms between complexes: .
  • When all homology vanishes: .
  • Categorical setting: in an , a chain complex is defined the same way using kernels and images.

Examples

  1. Complex concentrated in degree 0.
    For an RR-module MM, the diagram

    0M0 \cdots \to 0 \to M \to 0 \to \cdots

    with MM in degree 00 and all differentials 00, is a chain complex. Its homology is H0MH_0\cong M and Hn=0H_n=0 for n0n\neq 0.

  2. A map as a 2-term complex.
    Any RR-linear map f:MNf:M\to N gives a chain complex

    0MfN0 0 \longrightarrow M \xrightarrow{\,f\,} N \longrightarrow 0

    with MM in degree 11 and NN in degree 00. Then

    H1ker(f),H0coker(f), H_1 \cong \ker(f),\qquad H_0 \cong \operatorname{coker}(f),

    using / .

  3. “Multiplication by xx” complex.
    For xRx\in R, the 2-term complex

    0RxR0 0 \to R \xrightarrow{\,\cdot x\,} R \to 0

    (degrees 101\to 0) has

    H1{rR:xr=0}=AnnR(x),H0R/xR. H_1 \cong \{r\in R: xr=0\} = \operatorname{Ann}_R(x), \qquad H_0 \cong R/xR.

    If RR is a domain and x0x\neq 0, then H1=0H_1=0.