Snake lemma: Let R be a ring, and suppose a commutative diagram of R-modules has exact rows
Then there is a homomorphism δ:ker(f′′)→coker(f′), the connecting homomorphism, such that the sequence
0→ker(f′)→ker(f)→ker(f′′) δ coker(f′)→coker(f)→coker(f′′)→0
is exact. The maps other than δ are induced by i,p,j,q, and coker(f′)=B′/im(f′) is the cokernel.
The name comes from the picture: the kernels sit above the rows, the cokernels below, and δ snakes from ker(f′′) down to coker(f′):
The same statement holds in any abelian category, with kernels and cokernels taken in the categorical sense.