Homotopy type theory and the formalization of mathematics
نویسندگان
چکیده
er game, for mathematicians with an appreciation of detail. Finally, it gives peace of mind when ones arguments have been checked very carefully with the aid of a computer. Great formalization feats include: a formal proof of the Kepler conjecture [10], the four color theorem [8] and the Feit–Thompson theorem [9] (the beginning of the classification of finite simple groups). Notably, the former two are huge proofs which crucially depend on computer computations which due to their sheer size cannot be checked as a whole by humans.
منابع مشابه
The James construction and $\pi_4(\mathbb{S}^3)$ in homotopy type theory
In the first part of this paper we present a formalization in Agda of the James construction in homotopy type theory. We include several fragments of code to show what the Agda code looks like, and we explain several techniques that we used in the formalization. In the second part, we use the James construction to give a constructive proof that π4(S ) is of the form Z/nZ (but we do not compute ...
متن کاملModel structure on the universe in a two level type theory
There is an on-going connection between type theory and homotopy theory, based on the similarity between types and the notion of homotopy types for topological spaces. This idea has been made precise by exhibiting the category cSet of cubical sets as a model of homotopy type theory. It is natural to wonder, conversely, to what extend this model can be reflected in a type theory. The homotopy st...
متن کاملHigher Inductive Types in Homotopy Type Theory
Homotopy Type Theory (HoTT) refers to the homotopical interpretation [1] of Martin-Löf’s intensional, constructive type theory (MLTT) [5], together with several new principles motivated by that interpretation. Voevodsky’s Univalent Foundations program [6] is a conception for a new foundation for mathematics, based on HoTT and implemented in a proof assistant like Coq [2]. Among the new principl...
متن کاملFrom signatures to monads in UniMath
The term UniMath refers both to a formal system for mathematics, as well as a computerchecked library of mathematics formalized in that system. The UniMath system is a core dependent type theory, augmented by the univalence axiom. The system is kept as small as possible in order to ease verification of it—in particular, general inductive types are not part of the system. In this work, we partia...
متن کاملProof of the Blakers-massey Theorem
An exposition of some proofs of the Freudenthal suspension theorem and the BlakersMassey theorem. These are meant to be reverse engineered versions of proofs in homotopy type theory due to Lumsdaine, Finster, and Licata. The proof of Blakers-Massey given here is based on a formalization given by Favonia.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016