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 be the set of integers in an interval in . A diagram in a category of the form
is a sequence, where the are defined for and the morphisms are defined for with . We will refer to as the defining interval of the sequence .
Notation 12.1.2. §
In an abelian category, if is a subobject of an object , we write to denote this and for the cokernel of the inclusion morphism . For , we will let denote the image of the composite of the inclusion with .
We are particularly interested in exact sequences.
Definition 12.1.3. §
We say that a diagram
in an abelian category is exact if and the induced monomorphism is an isomorphism.
Definition 12.1.4. §
A sequence with defining interval in an abelian category is exact, or an exact sequence, if the subdiagram
is exact for each .
That is, is exact if and the canonical morphism is an isomorphism for all for which and are defined: we write this more simply as the identification for subobjects of .
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 of definition of has a left (resp., right) endpoint such that , then one can extend to the left (resp., right) by taking for all (resp., ). In fact, we could do this for any sequence for which has an endpoint (without the condition ), 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
- b.
-
A left short exact sequence in is an exact sequence in of the form
- c.
-
A right short exact sequence in is an exact sequence in of the form
Remark 12.1.8. §
To say that
is exact is to say that is a monomorphism, , and is an epimorphism.
Example 12.1.9. §
Multiplication-by- provides a short exact sequence of abelian groups
Remark 12.1.10. §
If is any morphism in an abelian category, then we have an exact sequence
Note that this provides two short exact sequences
since is an isomorphism. We can “splice these back together” to get the -term sequence by taking the composite , which is .
Definition 12.1.11. §
A long exact sequence in an abelian category is an exact sequence .
Frequently, a long exact sequence is expressed in the form
and we can extend it to all integers by setting for all .
Example 12.1.12. §
The sequence
with defined by for is a long exact sequence of -vector spaces. The sequence
of -vector spaces with is also a long exact sequence.
We next study maps between sequences. Let us make a formal definition.
Definition 12.1.13. §
Let and be sequences in a category with defining intervals and , respectively. A morphism of sequences in a category is a collection of morphisms in such that for all .
Remark 12.1.14. §
We can view the condition for a sequence of maps between the terms of sequences and defined at all to be a map of sequences as saying that the diagram
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:
- An arrow from ellipsis (row 1, column 1) to A subscript (i plus 1) (row 1, column 2), without a label.
- 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).
- 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).
- 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).
- An arrow from A subscript (i) (row 1, column 3) to A subscript (i) (row 2, column 3), labelled f subscript (i).
- An arrow from A subscript (i minus 1) (row 1, column 4) to ellipsis (row 1, column 5), without a label.
- 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).
- An arrow from ellipsis (row 2, column 1) to A subscript (i plus 1) (row 2, column 2), without a label.
- 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).
- 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).
- 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
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:
- An arrow from 0 (row 1, column 1) to A, without a label.
- An arrow from A to B, labelled f.
- An arrow from A to A prime, labelled alpha.
- An arrow from B to C, labelled g.
- An arrow from B to B prime, labelled beta.
- An arrow from C to 0 (row 1, column 5), without a label.
- An arrow from C to C prime, labelled gamma.
- An arrow from 0 (row 2, column 1) to A prime, without a label.
- An arrow from A prime to B prime, labelled f prime.
- An arrow from B prime to C prime, labelled g prime.
- 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
such that the resulting diagram
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:
- A blue arrow from kernel alpha to kernel beta, without a label.
- An arrow from kernel alpha to A, without a label.
- A blue arrow from kernel beta to kernel gamma, without a label.
- An arrow from kernel beta to B, without a label.
- An arrow from kernel gamma to C, without a label.
- A curved blue arrow from kernel gamma to cokernel alpha, labelled delta.
- An arrow from 0 (row 3, column 1) to kernel f, without a label.
- A curved blue arrow from kernel f to kernel alpha, without a label.
- An arrow from kernel f to A, without a label.
- An arrow from A to B, labelled f.
- An arrow from A to A prime, labelled alpha.
- An arrow from B to C, labelled g.
- An arrow from B to B prime, labelled beta.
- An arrow from C to 0 (row 3, column 6), without a label.
- An arrow from C to C prime, labelled gamma.
- An arrow from 0 (row 5, column 2) to A prime, without a label.
- An arrow from A prime to B prime, labelled f prime.
- An arrow from A prime to cokernel alpha, without a label.
- An arrow from B prime to C prime, labelled g prime.
- An arrow from B prime to cokernel beta, without a label.
- An arrow from C prime to cokernel gamma, without a label.
- An arrow from C prime to cokernel g prime, without a label.
- An arrow from cokernel g prime to 0 (row 5, column 7), without a label.
- A blue arrow from cokernel alpha to cokernel beta, without a label.
- A blue arrow from cokernel beta to cokernel gamma, without a label.
- 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 . We define as follows. For , find with . Then , so for some . Let denote the image of in . To see that this is well-defined, note that if also satisfies , then , so for some . We then have
so . But has image in , so is well-defined. That is an -module homomorphism follows easily from the construction.
We now check that the other maps are well-defined. Since
we have . Similarly, . Also, if , then we may lift it to , map to , and then project to . This is well-defined as any other choice of differs by some , which causes to change by the image of , which is zero. Thus induces a well-defined homomorphism
Similarly, we have a well-defined surjection
We next check that our sequence is a complex. Note that , so the same is true on , and , so as well. Let . Then is given by considering , lifting it to some , which we may take to be , and projecting to . Hence . On the other hand, if , then is given by definition by projecting to , where , 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 , then implies . Inclusion then provides a map that is by definition injective. If , then there exists with . Since and is injective, we have , or . Hence
and we have exactness at .
If , then whenever and , we have , letting denote the image of . We then have for some , so still satisfies , but . So , and we have exactness at .
If is the image of and , then there exists with . Now
so , and . Hence, we have exactness at .
If is the image of and , then there exists with . Now for some . And has image in . On the other hand, , so for some . If is the image of , then as the image of in . Thus, we have exactness at . Finally, if is the image of with trivial image in , then for some , then the image of satisfies . □
Next, we state another useful result on maps between exact sequences, known as the five lemma.
Theorem 12.2.2 (Five lemma). §
Let
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:
- An arrow from A to B, labelled e.
- An arrow from A to A prime, labelled alpha.
- An arrow from B to C, labelled f.
- An arrow from B to B prime, labelled beta.
- An arrow from C to D, labelled g.
- An arrow from C to C prime, labelled gamma.
- An arrow from D to E, labelled h.
- An arrow from D to D prime, labelled delta.
- An arrow from E to E prime, labelled epsilon.
- An arrow from A prime to B prime, labelled e prime.
- An arrow from B prime to C prime, labelled f prime.
- An arrow from C prime to D prime, labelled g prime.
- 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 . 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 , and note that for some by surjectivity of . Also,
so by injectivity of . By exactness of the top row at , we then have such that . Now,
so by exactness of the bottom row at , there exists such that . As is surjective, there also exists such that . Set . Then
so . 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 in such that for all .
- b.
-
For a chain complex and , the morphism is called the th differential in the complex .
Notation 12.3.2. §
Unless otherwise specified, the th object in a chain complex will be denoted and the th differential by . If we have multiple complexes, we will use to specify the differential on .
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 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
in is short exact if and only if each
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 th homology of a complex in an abelian category is the object
Remark 12.3.10. §
A complex is exact if and only if for all .
Example 12.3.11. §
The complex
of abelian groups has th homology group for every .
Lemma 12.3.12. §
Any morphism of complexes in induces natural morphisms
for each . More specifically, these satisfy
where and are the canonical epimorphisms, and where and are the canonical monomorphisms.
Proof.
We prove this in the case that is a category of -modules. If , then , so . If , then . Thus, the composite map
factors through , inducing the stated map . □
Theorem 12.3.13. §
Let be an abelian category, and let
be a short exact sequence in . There there are morphisms for all , natural in the short exact sequence, that fit into a long exact sequence
Proof.
First, the snake lemma applied to the diagram
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:
- An arrow from 0 (row 1, column 1) to A subscript (i), without a label.
- An arrow from A subscript (i) to B subscript (i), labelled f subscript (i).
- An arrow from A subscript (i) to A subscript (i minus 1), labelled d subscript (i) superscript (A).
- An arrow from B subscript (i) to C subscript (i), labelled g subscript (i).
- An arrow from B subscript (i) to B subscript (i minus 1), labelled d subscript (i) superscript (B).
- An arrow from C subscript (i) to 0 (row 1, column 5), without a label.
- An arrow from C subscript (i) to C subscript (i minus 1), labelled d subscript (i) superscript (C).
- An arrow from 0 (row 2, column 1) to A subscript (i minus 1), without a label.
- An arrow from A subscript (i minus 1) to B subscript (i minus 1), labelled f subscript (i minus 1).
- An arrow from B subscript (i minus 1) to C subscript (i minus 1), labelled g subscript (i minus 1).
- An arrow from C subscript (i minus 1) to 0 (row 2, column 5), without a label.
provides exact sequences
Then, we wish to apply the snake lemma to the diagram
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:
- 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).
- 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).
- An arrow from cokernel d subscript (i plus 1) superscript (B) to cokernel d subscript (i) superscript (C), labelled bar of (g) subscript (i).
- 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).
- An arrow from cokernel d subscript (i) superscript (C) to 0 (row 1, column 5), without a label.
- 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).
- An arrow from 0 (row 2, column 1) to kernel d subscript (i minus 1) superscript (A), without a label.
- 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).
- 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
Note that for , we have
and the morphisms induced by and (resp., and ) on the first (resp., second) of these are just the morphisms and (resp., and ). Our exact sequence then becomes
Taken for all , these yield the long exact sequence. □
Example 12.3.14. §
Consider the complexes , , and of abelian groups with , , and for all and for all and equal to multiplication by for all . Then , , and for all . We have a short exact sequence
for maps induced by multiplication by on each term and given by reduction modulo on each term. The resulting long exact sequence has the form
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 of objects and morphisms such that for all . The morphism is called the th differential of the cochain complex .
We then have the notion of cohomology.
Definition 12.3.16. §
The th cohomology of a cochain complex in an abelian category is the object
Remark 12.3.17. §
Much as with complexes, we can speak of morphisms of cochain complexes , which are collections of morphisms such that for all . Again, short exact sequences
of cochain complexes give rise to long exact sequences in cohomology, but now of the form
Definition 12.3.18. §
Let and be chain complexes. Let be morphisms of chain complexes.
- a.
-
A chain homotopy from to is a sequence of morphisms satisfying
for all .
- b.
-
We say that and are chain homotopic, and write , if there exists a homotopy from to .
- c.
-
If is (chain) homotopic to , then is said to be null-homotopic.
Remark 12.3.19. §
For cochain complexes and and morphisms , a chain homotopy from to is a sequence of morphisms such that .
The morphisms defining a null-homotopy fit into a diagram
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:
- An arrow from ellipsis (row 1, column 1) to A subscript (i plus 1), without a label.
- An arrow from A subscript (i plus 1) to A subscript (i), labelled d subscript (i plus 1) superscript (A).
- An arrow from A subscript (i plus 1) to B subscript (i plus 1), labelled f subscript (i plus 1).
- An arrow from A subscript (i) to A subscript (i minus 1), labelled d subscript (i) superscript (A).
- An arrow from A subscript (i) to B subscript (i), labelled f superscript (i).
- An arrow from A subscript (i) to B subscript (i plus 1), labelled s subscript (i).
- An arrow from A subscript (i minus 1) to ellipsis (row 1, column 5), without a label.
- An arrow from A subscript (i minus 1) to B subscript (i minus 1), labelled f subscript (i minus 1).
- An arrow from A subscript (i minus 1) to B subscript (i), labelled s subscript (i minus 1).
- An arrow from ellipsis (row 2, column 1) to B subscript (i plus 1), without a label.
- An arrow from B subscript (i plus 1) to B subscript (i), labelled d subscript (i plus 1) superscript (B).
- An arrow from B subscript (i) to B subscript (i minus 1), labelled d subscript (i) superscript (B).
- An arrow from B subscript (i minus 1) to ellipsis (row 2, column 5), without a label.
Proposition 12.3.20. §
Assume that and are chain homotopic morphisms . Then the morphisms and on homology are equal for all .
Definition 12.3.21. §
A morphism of complexes is a homotopy equivalence if there exists a morphism such that and .
12.4. Projective and injective objects
We continue to work in an abelian category .
Definition 12.4.1. §
- a.
-
We say that an epimorphism is split if there exists a morphism with . In this case, we say that is a splitting of .
- b.
-
We say that a monomorphism is split if there exists a morphism with . In this case, we say that is a splitting of .
- c.
-
We say that a short exact sequence
(12.4.1) splits if there exists an isomorphism with and for all and .
Example 12.4.2. §
The exact sequence of abelian groups
is split, but
is not.
Proposition 12.4.3. §
The following conditions on a short exact sequence
are equivalent:
- The sequence splits.
- The monomorphism splits.
- The epimorphism splits.
Proof.
We prove this in the category of -modules.
-
Suppose we have a splitting map . Then define by where . This is well-defined as is injective, and such an exists since
It splits as
the latter step using the fact that , which follows in turn from
- Suppose that we have a splitting map . Then define by where . To see this is well defined, note that for any .
-
Define . Its inverse is . To see this, we check that
for and , and note that
for . Set , so that , and let be such that . Then
- Set . Then .
Definition 12.4.4. §
An object of an abelian category is projective if for epimorphism and every morphism , there exists an morphism such that .
Remark 12.4.5. §
The property of being projective is represented by the existence of in the commutative diagram
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:
- An arrow from P to C, labelled g.
- A dashed arrow from P to B, labelled f.
- An arrow from B to C, labelled pi.
- An arrow from C to 0, without a label.
with exact lower row.
Proposition 12.4.6. §
Free -modules are projective.
Proof.
Let be a free -module with basis . Let be a surjective -module homomorphism, and suppose that is an -module homomorphism. For each , let be an element of such that . Since is free, we may defined by for each . Then for all , so as generates . □
Example 12.4.7. §
Not every projective module need be free. For example, consider . We claim that is a projective -module. To see this, suppose that is a -module and is surjective. Take any with . Then the submodule generated by is isomorphic to , and hence defines a splitting of .
Note that is not projective as a -module (abelian group) since the quotient map 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 -module are equivalent:
- i.
-
is projective,
- ii.
-
every surjection of -modules is split, and
- iii.
-
is a direct summand of a free -module.
Proof.
If is projective and is a surjection, then the identity map lifts to a homomorphism such that , so (i) implies (ii). If (ii) holds, then choose a set of generators of , and let be the free -module on , which comes equipped with a surjection that restricts to . This surjection is split, so is a direct summand of by Proposition 12.4.3, and therefore (iii) holds.
If is a direct summand of a free module with complement , then is a surjection, and is a homomorphism of -modules, then we can extend to by setting for all . We then have such that by the projectivity of , and the restriction satisfies . Thus, (iii) implies (i). □
Example 12.4.9. §
For , the left -module of column vectors under left multiplication is a direct summand of , which is isomorphic to as a left -module. Hence, is projective, though it is not free for .
In the case that is a principal ideal domain, we have the following.
Corollary 12.4.10. §
If is a principal ideal domain, then every projective -module is free.
Proof.
By the classification of finitely generated modules over a principal ideal domain, it suffices for finitely generated -modules to show that any -module of the form
for nonzero and nonunit is not projective. Consider the obvious quotient map . That it splits means that each splits. Then for some , which means that is free of rank 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 in an abelian category is injective if for every monomorphism and every morphism , there exists a morphism such that .
Remark 12.4.12. §
The property of being injective is represented by the existence of in the commutative diagram
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:
- An arrow from 0 to A, without a label.
- An arrow from A to I, labelled f.
- An arrow from A to B, labelled iota.
- 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 -module is injective if and only if every monomorphism is split.
We also have the following interesting criterion, which employs Zorn’s lemma.
Proposition 12.4.14 (Baer’s criterion). §
A left -module is injective if and only if every homomorphism with a left ideal of may be extended to a map .
Proof.
Let be an -submodule of an -module and be an -module homomorphism. It suffices to show that we can extend to with . Let be the set of pairs with an -submodule of containing and an -module homomorphism. We have a partial ordering on given by if is contained in and . Given a chain in , we have an upper bound with such that if for , then . By Zorn’s lemma, has a maximal element .
Suppose first that , and let . Consider the left ideal
of . Define by for . This -module homomorphism may be extended to by assumption. Then define and let be the unique -module homomorphism such that and for all . This exists as , and for . (Also, if , then , so in this instance.) The existence of gives a contradiction of the maximality of . Thus , and we are done. □
Example 12.4.15. §
- a.
-
is an injective -module.
- b.
-
is an injective -module for any .
- c.
-
is an injective -module, but not an injective -module.
We have a very nice description of injective objects in .
Definition 12.4.16. §
An abelian group is called divisible if multiplication by is surjective on for every natural number .
Proposition 12.4.17. §
An abelian group is injective if and only if it is divisible.
Proof.
Let be injective, and take . Then there exists a group homomorphism with . We also have the multiplication-by- map on , which is injective. By injectivity of , we have a map with . Then , so is divisible.
Conversely, let be divisible. By Baer’s criterion, it suffices to show that every homomorphism with extends to a homomorphism . Such a is determined by . Let be such that . Set . □
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 be an additive functor of abelian categories.
- a.
-
We say that is left exact if for every left short exact sequence in , the sequence is exact in .
- b.
-
We say that is right exact if for every right short exact sequence in , the sequence is exact in .
- c.
-
We say that is an exact functor if for every short exact sequence in , the sequence is exact in .
Remark 12.5.2. §
A contravariant additive functor is left exact if the resulting covariant functor is left exact.
Example 12.5.3. §
The functor by with 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 be an additive functor of abelian categories. The following are equivalent:
- i.
-
is exact,
- ii.
-
is both left and right exact,
- iii.
-
preserves all three-term exact sequences , and
- iv.
-
preserves all exact sequences.
Proof.
It is immediate that (iv) implies the other statements and also that (ii) implies (i).
Suppose that that preserves all three-term exact sequences. To say that
is short exact is equivalent to saying that the three three-term sequences , , and are all exact. Since exactness of these is preserved by , so is exactness of the original short exact sequence. So, (iii) implies (i).
If is an exact functor, take any exact sequence . Then is short exact, so
is exact as well. It follows that image and kernel for all , so we have
Thus, 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 (and ) 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 be an object of .
Proof.
Let
be an exact sequence in . Applying , we obtain homomorphisms
of abelian groups, and we claim this sequence is exact. If , then , but is a monomorphism, so . Since is a functor, we have , and if , then . Naturality of the kernel implies that factors through a morphism . But we have canonical isomorphisms
the first as is a monomorphism, and the composite of the composite of these with the canonical morphism is . Therefore, we obtain a morphism satisfying . This proves part a, and part b is just part a with replaced by . □
Lemma 12.5.8. §
Let be a ring, and let be a right -module. The tensor product functor given on objects by and on morphisms by is right exact.
Proof.
Since tensor products commute with direct sums, is additive. Let
be a right short exact sequence of -modules. The group is generated by simple tensors with and and
for any with , we have that is surjective. We need then only define an inverse to the surjection . For this, we consider the map given on by picking with and then setting . If , then , so for some , and then , so is well-defined and then easily seen to be biadditive and -balanced. The induced map is inverse to by definition. □
Lemma 12.5.9. §
Let be an abelian category. A sequence
is exact if every sequence
is exact.
Proof.
For , we get
so we have a monomorphism . For and the natural monomorphism defined by the kernel, we have , so there exists with . We then have that factors a morphism inverse to . □
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 be an additive functor of abelian categories that admits a left adjoint . Suppose that
is a left exact sequence in . Then for any , the sequence
is left exact. Since is left adjoint to , this sequence is isomorphic to
as a sequence of abelian groups. Since this holds for all , the sequence
is exact. □
Proposition 12.5.11. §
Let be a ring, and fix an -module .
Proof.
We prove part a. Suppose that the functor is exact. Then for any epimorphism we have an epimorphism
and any inverse image of is the desired splitting map of .
On the other hand, suppose that is projective. Consider an exact sequence
Then we have a diagram
That this is a complex is immediate. Surjectivity of follows immediately from the definition of a projective module. Finally, let , so . Then is an epimorphism, and we have by projectivity of a map with with , i.e., . □
Remark 12.5.12. §
If is a commutative ring, then for -modules and may be viewed as an -module under . It follows easily that is an additive functor from the category of -modules to itself which is exact if 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 -modules for any in an arbitrary abelian category.
Theorem 12.5.13 (Freyd-Mitchell). §
If is a small abelian category, then there exists a ring and an exact, fully faithful functor -mod.
In other words, is equivalent to a full, abelian subcategory of for some ring . We can use this as follows: suppose there is a result we can prove about exact diagrams in -modules for all , 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 -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 be an object in .
- a.
-
A resolution of is a complex of objects in together with an augmentation morphism such that the augmented complex
is exact.
- b.
-
A projective resolution of is a resolution of 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 , there exists a projective object and an epimorphism .
Since free modules are projective, 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
- b.
-
Consider , and let . Then we have a projective resolution
- c.
-
Consider the ring . (This is isomorphic to the group ring .) We have a projective resolution of :
where .
Proposition 12.6.5. §
Let and be projective resolutions in an abelian category, and suppose that is an -module homomorphism. Then extends to a morphism of chain complexes such that
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:
- An arrow from ellipsis (row 1, column 1) to P subscript (2), without a label.
- An arrow from P subscript (2) to P subscript (1), without a label.
- An arrow from P subscript (2) to Q subscript (2), labelled f subscript (2).
- An arrow from P subscript (1) to P subscript (0), without a label.
- An arrow from P subscript (1) to Q subscript (1), labelled f subscript (1).
- An arrow from P subscript (0) to A, without a label.
- An arrow from P subscript (0) to Q subscript (0), labelled f subscript (0).
- An arrow from A to B, labelled g.
- An arrow from A to 0 (row 1, column 6), without a label.
- An arrow from ellipsis (row 2, column 1) to Q subscript (2), without a label.
- An arrow from Q subscript (2) to Q subscript (1), without a label.
- An arrow from Q subscript (1) to Q subscript (0), without a label.
- An arrow from Q subscript (0) to B, without a label.
- An arrow from B to 0 (row 2, column 6), without a label.
commutes. Furthermore, any other lift of is chain homotopic to .
Proof.
Let and , and let and denote the respective augmentation maps. Then . Since is an epimorphism, we have a map lifting . Now induces a map
and since and , we have an epimorphism , and we again use projectivity, this time of , to lift to a map as in the diagram. We continue in this manner to obtain .
Now, for uniqueness up to chain homotopy, it suffices to show that if , then is chain homotopic to zero. Well, , so . By projectivity of , we have with
where we have set for (and for ). Now satisfies
so . Thus, we have lifting , i.e., so that
as desired. We continue in this fashion to obtain all . □
Proposition 12.6.6 (Horseshoe lemma). §
Suppose that
is a short exact sequence in an abelian category and that and are projective resolutions of and respectively. Then there exists a projective resolution of with for each and such that the diagram
Diagram description: The horseshoe lemmaThe 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:
Arrows and lines:
| (12.6.1) |
commutes, where and are the natural maps on each term.
Proof.
Choose a lift of to , and let
Then is clearly surjective, and we have the desired commutativity of the “first two” squares. Next, letting denote the boundary maps with , , we may define the boundary map for similarly. That is, consider a lift of to a map , and define
Then maps onto and makes the next two squares commute. We then continue in this fashion. □
Lemma 12.6.7. §
Let be an abelian category and a split long exact sequence of projectives with for . Then is a projective object in .
Proof.
Let be a split exact sequence of projectives in . In other words, we may write each and for , where is a projective object in , and the morphism is simply the composition of the projection with the inclusion . Suppose that is a epimorphism of complexes. Since is projective, there exists a splitting of the composition of with projection to . Then
is a splitting of . Since 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 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 be a functor that is left adjoint to an exact functor . Then preserves projectives.
Proof.
Let be a projective object in . Let be a epimorphism in . We must show that is an epimorphism. Note that we have a commutative diagram
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:
- An arrow from Hom subscript (script C)(P,G(A)) to Hom subscript (script C)(P,G(B)), labelled h subscript (P)(G(f)).
- An arrow from Hom subscript (script C)(P,G(A)) to Hom subscript (script D)(F(P),A), labelled isomorphism symbol.
- An arrow from Hom subscript (script C)(P,G(B)) to Hom subscript (script D)(F(P),B), labelled isomorphism symbol.
- 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 tells us that is an epimorphism, and the upper horizontal map is then an epimorphism by the projectivity of , hence the result. □
12.7. Derived functors
Suppose that is a right exact functor between abelian categories and and that has enough projectives. Then we could try to define the th left derived functor of (for ) on an object of by , where is a projective resolution of . 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 , but it is often the case that is some other category, like or -mod for some ring .
Proposition 12.7.1. §
Let be an additive functor between abelian categories and . For , there are functors given on by for a projective resolution of and given on in by for and projective resolutions and a morphism of complexes compatible with the augmentations to and . 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 is independent of the choice of , since any two choices are chain homotopic. In particular, given any two choices of and of projective resolutions of , and any choices of augmenting the identity morphism on gives rise to morphisms on cohomology, the resulting maps and must be mutually inverse, since and augment the identity on , as to the identity morphisms on and . Thus, is unique up to unique isomorphism, so is well-defined (up to unique isomorphism), and . Similarly, it is easy to check that the uniqueness also implies that is compatible with compositions. □
Definition 12.7.2. §
For an additive functor , the th left derived functor of 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 be a right exact functor of abelian categories. Then we have a canonical, natural isomorphism of functors.
Proof.
Since is right exact, the sequence
is exact. Hence, we have
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 is a projective object, then for .
Proof.
Consider the projective resolution that is in degree zero and elsewhere, where the augmentation map is the identity. This has the desired homology. □
Next, we prove that the are functors.
Proposition 12.7.5. §
To each morphism in , we can associate morphisms
for all in such a way that becomes a functor and . Furthermore, each is additive.
Proof.
The unique morphism 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 is induced by the zero morphism of chain complexes and hence is is zero map on . Similarly , for , 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 of abelian categories, the functor is called th left derived functor of .
We see that and are canonically naturally isomorphic functors.
Definition 12.7.7. §
A homological -functor is a sequence of additive functors for , together with, for every exact sequence
in , morphisms fitting in a long exact sequence
which are natural in the sense that if we have a morphism of short exact sequences in ,
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:
- An arrow from 0 (row 1, column 1) to A, without a label.
- An arrow from A to B, without a label.
- An arrow from A to A prime, without a label.
- An arrow from B to C, without a label.
- An arrow from B to B prime, without a label.
- An arrow from C to 0 (row 1, column 5), without a label.
- An arrow from C to C prime, without a label.
- An arrow from 0 (row 2, column 1) to A prime, without a label.
- An arrow from A prime to B prime, without a label.
- An arrow from B prime to C prime, without a label.
- An arrow from C prime to 0 (row 2, column 5), without a label.
then we obtain a morphism of long exact sequences in ,
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:
- An arrow from ellipsis (row 1, column 1) to F subscript (i)(A), without a label.
- An arrow from F subscript (i)(A) to F subscript (i)(B), without a label.
- An arrow from F subscript (i)(A) to F subscript (i)(A prime ), without a label.
- An arrow from F subscript (i)(B) to F subscript (i)(C), without a label.
- An arrow from F subscript (i)(B) to F subscript (i)(B prime ), without a label.
- An arrow from F subscript (i)(C) to F subscript (i minus 1)(A), without a label.
- An arrow from F subscript (i)(C) to F subscript (i)(C prime ), without a label.
- An arrow from F subscript (i minus 1)(A) to ellipsis (row 1, column 6), without a label.
- An arrow from F subscript (i minus 1)(A) to F subscript (i minus 1)(A prime ), without a label.
- An arrow from ellipsis (row 2, column 1) to F subscript (i)(A prime ), without a label.
- An arrow from F subscript (i)(A prime ) to F subscript (i)(B prime ), without a label.
- An arrow from F subscript (i)(B prime ) to F subscript (i)(C prime ), without a label.
- An arrow from F subscript (i)(C prime ) to F subscript (i minus 1)(A prime ), without a label.
- 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 , by and
for any abelian group , and set otherwise. Given an exact sequence
in , we obtain a long exact sequence
from the snake lemma applied to the diagram
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:
- An arrow from 0 (row 1, column 1) to A (row 1, column 2), without a label.
- An arrow from A (row 1, column 2) to B (row 1, column 3), without a label.
- An arrow from A (row 1, column 2) to A (row 2, column 2), labelled dot p.
- An arrow from B (row 1, column 3) to C (row 1, column 4), without a label.
- An arrow from B (row 1, column 3) to B (row 2, column 3), labelled dot p.
- An arrow from C (row 1, column 4) to 0 (row 1, column 5), without a label.
- An arrow from C (row 1, column 4) to C (row 2, column 4), labelled dot p.
- An arrow from 0 (row 2, column 1) to A (row 2, column 2), without a label.
- An arrow from A (row 2, column 2) to B (row 2, column 3), without a label.
- An arrow from B (row 2, column 3) to C (row 2, column 4), without a label.
- 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
in , there exist morphisms such that the functors together with the maps form a homological -functor.
Proof.
By the Horseshoe lemma, we have a projective resolution for , , fitting in a diagram (12.6.1). Now, applying to the resolutions, we have split exact sequences
for each . The resulting exact sequence of complexes (which need not be split) yields a long exact sequence in homology
as desired.
It remains to check naturality. Consider a morphism of short exact sequences
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:
- An arrow from 0 (row 1, column 1) to A, without a label.
- An arrow from A to B, labelled f.
- An arrow from A to A prime, labelled q superscript (A).
- An arrow from B to C, labelled g.
- An arrow from B to B prime, labelled q superscript (B).
- An arrow from C to 0 (row 1, column 5), without a label.
- An arrow from C to C prime, labelled q superscript (C).
- An arrow from 0 (row 2, column 1) to A prime, without a label.
- An arrow from A prime to B prime, labelled f prime.
- An arrow from B prime to C prime, labelled g prime.
- An arrow from C prime to 0 (row 2, column 5), without a label.
By Proposition 12.6.5, can extend and to maps of complexes and . Suppose we have constructed and via the Horseshoe lemma. We fit this all into a commutative diagram
Diagram description: Maps between horseshoe resolutionsThe structural squares and triangles displayed here commute. Objects, listed by row and column:
Arrows and lines:
| (12.7.1) |
We also have splitting maps and for each (and, similarly, maps and ). For each , let us denote the augmentation map by .
We must define a map making the entire diagram (12.7.1) commute. We first note that
Hence, there exists a map with
Since is an epimorphism, we may choose with . Now set
The trickiest check of commutativity is that . We write this mess out:
The other are defined similarly. For instance, one can see there exists a map such that
and we set
□
Definition 12.7.10. §
A (homological) universal -functor is a -functor with such that if is any other -functor with for which there exists a natural transformation , then extends uniquely to a morphism of -functors, i.e., a sequence of natural transformations such that
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:
- An arrow from G subscript (i)(C) to F subscript (i)(C), labelled ( eta subscript (i)) subscript (C).
- An arrow from G subscript (i)(C) to G subscript (i minus 1)(A), labelled delta prime subscript (i).
- An arrow from G subscript (i minus 1)(A) to F subscript (i minus 1)(A), labelled ( eta subscript (i minus 1)) subscript (A).
- 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 :
(That is, we get a morphism of the associated long exact sequences.)
The -functor of left derived functors of is universal, which will follow as a corollary of Theorem 12.7.14 below.
Theorem 12.7.11. §
The -functor is universal.
Definition 12.7.12. §
Let be a left exact functor between abelian categories. We say that an object in is -acyclic if for all .
Note that the for any may be computed using resolutions by -acyclic objects, as opposed to just projectives.
Proposition 12.7.13. §
Let be a left exact functor between abelian categories, and let be an object of . Suppose that is a resolution of by -acyclic objects. Then for each .
Proof.
Note that we have an exact sequence
so . Set . We then have an exact sequence
which yields
We also have isomorphisms for each .
For , set . The exact sequences
then yield isomorphisms used in the following for :
□
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 form a -functor and for every projective and . Then is universal.
Proof.
Suppose that is another -functor and that we have a natural transformation . Let and let be an epimorphism with projective. Let . Let , and suppose that we have constructed a natural transformation . Since is projective, we have a commutative diagram
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:
- An arrow from G subscript (i)(A) to G subscript (i minus 1)(K), without a label.
- A dashed arrow from G subscript (i)(A) to F subscript (i)(A), without a label.
- An arrow from G subscript (i minus 1)(K) to G subscript (i minus 1)(P), without a label.
- An arrow from G subscript (i minus 1)(K) to F subscript (i minus 1)(K), without a label.
- An arrow from G subscript (i minus 1)(P) to F subscript (i minus 1)(P), without a label.
- An arrow from 0 to F subscript (i)(A), without a label.
- An arrow from F subscript (i)(A) to F subscript (i minus 1)(K), without a label.
- An arrow from F subscript (i minus 1)(K) to F subscript (i minus 1)(P), without a label.
The morphism is the unique map which makes the diagram commute.
Now let be a morphism in . We create a diagram as 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:
- An arrow from 0 (row 1, column 1) to K, without a label.
- An arrow from K to P, without a label.
- An arrow from K to K prime, without a label.
- An arrow from P to A, without a label.
- An arrow from P to P prime, without a label.
- An arrow from A to 0 (row 1, column 5), without a label.
- An arrow from A to B, labelled f.
- An arrow from 0 (row 2, column 1) to K prime, without a label.
- An arrow from K prime to P prime, without a label.
- An arrow from P prime to B, without a label.
- An arrow from B to 0 (row 2, column 5), without a label.
by taking to be projective, to be any projective with an epimorphism to the pullback of the diagram , and and to be the relevant kernels. We then have a diagram
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:
- An arrow from G subscript (i)(A) to G subscript (i minus 1)(K), without a label.
- An arrow from G subscript (i)(A) to F subscript (i)(A), without a label.
- An arrow from G subscript (i)(A) to G subscript (i)(B), without a label.
- An arrow from G subscript (i minus 1)(K) to F subscript (i minus 1)(K), without a label.
- An arrow from G subscript (i minus 1)(K) to G subscript (i minus 1)(K prime ), without a label.
- An arrow from F subscript (i)(A) to F subscript (i minus 1)(K), without a label.
- An arrow from F subscript (i)(A) to F subscript (i)(B), without a label.
- An arrow from F subscript (i minus 1)(K) to F subscript (i minus 1)(K prime ), without a label.
- An arrow from G subscript (i)(B) to G subscript (i minus 1)(K prime ), without a label.
- An arrow from G subscript (i)(B) to F subscript (i)(B), without a label.
- An arrow from G subscript (i minus 1)(K prime ) to F subscript (i minus 1)(K prime ), without a label.
- 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 . 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 of a right exact functor and any -functor with for projective and .
We next wish to study right derived functors of left exact functors.
Definition 12.7.15. §
An injective resolution of an object of an abelian category is a cochain complex of injective objects with for and a morphism such that the resulting diagram
is exact.
Definition 12.7.16. §
We say that an abelian category has enough (or sufficiently many) injectives if for every , there exists an injective object and a monomorphism .
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 has enough injectives.
Proof.
First take the case that . Let be an abelian group, and write it as a quotient of a free abelian group
for some indexing set and submodule of . Then we may embed in
which is divisible as a quotient of a divisible group.
Next, let be a left -module. We have an injection of left -modules,
by . Now, embed in a divisible group , so that the resulting map
is an injection. The proof that is an injective -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 is a left exact functor between abelian categories and that has enough injectives. For each , we define additive functors by
where is any injective resolution of and, for in , by
to be the map on homology induced by any morphism of chain complexes extending , where and are injective resolutions. We have . The functors are called the right-derived functors of .
Definition 12.7.19. §
A cohomological -functor is a sequence of additive functors for , together with, for every exact sequence
in , morphisms fitting in a long exact sequence
which are natural in the sense that if we have a morphism of short exact sequences in ,
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:
- An arrow from 0 (row 1, column 1) to A, without a label.
- An arrow from A to B, without a label.
- An arrow from A to A prime, without a label.
- An arrow from B to C, without a label.
- An arrow from B to B prime, without a label.
- An arrow from C to 0 (row 1, column 5), without a label.
- An arrow from C to C prime, without a label.
- An arrow from 0 (row 2, column 1) to A prime, without a label.
- An arrow from A prime to B prime, without a label.
- An arrow from B prime to C prime, without a label.
- An arrow from C prime to 0 (row 2, column 5), without a label.
then we obtain a morphism of long exact sequences in ,
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:
- An arrow from ellipsis (row 1, column 1) to F superscript (i)(A), without a label.
- An arrow from F superscript (i)(A) to F superscript (i)(B), without a label.
- An arrow from F superscript (i)(A) to F superscript (i)(A prime ), without a label.
- An arrow from F superscript (i)(B) to F superscript (i)(C), without a label.
- An arrow from F superscript (i)(B) to F superscript (i)(B prime ), without a label.
- An arrow from F superscript (i)(C) to F superscript (i plus 1)(A), without a label.
- An arrow from F superscript (i)(C) to F superscript (i)(C prime ), without a label.
- An arrow from F superscript (i plus 1)(A) to ellipsis (row 1, column 6), without a label.
- An arrow from F superscript (i plus 1)(A) to F superscript (i plus 1)(A prime ), without a label.
- An arrow from ellipsis (row 2, column 1) to F superscript (i)(A prime ), without a label.
- An arrow from F superscript (i)(A prime ) to F superscript (i)(B prime ), without a label.
- An arrow from F superscript (i)(B prime ) to F superscript (i)(C prime ), without a label.
- An arrow from F superscript (i)(C prime ) to F superscript (i plus 1)(A prime ), without a label.
- 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 is universal if there exists a unique extension of any natural transformation , where is another -functor, to a morphism of -functors.
Theorem 12.7.21. §
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 for on complexes in nonnegative degrees together with the connecting homomorphisms 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 . If we apply the functor to the exact sequence of abelian groups for some , we obtain the right, but not left, exact sequence
If we apply to the same exact sequence, we obtain the left, but not right, exact sequence
noting that .
Definition 12.8.2. §
A right -module is -flat, or just flat, if the tensor product functor is exact.
Remarks 12.8.3. §
Proposition 12.8.4. §
Projective right -modules are -flat.
Proof.
Let be a projective -module, and let be a complement in a free -module on a basis . Let be an injection of -modules. We have a commutative diagram
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:
- A hooked arrow from P tensor subscript (R) A to F tensor subscript (R) A, without a label.
- An arrow from P tensor subscript (R) A to P tensor subscript (R) B, labelled id subscript (P) tensor f.
- A hooked arrow from P tensor subscript (R) B to F tensor subscript (R) B, without a label.
- An arrow from F tensor subscript (R) A to F tensor subscript (R) B, labelled id subscript (F) tensor f.
- An arrow from F tensor subscript (R) A to direct sum subscript (x in X) A, labelled isomorphism symbol.
- An arrow from F tensor subscript (R) B to direct sum subscript (x in X) B, labelled isomorphism symbol.
- 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 is injective, so is the lowermost vertical map. Since is a direct sum of , the map
is injective, and similarly with replaced by . Thus, commutativity of the diagram yields the injectivity . Since left tensor product with 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 be a PID. An -module is flat if and only if is -torsion-free.
Proof.
Let be a flat -module. Let be a nonzero element, and let be the injective map for . The tensor product map is injective as is -flat. Under the identification of Corollary 8.4.24, determined by , the map becomes identified with the map that is left multiplication by . Since is then injective for every nonzero , we see that has no nonzero -torsion.
Next, let be -torsion free. It is the union (which is also the direct limit) of its finitely generated, necessarily torsion-free -submodules. We omit here a check of the fact that direct limits and tensor products commute. Given this, we may assume that is finitely generated, in which case it follows from Proposition 12.8.5 that 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 are -free.
Definition 12.8.7. §
Let and be rings, and let be an --bimodule. For , the th -functor
is the th left derived functor of .
Remark 12.8.8. §
If is a commutative ring, then an -module provides functors
since -modules are automatically --bimodules.
Remark 12.8.9. §
As for any projective resolution of by -modules, the composition of the functor
with the forgetful functor agrees with the functor
hence the omission of the notation for in the definition of .
Example 12.8.10. §
In , consider the projective resolution
of . Computing the homology of , we obtain
Lemma 12.8.11. §
Let be a ring. The following conditions on a right -module are equivalent:
- i.
-
is flat,
- ii.
-
,
- iii.
-
for all .
Proof.
Clearly, (iii) implies (ii). If
is an exact sequence of right -modules, then we have a long exact sequence for any -module that ends with
from which it is clear that (ii) implies (i).
Finally, if (i) holds and is a projective resolution of in , then the complex
is exact by the flatness of . It follows that
for all . □
Proposition 12.8.12. §
Let be a right -module and a left -module. Let be a resolution of by projective right -modules. Then
for all . In particular, the functors are the left derived functors of -tensor product with .
Proof.
We sketch a proof. Form projective resolutions and . We then have a double complex , and we can consider homology of the total complex
where the boundary maps from each term are given by the sums
We claim that the homology of this chain complex is isomorphic to the homology of the complexes and , from which the lemma follows.
We have maps of complexes
| (12.8.1) |
and
| (12.8.2) |
induced by augmentation morphisms (up to sign, and zero maps otherwise). The double complex (i.e., with in the -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 be commutative. We have for all -modules , and .
We now give an alternate proof of Proposition 12.8.12.
Proof.
Let be a projective resolution of by right -modules. Suppose that
is an exact sequence. Then
is exact. This yields a long exact sequence in homology of the form
so the functors do in fact form a -functor. Futhermore, since any projective right -module is flat, we have that for all . By Theorem 12.7.14, it follows that the are a universal -functor extending . 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 can be computed via a flat resolution of either or .
The following explains something more of the name “Tor”.
Lemma 12.8.15. §
The functor if and only if 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 by finding a projective resolution of . Say
with and the . Then we have a projective resolution of the form
Tensoring with and computing , we obtain . This will always be trivial if and only if . □
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 . Then the exact sequence
is a free resolution of . Let be the ideal of , so . Then we have isomorphisms
Thus is not flat as an -module, even though it is torsion-free.
Here is another class of examples.
Lemma 12.8.17. §
Let be a subset of that is multiplicatively closed. Then the localization is a flat -module.
Proof.
Recall that we have natural isomorphisms for -modules . Suppose that is an injection of -modules. Then we obtain an induced -module homomorphism , which we must show is an injection. Suppose . Then
so . □
Definition 12.8.18. §
Let and be rings, and let be an --bimodule. For , the th -functor
is the th right derived functors of .
Example 12.8.19. §
For , we may consider the injective resolution
of . For any abelian group , we write . We must compute the cohomology of . This yields
One has that for all and all if is a projective module, as follows from the exactness of . 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 , where is any projective resolution of .
We end with a characterization of in terms of extensions.
Definition 12.8.21. §
An extension of an -module by an -module is an exact sequence , where is an -module. Two extensions of by are called equivalent if there is an isomorphism of exact sequences between them that is the identity on and .
Note that all split extensions (i.e., those with split exact sequences) are split.
Example 12.8.22. §
There are equivalence classes of extensions of by as -modules:
with , and
Theorem 12.8.23. §
There is a one-to-one correspondence between equivalence classes of extensions of by and .
Proof.
Suppose that is an equivalence class of extensions of by , represented by an exact sequence
| (12.8.3) |
We then have an exact sequence
and we set . This is clearly independent of the choice of representative.
Conversely, suppose . Fix an exact sequence
with projective. We then have an exact sequence
Let with . Let be the pushout
We have a commutative diagram
Diagram description: Constructing an extension by a pushoutThe two displayed rows are exact, and the squares commute. Objects, listed by row and column:
Arrows and lines:
| (12.8.4) |
Here, the map is defined by universality of the pushout (via the map and the zero map ). We define to be the equivalence class of the extension given by the lower row. Though it is not immediately clear that this is independent of the choice of with , this follows if we can show that and as constructed are mutually inverse.
To see that , set , again choosing any with . The diagram
Diagram description: Naturality of the extension connecting homomorphismThe structural squares and triangles displayed here commute. Objects, listed by row and column:
Arrows and lines:
| (12.8.5) |
commutes. Hence, we have
as desired.
On the other hand, suppose given with exact sequence (12.8.3). By projectivity of , the map lifts to a map . Hence, we have a diagram as in (12.8.4). Furthermore, the map in the diagram (12.8.4) satisfies by the commutativity of (12.8.5). Now, there exists a map by universality of the pushout, and it is the identity on and , hence an isomorphism by the -lemma. It follows by construction that
□
12.9. Group cohomology
In this section, we let denote a group.
Definition 12.9.1. §
The augmentation map is the unique ring homomorphism with for all .
Definition 12.9.2. §
The augmentation ideal of is the kernel of the augmentation map.
Lemma 12.9.3. §
The augmentation ideal is generated by .
Proof.
We have
For , we have
□
Definition 12.9.4. §
Let be an -module.
- a.
-
The -invariant group of is the -module
the maximal -submodule of on which all elements of act trivially.
- b.
-
The -coinvariant group of is the -module , the maximal -quotient of on which all elements of act trivially.
Examples 12.9.5. §
- a.
-
If we view as a -trivial module, we have and .
- b.
-
We have via the augmentation map, and
where is the norm element in a finite group . The computation of the invariant group follows from the fact that the action of on itself by left multiplication is transitive, so for an element of to be -fixed, its coefficients must all be equal.
- c.
-
Let be a finite Galois extension of fields, and let . Then and .
Example 12.9.6. §
For , let act on by
for and . This action is -bilinear so it gives the structure of a left -module. Then 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, , with the isomorphism induced by the -linear map taking each to .
Remark 12.9.7. §
We have a left exact invariant functor as a functor , with the map on homomorphisms being the restriction to invariant subgroups. This functor is naturally isomorphic to the functor , where is viewed as the trivial -module. In particular
for is a natural isomorphism. Thus, the invariant factor is left exact.
Similarly, defines a right exact coinvariant functor which is isomorphic to the functor , in that we have natural isomorphisms
In particular, the coinvariant functor is right exact.
Definition 12.9.8. §
- a.
-
The cohomology of is the -functor given by the right derived functors of the -invariant functor. The th cohomology group of with coefficients in a -module is .
- b.
-
The homology of is the -functor given by the left derived functor of the -coinvariant functor. The th homology group of with coefficients in a -module is .
Remark 12.9.9. §
By definition, we have natural isomorphisms
for and -modules .
Let us give a more explicit description of group cohomology.
Definition 12.9.10. §
The bar resolution of as a -module is the complex with for , differentials given on by
and augmentation the augmentation map.
Remark 12.9.11. §
As follows from Remark 12.9.9, the group is the th cohomology group of the complex
with in degree . Similarly, is the th homology group of the complex
with in degree .
There is another complex which computes the cohomology of , that of the inhomogeneous -cocycles, which has a more complicated differential but is more amenable to computation.
Definition 12.9.12. §
Let be a -module, and let .
- a.
-
The group of -cochains of with coefficients in is the set of functions from to :
- b.
-
The th differential is the map
We remark that is taken simply to be , as is a singleton set. The proof of the following, which tells us that is a cochain complex, is left to the reader.
Lemma 12.9.13. §
For any , one has .
We consider the cohomology groups of .
Definition 12.9.14. §
Let .
- a.
- b.
-
We set and for . We refer to as the group of -coboundaries of with coefficients in .
Theorem 12.9.15. §
The maps
defined by
are isomorphisms for all . This provides isomorphisms of complexes in the sense that for all . Moreover, these isomorphisms are natural in the -module .
Proof.
If , then
for all . Let , and define for all . We then have
Therefore, is injective. On the other hand, if , then defining
we have
and . Therefore, is an isomorphism of groups.
That forms a map of complexes is shown in the following computation:
The latter term equals
which is .
Finally, suppose that is a -module homomorphism. We then have
hence the desired naturality. □
Corollary 12.9.16. §
The th cohomology group of the complex is naturally isomorphic to .
Corollary 12.9.17. §
The th cohomology group of with coefficients in is
The cohomology groups measure how far the cochain complex is from being exact. We give some examples of cohomology groups in low degree.
Lemma 12.9.18. §
We have
and is the subgroup of for which there exists such that for all . In particular, if is a -module with trivial -action, then .
Proof.
Let . Then for , so . That proves part a, and part b is simply a rewriting of the definitions. Part c follows immediately, as the definition of reduces to , and is clearly , in this case. □
We remark that, as is abelian, we have , where is the maximal abelian quotient of (i.e., its abelianization).
We turn briefly to an interesting use for second cohomology groups.
Definition 12.9.19. §
A group extension of by a -module is a short exact sequence of groups
such that, choosing any section of , one has
for all , . Two such extensions are said to be equivalent if there is an isomorphism fitting into a commutative diagram
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:
- An arrow from 0 (row 1, column 1) to A (row 1, column 2), without a label.
- An arrow from A (row 1, column 2) to script E, without a label.
- Equality joins A (row 1, column 2) and A (row 2, column 2), without a label.
- An arrow from script E to G (row 1, column 4), without a label.
- An arrow from script E to script E prime, labelled theta.
- An arrow from G (row 1, column 4) to 0 (row 1, column 5), without a label.
- Equality joins G (row 1, column 4) and G (row 2, column 4), without a label.
- An arrow from 0 (row 2, column 1) to A (row 2, column 2), without a label.
- An arrow from A (row 2, column 2) to script E prime, without a label.
- An arrow from script E prime to G (row 2, column 4), without a label.
- 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 .
Definition 12.9.20. §
A factor set of a group valued in a -module is a -cocycle satisfying for all .
Lemma 12.9.21. §
Every -cocycle of a group is cohomologous to, i.e., has the same cohomology class as, a factor set.
Proof.
The condition that is a -cocycle is that
for all . In particular, taking , we have and taking , we have . Note that for a -cochain , we have
In particular, if we set for all some fixed , then for all , so if we take and replace by , then and for all . □
Theorem 12.9.22. §
The group is in canonical bijection with via the map induced by that taking a factor set to the extension with multiplication given by
This identification takes the identity to the semi-direct product determined by the action of on .
Proof.
We check that so defined is a group. That it has identity is clear from the definition. Associativity is as follows:
The inverse of clearly has the form for some , and we then must have , so , and the inverse exists. That is a group extension of by is now nearly immediate. Note also that is split if , ]since in that case , so is a subgroup.
Let be a -cochain with , the latter property occurring if and only if . Consider the map given by
We have
so is a homomorphism, and it is clearly has inverse . Thus, we have a well-defined map from to .
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 -cochain defining the multiplication. We claim that is a factor set. For this, associativity again tells us that is a -cocycle, and the fact that is a two-sided identity forces for all . The resulting association is clearly inverse on the level of extensions and cochains. If is an isomorphism of group extensions of by , then for some that has the property that if the factor set is associated to is plus the factor set associated to . □
Remark 12.9.23. §
Theorem 12.9.22 tells us that also has a group structure, which may also be given an explicit description. Given and extensions of by , their product is
This product is known as the Baer sum of the two extensions.
Let’s give a group-theoretic application of this description of .
Proposition 12.9.24 (Schur). §
Let be a group of order , where and are relatively prime positive integers. Then every abelian normal subgroup of order has a complement in of order .
Proof.
Let be an abelian normal subgroup of , and set . Let be a factor set corresponding to as an extension of by by Theorem 12.9.22. For every , let
which makes sense as is abelian. For , we have
Now
Let be such that . We then have
Thus, is a coboundary, so is a split extension by Theorem 12.9.22. In particular, it contains a subgroup of order , isomorphic to . □
Remark 12.9.25. §
Though we do not prove it, we have for all whenever and are finite of relatively prime order. In fact, for any finite group and -module , the exponent of divides the order of .
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 be a normal Hall subgroup of of order and index . If 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 . Let be a prime dividing . Let be a Sylow -subgroup of . Then has -power order dividing . Since and are relatively prime, this forces to be contained in . In other words, the Sylow -subgroups of and are the same. Now
so . On the other hand, has order prime to and less than , being properly contained in . Furthermore, is normal in . By induction on , we have that there exists a subgroup of with isomorphic to and .
Since is a -group, its center is nontrivial. It is also a characteristic subgroup of , so it is normal in . By induction, has a has a complement in , equal to for some subgroup of , which necessarily has order . This group is the desired complement to . □
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 be a finite Galois extension with Galois group . Then .
Proof.
Let be a -cocycle. We view the elements as abelian characters . As distinct characters of , these characters form a linearly independent set. The sum is therefore a nonzero map . Let be such that . For any , we have
Thus,
so is the -coboundary of . □
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 be a finite cyclic group and be a -module. Then for , we have
where is the kernel of multiplication by on .
Proof.
Let be a generator of , and consider the augmented resolution of given by
where is the augmentation maps. Note that by evaluation at , and the map (resp., ) on induces (resp., ) on via these isomorphisms. The groups are then the cohomology groups of the complex
which have the desired form. □
Remark 12.10.3. §
Suppose that is finite cyclic with Galois group having generator . Proposition 12.10.2 implies that
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 is a finite extension with Galois group . Let be a positive integer not divisible by the characteristic of . Then there is an isomorphism
where the class of an element in the quotient corresponds to the class of the cocycle
where with
Proof.
The short exact sequence
of -modules gives rise to a long exact sequence
where Hilbert’s Theorem 90 gives the final equality. That is sent to the class of follows from the definition of the connecting homomorphism by the Snake lemma. □
This leads to the following definition.
Definition 12.10.5. §
Let be a positive integer not divisible by the characteristic of . For , a Kummer cocycle attached to is a map given by
where with .
Remark 12.10.6. §
The Kummer cocycle in Definition 12.10.5 actually depends on the choice of th root of up to a -coboundary of an element of . If , however, it is unique and is the Kummer character of . In this case, Proposition 12.10.4 reduces to
where . This in turn yields the perfect pairing of Kummer duality.
We next turn to the question of the structure of for a finite Galois extension with Galois group . We fix such an extension with Galois group in what follows.
Definition 12.10.7. §
A central simple algebra over a field is a simple -algebra with center equal to .
Example 12.10.8. §
Any matrix algebra over a division algebra is a central simple algebra over the center , which is a field. For instance, if denotes the ring of quaternions, then is a central simple -algebra.
Proposition 12.10.9. §
Let be a factor set. Let be an -vector space with basis for . Define a multiplication on as the unique binary operation extending the scalar multiplication and satisfying
for and . Then is a central simple -algebra with identity .
Proof.
We have
It follows that is an associative -algebra with in its center. Note that in the ring since for all .
Let generate . Let
. Then , so
and therefore for all with . Since is a generator of , this forces for all , so . Thus, .
Next, let be a nonzero ideal of , and let be an element with a minimal number of nonzero coefficients in its expression as an -linear combination of elements of . If and are distinct elements of for which has nonzero coefficients, then . Then , but its -coefficient is now zero, while its -coefficient is not, and it has no nonzero coefficients that does not have. This contradicts the minimality of , forcing it to be . Thus, for some and . But such an is a unit in , so . Thus, is a simple ring. □
Definition 12.10.10. §
For a factor set , the -algebra of Proposition 12.10.9 is the crossed product algebra of .