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.
Suppose that is a category together with a terminal object and a product
of and for every pair of objects .
We obtain a bifunctor by defining for every and .
We can also check that if we define:
,
,
then, are natural transformations.
Finally, we can check that is a monoidal category.
Let's call such a monoidal category a cartesian monoidal category.
Question: Is a monoidal category such that is a terminal object and the underlying object of a product of and for every necessarily a cartesian monoidal category?
In fact, I'm more interested into this question for now, where the hypotheses are stronger:
Question 2: Consider a monoidal category such that is a terminal object, and such that there exists a family of products of and for every which verifies:
Is necessarily a cartesian monoidal category?
In fact, the stronger statement is true that a monoidal category for which each is necessarily cartesian. This follows from this characterisation of cartesian monoidal categories.
Thanks. I’m still trying to understand this MO question and its answers.
I trust you that it answers “Yes” to my second question. But does it really answer “Yes” to the first question? I don’t see how the equation from your MO question is implied by without any additional condition on how a tensor product of morphisms is related to the projections and universal properties of the products .
Yeah, I don't see anyone showing that a monoidal category such that for each pair of objects is necessarily a cartesian monoidal category! That feels impossible to prove, because there's so little you can do with equations between objects... but I would really like to see a counterexample.
Is it possible to take a cartesian monoidal category and change the associator to get a noncartesian monoidal category? There's a lot known about how you can take a monoidal category and "twist the associator by a cocycle" to get a new, inequivalent monoidal category. But I've never seen this done starting from a cartesian monoidal category.
Sorry, that was meant to be in response to question 2. You don't need to require to be terminal: this is implied.
John Baez said:
Is it possible to take a cartesian monoidal category and change the associator to get a noncartesian monoidal category? There's a lot known about how you can take a monoidal category and "twist the associator by a cocycle" to get a new, inequivalent monoidal category. But I've never seen this done starting from a cartesian monoidal category.
That’s a very good question. I have no idea.
A positive answer to question 2 would imply that it is not possible to change the associator (at least not without also changing the tensor products).
Hmm, I see.
(The reason is that the positive answer to question 2 is roughly “binary tensor product induced by binary products” implies “cartesian monoidal category”.)
I notice John has asked your second question over on MathOverflow...
@John Baez, if I'm not mistaken, we already know that the answer to your MO question is "No". What we still don't know is whether there are monoidal categories such that is a product of and but the monoidal category is not a cartesian monoidal category.
I noticed a gap in my reasoning, so I'm no longer sure it is true.
I think I got carried away and specified not only on objects but on morphisms. Is that what your point was, @Jean-Baptiste Vienney? That if we take a cartesian monoidal category, we can't make it noncartesian by just changing the associator and unitors while keeping unchanged on objects and morphisms, and keeping the unit object unchanged?
(Regardless of whether it's true or not, was this your point?)
Yes, it was my point.
I don't know why @Nathanael Arkor is suddenly no longer sure about this. Isn't it a consequence of the answers to your MO question?
The MO answer just shows that you do have cartesian monoidal structure, but not necessarily that the cartesian monoidal structure coincides with the original monoidal structure.
I thought it was implied by the end of Tim Campion's answer:
here
We would need the identity to be a strict monoidal functor for it to imply the statement you want, no?
(This question was asked before on MathOverflow, without any answers.)
It's not clear to me why you couldn't have an automorphism on each object, such that is given by postcomposing the projection by the automorphism.
it is not a natural isomorphism?
Nathanael Arkor said:
We would need the identity to be a strict monoidal functor for it to imply the statement you want, no?
Yes, that's true. But I'm a bit surprised that we could have two equivalent but nonequal monoidal structures with being the same product of and in the two cases. What would be less surprising to me would be to have two equivalent but nonequal monoidal structures with being a product of and and being another product of and .
Nathanael Arkor said:
It's not clear to me why you couldn't have an automorphism on each object, such that is given by postcomposing the projection by the automorphism.
I think you can do this. I was thinking exactly about this a few hours ago. For a concrete example, you can verify that chosing and given by and makes into a product of and in for any field .
It will give you a monoidal category with unitors sending to and to .
It comes from "an object isomorphic to a product is a product". You instanciate the precise version of this proposition to an automorphism.
I have attempted to improve my Math Overflow question, @Jean-Baptiste Vienney. I have gotten rid of the old one, which indeed seems likely to have a negative answer.
Nice!
That's a different story, but now I'm wondering if a monoidal category equivalent as a monoidal category to a cartesian monoidal category is not necessarily a cartesian monoidal category.
Because of the universal property of products which make some morphisms unique.
now I'm wondering if a monoidal category equivalent as a monoidal category to a cartesian monoidal category is not necessarily a cartesian monoidal category.
It depends on how you define 'cartesian monoidal category'. It's interesting that the nLab does not really define a cartesian monoidal category. It says some words, but they are open to several interpretations.
I defined 'cartesian monoidal category in my post in a way that's not elegant, but manifestly invariant under equivalent.
Jean-Baptiste Vienney said:
Suppose that is a category together with a terminal object and a product
of and for every pair of objects .We obtain a bifunctor by defining for every and .
We can also check that if we define:
,
,
then, are natural transformations.Finally, we can check that is a monoidal category.
Let's call such a monoidal category a cartesian monoidal category.
Like this. I think it is the same definition as in Categories for the Working Mathematician. I'm just being very explicit.
Jean-Baptiste Vienney said:
It will give you a monoidal category with unitors sending to and to .
I believe this does not work since the unit law is not satisfied, as it would mean ?
I believe any expert would tell you that if you have a cartesian monoidal category, any other monoidal category that's equivalent to it as a monoidal category must also be cartesian monoidal. They might, however, not have a specific definition of 'cartesian monoidal category' in mind!
In my MathOverflow question, @Jean-Baptiste Vienney, it seems I started with your definition of 'cartesian monoidal category' - but then I added something to make sure every monoidal category that's monoidally equivalent to a cartesian monoidal category is again cartesian monoidal!
Because I don't want to be using definitions that aren't invariant under equivalence.
Anyway, it's an interesting question whether your definition is already invariant under equivalence.
I see. The two questions are separated as you wrote it, so no worries.
Clémence Chanavat said:
Jean-Baptiste Vienney said:
It will give you a monoidal category with unitors sending to and to .
I believe this does not work since the unit law is not satisfied, as it would mean ?
We have to be very precise.
We should apply the second claim carefully to the product in the first claim to see what is the structure of monoidal category obtained.
I would like to improve the nLab a little, so it gives an unambiguous definition of cartesian monoidal category.
Note that it does mention a theorem about cartesian monoidal categories:
Moreover, one can show (e.g. Fox 1976 or Heunen-Vicary 2012, p. 79 (p. 85 of the pdf)) that any symmetric monoidal category equipped with suitably well-behaved diagonal and augmentation maps must in fact be cartesian monoidal.
For this theorem to be true, we need a definition of cartesian monoidal category that's invariant under monoidal equivalence... because the 'suitably well-behaved' conditions are invariant.
And presumably these authors stated a definition of cartesian monoidal category, so they could prove the theorem!
Heunen-Vicary define a cartesian monoidal category as one such that is a product of and which is rather unsatisfying.
This is page 135 in this book.
Yikes! :face_with_spiral_eyes:
Well, at least that makes it very easy to prove that various kinds of categories are cartesian monoidal.
It just makes it hard to prove that cartesian monoidal categories have other interesting properties, e.g. that their associators are 'what you'd expect'.
Hmm, actually on page 135 they don't seem to officially define 'cartesian monoidal category' - they just have Theorem 4.28 saying that a monoidal category is Cartesian iff something else. But I think you are questioning Theorem 4.28.
Yes but look at this:
Screenshot-2024-07-24-at-12.03.21PM.png
And they don't prove anything more than that.
Which means it is their definition of cartesian monoidal category.
Clémence Chanavat said:
Jean-Baptiste Vienney said:
It will give you a monoidal category with unitors sending to and to .
I believe this does not work since the unit law is not satisfied, as it would mean ?
I you apply the definitions, you will see that the associator is given by and it do makes the triangle diagram of a monoidal category commutes.
For starters, with such projections associates to .
Then, the unitors of the monoidal category are given by and . is given as usual by . And the associator is as written just above.
Note that this is a cartesian monoidal category according to the definition given in the first message.
@Jean-Baptiste Vienney - Now I don't think Heunen and Vicary are proposing a definition of cartesian monoidal category! I think their theorem says "if a monoidal category can be equipped with this extra structure, then it's a cartesian category" - a category with finite products.
@Jean-Baptiste Vienney yes my bad, you're right, i just wrongly assumed that the associator would stay the same...
@John Baez , I agree! So I was a bit harsh with them. They don't do anything wrong. But maybe their theorem could be made into a more complete statement.
@Clémence Chanavat No worries, I was not completely confident before checking everything.
I posted an answer to the old MO question.
My go-to definition of “cartesian monoidal category” is a monoidal category such that
I know for sure that this definition is one that makes “Fox's theorem” work, that is, a symmetric monoidal category is cartesian if and only if it has a (necessarily unique) supply of natural comonoids.
Of course there may be other more succinct equivalent definitions.
Hmm, this is an interesting definition since it implies that and (I denote the product spans by ).
@Amar Hadzihasanovic, I'm also able to show that it implies .
But do you know if it implies that the associator is obtained in the natural way from the projections?
i.e. if it implies that
?
I think it must, but I don't know the argument.
It would be really cool because then I will finally know a good definition of cartesian monoidal category.
Yes, it does, I don't know if there's a good non-explicit argument though. Here's a diagram showing it for the first component
1043bf51-06bd-42a8-a78d-9531706b872d.jpg
I also like this definition because its first point on its own (the unit is terminal) is the definition of a semicartesian monoidal category, and one of the good things of semicartesian monoidal categories is that they come equipped with natural “projections” defined in the way that I did.
Some of my favourite monoidal categories are semicartesian.
So then being cartesian becomes “semicartesian + the natural spans of projections are universal”.
I think there ought to be a coherence result for semicartesian monoidal categories which extends the one for monoidal categories to diagrams also including the , but I don't know if it is proven somewhere.
Amar Hadzihasanovic said:
So then being cartesian becomes “semicartesian + the natural spans of projections are universal”.
I think that this is the condition that's easiest to check in practice to see whether a monoidal category is cartesian.
I've tried to construct examples of non-cartesian monoidal categories where the monoidal structure on objects is given by products as an MO answer. I'm worried about having missed something though, which happens incredibly easily with this sort of thing. So I'd appreciate some careful checks.
There's a characterization of cartesian monoidal categories involving diagonals, isn't there? It says that if you are semicartesian monoidal (unit object is terminal) and you have a natural transformation with components then you must be cartesian (again with the projections that Amar mentioned)?
Are you alluding to Fox's theorem or something else?
Fox's theorem, translated to sound more like what you just said, says that a category is cartesian iff there's a unique way to give each object a cocommutative comonoid structure , , and these morphisms define natural transformations.
One can imagine ways of trying to strengthen this result by weakening the hypotheses. Can we do it? Like: what if we drop the word "unique"?
John Baez said:
Are you alluding to Fox's theorem or something else?
Something else (but obviously closely related), as discussed here: we don't need to demand uniqueness of the diagonals, only that it is both natural and monoidal (at which point uniqueness must follow, I gather). The difference being that we don't impose coassociativity on , for instance.
I should really improve the nLab when it comes to cartesian monoidal categories. If you search for [[cartesian category]] you get sent to [[cartesian monoidal category]], which doesn't really give a precise definition of cartesian monoidal category. And it looks like there are more characterizations that need to be added!
Amar Hadzihasanovic said:
Yes, it does, I don't know if there's a good non-explicit argument though. Here's a diagram showing it for the first component
Thanks a lot!
This is curiously (or not curiously) similar to a diagram I wrote to show that the multiplication of an oplax monoidal functor in a cartesian monoidal category is necessarily .