This expository note describes two convenient techniques in the context of homotopy type theory for proving - and formalizing - that a given map is an equivalence. The first technique decomposes the map as a series of basic equivalences, while the second refines this approach using the 3-for-2 property of equivalences. The techniques are illustrated by proving a basic result in synthetic homotopy theory.
@InProceedings{dejong:LIPIcs.TYPES.2024.1, author = {de Jong, Tom}, title = {{Formalizing Equivalences Without Tears}}, booktitle = {30th International Conference on Types for Proofs and Programs (TYPES 2024)}, pages = {1:1--1:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-376-8}, ISSN = {1868-8969}, year = {2025}, volume = {336}, editor = {M{\o}gelberg, Rasmus Ejlers and van den Berg, Benno}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TYPES.2024.1}, URN = {urn:nbn:de:0030-drops-233632}, doi = {10.4230/LIPIcs.TYPES.2024.1}, annote = {Keywords: 3-for-2 property, 2-out-of-3 property, definitional equality, equivalence, formalization of mathematics, synthetic homotopy theory, type theory} }
Feedback for Dagstuhl Publishing