MathLabs

Algebra

Homological algebra

Tools of chain complexes ⋯→Cn+1→dn+1Cn→dnCn−1→⋯\cdots \to C_{n+1} \xrightarrow{d_{n+1}} C_n \xrightarrow{d_n} C_{n-1} \to \cdots and derived functors Ext⁡Rn(A,B)\operatorname{Ext}^n_R(A,B), Tor⁡nR(A,B)\operatorname{Tor}^R_n(A,B) that measure the failure of exactness in algebraic constructions.

IntuitionWhen exactness fails

A sequence of module maps ⋯→Cn+1→dn+1Cn→dnCn−1→⋯\cdots \to C_{n+1} \xrightarrow{d_{n+1}} C_n \xrightarrow{d_n} C_{n-1} \to \cdots is called exact at CnC_n when im⁡dn+1=ker⁡dn\operatorname{im} d_{n+1} = \ker d_n: 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⁡\operatorname{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=0d_n \circ d_{n+1} = 0, so composing two consecutive maps is zero) and define Hn(C∙)=ker⁡dn/im⁡dn+1H_n(C_\bullet) = \ker d_n / \operatorname{im} d_{n+1}. This is precisely zero when the sequence was exact at that spot, and otherwise Hn(C∙)=ker⁡dn/im⁡dn+1H_n(C_\bullet) = \ker d_n / \operatorname{im} d_{n+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 dnd_n, mirroring ⋯→Cn+1→dn+1Cn→dnCn−1→⋯\cdots \to C_{n+1} \xrightarrow{d_{n+1}} C_n \xrightarrow{d_n} C_{n-1} \to \cdots; the highlighted path shows one element flowing through ker⁡dn\ker d_n.

SchoolFrom exact sequences to derived invariants

Definition: Chain complex and homology

A chain complex (C∙,d∙)(C_\bullet, d_\bullet) over a ring RR is a sequence of RR-modules and maps satisfying

dn∘dn+1=0d_n \circ d_{n+1} = 0

so that consecutive maps compose to zero; this condition alone guarantees im⁡dn+1⊆ker⁡dn\operatorname{im} d_{n+1} \subseteq \ker d_n, and the nn-th homology module measures the gap:

Hn(C∙)=ker⁡dn/im⁡dn+1H_n(C_\bullet) = \ker d_n \big/ \operatorname{im} d_{n+1}
Two families of derived functors
FunctorDerivesMeasures
Tor⁡nR(A,B)\operatorname{Tor}^R_n(A,B)−⊗RB-\otimes_R Bfailure of tensor to be exact
Ext⁡Rn(A,B)\operatorname{Ext}^n_R(A,B)Hom⁡R(−,B)\operatorname{Hom}_R(-,B)failure of Hom⁡\operatorname{Hom} to be exact / extension classes

UndergraduateThe two foundational theorems

Given a short exact sequence of chain complexes 0→A′→A→A′′→00 \to A' \to A \to A'' \to 0 (meaning 0→An′→An→An′′→00 \to A'_n \to A_n \to A''_n \to 0 is exact for every nn, compatibly with the differentials), there is a long exact sequence of homology modules ⋯→Hn(A′)→Hn(A)→Hn(A′′)→∂Hn−1(A′)→⋯\cdots \to H_n(A') \to H_n(A) \to H_n(A'') \xrightarrow{\partial} H_{n-1}(A') \to \cdots, where the connecting homomorphism ∂:Hn(A′′)→Hn−1(A′)\partial: H_n(A'') \to H_{n-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 AA from the homology of two simpler pieces A′A' and A′′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 ∂\partial). Let [a′′]∈Hn(A′′)[a''] \in H_n(A'') with representative cycle a′′∈An′′a'' \in A''_n, d(a′′)=0d(a'')=0. Since An→An′′A_n \to A''_n is surjective, lift a′′a'' to some a∈Ana \in A_n. Then d(a)∈And(a) \in A_n maps to d(a′′)=0d(a'')=0 in An−1′′A''_{n-1}, so by exactness d(a)=ι(a′)d(a) = \iota(a') for a unique a′∈An−1′a' \in A'_{n-1} (using injectivity of ι:A′→A\iota: A' \to A). Define ∂[a′′]:=[a′]\partial[a''] := [a'].

Step 2 (a′a' is a cycle, and ∂\partial is well defined). Since ι\iota is injective and chain maps commute with dd, ι(da′)=d(ιa′)=d(da)=0\iota(d a') = d(\iota a') = d(d a) = 0, so da′=0d a' = 0 and [a′][a'] is a genuine homology class. If a different lift a~\tilde a of a′′a'' is chosen, a~−a\tilde a - a maps to 00 in An′′A''_n, so a~−a=ι(c)\tilde a - a = \iota(c) for some c∈An′c \in A'_n; then the two resulting classes in Hn−1(A′)H_{n-1}(A') differ by [d(c)]=0[d(c)] = 0. A similar check shows ∂\partial is independent of the cycle representative of [a′′][a''] (replacing a′′a'' by a′′+d(b′′)a'' + d(b'') changes aa by a boundary, hence a′a' by a boundary too).

Step 3 (exactness at Hn(A)H_n(A) and Hn(A′′)H_n(A'')). Exactness at Hn(A)H_n(A) (image of Hn(A′)→Hn(A)H_n(A')\to H_n(A) equals kernel of Hn(A)→Hn(A′′)H_n(A)\to H_n(A'')) and at Hn(A′′)H_n(A'') (image of Hn(A)→Hn(A′′)H_n(A)\to H_n(A'') equals kernel of ∂\partial) both follow by direct diagram chasing on representatives, using only that ι\iota is injective, the quotient map is surjective, and im⁡ι=ker⁡(quotient)\operatorname{im}\iota = \ker(\text{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′)H_{n-1}(A')). Finally one checks im⁡∂=ker⁡(Hn−1(A′)→Hn−1(A))\operatorname{im}\partial = \ker(H_{n-1}(A')\to H_{n-1}(A)): if ∂[a′′]=[a′]\partial[a'']=[a'] then ι(a′)=d(a)\iota(a')=d(a) is a boundary in AA, so [a′][a'] maps to 00 in Hn−1(A)H_{n-1}(A), giving im⁡∂⊆ker⁡\operatorname{im}\partial \subseteq \ker; conversely if ι(a′)=d(a)\iota(a')=d(a) for some a∈Ana\in A_n, running Step 1 backwards shows a′′=a''= image of aa satisfies ∂[a′′]=[a′]\partial[a'']=[a'], giving the reverse inclusion. This completes exactness at every spot, and the whole construction is exactly the classical snake lemma.

Let MM be an RR-module with two projective resolutions ⋯→P1→P0→M→0\cdots \to P_1 \to P_0 \to M \to 0 and ⋯→Q1→Q0→M→0\cdots \to Q_1 \to Q_0 \to M \to 0. Then there exist chain maps f∙:P∙→Q∙f_\bullet: P_\bullet \to Q_\bullet and g∙:Q∙→P∙g_\bullet: Q_\bullet \to P_\bullet lifting the identity of MM, and any two such lifts are chain homotopic; in particular P∙P_\bullet and Q∙Q_\bullet are chain homotopy equivalent, so Ext⁡Rn(A,B)\operatorname{Ext}^n_R(A,B) and Tor⁡nR(A,B)\operatorname{Tor}^R_n(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 Ext⁡Rn(A,B)\operatorname{Ext}^n_R(A,B) and Tor⁡nR(A,B)\operatorname{Tor}^R_n(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→Qnf_n: P_n \to Q_n inductively. For n=0n=0: since P0P_0 is projective and Q0→MQ_0 \to M is surjective, the map P0→MP_0 \to M lifts through Q0→MQ_0 \to M to give f0:P0→Q0f_0: P_0 \to Q_0. Inductively, assuming fn−1f_{n-1} is built with dfn−1=fn−2dd f_{n-1} = f_{n-2} d (or the augmentation map for n=1n=1), the composite Pn→dPn−1→fn−1Qn−1P_n \xrightarrow{d} P_{n-1} \xrightarrow{f_{n-1}} Q_{n-1} lands in ker⁡(Qn−1→Qn−2)=im⁡(Qn→Qn−1)\ker(Q_{n-1}\to Q_{n-2})=\operatorname{im}(Q_n \to Q_{n-1}) by exactness of the QQ-resolution and commutativity so far, and since PnP_n is projective this map lifts through the surjection Qn→im⁡(Qn→Qn−1)Q_n \to \operatorname{im}(Q_n\to Q_{n-1}) to give fn:Pn→Qnf_n: P_n \to Q_n with dfn=fn−1dd f_n = f_{n-1} d.

Step 2 (symmetric construction of g∙g_\bullet). The identical argument with the roles of P∙P_\bullet and Q∙Q_\bullet swapped produces g∙:Q∙→P∙g_\bullet: Q_\bullet \to P_\bullet lifting idM\mathrm{id}_M.

Step 3 (homotopy uniqueness). Suppose f∙,f∙′:P∙→Q∙f_\bullet, f'_\bullet: P_\bullet \to Q_\bullet are two chain maps both lifting idM\mathrm{id}_M; set h∙=f∙−f∙′h_\bullet = f_\bullet - f'_\bullet, a chain map lifting 00. Construct a chain homotopy sn:Pn→Qn+1s_n: P_n \to Q_{n+1} with hn=dsn+sn−1dh_n = d s_n + s_{n-1} d inductively: for n=0n=0, h0:P0→Q0h_0: P_0 \to Q_0 composed with Q0→MQ_0\to M is 00 (since hh lifts 00), so h0h_0 factors through ker⁡(Q0→M)=im⁡(Q1→Q0)\ker(Q_0\to M)=\operatorname{im}(Q_1\to Q_0); projectivity of P0P_0 lifts this factorization to s0:P0→Q1s_0: P_0 \to Q_1 with ds0=h0d s_0 = h_0. Inductively, once sn−1s_{n-1} is built, hn−sn−1d:Pn→Qnh_n - s_{n-1} d: P_n \to Q_n composed with d:Qn→Qn−1d: Q_n \to Q_{n-1} vanishes by the inductive relation, so (by exactness of Q∙Q_\bullet) it factors through im⁡(Qn+1→Qn)\operatorname{im}(Q_{n+1}\to Q_n), and projectivity of PnP_n lifts this to sns_n with dsn=hn−sn−1dd s_n = h_n - s_{n-1}d, i.e. hn=dsn+sn−1dh_n = d s_n + s_{n-1}d as required.

Step 4 (conclusion). Step 3 shows any two lifts of idM\mathrm{id}_M are chain homotopic, in particular g∙f∙g_\bullet f_\bullet and idP∙\mathrm{id}_{P_\bullet} are both lifts of idM∘idM=idM\mathrm{id}_M \circ \mathrm{id}_M = \mathrm{id}_M (via P∙→Q∙→P∙P_\bullet \to Q_\bullet \to P_\bullet), hence f∙≃g∙f_\bullet \simeq g_\bullet means g∙f∙≃idP∙g_\bullet f_\bullet \simeq \mathrm{id}_{P_\bullet}, and symmetrically f∙g∙≃idQ∙f_\bullet g_\bullet \simeq \mathrm{id}_{Q_\bullet}. This is exactly the definition of a chain homotopy equivalence, and since Hom⁡R(−,B)\operatorname{Hom}_R(-,B) and −⊗RB-\otimes_R B send chain homotopic maps to chain homotopic maps, the resulting homology groups Ext⁡Rn(A,B)\operatorname{Ext}^n_R(A,B), Tor⁡nR(A,B)\operatorname{Tor}^R_n(A,B) computed from P∙P_\bullet or Q∙Q_\bullet are isomorphic.

UndergraduateReal-World Applications and Worked Examples

Tor and Ext are not just bookkeeping: Tor⁡nR(A,B)\operatorname{Tor}^R_n(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))H^2(G, U(1)) — a special case of Ext⁡Rn(A,B)\operatorname{Ext}^n_R(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 Tor⁡1Z(Z/4Z,Z/6Z)\operatorname{Tor}^{\mathbb{Z}}_1(\mathbb{Z}/4\mathbb{Z}, \mathbb{Z}/6\mathbb{Z})

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-pp homology differ; that difference is a Tor term. Compute Tor⁡1Z(Z/4Z,Z/6Z)\operatorname{Tor}^{\mathbb{Z}}_1(\mathbb{Z}/4\mathbb{Z}, \mathbb{Z}/6\mathbb{Z}) using the free resolution of Z/4Z\mathbb{Z}/4\mathbb{Z}.

Solution

Step 1: pick a free resolution of Z/4Z\mathbb{Z}/4\mathbb{Z}. The short exact sequence 0→Z→×4Z→Z/4Z→00 \to \mathbb{Z} \xrightarrow{\times 4} \mathbb{Z} \to \mathbb{Z}/4\mathbb{Z} \to 0 gives the free resolution ⋯→0→Z→×4Z→0\cdots \to 0 \to \mathbb{Z} \xrightarrow{\times 4} \mathbb{Z} \to 0 (only two nonzero terms since Z\mathbb{Z} is already free).

Step 2: tensor with Z/6Z\mathbb{Z}/6\mathbb{Z} and drop the augmentation. Applying −⊗ZZ/6Z- \otimes_{\mathbb{Z}} \mathbb{Z}/6\mathbb{Z} to Z→×4Z\mathbb{Z} \xrightarrow{\times 4} \mathbb{Z} gives Z/6Z→×4Z/6Z\mathbb{Z}/6\mathbb{Z} \xrightarrow{\times 4} \mathbb{Z}/6\mathbb{Z}, i.e. multiplication by 44 on Z/6Z\mathbb{Z}/6\mathbb{Z}.

Step 3: read off Tor as homology of this two-term complex. By definition Tor⁡0=coker⁡(×4)=Z/6Z/4Z/6Z\operatorname{Tor}_0 = \operatorname{coker}(\times 4) = \mathbb{Z}/6\mathbb{Z} / 4\mathbb{Z}/6\mathbb{Z} and Tor⁡1=ker⁡(×4 on Z/6Z)\operatorname{Tor}_1 = \ker(\times 4 \text{ on } \mathbb{Z}/6\mathbb{Z}). Since gcd⁡(4,6)=2\gcd(4,6)=2, multiplying by 44 on Z/6Z\mathbb{Z}/6\mathbb{Z} has kernel equal to the subgroup of order 22 (elements xx with 4x≡0(mod6)4x \equiv 0 \pmod 6, i.e. x∈{0,3}x \in \{0,3\}), so Tor⁡1Z(Z/4Z,Z/6Z)≅Z/2Z\operatorname{Tor}^{\mathbb{Z}}_1(\mathbb{Z}/4\mathbb{Z},\mathbb{Z}/6\mathbb{Z}) \cong \mathbb{Z}/2\mathbb{Z}, matching the general formula Tor⁡1Z(Z/m,Z/n)≅Z/gcd⁡(m,n)Z\operatorname{Tor}_1^{\mathbb{Z}}(\mathbb{Z}/m,\mathbb{Z}/n) \cong \mathbb{Z}/\gcd(m,n)\mathbb{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 GG acts via a projective representation ρ:G→PGL(V)\rho: G \to PGL(V) rather than an honest linear one; lifting ρ\rho to an actual linear map ρ^(g)\hat\rho(g) produces a phase defect gρ(h)ρ(g)−1ρ(h)−1=ω(g,h) Ig\rho(h)\rho(g)^{-1}\rho(h)^{-1} = \omega(g,h)\, I for some function ω:G×G→U(1)\omega: G\times G \to U(1). Explain why the group H2(G,U(1))H^2(G,U(1)) (a special instance of Ext⁡Rn(A,B)\operatorname{Ext}^n_R(A,B) in the theory of group cohomology) controls exactly which phase patterns ω\omega are unavoidable, and why this matters for identifying genuinely quantum symmetry actions.

Solution

Step 1: the defect ω\omega is a 22-cocycle. Associativity of the underlying group multiplication forces ω\omega to satisfy the 22-cocycle identity, so ω\omega defines a class [ω]∈H2(G,U(1))[\omega] \in H^2(G,U(1)); changing the phase convention of ρ^\hat\rho (i.e. ρ^(g)↦λ(g)ρ^(g)\hat\rho(g) \mapsto \lambda(g)\hat\rho(g)) changes ω\omega by a coboundary, so the class [ω][\omega], not ω\omega itself, is the physically meaningful invariant.

Step 2: trivial class means honest representation. If [ω]=0[\omega]=0 in H2(G,U(1))H^2(G,U(1)), one can always choose phases λ(g)\lambda(g) to cancel the defect and make ρ^\hat\rho an honest linear representation; so H2(G,U(1))=0H^2(G,U(1)) = 0 is exactly the condition guaranteeing every projective representation of GG comes from a genuine linear one.

Step 3: nontrivial class forces genuinely projective behavior. When H2(G,U(1))≠0H^2(G,U(1)) \ne 0, some projective representations cannot be "fixed" by any choice of phase; the physically famous instance is G=Z/2Z×Z/2ZG = \mathbb{Z}/2\mathbb{Z}\times\mathbb{Z}/2\mathbb{Z} (rotations by π\pi about two perpendicular spin axes), which has H2(G,U(1))≅Z/2ZH^2(G,U(1)) \cong \mathbb{Z}/2\mathbb{Z} nontrivial; its nontrivial extension is the quaternion group, and this is precisely why a spin-1/21/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 Tor⁡1Z(Z/4Z,Z/6Z)\operatorname{Tor}^{\mathbb{Z}}_1(\mathbb{Z}/4\mathbb{Z}, \mathbb{Z}/6\mathbb{Z}) according to the worked example?

In the quantum mechanics example, what does a nontrivial class in H2(G,U(1))H^2(G,U(1)) force?

References

  1. Charles A. Weibel (1994). An Introduction to Homological Algebra
  2. Henri Cartan, Samuel Eilenberg (1956). Homological Algebra
  3. Alexander Grothendieck (1957). Sur quelques points d'algèbre homologique (the Tôhoku paper) · DOI:10.2748/tmj/1178244839
  4. Bhargav Bhatt, Akhil Mathew, Thomas Nikolaus (2019). Topological Cyclic Homology · arXiv:1802.03261