Write a coalgebra for a comonad as with , and . Since the Cartesian comonad preserves finite limits, the forgetful functor creates them: for an underlying limit of coalgebras, the maps induce a unique using . Its counit and coassociativity equations follow after every limiting projection, which jointly detect equality. The same argument makes the limiting cone universal among coalgebra cones. Thus is a Cartesian category; in particular, the product structure on is followed by the comparison .
An exponential object needs more than the underlying ambient . The cofree coalgebra functor is , with adjunction
The inverse sends to ; the comonad laws verify that these are inverse and that is a coalgebra map.
For and , put and in the ambient Cartesian closed category. Define by
and by transposing the composite
to obtain . Their cofree-adjoint transposes are coalgebra maps
Take their coalgebra equalizer , which exists by the finite-limit construction.
To verify its universal property, let transpose to . Its coalgebra transpose factors through exactly when . By the cofree adjunction, this equality is equivalent to . The first side is , because ; transposing the second side gives composed with the product coalgebra structure on . The equality therefore says exactly
with the canonical product comparison understood: precisely the condition that is a coalgebra map. Thus
naturally in the coalgebra . Its evaluation is ambient evaluation after , and the preceding condition makes it a coalgebra map. This equalizer is the coalgebra exponential, so the category of coalgebras is cartesian closed. This Cartesian closure for a finite-limit-preserving comonad uses no subobject classifier on .