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 is a sequence of abelian groups (or modules) and homomorphisms:
such that the composition of any two consecutive maps is zero: .
This condition implies that the image of is contained in the kernel of : .
Interactive Lab
import numpy as np
def is_chain_complex(matrices):
"""Check if a sequence of boundary matrices forms a chain complex."""
for i in range(len(matrices) - 1):
# Result of d_n * d_{n+1} should be zero matrix
prod = np.matmul(matrices[i], matrices[i+1])
if not np.allclose(prod, 0):
return False, i
return True, None
# Example: d1 * d2 = 0
d1 = np.array([[1, -1, 0], [0, 1, -1]]) # Edges to vertices
d2 = np.array([[1], [1], [1]]) # Triangle face to edges
is_valid, index = is_chain_complex([d1, d2])
print(f"Is chain complex: {is_valid}")
python
1import numpy as np
2
3def is_chain_complex(matrices):
4"""Check if a sequence of boundary matrices forms a chain complex."""
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 -th homology group is the quotient group:
Elements of are called cycles, and elements of are called boundaries. Homology measures the extent to which the complex is not “exact.”
Knowledge Check
If a chain complex is 'exact' at position n, what is Hn?
Answer: The zero group 0.
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:
which implies that is injective, is surjective, and .
Knowledge Check
In a short exact sequence of finite-dimensional vector spaces, what is the relationship between their dimensions?
Answer: dim(B) = dim(A) + dim(C)
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.