Structure

comonadic

A functor F:C→DF : \C \to \D is comonadic when there is a comonad TT on D\D such that FF is equivalent to the forgetful functor UT:CoAlg(T)→DU^T : \CoAlg(T) \to \D. In older literature, where comonads are called cotriples, comonadic functors are called cotripleable.

Relevant implications

Examples

There are 14 functors with this property.

Counterexamples

There are 42 functors without this property.

Unknown

There are 0 functors for which the database has no information on whether they satisfy this property.

—