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 the (strict) 2-category of symmetric strict monoidal categories, symmetric strict monoidal functors, and monoidal natural transformations. Let be the version of this where the 1-cells are instead symmetric strong monoidal functors.
Is equivalent to ?
If we take lax monoidal functors then I know we get an adjunction (strictification theorem). We certainly get that here as well, but I'm wondering if asking for the 1-cells to be strong monoidal is enough to make it an equivalence.
Some evidence against is that is symmetric strict monoidal with defined as in , but that is not, since this would mean that , which isn't true in general. Is this enough to show that they're not equivalent?
For context, I've been working through this paper on tensor product structure for symmetric monoidal categories. While it deals with the lax monoidal case of this situation, much of it also applies to the strong monoidal case. In particular we have -- an isomorphism!
I was kind of expecting an equivalence , and I don't really understand why this isn't true (if indeed it is not).
I don't have a counterexample to hand, but in general the answer to this sort of thing is no.
Thanks! This is still very helpful.
Cartesian products give (2-categorical) biproducts for , see e.g. the appendix of this. As cartesian products are products also in , to prove that the two 2-categories not equivalent it should be sufficient to show that the product is not a biproduct in . First of all, the injection maps are defined by their projections so we can assume they behave in as they do in , i.e. the left injection sends an object to and similarly for the right injection. One can then cook up situations where there is no symmetrict strict monoidal map from that makes the required diagrams commute up to iso, even when the starting maps from and are strict (for instance, the "codiagonal" corresponds to the monoidal product, which is rarely isomorphic to a symmetric strict monoidal functor). Thus the product fails to be a coproduct in .
Nice argument! I "knew" these 2-categories couldn't be equivalent, but it would have taken me work to find a proof.
So you're saying that for a strict symmetric monoidal category , the monoidal product is usually not monoidally naturally isomorphic to a symmetric strict monoidal functor.
Let me think about why. For it to actually be a strict monoidal functor we'd need
and various related things. So these are the things we want to break.
I guess there's still some work left to do: the monoidal product is rarely strict itself, but now we must make cook up a situation where it's not even isomorphic to a strict monoidal functor.
Now I'm curious about strict symmetric monoidal categories where the monoidal product is strict monoidal. I know commutative monoidal categories are of this sort - those are symmetric monoidal categories where the symmetry, or braiding, is the identity. But are there others?
I ask because I know plenty of strict symmetric monoidal categories that are not equivalent commutative monoidal categories, like strictified versions of the category of finite sets, or finite-dimensional vector spaces.
@Martti Karvonen Excellent, thanks!
John Baez said:
Now I'm curious about monoidal categories where the monoidal product is strict monoidal. I know commutative monoidal categories are of this sort - those are symmetric monoidal categories where the symmetry, or braiding, is the identity. But are there others?
Are you asking about symmetric monoidal categories or non-symmetric ones?
Sorry, I actually meant strict symmetric ones - that's what's relevant here. I'll correct my comment.
Shouldn't Eckman-Hilton imply that these are exactly the commutative ones?
unless you meant "is monoidally isomorphic to a strict monoidal functor"
I guess you're right, they're just the commutative ones.
I was momentarily confused by the existence of medial semigroups that aren't commutative, where a semigroup is medial if it obeys (cd)(c'd') = (cc')(dd'). But a medial semigroup with an identity element is commutative (obviously), so this is irrelevant.
I did not mean "monoidally isomorphic", I meant "equals".
But I was leading up to a conjecture like this: if a symmetric monoidal category is not symmetric monoidal equivalent to a commutative one, it's not symmetric monoidal equivalent to one for which the tensor product is a strict monoidal functor.
It's interesting that for props the category doesn't seem to be symmetric monoidal in this way. In particular the object monoid of a prop is commutative for silly reasons and so we have that as defined above is strict monoidal at the level of objects. However, the arrow monoid of a prop need not be commutative and so fails to be a strict monoidal functor...
I'm confused about this today: In Hackney and Robertson's paper they claim that the category of props is self-enriched, and we seem to be talking about the same things.
Am I missing something, or is that not true?
I'm convinced that there is indeed an error in "On the Category of PROPs" by Hackney and Robertson.
In the single-coloured case they state that their notion of PROP is equivalently a symmetric strict monoidal category generated by a single object (top of page 3), and their notion of PROP homomorphism (Definition 7) is pretty clearly a symmetric strict monoidal functor. Their category of PROP transformations defines the tensor product on objects pointwise in the manner discussed above.
It follows that their Proposition 24 -- that is a PROP, is in fact false, as discussed above. It also follows that the category of PROPs is not in fact self-enriched. Similarly, Proposition 38 and Theorem 39 do not in fact hold. Theorem 39 -- that the category of PROPs is monoidal closed -- is a major contribution of the paper, which has been cited 20 times. This is somewhat concerning.
It doesn't seem like we can expect the situation with PROPs to be significantly simpler than the general one described by Schmitt.
That is, the 2-category of PROPs, strong monoidal functors, and monoidal transformations ought to admit a "lax symmetric monoidal 2-categorical structure", and to be "lax closed" with respect to it.
You should email the authors. I know for a fact that Philip would like to chat about this. And he’s nice!
That's a good idea :)
I chatted with @Chad Nester and I think we worked out what's going on here. The set of colors of the internal hom between two props is the set of prop maps. But if you regard this internal hom as a symmetric strict monoidal category, then its set of objects consists of finite ordered lists of prop maps. i.e. apply the free monoid monad to the set of colors to get the set of objects.
So one doesn't need to worry about evaluating the tensor product of two prop maps at an object or a morphism, since the tensor product of two prop maps isn't itself a prop map.
We didn't emphasize this point about the internal hom in the paper since we were usually thinking about props as props and not as symmetric strict monoidal categories.