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.
Does anybody know about an adjunction between SMC = [symmetric monoidal categories, symmetric monoidal functors] and SMC_lax = [symmetric monoidal categories, lax symmetric monoidal functors]? I don't have much intuition for adjoints of inclusions of wide subcategories.
There's a left adjoint to the inclusion of SMC into SMC_lax, by Theorem 3.13 of Two-dimensional monad theory using the 2-monad for symmetric monoidal categories.
Nice, this is perfect. Do you have any intuition for what the left adjoint should do?
Adds formal inverses to the lax arrows?
Edit: That would be my intuition for a right adjoint, but it's not so clear this is accurate for a left adjoint.
I think it's probably non-identity on objects.
I'll use U for SMC->SMC_lax, which is identity on objects, and F for its left adjoint. We should get that lax monoidal functors X->UY=Y are the same as monoidal functors FX->Y. So I don't think it would do much for it to just be identity on objects and "fix" the morphisms.
I've not thought about this before, so this may be nonsense, but here's an idea. Let contain and also contain another monoidal structure , then we can add a morphism for each pair of objects in . Then a strong monoidal functor sends , which simulates the action of a lax monoidal functor to some extent. The unit would work in the same way. Maybe this can be made more precise to properly characterise the left adjoint.
(The left adjoint is called the "lax morphism classifier" if that helps to search for examples.)
I have some particular cases in mind that I'll have to check that against, but it sounds good so far.
I see. The left adjoint needs to make a symmetric thing act like a directed thing, not vice versa.
I was thinking about this, and I realized the first thing I said doesn't even really make sense. Like, if that's how the right adjoint acts, you still can't just modify by inverting the lax stuff for a specific functor. So, does a right adjoint just add formal inverses to every arrow, essentially?
It seems, prima facie at least, that just adding inverses might not work, because then functors in ( being the proposed 'add formal inverses') could actually be oplax instead of lax (or some kind of mix where the tensor part is oplax but the unit is lax, or vice versa).
I think if a right adjoint existed, it'd have to do something like add inverses for every possible functor. But as you say, this would seem to add too many morphisms to recover an exact correspondence with lax functors: there's nothing stopping you from mapping to the formal inverses that are irrelevant for any given functor. So there should be more functors to this category with formal inverses than there are lax functors. I think, then, a right adjoint is unlikely to exist in general.