B3.5 Exact Sequences
The isomorphism theorems reveal a pattern: kernels and images of homomorphisms are intimately related. Exact sequences are a compact language for these relationships, and they are the starting point of homological algebra, a subject that runs through modern mathematics from algebraic topology to representation theory to algebraic geometry. We introduce the basic notions here.
3.5.1 Exact Sequences and Their Meaning
Definition 3.5.1 (Exact sequence). A sequence of groups and homomorphisms
The condition
Example 3.5.2 (Exactness encodes injectivity and surjectivity). Write
is exact at if and only if , that is, is injective. is exact at if and only if , that is, is surjective. is exact if and only if is an isomorphism.
3.5.2 Short Exact Sequences
The most important exact sequences are the short ones, which capture quotient groups.
Definition 3.5.3 (Short exact sequence). A short exact sequence is an exact sequence of the form
The trivial group is usually written
Proposition 3.5.4 (Short exact sequences and quotients). If
Proof. Suppose the sequence is exact. Since
Conversely, for
When
Example 3.5.5 (Fundamental examples of short exact sequences).
- Integers mod
: , where is the inclusion and is reduction mod . - Cyclic groups: for positive integers
, the sequence , where the first map is and the second is reduction mod . The first map is well defined and injective because if and only if ; its image is the set of multiples of in , which is the kernel of reduction mod . For example, and . - Sign:
for . For , with and , this reads . Together with , this shows that the two ends of a short exact sequence do not determine the middle group. - Determinant:
(Example 3.3.4). - Center: for any group
, , where the second map is (Example 3.3.4). - Products: for any groups
and , , where and . This is the “trivial” extension.
Example 3.5.6 (A sequence that does not exist). There is no short exact sequence
3.5.3 Splitting
When does a short exact sequence “come from” a simpler construction? This leads to the notion of splitting.
Definition 3.5.7 (Split exact sequence). A short exact sequence
Proposition 3.5.8 (Splitting lemma). If
Proof. Existence: Given
Uniqueness: Suppose
Corollary 3.5.9 (Split sequences of abelian groups). If
Proof. The map is a homomorphism because
For non-abelian groups the conclusion fails, because the product
Proposition 3.5.10 (Retractions and direct products). For a short exact sequence
- there is a homomorphism
with (a retraction); - there is an isomorphism
with for all and , where .
Proof. (b)
(a)
Example 3.5.11 (Split and non-split sequences).
- Splits, but is not a product:
. The homomorphism with is a section, since and . There is no retraction: by Proposition 3.5.10 it would give , which is abelian, while is not. - Does not split:
, with the second map reduction mod 2. A section would satisfy , so , and also , so . This is impossible. (Alternatively: if it split, Corollary 3.5.9 would give , but has an element of order 4 and does not.)
3.5.4 The Extension Problem
Short exact sequences lead to a fundamental question: given groups
Example 3.5.12 (Extensions of
, via , which does not split; , via the product sequence, which splits.
So up to isomorphism of the middle group there are exactly two extensions of
Question 3.5.13.
- Let
. Verify that is exact, where the second map is reduction mod . - Let
. Show that is exact for a suitable surjection , where is the rotation subgroup. Does it split? Is the direct product ? - Let
be a group with normal subgroup . Prove that the sequence is exact (with the obvious maps). - Suppose
and are exact. Prove that is exact.
Show solution
(a) Let
Exactness at the first
Exactness at the second
Exactness at
(b) Recall (Proposition 2.2.15) that
Does it split? Yes. Define
(c) Let
Exactness at
Exactness at
Exactness at
(d) We check exactness at each position.
At
At
At
At
Note. Exact sequences are the beginning of homological algebra. The ideas extend to longer exact sequences, and to chain complexes: sequences in which consecutive composites are trivial but which need not be exact, where the failure of exactness is itself the object of study. In representation theory, exact sequences of representations encode how representations are assembled from smaller ones; in topology, long exact sequences are among the most powerful computational tools.