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.
John Baez said:
Asad Saeeduddin said:
this is probably a question for a different thread, but I was wondering if there is such a thing as a "free pseudofunctor to the bicategory of pseudomonoids" for any monoidal bicategory. if so, since Cat is a monoidal bicategory, does the free pseudofunctor to the bicategory of monoids of Cat give us on 1-cells (functors) the corresponding "free monoidal functor" in some sense?
I'm not sure I understand this. Let's see. In any monoidal bicategory C we can define pseudomonoids, and we get a bicategory (not monoidal!) of pseudomonoids in C - call it Ps(C).
There's always a forgetful functor U: Ps(C) C since any pseudomonoid has an underlying object: it's an object together with some other stuff.
I imagine you're asking if U has a left adjoint F: C Ps(C) sending any object to the free pseudomonoid on that object.
This clearly won't work unless C has enough 2-colimits!
It's probably best to start one level down: in any monoidal category C we can define monoids, and we get a category Mon(C) and a forgetful functor U: Mon(C) C, and we can ask if this has a left adjoint F: C Mon(C).
If C = Set with its cartesian monoidal structure, the answer is "yes", and we have
So here we are taking a coproduct. In the category of finite sets this wouldn't work!
So assuming our monoidal bicategory is "cocartesian" (in some sense suitable for bicategories), do we indeed have a free pseudofunctor to its bicategory of pseudomonoids?
does the monoidal structure in question need to be related to the cocartesian structure in some way?
or, to take the analogous specialization of C = Set: is there a 2-functor Cat -> MonCat
from the 2-category of small categories and functors to the 2-category of monoidal categories and (lax/strong?) monoidal functors?
There's too much to say about all this. But in the example I gave, of "the free monoid on a set", we took advantage of the fact that Set has countable coproducts, finite products, and products distribute over coproducts. That's what we use to show
is a monoid and in fact the free monoid on . So you can generalize this idea in various ways.
Other examples work differently!
Exercise: work out the multiplication in and show it's associative.
I think I can see how to generalize the concept of products distributing over coproducts via the idea of a distributive monoidal category (i don't think the actual projections of a product are relevant). But I'm not sure what the analog of "countability" for coproducts is
I think a useful level of generality is a monoidal category with countable coproducts where the tensor product distributes over countable coproducts. In any category of this sort, the formula I gave (using tensor powers instead of cartesian powers) gives the free monoid. For example (Vect, ) or (AbGp, ) or (Set, ) are all like this.... and lots more too.
In fact all these examples have all coproducts, not just countable ones.