Lax comma categories of ordered sets
Maria Manuel Clementino, Fernando Lucatelli Nunes

TL;DR
This paper investigates the properties of lax comma categories of ordered sets, showing conditions under which they are topological, complete, and cartesian closed, and analyzing descent theory within these categories.
Contribution
It characterizes when the lax comma category of ordered sets is topological, complete, and cartesian closed, extending understanding of their categorical properties and descent behavior.
Findings
The forgetful functor is topological iff X is complete.
The category is complete and cartesian closed iff X is.
Pointwise effectiveness for descent implies effectiveness in the lax comma category.
Abstract
Let be the category of (pre)ordered sets. Unlike , whose behaviour is well-known, not much can be found in the literature about the lax comma 2-category . In this paper we show that the forgetful functor is topological if and only if is complete. Moreover, under suitable hypothesis, is complete and cartesian closed if and only if is. We end by analysing descent in this category. Namely, when is complete and cartesian closed, we show that, for a morphism in , being pointwise effective for descent in is sufficient, while being effective for descent in is necessary, to be effective for descent in .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsHomotopy and Cohomology in Algebraic Topology · Advanced Topology and Set Theory · Algebraic structures and combinatorial models
