World Library  
Flag as Inappropriate
Email this Article

Zig-zag lemma

Article Id: WHEBN0019382017
Reproduction Date:

Title: Zig-zag lemma  
Author: World Heritage Encyclopedia
Language: English
Subject: Zigzag (disambiguation), Bockstein homomorphism, Eilenberg–Steenrod axioms
Collection:
Publisher: World Heritage Encyclopedia
Publication
Date:
 

Zig-zag lemma

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 (\mathcal{A},\partial_{\bullet}), (\mathcal{B},\partial_{\bullet}') and (\mathcal{C},\partial_{\bullet}) be chain complexes that fit into the following short exact sequence:

0 \longrightarrow \mathcal{A} \stackrel{\alpha}{\longrightarrow} \mathcal{B} \stackrel{\beta}{\longrightarrow} \mathcal{C}\longrightarrow 0

Such a sequence is shorthand for the following commutative diagram:

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

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

\delta_n : H_n(\mathcal{C}) \longrightarrow H_{n-1}(\mathcal{A}),

that makes the following sequence exact:

The maps \alpha_*^{ } and \beta_*^{ } are the usual maps induced by homology. The boundary maps \delta_n^{ } are explained below. The name of the lemma arises from the "zig-zag" behavior of the maps in the sequence. In an unfortunate overlap in terminology, this theorem is also commonly known as the "snake lemma," although there is another result in homological algebra with that name. Interestingly, the "other" snake lemma can be used to prove the zig-zag lemma, in a manner different from what is described below.

Construction of the boundary maps

The maps \delta_n^{ } are defined using a standard diagram chasing argument. Let c \in C_n represent a class in H_n(\mathcal{C}), so \partial_n(c) = 0. Exactness of the row implies that \beta_n^{ } is surjective, so there must be some b \in B_n with \beta_n^{ }(b) = c. By commutativity of the diagram,

\beta_{n-1} \partial_n' (b) = \partial_n \beta_n(b) = \partial_n(c) = 0.

By exactness,

\partial_n'(b) \in \ker \beta_{n-1} = \mathrm{im} \alpha_{n-1}.

Thus, since \alpha_{n-1}^{} is injective, there is a unique element a \in A_{n-1} such that \alpha_{n-1}(a) = \partial_n'(b). This is a cycle, since \alpha_{n-1}^{ } is injective and

\alpha_{n-2} \partial_{n-1}(a) = \partial_{n-1}' \alpha_{n-1}(a) = \partial_{n-1}' \partial_n'(b) = 0,

since \partial^2 = 0. That is, \partial_{n-1}(a) \in \ker \alpha_{n-2} = \{0\}. This means a is a cycle, so it represents a class in H_{n-1}(\mathcal{A}). We can now define

\delta_{ }^{ }[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

This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 


Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.