Generating Higher Identity Proofs in Homotopy Type Theory
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917853735682048 |
|---|---|
| author | Benjamin, Thibaut |
| author_facet | Benjamin, Thibaut |
| contents | Finster and Mimram have defined a dependent type theory called CaTT, which describes the structure of omega-categories. Types in homotopy type theory with their higher identity types form weak omega-groupoids, so they are in particular weak omega-categories. In this article, we show that this principle makes homotopy type theory into a model of CaTT, by defining a translation principle that interprets an operation on the cell of an omega-category as an operation on higher identity types. We then illustrate how this translation allows to leverage several mechanisation principles that are available in CaTT, to reduce the proof effort required to derive results about the structure of identity types, such as the existence of an Eckmann-Hilton cell. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_01667 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Generating Higher Identity Proofs in Homotopy Type Theory Benjamin, Thibaut Logic in Computer Science Category Theory 18N65 F.2.1; F.3.2 Finster and Mimram have defined a dependent type theory called CaTT, which describes the structure of omega-categories. Types in homotopy type theory with their higher identity types form weak omega-groupoids, so they are in particular weak omega-categories. In this article, we show that this principle makes homotopy type theory into a model of CaTT, by defining a translation principle that interprets an operation on the cell of an omega-category as an operation on higher identity types. We then illustrate how this translation allows to leverage several mechanisation principles that are available in CaTT, to reduce the proof effort required to derive results about the structure of identity types, such as the existence of an Eckmann-Hilton cell. |
| title | Generating Higher Identity Proofs in Homotopy Type Theory |
| topic | Logic in Computer Science Category Theory 18N65 F.2.1; F.3.2 |
| url | https://arxiv.org/abs/2412.01667 |