Proof verification in algebraic topology

Abstract

[en] Homotopy type theory is a relatively new field which results from the surprising blend of algebraic topology (homotopy) and type theory (type), that tries to serve as a theoretical base for theorem-proving software. This setting is particularly suitable for synthetic homotopy theory. In this work, we describe how the programming language Agda can be used for proof verification, by examining the construction of the fundamental group of the circle $\mathbb{S}^{1}$. Then, trying to obtain the fundamental group of the real projective plane $\mathbb{R} \mathrm{P}^{2}$, we end up exploring a new construction of $\mathbb{R} \mathrm{P}^{2}$ as a higher inductive type.