monadic
A functor is monadic when there is a monad on such that is equivalent to the forgetful functor .
Relevant implications
- equivalence implies continuous andmonadic andright adjoint
- full andmonadic implies equivalence
- monadic implies conservative andfaithful andright adjoint
*Those implications also require assumptions on the source or target category.
Examples
There are 3 functors with this property.
- contravariant power set functor
- forgetful functor for vector spaces
- identity functor on the category of sets
Counterexamples
There are 3 functors without this property.
Unknown
There are 0 functors for which the database has no information on whether they satisfy this property.
—