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.
Dear all,
I am reading Makkai and Paré's Accessible categories and in the first chapter, they define -filtered categories and write the following remark:
Note the easily seen fact that, for to be -filtered, it suffices to have the condition in 1.1.1 for the following specific graphs : the discrete graph on elements, and the graph with two nodes and many parallel arrows, both for any cardinal .
where 1.1.1 is "every diagram of source has a cocone".
I thought I had a proof but as I am looking back on this part, I can't recover it. Do you know how I can prove this ?
in the finite case I see how to do it but for the infinite case it seems impossible to me
Thanks !
I don't immediately see it either. One reduction I can see would involve discrete -graphs, parallel pairs of arrows, and the graph for -sized "wide pushouts". Another would involve discrete -graphs and the graph consisting of parallel pairs of arrows all with the same codomain but different domains.
Does the corresponding construction for (co)limits work?
I don't think so, because constructing the two maps between coproducts that you then coequalize requires the universal property of the domain coproduct, whereas the cocones that merely exist in a filtered category don't have a universal property.
You can take a cone under the objects in the diagram, coequalize all of the parallel arrows from each object to the nadir (producing a wide span), put a cone under the objects in that wide span, and finally coequalize all of the arrows from the original nadir to the new one.
Where "all of the arrows" refers respectively to the arrows in the diagrams composed with the cocone morphisms and then the arrows constructed from the coequalizing arrows and the cocone arrows.
Ah, that's what I was missing! Thanks Morgan. I recorded this at [[filtered category]].
Thank you all! And thanks Mike for writing it down on the nlab