Opening Univalent Foundations of Mathematics
Univalent Foundations of Mathematics
- Length
- 1 h 8 min
- Level
- Research
- Recorded
- Institute for Advanced Study2016 · Standalone Lecture
Chapter 1 of 11: Before the lecture
Voevodsky builds homotopy types in Coq, from path types and h-levels to a proof that the natural numbers form a set.
Univalent Foundations take homotopy types, not sets, as the basic objects of mathematics and formalize them directly in Martin-Löf type theory. Voevodsky starts from Grothendieck's correspondence between homotopy types and higher groupoids, where sets parametrize objects without internal structure. He then sets out the h-level hierarchy: contractible types, truth values, sets, then groupoids and -categories. In the Coq proof assistant, type families become fibrations and dependent products become spaces of sections, with paths, empty, unit and natural number types defined inductively. He proves the natural numbers form a set and has Coq normalize terms to compute cardinalities of finite sets.
Univalent Foundations take homotopy types, not sets, as the basic objects of mathematics and formalize them directly in Martin-Löf type theory. Voevodsky starts from Grothendieck's correspondence between homotopy types and higher groupoids, where sets parametrize objects without internal structure. He then sets out the h-level hierarchy: contractible types, truth values, sets, then groupoids and -categories. In the Coq proof assistant, type families become fibrations and dependent products become spaces of sections, with paths, empty, unit and natural number types defined inductively. He proves the natural numbers form a set and has Coq normalize terms to compute cardinalities of finite sets.
Your comment is kept while you sign up.Sign in