Document Open Access Logo

Univalent Monoidal Categories

Authors Kobe Wullaert , Ralph Matthes , Benedikt Ahrens

Thumbnail PDF


  • Filesize: 0.93 MB
  • 21 pages

Document Identifiers

Author Details

Kobe Wullaert
  • Delft University of Technology, The Netherlands
Ralph Matthes
  • IRIT, Université de Toulouse, CNRS, Toulouse INP, UT3, France
Benedikt Ahrens
  • Delft University of Technology, The Netherlands
  • University of Birmingham, UK


We gratefully acknowledge the work by the Coq development team in providing the Coq proof assistant and surrounding infrastructure, as well as their support in keeping UniMath compatible with Coq. Furthermore, we thank Niels van der Weide for helpful discussions on the subject matter and for reviewing the formalization. We also thank Vikraman Choudhury for a question regarding the connection of the monoidal Rezk completion to the Day convolution product. Furthermore, we thank the anonymous referees for their helpful feedback; besides triggering further thoughts on the technical aspects, it helped us to improve the presentation.

Cite AsGet BibTex

Kobe Wullaert, Ralph Matthes, and Benedikt Ahrens. Univalent Monoidal Categories. In 28th International Conference on Types for Proofs and Programs (TYPES 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 269, pp. 15:1-15:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)


Univalent categories constitute a well-behaved and useful notion of category in univalent foundations. The notion of univalence has subsequently been generalized to bicategories and other structures in (higher) category theory. Here, we zoom in on monoidal categories and study them in a univalent setting. Specifically, we show that the bicategory of univalent monoidal categories is univalent. Furthermore, we construct a Rezk completion for monoidal categories: we show how any monoidal category is weakly equivalent to a univalent monoidal category, universally. We have fully formalized these results in UniMath, a library of univalent mathematics in the Coq proof assistant.

Subject Classification

ACM Subject Classification
  • Theory of computation → Type theory
  • Theory of computation → Logic and verification
  • Univalence
  • Monoidal categories
  • Rezk completion
  • Displayed (bi)categories
  • Proof assistant Coq
  • UniMath library


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Benedikt Ahrens, Dan Frumin, Marco Maggesi, Niccolò Veltri, and Niels van der Weide. Bicategories in univalent foundations. Math. Struct. Comput. Sci., 31(10):1232-1269, 2021. URL:
  2. Benedikt Ahrens, Krzysztof Kapulkin, and Michael Shulman. Univalent categories and the Rezk completion. Math. Struct. Comput. Sci., 25(5):1010-1039, 2015. URL:
  3. Benedikt Ahrens and Peter LeFanu Lumsdaine. Displayed categories. Log. Methods Comput. Sci., 15(1), 2019. URL:
  4. Benedikt Ahrens, Paige Randall North, Michael Shulman, and Dimitris Tsementzis. The Univalence Principle, 2021. To be published in Memoirs of the American Mathematical Society. URL:
  5. Johannes Schipp von Branitz and Ulrik Buchholtz. Using displayed univalent graphs to formalize higher groups in univalent foundations, 2021. URL:
  6. Lucas Dixon and Aleks Kissinger. Monoidal categories, graphical reasoning, and quantum computation, 2009. Presented at Workshop on Computer Algebra Methods and Commutativity of Algebraic Diagrams (CAM-CAD). URL:
  7. Pau Enrique Moliner, Chris Heunen, and Sean Tull. Space in monoidal categories. Electronic Proceedings in Theoretical Computer Science, 266, April 2017. URL:
  8. Geun Bin Im and G.M. Kelly. A universal property of the convolution monoidal structure. Journal of Pure and Applied Algebra, 43(1):75-88, 1986. URL:
  9. Krzysztof Kapulkin and Peter LeFanu Lumsdaine. The simplicial model of Univalent Foundations (after Voevodsky). Journal of the European Mathematical Society, 23(6):2071-2126, 2021. URL:
  10. Yuri I. Manin and Matilde Marcolli. Homotopy theoretic and categorical models of neural information networks, 2020. URL:
  11. Chad Nester. Concurrent process histories and resource transducers, 2020. URL:
  12. Dario Stein and Sam Staton. Compositional semantics for probabilistic programs with exact conditioning. In 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pages 1-13. IEEE, 2021. URL:
  13. Kirk Sturtz. Categorical probability theory, 2014. URL:
  14. The Coq Development Team. The Coq proof assistant, version 8.13.0, January 2021. URL:
  15. The Univalent Foundations Program. Homotopy Type Theory: Univalent Foundations of Mathematics., Institute for Advanced Study, 2013.
  16. Niels van der Weide. Constructing Higher Inductive Types. PhD thesis, Radboud University, 2020. URL:
  17. Vladimir Voevodsky, Benedikt Ahrens, Daniel Grayson, et al. UniMath - A computer-checked library of univalent mathematics. Available at , 2023.
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail