2020/01/01 by Yuichi Komorida
Computer Science · Mathematics · #Algebra over a field #Algebraic structures and combinatorial models #Computer science #Discrete mathematics #Fibered knot #Fibration #Functor #Homotopy #Homotopy and Cohomology in Algebraic Topology #Injective function #Logic, programming, and type systems #Mathematics #Preorder #Pure mathematics #Scheme (mathematics) #cs.LO
paper · pdf · doi:10.1007/978-3-030-57201-3_7
published as In: Petrişan D., Rot J. (eds) Coalgebraic Methods in Computer Science. CMCS 2020. Lecture Notes in Computer Science, vol 12094. Springer, Cham · 21 pages, presented in International Workshop on Coalgebraic Methods in Computer Science (CMCS) 2020
openalex publication_date 2020/01/01 · arxiv created 2021/02/06 · arxiv updated 2021/02/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Functor lifting along a fibration is used for several different purposes in computer science. In the theory of coalgebras, it is used to define coinductive predicates, such as simulation preorder and bisimilarity. Codensity lifting is a scheme to obtain a functor lifting along a fibration. It generalizes a few previous lifting schemes including the Kantorovich lifting. In this paper, we seek a property of functor lifting called fiberedness. Hinted by a known result for Kantorovich lifting, we identify a sufficient condition for a codensity lifting to be fibered. We see that this condition applies to many examples that have been studied. As an application, we derive some results on bisimilarity-like notions.