← Latest papers
💻 computer science

Univalent Enriched Categories and the Enriched Rezk Completion

This paper investigates univalent enriched categories by proving that essentially surjective and fully faithful functors between them are equivalences, demonstrating that every enriched category admits a Rezk completion, and applying this completion to construct univalent enriched Kleisli categories.

Original authors: Niels van der Weide

Published 2026-06-10
📖 5 min read🧠 Deep dive

Original authors: Niels van der Weide

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are an architect designing a city. In standard mathematics, you might build a city where two buildings that look exactly the same (isomorphic) are treated as distinct entities unless you explicitly glue them together. But in the world of Univalent Foundations (the mathematical framework this paper uses), the rule is different: if two buildings look the same and function the same, they are the same. There is no "hidden difference" between them.

This paper, titled "Univalent Enriched Categories and the Enriched Rezk Completion," is about taking this "look-alike means same" rule and applying it to a very specific, complex type of city planning called Enriched Categories.

Here is a breakdown of the paper's journey, using everyday analogies:

1. What is an "Enriched Category"?

Think of a standard category as a map of a city where the "streets" (morphisms) between buildings (objects) are just simple lines. You know you can get from Building A to Building B, but the street itself is just a line.

An Enriched Category is like a city where those streets have extra texture. Maybe the street from A to B isn't just a line; it's a "road made of rubber," or a "highway with a speed limit," or a "path that exists in a specific order."

  • The Paper's Goal: The authors want to build these textured cities (enriched categories) but ensure they follow the strict "look-alike means same" rule (univalence).

2. The Problem: "Fake" Equivalences

In the world of these textured cities, you can sometimes build a map that looks perfect but is secretly flawed.

  • The Scenario: Imagine you have a map of a city where every building has a twin, and the streets between them match perfectly. However, the map treats the twins as different people.
  • The Issue: In standard math, you might need a "magic wand" (the Axiom of Choice) to fix this and say, "Okay, let's pretend they are the same."
  • The Paper's Solution: The authors prove that if you start with a city that already follows the "look-alike means same" rule (a Univalent Enriched Category), you don't need magic. If a map is "fully faithful" (it preserves all the street textures perfectly) and "essentially surjective" (it covers every building), then that map is automatically a perfect equivalence. It's a "golden ticket" that proves the two cities are identical.

3. The "Rezk Completion": The City Renovation

Sometimes, you start with a messy city that doesn't follow the "look-alike means same" rule. It has duplicate buildings that look identical but are treated as different.

  • The Metaphor: Imagine a city with two identical coffee shops, "Joe's" and "Joey's," that are actually the same business but listed separately. This causes confusion.
  • The Fix (Rezk Completion): The paper provides a construction called the Rezk Completion. Think of this as a massive city renovation project. You take the messy city, identify all the duplicate buildings, and physically merge them into single, unique structures.
  • Two Ways to Renovate:
    1. The Yoneda Method: This is like taking a photo of every possible view of the city and rebuilding the city based on those photos. It's precise but might require a bigger blueprint (a larger "universe" of data).
    2. The HIT Method: This uses a special construction tool called Higher Inductive Types. Imagine a 3D printer that can snap duplicate buildings together instantly without needing a bigger blueprint. This method is more efficient and keeps the city size the same.

4. Why Does This Matter? (The Kleisli Twist)

The paper ends by applying this renovation tool to a specific type of city structure called a Kleisli Category.

  • The Analogy: A Kleisli category is like a city where you can only travel if you carry a special "magic bag" (a Monad).
  • The Problem: The standard way to build these "magic bag" cities often results in a messy layout with duplicate buildings (it's not univalent).
  • The Result: The authors use their Rezk Completion renovation tool to take the messy "magic bag" city and fix it. They prove that you can always build a "perfect" version of these cities where the "look-alike means same" rule holds true. This allows mathematicians to use these complex structures without worrying about hidden duplicates.

Summary of the Paper's Claims

  1. Structure Identity: They proved that for these enriched cities, if two cities are equivalent (look and act the same), they are identical. This is called the "Structure Identity Principle."
  2. No Magic Needed: They showed that if a map between these cities covers everything and preserves all textures, it is automatically a perfect equivalence. No extra assumptions are needed.
  3. The Renovation Tool: They provided two methods to take any enriched city and "renovate" it into a perfect, univalent version (the Rezk Completion).
  4. Application: They used this renovation to fix "Kleisli" cities (related to programming logic and monads), ensuring they are mathematically sound and univalent.

In short, the paper builds a rigorous toolkit to ensure that when we add extra "texture" to our mathematical maps, we don't accidentally create duplicates that break the rules of logic. It provides the blueprints to fix any such mess and ensure the city is perfectly unified.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →