Romyar SharifiLECTURE NOTES
READING EDITIONPDF

LECTURE NOTES / Chapter 3

Homological Algebra

Romyar Sharifi

Chapter 3 Derived Functors

Book contents

Chapter 3
Derived Functors

3.1. δ-functors

Let us return briefly to the general setting. Suppose that 𝒞 and 𝒟 are abelian categories.

Definition 3.1.1.

A homological δ-functor is a sequence of additive functors Fi: 𝒞 𝒟 for i , together with, for every exact sequence

0 A fB gC 0

in 𝒞, morphisms δi: Fi(C) Fi1(A) fitting in a long exact sequence

Fi(A) Fi(f)Fi(B) Fi(g)Fi(C) δiFi1(A)

which are natural in the sense that if we have a morphism of short exact sequences in 𝒞,

A morphism of short exact sequences. A full diagram description follows.
Diagram description: A morphism of short exact sequences

The two displayed rows are exact, and the squares commute.

Objects, listed by row and column:

  • Row 1, from left to right: column 1: 0; column 2: A; column 3: B; column 4: C; column 5: 0.
  • Row 2, from left to right: column 1: 0; column 2: A prime; column 3: B prime; column 4: C prime; column 5: 0.

Arrows and lines:

  1. An arrow from 0 (row 1, column 1) to A, without a label.
  2. An arrow from A to B, without a label.
  3. An arrow from A to A prime, without a label.
  4. An arrow from B to C, without a label.
  5. An arrow from B to B prime, without a label.
  6. An arrow from C to 0 (row 1, column 5), without a label.
  7. An arrow from C to C prime, without a label.
  8. An arrow from 0 (row 2, column 1) to A prime, without a label.
  9. An arrow from A prime to B prime, without a label.
  10. An arrow from B prime to C prime, without a label.
  11. An arrow from C prime to 0 (row 2, column 5), without a label.

then we obtain a morphism of long exact sequences in 𝒟,

Naturality of a homological delta-functor. A full diagram description follows.
Diagram description: Naturality of a homological delta-functor

The two displayed rows are exact, and the squares commute.

Objects, listed by row and column:

  • Row 1, from left to right: column 1: ellipsis; column 2: F subscript (i)(A); column 3: F subscript (i)(B); column 4: F subscript (i)(C); column 5: F subscript (i minus 1)(A); column 6: ellipsis.
  • Row 2, from left to right: column 1: ellipsis; column 2: F subscript (i)(A prime ); column 3: F subscript (i)(B prime ); column 4: F subscript (i)(C prime ); column 5: F subscript (i minus 1)(A prime ); column 6: ellipsis.

Arrows and lines:

  1. An arrow from ellipsis (row 1, column 1) to F subscript (i)(A), without a label.
  2. An arrow from F subscript (i)(A) to F subscript (i)(B), without a label.
  3. An arrow from F subscript (i)(A) to F subscript (i)(A prime ), without a label.
  4. An arrow from F subscript (i)(B) to F subscript (i)(C), without a label.
  5. An arrow from F subscript (i)(B) to F subscript (i)(B prime ), without a label.
  6. An arrow from F subscript (i)(C) to F subscript (i minus 1)(A), without a label.
  7. An arrow from F subscript (i)(C) to F subscript (i)(C prime ), without a label.
  8. An arrow from F subscript (i minus 1)(A) to ellipsis (row 1, column 6), without a label.
  9. An arrow from F subscript (i minus 1)(A) to F subscript (i minus 1)(A prime ), without a label.
  10. An arrow from ellipsis (row 2, column 1) to F subscript (i)(A prime ), without a label.
  11. An arrow from F subscript (i)(A prime ) to F subscript (i)(B prime ), without a label.
  12. An arrow from F subscript (i)(B prime ) to F subscript (i)(C prime ), without a label.
  13. An arrow from F subscript (i)(C prime ) to F subscript (i minus 1)(A prime ), without a label.
  14. An arrow from F subscript (i minus 1)(A prime ) to ellipsis (row 2, column 6), without a label.

Example 3.1.2.

Define functors F0, F1: 𝐀𝐛 𝐀𝐛 by F0(A) = A𝑝𝐴 and

F1(A) = A[p] = {a A𝑝𝑎 = 0}

for any abelian group A, and set Fi = 0 otherwise. Given an exact sequence

0 A B C 0

in 𝐀𝐛, we obtain a long exact sequence

0 A[p] B[p] C[p] δ1A𝑝𝐴 B𝑝𝐵 C𝑝𝐶 0

from the snake lemma applied to the diagram

Multiplication by p on a short exact sequence. A full diagram description follows.
Diagram description: Multiplication by p on a short exact sequence

The two displayed rows are exact, and the squares commute.

Objects, listed by row and column:

  • Row 1, from left to right: column 1: 0; column 2: A; column 3: B; column 4: C; column 5: 0.
  • Row 2, from left to right: column 1: 0; column 2: A; column 3: B; column 4: C; column 5: 0.

Arrows and lines:

  1. An arrow from 0 (row 1, column 1) to A (row 1, column 2), without a label.
  2. An arrow from A (row 1, column 2) to B (row 1, column 3), without a label.
  3. An arrow from A (row 1, column 2) to A (row 2, column 2), labelled dot p.
  4. An arrow from B (row 1, column 3) to C (row 1, column 4), without a label.
  5. An arrow from B (row 1, column 3) to B (row 2, column 3), labelled dot p.
  6. An arrow from C (row 1, column 4) to 0 (row 1, column 5), without a label.
  7. An arrow from C (row 1, column 4) to C (row 2, column 4), labelled dot p.
  8. An arrow from 0 (row 2, column 1) to A (row 2, column 2), without a label.
  9. An arrow from A (row 2, column 2) to B (row 2, column 3), without a label.
  10. An arrow from B (row 2, column 3) to C (row 2, column 4), without a label.
  11. An arrow from C (row 2, column 4) to 0 (row 2, column 5), without a label.

This defines a δ-functor.

Definition 3.1.3.

A (homological) universal δ-functor is a δ-functor F = (Fi,δi) with Fi: 𝒞 𝒟 such that if G = (Gi,δi) is any other δ-functor with Gi: 𝒞 𝒟 for which there exists a natural transformation η0: G0 F0, then η0 extends to a morphism of δ-functors, i.e., a sequence of natural transformations ηi: Gi Fi such that

A morphism of homological delta-functors. A full diagram description follows.
Diagram description: A morphism of homological delta-functors

The structural squares and triangles displayed here commute.

Objects, listed by row and column:

  • Row 1, from left to right: column 1: G subscript (i)(C); column 2: G subscript (i minus 1)(A).
  • Row 2, from left to right: column 1: F subscript (i)(C); column 2: F subscript (i minus 1)(A).

Arrows and lines:

  1. An arrow from G subscript (i)(C) to F subscript (i)(C), labelled ( eta subscript (i)) subscript (C).
  2. An arrow from G subscript (i)(C) to G subscript (i minus 1)(A), labelled delta prime subscript (i).
  3. An arrow from G subscript (i minus 1)(A) to F subscript (i minus 1)(A), labelled ( eta subscript (i minus 1)) subscript (A).
  4. An arrow from F subscript (i)(C) to F subscript (i minus 1)(A), labelled delta subscript (i).

commutes for any short exact sequence in 𝒞:

0 A B C 0.

(That is, we get a morphism of the associated long exact sequences.)

We have analogous notions in cohomology.

Definition 3.1.4.

A cohomological δ-functor is a sequence of additive functors Fi: 𝒞 𝒟 for i , together with, for every exact sequence

0 A fB gC 0

in 𝒞, morphisms δi: Fi(C) Fi+1(A) fitting in a long exact sequence

Fi(A) Fi(f)F i(B) Fi(g)Fi(C) δ iFi+1(A)

which are natural in the sense that if we have a morphism of short exact sequences in 𝒞,

A morphism of short exact sequences. A full diagram description follows.
Diagram description: A morphism of short exact sequences

The two displayed rows are exact, and the squares commute.

Objects, listed by row and column:

  • Row 1, from left to right: column 1: 0; column 2: A; column 3: B; column 4: C; column 5: 0.
  • Row 2, from left to right: column 1: 0; column 2: A prime; column 3: B prime; column 4: C prime; column 5: 0.

Arrows and lines:

  1. An arrow from 0 (row 1, column 1) to A, without a label.
  2. An arrow from A to B, without a label.
  3. An arrow from A to A prime, without a label.
  4. An arrow from B to C, without a label.
  5. An arrow from B to B prime, without a label.
  6. An arrow from C to 0 (row 1, column 5), without a label.
  7. An arrow from C to C prime, without a label.
  8. An arrow from 0 (row 2, column 1) to A prime, without a label.
  9. An arrow from A prime to B prime, without a label.
  10. An arrow from B prime to C prime, without a label.
  11. An arrow from C prime to 0 (row 2, column 5), without a label.

then we obtain a morphism of long exact sequences in 𝒟,

Naturality of a cohomological delta-functor. A full diagram description follows.
Diagram description: Naturality of a cohomological delta-functor

The two displayed rows are exact, and the squares commute.

Objects, listed by row and column:

  • Row 1, from left to right: column 1: ellipsis; column 2: F superscript (i)(A); column 3: F superscript (i)(B); column 4: F superscript (i)(C); column 5: F superscript (i plus 1)(A); column 6: ellipsis.
  • Row 2, from left to right: column 1: ellipsis; column 2: F superscript (i)(A prime ); column 3: F superscript (i)(B prime ); column 4: F superscript (i)(C prime ); column 5: F superscript (i plus 1)(A prime ); column 6: ellipsis.

Arrows and lines:

  1. An arrow from ellipsis (row 1, column 1) to F superscript (i)(A), without a label.
  2. An arrow from F superscript (i)(A) to F superscript (i)(B), without a label.
  3. An arrow from F superscript (i)(A) to F superscript (i)(A prime ), without a label.
  4. An arrow from F superscript (i)(B) to F superscript (i)(C), without a label.
  5. An arrow from F superscript (i)(B) to F superscript (i)(B prime ), without a label.
  6. An arrow from F superscript (i)(C) to F superscript (i plus 1)(A), without a label.
  7. An arrow from F superscript (i)(C) to F superscript (i)(C prime ), without a label.
  8. An arrow from F superscript (i plus 1)(A) to ellipsis (row 1, column 6), without a label.
  9. An arrow from F superscript (i plus 1)(A) to F superscript (i plus 1)(A prime ), without a label.
  10. An arrow from ellipsis (row 2, column 1) to F superscript (i)(A prime ), without a label.
  11. An arrow from F superscript (i)(A prime ) to F superscript (i)(B prime ), without a label.
  12. An arrow from F superscript (i)(B prime ) to F superscript (i)(C prime ), without a label.
  13. An arrow from F superscript (i)(C prime ) to F superscript (i plus 1)(A prime ), without a label.
  14. An arrow from F superscript (i plus 1)(A prime ) to ellipsis (row 2, column 6), without a label.

Remark 3.1.5.

A cohomological δ-functor (Fi,δi) is universal if there exists a unique extension of any natural transformation F0 G0, where (Gi,(δ)i) is another δ-functor, to a morphism of δ-functors.

Our situation will be as follows. Suppose that we have a right exact functor F : 𝒞 𝒟 of abelian categories (which have certain hypothesis on them). Our goal will be to construct a universal δ-functor F with Fi: 𝒞 𝒟 with F0 = F and Fi = 0 for i < 0. That is, given a short exact sequence

0 A B C 0

in 𝒞, we will have a long exact sequence

F2(C) F1(A) F1(B) F1(C) F (A) F (B) F (C) 0

in 𝒟. Suppose that G: 𝒞 𝒟 is another right exact functor which has a natural transformation η : G F to F. Let Gbe the associated universal δ-functor we assume exists. Then universality of F then produces for us a morphism of long exact sequences

Universality and long exact sequences. A full diagram description follows.
Diagram description: Universality and long exact sequences

The two displayed rows are exact, and the squares commute.

Objects, listed by row and column:

  • Row 1, from left to right: column 1: ellipsis; column 2: G subscript (1)(B); column 3: G subscript (1)(C); column 4: G(A); column 5: G(B); column 6: G(C); column 7: 0.
  • Row 2, from left to right: column 1: ellipsis; column 2: F subscript (1)(B); column 3: F subscript (1)(C); column 4: F(A); column 5: F(B); column 6: F(C); column 7: 0.

Arrows and lines:

  1. An arrow from ellipsis (row 1, column 1) to G subscript (1)(B), without a label.
  2. An arrow from G subscript (1)(B) to G subscript (1)(C), without a label.
  3. An arrow from G subscript (1)(B) to F subscript (1)(B), without a label.
  4. An arrow from G subscript (1)(C) to G(A), without a label.
  5. An arrow from G subscript (1)(C) to F subscript (1)(C), without a label.
  6. An arrow from G(A) to G(B), without a label.
  7. An arrow from G(A) to F(A), labelled eta subscript (A).
  8. An arrow from G(B) to G(C), without a label.
  9. An arrow from G(B) to F(B), labelled eta subscript (B).
  10. An arrow from G(C) to 0 (row 1, column 7), without a label.
  11. An arrow from G(C) to F(C), labelled eta subscript (C).
  12. An arrow from ellipsis (row 2, column 1) to F subscript (1)(B), without a label.
  13. An arrow from F subscript (1)(B) to F subscript (1)(C), without a label.
  14. An arrow from F subscript (1)(C) to F(A), without a label.
  15. An arrow from F(A) to F(B), without a label.
  16. An arrow from F(B) to F(C), without a label.
  17. An arrow from F(C) to 0 (row 2, column 7), without a label.

depending only on F, G, η, and the short exact sequence.

3.2. Projective objects

Definition 3.2.1.

An object P in an abelian category 𝒞 is said to be projective if, given any epimorphism g: A B in 𝒞 and morphism β : P B, there exists a morphism α : P A with β = gα.

We draw the corresponding diagram:

The lifting property of a projective object. A full diagram description follows.
Diagram description: The lifting property of a projective object

The structural squares and triangles displayed here commute. The lower row is exact, and the dashed arrow alpha is the requested lift.

Objects, listed by row and column:

  • Row 1, from left to right: column 2: P.
  • Row 2, from left to right: column 1: A; column 2: B; column 3: 0.

Arrows and lines:

  1. A dashed arrow from P to A, labelled alpha.
  2. An arrow from P to B, labelled beta.
  3. An arrow from A to B, labelled g.
  4. An arrow from B to 0, without a label.

Lemma 3.2.2.

An object P in an abelian category 𝒞 is projective if and only if every exact sequence

0 A fB pP 0

in 𝒞 splits.

Proof.

If P is projective, then this is the special case of Definition 3.2.1 in which β = idB and g = p. Conversely, suppose we have an epimorphism g and a morphism β as in Definition 3.2.1. We then consider the pullback diagram

A pullback used in projectivity. A full diagram description follows.
Diagram description: A pullback used in projectivity

The structural squares and triangles displayed here commute.

Objects, listed by row and column:

  • Row 1, from left to right: column 1: P times subscript (B) A; column 2: P.
  • Row 2, from left to right: column 1: A; column 2: B.

Arrows and lines:

  1. An arrow from P times subscript (B) A to P, labelled p subscript (1).
  2. An arrow from P times subscript (B) A to A, labelled p subscript (2).
  3. An arrow from P to B, labelled beta.
  4. An arrow from A to B, labelled g.

Now g is an epimorphism, and it follows that p1 is an epimorphism. By assumption, p1 has a splitting map u. We set α = p2 u. Then

gα = gp2 u = β p1 u = β.

We say that a left R-module F is free if it is isomorphic to an arbitrary direct sum of copies of R as a left R-modules. Any free R-module F has a basis B in bijection with its indexing set, and therefore a map F A for some left R-module A is prescribed uniquely by its (arbitrary) values on B. Any free module F is projective, since given β : F B and an epimorphism f : A B, we merely have to lift the values β(x) for x in a basis of F to A to define a map α : F A.

Example 3.2.3.

Not every projective module need be free. For example, consider R = 6. We claim that P = 3 is a projective R-module. To see this, suppose that B is a 6-module and g: B 3 is surjective. Take any b B with g(b) = 1. Then the 6 submodule generated by b is isomorphic to 3, and hence 1b defines a splitting of g.

Note that P is not projective as a -module (abelian group) since the quotient map 3 does not split. In fact, every projective -module is free.

We also have the following equivalent condition for a module to be projective, specific to the category R-mod.

Lemma 3.2.4.

An R-module P is projective if and only if it is the direct summand of a free R-module.

Proof.

Suppose P is projective. Find a generating set of P, and let F be the free left R-module on this set. Then we have an epimorphism F P defined on this basis. Since this is split, we obtain a direct sum decomposition.

On the other hand, suppose we can write some P as a direct summand of a free module F, i.e., 𝐹≅𝑃 M for some M. Using Lemma 3.2.2, suppose we have an exact sequence

0 A fB gP 0

Consider the commutative diagram

Splitting an exact sequence with projective quotient. A full diagram description follows.
Diagram description: Splitting an exact sequence with projective quotient

The lower row is exact. The lift q from F to B satisfies g composed with q equals p. Projection p from F to P and inclusion iota from P to F come from a direct-sum decomposition, and p composed with iota is the identity of P. Consequently q composed with iota splits g. The reverse composite iota composed with p is not asserted to be the identity of F.

Objects, listed by row and column:

  • Row 1, from left to right: column 4: F.
  • Row 2, from left to right: column 1: 0; column 2: A; column 3: B; column 4: P; column 5: 0.

Arrows and lines:

  1. An arrow from F to B, labelled q.
  2. An arrow from F to P, labelled p.
  3. An arrow from 0 (row 2, column 1) to A, without a label.
  4. An arrow from A to B, labelled f.
  5. An arrow from B to P, labelled g.
  6. An arrow from P to 0 (row 2, column 5), without a label.
  7. An arrow from P to F, labelled iota.

where the maps p, ι arise from the direct sum decomposition and q exists by the projectivity of F. We take β = qι.

In the case that R is a principal ideal domain, we have the following.

Corollary 3.2.5.

If R is a principal ideal domain, then every projective R-module is free.

Proof.

By the classification of finitely generated modules over a principal ideal domain, it suffices for finitely generated R-modules to show that any R-module of the form

A = R(a1)R(a2)R(an)

for nonzero and nonunit a1,a2,,an R is not projective. Consider the obvious quotient map Rn A. That it splits means that each R R(ai) splits. Then 𝑅≅(ai)(x) for some x R, which means that R is free of rank 2 over itself, which is impossible (e.g., by the classification theorem).

The general case is left as an exercise.

Lemma 3.2.6.

An object P in an abelian category 𝒞 is projective if and only if HomR(P,): 𝒞 𝐀𝐛 is an exact functor.

Proof.

Suppose that the functor is exact. Then for any epimorphism g: B P we have an epimorphism

HomR(P,B) HomR(P,P),

and any inverse image t of idP is the desired splitting map of g.

On the other hand, suppose that P is projective. Consider an exact sequence

0 A fB gC 0.

Then we have a diagram

HomR(P,A) hP(f)HomR(P,B) hP(g)HomR(P,C) 0.

That this is a complex is immediate. Surjectivity of hP(g) follows immediately from the definition of a projective module. Finally, let h kerhP(g), so h: P kerg. Then A kerg is an epimorphism, and we have by projectivity of P a map j: P A with with f j = h, i.e., hP(f)(j) = h.

Remark 3.2.7.

If R is a commutative ring, then HomR(A,B) for R-modules A and B may be viewed as an R-module under (rf)(a) = rf(a). It follows easily that HomR(A,) is an additive functor from the category of R-modules to itself which is exact if A is projective.

We now proceed to introduce projective resolutions in abelian categories.

Definition 3.2.8.

An abelian category 𝒞 is said to have sufficiently many (or enough) projectives if for every A Obj(𝒞), there exists a projective object P Obj(𝒞) and an epimorphism P A.

Clearly, R-mod has enough projectives.

Definition 3.2.9.

Let 𝒞 be an abelian category, and let A be an object in 𝒞.

a.

A resolution of A is a complex C of objects in 𝒞 together with an augmentation morphism 𝜖C: C0 A such that the augmented complex

C1 d1CC0 𝜖CA 0

is exact.

b.

A projective resolution of A is a resolution of A by projective objects.

Remark 3.2.10.

If 𝒞 has enough projectives, then every object in 𝒞 has a projective resolution. (We leave the proof as an exercise.)

Examples 3.2.11.

We have the following examples of projective resolutions, all of which are in fact resolutions by free modules:

a.

In 𝐀𝐛, the abelian group 𝑛ℤ has a projective resolution

0 n 𝑛ℤ 0.
b.

Consider R = [X], and let A = [X](n,X2 +1). Then we have a projective resolution

0 [X] ((X2 +1),n)[X][X] (n)((X2 +1))[X] [X](n,X2 +1) 0.
c.

Consider the ring R = [X](Xn1). (This is isomorphic to the group ring [𝑛ℤ].) We have a projective resolution of :

R NR X 1R NR X 1R 0,

where N = i=0n1Xi.

Proposition 3.2.12.

Let P A and Q B be projective resolutions in R-mod, and suppose that g: A B is an R-module homomorphism. Then g extends to a map f: P Q of chain complexes such that

Lifting a map to projective resolutions. A full diagram description follows.
Diagram description: Lifting a map to projective resolutions

The structural squares and triangles displayed here commute. Both horizontal sequences are the displayed augmented projective resolutions.

Objects, listed by row and column:

  • Row 1, from left to right: column 1: ellipsis; column 2: P subscript (2); column 3: P subscript (1); column 4: P subscript (0); column 5: A; column 6: 0.
  • Row 2, from left to right: column 1: ellipsis; column 2: Q subscript (2); column 3: Q subscript (1); column 4: Q subscript (0); column 5: B; column 6: 0.

Arrows and lines:

  1. An arrow from ellipsis (row 1, column 1) to P subscript (2), without a label.
  2. An arrow from P subscript (2) to P subscript (1), without a label.
  3. An arrow from P subscript (2) to Q subscript (2), labelled f subscript (2).
  4. An arrow from P subscript (1) to P subscript (0), without a label.
  5. An arrow from P subscript (1) to Q subscript (1), labelled f subscript (1).
  6. An arrow from P subscript (0) to A, without a label.
  7. An arrow from P subscript (0) to Q subscript (0), labelled f subscript (0).
  8. An arrow from A to B, labelled g.
  9. An arrow from A to 0 (row 1, column 6), without a label.
  10. An arrow from ellipsis (row 2, column 1) to Q subscript (2), without a label.
  11. An arrow from Q subscript (2) to Q subscript (1), without a label.
  12. An arrow from Q subscript (1) to Q subscript (0), without a label.
  13. An arrow from Q subscript (0) to B, without a label.
  14. An arrow from B to 0 (row 2, column 6), without a label.

commutes. Furthermore, any other lift of g is chain homotopic to f.

Proof.

Let P = (Pi,di) and Q = (Qi,di), and let 𝜖 and 𝜖 denote the respective augmentation maps. Then g𝜖 : P0 B. Since 𝜖 is an epimorphism, we have a map f0: P0 Q0 lifting g𝜖. Now f0 induces a map

f¯0: ker𝜖 ker𝜖,

and since imd1 = ker𝜖 and kerd1 = ker𝜖, we have an epimorphism Q1 kerd1, and we again use projectivity, this time of Q1, to lift f¯0 d1 to a map f1 as in the diagram. We continue in this manner to obtain f.

Now, for uniqueness up to chain homotopy, it suffices to show that if g = 0, then f is chain homotopic to zero. Well, d0f0 = gd0 = 0, so f0(P0) imd1. By projectivity of P0, we have s0: P0 Q1 with

f0 = d1s0 +s 1 d0 = d1s0,

where we have set si = 0 for i < 0 (and di = 0 for i 0). Now h1 = f1 s0 d1 satisfies

d1h1 = d1f1 d1s0 d1 = f0 d1 f0 d1 = 0,

so imh1 imd2. Thus, we have s1: P1 Q1 lifting h1, i.e., so that

d2s1 = h1 = f1 s0 d1,

as desired. We continue in this fashion to obtain all si.

Proposition 3.2.13 (Horseshoe lemma).

Suppose that

0 A fB gC 0

is a short exact sequence of R-modules and that (PA,𝜖A) and (PC,𝜖C) are projective resolutions of A and C respectively. Then there exists a projective resolution (PB,𝜖B) of B with PiB = PiAPiC for each i and such that the diagram

The horseshoe lemma. A full diagram description follows.
Diagram description: The horseshoe lemma

The structural squares and triangles displayed here commute. The rows are the short exact sequences in the horseshoe construction, with the indicated augmentations downward.

Objects, listed by row and column:

  • Row 1, from left to right: column 1: 0; column 2: P subscript (dot) superscript (A); column 3: P subscript (dot) superscript (B); column 4: P subscript (dot) superscript (C); column 5: 0.
  • Row 2, from left to right: column 1: 0; column 2: A; column 3: B; column 4: C; column 5: 0.
  • Row 3, from left to right: column 2: 0; column 3: 0; column 4: 0.

Arrows and lines:

  1. An arrow from 0 (row 1, column 1) to P subscript (dot) superscript (A), without a label.
  2. An arrow from P subscript (dot) superscript (A) to P subscript (dot) superscript (B), labelled iota subscript (dot).
  3. An arrow from P subscript (dot) superscript (A) to A, labelled epsilon superscript (A).
  4. An arrow from P subscript (dot) superscript (B) to P subscript (dot) superscript (C), labelled p subscript (dot).
  5. An arrow from P subscript (dot) superscript (B) to B, labelled epsilon superscript (B).
  6. An arrow from P subscript (dot) superscript (C) to 0 (row 1, column 5), without a label.
  7. An arrow from P subscript (dot) superscript (C) to C, labelled epsilon superscript (C).
  8. An arrow from 0 (row 2, column 1) to A, without a label.
  9. An arrow from A to B, labelled f.
  10. An arrow from A to 0 (row 3, column 2), without a label.
  11. An arrow from B to C, labelled g.
  12. An arrow from B to 0 (row 3, column 3), without a label.
  13. An arrow from C to 0 (row 2, column 5), without a label.
  14. An arrow from C to 0 (row 3, column 4), without a label.
(3.2.1)

commutes, where ι and pare the natural maps on each term.

Proof.

Choose a lift t0 of 𝜖C to P0C B, and let

𝜖B = f 𝜖A+t0 p0.

Then 𝜖B is clearly surjective, and we have the desired commutativity of the “first two” squares. Next, letting dX denote the boundary maps with X = A, C, we may define the boundary map d1B for B similarly. That is, consider a lift of d1C: P1C ker𝜖C to a map t1: P1B ker𝜖B, and define

d1B = ι0 d1A+t1 p1.

Then d1B maps onto kerd1B and makes the next two squares commute. We then continue in this fashion.

Lemma 3.2.14.

Let 𝒞 be an abelian category and P a split long exact sequence of projectives. Then P is a projective object in 𝐂𝐡(𝒞).

Proof.

Let P be a split exact sequence of projectives in 𝒞. In other words, we may write each P0 = Q0 and Pi = QiQi1 for i 1, where Qi is a projective object in 𝒞, and the morphism Pi Pi1 is simply the composition of the projection Pi Qi1 with the inclusion Qi1 Pi. Suppose that π: A P is a epimorphism of complexes. Since Qi is projective, there exists a splitting si: Qi Ai of the composition of πi with projection to Qi. Then

ti = sisi1: Pi = QiQi1 Ai

is a splitting of πi. Since t is a morphism of complexes, it is a splitting of π.

Remark 3.2.15.

Every split exact complex is the cone of a complex with zero differentials.

Remark 3.2.16.

Though we shall not prove it, every projective object in the category of chain complexes over an abelian category is a split exact sequence of projectives. Also, the projective objects in the category of bounded below chain complexes (or those in nonnegative degrees) are the bounded below exact sequences of projectives (which automatically split).

Definition 3.2.17.

We say that a functor F : 𝒞 𝒟 between categories preserves projectives if it takes projective objects in 𝒞 to projective objects in 𝒟.

Proposition 3.2.18.

Let 𝒞 and 𝒟 be an abelian category. Let F : 𝒞 𝒟 be an additive functor that is left adjoint to an exact functor G: 𝒟 𝒞. Then F preserves projectives.

Proof.

Let P be a projective object in 𝒞. Let f : A B be a epimorphism in 𝒟. We must show that hF (P)(f): F (A) F (B) is an epimorphism. Note that we have a commutative diagram

An adjunction preserving projectives. A full diagram description follows.
Diagram description: An adjunction preserving projectives

The structural squares and triangles displayed here commute.

Objects, listed by row and column:

  • Row 1, from left to right: column 1: Hom subscript (script C)(P,G(A)); column 2: Hom subscript (script C)(P,G(B)).
  • Row 2, from left to right: column 1: Hom subscript (script D)(F(P),A); column 2: Hom subscript (script D)(F(P),B).

Arrows and lines:

  1. An arrow from Hom subscript (script C)(P,G(A)) to Hom subscript (script C)(P,G(B)), labelled h subscript (P)(G(f)).
  2. An arrow from Hom subscript (script C)(P,G(A)) to Hom subscript (script D)(F(P),A), labelled isomorphism symbol.
  3. An arrow from Hom subscript (script C)(P,G(B)) to Hom subscript (script D)(F(P),B), labelled isomorphism symbol.
  4. An arrow from Hom subscript (script D)(F(P),A) to Hom subscript (script D)(F(P),B), labelled h subscript (F(P))(f).

Exactness of G tells us that G(f) is an epimorphism, and the upper horizontal map is then an epimorphism by the projectivity of P, hence the result.

3.3. Left derived functors

Suppose that F : 𝒞 𝒟 is a right exact functor between abelian categories 𝒞 and 𝒟 and that 𝒞 has enough projectives. Then we could try to define the ith left derived functor of F (for i 0) on an object A of 𝒞 by Hi(F (P)), where P A is a projective resolution of A. Of course, we must check that this definition is independent of the projective resolution chosen, and that we obtain induced maps on morphisms so that our map becomes a functor.

In the following, one may suppose that 𝒞 is the category of R-mod, but it is often the case that 𝒟 is some other category, like 𝐀𝐛 or S-mod for some ring S.

Lemma 3.3.1.

Suppose that P A and Q A are projective resolutions of A. Then there is a canonical isomorphism between Hi(F (P)) and Hi(F (Q)) for each i 0.

Proof.

By Proposition 3.2.12, the identity morphism on A extends to a map P Q of chain complexes. Note also that we have a map Q P, and again by Proposition 3.2.12, both compositions are chain-homotopic to the identity. By Lemma 2.7.15, we therefore have that the induced maps Hi(F (P)) Hi(F (Q)) are inverse to each other.

We set LiF (A) = Hi(F (P)) for any projective resolution P A and i 0. This is well-defined up to canonical isomorphism.

We have the following obvious corollaries of Lemma 3.3.1.

Corollary 3.3.2.

We have canonical isomorphisms L0F (A)≅𝐹 (A) for all R-modules A.

Proof.

Since F is right exact, the sequence

F (P1) F (P0) F (A) 0

is exact. Hence, we have

L0F (A) = H0(F (P))≅𝐹 (A).

Corollary 3.3.3.

If P is a projective object, then LiF (P) = 0 for i 1.

Proof.

Consider the projective resolution that is P in degree zero and 0 elsewhere, where the augmentation map P P is the identity. This has the desired homology.

Next, we prove that the LiF are functors.

Proposition 3.3.4.

To each morphism f : A B in 𝒞, we can associate canonical morphisms

LiF (f): LiF (A) LiF (B)

for all i 0 in such a way that LiF : 𝒞 𝒟 becomes a functor and L0F (f) = F (f). Furthermore, each LiF is additive.

Proof.

The unique morphism LiF (f) is induced on homology by the morphism of chain complexes given in Proposition 3.2.12. Functoriality follows by canonicality of the map of homology.

To see additivity, note that LiF (0A) is induced by the zero morphism of chain complexes and hence is is zero map on LiF (A). Similarly LiF (f +g), for f,g: A B, can be given by the sum of the induced maps on chain complexes, hence is given by the sum of the maps on homology.

We refer to LiF as the ith left derived functor of F. We see that L0F and F are canonically naturally isomorphic functors.

Theorem 3.3.5.

For every short exact sequence

0 A B C 0

in 𝒞, there exist morphisms δi: LiF (C) Li1F (A) such that the functors LF together with the maps δ form a homological δ-functor.

Proof.

By the Horseshoe lemma, we have a projective resolution PX X for X = A, B, C fitting in a diagram (3.2.1). Now, applying F to the resolutions, we have split exact sequences

0 F (PiA) F (P iB) F (P iC) 0

for each i. The resulting exact sequence of complexes (which need not be split) yields a long exact sequence in homology

L1F (B) L1F (C) δ1F (A) F (B) F (C) 0,

as desired.

It remains to check naturality. Consider a morphism of short exact sequences

A morphism of short exact sequences for derived functors. A full diagram description follows.
Diagram description: A morphism of short exact sequences for derived functors

The two displayed rows are exact, and the squares commute.

Objects, listed by row and column:

  • Row 1, from left to right: column 1: 0; column 2: A; column 3: B; column 4: C; column 5: 0.
  • Row 2, from left to right: column 1: 0; column 2: A prime; column 3: B prime; column 4: C prime; column 5: 0.

Arrows and lines:

  1. An arrow from 0 (row 1, column 1) to A, without a label.
  2. An arrow from A to B, labelled f.
  3. An arrow from A to A prime, labelled q superscript (A).
  4. An arrow from B to C, labelled g.
  5. An arrow from B to B prime, labelled q superscript (B).
  6. An arrow from C to 0 (row 1, column 5), without a label.
  7. An arrow from C to C prime, labelled q superscript (C).
  8. An arrow from 0 (row 2, column 1) to A prime, without a label.
  9. An arrow from A prime to B prime, labelled f prime.
  10. An arrow from B prime to C prime, labelled g prime.
  11. An arrow from C prime to 0 (row 2, column 5), without a label.

By Proposition 3.2.12, can extend qA and qC to maps of complexes qA: PA PA and qC: PC PC . Suppose we have constructed PB and PB via the Horseshoe lemma. We fit this all into a commutative diagram

Maps between horseshoe resolutions. A full diagram description follows.
Diagram description: Maps between horseshoe resolutions

The structural squares and triangles displayed here commute.

Objects, listed by row and column:

  • Row 1, from left to right: column 1: 0; column 3: P subscript (dot) superscript (A); column 5: P subscript (dot) superscript (B); column 7: P subscript (dot) superscript (C); column 9: 0.
  • Row 2, from left to right: column 2: 0; column 4: A; column 6: B; column 8: C; column 10: 0.
  • Row 3, from left to right: column 1: 0; column 3: P subscript (dot) superscript (A prime); column 5: P subscript (dot) superscript (B prime); column 7: P subscript (dot) superscript (C prime); column 9: 0.
  • Row 4, from left to right: column 2: 0; column 4: A prime; column 6: B prime; column 8: C prime; column 10: 0.

Arrows and lines:

  1. An arrow from 0 (row 1, column 1) to P subscript (dot) superscript (A), without a label.
  2. An arrow from P subscript (dot) superscript (A) to P subscript (dot) superscript (B), labelled iota subscript (dot).
  3. An arrow from P subscript (dot) superscript (A) to A, labelled epsilon superscript (A).
  4. An arrow from P subscript (dot) superscript (A) to P subscript (dot) superscript (A prime), labelled q subscript (dot) superscript (A).
  5. An arrow from P subscript (dot) superscript (B) to P subscript (dot) superscript (C), labelled p subscript (dot).
  6. An arrow from P subscript (dot) superscript (B) to B, without a label.
  7. An arrow from P subscript (dot) superscript (C) to C, without a label.
  8. An arrow from P subscript (dot) superscript (C) to P subscript (dot) superscript (C prime), labelled q subscript (dot) superscript (C).
  9. An arrow from P subscript (dot) superscript (C) to 0 (row 1, column 9), without a label.
  10. An arrow from 0 (row 2, column 2) to A, without a label.
  11. An arrow from A to B, labelled f.
  12. An arrow from A to A prime, without a label.
  13. An arrow from B to C, labelled g.
  14. An arrow from B to B prime, without a label.
  15. An arrow from C to C prime, labelled q superscript (C).
  16. An arrow from C to 0 (row 2, column 10), without a label.
  17. An arrow from 0 (row 3, column 1) to P subscript (dot) superscript (A prime), without a label.
  18. An arrow from P subscript (dot) superscript (A prime) to P subscript (dot) superscript (B prime), labelled iota prime subscript (dot).
  19. An arrow from P subscript (dot) superscript (A prime) to A prime, without a label.
  20. An arrow from P subscript (dot) superscript (B prime) to B prime, without a label.
  21. An arrow from P subscript (dot) superscript (B prime) to P subscript (dot) superscript (C prime), labelled p prime subscript (dot).
  22. An arrow from P subscript (dot) superscript (C prime) to C prime, without a label.
  23. An arrow from P subscript (dot) superscript (C prime) to 0 (row 3, column 9), without a label.
  24. An arrow from 0 (row 4, column 2) to A prime, without a label.
  25. An arrow from A prime to B prime, labelled f prime.
  26. An arrow from B prime to C prime, labelled g prime.
  27. An arrow from C prime to 0 (row 4, column 10), without a label.
(3.3.1)

We also have splitting maps ji: PiC PiB and ki: PiB PiA for each i (and, similarly, maps jiand ki). For each X, let us denote the augmentation map by 𝜖X.

We must define a map qB: PB PB making the entire diagram (3.3.1) commute. We first note that

g(qB𝜖B𝜖Bj0q0Cp0) = qCg𝜖B𝜖Cp0j0 q0Cp0 = qC𝜖Cp0 𝜖Cq0Cp0 = (qC𝜖C𝜖Cq0C)p0 = 0.

Hence, there exists a map β0: P0B A with

fβ0 = qB𝜖B𝜖Bj0q0Cp0.

Since 𝜖A is an epimorphism, we may choose α0: P0B P0A with 𝜖A α0 = β0. Now set

q0B = ι0q0Ak0 +ι0α0 p0 +j0q0Cp0.

The trickiest check of commutativity is that 𝜖B q0B = qB𝜖B. We write this mess out:

𝜖Bq0B = 𝜖Bι0q0Ak0 +𝜖Bι0α0 p0 +𝜖Bj0q0Cp0 = f𝜖Aq0Ak0 +f𝜖Aα0 p0 +𝜖Bj0q0Cp0 = fqA𝜖Ak0 +fβ0 p0 +𝜖Bj0q0Cp0 = fqA𝜖Ak0 +(j0qC𝜖C𝜖Bj0q0C)p0 +𝜖Bj0q0Cp0 = fqA𝜖Ak0 +j0qC𝜖Cp0 = qB𝜖B.

The other qiB are defined similarly. For instance, one can see there exists a map β1: P1C P0A such that

ι0 β1 = ι0 β0 d0C+j1q0Cd0Cd0Bj1q1Cp1,

and we set

q1B = ι1q1Ak1 +ι1α1 p1 +j1q1C.

Next, we see that the δ-functor of left derived functors of F is universal.

Theorem 3.3.6.

The δ-functor (LiF,δi) is universal.

Definition 3.3.7.

Let F : 𝒞 𝒟 be a left exact functor between abelian categories. We say that an object Q in 𝒞 is F-acyclic if LiF (Q) = 0 for all i 1.

Note that the LiF (A) for any A Obj(𝒞) may be computed using resolutions by F-acyclic objects, as opposed to just projectives.

Proposition 3.3.8.

Let F : 𝒞 𝒟 be a left exact functor between abelian categories, and let A be an object of 𝒞. Suppose that C A is a resolution of A by F-acyclic objects. Then LiF (A)Hi(F (C)) for each i 0.

Proof.

Note that we have an exact sequence

F (C1) F (d1C)F (C0) F (𝜖C)F (A) 0,

so F (A)H0(F (C)). Set K0 = ker𝜖C. We then have an exact sequence

0 L1F (A) F (K0) F (C0) F (A) 0,

which yields

L1F (A)ker(coker(F (C2) F (C1)) F (C0))kerF (d1C) imF (d2C) H1(F (C)).

We also have isomorphisms LiF (A)Li1F (K0) for each i 2.

For i 1, set Ki = kerdiCimdi+1C. The exact sequences

0 Ki Ci Ki1 0, (3.3.2)

then yield isomorphisms used in the following for i 2:

LiF (A)Li1F (K0)L1F (Ki2)ker(F (Ki1) F (Ci1)) kerF (diC) imF (di+1C)Hi(F (C)).

More generally, we have the following characterization of universal δ-functors.

Theorem 3.3.9.

Let 𝒞 and 𝒟 be abelian categories such that 𝒞 has enough projectives. Suppose that (Fi,δi) form a δ-functor Fi: 𝒞 𝒟 and Fi(P) = 0 for every projective P Obj(𝒞) and i 1. Then (Fi,δi) is universal.

Proof.

Suppose that (Gi,δi) is another δ-functor and that we have a natural transformation G0 F0. Let A Obj(𝒞) and let π : P A be an epimorphism with P projective. Let K = kerπ. Let i 1, and suppose that we have constructed a natural transformation Gi1 Fi1. Since Fi(P) = 0 is projective, we have a commutative diagram

Extending a natural transformation by dimension shifting. A full diagram description follows.
Diagram description: Extending a natural transformation by dimension shifting

The structural squares and triangles displayed here commute. The dashed map is the unique map making the square commute.

Objects, listed by row and column:

  • Row 1, from left to right: column 2: G subscript (i)(A); column 3: G subscript (i minus 1)(K); column 4: G subscript (i minus 1)(P).
  • Row 2, from left to right: column 1: 0; column 2: F subscript (i)(A); column 3: F subscript (i minus 1)(K); column 4: F subscript (i minus 1)(P).

Arrows and lines:

  1. An arrow from G subscript (i)(A) to G subscript (i minus 1)(K), without a label.
  2. A dashed arrow from G subscript (i)(A) to F subscript (i)(A), without a label.
  3. An arrow from G subscript (i minus 1)(K) to G subscript (i minus 1)(P), without a label.
  4. An arrow from G subscript (i minus 1)(K) to F subscript (i minus 1)(K), without a label.
  5. An arrow from G subscript (i minus 1)(P) to F subscript (i minus 1)(P), without a label.
  6. An arrow from 0 to F subscript (i)(A), without a label.
  7. An arrow from F subscript (i)(A) to F subscript (i minus 1)(K), without a label.
  8. An arrow from F subscript (i minus 1)(K) to F subscript (i minus 1)(P), without a label.

The morphism Gi(A) Fi(A) is the unique map which makes the diagram commute.

Now let f : A B be a morphism in 𝒞. We create a diagram as follows:

Lifting a map between short exact sequences. A full diagram description follows.
Diagram description: Lifting a map between short exact sequences

The structural squares and triangles displayed here commute.

Objects, listed by row and column:

  • Row 1, from left to right: column 1: 0; column 2: K; column 3: P; column 4: A; column 5: 0.
  • Row 2, from left to right: column 1: 0; column 2: K prime; column 3: P prime; column 4: B; column 5: 0.

Arrows and lines:

  1. An arrow from 0 (row 1, column 1) to K, without a label.
  2. An arrow from K to P, without a label.
  3. An arrow from K to K prime, without a label.
  4. An arrow from P to A, without a label.
  5. An arrow from P to P prime, without a label.
  6. An arrow from A to 0 (row 1, column 5), without a label.
  7. An arrow from A to B, labelled f.
  8. An arrow from 0 (row 2, column 1) to K prime, without a label.
  9. An arrow from K prime to P prime, without a label.
  10. An arrow from P prime to B, without a label.
  11. An arrow from B to 0 (row 2, column 5), without a label.

by taking P to be projective, P to be any projective with an epimorphism to the pullback of the diagram P B A, and K and K to be the relevant kernels. We then have a diagram

Naturality of the dimension-shifting construction. A full diagram description follows.
Diagram description: Naturality of the dimension-shifting construction

The structural squares and triangles displayed here commute.

Objects, listed by row and column:

  • Row 1, from left to right: column 1: G subscript (i)(A); column 3: G subscript (i minus 1)(K).
  • Row 2, from left to right: column 2: F subscript (i)(A); column 4: F subscript (i minus 1)(K).
  • Row 3, from left to right: column 1: G subscript (i)(B); column 3: G subscript (i minus 1)(K prime ).
  • Row 4, from left to right: column 2: F subscript (i)(B); column 4: F subscript (i minus 1)(K prime ).

Arrows and lines:

  1. An arrow from G subscript (i)(A) to G subscript (i minus 1)(K), without a label.
  2. An arrow from G subscript (i)(A) to F subscript (i)(A), without a label.
  3. An arrow from G subscript (i)(A) to G subscript (i)(B), without a label.
  4. An arrow from G subscript (i minus 1)(K) to F subscript (i minus 1)(K), without a label.
  5. An arrow from G subscript (i minus 1)(K) to G subscript (i minus 1)(K prime ), without a label.
  6. An arrow from F subscript (i)(A) to F subscript (i minus 1)(K), without a label.
  7. An arrow from F subscript (i)(A) to F subscript (i)(B), without a label.
  8. An arrow from F subscript (i minus 1)(K) to F subscript (i minus 1)(K prime ), without a label.
  9. An arrow from G subscript (i)(B) to G subscript (i minus 1)(K prime ), without a label.
  10. An arrow from G subscript (i)(B) to F subscript (i)(B), without a label.
  11. An arrow from G subscript (i minus 1)(K prime ) to F subscript (i minus 1)(K prime ), without a label.
  12. An arrow from F subscript (i)(B) to F subscript (i minus 1)(K prime ), without a label.

We need only see that the leftmost square commutes, but this follows easily from a diagram chase and the fact that the two horizontal maps on the frontmost square are monomorphisms.

Hence, we have constructed a sequence of natural transformations Gi Fi. It remains only to see that these form a morphism of δ-functors. This being an inductive argument of the above sort, we leave it to the reader.

As a corollary, we have a natural isomorphism of δ-functors between the left derived functors LiF0 of a right exact functor F0 and any δ-functor (Fi,δi) with Fi(P) = 0 for P projective and i 1.

3.4. Injectives and right derived functors

We next wish to study right derived functors of left exact functors. For this, we need the analogues of projective objects, which are called injective objects.

Definition 3.4.1.

An object I in an abelian category 𝒞 is called injective if, for every monomorphism f : A B and morphism α : A I, there exists a morphism β : B I with α = β f.

In this case, the appropriate diagram is

The extension property of an injective object. A full diagram description follows.
Diagram description: The extension property of an injective object

The structural squares and triangles displayed here commute. The upper row is exact, and the dashed arrow beta is the requested extension.

Objects, listed by row and column:

  • Row 1, from left to right: column 1: 0; column 2: A; column 3: B.
  • Row 2, from left to right: column 2: I.

Arrows and lines:

  1. An arrow from 0 to A, without a label.
  2. An arrow from A to B, labelled f.
  3. An arrow from A to I, labelled alpha.
  4. A dashed arrow from B to I, labelled beta.

One sees easily that I is injective if and only if it is projective as an object of 𝒞op. By Lemma 3.2.6 (which holds in an arbitrary abelian category), it follows that I is injective if and only if hI is exact. Similarly, by Lemma 3.2.2, we have that I is injective if and only if every exact sequence

0 I B C 0

in 𝒞 splits.

We also have the analogue of Proposition 3.2.18.

Proposition 3.4.2.

Let 𝒞 and 𝒟 be an abelian category. Let G: 𝒟 𝒞 be an additive functor that is right adjoint to an exact functor F : 𝒞 𝒟. Then G preserves injectives.

We now look at the category R-mod. One can prove the following using Zorn’s Lemma. (Zorn’s Lemma, which is equivalent to the Axiom of Choice, states that if (I,) is a partially ordered set such that every chain i1 i2 i3 in I has an upper bound in I, then I has a maximal element, i.e., an element j I such that j≰i for all i I.) We omit the proof.

Lemma 3.4.3 (Baer’s criterion).

A left R-module I is injective if and only if every homomorphism J I with J a left ideal of R may be extended to a map R I.

Example 3.4.4.

a.

is an injective -module.

b.

𝑛ℤ is an injective 𝑛ℤ-module for any n 1.

c.

3 is an injective 6-module, but not an injective 9-module.

We have a very nice description of injective objects in 𝐀𝐛.

Definition 3.4.5.

An abelian group D is called divisible if multiplication by n is surjective on D for every natural number n.

Proposition 3.4.6.

An abelian group is injective if and only if it is divisible.

Proof.

Let D be injective, and take d D. Then there exists a group homomorphism ϕ : D with 1d. We also have the multiplication-by-n map on , which is injective. By injectivity of D, we have a map 𝜃 : D with ϕ = 𝑛𝜃. Then d = 𝑛𝜃(1), so D is divisible.

Conversely, let D be divisible. By Lemma 3.4.3, it suffices to show that every homomorphism ϕ : 𝑛ℤ D with n 1 extends to a homomorphism 𝜃 : D. Such a ϕ is determined by d = ϕ(n). Let d D be such that nd = d. Set 𝜃(1) = d.

Definition 3.4.7.

We say that an abelian category 𝒞 has enough (or sufficiently many) injectives if for every A Obj(𝒞), there exists an injective object I Obj(𝒞) and a monomorphism A I.

Lemma 3.4.8.

The category R-mod has enough injectives.

Proof.

First take the case that R = . Let A be an abelian group, and write it as a quotient of a free abelian group

A = ( jJ)T

for some indexing set J and submodule T of jJ. Then we may embed A in

I = ( jJ)T,

which is divisible as a quotient of a divisible group.

Next, let A be a left R-module. We have an injection of left R-modules,

ϕ : A Hom(R,A),

by ϕ(a)(r) = 𝑟𝑎. Now, embed A in a divisible group D, so that the resulting map

Hom(R,A) Hom(R,D)

is an injection. The proof that Hom(R,D) is an injective R-module is left to the reader.

Definition 3.4.9.

An injective resolution of an object A of an abelian category 𝒞 is a cochain complex I of injective objects with Ii = 0 for i < 0 and a morphism A I0 such that the resulting diagram

0 A I0 I1 I2

is exact.

Again, any object in an abelian category with enough injectives has an injective resolution. We also have the analogues of Propositions 3.2.12 and 3.2.13 for injective resolutions.

Suppose now that F : 𝒞 𝒟 is a left exact functor between abelian categories and that 𝒞 has enough injectives. For each i 0, we define additive functors RiF : 𝒞 𝒟 by

RiF (A) = Hi(F (I)),

where A Iis any injective resolution of A Obj(𝒞) and, for f : A B in 𝒞, by

RiF (f): RiF (A) RiF (B)

to be the map on homology induced by any morphism of chain complexes I J extending f, where A I and B J are injective resolutions. We have R0F = F. The functors RF are called the right-derived functors of F.

Theorem 3.4.10.

The functors RF form a cohomological universal δ-functor.

The proof is dual to that of Theorems 3.3.5 and 3.3.6.

We also have the following.

Theorem 3.4.11.

Let 𝒞 be an abelian category that admits kernels and cokernels and has enough injectives. Then the cohomology functors Hi: 𝐂𝐡0(𝒞) 𝒞 for i 0 on complexes in nonnegative degrees together with the connecting homomorphisms δi attached to a short exact sequence of complexes form a universal δ-functor.

Restricting to chain complexes concentrated in two terms, we have the following.

Corollary 3.4.12.

Let 𝒞 be an abelian category that admits kernels and cokernels and has enough injectives. Then the functors F0 = ker and F1 = coker: Mor(𝒞) 𝒞 (along with Fi = 0 for i 2) and the morphisms δ0 = δ given by the snake lemma (and δi = 0 for i 1) are canonically naturally isomorphic to the right derived functors of ker.

3.5. Tor and Ext

Definition 3.5.1.

Let Ω and Λ be rings.

a.

An Ω-Λ-bimodule is a module for the ring ΩΛ, where Λ is the opposite ring to Λ.

b.

The category Ω-Λ-mod of Ω-Λ-bimodules is the category of ΩΛ-modules.

Definition 3.5.2.

Let Ω and Λ be rings, and let A be an Ω-Λ-bimodule. For i 0, the Tor-functors

ToriΛ(A,): Λ-𝐦𝐨𝐝 Ω-𝐦𝐨𝐝

are the left derived functors of tA.

Remark 3.5.3.

If R is a commutative ring, then an R-module A provides functors

ToriR(A,): R-𝐦𝐨𝐝 R-𝐦𝐨𝐝

since R-modules are automatically R-R-bimodules.

Remark 3.5.4.

As ToriΛ(A,B) = Hi(AΛQ) for any projective resolution Q of B by Λ-modules, the composition of the functor

ToriΛ(A,): Λ-𝐦𝐨𝐝 Ω-𝐦𝐨𝐝

with the forgetful functor F : Ω-𝐦𝐨𝐝 𝐀𝐛 agrees with the functor

ToriΛ(F (A),): Λ-𝐦𝐨𝐝 𝐀𝐛,

hence the omission of the notation for Ω in the definition of ToriΛ(A,).

Example 3.5.5.

In 𝐀𝐛, consider the projective resolution

0 n 𝑛ℤ 0

of B. Computing the homology of 0 A nA 0, we obtain

Tori(A,𝑛ℤ) { A𝑛𝐴 if i = 0 A[n] = {a A𝑛𝑎 = 0}if i = 1 0 if i 2.

Definition 3.5.6.

We say that a right Λ-module A is flat as a right Λ-module if tA: Λ-𝐦𝐨𝐝 𝐀𝐛 is an exact functor.

Lemma 3.5.7.

Let Λ be a ring. The following conditions on a right Λ-module A are equivalent:

i.

A is flat,

ii.

Tor1Λ(A,) = 0,

iii.

ToriΛ(A,) = 0 for all i 1.

Proof.

Clearly, (iii) implies (ii). If

0 B1 B2 B3 0

is an exact sequence of right Λ-modules, then we have a long exact sequence for any Λ-module that ends with

Tor1Λ(A,B3) A ΛB1 AΛB2 AΛB3 0,

from which it is clear that (ii) implies (i).

Finally, if (i) holds and Q is a projective resolution of B in Λ-mod, then the complex

AΛQ1 AΛQ0 AΛB 0

is exact by the flatness of A. It follows that

ToriΛ(A,B) = H i(AΛQ) = 0

for all i 1.

Lemma 3.5.8.

Any projective right Λ-module is flat.

Proof.

Let P be a projective right Λ-module. Then P is a direct summand of a free right Λ-module F, let us say isomorphic as a right Λ-module to iIΛ for an indexing set I. If

0 B1 B2 B3 0

is exact, then

0 F ΛB1 F ΛB2 F ΛB3 0

is exact, being isomorphic to the direct sum of one copy of the original sequence for each element of I. Moreover, the sequence

0 P ΛB1 P ΛB2 P ΛB3 0

is a direct summand of the latter sequence, hence is exact.

Proposition 3.5.9.

Let A be a right Λ-module and B a left Λ-module. Let P A be a resolution of A by projective right Λ-modules. Then

ToriΛ(A,B)H i(PΛB)

for all i 0. In particular, the functors ToriΛ(,B) are the left derived functors of Λ-tensor product with B.

We sketch a proof.

Proof.

Form projective resolutions P A and Q B. We then have a double complex PΛQ, and we can consider homology of the total complex

Tot(PΛQ)k = i+j=kPiΛQj,

where the boundary maps from each term PiΛQj are given by the sums diA+(1)idjB. We claim that the homology of this complex is isomorphic to the homology of the complexes PΛB and AΛQ, from which the lemma follows.

We have maps of complexes

Tot(PΛQ) PΛB (3.5.1)

and

Tot(PΛQ) AΛQ (3.5.2)

induced by augmentation morphisms (up to sign, and zero maps otherwise). The double complex PΛQ PΛB (i.e., with PiΛB in the (i,1)-position) has exact columns, since each projective module is acyclic. One can show that this implies that the total complex of this complex is exact. This says precisely that the map in (3.5.1) induces an isomorphism on homology. Similarly, so does the map in (3.5.2).

We have the following almost immediate corollary, since left and right tensor product with a module over a commutative ring are naturally isomorphic functors.

Corollary 3.5.10.

Let R be commutative. We have ToriR(A,B)ToriR(B,A) for all R-modules A, B and i 0.

We now give an alternate proof of Proposition 3.5.9.

Proof.

Let Q B be a projective resolution of A by right Λ-modules. Suppose that

0 A1 A2 A3 0

is an exact sequence. Then

0 A1 ΛQ A2 ΛQ A3 ΛQ 0

is exact. This yields a long exact sequence in homology of the form

ToriΛ(A1,B) Tor iΛ(A2,B) Tor iΛ(A3,B) Tor i1Λ(A1,B) ,

so the functors ToriΛ(B) do in fact form a δ-functor. Futhermore, since any projective right Λ-module P is flat, we have that ToriΛ(P,B) = 0 for all i 1. By Theorem 3.3.9, it follows that the ToriΛ(,B) are a universal δ-functor extending tB. The proposition therefore follows by Theorem 3.3.6.

Remark 3.5.11.

It follows from Proposition 3.5.9 and Proposition 3.3.8 that the ToriΛ(A,B) can be computed via a flat resolution of either A or B.

The following explains something more of the name “Tor”.

Lemma 3.5.12.

The functor Tor1(A,) = 0 if and only if A is torsion-free.

Proof.

We prove this for finitely generated abelian groups. (The general result then follows from the fact that left derived functors commute with colimits.) By Proposition 3.5.10, we may compute Tor1(A,B) by finding a projective resolution of A. Say

𝐴≅mn1n r

with r 0 and the ni 2. Then we have a projective resolution of the form

0 m+r (1,,1,n1,,n r)m+r A 0.

Tensoring with B and computing H1, we obtain B[n1]B[nr]. This will always be trivial if and only if r = 0.

By Lemma 3.5.12, a -module is flat if and only if it is torsion-free. This is seen to hold in the same manner with replaced by any PID. Note that this does not hold for all commutative rings.

Example 3.5.13.

Consider R = [x,y]. Then the exact sequence

0 R (y,x)R2 (a,b)𝑎𝑥+𝑏𝑦R 0

is a free resolution of . Let J be the ideal (x,y) of R, so ℚ≅𝑅J. Then we have isomorphisms

Tor1R(J,)Tor2R(,)ker( 02) = .

Thus J is not flat as an R-module, even though it is torsion-free.

Here is another class of examples.

Lemma 3.5.14.

Let S be a subset of R that is multiplicatively closed. Then the localization S1R is a flat R-module.

Proof.

We claim that S1𝐴≅S1RRA for any R-module A. The map inducing this isomorphism is s1as1 a. This is well-defined as if s1a = t1b for some t S and b B, then 𝑡𝑎 = 𝑠𝑏, and then

t1 b = (𝑠𝑡)1 𝑠𝑏 = (𝑠𝑡)1 𝑡𝑎 = s1 a.

On the other hand, the inverse map is induced by the R-bilinear map

S1R×A S1A

by (s1r,a)s1𝑟𝑎.

Suppose that f : A B is an injection of R-modules. Then we obtain an induced R-module homomorphism f~: S1A S1B, which we must show is an injection. Suppose f~(s1a) = 0. Then

0 = sf~(s1a) = f~(a) = f(a),

so a = 0.

Here are some interesting results on flat modules:

Proposition 3.5.15.

The following are equivalent for a module A over a commutative ring R.

i.

A is flat,

ii.

for every ideal J of R, the sequence

0 ARJ A A𝐽𝐴 0

is exact,

iii.

the R-module A = Hom𝐀𝐛(A,) is injective, where R acts on A by (𝑟𝑓)(a) = f(𝑟𝑎) for all f A, r R, and a A.

Proposition 3.5.16.

Let R be a local ring. Then any finitely generated flat module over R is free.

Definition 3.5.17.

Let Ω and Λ be rings, and let A be an Λ-Ω-bimodule. The Ext-functors

ExtΛi(A,): Λ-𝐦𝐨𝐝 Ω-𝐦𝐨𝐝

are the right derived functors of hA.

Example 3.5.18.

For R = , we may consider the injective resolution

0 𝑛ℤ n 0

of 𝑛ℤ. For any abelian group B, we write B = Hom(B,). We must compute the cohomology of AnA. This yields

Exti(A,𝑛ℤ) { A[n] if i = 0 AnAif i = 1 0 if i = 2.

One has that ExtR1(P,B) = 0 for all B if P is a projective module, as follows from the exactness of HomR(P,). We have the analogous result to Proposition 3.5.10 for Ext-groups, which says that such groups may be computed using projective resolutions.

Proposition 3.5.19.

We have ExtRi(A,B)Hi(HomR(P,B)), where P A is any projective resolution of A.

We end with a characterization of ExtR1 in terms of extensions.

Definition 3.5.20.

An extension of an R-module A by an R-module B is an exact sequence 0 B E A 0, where E is an R-module. Two extensions of A by B are called equivalent if there is an isomorphism of exact sequences between them that is the identity on A and B.

Note that all split extensions (i.e., those with split exact sequences) are split.

Example 3.5.21.

There are p equivalence classes of extensions of 𝑝ℤ by 𝑝ℤ as -modules:

0 𝑝ℤ 𝑝𝑖p2 mod p𝑝ℤ 0

with 1 i p1, and

0 𝑝ℤ 𝑝ℤ𝑝ℤ 𝑝ℤ 0.

Theorem 3.5.22.

There is a one-to-one correspondence between equivalence classes of extensions of A by B and ExtR1(A,B).

Proof.

Suppose that E is an equivalence class of extensions of A by B, representative by an exact sequence

0 B E A 0. (3.5.3)

We then have an exact sequence

HomR(E,B) HomR(B,B) EExtR1(A,B),

and we set Φ(E) = E(idB). This is clearly independent of the choice of representative.

Conversely, suppose u ExtR1(A,B). Fix an exact sequence

0 K ιP A 0

with P projective. We then have an exact sequence

HomR(P,B) HomR(K,B) ExtR1(A,B) 0.

Let t HomR(K,B) with (t) = u. Let E be the pushout

E = P KB = P B{(ι(k),t(k))k K}.

We have a commutative diagram

Constructing an extension by a pushout. A full diagram description follows.
Diagram description: Constructing an extension by a pushout

The two displayed rows are exact, and the squares commute.

Objects, listed by row and column:

  • Row 1, from left to right: column 1: 0; column 2: K; column 3: P; column 4: A; column 5: 0.
  • Row 2, from left to right: column 1: 0; column 2: B; column 3: E; column 4: A; column 5: 0.

Arrows and lines:

  1. An arrow from 0 (row 1, column 1) to K, without a label.
  2. An arrow from K to P, without a label.
  3. An arrow from K to B, labelled t.
  4. An arrow from P to A (row 1, column 4), without a label.
  5. An arrow from P to E, without a label.
  6. An arrow from A (row 1, column 4) to 0 (row 1, column 5), without a label.
  7. Equality joins A (row 1, column 4) and A (row 2, column 4), without a label.
  8. An arrow from 0 (row 2, column 1) to B, without a label.
  9. An arrow from B to E, without a label.
  10. An arrow from E to A (row 2, column 4), without a label.
  11. An arrow from A (row 2, column 4) to 0 (row 2, column 5), without a label.
(3.5.4)

Here, the map E A is defined by universality of the pushout (via the map P A and the zero map B A). We define Ψ(u) to be the equivalence class E of the extension given by the lower row. Though it is not immediately clear that this is independent of the choice of t with (t) = u, this follows if we can show that Ψ and Φ as constructed are mutually inverse.

To see that Φ(Ψ(u)) = u, set E = Ψ(u), again choosing any t with (t) = u. The diagram

Naturality of the extension connecting homomorphism. A full diagram description follows.
Diagram description: Naturality of the extension connecting homomorphism

The structural squares and triangles displayed here commute.

Objects, listed by row and column:

  • Row 1, from left to right: column 1: Hom subscript (R)(B,B); column 2: Ext subscript (R) superscript (1)(A,B).
  • Row 2, from left to right: column 1: Hom subscript (R)(K,B); column 2: Ext subscript (R) superscript (1)(A,B).

Arrows and lines:

  1. An arrow from Hom subscript (R)(B,B) to Ext subscript (R) superscript (1)(A,B) (row 1, column 2), labelled partial subscript (script E).
  2. An arrow from Hom subscript (R)(B,B) to Hom subscript (R)(K,B), labelled h superscript (B)(t).
  3. Equality joins Ext subscript (R) superscript (1)(A,B) (row 1, column 2) and Ext subscript (R) superscript (1)(A,B) (row 2, column 2), without a label.
  4. An arrow from Hom subscript (R)(K,B) to Ext subscript (R) superscript (1)(A,B) (row 2, column 2), labelled partial.
(3.5.5)

commutes. Hence, we have

Φ(Ψ(u)) = Φ(E) = E(idB) = (t) = u,

as desired.

On the other hand, suppose given E with exact sequence (3.5.3). By projectivity of P, the map P A lifts to a map P E. Hence, we have a diagram as in (3.5.4). Furthermore, the map t in the diagram (3.5.4) satisfies (t) = E(idB) by the commutativity of (3.5.5). Now, there exists a map P KB E by universality of the pushout, and it is the identity on A and B, hence an isomorphism by the 5-lemma. It follows by construction that

Ψ(Φ(E)) = Ψ(E(idB)) = E.

3.6. Group homology and cohomology

Let Λ be a ring and G a group.

Definition 3.6.1.

The Λ-group ring Λ[G] of G consists of the set of finite formal sums of group elements with coefficients in R

{gGaggag Λ for all g G, almost all ag = 0}.

with addition given by addition of coefficients and multiplication induced by the group law on G and Λ-linearity. (Here, “almost all” means all but finitely many.)

In other words, the operations are

gGagg+gGbgg =gG(ag+bg)g

and

(gGagg)(gGbgg) =gG(kGakbk1g)g.

We shall work here only with the case that Λ = .

Definition 3.6.2.

If G is a finite group, then we have the norm element

NG =gGg [G]G.

Definition 3.6.3.

Let A be a left [G]-module. We define the G-invariants AG of A to be the set of elements of A fixed under G:

AG = {a A𝑔𝑎 = a for all g G}.

Example 3.6.4.

If G is a finite group, then [G]G = (NG). Otherwise, [G]G = 0.

If f : A B is an [G]-module homomorphism, it clearly induces a group homomorphism on subsets AG BG. Hence, AAG defines a functor [G]-𝐦𝐨𝐝 𝐀𝐛. We leave it to the reader to check that this functor is in fact left exact.

Definition 3.6.5.

The ith G-cohomology group Hi(G,A) with coefficients in A is the ith left derived functor of the functor of G-invariants applied to A.

In particular, H0(G,A) = AG. Group cohomology may be computed by taking the standard resolution of a module A. That is, we have a projective resolution by [G]-modules of viewed as a trivial G-module:

[G×G×G] d2[G×G] d1[G] 𝜖 0,

where

di(g1,,gi+1) =j=0i+1(1)j(g1,,g j1,gj+1,,gi+1)

and the augmentation map 𝜖 is defined by 𝜖(g) = 1. Apply Hom(,A) to the sequence. Then we obtain an injective resoulution of A, and taking invariants of the injective resolution yields our result. (Note: this is the same as applying Hom[G](,A) to the standard resolution.)

We omit the proof of the following:

Example 3.6.6.

Suppose that G acts trivially on A (i.e., AG = A). Then H1(G,A) = Hom(G,A).

We also have a notion of group homology Hi(G,A), arising as the left derived functors of the coinvariant functor A AG. Here

AG = A𝑔𝑎ag G.

This may also be computed using the standard resolution, this time by tensoring it with A over [G]. Here is another example.

Example 3.6.7.

We have H1(G,)Gab, where Gab is the abelianization, or maximal abelian quotient, of G. To see this, note that we have an exact sequence

0 IG [G] 0,

where [G] is the augmentation homomorphism and IG = (g1g G) is the augmentation ideal of G. Since [G] is projective, the long exact sequence in homology becomes

0 H1(G,) (IG)G [G]G 0.

We have [G]G≅ℤ via the augmentation map, so

H1(G,)(IG)GIGIG2Gab,

where the latter isomorphism takes the image of g1 to the image of g. (Check this!)

Remark 3.6.8.

It follows by Proposition 3.5.19 that

Hi(G,A)Ext [G]i(,A)

and by Proposition 3.5.19 that

Hi(G,A)Tor[G]i(,A).

3.7. Derived functors of limits

In this section, we will focus on the abelian category Λ-mod of left modules over a ring Λ. This category is both complete and cocomplete: a functor F : I Λ-mod from a small category I has limit

limF = {(xi) iIF (i)F (κ)(ai) = aj for all κ : i j in I}

and colimit

colimF = ( iIF (i))M,

where

M =κ : ij{F (κ)(a)aa F (i)}.

Thus, we have a limit (resp., colimit) functor

lim: 𝐅𝐮𝐧𝐜(I,Λ-mod) Λ-mod(resp., lim: 𝐅𝐮𝐧𝐜(Iop,Λ-mod) Λ-mod),

for any small filtered category I, and it is clearly additive.

Lemma 3.7.1.

Let I be a small filtered category, and let F : I Λ-mod be a functor.

a.

For each x limF, there exist i I and xi F (i) such that x is the image of xi under the natural map F (i) limF.

b.

Let xk F (k) for some k I, and suppose that xk has zero image in limF. Then there exists κ : k j in I such that F (κ)(xk) = 0.

Proof.

Let x limF. By construction of colimF, there exist n 1, distinct it I, and xit F (it) for 1 t n such that x is the image of

t=1nx it iIF (i)

in the quotient colimF. But there exists j I such that there are morphisms κt: it j for each 1 t n. But then x is the image of the sum of the F (κt)(xit) in F (j), proving part a.

Next, let xk F (k) with zero image in limF. Then, there exist m 1, κs: is js and as F (is) for each 1 s m such that

xk =s=1m(F (κ s)(as)as)

in iIF (i). Find l and λs: js l for each s. Then

xk = s=1m(F (λ sκs)(as)F (κs)(as))+s=1m(F (λ sκs)(as)as),

which is to say that we may assume all of the elements js are equal to l and then by combining terms that all of the is are distinct. If = k, then by the equality in the direct sum, we must have that each as = 0, so xk = 0. If k, then we have that xk = au for some u and all other as are zero. It then follows that F (κu)(au) = F (κu)(xk) = 0 as well, proving part b.

Proposition 3.7.2.

For any small filtered category I, the colimit functor

lim: 𝐅𝐮𝐧𝐜(I,Λ-mod) Λ-mod

is exact.

Proof.

By Proposition 1.5.6, the functor lim has a left adjoint, so is right exact by Proposition 2.5.7.

Let F and G be functors I Λ-mod. Suppose that η : F G is a monomorphism. We claim that each ηi with i I is injective. Choose i I and y F (i). We take E : I Λ-mod on j I to be

E(j) =κ : ijΛF (κ)(y)

(so E(j) = 0 if jIi) and E(λ): E(j) E(k) to be the restriction of F (λ) for λ : j k in I. We define ξ : E F by taking ξi to be the inclusion of E(i) in F (i). If ηi(y) = 0, then η ξ = 0, but then it follows that ξ = 0 as η is a monomorphism, and hence y = 0. Thus, each ηi is injective.

Let x limF with (limη)(x) = 0. By Lemma 3.7.1a, we can find i I such that x is t he image of some xi F (i). By definition, ηi(xi) has 0 image in limG, and so by Lemma 3.7.1b, we can find κ : i j in I such that

ηj(F (κ)(xi)) = G(κ)(ηi(xi)) = 0.

The injectivity of ηi then tells us that F (κ)(xi) = 0, so we have that x = 0.

As in the proof of Proposition 3.7.2, we have that limits of functors to Λ-mod are left exact. However, they are not always right exact, as we shall see. We may, of course, consider the derived functors

Rnlim: 𝐅𝐮𝐧𝐜(I,Λ-mod) Λ-mod

for a cofiltered category I. Let us focus the special case that I is the category given by the natural numbers ordered by . That is, we consider sequential limits in Λ-mod. To give a functor F : I Λ-mod is equivalent to giving a sequence of Λ-modules Ai = F (i) and morphisms πi+1: Ai+1 Ai for i 1.

Definition 3.7.3.

Let I be the category of natural numbers ordered by .

a.

We define a functor Φ: 𝐅𝐮𝐧𝐜(I,Λ-mod) Mor(Λ) by taking Φ(F ) for F : I Λ-mod to be

Φ(F ): i=1F (i) i=1F (i),Φ(F )((a i)i1) = (aiπi+1(ai+1))i0

for ai F (i) for i 1 and Φ(η), for η : F G, to be the pair (ηi,ηi).

b.

For n 0, let limn: 𝐅𝐮𝐧𝐜(I,Λ-mod) Λ-mod be the functor

limn = { kerΦ if n = 0 coker Φ if n = 1 0 if n 2.

Remark 3.7.4.

Since Φ is exact, Corollary 3.4.12 tells us that the functors limn are the right derived functors of

lim0 = kerΦ = lim.

Notation 3.7.5.

If (Ai,πi) is a collection of Λ-modules Ai and morphisms πi+1: Ai+1 Ai for i 1, then we write ΔA = Φ(F ) for the functor F resulting from the collection, and we write lim1Ai for lim1F. For j k 1, we set πj,k = πkπk1 πj+1.

Lemma 3.7.6.

Let (Ai,πi) be a collection of nonzero Λ-modules Ai and surjective morphisms πi+1: Ai+1 Ai for i 1. Then limAi0 and lim1Ai = 0.

Proof.

Note that if a1 A1 is nonzero, then we can inductively find ai+1 Ai+1 with πi+1(ai+1) = ai, so limAi0.

Let bi Ai for each i 1, and let a1 A1. Inductively choose ai+1 Ai+1 such that πi+1(ai+1) = aibi. We then have that

ΔA((ai)i) = (aiπi+1(ai+1))i = (bi)i,

It follows that lim1Ai = cokerΔA = 0.

Example 3.7.7.

Let Ai = pi for each i 1 and πi: pi pi1 be the natural injection. Consider the commutative diagram of exact sequences

An inverse system of short exact sequences. A full diagram description follows.
Diagram description: An inverse system of short exact sequences

The two displayed rows are exact, and the squares commute.

Objects, listed by row and column:

  • Row 1, from left to right: column 1: 0; column 2: p superscript (i plus 1) blackboard Z; column 3: blackboard Z; column 4: blackboard Z / p superscript (i plus 1) blackboard Z; column 5: 0.
  • Row 2, from left to right: column 1: 0; column 2: p superscript (i) blackboard Z; column 3: blackboard Z; column 4: blackboard Z / p superscript (i) blackboard Z; column 5: 0.

Arrows and lines:

  1. An arrow from 0 (row 1, column 1) to p superscript (i plus 1) blackboard Z, without a label.
  2. An arrow from p superscript (i plus 1) blackboard Z to blackboard Z (row 1, column 3), without a label.
  3. A hooked arrow from p superscript (i plus 1) blackboard Z to p superscript (i) blackboard Z, without a label.
  4. An arrow from blackboard Z (row 1, column 3) to blackboard Z / p superscript (i plus 1) blackboard Z, without a label.
  5. Equality joins blackboard Z (row 1, column 3) and blackboard Z (row 2, column 3), without a label.
  6. An arrow from blackboard Z / p superscript (i plus 1) blackboard Z to 0 (row 1, column 5), without a label.
  7. A double-headed arrow from blackboard Z / p superscript (i plus 1) blackboard Z to blackboard Z / p superscript (i) blackboard Z, without a label.
  8. An arrow from 0 (row 2, column 1) to p superscript (i) blackboard Z, without a label.
  9. An arrow from p superscript (i) blackboard Z to blackboard Z (row 2, column 3), without a label.
  10. An arrow from blackboard Z (row 2, column 3) to blackboard Z / p superscript (i) blackboard Z, without a label.
  11. An arrow from blackboard Z / p superscript (i) blackboard Z to 0 (row 2, column 5), without a label.

which gives rise to a long exact sequence

0 p lim1(pi) 0,

so lim1(pi)0.

Definition 3.7.8.

Let (Ai,πi) be a collection of Λ-modules Ai and morphisms πi+1: Ai+1 Ai for i 1. We say that (Ai,πi) satisfies the Mittag-Leffler criterion (ML) if for each k 1, there exists some j k such that imπj,k = imπi,k for all i j.

Remark 3.7.9.

In other words, (Ai,πi) satisfies the Mittag-Leffler criterion if for each k 0, the images of the morphisms πj,k in Ak stabilize for sufficiently large j. (Note that imπj+1,k imπj,k for any j k.)

Examples 3.7.10.

a.

Any sequence of finite Λ-modules satisfies ML.

b.

Any sequence of subspaces of a finite dimensional vector space over a field satisfies ML.

Theorem 3.7.11.

If (Ai,πi) satisfies ML, then lim1Ai = 0.

Proof.

First suppose that for each i there exists k i with πk,i = 0. Given bi Ai for each i 1, we set

ai =j=1π j,i(bj),

which is a finite sum by assumption and hence gives a well-defined element of Ai. Moreover, the sequence (ai)i satisfies ΔA((ai)i) = bi, so cokerΔA = 0.

In the general case, set

Bi = jiπj,i(Aj) Ai

for each i 1. The restriction of πi to Bi is surjective for each i 2, and so the resulting system satisfies lim1Bi = 0. On the other hand, since the image of πj,i is contained in Bi for sufficiently large j, the system of quotients AiBi has lim1AiBi = 0 by the case already proven. Since we have a an exact sequence 0 Bi Ai AiBi 0 for each i, together with compatible maps, the fact that lim1Ai is forced by the resulting long exact sequence.

Find in the notes