On the Calculation of Fundamental Groups in Homotopy Type Theory by Means of Computational Paths

One of the most interesting entities of homotopy type theory is the identity type. It gives rise to an interesting interpretation of the equality, since one can semantically interpret the equality between two terms of the same type as a collection of homotopical paths between points of the same space. Since this is only a semantical interpretation, the addition of paths to the syntax of homotopy type theory has been recently proposed by De Queiroz, Ramos and De Oliveira . In these works, the authors propose an entity known as `computational path', proposed by De Queiroz and Gabbay in 1994, and show that it can be used to formalize the identity type. We have found that it is possible to use these computational paths as a tool to achieve one central result of algebraic topology and homotopy type theory: the calculation of fundamental groups of surfaces. We review the concept of computational paths and the LND_EQ-TRS, which is a term rewriting system proposed by De Oliveira in 1994 to map redundancies between computational paths. We then proceed to calculate the fundamental group of the circle, cylinder, Möbius band, torus and the real projective plane. Moreover, we show that the use of computational paths make these calculations simple and straightforward, whereas the same result is much harder to obtain using the traditional code-encode-decode approach of homotopy type theory.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/02/2018

On the Use of Computational Paths in Path Spaces of Homotopy Type Theory

The treatment of equality as a type in type theory gives rise to an inte...
research
06/19/2019

An alternative approach to the calculation of fundamental groups based on labeled natural deduction

In this work, we use a labelled deduction system based on the concept of...
research
06/19/2019

A Topological Application of Labelled Natural Deduction

We use a labelled deduction system based on the concept of computational...
research
07/13/2020

Computational Paths – A Weak Groupoid

We use a labelled deduction system based on the concept of computational...
research
06/01/2023

Multiple-inheritance hazards in dependently-typed algebraic hierarchies

Abstract algebra provides a large hierarchy of properties that a collect...
research
12/13/2017

Axioms for Modelling Cubical Type Theory in a Topos

The homotopical approach to intensional type theory views proofs of equa...
research
02/24/2023

Formalising Yoneda Ext in Univalent Foundations

Ext groups are fundamental objects from homological algebra which underl...

Please sign up or login with your details

Forgot password? Click here to reset