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.
Consider the 1-category where the objects are categories and the morphisms are cofunctors, aka [[retrofunctor]] s. Does this category have products or pullbacks? If so, what are they?
Yes, the 1-category of categories and retrofunctors has all limits. This is Corollary 8.78 in Polynomial Functors: A Mathematical Theory of Interaction.
I thought I remembered the book having an explicit description of products, but I couldn't find it, so perhaps it was only in a previous version.
Thanks! The proof there is rather indirect, so I still have the question of what they are explicitly.
Is this the category of polynomial comonads on , in other words the category of comonoids wrt polynomial composition?
If so, then let be the right adjoint to the forgetful functor , which is comonadic. preserves products, so that a product of cofree comonoids can be formed as .
Meanwhile, by comonadicity, a general comonoid is canonically represented as an equalizer of maps between cofree comonoids (formed at the level of underlying polynomial functors):
where is the unit of the adjunction. Given a family of comonoids , their product is the equalizer of
(This equalizer exists because as an example of a connected limit, it is created/reflected by , as Niu and Spivak remark.) I don't know how satisfying explicit this is for your purposes, but it's the formal dual of the construction recounted as Theorem 2.2 here.
It’s implicit in Todd’s answer that you should actually expect products of categories to be hard in retrofunctor-land in the same way that coproducts of algebras are usually very complicated.
Which is possibly disappointing.