##
(Anton Geraschenko) The Salamander lemma *November 13, 2007*

*Posted by Noah Snyder in Anton Geraschenko, blog triumphalism, guest post, homological algebra.*

trackback

trackback

*[I’m happy to introduce Anton, our very first guest blogger.]*

A couple of years ago, George Bergman gave me a copy of a fun preprint that he never got around to preparing for publication. A scan of it is posted here. It starts

The “magic” of diagram-chasing consists in establishing relationships between distant points of a diagram—exactness implications, connecting morphisms, etc.. These “long” connections are in general composits of “short” (unmagical) connections, but the latter, and even the objects they join, are frequently not visible in the diagram-chasing proof. We attempt to remedy this situation here.

If you don’t like diagram chases, it’s likely that you still won’t like them once you know the Salamander lemma. The salamanders chase the diagrams for you, but you still have to chase the salamanders. I think the salamander proofs are easier to explain (once you know the Salamander lemma), and it’s easier to see where you use the hypotheses. For example, it is totally clear that the argument for the lemma can prove the “ lemma” as well.

A bicomplex in an abelian category is a complex of complexes, i.e. an infinite grid of objects and arrows in which all the rows and columns are complexes (two consecutive arrows compose to zero) and all the squares commute. If we have a finite bicomplex, then we can always extend it by either adding zeros or various kernels and cokernels (if we want some exactness conditions). Since everything I say will take place on a bicomplex background, I’ll adopt the convention that all the arrows in the bicomplex go to the right and down, and I’ll draw the arrows in the bicomplex as dotted lines:

Given an object in a bicomplex,

we define the *vertical homology* , the *horizontal homology* , the *receptor* , and the *donor* . Note that if , then all of these subquotients are zero.

Recall that to define a morphism , it is enough to define a morphism such that the image of is contained in . This gives us four obvious maps (called *intramural maps*) induced by inclusions: , , , and . We also see that for any morphism in a bicomplex, we have an obvious *extramural map* .

**Salamander lemma.** If is a horizontal arrow in a bicomplex, then there is a six term exact sequence as shown on the left.

The morphism is the composition of the extramural map and the intramural map . The morphism is similar. If is a vertical arrow, then we get the six term exact sequence on the right. In either case, I’ll call this the salamander centered at . The proof of the Salamander lemma is totally obvious in any abelian category where the objects have elements; you just unwind the definitions. You can reduce to this case in the usual way (see chapter VIII, section 4 of Categories for the Working Mathematician).

Special case: if the row (resp. column) containing the morphism is exact at and , then the horizontal homologies and (resp. vertical homologies and ) are zero, so the extramural map is an isomorphism.

** lemma (or Nine lemma).** If we have three rows and three columns as shown below, with all three columns exact, and the bottom two rows exact (at , , , and ), then the first row is exact (at and ). Moreover, if we have the stuff in parentheses (imposing horizontal exactness at and vertical exactness at ), then the top row is exact at .

To prove this, we need to show that the horizontal homologies , , and are zero. Using the salamander centered at , we see that is sandwiched between and in an exact sequence. Repeatedly applying the special case (using the exactness hypotheses we have), we see that , as illustrated, so is zero. Similarly, we see that and (given the appropriate hypotheses) are zero as well. Strictly speaking, I should put underneath so that I use the special case to get the isomorphism . Since surjects onto , the image of in lies in the image of , so we still have a bicomplex when we do this.

**Snake lemma.** If we have the bicomplex below, with the three columns exact, and the middle two rows exact, then there is a six term exact sequence .

We prove that and are zero as before. Now we have to construct a “connecting morphism” making the desired six term sequence exact. This is equivalent to producing an isomorphism . Unravelling the definition, we have that and , and we have an isomorphism between these using several applications of the special case.

**Four lemma.** If we have the bicomplex below, with the columns exact and the middle two rows exact, then and . In particular, if is injective, then so is , and if is surjective, then so is .

The desired result is equivalent to proving that the top and bottom rows are exact (i.e. that the two horizontal homologies in the picture are zero), which I’ll leave as an exercise (it should be very easy; the picture has everthing you need).

**Long Exact Sequence in homology.** This one is a little different from the others. So far, we’ve used the special case, together with “half salamanders”. This time we’ll use a “whole salamander”. If we have the bicomplex below, with the rows exact, then there is a six term exact sequence .

Looking at the salamander centered at , we have , so . Applying the same argument “one level down,” we have that . Looking at the salamander centered at , we have , so . Applying the same argument “one level up,” we get that . Now we look at the salamander centered at , which is . Using the isomorphisms we just talked about (along with the isomorphisms and ), we get the desired six term exact sequence .

## Comments

Sorry comments are closed for this entry

George handed me a copy of this same preprint when I was at Berkeley. Interesting stuff. (By the way, did you ask George’s permission to post this to the web? He probably won’t mind, but you should let him know about this site.)

My favorite part of the preprint is the section on weakly-bounded double complexes. I wonder if these ideas would simplify the proof that the composition of two connecting homomorphisms along the faces of a “post” (i.e. a triple complex, which is infinite in one direction, and looks like 3×3 squares in the other two) in the two possible directions, give negatives of each other.

(I think this is one of the last results proven in Osborne’s book.)

The donor should be defined as

@Pace: Yes, I asked George if I could scan and post the preprint.

@ulfarsson: You’re right, but I don’t have the ability to edit the post. Could somebody please change it?

[…] in November Anton Geraschenko had an interesting post at the Secret Blogging Seminar based on a preprint by George Bergman. Homological algebra is full […]

FYI: there is now a preprint of the paper on the arXiv: http://arxiv.org/abs/1108.0958

[…] in November 2007 Anton Geraschenko had an interesting post at the Secret Blogging Seminar based on a preprint by George Bergman. His original preprint is now […]

I am in the process of putting much of this stuff into the nLab: http://ncatlab.org/nlab/show/salamander+lemma