For a comonad, a coalgebra is a map satisfying and . A morphism obeys . This is distinct from the tensor-based notion of a coalgebra in algebra.
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.
Let classify . In the cofree coalgebra , equalize the identity and . A map classifies a subcoalgebra exactly when , since this says the subobject equals the inverse image of its image under . Transposition gives precisely the displayed equalizer condition.
For a finite-limit-preserving comonad on a topos, start with the cofree coalgebra on the ambient exponential . Its underlying evaluation is . Transpose the two expressions and first using the ambient exponential and then the cofree adjunction. Their coalgebra equalizer represents exactly the maps whose evaluations respect coalgebra structure. Thus coalgebra exponentials need not be the underlying ambient exponentials.
For a comonad, the cofree coalgebra on is . A map transposes to the coalgebra morphism . This gives the adjunction with the forgetful functor.

Articles by others on the same topic (0)

There are currently no matching articles.