21
$\begingroup$

I recently had need of the following fact (in the category of abelian groups, but I'm pretty sure it holds for all abelian categories): given a commutative diagram of the form

commutative diagram (quiver link), thus $k \circ g = l \circ h$, $f$ and $g$ are epimorphisms, and $l$ is a monomorphism, there is a canonical long exact sequence $$ 0 \to \ker f \to \ker g \circ f \to \ker h \to \ker k \to 0$$ defined in a natural fashion. Verifying that this fact is a routine (but tedious) diagram chase. Given the similarity to the snake lemma, I was initially certain that this fact was somehow a corollary of the snake lemma, but I was only able to use the snake lemma to establish exactness at $\ker k$ and nowhere else. Can the entirety of this sequence be established from the snake lemma, or one of the other canonical diagram chase lemmas?

EDIT: As noted in comments, the claim follows in fact from splicing together two applications of the snake lemma, namely

enter image description here

and

enter image description here

$\endgroup$
7
  • 3
    $\begingroup$ This kind of inquiry seems to beg the question: can every diagram chase lemma be formally derived from the "canonical" ones (snake, five, nine, etc.)? I don't even know if this question can be made precise though. $\endgroup$
    – R.P.
    Commented Dec 23, 2023 at 23:05
  • 9
    $\begingroup$ @R.P. One thing to keep in mind is that diagram chasing as a decision problem (once properly defined!) is undecidable. This at least puts a damper on hoping for too much. $\endgroup$ Commented Dec 23, 2023 at 23:07
  • 1
    $\begingroup$ @Carl-FredrikNybergBrodda is it because deciding upon diagram chasing (whatever it means: does it mean "tell whether $f=g$ for two parallel morphisms of a category"?) would imply deciding on the word problem for groups? $\endgroup$
    – fosco
    Commented Dec 24, 2023 at 9:32
  • 5
    $\begingroup$ @fosco Semigroups, but yes, that’s the idea. The reference is G. Hutchinson: Recursively unsolvable word problems of modular lattices and diagram-chasing, J. Algebra 26 (1973), 385--399 (John Stillwell showed me this beautiful paper). $\endgroup$ Commented Dec 24, 2023 at 9:46
  • 1
    $\begingroup$ @R.P.: See also the discussion in this question: mathoverflow.net/questions/12732/… $\endgroup$
    – aorq
    Commented Dec 25, 2023 at 2:25

1 Answer 1

21
$\begingroup$

Splice the left ends of the kernel-cokernel exact sequences $0 \to \ker(f) \to \ker(gf) \to \ker(g) \to \mathrm{cok}(f) \to \mathrm{cok}(gf) \to \mathrm{cok}(g) \to 0$ and $0 \to \ker(g) \to \ker(kg) \to \ker(k) \to \mathrm{cok}(g) \to \mathrm{cok}(kg) \to \mathrm{cok}(k) \to 0$, noting that $\ker(kg) = \ker(h)$, $\mathrm{cok}(f) = 0$ and $\mathrm{cok}(g) = 0$. The kernel-cokernel sequence for a composition appears in Milne's Arithmetic Duality Theorems (Proposition 0.24), Short exact sequences every mathematician should know and https://arxiv.org/abs/2001.07528 , but must be about as old as the snake lemma.

$\endgroup$
9
  • 7
    $\begingroup$ Not a historical comment, but this is an instance of the octahedral lemma, yes? $\endgroup$
    – mme
    Commented Dec 23, 2023 at 21:50
  • 5
    $\begingroup$ Thanks! It surprises me that there are two fundamental diagram chase lemmas concerning the kernel and cokernel of maps, but that one of them is substantially more famous than the other... I had never encountered the kernel-cokernel exact sequence before, but have been exposed to the snake lemma countless times. $\endgroup$
    – Terry Tao
    Commented Dec 23, 2023 at 22:02
  • 4
    $\begingroup$ @TerryTao: On pg. 2 of the linked arXiv preprint of Rui Xiong it looks like the kernel-cokernel exact sequence is proved using the snake lemma. $\endgroup$ Commented Dec 23, 2023 at 22:06
  • 4
    $\begingroup$ @SamHopkins OK, that partially explains why the snake lemma is more widely known. Still, I would have thought that the kernel cokernel exact sequence should at least merit a Wikipedia entry or something. $\endgroup$
    – Terry Tao
    Commented Dec 23, 2023 at 22:32
  • 7
    $\begingroup$ Both the snake lemma and the kernel-cokernel sequence are instances of the long exact sequence of homotopy groups induced by a fiber sequence of anima, which is really the fundamental thing that is the source of almost all long exact sequences. For the snake lemma, the relevant fiber sequence is the fiber of a map of fiber sequences, while for the kernel-cokernel sequence, it is the fiber sequence of fibers of a commuting triangle (the "octahedral axiom" as mentioned by mme). $\endgroup$ Commented Dec 24, 2023 at 8:47

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .