Cartesian comonad 2026-10-07
In the finite-limit setting, a Cartesian comonad is a comonad whose underlying endofunctor preserves finite limits. Its category of coalgebras for a comonad has finite limits created by the forgetful functor. On an elementary topos, equalizer constructions of exponentials in a coalgebra topos and the subobject classifier of a coalgebra topos make that coalgebra category an elementary topos.
Category of coalgebras for a comonad 2026-10-06
The category consists of coalgebras for a comonad and their structure-preserving morphisms. Its forgetful functor has the cofree coalgebra as right adjoint. If is a topos and preserves finite limits, those limits are created by the forgetful functor, while exponentials in a coalgebra topos and the subobject classifier of a coalgebra topos can be constructed as equalizers inside cofree objects.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 24 2 Solution Created 2026-10-03 Updated 2026-10-14
Let be a Cartesian comonad, so its endofunctor preserves finite limits. A coalgebra for a comonad is with , and . Its morphisms satisfy . Write for the forgetful functor and for the cofree coalgebra. Transposition isThe forgetful functor creates finite limits, since preserves them. We construct both exponential objects and the subobject classifier.
For coalgebras , set and in the ambient topos. Define by transposingwhere . Their cofree transposes are coalgebra morphismsLet be their coalgebra equalizer. For a coalgebra , an arrow corresponds to a map . Its evaluation respects coalgebra structure exactly whenUnder the displayed transpositions this is precisely the condition that it equalize . Thus naturally, and is the required exponential in a coalgebra topos.
Let classify . In take the equalizerThe truth map into is and factors through this equalizer. To verify its universal property, take an underlying subobject of a coalgebra. It carries a compatible coalgebra structure exactly when maps into . Such a structure, if it exists, is unique because is monic; its laws follow by cancellation of . Moreover always: applying to a point of lands in . Thus stability is equivalent to .
If classifies , this last equality is exactlyThe cofree transpose satisfies this equation precisely when it factors through . Indeed transposing the equality gives the equation above. Pulling back its truth map recovers , because classifies . Hence is the subobject classifier of a coalgebra topos. We have obtained finite limits, exponentials and a classifier, proving is a topos.
Now let be a geometric morphism, and put , , with unit . Both functors preserve finite limits, so is a Cartesian comonad on . Put . Its comparison functoris left exact and has right adjointTo check the adjunction, transpose an underlying map to . The coalgebra-morphism equation becomes exactly the equality of the two composites into , so the transposed arrow factors uniquely through the displayed equalizer.
The counit is invertible. Applying to the defining equalizer gives the equalizer of . The structure map is exactly that equalizer: it equalizes by coassociativity; if equalizes, apply to obtain , giving its unique factorization through . Thus the underlying comparison counit is an isomorphism, and the forgetful functor reflects isomorphisms. Therefore is full and faithful.
The adjunctions and defineHere is faithful, so is a surjective geometric morphism; is full and faithful, so is a geometric embedding. Their inverse-image composite is , establishing the surjection-embedding factorization of a geometric morphism.
For uniqueness, let be the class of arrows in inverted by . In any surjection-embedding factorization , conservativity of shows that is also the class inverted by . The essential image of the fully faithful consists exactly of the -local objects , namely those for which is bijective for every in . One direction follows from the adjunction. For the converse, the reflector unit belongs to ; locality gives a retraction, and locality of the reflected object makes that retraction also a right inverse. Thus the unit is invertible. The image subcategory is consequently determined by , independently of the factorization. The two intermediate toposes are equivalent over , and their inverse-image composites with the embeddings determine the surjection legs. This proves uniqueness up to equivalence.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 74 2 Solution Created 2026-10-03 Updated 2026-10-07
Write the Cartesian comonad as , with preserving finite limits. A coalgebra for a comonad is with , and . Its forgetful functor is faithful, creates finite limits, and has the cofree coalgebra right adjoint . We construct the two remaining topos structures explicitly.
For exponential objects, take coalgebras and start with . Put , with structure , and letTranspose the following two maps into maps :using . The cofree adjunction transposes once more into coalgebra morphisms . Let be their equalizer. A coalgebra map corresponds to an arbitrary ambient map . It factors through precisely whenwhich is exactly the condition that be a coalgebra morphism. Therefore represents and is the required exponential in a coalgebra topos.
For the subobject classifier, let classify the mono . In the cofree coalgebra , formBoth arrows are coalgebra morphisms. The cofree transpose of factors through this equalizer and gives its true arrow. To verify classification, let have ambient characteristic map . It supports a subcoalgebra of exactly when it is invariant under , equivalentlyThe counit proves the reverse containment in the first equation; the forward containment supplies the restricted structure map, whose coalgebra laws follow through the mono. Under the cofree adjunction, the second equation says exactly that factors through . Pulling back its true arrow recovers , since . This proves the universal property of the subobject classifier of a coalgebra topos. Hence is a topos.
Now let be a geometric morphism, with . The comonad is Cartesian: preserves finite limits and the right adjoint preserves limits. Put , already a topos. The forgetful adjunction defines with , so is faithful.
The comparison functorpreserves finite limits. It has a right adjoint , given on a coalgebra byIndeed, the transposed arrow corresponds to a coalgebra map exactly when it equalizes these two maps. Applying the finite-limit-preserving shows that is the equalizer ofThat equalizer is . If equalizes the pair, then , proving the claimed universal property. Consequently the counit is invertible. The fully faithful adjoint criterion makes full and faithful.
Thus defines a geometric embedding , and identifies the composite with . The requested factorization iswhere is a surjective geometric morphism and is full and faithful.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 20 1 i Solution Created 2026-10-03 Updated 2026-10-06
Write the comonad as and its category of coalgebras for a comonad as . A coalgebra for a comonad is a map with and . A morphism satisfies . Let be the forgetful functor and let be the cofree coalgebra. The adjunction has the explicit correspondenceWe construct the three pieces of the elementary topos structure.
Because preserves finite limits, each underlying finite limiting cone has a unique coalgebra structure induced by the structures on its vertices. The counit and coassociativity equations can be checked after its jointly monic projections. Thus creates finite limits and reflects isomorphisms. A morphism of coalgebras is monic exactly when its underlying morphism is monic, by the diagonal criterion using the created pullback.
For exponentials in a coalgebra topos, fix coalgebras and and put in . On the cofree coalgebra there is an underlying evaluationThe two mapsuse in the second expression. Transpose them in to maps , and then transpose across to coalgebra morphisms . Take their equalizer in .
An underlying map corresponds to a coalgebra map . The equation saying that the original map is a coalgebra morphism is precisely , since for the structure . By the cofree adjunction, this is equivalent to , hence to unique factorization through . Thereforenaturally in . This constructs the required exponential object.
For the subobject classifier of a coalgebra topos, let be the underlying subobject classifier, and let classify the mono . Its cofree transpose is the coalgebra endomorphismDefine as the equalizer of and . The transpose of factors through this equalizer and gives .
Indeed, for a subobject classified by , the pullback has characteristic map . It is always contained in , by naturality of the counit. Equality holds exactly when restricts to a coalgebra structure on ; its axioms then follow by composing with the monomorphisms and . Under , the classifying map becomes . The equality of subobjects is . Transposing this equality gives , so exactly the coalgebra subobjects correspond to maps . Their pullback of is the desired subcoalgebra, and uniqueness follows from uniqueness of .
Thus we have finite limits, exponentials and a subobject classifier:The construction does not assume that preserves the underlying exponentials or underlying subobject classifier.