(more info)
Math for the people, by the people.
Encyclopedia
|
Requests
|
Forums
|
Docs
|
Wiki
|
Random
|
RSS
Advanced search
Login
create new user
name:
pass:
forget your password?
Main Menu
sections
Encyclopædia
Papers
Books
Expositions
meta
Requests
(194)
Orphanage
Unclass'd
Unproven
(498)
Corrections
(25)
Classification
talkback
Polls
Forums
Feedback
Bug Reports
downloads
Snapshots
PM Book
information
News
Docs
Wiki
ChangeLog
TODO List
Legalese
About
snake lemma
(Theorem)
Let
be an
abelian category
. The
snake lemma
consists of the following two claims:
Suppose
is a
commutative diagram
in
with exact rows. Then there is an
exact sequence
usually called the
kernel-cokernel sequence
. The
morphism
is called the
connecting morphism
.
Applying the previous claim inductively, for any
short exact sequence
of
chain complexes
in
, there is a corresponding
long exact sequence in homology
Anyone
with an account
can edit this entry. Please help improve it!
"snake lemma" is owned by
mps
.
[
full author list
(2) |
owner history
(1) ]
(
view preamble
)
View style:
HTML with images
page images
TeX source
Other names:
zig-zag lemma, serpent lemma
Attachments:
proof of snake lemma
(Proof)
by mps
Log in to rate this entry.
(
view current ratings
)
Cross-references:
chain complexes
,
short exact sequence
,
morphism
,
exact sequence
,
commutative diagram
,
abelian category
There are
4 references
to this entry.
This is
version 9
of
snake lemma
, born on 2002-12-13, modified 2006-02-15.
Object id is
3745
, canonical name is
SnakeLemma
.
Accessed 5817 times total.
Classification:
AMS MSC
:
18G35
(Category theory; homological algebra :: Homological algebra :: Chain complexes)
Pending Errata and Addenda
None.
[
View all 7
]
Discussion
Style:
Flat
Threaded
Expand:
all
none
1
2
3
4
5
6
7
8
9
Order:
Oldest First
Newest first
forum policy
No messages.
Interact
post
|
correct
|
update request
|
prove
|
add result
|
add corollary
|
add example
|
add (any)