Tools of chain complexes ⋯→Cn+1dn+1CndnCn−1→⋯ and derived functors ExtRn(A,B), TornR(A,B) that measure the failure of exactness in algebraic constructions.
IntuitionWhen exactness fails
A sequence of module maps ⋯→Cn+1dn+1CndnCn−1→⋯ is called exact at Cn when imdn+1=kerdn: everything that is "killed going forward" is exactly what "came from behind". Most sequences that show up in algebra are not exact — tensoring, taking invariants, or applying Hom typically breaks exactness. Homological algebra turns this failure into a measurement: replace the sequence by a chain complex (one only requires the weaker dn∘dn+1=0, so composing two consecutive maps is zero) and define Hn(C∙)=kerdn/imdn+1. This is precisely zero when the sequence was exact at that spot, and otherwise Hn(C∙)=kerdn/imdn+1 is an algebraic invariant recording how far from exact the sequence really is. The diagram below shows a chain complex as a graph of objects linked by maps, the raw data homological algebra organizes into these groups.
Network diagram of objects connected by directed edges representing a chain complex.
A chain of objects linked by maps dn, mirroring ⋯→Cn+1dn+1CndnCn−1→⋯; the highlighted path shows one element flowing through kerdn.
SchoolFrom exact sequences to derived invariants
Definition: Chain complex and homology
A chain complex (C∙,d∙) over a ring R is a sequence of R-modules and maps satisfying
dn∘dn+1=0
so that consecutive maps compose to zero; this condition alone guarantees imdn+1⊆kerdn, and the n-th homology module measures the gap:
Given a short exact sequence of chain complexes 0→A′→A→A′′→0 (meaning 0→An′→An→An′′→0 is exact for every n, compatibly with the differentials), there is a long exact sequence of homology modules ⋯→Hn(A′)→Hn(A)→Hn(A′′)∂Hn−1(A′)→⋯, where the connecting homomorphism∂:Hn(A′′)→Hn−1(A′) is a canonically defined map.
Why is it true?
This is the single most useful computational tool in homological algebra: it lets you compute the homology of a complicated object A from the homology of two simpler pieces A′ and A′′, at the cost of understanding one connecting map. Every long exact sequence used in practice (Mayer–Vietoris, the universal coefficient theorem, the five lemma applications) is an instance of this theorem.
Proof
Step 1 (constructing ∂). Let [a′′]∈Hn(A′′) with representative cycle a′′∈An′′, d(a′′)=0. Since An→An′′ is surjective, lift a′′ to some a∈An. Then d(a)∈An maps to d(a′′)=0 in An−1′′, so by exactness d(a)=ι(a′) for a unique a′∈An−1′ (using injectivity of ι:A′→A). Define ∂[a′′]:=[a′].
Step 2 (a′ is a cycle, and ∂ is well defined). Since ι is injective and chain maps commute with d, ι(da′)=d(ιa′)=d(da)=0, so da′=0 and [a′] is a genuine homology class. If a different lift a~ of a′′ is chosen, a~−a maps to 0 in An′′, so a~−a=ι(c) for some c∈An′; then the two resulting classes in Hn−1(A′) differ by [d(c)]=0. A similar check shows ∂ is independent of the cycle representative of [a′′] (replacing a′′ by a′′+d(b′′) changes a by a boundary, hence a′ by a boundary too).
Step 3 (exactness at Hn(A) and Hn(A′′)). Exactness at Hn(A) (image of Hn(A′)→Hn(A) equals kernel of Hn(A)→Hn(A′′)) and at Hn(A′′) (image of Hn(A)→Hn(A′′) equals kernel of ∂) both follow by direct diagram chasing on representatives, using only that ι is injective, the quotient map is surjective, and imι=ker(quotient) at the chain level — the same style of argument as Steps 1–2, applied one degree at a time.
Step 4 (exactness at Hn−1(A′)). Finally one checks im∂=ker(Hn−1(A′)→Hn−1(A)): if ∂[a′′]=[a′] then ι(a′)=d(a) is a boundary in A, so [a′] maps to 0 in Hn−1(A), giving im∂⊆ker; conversely if ι(a′)=d(a) for some a∈An, running Step 1 backwards shows a′′= image of a satisfies ∂[a′′]=[a′], giving the reverse inclusion. This completes exactness at every spot, and the whole construction is exactly the classical snake lemma.
Let M be an R-module with two projective resolutions ⋯→P1→P0→M→0 and ⋯→Q1→Q0→M→0. Then there exist chain maps f∙:P∙→Q∙ and g∙:Q∙→P∙ lifting the identity of M, and any two such lifts are chain homotopic; in particular P∙ and Q∙ are chain homotopy equivalent, so ExtRn(A,B) and TornR(A,B) computed from either resolution agree.
Why is it true?
Ext and Tor are defined by picking a projective resolution and applying a functor. This theorem is what makes that definition legitimate: it guarantees the answer never depends on which resolution you happened to pick, so ExtRn(A,B) and TornR(A,B) are honest invariants of the pair of modules, not artifacts of a choice.
Proof
Step 1 (lifting the identity, degree by degree). Build fn:Pn→Qn inductively. For n=0: since P0 is projective and Q0→M is surjective, the map P0→M lifts through Q0→M to give f0:P0→Q0. Inductively, assuming fn−1 is built with dfn−1=fn−2d (or the augmentation map for n=1), the composite PndPn−1fn−1Qn−1 lands in ker(Qn−1→Qn−2)=im(Qn→Qn−1) by exactness of the Q-resolution and commutativity so far, and since Pn is projective this map lifts through the surjection Qn→im(Qn→Qn−1) to give fn:Pn→Qn with dfn=fn−1d.
Step 2 (symmetric construction of g∙). The identical argument with the roles of P∙ and Q∙ swapped produces g∙:Q∙→P∙ lifting idM.
Step 3 (homotopy uniqueness). Suppose f∙,f∙′:P∙→Q∙ are two chain maps both lifting idM; set h∙=f∙−f∙′, a chain map lifting 0. Construct a chain homotopy sn:Pn→Qn+1 with hn=dsn+sn−1d inductively: for n=0, h0:P0→Q0 composed with Q0→M is 0 (since h lifts 0), so h0 factors through ker(Q0→M)=im(Q1→Q0); projectivity of P0 lifts this factorization to s0:P0→Q1 with ds0=h0. Inductively, once sn−1 is built, hn−sn−1d:Pn→Qn composed with d:Qn→Qn−1 vanishes by the inductive relation, so (by exactness of Q∙) it factors through im(Qn+1→Qn), and projectivity of Pn lifts this to sn with dsn=hn−sn−1d, i.e. hn=dsn+sn−1d as required.
Step 4 (conclusion). Step 3 shows any two lifts of idM are chain homotopic, in particular g∙f∙ and idP∙ are both lifts of idM∘idM=idM (via P∙→Q∙→P∙), hence f∙≃g∙ means g∙f∙≃idP∙, and symmetrically f∙g∙≃idQ∙. This is exactly the definition of a chain homotopy equivalence, and since HomR(−,B) and −⊗RB send chain homotopic maps to chain homotopic maps, the resulting homology groups ExtRn(A,B), TornR(A,B) computed from P∙ or Q∙ are isomorphic.
UndergraduateReal-World Applications and Worked Examples
Tor and Ext are not just bookkeeping: TornR(A,B) governs the universal coefficient theorem used throughout topological data analysis and computational topology (computing persistent homology with different coefficient fields from an integral computation, feeding directly into data-science pipelines); and H2(G,U(1)) — a special case of ExtRn(A,B) computed for the trivial module — classifies the projective representations that appear in quantum mechanics whenever a symmetry group acts only "up to phase", a phenomenon central to the theory of anyons used in topological quantum computing.
Example: Computing Tor1Z(Z/4Z,Z/6Z)
Data pipelines that recompute topological invariants over different coefficient fields (a routine step in persistent homology software) need to know exactly how integral homology and mod-p homology differ; that difference is a Tor term. Compute Tor1Z(Z/4Z,Z/6Z) using the free resolution of Z/4Z.
Solution
Step 1: pick a free resolution of Z/4Z. The short exact sequence 0→Z×4Z→Z/4Z→0 gives the free resolution ⋯→0→Z×4Z→0 (only two nonzero terms since Z is already free).
Step 2: tensor with Z/6Z and drop the augmentation. Applying −⊗ZZ/6Z to Z×4Z gives Z/6Z×4Z/6Z, i.e. multiplication by 4 on Z/6Z.
Step 3: read off Tor as homology of this two-term complex. By definition Tor0=coker(×4)=Z/6Z/4Z/6Z and Tor1=ker(×4 on Z/6Z). Since gcd(4,6)=2, multiplying by 4 on Z/6Z has kernel equal to the subgroup of order 2 (elements x with 4x≡0(mod6), i.e. x∈{0,3}), so Tor1Z(Z/4Z,Z/6Z)≅Z/2Z, matching the general formula Tor1Z(Z/m,Z/n)≅Z/gcd(m,n)Z.
Example: Group cohomology and projective representations in quantum mechanics
In quantum mechanics, physical symmetries act on states only up to an overall phase, so a symmetry group G acts via a projective representationρ:G→PGL(V) rather than an honest linear one; lifting ρ to an actual linear map ρ^(g) produces a phase defect gρ(h)ρ(g)−1ρ(h)−1=ω(g,h)I for some function ω:G×G→U(1). Explain why the group H2(G,U(1)) (a special instance of ExtRn(A,B) in the theory of group cohomology) controls exactly which phase patterns ω are unavoidable, and why this matters for identifying genuinely quantum symmetry actions.
Solution
Step 1: the defect ω is a 2-cocycle. Associativity of the underlying group multiplication forces ω to satisfy the 2-cocycle identity, so ω defines a class [ω]∈H2(G,U(1)); changing the phase convention of ρ^ (i.e. ρ^(g)↦λ(g)ρ^(g)) changes ω by a coboundary, so the class[ω], not ω itself, is the physically meaningful invariant.
Step 2: trivial class means honest representation. If [ω]=0 in H2(G,U(1)), one can always choose phases λ(g) to cancel the defect and make ρ^ an honest linear representation; so H2(G,U(1))=0 is exactly the condition guaranteeing every projective representation of G comes from a genuine linear one.
Step 3: nontrivial class forces genuinely projective behavior. When H2(G,U(1))=0, some projective representations cannot be "fixed" by any choice of phase; the physically famous instance is G=Z/2Z×Z/2Z (rotations by π about two perpendicular spin axes), which has H2(G,U(1))≅Z/2Z nontrivial; its nontrivial extension is the quaternion group, and this is precisely why a spin-1/2 particle needs a genuinely projective (double-valued) representation — you cannot consistently choose signs to make spin rotations an honest linear representation of the rotation group, only of its double cover.
What weaker condition does a chain complex require in place of full exactness?
What guarantees that Ext and Tor do not depend on the choice of projective resolution?
What is Tor1Z(Z/4Z,Z/6Z) according to the worked example?
In the quantum mechanics example, what does a nontrivial class in H2(G,U(1)) force?