To prove that a morphism f: A → B is injective via diagram chasing, a student begins by taking an arbitrary element x with f(x) = 0. What must happen next to complete the proof?
ATrace x through every available commuting path, using exactness conditions to force x = 0 — each step is logically necessitated by the local diagram structure
BShow that f is also surjective, because injective and surjective morphisms in abelian categories coincide
CFind a map g where g ∘ f is the identity, constructing an explicit left inverse for f
DAppeal to the universal property of the kernel of f to show f must be an isomorphism
The diagram chase begins with an element in the kernel of f (i.e., x such that f(x) = 0) and must derive a contradiction or conclude x = 0. The only tools available are commutativity (different paths give the same morphism) and exactness (image of one map equals kernel of the next). The student traces x — possibly lifting it back through a surjective map using exactness, pushing it forward through a commuting square, and using exactness at an adjacent node to conclude membership in a kernel. Every step is forced; there is no freedom to choose. The chain of implications terminates when x must equal 0. This is the essence of diagram chasing: logical necessity at each node.
Question 2 Multiple Choice
In one version of the four lemma, surjectivity of α is a hypothesis. Why is this condition needed — what does it make possible in the chase?
ASurjectivity of α ensures its kernel is trivial, which directly constrains the behavior of β
BSurjectivity of α lets you lift elements backward: given an element in β's domain, you can express it as the image of something in α's domain, then track that preimage through the commuting square into adjacent sequences
CSurjectivity of α is needed to guarantee the diagram commutes, which is not automatic
DWithout surjectivity of α, the sequence would fail to be exact at the adjacent node
Surjectivity is precisely the property that lets you 'lift' — given an element b in B, surjectivity of α: A → B guarantees there exists an a in A with α(a) = b. In a diagram chase, this lifting is how you introduce a new element in a domain where you have more structural information (more exactness conditions, more commuting maps) to work with. Without lifting, the chase can get stuck: you have an element in one place but cannot connect it to the rest of the diagram. Surjectivity (and dually, injectivity) are the 'handles' that let the argument reach across the diagram.
Question 3 True / False
In a diagram chase, each step follows necessarily from the commutativity and exactness conditions — you are not free to choose where an element goes.
TTrue
FFalse
Answer: True
This logical inevitability is the defining feature of diagram chasing as a proof method. Commutativity means every path between two objects gives the same morphism — you cannot choose a path; they all agree. Exactness means membership in a kernel is equivalent to membership in the corresponding image — if f(x) = 0, then x is in the image of the previous map, which means there exists a unique (up to the relevant structure) preimage. The argument is algorithmic: follow the only available path, apply exactness at each node, and the conclusion is forced. This is what makes diagram chasing reliable and teachable — there is a systematic procedure, not creative inspiration.
Question 4 True / False
Diagram chasing mainly works in concrete categories like abelian groups or modules where objects have actual elements. Abstract abelian categories require mostly different proof techniques.
TTrue
FFalse
Answer: False
Diagram chasing can be done in two ways. The element-based approach works directly in concrete categories (abelian groups, R-modules) and is often more intuitive. The abstract approach replaces elements with morphisms from projective objects (or uses universal properties of kernels and cokernels) and works in any abelian category, including categories of sheaves or chain complexes where objects have no literal elements. Additionally, the Freyd-Mitchell embedding theorem guarantees that any small abelian category embeds fully faithfully into a category of R-modules, which justifies using element-based arguments even in abstract settings (though this requires care about size issues).
Question 5 Short Answer
What are the two structural properties that diagram chasing relies on, and how does each contribute? Describe the 'zig-zag' pattern that characterizes most diagram chase proofs.
Think about your answer, then reveal below.
Model answer: Diagram chasing relies on (1) commutativity — different paths between the same objects compose to the same morphism — and (2) exactness — the image of each map in an exact sequence equals the kernel of the next. Commutativity lets you reroute an element along an alternative path to reach a node with more information. Exactness lets you perform two key moves: if an element maps to zero under some f, exactness says it came from the previous map (lifting backward); if you have two composable maps with exact sequence, the composite is zero (pushing forward). The zig-zag pattern is: start with an element x; push it forward one map; use exactness to lift backward through a different map to get a new element y; push y forward through yet another map; use exactness again to conclude something about x. Most homological lemmas require two or three such zig-zags.
The zig-zag metaphor captures why diagram chases look complicated at first — they aren't following a single path through the diagram, but alternating between forward and backward moves, using exactness as the mechanism to change direction. Once this pattern is internalized, the Snake Lemma, Five Lemma, and nine lemma all feel like variations on the same basic algorithm.