Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 22 1 a Solution Created 2026-10-03 Updated 2026-10-06
For a locally small category , an object , and a categorical presheaf , the Yoneda lemma gives the natural bijectionIts two maps are explicitlyFor , the equation proves naturality of . Evaluating it at the identity morphism gives . Conversely, naturality of at givesso . Evaluation at the identity and transport of an element along a morphism are mutually inverse.
The bijection is natural in both variables: a natural transformation sends to , matching ; and givesFor completeness, the covariant Yoneda lemma for is , with and inverse .
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 22 2 c Solution Created 2026-10-03 Updated 2026-10-06
The representing object in the functor category is the constant diagram in a category . If is the chosen categorical limit cone, the natural bijection isA natural transformation from the constant diagram in a category is precisely a categorical cone with vertex , and its inverse is the unique mediating morphism from the universal property of the categorical limit. For , the defining equations for show that postcomposition by corresponds to postcomposition by on the right. This establishes naturality in and proves representability by the constant diagram.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 22 3 a Solution Created 2026-10-03 Updated 2026-10-06
Use the orientation and . An adjunction is equivalently specified by the natural transformationscalled the unit and counit of an adjunction, satisfying the triangle identities for an adjunctionThe corresponding natural bijection is , with and inverse . The two triangular equations are the required compatibility conditions. No proof of equivalence of the formulations is needed here.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 22 3 c Solution Created 2026-10-03 Updated 2026-10-06
The right-adjoint criterion using comma-category colimits is as follows. Under the given colimit-preservation hypothesis, with preservation including the possibly large colimits below, has a right adjoint exactly when, for every , the projectionhas a colimit in . The right adjoint is obtained from these comma-category colimits. Thus the objects to construct areFor necessity, if with adjunction counit , is a terminal object of the comma category . Its unique incoming morphisms give a colimit cocone for , exactly as for the elements projection in the preceding part.
For sufficiency, choose such a colimit with legs . The morphisms are a cocone on . Since preserves this colimit, there is a unique satisfyingEach is thus a morphism in the comma category. The original colimit cocone gives for every object, hence by the universal property. For any other morphism , cocone compatibility givesSo is a terminal object. Equivalently, represents the categorical presheaf , via . The functoriality of chosen representations makes these into , yielding a natural bijectionThe preservation of these possibly large colimits is essential to the construction of . Under a small-only interpretation, the preceding ordinal counterexample also disproves the unqualified converse here. Take . It preserves all small colimits. For a nonempty set , the comma category has one object over each ordinal and none over , so its projection has colimit . For , the projection is the identity of , again with colimit . Thus all these projection colimits exist, but has no right adjoint: the categorical presheaf is not representable. This makes the large-preservation qualification substantive.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 22 6 a Solution Created 2026-10-03 Updated 2026-10-06
For the monad define the free algebra functor byThe unit and associativity identities of the monad make an algebra for a monad, and naturality of makes a morphism of algebras for a monad. Let be the forgetful functor. For in the Eilenberg-Moore category, setThe inverse candidate is a monad algebra morphism, sinceThe two composites are identities:These use respectively the unit law for a monad algebra, the algebra-morphism equation, and a unit identity of the monad. The formulas commute with precomposition in and postcomposition by monad algebra morphisms, so they form a natural bijection. Therefore the free-algebra functor is left adjoint to forgetting:Its adjunction unit is , and its adjunction counit at is .