Author:
Clementino Maria Manuel,Janelidze George
Abstract
AbstractWe 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\rightarrow A$$
X
→
A
and, equivalently, as a set A equipped with a family $$(A_x)_{x\in X}$$
(
A
x
)
x
∈
X
of upclosed subsets of A with $$x'\leqslant x\Rightarrow A_x\subseteq A_{x'}$$
x
′
⩽
x
⇒
A
x
⊆
A
x
′
.
Funder
Centro de Matemática, Universidade de Coimbra
Universidade de Coimbra
Publisher
Springer Science and Business Media LLC
Reference7 articles.
1. Clementino, M.M., Lucatelli Nunes, F.: Lax comma categories of ordered sets. Quaest. Math. 46(sup1), 145–159 (2023)
2. Janelidze, G., Sobral, M.: Finite preorders and topological descent I. J. Pure Appl. Algebra 175(1–3), 187–205 (2002)
3. Janelidze, G., Tholen, W.: Facets of descent I. Appl. Categ. Struct. 2, 245–281 (1994)
4. Lack, S., Street, R.H.: The formal theory of monads II. J. Pure Appl. Algebra 175(1–3), 243–265 (2002)
5. Lucatelli Nunes, F.: Pseudo-Kan extensions and descent theory. Theory Appl. Categ. 33(15), 390–444 (2018)