Morphisms of exact sequences

For a given module M, different choices of generators lead to different surjections from free R-modules.

Different choices for the generators of the kernels of those surjections (i.e., different choices of generators for the relations among those generators), lead to different exact sequences

Continuing in this way, it's very plausible to expect to deal with two very different free resolutions of the same module M:

There should be a way to compare these two resolutions, which means we need a way to compare exact sequences. As usual, we'll do that through the notion of a morphism of exact sequences.

Definition of morphism of exact sequences

A morphism from an exact sequence

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

to an exact sequence

β‹―β†’gnβˆ’2Ynβˆ’1β†’gnβˆ’1Ynβ†’gnYn+1β†’gn+1β‹―

is a collection of morphisms hn:Xn→Yn such that the diagram below commutes:

As might be predicted, we can compose morphisms of exact sequences (by composing the vertical morphisms), and we can talk about isomorphisms of exact sequences (either as morphisms in which all of the vertical morphisms are isomorphisms, or equivalently as morphisms for which there exists an inverse morphism of exact sequences).

Properties of morphisms of exact sequences

The commutativity condition on morphisms of exact sequences has some surprising consequences.

The Short Five Lemma

Suppose we have a morphism of short exact sequences

If h1 and h3 are injective (resp., surjective), then h2 is injective (resp., surjective).

If you're wondering if there's a "Long Five Lemma", the answer is ... kind of.