You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.
Let be a monoidal category. Under what conditions does the category have pushouts? This nlab article says that if is cocomplete and is closed then the free monoid construction can be used to construct certain pushouts but not all of them. More specifically, if is the free monoid functor (which exists by a theorem of MacLane section VII), then pushouts over maps
exist. A more detailed construction of these pushouts can be found in Lemma 5.2 of this paper. Do pushouts of monoids not exist more generally in a cocomplete monoidal closed category? Does anyone know of a counterexample?
maybe if ⊗ is not symmetric you can have issues?
given that Mon(C) is monadic over C under those conditions if we add that C is locally presentable and ⊗ is symmetric https://ncatlab.org/nlab/show/category+of+monoids#local_presentability
If is locally presentable, then so is , hence cocomplete, with colimits constructed by transfinite iteration. Similar arguments should work if has other good properties like being totally cocomplete or locally bounded. Symmetry plays no role here.
my counterexample-generating trick of suggesting a non-symmetric ⊗ has failed :(
sarahzrf said:
my counterexample-generating trick of suggesting a non-symmetric ⊗ has failed :(
oh no
Mike Shulman said:
If is locally presentable, then so is , hence cocomplete, with colimits constructed by transfinite iteration. Similar arguments should work if has other good properties like being totally cocomplete or locally bounded. Symmetry plays no role here.
What do you mean by transfinite iteration?
Take the pushout in , generate the free monoid from it, take a coequalizer in to quotient out the freely added stuff that shouldn't be there, etc.
If I had to bet, I would bet that if is merely cocomplete and monoidal, might not have pushouts, but I don't have any counterexamples immediately to hand, since categories that are cocomplete but not locally bounded are hard to come by.
However, if is closed monoidal and cocomplete, I'm pretty sure that is also cocomplete. I think the trick is that under these hypotheses the free-monoid functor preserves reflexive coequalizers, hence monoids are closed under reflexive coequalizers. Now you can build any colimit of monoids out of coproducts of free monoids (which always exist since the free-monoid functor preserves colimits) and reflexive coequalizers.
Mike Shulman said:
Take the pushout in , generate the free monoid from it, take a coequalizer in to quotient out the freely added stuff that shouldn't be there, etc.
I'm sort of confused...maybe you can help. It seems like the proof of cocompleteness you linked relies on the fact that is a reflective subcategory. I don't see how this is true, if you take the free monoid on a monoid it is in general much larger than the original monoid so the counit of this adjunction isn't an isomorphism?
is a reflective subcategory of , not itself.