Jonathan Weinberger: Universes in simplicial homotopy type theory @ToposInstitute
Jonathan Weinberger: Universes in simplicial homotopy type theory  @ToposInstitute
Uploaded October 2026 | Updated November 2026, 19 hours ago
Topos Institute Colloquium, 29th of October 2026.
———
Homotopy type theory has proven to be a fruitful way of doing homotopy theory synthetically: (topological) spaces are the basic objects of the theory, and all constructions and theorems are invariant under homotopy, i.e. continuous deformation. Up to homotopy, spaces can be understood as ∞-groupoids, i.e., weak infinite-dimensional groupoids, so HoTT can be regarded as a synthetic language for ∞-groupoids.

In contrast, type theories for ∞-category theory remained underexplored for some time. However, in 2017, Riehl—-Shulman [12] worked out an approach extending standard homotopy type theory by simplicial shapes. As opposed to standard HoTT, not every type is of the desired kind in simplicial HoTT, i.e., an ∞-category. But one can restrict to the respective subclass of such types and recover a lot of standard constructions from category theory such as functors, natural transformations, adjunctions [10-12], and (co)limits [1]. In "analytic" set-based ∞-category theory one has to specify an infinite amount of data together with coherences for these constructions. In simplicial HoTT, these constructions often drastically simplify, yielding naturality and coherence for free. Furthermore, this theory makes ∞-category theory amenable to formalization in a computer proof assistant [5, 6, 14].

I will survey recent developments in simplicial HoTT, emphasizing universe types, namely the synthetic ∞-category of ∞-groupoids and ∞-categories, resp. [7-9]. This admits many parallels to the comprehensive program of synthetic ∞-category theory of [4].

The talk is based on joint work with Ulrik Buchholtz, Daniel Gratzer, Nikolai Kudasov, Emily Riehl, and Rob Schellingerhout.

[1] C. Bardomiano Martínez (2025): Limits and Colimits in Synthetic ∞-Categories. Mathematical Structures in Computer Science 35. doi.org/10.1017/S0960129525100248

[2] C. Bardomiano Martínez (2025): Exponentiable Functors between Synthetic ∞-Categories. Mathematical Structures in Computer Science 35. doi.org/10.1017/S0960129525100339

[3] U. Buchholtz, J. Weinberger (2023): Synthetic fibered (∞,1)-category theory. articles.math.cas.cz/10.21136/HS.2023.04, Higher Structures 7(1): 74–165

[4] D.-C. Cisinski, B. Cnossen, K. Nguyen, T. Walde (2026): Synthetic Category Theory. bastiaancnossen.com/books/synthetic-category-theory.pdf

[5] N. Kudasov: Rzk proof assistant. rzk-lang.github.io

[6] N. Kudasov, E. Riehl, J. Weinberger (2024): Formalizing the ∞-Categorical Yoneda Lemma. In Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP 2024). Association for Computing Machinery, New York, NY, USA, 274–290. dl.acm.org/doi/10.1145/3636501.3636945

[7] D. Gratzer, J. Weinberger, U. Buchholtz (2024): Directed univalence in simplicial homotopy type theory. arxiv.org/abs/2407.09146

[8] D. Gratzer, J. Weinberger, U. Buchholtz (2025): The Yoneda embedding in simplicial type theory. In 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), ieeexplore.ieee.org/document/11186122

[9] D. Gratzer, J. Weinberger, U. Buchholtz (2026): The ∞-Category of ∞-Categories in Simplicial Type Theory. In 41st Annual Symposium on Logic in Computer Science (LICS 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 380, pp. 52:1-52:26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026), doi.org/10.4230/LIPIcs.LICS.2026.52

[10] E. Riehl (2023): Could ∞-category theory be taught to undergraduates? Notices of the American Mathematical Society 70.5 (2023). dx.doi.org/10.1090/noti2692

[11] E. Riehl (2026): Synthetic Perspectives on Spaces and Categories. Proceedings of the International Congress of Mathematicians 2026 - Volume 4: Invited Lectures (Sections 5–8). epubs.siam.org/doi/10.1137/25M1806569

[12] E. Riehl, M. Shulman (2017): A type theory for synthetic ∞-categories. Higher Structures 1(1): 147-224. articles.math.cas.cz/10.21136/HS.2017.06

[13] R. Schellingerhout, D. Gratzer, J. Weinberger, U. Buchholtz (2026): For ♭-annotated types, Segal implies simplicial. danielgratzer.com/papers/segal-implies-simplicial.pdf

[14] S. Toth, F. Bakke, and contributors (2026): Agda Synthetic Categories. samtoth.github.io/agda-synthetic-categories
Jonathan Weinberger: Universes in simplicial homotopy type theoryAstra Kolomatskaia: Towards higher-dimensional syntax[DOTS Lectures] 8. Compositionality of behaviours: generalized Moore machine case[Oxford Seminar] Tim Hosgood | Homotopy coherent Bousfield–KanStefan Milius: Demystifying Codensity Monads via Duality[Berkeley Seminar] Mike Dodds (Galois) | What works and doesnt selling formal methods in industryAleks Kissinger: ZX Calculus and Fault-tolerant quantum computingChad Nester: Combinatory Completeness in Structured MulticategoriesPatrick Shafto: Autoformalization and the future of math and science[Oxford Seminar] Greg Neustroev | The Treachery of Certificates: Ceci n’est pas une supermartingaleEvan Patterson and David Jaz Myers  | Towards mathematics and technology for fluid formal modeling[Berkeley Seminar] Benjamin Brast-McKie | Programmatic Semantics
Topos Institute |

Jonathan Weinberger: Universes in simplicial homotopy type theory

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER