Reference. Univalent Enriched Categories and the Enriched Rezk Completion
Enriched categories are categories whose sets of morphisms are enriched with extra structure. Such categories play a prominent role in the study of higher categories, homotopy theory, and the semantics of programming languages. In this paper, we study univalent enriched categories. We prove that all essentially surjective and fully faithful functors between univalent enriched categories are equivalences, and we show that every enriched category admits a Rezk completion. Finally, we use the Rezk completion for enriched categories to construct univalent enriched Kleisli categories.
Cite
Cited by (1)
Insights from Univalent Foundations: A Case Study Using Double Categories rasekh-2025-insights
Category theory unifies mathematical concepts, aiding comparisons across structures by incorporating not just objects, but also morphisms capturing interactions between objects. Of particular importance in some applications are double categories, which are categories with two classes of morphisms, axiomatizing two different kinds of interactions between objects. These have found applications in many areas of mathematics and theoretical computer science, for instance, the study of lenses, open systems, and rewriting. However, double categories come with a wide variety of equivalences, which makes it challenging to transport structure along equivalences. To deal with this challenge, we propose the univalence maxim: each notion of equivalence of categorical structures has a corresponding notion of univalent categorical structure which induces that notion of equivalence. We also prove corresponding univalence principles, which allow us to transport structure and properties along equivalences. In this way, the usually informal practice of reasoning modulo equivalence becomes grounded in an entirely formal logical principle. We apply this perspective to various double categorical structures, such as (pseudo) double categories and double bicategories. Concretely, we characterize and formalize their definitions in Coq UniMath up to chosen equivalences, which we achieve by establishing their univalence principles.
Cites 46 works (11 here)
With notes (11)
The Formal Theory of Monads, Univalently vanderweide-2025-thex
We develop the formal theory of monads, as established by Street, in univalent foundations. This allows us to formally reason about various kinds of monads on the right level of abstraction. In particular, we define the bicategory of monads internal to a bicategory, and prove that it is univalent. We also define Eilenberg-Moore objects, and we show that both Eilenberg-Moore categories and Kleisli categories give rise to Eilenberg-Moore objects. Finally, we relate monads and adjunctions in arbitrary bicategories. Our work is formalized in Coq using the UniMath library.
The Univalence Principle ahrens-2021-the
The Univalence Principle is the statement that equivalent mathematical structures are indistinguishable. We prove a general version of this principle that applies to all set-based, categorical, and higher-categorical structures defined in a non-algebraic and space-based style, as well as models of higher-order theories such as topological spaces. In particular, we formulate a general definition of indiscernibility for objects of any such structure, and a corresponding univalence condition that generalizes Rezk’s completeness condition for Segal spaces and ensures that all equivalences of structures are levelwise equivalences. Our work builds on Makkai’s First-Order Logic with Dependent Sorts, but is expressed in Voevodsky’s Univalent Foundations (UF), extending previous work on the Structure Identity Principle and univalent categories in UF. This enables indistinguishability to be expressed simply as identification, and yields a formal theory that is interpretable in classical homotopy theory, but also in other higher topos models. It follows that Univalent Foundations is a fully equivalence-invariant foundation for higher-categorical mathematics, as intended by Voevodsky.
Insights from Univalent Foundations: A Case Study Using Double Categories rasekh-2025-insights
Category theory unifies mathematical concepts, aiding comparisons across structures by incorporating not just objects, but also morphisms capturing interactions between objects. Of particular importance in some applications are double categories, which are categories with two classes of morphisms, axiomatizing two different kinds of interactions between objects. These have found applications in many areas of mathematics and theoretical computer science, for instance, the study of lenses, open systems, and rewriting. However, double categories come with a wide variety of equivalences, which makes it challenging to transport structure along equivalences. To deal with this challenge, we propose the univalence maxim: each notion of equivalence of categorical structures has a corresponding notion of univalent categorical structure which induces that notion of equivalence. We also prove corresponding univalence principles, which allow us to transport structure and properties along equivalences. In this way, the usually informal practice of reasoning modulo equivalence becomes grounded in an entirely formal logical principle. We apply this perspective to various double categorical structures, such as (pseudo) double categories and double bicategories. Concretely, we characterize and formalize their definitions in Coq UniMath up to chosen equivalences, which we achieve by establishing their univalence principles.
Profunctor Optics, a Categorical Update clarke-2024-profunctor
Optics are bidirectional data accessors that capture data transformation patterns such as accessing subfields or iterating over containers. Profunctor optics are a particular choice of representation supporting modularity, meaning that we can construct accessors for complex structures by combining simpler ones. Profunctor optics have previously been studied only in an unenriched and non-mixed setting, in which both directions of access are modelled in the same category. However, functional programming languages are arguably better described by enriched categories; and we have found that some structures in the literature are actually mixed optics, with access directions modelled in different categories. Our work generalizes a classic result by Pastro and Street on Tambara theory and uses it to describe mixed V-enriched profunctor optics and to endow them with V-category structure. We provide some original families of optics and derivations, including an elementary one for traversals. Finally, we discuss a Haskell implementation.
Displayed Monoidal Categories for the Semantics of Linear Logic ahrens-2024-displayed
Univalent Double Categories vanderweide-2024-univalent
Bicategories in univalent foundations ahrens-2021-bicategories
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.
Formalizing category theory in Agda hu-2021-formalizing
Constructing Higher Inductive Types as Groupoid Quotients vanderweide-2020-constructing
Univalent categories and the Rezk completion ahrens_etal_2015
We develop category theory within Univalent Foundations, which is a foundational system for mathematics based on a homotopical interpretation of dependent type theory. In this system, we propose a definition of ‘category’ for which equality and equivalence of categories agree. Such categories satisfy a version of the univalence axiom, saying that the type of isomorphisms between any two objects is equivalent to the identity type between these objects; we call them ‘saturated’ or ‘univalent’ categories. Moreover, we show that any category is weakly equivalent to a univalent one in a universal way. In homotopical and higher-categorical semantics, this construction corresponds to a truncated version of the Rezk completion for Segal spaces, and also to the stack completion of a prestack.
External (35)
- Introduction to Homotopy Type Theory (2025)
- The Rocq Prover (2025)
- Tensorial Structure of the Lifting Doctrine in Constructive Domain Theory (2024)
- Univalent Enriched Categories and the Enriched Rezk Completion (FSCD 2024) (2024)
- category-theory: Category Theory in Coq (2023)
- Univalent Monoidal Categories (2022)
- What Makes a Strong Monad? (2022)
- Galois connecting call-by-value and call-by-name (2022)
- The lean mathematical library (2019)
- Classifying Types (2019)
- Categorical notions of fibration (2018)
- Skew-Enriched Categories (2017)
- The Lean Theorem Prover (System Description) (2015)
- The enriched effect calculus: syntax and semantics (2014)
- Enriched ∞-categories via non-symmetric ∞-operads (2013)
- Categories for the Working Mathematician (2013)
- The simplicial model of Univalent Foundations (after Voevodsky) (2012)
- Enriched Categories, Internal Categories and Change of Base (2011)
- Dependently typed programming in Agda (2009)
- Simplicial Homotopy Theory (2009)
- Permutative categories, multicategories and algebraic K-theory (2009)
- Algebraic Operations and Generic Effects (2003)
- The formal theory of monads II (2002)
- Notions of Computation Determine Monads (2002)
- A Survey of Definitions of n-Category (2001)
- Models for the computational lambda-calculus (2001)
- Preframe Techniques in Constructive Locale Theory (1996)
- An Introduction to Homological Algebra (1994)
- Computational lambda-calculus and monads (1989)
- Intuitionistic type theory (1984)
- Basic concepts of enriched category theory (1982)
- Abstract pro arrows I (1982)
- Fixed-point constructions in order-enriched categories (1979)
- The formal theory of monads (1972)
- Unimath — a computer-checked library