Fiveable

🧬Homological Algebra Unit 2 Review

QR code for Homological Algebra practice questions

2.1 Definition and properties of chain complexes

2.1 Definition and properties of chain complexes

Written by the Fiveable Content Team • Last updated August 2025
Written by the Fiveable Content Team • Last updated August 2025
🧬Homological Algebra
Unit & Topic Study Guides

Chain complexes are sequences of abelian groups connected by boundary maps. They're crucial in homological algebra, helping us study algebraic structures and topological spaces. The key property is that composing two consecutive boundary maps gives zero.

This section dives into the definition and properties of chain complexes. We'll explore cycles, boundaries, and homology groups, which measure "holes" in algebraic objects. Understanding these concepts is essential for grasping the broader ideas in homological algebra.

Chain Complexes and Graded Modules

Definition and Structure

  • A chain complex is a sequence of abelian groups or modules CnC_n connected by homomorphisms dn:CnCn1d_n: C_n \rightarrow C_{n-1} called boundary maps or differentials
  • The boundary maps satisfy the condition dn1dn=0d_{n-1} \circ d_n = 0 for all nn, meaning the composition of any two consecutive boundary maps is the zero map
  • A graded module is a module that can be expressed as a direct sum of submodules indexed by the integers, i.e., M=nZMnM = \bigoplus_{n \in \mathbb{Z}} M_n
  • The elements of MnM_n are said to have degree nn, and the degree of a homogeneous element xMnx \in M_n is denoted by x=n|x| = n

Boundary Operators and Differentials

  • The boundary operator or differential dn:CnCn1d_n: C_n \rightarrow C_{n-1} lowers the degree of the elements by 1
  • The condition dn1dn=0d_{n-1} \circ d_n = 0 implies that the image of dnd_n is contained in the kernel of dn1d_{n-1}, i.e., im dnkerdn1\text{im } d_n \subseteq \ker d_{n-1}
  • This condition is necessary for the homology groups of the chain complex to be well-defined
  • The differential can be thought of as a generalization of the boundary operator in simplicial or cellular homology, which maps a chain to its boundary
Definition and Structure, MultiwayGroup | Wolfram Function Repository

Exactness and Homology

Exact Sequences

  • A sequence of abelian groups or modules and homomorphisms between them is called exact if the image of each homomorphism is equal to the kernel of the next homomorphism
  • In the context of chain complexes, a short exact sequence is a sequence of the form 0AfBgC00 \rightarrow A \xrightarrow{f} B \xrightarrow{g} C \rightarrow 0, where ff is injective, gg is surjective, and im f=kerg\text{im } f = \ker g
  • Exact sequences are important tools in homological algebra, as they allow for the study of relationships between different chain complexes and their homology groups
Definition and Structure, 5.6: Coordination Numbers and Structures - Chemistry LibreTexts

Cycles, Boundaries, and Homology

  • A cycle in a chain complex (Cn,dn)(C_n, d_n) is an element xCnx \in C_n such that dn(x)=0d_n(x) = 0, i.e., an element in the kernel of the boundary map
  • A boundary in a chain complex (Cn,dn)(C_n, d_n) is an element xCnx \in C_n such that there exists a yCn+1y \in C_{n+1} with dn+1(y)=xd_{n+1}(y) = x, i.e., an element in the image of the boundary map
  • The nn-th homology group of a chain complex (Cn,dn)(C_n, d_n) is defined as the quotient group Hn(C)=kerdn/im dn+1H_n(C) = \ker d_n / \text{im } d_{n+1}, i.e., the cycles modulo the boundaries
  • Homology groups measure the "holes" or "voids" in a topological space or algebraic object, with different dimensions of holes corresponding to different homology groups

Chain Homotopy

Definition and Properties

  • A chain homotopy between two chain maps f,g:CDf, g: C \rightarrow D is a sequence of homomorphisms hn:CnDn+1h_n: C_n \rightarrow D_{n+1} such that fngn=dn+1Dhn+hn1dnCf_n - g_n = d^D_{n+1} \circ h_n + h_{n-1} \circ d^C_n for all nn
  • If there exists a chain homotopy between ff and gg, then ff and gg are said to be chain homotopic, denoted by fgf \simeq g
  • Chain homotopy is an equivalence relation on the set of chain maps between two chain complexes
  • Chain homotopic maps induce the same homomorphisms on homology, i.e., if fgf \simeq g, then f=g:Hn(C)Hn(D)f_* = g_*: H_n(C) \rightarrow H_n(D) for all nn, where ff_* and gg_* are the induced maps on homology
  • The concept of chain homotopy is analogous to the notion of homotopy between continuous maps in topology, but adapted to the algebraic setting of chain complexes