Effective descent morphisms of filtered preorders
Preprint
Abstract
We characterize effective descent morphisms of what we call filtered preorders, and apply these results to slightly improve a known result, due to the first author and F. Lucatelli Nunes, on the effective descent morphisms in lax comma categories of preorders. A filtered preorder, over a fixed preorder $X$, is defined as a preorder $A$ equipped with a profunctor $X\to A$ and, equivalently, as a set $A$ equipped with a family $(A_x)_{x\in X}$ of upclosed subsets of $A$ with $x'\leqslant x\Rightarrow A_x\subseteq A_{x'}$.
Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Lax comma categories of ordered setsQuaestiones Mathematicae, 2023
- Pseudo-Kan Extensions and Descent TheoryTheory and Applications of Categories, 2018
- Finite preorders and Topological descent IJournal of Pure and Applied Algebra, 2002
- The formal theory of monads IIJournal of Pure and Applied Algebra, 2002
- Facets of descent, IApplied Categorical Structures, 1994
- The formal theory of monadsJournal of Pure and Applied Algebra, 1972