Category Theory
Zulip Server
Archive

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.


Stream: learning: questions

Topic: Gluings vs colimits


view this post on Zulip James Deikun (Jan 17 2024 at 14:19):

Is there a way to recognize gluings in the strict sense, i.e. unions with identifications of subobjects, from general colimits, by the presheaves they generate? I can recognize them in their conical presentation: they're the ones where all the arrows in the diagram map to monos. But do "gluings of representables" have any interesting property?

view this post on Zulip James Deikun (Jan 17 2024 at 21:39):

For an [[Eilenberg-Zilber category]], gluing constructs presheaves where every cell with a degenerate face is itself degenerate. This shows that there at least is a distinction. But it would be nice to have something in a more general setting.

view this post on Zulip Mike Shulman (Jan 17 2024 at 21:49):

I don't quite understand what you mean by "gluings".

view this post on Zulip James Deikun (Jan 17 2024 at 21:53):

"Gluings of representables" means a colimit (possibly one of the large ones that happens to exist) where the objects in the diagram are representables and the arrows are monomorphisms.

view this post on Zulip Mike Shulman (Jan 17 2024 at 21:58):

The arrows in the diagram, but not necessarily the cone coprojections from the objects in the diagram to the colimit?

view this post on Zulip James Deikun (Jan 17 2024 at 21:59):

That's right.

view this post on Zulip Mike Shulman (Jan 17 2024 at 22:06):

Interesting. I guess how many presheaves you can get this way depends a lot on how many monomorphisms there are in the domain category. For instance, if the only monomorphisms therein are identities, I expect the only presheaves you can get this way are coproducts of representables; while if all morphisms therein are monomorphisms you should be able to get all presheaves this way.

view this post on Zulip James Deikun (Jan 17 2024 at 22:13):

Yeah. The intermediate situations like EZ-categories are the most interesting to me, but both those extremes are definitely possible.

view this post on Zulip Nathanael Arkor (Jan 17 2024 at 22:27):

It seems surprising to me that one can say much about presheaves corresponding to diagrams whose image satisfies some property (since, intuitively, it is primarily the shape of the diagram that controls the "appearance" of the colimit). Are there analogous classes of diagrams (i.e. whose image satisfies some property that can't be expressed as a property of the domain) whose corresponding presheaves do have a nice characterisation?

view this post on Zulip Mike Shulman (Jan 17 2024 at 22:30):

Well, there are plenty of cases where a condition on the image of a diagram of a particular shape controls the behavior of the colimit, e.g. quotients of equivalence relations, pushouts of monos, and more general "lex colimits".

view this post on Zulip Nathanael Arkor (Jan 17 2024 at 22:33):

I recalled there were some analogous conditions in the theory of lex colimits. But in these cases, it is not possible to characterise the presheaves corresponding to such diagrams, right? At least, not without using a different notion of colimit?

view this post on Zulip Mike Shulman (Jan 17 2024 at 22:35):

I don't know of such a characterization.

view this post on Zulip Nathanael Arkor (Jan 17 2024 at 22:40):

(The question seems interesting, in any case.)

view this post on Zulip John Onstead (Jan 18 2024 at 02:38):

I'm also a little curious about this. I know a diagram in C can be represented as a functor F: J -> C from an index category J (and the conical limit of this diagram can be expressed as a universal property/natural transformation in the functor category). Let's say for example that J is the category 2, the "walking arrow", so the diagram will be a morphism A -> B in C. But what if we then wanted to specify that the morphism was a monomorphism? Would it be possible to "convert" our functor F: 2 -> C into a functor G: WM -> C where "WM" represents some hypothetical "walking monomorphism" category (if that even exists), so that we now have a diagram that satisfies the monomorphism property explicitly? More generally, if we had some diagram F: J -> C and wanted to specify some of the morphisms were monomorphisms, could we find some index category K and functor G such that G: K -> C would only select diagrams in C with monomorphisms where we want them?

view this post on Zulip Mike Shulman (Jan 18 2024 at 03:12):

There isn't a "walking monomorphism" in the world of ordinary categories, since not all functors preserve monomorphisms, but you can do something similar in other worlds. For instance, an [[M-category]] has a specified subclass of morphisms that you can treat like monomorphisms, and then there's a walking one of those. Or in the world of categories with finite limits and finitely continuous functors, since finitely continuous functors preserve monomorphisms there is a walking monomorphism; this leads in the direction of [[lex colimits]].

view this post on Zulip John Onstead (Jan 18 2024 at 05:31):

That's very interesting! I assume the dual is true, that in the category of categories with finite colimits and finitely cocontinuous functors one has a "walking epimorphism". Also, since pullbacks preserve monomorphisms, it seems that one can find some category of categories with all pullbacks and pullback-preserving functors, which may also work.
I guess I'm just wondering what the walking monomorphism category in this context "looks like", if that's known? The walking arrow and isomorphism have two objects, but I doubt that's enough to define the walking monomorphism?

view this post on Zulip Mike Shulman (Jan 18 2024 at 05:34):

I don't know; it seems like it might be kind of large because it has to have all finite limits.

view this post on Zulip Kevin Arlin (Jan 18 2024 at 21:43):

Maybe a nice picture of a "walking monomorphism" is in the category of categories with merely pullbacks, rather than all finite limits. I think that the classic sketch of a mono, a category containing a map f:abf:a\to b such that the projections out of the pullback of along itself are both the identity of aa, already has pullbacks since a cospan has to be built out of two ff's, an ff and an identity, or two identities.

view this post on Zulip Mike Shulman (Jan 18 2024 at 23:15):

That sounds plausible.

view this post on Zulip John Onstead (Jan 18 2024 at 23:34):

I found this article today on the n-cat cafe where they discuss a puzzle to find the walking epimorphism (I think!). They did so within the category of finitely complete linear categories and found it to be the category of monos over FinVect via "Gabriel-Ulmer duality". If one drops the "linear" and works with just Set-enriched categories, in the category of finitely complete categories, it may be that the walking epimorphism is the category of monos over FinSet. So it indeed isn't "small". However, Kevin Arlin's walking mono is within a different category of categories, that of categories with pullbacks, so it indeed might be as small as two objects as he indicated within that setting.

view this post on Zulip James Deikun (Jan 21 2024 at 11:52):

Going back to the original question: given a presheaf F:CopSetF : C^\mathrm{op} \to \mathsf{Set} and the comma category y/Fy/F, call an object nondegenerate if all the arrows out of it lie over monomorphisms in CC. Yoneda of the canonical projection from the (full) subcategory of nondegenerate objects then forms a gluing diagram, and the nondegenerate objects themselves form a cocone under this diagram. When is this cocone colimiting? Exactly when the inclusion of the nondegenerate objects, dd, is a final functor. But what does this mean?

Well, it means, for each object XX of y/Fy/F, the comma category X/dX/d is (non-empty and) connected. In particular:

view this post on Zulip James Deikun (Jan 21 2024 at 11:58):

Now, given that FF is the colimit of a gluing diagram, are these conditions true? I haven't got so far on that part.

view this post on Zulip James Deikun (Jan 21 2024 at 12:37):

What is an object of y/Fy/F in this case? Well, whenever there's an object XX of shape cc in the diagram, and an arrow ff into cc, there's an object of y/Fy/F, but these aren't all distinct. They get identified whenever there is an arrow in the diagram g:ccg : c \to c' so that gf=fgf = f', and this is closed under zigzags.

When all the arrows in the diagram are monomorphisms, then the "root objects" for each node in the diagram all end up becoming nondegenerate, because they start out nondegenerate, and only get identified with other nondegenerate objects.

view this post on Zulip James Deikun (Jan 21 2024 at 12:49):

Before identifications, every object has an arrow to a nondegenerate object: the root for its node. Any other such arrow is obviously connected to this one. And when objects are identified, it's always root object to nondegenerate object and creates connections for all the recursively identified objects. Because the identifications are along monos there are no "bonus" identifications created to interfere with this nice story.

view this post on Zulip James Deikun (Jan 21 2024 at 12:50):

Therefore, I think the above conditions are necessary and sufficient for being a gluing.

view this post on Zulip James Deikun (Jan 21 2024 at 13:06):

If I made a mistake in this argument, though, it's probably believing that root objects are nondegenerate in the above sense.