Exact Sequences II - Exact Sequences

The idea of a relationship between a pair of morphisms through a common object (in this case, a module M) leads more generally to the notion of an exact sequence.

Definition of exactness

Suppose C is a category that "has kernels and images" (e.g., R-Mod). A sequence of morphisms Xβ†’fYβ†’gZ in C is exact at Y if ker⁑(g)=im(f).

More generally, a sequence of morphisms

β‹―β†’fnβˆ’2Xnβˆ’1β†’fnβˆ’1Xnβ†’fnXn+1β†’fn+1β‹―

is an exact sequence if it is exact at every Xn.

Examples


Injections and surjections

In R-Mod, a sequence of morphisms

0→M→fN

is exact at M exactly when f is injective.[1] For example, the natural inclusion of Z into Q (as abelian groups) corresponds to the exact sequence of abelian groups

0→Z→Q.

Similarly, a sequence of morphisms

M→fN→0

is exact at N exactly when f is surjective.[2] For example, the canonical projection from the abelian group Z onto the quotient group Z/2Z=Z2 corresponds to the exact sequence

Z→Z2→0.

We can now fully recover the situations in the quotient module example and direct sum example with the notion of a short exact sequence.

Definition of short exact sequence

A short exact sequence is an exact sequence of the form

0→X→fY→gZ→0.

In light of the previous definitions, a sequence of morphisms of the above form is a short exact sequence exactly when:

Are there shorter exact sequences?

You might reasonably ask whether exact sequences of the above type are really the shortest exact sequences. The answer is no, but among sequences that start and end with 0, they're the shortest ones that can be interesting.

Indeed, the shortest sequence that starts and ends with 0 and which we can even consider the notion of exactness is one of the form 0β†’Xβ†’0. This sequence is exact at X exactly when X≃0. Not very interesting.

The next longer sequence is one of the form 0→X→fY→0. You should convince yourself that this sequence is exactly exactly when f is an isomorphism. Again, not especially interesting.

So the shortest sequences starting and ending with 0 for which exactness might be interesting are the so-called short exact sequences.

Submodules and quotient modules

For each submodule N of an R-module M, we have a short exact sequence

0→N→M→M/N→0.

For instance, we have the short exact sequence of abelian groups

0→2Z→Z→Z2→0.

Direct sums of two modules

For each pair of R-modules M1 and M2, we have a short exact sequence of R-modules

0β†’M1β†’j1M1βŠ•M2β†’Ο€2M2β†’0.

Forming short exact sequences from morphisms

Suppose we have a morphism f:X→Y. We can then form the short exact sequence

0β†’ker⁑(f)β†’Xβ†’im(f)β†’0.

If the quotient Y/im(f) exists (e.g., we're working in R-Mod), then we also have a short exact sequence

0→im(f)→Y→Y/im(f)→0.

Forming short exact sequences from very short, exact sequences

Suppose we have a sequence

X→fY→gZ

that is exact at Y; i.e., ker⁑(g)=im(f). Using the fact that Y/im(f)=Y/ker⁑(g), we can then form the short exact sequence

0β†’im(f)β†’Yβ†’Y/ker⁑(g)β†’0.

Chain complexes


A natural generalization of the notion of an exact sequence is that of a chain complex.

Definition of chain complex

A sequence of morphisms

β‹―β†’fnβˆ’2Xnβˆ’1β†’fnβˆ’1Xnβ†’fnXn+1β†’fn+1β‹―

is called a chain complex if for every n one has im(fn)βŠ†ker⁑(fn+1); equivalently, if fn+1∘fn=0 for every n.

More generally, the sequence above is called an N-chain complex if the composition of any N successive morphisms is always 0.

Why generalize from exact sequences to chain complexes? Functors! Given any sequence of morphisms, say in the category of R-modules

β‹―β†’fnβˆ’2Mnβˆ’1β†’fnβˆ’1Mnβ†’fnMn+1β†’fn+1β‹―

and a functor F (from that category to another, say to the category Ab of abelian groups), functoriality guarantees we have a chain of morphisms

β‹―β†’F(fnβˆ’2)F(Mnβˆ’1)β†’F(fnβˆ’1)F(Mn)β†’F(fn)F(Mn+1)β†’F(fn+1)β‹―

We will soon see that if the original sequence of morphisms is exact, the resulting sequence often will not be. That failure of exactness will actually be something we study in more detail.

However, we will see that if the original sequence is a chain complex (which includes the case of an exact sequence), then the resulting sequence will at least still be a chain complex. So chain complexes seem like the right type of object to consider to make things categorical.

In fact, if we define morphisms of chain complexes, then we could consider an actual category of chain complexes ...

Sequences of morphisms


Chain complexes and exact sequences are special types of sequences of morphisms, so you might be wondering whether we could give a more categorical definition. The answer is yes, as it always is.

First let's abuse notation for the millionth time and write Z for the preorder category of the integers. This is the category whose objects are indexed by the integers, and for which there is a unique arrow mβ†’n exactly when m≀n. We can visualize this category as just an infinite sequence of arrows:

β‹―β†’βˆ’2β†’βˆ’1β†’0β†’1β†’2β†’β‹―

A sequence of morphisms in a category C is then nothing more than a functor F:Zβ†’C. Indeed, it assigns to each integer n∈Z an object Xn:=F(n) in C, and to each unique arrow nβ†’n+1 an arrow fn:Xnβ†’Xn+1. (All other arrows are compositions of such arrows, hence are determined by functoriality.)

The advantage to this formality is that it's clear how we should/must define a morphism between sequences of morphisms: it must be a natural transformation between such functors. (We'll have a picture in the next note.)

And now we have a full-on category of sequences of morphisms in C, namely the functor category CZ.

Suggested next note


Exact Sequences III - Morphisms of Exact Sequences


  1. Here we haven't labeled the morphism from the zero module, since that morphism is unique (it sends the single element of the zero module to 0M). β†©οΈŽ

  2. Once again, there is no need to label the unique morphism from N to the zero module (which sends every element in N to the single element in the zero module.) β†©οΈŽ