Chapter 5
Homological Algebra
5.1 Introduction
Homological Algebra has now reached into almost every corner of modern mathematics. It started with the invasion of algebra into topology at the hands of Emmy Noether. She pointed out that the ranks and “torsion coefficients” computed for various spaces were just the descriptions of finitely generated abelian groups as coproducts of cyclic groups; so, one should instead study these “homology invariants” as homology groups. Algebraic topology was born. In the late 30’s through the decade of the 40’s, the invasion was reversed and topology invaded algebra. Among the principal names here were Eilenberg, MacLane, Hochschild, Chevalley and Koszul. This created “homological algebra” and the first deeply influential book was in fact called “Homological Algebra” and authored by H. Cartan and S. Eilenberg (1956) [9]. Our study below is necessarily abbreviated, but it will allow the reader access to the major applications as well as forming a good foundation for deeper study in more modern topics and applications.
5.2 Complexes, Resolutions, Derived Functors
From now on, let A denote an abelian category; think of Mod(R), where R is a ring, not necessarily commutative. This is not so restrictive an example. The Freyd-Mitchell embedding theorem [15, 40], says that each “reasonable” abelian category admits a full embedding into Mod(R) for a suitable ring R. We make a new category, Kom(A), its objects are sequences of objects and morphisms from A:
−n −n+1 −1 0 n ···−→A−n −→d A−n+1 d−→ ···−→A−1 −→d A0 −→d A1 −→ · · · −→ An −→d An+1 −→··· ,
in which di+1 ◦ di = 0, for all i. That is, its objects are complexes from A. Such a complex is usually denoted by A• (sometimes, (A•,d•)). The morphisms of Kom(A) are more ϕ• complicated. However, we have the notion of “premorphism”: (A•,d•) −→ (B•,δ•). This is a sequence, ϕ•, of morphisms from A, where ϕn : An → Bn, and we require that for all n, the diagram
dn / An An+1
n ϕ ϕn+1 n / n+1 B n δ B
253 254 CHAPTER 5. HOMOLOGICAL ALGEBRA
commutes. Such ϕ’s are called chain maps,orcochain maps. The collection of complexes and their chain maps forms the category PreKom(A).
Remarks:
−n • 0 (1) Write An = A . This notation is usually used when A stops at A (correspondingly, write dn for d−n).
(2) A complex is bounded below (resp. bounded above)iffthereissomeN ≥ 0sothatAk = (0) if k<−N (resp. Ak = (0) if k>N). It is bounded iff it is bounded above and below. The sub (pre)category of the bounded complexes is denoted PreKomb(A).
(3) If Ak = (0) for all k<0, we have a cohomological complex (right complex or co-complex).
(4) If Ak = (0) for all k>0, then we use lower indices and get a homological complex (left complex,or just complex ).
(5) The category A has a full embedding in PreKom(A) via A → A•, where Ak = (0) if k =0and A0 = A and all dk ≡ 0. { n}∞ A A (6) Given a sequence, A n=−∞ from , we get an object of PreKom( ), namely:
···−→A−n −→0 A−n+1 −→0 · · · −→ A−1 −→0 A0 −→0 A1 −→0 A2 −→··· ,
where all maps are the zero map. Since Kom(A) and PreKom(A) will have the same objects, we will drop references to PreKom(A) when objects only are discussed.
(7) Given (A•,d•)inOb(Kom(A)), we make a new object of Kom(A): H•(A•), with
Hn(A•) = Ker dn/Im dn−1 ∈Ob(A),
and with all maps equal to the zero map. The object H•(A•)isthehomology of (A•,d•).
Nomenclature. A complex (A•,d•) ∈ Kom(A)isacylic iff H•(A•) ≡ (0). That is, the complex (A•,d•)is an exact sequence. ∈O A { }∞ A Given A b( ), a left (acyclic) resolution of A is a left complex, P• = Pn n=0,inKom( ) and a map P0 −→ A so that the new complex
···Pn −→ Pn−1 −→ · · · −→ P0 −→ A −→ 0
is acyclic. A right (acyclic) resolution of A ∈Ob(A) is the dual of a left acyclic resolution of A considered as an object of AD. We shall assume of the category A that:
(I) A has enough projectives (or enough injectives, or enough of both). That is, given any A ∈Ob(A) 0 there exists some projective object, P0, (resp. injective object Q ) and a surjection P0 −→ A (resp. an injection A −→ Q0).
Observe that (I) implies that each A ∈Ob(A) has an acyclic resolution P• −→ A −→ 0, with all Pn projective, or an acyclic resolution 0 −→ A −→ Q•, with all Qn injective. These are called projective (resp. injective) resolutions. For Mod(R), both exist. (For Sh(X), the category of sheaves of abelian groups on the topological space, X, injective resolutions exist.)
(II) A possesses finite coproducts (resp. finite products, or both). This holds for Mod(R)andSh(X). 5.2. COMPLEXES, RESOLUTIONS, DERIVED FUNCTORS 255
Remark: The following simple fact about projectives will be used in several of the subsequent proofs: If we have a diagram P θ f ~ / / A B C ϕ ψ in which (1) P is projective. (2) The lower sequence is exact (i.e., Im ϕ = Ker ψ). (3) ψ ◦ f =0, then there is a map θ : P → A lifting f (as shown by the dotted arrow above). Indeed, ψ ◦ f = 0 implies that Im f ⊆ Ker ψ;so,wehaveImf ⊆ Im ϕ, and we are reduced to the usual situation where ϕ is surjective. Of course, the dual property holds for injectives.
Proposition 5.1 Suppose we are given an exact sequence
ψ ϕ 0 −→ A −→ A −→ A −→ 0
and both A and A possess projective resolutions P• −→ A −→ 0 and P• −→ A −→ 0. Then, there exists a projective resolution of A, denote it P•, and maps of complexes P• −→ P• and P• −→ P• , so that the diagram / ψ• / ϕ• / / 0 P• P• P• 0
/ ψ / ϕ / / 0 A A A 0
000 commutes and has exact rows and columns. A similar result holds for injective resolutions. −→ −→ −→ −→ Proof .Wehave0 Pn Pn Pn 0ifPn exists and Pn is projective. So, the sequence would split and Pn = Pn Pn .Lookat
i −→ −→ψn ←−n −→ 0 Pn Pn Pn −→ Pn 0. ϕn Pn −→ ◦ − ◦ We have a map Pn Pn via in ϕn; we also have the map id in ϕn and ◦ − ◦ − ◦ ◦ − ◦ − ≡ ϕn (id in ϕn)=ϕn ϕn in ϕn = ϕn idn ϕn = ϕn ϕn 0. − ◦ It follows that id in ϕn factors through ψn, i.e.,
− ◦ −→ −→ψn id in ϕn : Pn Pn Pn. So, we may speak of “elements of Pn” as pairs xn =(xn,xn), where xn = ϕn(xn)and − ◦ − (id in ϕn)(xn)=xn in(xn)=xn. Therefore, xn =“xn + in(xn)” = (xn,xn). 256 CHAPTER 5. HOMOLOGICAL ALGEBRA
This shows that for every n, we should define Pn as Pn Pn . We need d• on P•. The map dn takes Pn to Pn−1. These dn should make the diagram / / / / 0 Pn+1 Pn+1 Pn+1 0