Identity in Homotopy Type Theory, Part I: The Justification of Path Induction
ثبت نشده
چکیده
Homotopy type theory (HoTT) is a new branch of mathematics that connects algebraic topology with logic and computer science, and which has been proposed as a new language and conceptual framework for mathematical practice. Much of the power of HoTT lies in the correspondence between the formal type theory and ideas from homotopy theory, in particular the interpretation of types, tokens, and equalities as (respectively) spaces, points, and paths. Fundamental to the use of identity and equality in HoTT is the powerful proof technique of path induction. In the ‘HoTT Book’ [1] this principle is justified through the homotopy interpretation of type theory, by treating identifications as paths and the induction step as a homotopy between paths. This is incompatible with HoTT being an autonomous foundation for mathematics, since any such foundation must be able to justify its principles without recourse to existing areas of mathematics. In this paper it is shown that path induction can be motivated from pre-mathematical considerations, and in particular without recourse to homotopy theory. This makes HoTT a candidate for being an autonomous foundation for mathematics.
منابع مشابه
Identity in Homotopy Type Theory, Part I: The Justification of Path Induction
Homotopy type theory (HoTT) is a new branch of mathematics that connects algebraic topology with logic and computer science, and which has been proposed as a new language and conceptual framework for mathematical practice. Much of the power of HoTT lies in the correspondence between the formal type theory and ideas from homotopy theory, in particular the interpretation of types, tokens, and equ...
متن کامل15-819 Homotopy Type Theory Lecture Notes
Recall from previous lectures the definitions of functionality and transport. Functionality states that functions preserve identity; that is, domain elements equal in their type map to equal elements in the codomain. Transportation states the same for type families. Traditionally, this means that if a =A a′, then B[a] true iff B[a′] true. In proof-relevant mathematics, this logical equivalence ...
متن کاملGame-theoretic Interpretation of Type Theory Part II: Uniqueness of Identity Proofs and Univalence
In the present paper, based on the previous work (Part I), we present a game semantics for the intensional variant of intuitionistic type theory that refutes the principle of uniqueness of identity proofs and validates the univalence axiom, though we do not interpret non-trivial higher propositional equalities. Specifically, following the historic groupoid interpretation by Hofmann and Streiche...
متن کامل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 interesting type-theoretic structure known as ‘identity type’. The idea is that, given terms a, b of a type A, one may form the type IdA(a, b), whose elements are proofs that a and b are equal elements of type A. A term of this type, p : IdA(a, b), makes up for the grounds (or proof) that establishes that a is indeed equal to b...
متن کاملPath Functors in Cat
We build an endofunctor in the category of small categories along with the necessary structure on it to turn it into a path object suitable for homotopy theory and modelling identity types in Martin-Löf type theory. We construct the free Grothendieck bifibration over a base category generated by an arbitrary functor to that category.
متن کامل