Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 122 2 a Solution Created 2026-10-03 Updated 2026-10-06
An opmonoidal functor consists of a functor, a natural transformationand a morphism . These maps need not be invertible. If are the respective associators and unitors, its axioms areThe first equation has domain and codomain , which fixes the direction of every arrow. This is also called a colax monoidal functor.
An opmonoidal natural transformation between opmonoidal functors is a natural transformation satisfyingIt respects both the tensor and unit comparison maps. These are commutative diagrams and a unit commutative diagram; the arrow directions are opposite to those for a lax monoidal functor.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 122 6 a Solution Created 2026-10-03 Updated 2026-10-06
Because the direction of a lax monoidal functor compares the target tensor with the image of the source tensor, the given maps have the correct direction. They need not be invertible unless a strong monoidal functor is intended.
Their associativity condition is the following commutative diagram, with the associators of the two structures labelled explicitly:The two unit conditions, since , are the unit commutative diagramsTogether with the assumed naturality, these are exactly the axioms for the requested monoidal structure. There are no further coherence conditions.
The faithful strict monoidal functor allows all three diagrams to be checked after applying it. Both tensor structures then have the same underlying tensor and constraints in . In particular, the unit conditions are equivalent toThe associativity square becomes the displayed diagram with every tensor replaced by , both associators by , and every by . Faithfulness reflects equality of the two resulting composites. One should not identify itself with an identity in : its domain and codomain can be distinct objects with the same image under . Intrinsically it is , and similarly on the right.
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 2026 iii Paper 101 1 c ii Solution Created 2026-09-24 Updated 2026-09-25
Write the nonsplit short exact sequenceFor an endomorphism , the composite vanishes because . Hence restricts to an endomorphism of and induces an endomorphism of , giving a commutative diagram of short exact sequences.
Because and are brick modules, each of is either zero or an isomorphism. If both are isomorphisms, the short five lemma makes an isomorphism. If both vanish, factors successively through and through , hence through a map ; this map is zero, so .
The mixed cases would split the sequence. If is invertible and , then , so for some ; the identity makes a retraction of . If and is invertible, then , so ; the identity makes a section of . Both contradict nonsplitting. Thus every endomorphism of is zero or invertible, and is a brick.