MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

In order to test the monadicity of a functor, there is a precise monadicity theorem (PM) as well as a crude monadicity theorem (CM), see the nlab. In CM, the forgetful functor should create reflexive coequalizers.

What is a nice and specific example which shows that CM is only sufficient, but not necessary; i.e. what is a monad which doesn't preserve reflexive coequalizers? I couldn't find such an example.

Besides, is the condition in CM satisfied in almost all practical / non-pathological examples? For example it holds for algebraic monads on $\mathsf{Set}$. What is the intuitive difference between PM and CM? The background for this rather soft question is the following: I would like to prove a certain theorem about certain monads, and in one step it would be very convenient if the monad preserved reflexive coequalizers. Now I wonder if there is any problem when I just add this assumption to the theorem.

Given a monad defined by generators and relations (on a category different from $\mathsf{Set}$), how can I test practically if the forgetful functor creates reflexive coequalizers?

share|cite|improve this question
up vote 11 down vote accepted

For $X$ an infinite set, the monad $(-)^X$ (induced from the comonoid structure on $X$ with respect to cartesian product) does not preserve reflexive coequalizers. See page 538 of this paper by Adámek, Koubek, and Velebil. Correspondingly, the forgetful functor for the category of algebras does not preserve reflexive coequalizers (hence also cannot reflect/create them since the forgetful functor reflects isomorphisms).

Any finitary (i.e., filtered-colimit preserving) monad on $Set$ does preserve reflexive coequalizers, because finitary powers $(-)^n$ do. This implies that the forgetful functor will reflect reflexive coequalizers. So the practical difference shows up in finitary vs. infinitary monads.

share|cite|improve this answer
Thank you for this instructive example. The coequalizer of $f^I,g^I$ in that example is the set of equivalence class of "numberings" of $I$, where two such numberings are equivalent iff their difference is bounded. Thus if $I$ is finite, there is only one class, but if $I$ is infinite, there will be many classes. // Instead of $(-)^X$ we could also take the power set monad? – Martin Brandenburg Jan 5 '13 at 13:45
Yes, good question. I'm not sure off-hand for the covariant power set monad, whose algebras are sup-lattices, but I'll think about it. However, for the double power-set monad where the monadic functor can be identified with $P: \mathrm{Set}^{op} \to \mathrm{Set}$, it's true that this monad preserves reflexive coequalizers (and in fact it's the crude monadicity theorem which is typically used here, as in Mac Lane-Moerdijk, IV.5 theorem 2 (page 182 in my edition)). So you're right that some infinitary monads do preserve reflexive coequalizers. – Todd Trimble Jan 5 '13 at 15:53
The same example works for the power set monad. – Martin Brandenburg Jan 12 '13 at 16:19
I'm glad you worked that out, Martin, because I had forgotten my promise to think about it. :-( – Todd Trimble Jan 12 '13 at 17:06

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.