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.
In order theory, the following definition is useful
image.png
This can be generalized to a functor . Is this useful somewhere? Does this have a right adjoint?
See Ordinal Sums and Equational Doctrines by Lawvere. It plays a role similar to simplicial joins.
So the idea is that given two categories and we form the coproduct and then create a larger category that has the same objects and all the morphisms in , together with a unique morphism from any to any , and the more or less obvious rule for composing these? I feel there should be a slicker way to say what I just said, involving and its obvious functor to category . If I had more energy I'd look at Lawvere's paper, which would help.
My guess is it's the category where each is the apex of a cone over and each is the apex of a cocone under .
Actually here's what I was groping toward: the [[comma category]] of the functors , where is the 'walking arrow' category and objects of get mapped to while objects of get mapped to .
I don't think that's the same thing though. I think that ends up being the same as .
Ugh. A comma object is too "limity", I'm looking for something colimity.
I suspect this is a relevant section from the paper by Lawvere mentioned above:
ordinal sum
See also: https://ncatlab.org/nlab/show/ordinal+sum#ordinal_sum_of_categories
Interestingly, that nlab article also notes that the ordinal sum may be viewed as "the collage of A and B along the terminal profunctor". Since this situation involves adding in morphisms between two categories, I was wondering if profunctors could be involved!
Thanks! I like that nLab description. If you think of a profunctor from A to B as giving a set of arrows ("heteromorphisms") from each object of A to each object of B, the terminal profunctor will give just one arrow from each object of A to each object of B - a nice example of the dictum "the terminal thing has just one of everything it needs to have".
So then yes, taking the [[collage]] of the terminal profunctor from A to B will have the desired effect.
David Egolf said:
I suspect this is a relevant section from the paper by Lawvere mentioned above:
ordinal sumSee also: https://ncatlab.org/nlab/show/ordinal+sum#ordinal_sum_of_categories
Interestingly, that nlab article also notes that the ordinal sum may be viewed as "the collage of A and B along the terminal profunctor". Since this situation involves adding in morphisms between two categories, I was wondering if profunctors could be involved!
The diagram shown in the nLab article, of shape
whose colimit defines the ordinal sum, is the exact same shape as the diagram one would use to form the simplicial sum, say in the category of topological spaces or the category of simplicial sets, where one replaces the Cat-interval with the topological interval . That's what I meant in my earlier comment when I said the ordinal sum is similar to the simplicial join.
For example, the simplicial join of a space with a point is the cone on .
In response to a question above: I don't believe the ordinal sum has a right adjoint, either in joint arguments nor in separate arguments. However, if I'm not mistaken, it does provide a monoidal product, whose unit is the initial category/space/whatever.
Just to add that the collage gives us a way to represent relations in enriched categories. In ordinary (more specifically regular) categories one typically uses spans to represent relations, but in enriched categories spans work only in exceptional cases, while cospan (collages, cographs) work more generally. An example where both spans and cospans can be used to represent relations (profunctors) are poset and also cat-enriched categories.
Cool! Thanks for the answers and comments everyone.
This is the [[collage]] of the terminal profunctor between two categories (i.e. the profunctor such that for every and ).
This should satisfy @John Baez's thirst for colimits :)