Romyar SharifiLECTURE NOTES
READING EDITIONPDF

LECTURE NOTES / Chapter 12

Abstract Algebra

Romyar Sharifi

Chapter 12 Homological algebra

Book contents

Chapter 12
Homological algebra

We work in this chapter largely in an abelian category. At times, proofs of statements that hold true in arbitrary abelian categories will be given only in categories of modules over a ring. This choice, which simplifies the exposition, will be given a more rigorous justification in the course of the chapter.

12.1. Exact sequences

Though we’ve managed to suppress them to this point, exact sequences are ubiquitous in algebra. Let’s give the definitions.

Definition 12.1.1.

Let I be the set of integers in an interval in . A diagram A in a category 𝒞 of the form

Ai+1 di+1AA i diAA i1

is a sequence, where the Ai are defined for i I and the morphisms diA: Ai Ai1 are defined for i I with i1 I. We will refer to I as the defining interval of the sequence A.

Notation 12.1.2.

In an abelian category, if A is a subobject of an object B, we write A B to denote this and BA for the cokernel of the inclusion morphism A B. For f : B C, we will let f(A) denote the image of the composite of the inclusion with f.

We are particularly interested in exact sequences.

Definition 12.1.3.

We say that a diagram

A fB gC

in an abelian category 𝒞 is exact if gf = 0 and the induced monomorphism imf kerg is an isomorphism.

Definition 12.1.4.

A sequence A = (Ai,diA) with defining interval I in an abelian category 𝒞 is exact, or an exact sequence, if the subdiagram

Ai+1 diAi di1Ai1

is exact for each i (I +1)(I 1).

That is, Ais exact if didi+1 = 0 and the canonical morphism imdi+1 kerdi is an isomorphism for all i for which di+1 and di are defined: we write this more simply as the identification imdi+1 = kerdi for subobjects of Ai.

Remark 12.1.5.

One can make the same definitions of exact sequences in the category of groups, or more generally in any “semi-abelian” category, and much of the discussion that follows remains the same.

Remark 12.1.6.

If the interval I of definition of A has a left (resp., right) endpoint N such that AN = 0, then one can extend A to the left (resp., right) by taking Ai = 0 for all i < N (resp., i > N). In fact, we could do this for any sequence for which I has an endpoint (without the condition AN = 0), but we do not as the operation does not preserve exactness (nor do the to-be-defined morphisms between two sequences defined on different intervals extend to morphisms under this operation).

Definition 12.1.7.

Let 𝒞 be an abelian category.

a.

A short exact sequence in 𝒞 is an exact sequence in 𝒞 of the form

0 A B C 0.
b.

A left short exact sequence in 𝒞 is an exact sequence in 𝒞 of the form

0 A B C.
c.

A right short exact sequence in 𝒞 is an exact sequence in 𝒞 of the form

A B C 0.

Remark 12.1.8.

To say that

0 A fB gC 0

is exact is to say that f is a monomorphism, imf = kerg, and g is an epimorphism.

Example 12.1.9.

Multiplication-by-n provides a short exact sequence of abelian groups

0 n 𝑛ℤ 0.

Remark 12.1.10.

If f : A B is any morphism in an abelian category, then we have an exact sequence

0 kerf A fB cokerf 0.

Note that this provides two short exact sequences

0 kerf A imf 0 and 0 imf B cokerf 0,

since coimf imf is an isomorphism. We can “splice these back together” to get the 4-term sequence by taking the composite A imf B, which is f.

Definition 12.1.11.

A long exact sequence in an abelian category 𝒞 is an exact sequence A = (Ai,diA)i.

Frequently, a long exact sequence is expressed in the form

A2 A1 A0 0,

and we can extend it to all integers by setting Ai = 0 for all i 1.

Example 12.1.12.

The sequence

2 f2 f2 f2

with f : 2 2 defined by f(a,b) = (0,a) for a,b is a long exact sequence of -vector spaces. The sequence

0 ι22 f2 f2

of -vector spaces with ι2(b) = (0,b) is also a long exact sequence.

We next study maps between sequences. Let us make a formal definition.

Definition 12.1.13.

Let A = (Ai,diA) and B = (Bi,diB) be sequences in a category 𝒞 with defining intervals I and J, respectively. A morphism of sequences f: A B in a category is a collection (fi)iIJ of morphisms fi: Ai Bi in 𝒞 such that diBfi = fi1 diA for all i I J (I +1)(J +1).

Remark 12.1.14.

We can view the condition for a sequence of maps fi: Ai Bi between the terms of sequences A and B defined at all i to be a map of sequences as saying that the diagram

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

The structural squares and triangles displayed here commute.

Objects, listed by row and column:

  • Row 1, from left to right: column 1: ellipsis; column 2: A subscript (i plus 1); column 3: A subscript (i); column 4: A subscript (i minus 1); column 5: ellipsis.
  • Row 2, from left to right: column 1: ellipsis; column 2: A subscript (i plus 1); column 3: A subscript (i); column 4: A subscript (i minus 1); column 5: ellipsis.

Arrows and lines:

  1. An arrow from ellipsis (row 1, column 1) to A subscript (i plus 1) (row 1, column 2), without a label.
  2. An arrow from A subscript (i plus 1) (row 1, column 2) to A subscript (i) (row 1, column 3), labelled d subscript (i plus 1) superscript (A).
  3. An arrow from A subscript (i plus 1) (row 1, column 2) to A subscript (i plus 1) (row 2, column 2), labelled f subscript (i plus 1).
  4. An arrow from A subscript (i) (row 1, column 3) to A subscript (i minus 1) (row 1, column 4), labelled d subscript (i) superscript (A).
  5. An arrow from A subscript (i) (row 1, column 3) to A subscript (i) (row 2, column 3), labelled f subscript (i).
  6. An arrow from A subscript (i minus 1) (row 1, column 4) to ellipsis (row 1, column 5), without a label.
  7. An arrow from A subscript (i minus 1) (row 1, column 4) to A subscript (i minus 1) (row 2, column 4), labelled f subscript (i minus 1).
  8. An arrow from ellipsis (row 2, column 1) to A subscript (i plus 1) (row 2, column 2), without a label.
  9. An arrow from A subscript (i plus 1) (row 2, column 2) to A subscript (i) (row 2, column 3), labelled d subscript (i plus 1) superscript (B).
  10. An arrow from A subscript (i) (row 2, column 3) to A subscript (i minus 1) (row 2, column 4), labelled d subscript (i) superscript (B).
  11. An arrow from A subscript (i minus 1) (row 2, column 4) to ellipsis (row 2, column 5), without a label.

commutes.

12.2. The snake and five lemmas

The following result on maps between short exact sequences is the key to much of homological algebra.

Theorem 12.2.1 (Snake lemma).

Let 𝒞 be an abelian category, and let

The snake lemma's input diagram. A full diagram description follows.
Diagram description: The snake lemma's input diagram

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 alpha.
  4. An arrow from B to C, labelled g.
  5. An arrow from B to B prime, labelled beta.
  6. An arrow from C to 0 (row 1, column 5), without a label.
  7. An arrow from C to C prime, labelled gamma.
  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.

be a commutative diagram in 𝒞 with exact rows. Then there is an exact sequence

0 kerf kerα kerβ kerγ δcokerα cokerβ cokerγ cokerg 0

such that the resulting diagram

The snake lemma's connecting map. A full diagram description follows.
Diagram description: The snake lemma's connecting map

The middle two rows are the original exact sequences. The blue path from zero through kernel f, kernel alpha, kernel beta, kernel gamma, cokernel alpha, cokernel beta, cokernel gamma, cokernel g prime, and zero is exact. Its long curved arrow is the connecting map delta from kernel gamma to cokernel alpha. The structural squares commute.

Objects, listed by row and column:

  • Row 1, from left to right: column 3: kernel alpha; column 4: kernel beta; column 5: kernel gamma.
  • Row 3, from left to right: column 1: 0; column 2: kernel f; column 3: A; column 4: B; column 5: C; column 6: 0.
  • Row 5, from left to right: column 2: 0; column 3: A prime; column 4: B prime; column 5: C prime; column 6: cokernel g prime; column 7: 0.
  • Row 7, from left to right: column 3: cokernel alpha; column 4: cokernel beta; column 5: cokernel gamma.

Arrows and lines:

  1. A blue arrow from kernel alpha to kernel beta, without a label.
  2. An arrow from kernel alpha to A, without a label.
  3. A blue arrow from kernel beta to kernel gamma, without a label.
  4. An arrow from kernel beta to B, without a label.
  5. An arrow from kernel gamma to C, without a label.
  6. A curved blue arrow from kernel gamma to cokernel alpha, labelled delta.
  7. An arrow from 0 (row 3, column 1) to kernel f, without a label.
  8. A curved blue arrow from kernel f to kernel alpha, without a label.
  9. An arrow from kernel f to A, without a label.
  10. An arrow from A to B, labelled f.
  11. An arrow from A to A prime, labelled alpha.
  12. An arrow from B to C, labelled g.
  13. An arrow from B to B prime, labelled beta.
  14. An arrow from C to 0 (row 3, column 6), without a label.
  15. An arrow from C to C prime, labelled gamma.
  16. An arrow from 0 (row 5, column 2) to A prime, without a label.
  17. An arrow from A prime to B prime, labelled f prime.
  18. An arrow from A prime to cokernel alpha, without a label.
  19. An arrow from B prime to C prime, labelled g prime.
  20. An arrow from B prime to cokernel beta, without a label.
  21. An arrow from C prime to cokernel gamma, without a label.
  22. An arrow from C prime to cokernel g prime, without a label.
  23. An arrow from cokernel g prime to 0 (row 5, column 7), without a label.
  24. A blue arrow from cokernel alpha to cokernel beta, without a label.
  25. A blue arrow from cokernel beta to cokernel gamma, without a label.
  26. A curved blue arrow from cokernel gamma to cokernel g prime, without a label.

with the natural inclusion and quotient maps is commutative.

Proof.

We work in the category of modules over a ring R. We define δ as follows. For c kerγ, find b B with g(b) = c. Then gβ(b) = γ(c) = 0, so β(b) = f(a) for some a A. Let δ(c) denote the image a¯ of a in cokerα. To see that this is well-defined, note that if b2 B also satisfies g(b2) = c, then g(bb2) = 0, so b2 b = f(a) for some a A. We then have

β(b2) = β(b)+β f(a) = β(b)+fα(a),

so b2 = f(a+α(a)). But a+α(a) has image a¯ in cokerα, so δ is well-defined. That δ is an R-module homomorphism follows easily from the construction.

We now check that the other maps are well-defined. Since

β f(kerα) = fα(kerα) = 0,

we have f(kerα) kerβ. Similarly, g(kerβ) kerγ. Also, if a¯ cokerα, then we may lift it to a A, map to b B, and then project to b¯ cokerβ. This is well-defined as any other choice of a differs by some a A, which causes b¯ to change by the image of β(f(a)), which is zero. Thus f induces a well-defined homomorphism

f¯: cokerα cokerβ.

Similarly, we have a well-defined surjection

g¯: cokerβ cokerγ.

We next check that our sequence is a complex. Note that gf = 0, so the same is true on kerα, and gf = 0, so g¯f¯ = 0 as well. Let b kerβ. Then δ(g(b)) is given by considering β(b) = 0, lifting it to some a A, which we may take to be 0, and projecting to cokerα. Hence δ(g(kerβ)) = 0. On the other hand, if c kerγ, then f¯(δ(c)) is given by definition by projecting β(b) to cokerβ, where g(b) = c, hence is zero. Hence, the image of one map is contained in the kernel of the next at each term of the six term sequence.

Finally, we check exactness at each term. If a kerα, then f(a) = 0 implies a kerf. Inclusion then provides a map kerf kerα that is by definition injective. If b kerβ kerg, then there exists a A with f(a) = b. Since fα(a) = β f(a) = 0 and f is injective, we have α(a) = 0, or a kerα. Hence

f(kerα) = ker(kerβ kerγ),

and we have exactness at kerβ.

If c kerδ, then whenever g(b) = c and f(a) = β(b), we have a¯ = 0, letting a¯ denote the image of a cokerα. We then have a = f(a) for some a A, so b2 = bf(a) still satisfies f(b2) = c, but β(b2) = 0. So b2 kerβ, and we have exactness at kerγ.

If a¯ cokerα is the image of a A and f¯(a¯) = 0, then there exists b B with β(b) = f(a). Now

γ(g(b)) = g(β(b)) = g(f(a)) = 0,

so g(b) kerγ, and δ(g(b)) = a¯. Hence, we have exactness at cokerα.

If b¯ cokerβ is the image of b B and g¯(b¯) = 0, then there exists c C with g(b) = γ(c). Now c = g(b) for some b B. And b2 = bb has image b¯ in cokerβ. On the other hand, f(b2) = 0, so b2 = f(a) for some a A. If a¯ cokerα is the image of a, then f¯(a¯) = b¯ as the image of b2 in cokerβ. Thus, we have exactness at cokerβ. Finally, if c¯ cokerγ is the image of c C with trivial image in cokerg, then c = g(b) for some b B, then the image b¯ cokerβ of b satisfies g¯(b¯) = c¯.

Next, we state another useful result on maps between exact sequences, known as the five lemma.

Theorem 12.2.2 (Five lemma).

Let

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

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

Objects, listed by row and column:

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

Arrows and lines:

  1. An arrow from A to B, labelled e.
  2. An arrow from A to A prime, labelled alpha.
  3. An arrow from B to C, labelled f.
  4. An arrow from B to B prime, labelled beta.
  5. An arrow from C to D, labelled g.
  6. An arrow from C to C prime, labelled gamma.
  7. An arrow from D to E, labelled h.
  8. An arrow from D to D prime, labelled delta.
  9. An arrow from E to E prime, labelled epsilon.
  10. An arrow from A prime to B prime, labelled e prime.
  11. An arrow from B prime to C prime, labelled f prime.
  12. An arrow from C prime to D prime, labelled g prime.
  13. An arrow from D prime to E prime, labelled h prime.

be a commutative diagram with exact rows in an abelian category 𝒞.

a.

If β and δ are epimorphisms and 𝜖 is a monomorphism, then γ is an epimorphism.

b.

If β and δ are monomorphisms and α is an epimorphism, then γ is a monomorphism.

c.

If β and δ are isomorphisms, α is an epimorphism, and 𝜖 is a monomorphism, then γ is an isomorphism.

Proof.

We work in the category of modules over a ring R. It is immediate that parts a and b imply part c (the actual five lemma). We prove part a and note that it, if proven in an arbitrary abelian category, implies b in the opposite category, which is also abelian. Suppose that β and δ are surjective and 𝜖 is injective. Let c C, and note that g(c) = δ(d) for some d D by surjectivity of δ. Also,

𝜖(h(d)) = h(δ(d)) = h(g(c)) = 0,

so h(d) = 0 by injectivity of 𝜖. By exactness of the top row at D, we then have c C such that g(c) = d. Now,

g(γ(c)c) = δ(g(c))g(c) = δ(d)δ(d) = 0,

so by exactness of the bottom row at C, there exists b B such that f(b) = cγ(c). As β is surjective, there also exists b B such that β(b) = b. Set x = c+f(b) C. Then

γ(x)γ(c) = γ(f(b)) = f(β(b)) = f(b) = cγ(c)

so γ(c) = c. Thus, γ is surjective and part a is proven.

12.3. Homology and cohomology

Definition 12.3.1.

Let 𝒞 be an abelian category.

a.

A chain complex, or more simply complex, in 𝒞 is a sequence A = (Ai,diA)i in 𝒞 such that diAdi+1A = 0 for all i .

b.

For a chain complex A and i , the morphism diA: Ai Ai1 is called the ith differential in the complex A.

Notation 12.3.2.

Unless otherwise specified, the ith object in a chain complex A will be denoted Ai and the ith differential by di: Ai Ai1. If we have multiple complexes, we will use diA to specify the differential on A.

Remark 12.3.3.

Unlike with sequences in general (or exact sequences in particular), if the terms and morphisms of complex are specified only for some interval of integers, then we complete it to a complex by declaring all remaining objects and morphisms to be zero.

Definition 12.3.4.

A morphism of complexes in an abelian category is a morphism of sequences between complexes.

Definition 12.3.5.

The category of chain complexes 𝐂𝐡(𝒞) for an abelian category 𝒞 is the category with objects the complexes (Ai,diA)i in 𝒞 and morphisms the morphisms of complexes in 𝒞.

Remark 12.3.6.

A sequence of complexes is exact in 𝐂𝐡(𝒞) if and only if it the resulting sequence of objects in each fixed degree is exact in 𝒞. For instance, a sequence of complexes

0 AfBgC 0

in 𝐂𝐡(𝒞) is short exact if and only if each

0 Ai fiBi giCi 0

is a short exact sequence.

Note that the category of chain complexes in 𝒞 is a fully faithful subcategory of the category of sequences with defining interval .

Definition 12.3.7.

A complex is often said to be acyclic if it is an exact sequence.

The reader can easily check the following.

Proposition 12.3.8.

Let 𝒞 be an abelian category. Then the category 𝐂𝐡(𝒞) is an abelian category as well.

Definition 12.3.9.

The ith homology of a complex A in an abelian category is the object

Hi(A) = kerdiA imdi+1A.

Remark 12.3.10.

A complex A is exact if and only if Hi(A) = 0 for all i .

Example 12.3.11.

The complex

8 48 48

of abelian groups has ith homology group 24ℤ≅ℤ2 for every i.

Lemma 12.3.12.

Any morphism f: A B of complexes in 𝒞 induces natural morphisms

fi: H i(A) Hi(B)

for each i . More specifically, these satisfy

ι¯iBf iπ¯ iA = π iBf iιiA,

where πiB: Bi cokerdi+1B and π¯iA: kerdiA Hi(A) are the canonical epimorphisms, and where ιiA: kerdiA Ai and ι¯iB: Hi(B) cokerdi+1B are the canonical monomorphisms.

Proof.

We prove this in the case that 𝒞 is a category of R-modules. If a kerdiA, then diB(fi(a)) = fi1(diA(a)) = 0, so fi(a) kerdiB. If a = di+1A(a), then fi(a) = di+1B(fi+1(a)) imdi+1B. Thus, the composite map

kerdiA f ikerdiB H i(B)

factors through Hi(A), inducing the stated map fi.

Theorem 12.3.13.

Let 𝒞 be an abelian category, and let

0 AfBgC 0

be a short exact sequence in 𝐂𝐡(𝒞). There there are morphisms δi: Hi(C) Hi1(A) for all i , natural in the short exact sequence, that fit into a long exact sequence

Hi(A) fiH i(B) giH i(C) δiHi1(A) .
Proof.

First, the snake lemma applied to the diagram

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

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 subscript (i); column 3: B subscript (i); column 4: C subscript (i); column 5: 0.
  • Row 2, from left to right: column 1: 0; column 2: A subscript (i minus 1); column 3: B subscript (i minus 1); column 4: C subscript (i minus 1); column 5: 0.

Arrows and lines:

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

provides exact sequences

0 kerdiA kerd iB kerd iC and cokerd iA cokerd iB cokerd iC 0.

Then, we wish to apply the snake lemma to the diagram

Kernels and cokernels in the homology sequence. A full diagram description follows.
Diagram description: Kernels and cokernels in the homology sequence

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

Objects, listed by row and column:

  • Row 1, from left to right: column 2: cokernel d subscript (i plus 1) superscript (A); column 3: cokernel d subscript (i plus 1) superscript (B); column 4: cokernel d subscript (i) superscript (C); column 5: 0.
  • Row 2, from left to right: column 1: 0; column 2: kernel d subscript (i minus 1) superscript (A); column 3: kernel d subscript (i minus 1) superscript (B); column 4: kernel d subscript (i minus 1) superscript (C).

Arrows and lines:

  1. An arrow from cokernel d subscript (i plus 1) superscript (A) to cokernel d subscript (i plus 1) superscript (B), labelled bar of (f) subscript (i).
  2. An arrow from cokernel d subscript (i plus 1) superscript (A) to kernel d subscript (i minus 1) superscript (A), labelled bar of (d) subscript (i) superscript (A).
  3. An arrow from cokernel d subscript (i plus 1) superscript (B) to cokernel d subscript (i) superscript (C), labelled bar of (g) subscript (i).
  4. An arrow from cokernel d subscript (i plus 1) superscript (B) to kernel d subscript (i minus 1) superscript (B), labelled bar of (d) subscript (i) superscript (B).
  5. An arrow from cokernel d subscript (i) superscript (C) to 0 (row 1, column 5), without a label.
  6. An arrow from cokernel d subscript (i) superscript (C) to kernel d subscript (i minus 1) superscript (C), labelled bar of (d) subscript (i) superscript (C).
  7. An arrow from 0 (row 2, column 1) to kernel d subscript (i minus 1) superscript (A), without a label.
  8. An arrow from kernel d subscript (i minus 1) superscript (A) to kernel d subscript (i minus 1) superscript (B), labelled f subscript (i minus 1).
  9. An arrow from kernel d subscript (i minus 1) superscript (B) to kernel d subscript (i minus 1) superscript (C), labelled g subscript (i minus 1).

with exact rows (where the “bars” denote morphisms induced on quotients). By the snake lemma, we have an exact sequence

kerd¯iA kerd¯ iB kerd¯ iC δ icokerd¯iA cokerd¯ iB cokerd¯ iC.

Note that for X {A,B,C}, we have

kerd¯iX = ker(X iimdi+1X X i1)Hi(A) and cokerd¯iXcoker(X i kerdi1X)H i1(A),

and the morphisms induced by fi and gi (resp., fi1 and gi1) on the first (resp., second) of these are just the morphisms fi and gi (resp., fi1 and gi1). Our exact sequence then becomes

Hi(A) fiH i(B) giH i(C) δiHi1(A) fi1H i1(B) gi1H i1(C).

Taken for all i, these yield the long exact sequence.

Example 12.3.14.

Consider the complexes A, B, and C of abelian groups with Ai = 4, Bi = 8, and Ci = 2 for all i and diA = diB = 0 for all i and diC equal to multiplication by 4 for all i. Then Hi(A) = 4, Hi(B) = 24ℤ≅ℤ2, and Hi(C) = 2 for all i. We have a short exact sequence

0 AfBgC 0

for maps f: A B induced by multiplication by 2 on each term and g: B C given by reduction modulo 2 on each term. The resulting long exact sequence has the form

δ4 2 02δ4 2 02 δ.

We briefly describe cochain complexes and cohomology, which simply amount to a change of indexing from decreasing to increasing.

Definition 12.3.15.

A cochain complex is a collection A = (Ai,dAi)i of objects Ai and morphisms dAi: Ai Ai+1 such that dAidAi1 = 0 for all i . The morphism dAi: Ai Ai+1 is called the ith differential of the cochain complex A.

We then have the notion of cohomology.

Definition 12.3.16.

The ith cohomology of a cochain complex A in an abelian category is the object

Hi(A) = kerdAi imdAi1.

Remark 12.3.17.

Much as with complexes, we can speak of morphisms of cochain complexes f: A B, which are collections of morphisms fi: Ai Bi such that dBifi = fi+1 dAi for all i . Again, short exact sequences

0 AfBgC 0

of cochain complexes give rise to long exact sequences in cohomology, but now of the form

Hi(A) f iHi(B) g iHi(C) δiHi+1(A)

Definition 12.3.18.

Let A = (Ai,diA) and B = (Bi,diB) be chain complexes. Let f,g: A B be morphisms of chain complexes.

a.

A chain homotopy from f to g is a sequence s = (si)i of morphisms si: Ai Bi+1 satisfying

figi = di+1Bs i+si1 diA

for all i .

b.

We say that f and g are chain homotopic, and write f g, if there exists a homotopy from f to g.

c.

If f is (chain) homotopic to 0, then f is said to be null-homotopic.

Remark 12.3.19.

For cochain complexes A and B and morphisms f,g: A B, a chain homotopy from f to g is a sequence s = (si)i of morphisms si: Ai Bi1 such that figi = dBi1 si+si+1 dAi.

The morphisms s defining a null-homotopy fit into a diagram

A null-homotopy. A full diagram description follows.
Diagram description: A null-homotopy

The diagonal maps are the components of a null-homotopy. This diagram is not generally commutative; the homotopy identity in the surrounding text is a sum of the two routes through a diagonal map.

Objects, listed by row and column:

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

Arrows and lines:

  1. An arrow from ellipsis (row 1, column 1) to A subscript (i plus 1), without a label.
  2. An arrow from A subscript (i plus 1) to A subscript (i), labelled d subscript (i plus 1) superscript (A).
  3. An arrow from A subscript (i plus 1) to B subscript (i plus 1), labelled f subscript (i plus 1).
  4. An arrow from A subscript (i) to A subscript (i minus 1), labelled d subscript (i) superscript (A).
  5. An arrow from A subscript (i) to B subscript (i), labelled f superscript (i).
  6. An arrow from A subscript (i) to B subscript (i plus 1), labelled s subscript (i).
  7. An arrow from A subscript (i minus 1) to ellipsis (row 1, column 5), without a label.
  8. An arrow from A subscript (i minus 1) to B subscript (i minus 1), labelled f subscript (i minus 1).
  9. An arrow from A subscript (i minus 1) to B subscript (i), labelled s subscript (i minus 1).
  10. An arrow from ellipsis (row 2, column 1) to B subscript (i plus 1), without a label.
  11. An arrow from B subscript (i plus 1) to B subscript (i), labelled d subscript (i plus 1) superscript (B).
  12. An arrow from B subscript (i) to B subscript (i minus 1), labelled d subscript (i) superscript (B).
  13. An arrow from B subscript (i minus 1) to ellipsis (row 2, column 5), without a label.

Proposition 12.3.20.

Assume that f and g are chain homotopic morphisms A B. Then the morphisms fi and gi on homology are equal for all i .

Definition 12.3.21.

A morphism of complexes f: A B is a homotopy equivalence if there exists a morphism g: B A such that gf idA and fg idB.

12.4. Projective and injective objects

We continue to work in an abelian category 𝒞.

Definition 12.4.1.

a.

We say that an epimorphism g: B C is split if there exists a morphism t : C B with gt = idC. In this case, we say that t is a splitting of g.

b.

We say that a monomorphism f : A B is split if there exists a morphism s: B A with sf = idA. In this case, we say that s is a splitting of f.

c.

We say that a short exact sequence

0 A fB gC 0 (12.4.1)

splits if there exists an isomorphism w: AC B with w(a,0) = f(a) and g(w(0,c)) = c for all a A and c C.

Example 12.4.2.

The exact sequence of abelian groups

0 3 26 mod22 0

is split, but

0 2 24 mod22 0

is not.

Proposition 12.4.3.

The following conditions on a short exact sequence

0 A fB gC 0

are equivalent:

  1. The sequence splits.
  2. The monomorphism f : A B splits.
  3. The epimorphism g: B C splits.
Proof.

We prove this in the category of R-modules.

  1. Suppose we have a splitting map t : C B. Then define s: B A by s(b) = a where f(a) = bt(g(b)). This is well-defined as f is injective, and such an a exists since

    g(bt(g(b))) = g(b)g(t(g(b))) = g(b)g(b) = 0.

    It splits f as

    s(f(a)) = s(b)s(t(g(b))) = s(b),

    the latter step using the fact that st = 0, which follows in turn from

    f(s(t(c))) = t(c)t(g(t(c))) = t(c)t(c) = 0.
  2. Suppose that we have a splitting map s: B A. Then define t : C B by t(c) = bf(s(b)) where g(b) = c. To see this is well defined, note that f(a)f(s(f(a))) = 0 for any a A.
  3. Define w(a,c) = f(a)+t(c). Its inverse is w(b) = (s(b),g(b)). To see this, we check that

    ww(a,c) = (s(f(a)+t(c)),g(f(a)+t(c))) = (s(f(a)),g(t(c))) = (a,c)

    for a A and c C, and note that

    ww(b) = w(s(b),g(b)) = f(s(b))+t(g(b)).

    for b B. Set c = g(b), so that g(bt(c)) = 0, and let a A be such that f(a) = bt(c). Then

    (f s+t g)(b) = f(s(f(a)))+f(s(t(c)))+t(g(f(a)))+t(g(t(c))) = f(a)+t(c) = b.
  4. Set t(c) = w(0,c). Then g(t(c)) = g(w(0,c)) = c.

Definition 12.4.4.

An object P of an abelian category is projective if for epimorphism π : B C and every morphism g: P C, there exists an morphism f : P B such that g = π f.

Remark 12.4.5.

The property of P being projective is represented by the existence of g in the commutative 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 f 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: B; column 2: C; column 3: 0.

Arrows and lines:

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

with exact lower row.

Proposition 12.4.6.

Free R-modules are projective.

Proof.

Let F be a free R-module with basis X. Let π : B C be a surjective R-module homomorphism, and suppose that g: F C is an R-module homomorphism. For each x X, let b be an element of B such that π(b) = g(x). Since F is free, we may defined f : F B by f(x) = b for each x X. Then π(f(x)) = g(x) for all x X, so π f = g as X generates F.

Example 12.4.7.

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 describe some equivalent conditions for projectivity.

Proposition 12.4.8.

The following conditions on an R-module P are equivalent:

i.

P is projective,

ii.

every surjection π : M P of R-modules is split, and

iii.

P is a direct summand of a free R-module.

Proof.

If P is projective and π : M P is a surjection, then the identity map idP: P P lifts to a homomorphism f : P M such that idP = π f, so (i) implies (ii). If (ii) holds, then choose a set of generators X of P, and let F be the free R-module on X, which comes equipped with a surjection π : F P that restricts to idX. This surjection is split, so P is a direct summand of F by Proposition 12.4.3, and therefore (iii) holds.

If P is a direct summand of a free module F with complement Q, then π : B C is a surjection, and g: P C is a homomorphism of R-modules, then we can extend g to g~: F C by setting g~(q) = 0 for all q Q. We then have f~: F B such that π f~ = g~ by the projectivity of F, and the restriction f = f~|P satisfies π f = g. Thus, (iii) implies (i).

Example 12.4.9.

For n 1, the left Mn(R)-module L of column vectors under left multiplication is a direct summand of Mn(R), which is isomorphic to Ln as a left R-module. Hence, L is projective, though it is not free for n 2.

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

Corollary 12.4.10.

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.

Definition 12.4.11.

An object I in an abelian category is injective if for every monomorphism ι : A B and every morphism f : A I, there exists a morphism g: B I such that f = gι.

Remark 12.4.12.

The property of I being injective is represented by the existence of g in the commutative diagram

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 g 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 I, labelled f.
  3. An arrow from A to B, labelled iota.
  4. A dashed arrow from B to I, labelled g.

with exact upper row.

Dually to the analogous result projective modules, we have the following.

Lemma 12.4.13.

As R-module I is injective if and only if every monomorphism ι : I R is split.

We also have the following interesting criterion, which employs Zorn’s lemma.

Proposition 12.4.14 (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.

Proof.

Let A be an R-submodule of an R-module B and f : A I be an R-module homomorphism. It suffices to show that we can extend f to g: B I with g|A = f. Let X be the set of pairs (C,h) with C an R-submodule of B containing A and h: C I an R-module homomorphism. We have a partial ordering on X given by (C,h) < (C,h) if C is contained in C and h|C = h. Given a chain 𝒞 in X, we have an upper bound (C,h) with C = (D,k)𝒞D such that if d D for (D,k) 𝒞, then h(d) = k(d). By Zorn’s lemma, 𝒞 has a maximal element (M,l).

Suppose first that MB, and let b BM. Consider the left ideal

J = {r R𝑟𝑏 M}

of R. Define s: J I by s(r) = l(𝑟𝑏) for r J. This R-module homomorphism may be extended to t : R I by assumption. Then define N = M +𝑅𝑏 and let q: N I be the unique R-module homomorphism such that q|M = l|M and q(𝑟𝑏) = t(r) for all r R. This exists as M 𝑅𝑏 = 𝐽𝑏, and l(𝑟𝑏) = s(r) = t(r) for r J. (Also, if 𝑟𝑏 = 0, then r J, so q(𝑟𝑏) = l(𝑟𝑏) = 0 in this instance.) The existence of q gives a contradiction of the maximality of M. Thus M = B, and we are done.

Example 12.4.15.

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 12.4.16.

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

Proposition 12.4.17.

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 Baer’s criterion, 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.

12.5. Exact functors

Despite the fact that additive functors preserve direct sums, they may not preserve exact sequences. We make the following definitions.

Definition 12.5.1.

Let F : 𝒞 𝒟 be an additive functor of abelian categories.

a.

We say that F is left exact if for every left short exact sequence 0 A B C in 𝒞, the sequence 0 F (A) F (B) F (C) is exact in 𝒟.

b.

We say that F is right exact if for every right short exact sequence A B C 0 in 𝒞, the sequence F (A) F (B) F (C) 0 is exact in 𝒟.

c.

We say that F is an exact functor if for every short exact sequence 0 A B C 0 in 𝒞, the sequence 0 F (A) F (B) F (C) 0 is exact in 𝒟.

Remark 12.5.2.

A contravariant additive functor F : 𝒞 𝒟 is left exact if the resulting covariant functor 𝒞op 𝒟 is left exact.

Example 12.5.3.

The functor F : 𝐀𝐛 𝐀𝐛 by F (A) = AA with F (f) = f f is exact.

Terminology 12.5.4.

We (somewhat loosely) say a functor a certain structure if its takes structures of one sort in a given category (induced from the source category) to those of the same sort in another (induced from the target category). For instance, exact functors are additive functors that preserve short exact sequences.

Lemma 12.5.5.

Let F : 𝒞 𝒟 be an additive functor of abelian categories. The following are equivalent:

i.

F is exact,

ii.

F is both left and right exact,

iii.

F preserves all three-term exact sequences A B C, and

iv.

F preserves all exact sequences.

Proof.

It is immediate that (iv) implies the other statements and also that (ii) implies (i).

Suppose that F that preserves all three-term exact sequences. To say that

0 A B C 0

is short exact is equivalent to saying that the three three-term sequences 0 A B, A B C, and B C 0 are all exact. Since exactness of these is preserved by F, so is exactness of the original short exact sequence. So, (iii) implies (i).

If F is an exact functor, take any exact sequence A. Then 0 kerdi Ai imdi 0 is short exact, so

0 F (kerdi) F (Ai) F (di)F (imdi) 0

is exact as well. It F (di) follows that image F (imdi) and kernel F (kerdi) for all i, so we have

imF (di) = F (imdi) = F (kerdi1) = kerF (di1).

Thus, F (A) is exact. Thus, (i) implies (iv), which finishes the proof.

Remark 12.5.6.

The reader may also check that an additive functor of abelian categories is left (resp., right) exact if and only if it sends short exact sequences to left (resp., right) short exact sequences.

Recall that for an additive category 𝒞, the functors hX (and hX) may be viewed as taking values in 𝐀𝐛, and clearly such functors are additive. In fact, they are also left exact.

Lemma 12.5.7.

Let 𝒞 be an abelian category, and let X be an object of 𝒞.

a.

The functor hX: 𝒞 𝐀𝐛 is left exact.

b.

The functor hX: 𝒞op 𝐀𝐛 is left exact.

Proof.

Let

0 A fB gC 0

be an exact sequence in 𝒞. Applying hX, we obtain homomorphisms

0 Hom𝒞(X,A) hX(f)Hom𝒞(X,B) hX(g)Hom𝒞(X,C)

of abelian groups, and we claim this sequence is exact. If hX(f)(α) = 0, then f α = 0, but f is a monomorphism, so α = 0. Since hX is a functor, we have hX(g)hX(f) = 0, and if β kerhX(g), then gβ = 0. Naturality of the kernel implies that β factors through a morphism X kerg. But we have canonical isomorphisms

A coimf imf kerg,

the first as f is a monomorphism, and the composite of the composite of these with the canonical morphism kerg B is g. Therefore, we obtain a morphism α : X A satisfying f α = g. This proves part a, and part b is just part a with 𝒞 replaced by 𝒞op.

Lemma 12.5.8.

Let R be a ring, and let N be a right R-module. The tensor product functor tN: R-mod 𝐀𝐛 given on objects by tN(M) = N RM and on morphisms by tN(g) = idNg is right exact.

Proof.

Since tensor products commute with direct sums, tN is additive. Let

A fB gC 0

be a right short exact sequence of R-modules. The group N RC is generated by simple tensors nc with n N and c C and

nc = ng(b) = (idNg)(nb)

for any b B with g(b) = c, we have that tN(g) is surjective. We need then only define an inverse to the surjection g¯: cokertN(f) N RC. For this, we consider the map 𝜃 : N ×C cokertN(f) given on (n,c) N ×C by picking b B with g(b) = c and then setting 𝜃(n,c) = nb+imtN(f). If g(b) = c, then g(bb) = 0, so bb = f(a) for some a A, and then n(bb) = tN(f)(na), so 𝜃 is well-defined and then easily seen to be biadditive and R-balanced. The induced map Θ: N RC cokertN(f) is inverse to g¯ by definition.

Lemma 12.5.9.

Let 𝒞 be an abelian category. A sequence

0 A fB gC

is exact if every sequence

0 Hom𝒞(X,A) hX(f)Hom𝒞(X,B) hX(g)Hom𝒞(X,C)

is exact.

Proof.

For X = A, we get

gf = hX(g)hX(f)(idA) = 0,

so we have a monomorphism s: imf kerg. For X = kerg and β : kerg B the natural monomorphism defined by the kernel, we have hX(g)(β) = gβ = 0, so there exists α : kerg A with f α = β. We then have that β factors a morphism t : kerg imf inverse to s.

Proposition 12.5.10.

Any right (resp., left) adjoint to ia functor between abelian categories is left (resp., right) exact.

Proof.

We treat the case of left exactness, the other case simply being the corresponding statement in opposite categories. Let G: 𝒞 𝒟 be an additive functor of abelian categories that admits a left adjoint F. Suppose that

0 A fB gC

is a left exact sequence in 𝒞. Then for any D Obj(𝒟), the sequence

0 hF (D)(A) hF (D)(f)hF (D)(B) hF (D)(g)hF (D)(C)

is left exact. Since F is left adjoint to G, this sequence is isomorphic to

0 hD(G(A)) hD(G(f))hD(G(B)) hD(G(g))hD(G(C))

as a sequence of abelian groups. Since this holds for all D, the sequence

0 G(A) G(f)G(B) G(g)G(C)

is exact.

Proposition 12.5.11.

Let R be a ring, and fix an R-module M.

a.

The covariant homomorphism functor hM: R-mod 𝐀𝐛 is exact if and only if M is R-projective.

b.

The contravariant homomorphism functor hM: R-mod 𝐀𝐛 is exact if and only if M is R-injective.

Proof.

We prove part a. 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 12.5.12.

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.

The following embedding theorem, the proof of which is beyond the scope of these notes, allows us to do most of the homological algebra that can be done in the category of R-modules for any R in an arbitrary abelian category.

Theorem 12.5.13 (Freyd-Mitchell).

If 𝒞 is a small abelian category, then there exists a ring R and an exact, fully faithful functor 𝒞 R-mod.

In other words, 𝒞 is equivalent to a full, abelian subcategory of R-mod for some ring R. We can use this as follows: suppose there is a result we can prove about exact diagrams in R-modules for all R, like the snake lemma. We then have the result in all abelian categories, since we can take a small full, abelian subcategory containing the objects in which we are interested and embed it into some category of left R-modules. If the result holds in that category, then by exactness of the embedding, the result will hold in the original category.

12.6. Projective and injective resolutions

Definition 12.6.1.

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 a complex of projective objects.

Definition 12.6.2.

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.

Since free modules are projective, R-mod has enough projectives.

Remark 12.6.3.

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

Examples 12.6.4.

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 12.6.5.

Let P A and Q B be projective resolutions in an abelian category, and suppose that g: A B is an R-module homomorphism. Then g extends to a morphism 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 Q2 lifting h1, i.e., so that

d2s1 = h1 = f1 s0 d1,

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

Proposition 12.6.6 (Horseshoe lemma).

Suppose that

0 A fB gC 0

is a short exact sequence in an abelian category 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.
(12.6.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: P1C 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 12.6.7.

Let 𝒞 be an abelian category and P a split long exact sequence of projectives with Pi = 0 for i < 0. 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 12.6.8.

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

Remark 12.6.9.

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 12.6.10.

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

Proposition 12.6.11.

Let 𝒞 and 𝒟 be an abelian category. Let F : 𝒞 𝒟 be a 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.

12.7. 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.

Proposition 12.7.1.

Let F : 𝒞 𝒟 be an additive functor between abelian categories 𝒞 and 𝒟. For i 0, there are functors LiF : 𝒞 𝒟 given on A 𝒞 by LiF (A) = Hi(F (P)) for P A a projective resolution of A 𝒞 and given on g: A B in 𝒞 by LiF (g) = F (f): Hi(F (P)) Hi(F (Q)) for P A and Q B projective resolutions and f: P Q a morphism of complexes f : P Q compatible with the augmentations to A and B. These functors are dependent on the choices made up only to unique isomorphism.

Proof.

The key point is that Proposition 12.6.5 tells us that F (f) is independent of the choice of f, since any two choices are chain homotopic. In particular, given any two choices of P and Q of projective resolutions of A, and any choices of f P Q f Q P augmenting the identity morphism on A gives rise to morphisms on cohomology, the resulting maps F (f) and F (f) must be mutually inverse, since f f and ff augment the identity on A, as to the identity morphisms on Q and P. Thus, Hi(F (P)) is unique up to unique isomorphism, so LiF is well-defined (up to unique isomorphism), and LiF (idA) = idLiF (A). Similarly, it is easy to check that the uniqueness also implies that LiF is compatible with compositions.

Definition 12.7.2.

For an additive functor F : 𝒞 𝒟, the ith left derived functor LiF : 𝒞 𝒟 of F is the functor defined by Proposition 12.7.1.

We have the following obvious corollaries of Lemma 12.7.1.

Lemma 12.7.3.

Let F : 𝒞 𝒟 be a right exact functor of abelian categories. Then we have a canonical, natural isomorphism L0F F of functors.

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).

The reader will easily check the independence of the choice of resolution and naturality, as in Lemma 12.7.1.

Corollary 12.7.4.

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 12.7.5.

To each morphism f : A B in 𝒞, we can associate 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 12.6.5. 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.

Definition 12.7.6.

For a right exact functor F : 𝒞 𝒟 of abelian categories, the functor LiF is called ith left derived functor of F.

We see that L0F and F are canonically naturally isomorphic functors.

Definition 12.7.7.

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 12.7.8.

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.

Theorem 12.7.9.

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 (12.6.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 12.6.5, 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.
(12.7.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 (12.7.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.

Definition 12.7.10.

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 uniquely 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.)

The δ-functor of left derived functors of F is universal, which will follow as a corollary of Theorem 12.7.14 below.

Theorem 12.7.11.

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

Definition 12.7.12.

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 12.7.13.

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,

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 12.7.14.

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.

We next wish to study right derived functors of left exact functors.

Definition 12.7.15.

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.

Definition 12.7.16.

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.

Remark 12.7.17.

An abelian category has enough injectives if and only if every object of it has an injective resolution.

Proposition 12.7.18.

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.

We also have the analogues of Propositions 12.6.5 and 12.6.6 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.

Definition 12.7.19.

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)Fi(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 12.7.20.

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.

Theorem 12.7.21.

The functors RF form a cohomological universal δ-functor.

The proof is dual to that of Theorems 12.7.9 and 12.7.11. We also have the following.

Theorem 12.7.22.

Let 𝒞 be an abelian category that 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.

12.8. Tor and Ext

Example 12.8.1.

Take the abelian group M = 𝑛ℤ. If we apply the functor tM: 𝐀𝐛 𝐀𝐛 to the exact sequence of abelian groups 0 n 𝑛ℤ 0 for some n 2, we obtain the right, but not left, exact sequence

𝑛ℤ 0𝑛ℤ 𝑛ℤ 0.

If we apply hM: 𝐀𝐛 𝐀𝐛 to the same exact sequence, we obtain the left, but not right, exact sequence

0 0 0 𝑛ℤ,

noting that Hom(𝑛ℤ,) = 0.

Definition 12.8.2.

A right R-module N is R-flat, or just flat, if the tensor product functor tN: R-mod 𝐀𝐛 is exact.

Remarks 12.8.3.

a.

An S-R-bimodule N is flat as a right R-module if and only if the functor tN: R-mod S-mod is exact.

b.

A left R-module M is defined to be flat if it is flat as a right Rop-module (which is equivalent to the right tensor product functor with M being exact on Rop-mod).

Proposition 12.8.4.

Projective right R-modules are R-flat.

Proof.

Let P be a projective R-module, and let Q be a complement in a free R-module F on a basis X. Let f : A B be an injection of R-modules. We have a commutative diagram

Tensor products of a projective summand. A full diagram description follows.
Diagram description: Tensor products of a projective summand

The structural squares and triangles displayed here commute.

Objects, listed by row and column:

  • Row 1, from left to right: column 1: P tensor subscript (R) A; column 2: P tensor subscript (R) B.
  • Row 2, from left to right: column 1: F tensor subscript (R) A; column 2: F tensor subscript (R) B.
  • Row 3, from left to right: column 1: direct sum subscript (x in X) A; column 2: direct sum subscript (x in X) B.

Arrows and lines:

  1. A hooked arrow from P tensor subscript (R) A to F tensor subscript (R) A, without a label.
  2. An arrow from P tensor subscript (R) A to P tensor subscript (R) B, labelled id subscript (P) tensor f.
  3. A hooked arrow from P tensor subscript (R) B to F tensor subscript (R) B, without a label.
  4. An arrow from F tensor subscript (R) A to F tensor subscript (R) B, labelled id subscript (F) tensor f.
  5. An arrow from F tensor subscript (R) A to direct sum subscript (x in X) A, labelled isomorphism symbol.
  6. An arrow from F tensor subscript (R) B to direct sum subscript (x in X) B, labelled isomorphism symbol.
  7. A hooked arrow from direct sum subscript (x in X) A to direct sum subscript (x in X) B, labelled (f) subscript (x in X).

the vertical isomorphisms following from the commutativity of direct sums and tensor products. Since f is injective, so is the lowermost vertical map. Since P is a direct sum of F, the map

P RA (P RA)(QRA) F RA

is injective, and similarly with A replaced by B. Thus, commutativity of the diagram yields the injectivity idPf. Since left tensor product with P preserves injective homomorphisms and right exact sequences, it preserves short exact sequences and is therefore exact.

For modules over a principal ideal domain, we can characterize flat modules as follows.

Proposition 12.8.5.

Let R be a PID. An R-module M is flat if and only if M is R-torsion-free.

Proof.

Let M be a flat R-module. Let r R be a nonzero element, and let ϕr: R R be the injective map ϕr(x) = 𝑟𝑥 for x R. The tensor product map idMRϕr is injective as A is R-flat. Under the identification M R𝑅≅𝑀 of Corollary 8.4.24, determined by mr𝑟𝑚, the map idMRϕr becomes identified with the map ψr: M M that is left multiplication by r. Since ψr is then injective for every nonzero r, we see that M has no nonzero R-torsion.

Next, let M be R-torsion free. It is the union (which is also the direct limit) of its finitely generated, necessarily torsion-free R-submodules. We omit here a check of the fact that direct limits and tensor products commute. Given this, we may assume that M is finitely generated, in which case it follows from Proposition 12.8.5 that M is free, hence projective, and hence flat.

Remark 12.8.6.

It follows from Corollary 8.9.3 and Proposition 12.8.5 that finitely generated flat modules over a PID R are R-free.

Definition 12.8.7.

Let R and S be rings, and let A be an S-R-bimodule. For i 0, the ith Tor-functor

ToriR(A,): R-mod S-mod

is the ith left derived functor of tA.

Remark 12.8.8.

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

ToriR(A,): R-mod R-mod

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

Remark 12.8.9.

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

ToriR(A,): R-mod S-mod

with the forgetful functor F : R-mod 𝐀𝐛 agrees with the functor

ToriR(F (A),): R-mod 𝐀𝐛,

hence the omission of the notation for S in the definition of ToriR(A,).

Example 12.8.10.

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.

Lemma 12.8.11.

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

i.

A is flat,

ii.

Tor1R(A,) = 0,

iii.

ToriR(A,) = 0 for all i 1.

Proof.

Clearly, (iii) implies (ii). If

0 B1 B2 B3 0

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

Tor1R(A,B3) A RB1 ARB2 ARB3 0,

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

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

ARQ1 ARQ0 ARB 0

is exact by the flatness of A. It follows that

ToriR(A,B) = H i(ARQ) = 0

for all i 1.

Proposition 12.8.12.

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

ToriR(A,B)H i(PRB)

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

Proof.

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

Tot(PRQ)k = i+j=kPiRQj,

where the boundary maps from each term PiRQj are given by the sums

diAid Qj +(1)iid Pi djB.

We claim that the homology of this chain complex is isomorphic to the homology of the complexes PRB and ARQ, from which the lemma follows.

We have maps of complexes

Tot(PRQ) PRB (12.8.1)

and

Tot(PRQ) ARQ (12.8.2)

induced by augmentation morphisms (up to sign, and zero maps otherwise). The double complex PRQ PRB (i.e., with PiRB in the (i,1)-position) has exact columns, since each projective module is flat. One can show that this implies that the total complex of this cpomplex is exact. This says precisely that the map in (12.8.1) induces an isomorphism on homology. Similarly, so does the map in (12.8.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 12.8.13.

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 12.8.12.

Proof.

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

0 A1 A2 A3 0

is an exact sequence. Then

0 A1 RQ A2 RQ A3 RQ 0

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

ToriR(A1,B) Tor iR(A2,B) Tor iR(A3,B) Tor i1R(A1,B) ,

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

Remark 12.8.14.

It follows from Proposition 12.8.12 and Proposition 12.7.13 that the ToriR(A,B) can be computed via a flat resolution of either A or B.

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

Lemma 12.8.15.

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 12.8.13, 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 12.8.15, 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 12.8.16.

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 12.8.17.

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

Proof.

Recall that we have natural isomorphisms S1𝐴≅S1RRA for R-modules A. 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.

Definition 12.8.18.

Let R and S be rings, and let A be an R-S-bimodule. For i 0, the ith Ext-functor

ExtRi(A,): R-mod S-mod

is the ith right derived functors of hA.

Example 12.8.19.

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 ExtRi(P,B) = 0 for all B and all i 1 if P is a projective module, as follows from the exactness of HomR(P,). We have the analogous result to Proposition 12.8.13 for Ext-groups, which says that such groups may be computed using projective resolutions.

Proposition 12.8.20.

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 12.8.21.

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 12.8.22.

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

0 𝑝ℤ 𝑝𝑖p2 mod p𝑝ℤ 0

with 1 i p1, and

0 𝑝ℤ 𝑝ℤ𝑝ℤ 𝑝ℤ 0.

Theorem 12.8.23.

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, represented by an exact sequence

0 B E A 0. (12.8.3)

We then have an exact sequence

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

and we set Φ(E) = E(idB) ExtR1(A,B). 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.
(12.8.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.
(12.8.5)

commutes. Hence, we have

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

as desired.

On the other hand, suppose given E with exact sequence (12.8.3). By projectivity of P, the map P A lifts to a map P E. Hence, we have a diagram as in (12.8.4). Furthermore, the map t in the diagram (12.8.4) satisfies (t) = E(idB) by the commutativity of (12.8.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.

12.9. Group cohomology

In this section, we let G denote a group.

Definition 12.9.1.

The augmentation map 𝜀 : [G] is the unique ring homomorphism with 𝜀(g) = 1 for all g G.

Definition 12.9.2.

The augmentation ideal IG of [G] is the kernel of the augmentation map.

Lemma 12.9.3.

The augmentation ideal IG is generated by {g1g G}.

Proof.

We have

IG = {gGagg [G]gGag = 0}.

For α = gGagg IG, we have

α = α gGag =gGag(g1).

Definition 12.9.4.

Let A be an [G]-module.

a.

The G-invariant group of A is the -module

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

the maximal [G]-submodule of A on which all elements of G act trivially.

b.

The G-coinvariant group of A is the -module AG = AIGA, the maximal [G]-quotient of A on which all elements of G act trivially.

Examples 12.9.5.

a.

If we view as a [G]-trivial module, we have G = and G≅ℤ.

b.

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

[G]G = { NGif G is finite 0 otherwise,

where NG = gGg is the norm element in a finite group G. The computation of the invariant group follows from the fact that the action of G on itself by left multiplication is transitive, so for an element of [G] to be G-fixed, its coefficients must all be equal.

c.

Let KF be a finite Galois extension of fields, and let G = Gal(KF ). Then KG = F and (K×)G = F×.

Example 12.9.6.

For n 2, let Sn act on 𝒜 = [x1,x2,,xn] by

σ p(x1,x2,,xn) = p(xσ(1),xσ(2),,xσ(n))

for σ Sn and p 𝒜. This action is -bilinear so it gives 𝒜 the structure of a left 𝒜[Sn]-module. Then 𝒜Sn is the -module of symmetric polynomials in 𝒜, which is the -module generated by the elementary symmetric polynomials (see Definition 6.13.4). On the other hand, 𝒜Sn≅ℤ[x], with the isomorphism induced by the -linear map 𝒜 [x] taking each xi to x.

Remark 12.9.7.

We have a left exact invariant functor AAG as a functor [G]-mod 𝐀𝐛, with the map on homomorphisms being the restriction to invariant subgroups. This functor is naturally isomorphic to the functor h, where is viewed as the trivial [G]-module. In particular

ηA: Hom[G](,A) AG,η A(ϕ) = ϕ(1)

for ϕ Hom[G](,A) is a natural isomorphism. Thus, the invariant factor is left exact.

Similarly, AAG defines a right exact coinvariant functor which is isomorphic to the functor t, in that we have natural isomorphisms

[G]A AG,1aa+IGA.

In particular, the coinvariant functor is right exact.

Definition 12.9.8.

a.

The cohomology H(G,) of G is the δ-functor given by the right derived functors of the G-invariant functor. The ith cohomology group of G with coefficients in a [G]-module A is Hi(G,A).

b.

The homology H(G,) of G is the δ-functor given by the left derived functor of the G-coinvariant functor. The ith homology group of G with coefficients in a [G]-module A is Hi(G,A).

Remark 12.9.9.

By definition, we have natural isomorphisms

Hi(G,A)Ext [G]i(,A) and H i(G,A)Tori[G](,A)

for i 0 and [G]-modules A.

Let us give a more explicit description of group cohomology.

Definition 12.9.10.

The bar resolution of as a [G]-module is the complex C with Ci = [Gi+1] for i 0, differentials di: Ci Ci1 given on (g0,,gi) Gi+1 by

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

and augmentation 𝜀 : C0 the augmentation map.

Remark 12.9.11.

As follows from Remark 12.9.9, the group Hi(G,A) is the ith cohomology group of the complex

0 Hom[G]([G],A) D0Hom [G]([G2],A) Hom[G]([Gi],A) Di1Hom [G]([Gi+1],A)

with Hom[G]([G],A)A in degree 0. Similarly, Hi(G,A) is the ith homology group of the complex

[Gi+1] [G]A [G2] [G]A [G][G]A 0,

with [G][G]𝐴≅𝐴 in degree 0.

There is another complex which computes the cohomology of G, that of the inhomogeneous G-cocycles, which has a more complicated differential but is more amenable to computation.

Definition 12.9.12.

Let A be a G-module, and let i 0.

a.

The group of i-cochains of G with coefficients in A is the set of functions from Gi to A:

Ci(G,A) = {f : Gi A}.
b.

The ith differential di = dAi: Ci(G,A) Ci+1(G,A) is the map

di(f)(g0,g1,,g i) = g0 f(g1,gi) +j=1i(1)jf(g0,,g j2,gj1gj,gj+1,,gi)+(1)i+1f(g0,,g i1).

We remark that C0(G,A) is taken simply to be A, as G0 is a singleton set. The proof of the following, which tells us that C(G,A) is a cochain complex, is left to the reader.

Lemma 12.9.13.

For any i 0, one has di+1 di = 0.

We consider the cohomology groups of C(G,A).

Definition 12.9.14.

Let i 0.

a.

We set Zi(G,A) = kerdi, the group of i-cocycles of G with coefficients in A.

b.

We set B0(G,A) = 0 and Bi(G,A) = imdi1 for i 1. We refer to Bi(G,A) as the group of i-coboundaries of G with coefficients in A.

Theorem 12.9.15.

The maps

ψi: Hom [G]([Gi+1],A) Ci(G,A)

defined by

ψi(φ)(g1,,g i) = φ(1,g1,g1g2,,g1g2gi)

are isomorphisms for all i 0. This provides isomorphisms of complexes in the sense that ψi+1 Di = diψi for all i 0. Moreover, these isomorphisms are natural in the G-module A.

Proof.

If ψi(φ) = 0, then

φ(1,g1,g1g2,,g1g2gi) = 0

for all g1,,gi G. Let h0,,hi G, and define gj = hj11hj for all 1 j i. We then have

φ(h0,h1,,hi) = h0φ(1,h01h1,,h01h i) = h0φ(1,g1,,g1gi) = 0.

Therefore, ψi is injective. On the other hand, if f Ci(G,A), then defining

φ(h0,h1,,hi) = h0f(h01h1,,h i11h i),

we have

φ(gh0,gh1,,ghi) = gh0f((gh0)1gh1,,(gh i1)1gh i) = 𝑔𝜑(h0,h1,,hi)

and ψi(φ) = f. Therefore, ψi is an isomorphism of groups.

That ψ forms a map of complexes is shown in the following computation:

ψi+1(Di(φ))(g1,,g i+1) = Di(φ)(1,g1,,g1g i+1) = φ di+1(1,g1,,g1gi+1) =j=0i+1(1)jφ(1,g1,,g1g j2,g1gj,,g1gi+1).

The latter term equals

g1ψi(φ)(g2,,g i+1)+j=1i(1)jψi(φ)(g1,,g j2,gj1gj,gj+1,,gi+1) +(1)i+1ψi(φ)(g1,,g i),

which is di(ψi(φ)).

Finally, suppose that α : A B is a G-module homomorphism. We then have

α ψi(φ)(g1,,g i) = α φ(1,g1,,g1gi) = ψi(α φ)(g1,,g i),

hence the desired naturality.

Corollary 12.9.16.

The ith cohomology group of the complex (Hom[G]([Gi+1],A),DAi) is naturally isomorphic to Hi(G,A).

Corollary 12.9.17.

The ith cohomology group of G with coefficients in A is

Hi(G,A) = Zi(G,A)Bi(G,A).

The cohomology groups measure how far the cochain complex C(G,A) is from being exact. We give some examples of cohomology groups in low degree.

Lemma 12.9.18.

We have

Z1(G,A) = {f : G Af(𝑔h) = 𝑔𝑓(h)+f(g) for all g,h G}

and B1(G,A) is the subgroup of f : G A for which there exists a A such that f(g) = 𝑔𝑎a for all g G. In particular, if A is a [G]-module with trivial G-action, then H1(G,A) = Hom(G,A).

Proof.

Let a A. Then d0(a)(g) = 𝑔𝑎a for g G, so kerd0 = AG. That proves part a, and part b is simply a rewriting of the definitions. Part c follows immediately, as the definition of Z1(G,A) reduces to Hom(G,A), and B1(G,A) is clearly (0), in this case.

We remark that, as A is abelian, we have Hom(G,A) = Hom(Gab,A), where Gab is the maximal abelian quotient of G (i.e., its abelianization).

We turn briefly to an interesting use for second cohomology groups.

Definition 12.9.19.

A group extension of G by a G-module A is a short exact sequence of groups

0 A ιE πG 1

such that, choosing any section s: G E of π, one has

s(g)𝑎𝑠(g)1 = ga

for all g G, a A. Two such extensions E E are said to be equivalent if there is an isomorphism 𝜃 : E E fitting into a commutative diagram

Equivalence of group extensions. A full diagram description follows.
Diagram description: Equivalence of group extensions

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: script E; column 4: G; column 5: 0.
  • Row 2, from left to right: column 1: 0; column 2: A; column 3: script E prime; column 4: G; 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 script E, without a label.
  3. Equality joins A (row 1, column 2) and A (row 2, column 2), without a label.
  4. An arrow from script E to G (row 1, column 4), without a label.
  5. An arrow from script E to script E prime, labelled theta.
  6. An arrow from G (row 1, column 4) to 0 (row 1, column 5), without a label.
  7. Equality joins G (row 1, column 4) and G (row 2, column 4), without a label.
  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 script E prime, without a label.
  10. An arrow from script E prime to G (row 2, column 4), without a label.
  11. An arrow from G (row 2, column 4) to 0 (row 2, column 5), without a label.

We denote the set of equivalence classes of such extensions by E(G,A).

Definition 12.9.20.

A factor set of a group G valued in a [G]-module A is a 2-cocycle f : G2 A satisfying f(1,g) = f(g,1) = 0 for all g G.

Lemma 12.9.21.

Every 2-cocycle of a group is cohomologous to, i.e., has the same cohomology class as, a factor set.

Proof.

The condition that F : G2 A is a 2-cocycle is that

𝑔𝐹 (h,k)+F (g,h𝑘) = F (𝑔h,k)+F (g,h)

for all g,h,k G. In particular, taking g = h = e, we have F (e,k) = F (e,e) and taking h = k = e, we have 𝑔𝐹 (e,e) = 𝑓𝐹𝑔,e). Note that for a 1-cochain c, we have

𝑑𝑐(g,h) = 𝑔𝑐(h)c(𝑔h)+c(g).

In particular, if we set c(g) = c for all g G some fixed c A, then 𝑑𝑐(g,h) = 𝑔𝑐 for all g G, so if we take c = F (e,e) and replace F by f = F 𝑑𝑐, then f(e,k) = 0 and f(g,e) = 0 for all g,k G.

Theorem 12.9.22.

The group H2(G,A) is in canonical bijection with E(G,A) via the map induced by that taking a factor set f : G2 A to the extension Ef = A×G with multiplication given by

(a,g)(b,h) = (a+𝑔𝑏+f(g,h),𝑔h)

This identification takes the identity to the semi-direct product AG determined by the action of G on A.

Proof.

We check that Ef so defined is a group. That it has identity (0,e) is clear from the definition. Associativity is as follows:

(a+𝑔𝑏+f(g,h),𝑔h)(c,k) = (a+𝑔𝑏+f(g,h)+𝑔h𝑐+f(𝑔h,k),𝑔h𝑘) = (a+g(b+h𝑐)+𝑔𝑓(h,k)+f(g,h𝑘),𝑔h𝑘) = (a,g)(b+h𝑐+f(h,k),h𝑘).

The inverse of (a,g) clearly has the form (b,g1) for some b A, and we then must have a+𝑔𝑏+f(g,g1) = 0, so b = g1ag1f(g,g1), and the inverse exists. That Ef is a group extension of G by A is now nearly immediate. Note also that Ef is split if f = 0, ]since in that case (0,g)(0,h) = (0,𝑔h), so G is a subgroup.

Let c be a 1-cochain with 𝑑𝑐(e,g) = 𝑑𝑐(g,e) = 0, the latter property occurring if and only if c(e) = 0. Consider the map ψf,c: Ef Ef+𝑑𝑐 given by

ψf,c(a,g) = (ac(g),g).

We have

ψf,c(a+𝑔𝑏+f(g,h),𝑔h) = (a+𝑔𝑏+f(g,h)c(𝑔h),𝑔h) = (a+𝑔𝑏+f(g,h)+𝑑𝑐(g,h)𝑔𝑐(h)+c(g),𝑔h) = ψc(a,g)ψc(a,h),

so ψc is a homomorphism, and it is clearly has inverse ψf+𝑑𝑐,c. Thus, we have a well-defined map from H2(G,A) to E(G,A).

It remains to construct an inverse, which we sketch as the computations all follow from what we have already done. Given a group extension, we indeed always have a 2-cochain f(g,h): G2 A defining the multiplication. We claim that f is a factor set. For this, associativity again tells us that f is a 2-cocycle, and the fact that (0,e) is a two-sided identity forces f(e,g) = f(g,e) = 0 for all g G. The resulting association is clearly inverse on the level of extensions and cochains. If 𝜃 : E E is an isomorphism of group extensions of G by A, then 𝜃(0,g) = (c(g),g) for some c: G A that has the property that if the factor set is associated to E is 𝑑𝑐 plus the factor set associated to E.

Remark 12.9.23.

Theorem 12.9.22 tells us that E(G,A) also has a group structure, which may also be given an explicit description. Given E and E extensions of G by A, their product is

E E = (E × GE)(a,a)a A.

This product is known as the Baer sum of the two extensions.

Let’s give a group-theoretic application of this description of H2(G,A).

Proposition 12.9.24 (Schur).

Let G be a group of order 𝑚𝑛, where m and n are relatively prime positive integers. Then every abelian normal subgroup of order n has a complement in G of order m.

Proof.

Let N be an abelian normal subgroup of G, and set H = GN. Let f : G2 N be a factor set corresponding to G as an extension of H by N by Theorem 12.9.22. For every h H, let

t(h) =kHf(h,k),

which makes sense as H is abelian. For h,h H, we have

kHf(h,hk) = kHf(h,k) = t(h).

Now

f(h,h)mt(hh) = kHf(h,h)mf(hh,k) = kHh𝑓(h,k)h1f(h,hk) = h𝑡(h)h1 t(h).

Let a,b be such that 𝑎𝑚+𝑏𝑛 = 1. We then have

f(h,h) = f(h,h)𝑎𝑚+𝑏𝑛 = 𝑑𝑡(h,h)a.

Thus, f is a coboundary, so G is a split extension by Theorem 12.9.22. In particular, it contains a subgroup of order n, isomorphic to H.

Remark 12.9.25.

Though we do not prove it, we have Hi(G,A) = 0 for all i 1 whenever G and A are finite of relatively prime order. In fact, for any finite group G and G-module A, the exponent of Hi(G,A) divides the order of G.

Definition 12.9.26.

A Hall subgroup of a finite group is a subgroup with relatively prime order and index.

We can extend Proposition 12.9.24 from abelian to arbitrary normal subgroups.

Theorem 12.9.27 (Schur-Zassenhaus).

Every normal Hall subgroup of a finite group has a complement.

Proof.

Let N be a normal Hall subgroup of G of order n and index m. If N is abelian, then the result follows from Proposition 12.9.24. Suppose the result holds true in the case of normal subgroups of order less than n 2. Let p be a prime dividing n. Let P be a Sylow p-subgroup of G. Then 𝑃𝑁N has p-power order dividing m. Since m and n are relatively prime, this forces P to be contained in N. In other words, the Sylow p-subgroups of N and G are the same. Now

[G : NG(P)] = np(G) = np(N) = [N : NN(P)],

so [NG(P) : NN(P)] = m. On the other hand, NN(P)P has order prime to m and less than n, being properly contained in NP. Furthermore, NN(P) = N NG(P) is normal in NG(P). By induction on n, we have that there exists a subgroup K of NG(P) with KP isomorphic to NG(P)NN(P) and |KP| = m.

Since P is a p-group, its center Z = Z(P) is nontrivial. It is also a characteristic subgroup of P, so it is normal in K. By induction, PZ has a has a complement in KZ, equal to HZ for some subgroup H of K, which necessarily has order m. This group H is the desired complement to N.

12.10. Galois cohomology

We briefly consider the cohomology of finite Galois extensions. We have the following generalization of Hilbert’s Theorem 90, which also has the same name.

Theorem 12.10.1 (Hilbert’s Theorem 90).

Let LK be a finite Galois extension with Galois group G. Then H1(G,K×) = 0.

Proof.

Let f : G L×be a 1-cocycle. We view the elements σ G as abelian characters L× L×. As distinct characters of L×, these characters form a linearly independent set. The sum σGf(σ)σ is therefore a nonzero map L× L. Let α L×be such that z = σGf(σ)σ(α)0. For any τ G, we have

τ1(z) = σGτ1(f(σ))τ1σ(α) = σGτ1(f(𝜏𝜎))σ(α) =σGτ1(f(τ)𝜏𝑓(σ))σ(α) = τ1(f(τ)) σGf(σ)σ(α) = τ1(f(τ))z.

Thus,

f(τ) = z τ(z),

so f is the 1-coboundary of z1.

To see how this implies Hilbert’s theorem 90 in the case of finite cyclic extensions, we prove the following result on the cohomology of cyclic groups.

Proposition 12.10.2.

Let G be a finite cyclic group and A be a [G]-module. Then for i 1, we have

Hi(G,A) { AGNGA if i is even, A[NG]IGAif i is odd,

where A[NG] is the kernel of multiplication by NG on A.

Proof.

Let g be a generator of G, and consider the augmented resolution of given by

[G] NG[G] g1[G] NG[G] g1[G] 𝜖 0,

where 𝜖 is the augmentation maps. Note that Hom[G]([G],A)A by evaluation at 1, and the map NG (resp., g1) on [G] induces NG (resp., g1) on A via these isomorphisms. The groups Hi(G,A) are then the cohomology groups of the complex

A g1A NGA g1A ,

which have the desired form.

Remark 12.10.3.

Suppose that LK is finite cyclic with Galois group G having generator σ. Proposition 12.10.2 implies that

H1(G,K×) kerNLK {σ(α)αα L×},

which is trivial by Theorem 12.10.1. This is exactly the statement of Hilbert’s Theorem 90 for finite cyclic extensions.

We next see how we can use Galois cohomology to study Kummer theory.

Proposition 12.10.4.

Suppose that LK is a finite extension with Galois group G. Let n be a positive integer not divisible by the characteristic of K. Then there is an isomorphism

H1(G,μ n)K×L×n K×n ,

where the class of an element a K×L×n in the quotient corresponds to the class of the cocycle

χa(σ) = σ(α) α ,

where α L× with αn = a

Proof.

The short exact sequence

1 μn(L) L×nL×n 1

of G-modules gives rise to a long exact sequence

0 μn(K) K×nK×L×n H1(G,μ n) 0,

where Hilbert’s Theorem 90 gives the final equality. That a K×L×n is sent to the class of χa follows from the definition of the connecting homomorphism by the Snake lemma.

This leads to the following definition.

Definition 12.10.5.

Let n be a positive integer not divisible by the characteristic of K. For a K×, a Kummer cocycle attached to K is a map χa: GK μn given by

χa(σ) = σ(α) α ,

where α (Ksep)× with αn = a.

Remark 12.10.6.

The Kummer cocycle χa in Definition 12.10.5 actually depends on the choice of nth root of a up to a 1-coboundary of an element of μn. If μn K, however, it is unique and is the Kummer character of a. In this case, Proposition 12.10.4 reduces to

Hom(G,μn)ΔK×n,

where Δ = K×L×n. This in turn yields the perfect pairing of Kummer duality.

We next turn to the question of the structure of H2(G,L×) for a finite Galois extension LK with Galois group G. We fix such an extension LK with Galois group G in what follows.

Definition 12.10.7.

A central simple algebra over a field K is a simple K-algebra with center equal to K.

Example 12.10.8.

Any matrix algebra Mn(D) over a division algebra D is a central simple algebra over the center Z(D), which is a field. For instance, if denotes the ring of quaternions, then Mn() is a central simple -algebra.

Proposition 12.10.9.

Let f Z2(G,L×) be a factor set. Let Bf be an L-vector space with basis bσ for g G. Define a multiplication on Bf as the unique binary operation extending the scalar multiplication L×Bf Bf and satisfying

bσα = σ(α)bσ and bσbτ = f(σ,τ)b𝜎𝜏.

for σ,τ G and α L. Then Bf is a central simple K-algebra with identity b1.

Proof.

We have

(bσbτ)bρ = f(σ,τ)(b𝜎𝜏bρ) = f(σ,τ)f(𝜎𝜏,ρ)b𝜎𝜏𝜌 = σ(f(τ,ρ))f(σ,𝜏𝜌)b𝜎𝜏𝜌 = σ(f(τ,ρ))(bσb𝜏𝜌) = bσ(f(𝜏𝜌)b𝜏𝜌) = bσ(bτbρ).

It follows that Bf is an associative L-algebra with K in its center. Note that b1 = 1 in the ring Bf since f(σ,1) = f(1,σ) = 1 for all σ G.

Let β L× generate LK. Let

z =σGασbσ Z(G).

. Then 𝑧𝛽 = 𝛽𝑧, so

σG(ασσ(β)βασ)bg = 0,

and therefore σ(β) = β for all σ G with ασ = 0. Since β is a generator of LK, this forces ασ = 0 for all σ1, so z = α1 K. Thus, Z(Bf) = K.

Next, let I be a nonzero ideal of Bf, and let x Bf be an element with a minimal number k of nonzero coefficients in its expression as an L-linear combination of elements of G. If σ and τ are distinct elements of G for which x has nonzero coefficients, then σ(β)τ(β). Then xτ(β)xβ1 I, but its bτ-coefficient is now zero, while its bσ-coefficient is not, and it has no nonzero coefficients that x does not have. This contradicts the minimality of k, forcing it to be 1. Thus, x = αbσ for some α L×and σ G. But such an x is a unit in Bf, so I = Bf. Thus, Bf is a simple ring.

Definition 12.10.10.

For a factor set f : G L×, the K-algebra Bf of Proposition 12.10.9 is the crossed product algebra of f.

Find in the notes