Bicategories in univalent foundations

Journal Article (2022)
Author(s)

Benedikt Ahrens (University of Birmingham, TU Delft - Programming Languages)

Dan Frumin (Rijksuniversiteit Groningen)

Marco Maggesi (University of Florence)

Niccolò Veltri (Tallinn University of Technology)

Niels van der Weide (University of Birmingham, Radboud Universiteit Nijmegen)

Research Group
Programming Languages
Copyright
© 2022 B.P. Ahrens, Dan Frumin, Marco Maggesi, Niccolò Veltri, Niels van der Weide
DOI related publication
https://doi.org/10.1017/S0960129522000032
More Info
expand_more
Publication Year
2022
Language
English
Copyright
© 2022 B.P. Ahrens, Dan Frumin, Marco Maggesi, Niccolò Veltri, Niels van der Weide
Research Group
Programming Languages
Issue number
10
Volume number
31
Pages (from-to)
1232-1269
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

We develop bicategory theory in univalent foundations. Guided by the notion of univalence for (1-)categories studied by Ahrens, Kapulkin, and Shulman, we define and study univalent bicategories. To construct examples of univalent bicategories in a modular fashion, we develop displayed bicategories, an analog of displayed 1-categories introduced by Ahrens and Lumsdaine. We demonstrate the applicability of this notion and prove that several bicategories of interest are univalent. Among these are the bicategory of univalent categories with families and the bicategory of pseudofunctors between univalent bicategories. Furthermore, we show that every bicategory with univalent hom-categories is weakly equivalent to a univalent bicategory. All of our work is formalized in Coq as part of the UniMath library of univalent mathematics.