Search Knowledge

© 2026 LIBREUNI PROJECT

Homological Algebra

Homological Algebra

Homological algebra is the branch of mathematics that studies homology in a general algebraic setting. It is a powerful tool used in algebraic topology, algebraic geometry, and number theory.

Chain Complexes

A chain complex (C,d)(C_\bullet, d_\bullet) is a sequence of abelian groups (or modules) and homomorphisms: dn+1CndnCn1dn1\dots \xrightarrow{d_{n+1}} C_n \xrightarrow{d_n} C_{n-1} \xrightarrow{d_{n-1}} \dots such that the composition of any two consecutive maps is zero: dndn+1=0d_n \circ d_{n+1} = 0.

This condition implies that the image of dn+1d_{n+1} is contained in the kernel of dnd_n: im(dn+1)ker(dn)im(d_{n+1}) \subseteq ker(d_n).

python
1import numpy as np
2 
3def is_chain_complex(matrices):
4 """Check if a sequence of boundary matrices forms a chain complex."""
5 for i in range(len(matrices) - 1):
6 # Result of d_n * d_{n+1} should be zero matrix
7 prod = np.matmul(matrices[i], matrices[i+1])
8 if not np.allclose(prod, 0):
9 return False, i
10 return True, None
11 
12# Example: d1 * d2 = 0
13d1 = np.array([[1, -1, 0], [0, 1, -1]]) # Edges to vertices
14d2 = np.array([[1], [1], [1]]) # Triangle face to edges
15 
16is_valid, index = is_chain_complex([d1, d2])
17print(f"Is chain complex: {is_valid}")

Homology Groups

The nn-th homology group is the quotient group: Hn(C)=ker(dn)im(dn+1)H_n(C) = \frac{ker(d_n)}{im(d_{n+1})} Elements of ker(dn)ker(d_n) are called cycles, and elements of im(dn+1)im(d_{n+1}) are called boundaries. Homology measures the extent to which the complex is not “exact.”

If a chain complex is 'exact' at position n, what is Hn?

Exact Sequences

A sequence is exact if the image of each map is exactly the kernel of the next. A short exact sequence is a sequence of the form: 0AfBgC00 \to A \xrightarrow{f} B \xrightarrow{g} C \to 0 which implies that ff is injective, gg is surjective, and im(f)=ker(g)im(f) = ker(g).

In a short exact sequence of finite-dimensional vector spaces, what is the relationship between their dimensions?

Diagram Chasing and the Snake Lemma

Diagram chasing is a method of proof used in homological algebra to establish properties of morphisms by tracing elements through commutative diagrams. The Snake Lemma is a fundamental result that relates the kernels and cokernels of two morphisms between short exact sequences.