Category Theory
Zulip Server
Archive

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.


Stream: theory: category theory

Topic: Pushouts of Monoids


view this post on Zulip Jade Master (May 07 2020 at 00:11):

Let (C,,I)(C,\otimes,I) be a monoidal category. Under what conditions does the category Mon(C)\mathsf{Mon(C)} have pushouts? This nlab article says that if CC is cocomplete and \otimes is closed then the free monoid construction can be used to construct certain pushouts but not all of them. More specifically, if T:CMon(C)T : C \to \mathsf{Mon}(C) is the free monoid functor (which exists by a theorem of MacLane section VII), then pushouts over maps
T(A)T(f)T(B)gX T(A) \xleftarrow{T(f)} T(B) \xrightarrow{g} X
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?

view this post on Zulip sarahzrf (May 07 2020 at 00:23):

maybe if ⊗ is not symmetric you can have issues?

view this post on Zulip sarahzrf (May 07 2020 at 00:24):

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

view this post on Zulip Mike Shulman (May 07 2020 at 00:24):

If CC is locally presentable, then so is Mon(C)\mathsf{Mon}(C), hence cocomplete, with colimits constructed by transfinite iteration. Similar arguments should work if CC has other good properties like being totally cocomplete or locally bounded. Symmetry plays no role here.

view this post on Zulip sarahzrf (May 07 2020 at 00:26):

my counterexample-generating trick of suggesting a non-symmetric ⊗ has failed :(

view this post on Zulip Jade Master (May 07 2020 at 00:26):

sarahzrf said:

my counterexample-generating trick of suggesting a non-symmetric ⊗ has failed :(

oh no

view this post on Zulip Jade Master (May 07 2020 at 00:27):

Mike Shulman said:

If CC is locally presentable, then so is Mon(C)\mathsf{Mon}(C), hence cocomplete, with colimits constructed by transfinite iteration. Similar arguments should work if CC has other good properties like being totally cocomplete or locally bounded. Symmetry plays no role here.

What do you mean by transfinite iteration?

view this post on Zulip Mike Shulman (May 07 2020 at 00:29):

Take the pushout in CC, generate the free monoid from it, take a coequalizer in CC to quotient out the freely added stuff that shouldn't be there, etc.

view this post on Zulip Mike Shulman (May 07 2020 at 00:29):

https://ncatlab.org/nlab/show/transfinite+construction+of+free+algebras#colimits_of_algebras_for_a_monad

view this post on Zulip Mike Shulman (May 07 2020 at 00:32):

If I had to bet, I would bet that if CC is merely cocomplete and monoidal, Mon(C)\mathsf{Mon}(C) 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.

view this post on Zulip Mike Shulman (May 07 2020 at 00:37):

However, if CC is closed monoidal and cocomplete, I'm pretty sure that Mon(C)\mathsf{Mon}(C) 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.

view this post on Zulip Jade Master (May 07 2020 at 01:26):

Mike Shulman said:

Take the pushout in CC, generate the free monoid from it, take a coequalizer in CC 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 Mon(C)C\mathsf{Mon}(C) \hookrightarrow C 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?

view this post on Zulip Mike Shulman (May 07 2020 at 02:08):

TAlgT \mathrm{Alg} is a reflective subcategory of T/CT/C, not CC itself.