Diagram Chasing

A proving technique in homological algebra which consists in looking for equivalent map compositions in commutative diagrams, and in exploiting the properties of injective, surjective and bijective homomorphisms and of exact sequences.

The construction of the connecting homomorphism in the proof of the snake lemma is an example of diagram chasing.

See also

Commutative Diagram, Connecting Homomorphism, Diagram Lemma, Homological Algebra, Snake Lemma, Zig-Zag Lemma

This entry contributed by Margherita Barile

Explore with Wolfram|Alpha

References

Mac Lane, S. Categories for the Working Mathematician. New York: Springer-Verlag, pp. 200-201, 1971.Mac Lane, S. "Diagram Chasing." §12.3 in Homology. New York: Springer-Verlag, 364-367.

Referenced on Wolfram|Alpha

Diagram Chasing

Cite this as:

Barile, Margherita. "Diagram Chasing." From MathWorld--A Wolfram Resource, created by Eric W. Weisstein. https://mathworld.wolfram.com/DiagramChasing.html

Subject classifications