ConceptComplete

Chain Complexes and Homology - Key Properties

Chain homotopy provides a notion of "equivalence" between chain maps that is coarser than equality but finer than inducing the same homology maps.

Definition1.4Chain Homotopy

Let f,g:CDf, g: C_\bullet \to D_\bullet be chain maps. A chain homotopy from ff to gg is a collection of homomorphisms hn:CnDn+1h_n: C_n \to D_{n+1} such that:

fngn=n+1Dhn+hn1nCf_n - g_n = \partial_{n+1}^D \circ h_n + h_{n-1} \circ \partial_n^C

for all nn. We write fgf \simeq g and say ff and gg are chain homotopic.

TheoremChain Homotopic Maps Induce Same Homology

If f,g:CDf, g: C_\bullet \to D_\bullet are chain homotopic, then they induce the same homomorphism on homology: Hn(f)=Hn(g):Hn(C)Hn(D)H_n(f) = H_n(g): H_n(C_\bullet) \to H_n(D_\bullet) for all nn.

Proof

Let hh be a chain homotopy from ff to gg, and let [z]Hn(C)[z] \in H_n(C_\bullet) be represented by a cycle zZn(C)z \in Z_n(C_\bullet). Then:

fn(z)gn(z)=(n+1Dhn+hn1nC)(z)f_n(z) - g_n(z) = (\partial_{n+1}^D \circ h_n + h_{n-1} \circ \partial_n^C)(z)

Since zz is a cycle, nC(z)=0\partial_n^C(z) = 0, so: fn(z)gn(z)=n+1D(hn(z))f_n(z) - g_n(z) = \partial_{n+1}^D(h_n(z))

This shows fn(z)gn(z)Bn(D)f_n(z) - g_n(z) \in B_n(D_\bullet), hence fn(z)f_n(z) and gn(z)g_n(z) represent the same homology class.

Definition1.5Chain Homotopy Equivalence

A chain map f:CDf: C_\bullet \to D_\bullet is a chain homotopy equivalence if there exists a chain map g:DCg: D_\bullet \to C_\bullet such that:

  • gfidCg \circ f \simeq \text{id}_{C_\bullet}
  • fgidDf \circ g \simeq \text{id}_{D_\bullet}

We say CC_\bullet and DD_\bullet are chain homotopy equivalent.

ExampleContractible Chain Complex

A chain complex CC_\bullet is called contractible if it is chain homotopy equivalent to the zero complex. This happens if and only if the identity map idC\text{id}_{C_\bullet} is null-homotopic, i.e., there exists hh such that: idn=n+1hn+hn1n\text{id}_n = \partial_{n+1} \circ h_n + h_{n-1} \circ \partial_n

Contractible complexes have zero homology in all degrees.

Remark

Chain homotopy equivalence is weaker than isomorphism of chain complexes but stronger than having isomorphic homology. Two chain complexes can have the same homology without being chain homotopy equivalent, but chain homotopy equivalence always implies isomorphic homology.

ExampleMapping Cone

Given a chain map f:CDf: C_\bullet \to D_\bullet, the mapping cone Cone(f)\text{Cone}(f) is defined by: Cone(f)n=DnCn1\text{Cone}(f)_n = D_n \oplus C_{n-1}

with differential (d,c)=(D(d)+fn1(c),C(c))\partial(d, c) = (\partial_D(d) + f_{n-1}(c), -\partial_C(c)). The cone measures the failure of ff to be a quasi-isomorphism.