Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 4 21H Solution Created 2026-09-24 Updated 2026-10-14
The Snake lemma applies to a commutative diagram of modules with exact rows and , and vertical maps . It supplies the exact sequenceFor , choose with . Commutativity gives , so for a unique . Define modulo . Changing by changes by , proving well-definedness. This construction is additive. Exactness follows by the same lift-and-chase: exactly when the lift can be adjusted into ; a class in maps to zero in exactly when it is obtained from such a lift. The remaining kernel and cokernel positions follow directly from row exactness.
For an open cover , use the short exact sequence of singular chain complexeswhere the last complex consists of chains whose simplices lie in one member of the cover. This is exact because a simplex present in both summands lies in their intersection. Barycentric subdivision and its chain homotopy to the identity show that this small-chain inclusion induces an isomorphism on homology: compactness of each simplex and a Lebesgue-number argument place sufficiently subdivided simplices inside the cover.
Applying the Snake lemma to a short exact sequence of chain complexes gives the connecting homomorphism : lift a quotient cycle to the middle complex, take its differential, and identify that differential with an element of the subcomplex. Its independence of the lift and representative follows by the same chase. Repeating this degree by degree, or chasing the cycles and boundaries directly, givesThis is the Mayer–Vietoris sequence. Specifically, split a small cycle as ; then lies in the intersection, and with the sign convention above.
For the final truncation, use homological grading . The span in degrees below is a subcomplex. The span called in degrees at least need not be a subcomplex with the inherited differential: may lie in . Give the quotient differential, with zero and all higher differentials inherited. Thenis a short exact sequence of chain complexes. Its only potentially nonzero connecting map isIndeed ; is a cycle in , and changing by changes by zero. In other degrees either the source or the relevant target of the connecting map vanishes.
Past exam of the mathematics course of the University of Cambridge 2022 ii Paper 2 21I Solution Created 2026-09-23 Updated 2026-10-03
The Snake lemma associates to a commutative diagram with exact rows an exact sequenceFor , apply it degree by degree to the short exact sequence of chain complexesThe resulting connecting maps splice the kernels modulo boundaries into the Mayer--Vietoris sequence
Now let satisfy the stated simplicial pseudomanifold conditions. In an -cycle, cancellation at a common -face determines the coefficient of either incident -simplex from the other, up to the orientation sign. Connectivity through such faces therefore determines every top-simplex coefficient from one integer. If the signs are globally compatible, their oriented sum is a cycle and generates ; if they are inconsistent, that integer must be zero and .
Let be the resulting fundamental class, represented by . Since the intersection has dimension below , split uniquely
into top chains in and . Thenand the Mayer--Vietoris boundary isIt is nonzero exactly when both and contain top-dimensional simplices; if one side contains none, the fundamental cycle already lies in the other side, while if both do, connectedness forces a nonempty interface and its oriented boundary represents a nonzero class.
into top chains in and . Thenand the Mayer--Vietoris boundary isIt is nonzero exactly when both and contain top-dimensional simplices; if one side contains none, the fundamental cycle already lies in the other side, while if both do, connectedness forces a nonempty interface and its oriented boundary represents a nonzero class.
Finally take , , and
. The preceding boundaryis a nonzero map between copies of and sends the fundamental class to the oriented boundary torus, hence is an isomorphism. Exactness then givesThe next part of the sequence isSince , it follows that
. The degree-zero sequence makes connected. Therefore
. The preceding boundaryis a nonzero map between copies of and sends the fundamental class to the oriented boundary torus, hence is an isomorphism. Exactness then givesThe next part of the sequence isSince , it follows that
. The degree-zero sequence makes connected. Therefore
Past exam of the mathematics course of the University of Cambridge 2024 iii Paper 119 6 a Solution Created 2026-09-24 Updated 2026-10-03
A complex in an abelian category is a sequence with . A sequence is exact when the image of every incoming map equals the kernel of the outgoing map.
The Five lemma says that in a morphism between exact five-term sequences, suitable epimorphism assumptions on the left and monomorphism assumptions on the right, together with isomorphisms in the four surrounding positions, force the middle map to be an isomorphism.
Past exam of the mathematics course of the University of Cambridge 2024 iii Paper 119 6 b Solution Created 2026-09-24 Updated 2026-10-03
Apply the Snake lemma degree by degree to a short exact sequence of complexesIf , lift a cycle to . Its boundary maps to zero in , so it comes from a cycle ; define . The Snake-lemma exactness and independence checks yieldThis is the algebraic Mayer–Vietoris theorem for homology objects.
Past exam of the mathematics course of the University of Cambridge 2026 iii Paper 119 6 Solution Created 2026-09-24 Updated 2026-10-03
An abelian category is an additive category with all kernels and cokernels in which every monomorphism is a kernel and every epimorphism is a cokernel. If is monic and , then factors through . The canonical coimage-to-image morphism is an isomorphism in an abelian category, so this factorization identifies with ; hence is the kernel of its own cokernel. Dually, every epimorphism is the cokernel of its own kernel. The assignments and therefore give inverse bijections between subobjects and quotient objects of a fixed object. Well-poweredness is consequently equivalent to well-copoweredness.
The category of complexes has chain complexes as objects and chain maps as morphisms. Write and . The equation gives both an induced map and a map . The homology object has the two canonically isomorphic descriptionsPassing to the opposite category exchanges these descriptions, proving self-duality.
The Snake lemma states that a commutative diagram with exact rows yields the exact sequence of the three kernels, followed by its connecting morphism and the three cokernels. Apply it degree by degree to a short exact sequence of complexes , using the diagrams of cycles, boundaries, and degree objects. The connecting map sends a cycle of to a lift in , takes its boundary in , and identifies that boundary with a class in . The Snake lemma gives exactness and producesthe algebraic Mayer–Vietoris theorem.