Zig-zag lemma

From HandWiki
Short description: On a particular long exact sequence in the homology groups of certain chain complexes

In mathematics, particularly homological algebra, the zig-zag lemma asserts the existence of a particular long exact sequence in the homology groups of certain chain complexes. The result is valid in every abelian category.

Statement

In an abelian category (such as the category of abelian groups or the category of vector spaces over a given field), let (𝒜,),(,) and (𝒞,) be chain complexes that fit into the following short exact sequence:

0𝒜αβ𝒞0

Such a sequence is shorthand for the following commutative diagram:

commutative diagram representation of a short exact sequence of chain complexes

where the rows are exact sequences and each column is a chain complex.

The zig-zag lemma asserts that there is a collection of boundary maps

δn:Hn(𝒞)Hn1(𝒜),

that makes the following sequence exact:

long exact sequence in homology, given by the Zig-Zag Lemma

The maps α* and β* are the usual maps induced by homology. The boundary maps δn are explained below. The name of the lemma arises from the "zig-zag" behavior of the maps in the sequence. A variant version of the zig-zag lemma is commonly known as the "snake lemma" (it extracts the essence of the proof of the zig-zag lemma given below).

Construction of the boundary maps

The maps δn are defined using a standard diagram chasing argument. Let cCn represent a class in Hn(𝒞), so n(c)=0. Exactness of the row implies that βn is surjective, so there must be some bBn with βn(b)=c. By commutativity of the diagram,

βn1n(b)=nβn(b)=n(c)=0.

By exactness,

n(b)kerβn1=imαn1.

Thus, since αn1 is injective, there is a unique element aAn1 such that αn1(a)=n(b). This is a cycle, since αn2 is injective and

αn2n1(a)=n1αn1(a)=n1n(b)=0,

since 2=0. That is, n1(a)kerαn2={0}. This means a is a cycle, so it represents a class in Hn1(𝒜). We can now define

δ[c]=[a].

With the boundary maps defined, one can show that they are well-defined (that is, independent of the choices of c and b). The proof uses diagram chasing arguments similar to that above. Such arguments are also used to show that the sequence in homology is exact at each group.

See also

References