Zig-zag lemma

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

: 0 longrightarrow mathcal{A} stackrel{alpha}{longrightarrow} mathcal{B} stackrel{eta}{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 eta_*^{ } 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.

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 eta_n^{ } is surjective, so there must be some in B_n with eta_n^{ }(b) = c. By commutativity of the diagram, : eta_{n-1} partial_n' (b) = partial_n" eta_n(b) = partial_n"(c) = 0. By exactness, :partial_n'(b) in ker eta_{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-2}(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.

References

*cite book | first = Allen | last = Hatcher | authorlink = Allen Hatcher | year = 2002 | title = Algebraic Topology | publisher = Cambridge University Press | id = ISBN 0-521-79540-0 | url = http://www.math.cornell.edu/~hatcher/AT/ATpage.html
*cite book | first = Serge | last = Lang | authorlink = Serge Lang | year = 2005 | title = Algebra | publisher = Springer | | edition = (3rd ed.) | id = ISBN 0-387-95385-X
*cite book | first = James R. | last = Munkres | authorlink = James Munkres | year = 1993 | title = Elements of Algebraic Topology | publisher = Westview Press | location = New York | id = ISBN 0-201-62728-0


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • Diagramme commutatif — En mathématiques, et plus spécialement dans les applications de la théorie des catégories, un diagramme commutatif est un diagramme d objets et de morphismes tels que, lorsque l on choisit deux objets, on peut suivre un chemin quelconque à… …   Wikipédia en Français

  • Commutative diagram — For help on drawing commutative diagrams on Wikipedia, see meta:Help:Displaying a formula#Commutative diagrams. In mathematics, and especially in category theory, a commutative diagram is a diagram of objects (also known as vertices) and… …   Wikipedia

  • List of mathematics articles (Z) — NOTOC Z Z channel (information theory) Z factor Z function Z group Z matrix (mathematics) Z notation Z order (curve) Z test Z transform Z* theorem Zadoff–Chu sequence Zahorski theorem Zakai equation Zakharov–Schulman system Zakharov system ZAMM… …   Wikipedia

  • Hex (Spiel) — Hex / Polygon / con tac tix Hex The Zig Zag Game (Parker Brothers) Daten zum Spiel Autor Piet Hein, John Nash Verlag Parker Brothers (1952), 3M (1 …   Deutsch Wikipedia

  • Glossary of botanical terms — Many of the terms used in Wikipedia glossaries (often most) are already defined and explained within Wikipedia itself. However, lists like the following indicate where new articles need to be written and are also useful for looking up and… …   Wikipedia

  • Calculus of variations — is a field of mathematics that deals with extremizing functionals, as opposed to ordinary calculus which deals with functions. A functional is usually a mapping from a set of functions to the real numbers. Functionals are often formed as definite …   Wikipedia

  • Path integral formulation — This article is about a formulation of quantum mechanics. For integrals along a path, also known as line or contour integrals, see line integral. The path integral formulation of quantum mechanics is a description of quantum theory which… …   Wikipedia

  • Kripke semantics — (also known as relational semantics or frame semantics, and often confused with possible world semantics) is a formal semantics for non classical logic systems created in the late 1950s and early 1960s by Saul Kripke. It was first made for modal… …   Wikipedia

  • Projet:Médecine/Index — Articles 0 9 1,2 dibromo 3 chloropropane · 112 (numéro d urgence européen) · 1935 en santé et médecine · 1941 en santé et médecine · 1er régiment médical · 2 iodothyronine déiodinase · 2,4,6 trichlorophénol · 2005 en santé et médecine · 2006 en… …   Wikipédia en Français

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”