an introduction to homotopy type theory
play

An Introduction to Homotopy Type Theory Morteza Moniri Department - PowerPoint PPT Presentation

An Introduction to Homotopy Type Theory Morteza Moniri Department of Mathematics Shahid Beheshti University Mathematical Logic and its Applications September 4, 2019 Arak University of Technology Morteza Moniri Homotopy Type Theory 1/21


  1. An Introduction to Homotopy Type Theory Morteza Moniri Department of Mathematics Shahid Beheshti University Mathematical Logic and its Applications September 4, 2019 Arak University of Technology Morteza Moniri Homotopy Type Theory 1/21

  2. Outline • HoTT is a new branch of mathematics that combines aspects of homotopy theory and type theory. Morteza Moniri Homotopy Type Theory 2/21

  3. Outline • HoTT is a new branch of mathematics that combines aspects of homotopy theory and type theory. • The univalence axiom of Voevodsky based on homotopic interpretation of type theory implies that isomorphic structures can be identified. Morteza Moniri Homotopy Type Theory 2/21

  4. Outline • HoTT is a new branch of mathematics that combines aspects of homotopy theory and type theory. • The univalence axiom of Voevodsky based on homotopic interpretation of type theory implies that isomorphic structures can be identified. • This suggests a new foundation of mathematics and convenient machine implementation. Morteza Moniri Homotopy Type Theory 2/21

  5. Outline • HoTT is a new branch of mathematics that combines aspects of homotopy theory and type theory. • The univalence axiom of Voevodsky based on homotopic interpretation of type theory implies that isomorphic structures can be identified. • This suggests a new foundation of mathematics and convenient machine implementation. • A special year on univalent foundation of Mathematics was held in 2012-2013 at the Institute for Advanced Study, school of mathematics. Morteza Moniri Homotopy Type Theory 2/21

  6. Outline • HoTT is a new branch of mathematics that combines aspects of homotopy theory and type theory. • The univalence axiom of Voevodsky based on homotopic interpretation of type theory implies that isomorphic structures can be identified. • This suggests a new foundation of mathematics and convenient machine implementation. • A special year on univalent foundation of Mathematics was held in 2012-2013 at the Institute for Advanced Study, school of mathematics. • Recently, philosopher of science, James Ladyman, argues that HoTT can be considered as an autonomous foundation of mathematics, independent of Homotopy Theory. Morteza Moniri Homotopy Type Theory 2/21

  7. Introduction • The notion of type theory begins with Bertrand Russel’s efforts to resolve certain paradoxes in set theory. Morteza Moniri Homotopy Type Theory 3/21

  8. Introduction • The notion of type theory begins with Bertrand Russel’s efforts to resolve certain paradoxes in set theory. • His investigation is the foundation of mathematics, led him to consider the type of individuals, the type of first order functions (predicates), ... Morteza Moniri Homotopy Type Theory 3/21

  9. Introduction • The notion of type theory begins with Bertrand Russel’s efforts to resolve certain paradoxes in set theory. • His investigation is the foundation of mathematics, led him to consider the type of individuals, the type of first order functions (predicates), ... • If θ ( x ) is a predicate, what is the place from which x may be taken s.t. θ ( x ) is a sensible assertion? For example, if θ ( x ) stands for " x is either true or false", then x should be a proposition. Morteza Moniri Homotopy Type Theory 3/21

  10. Introduction • The notion of type theory begins with Bertrand Russel’s efforts to resolve certain paradoxes in set theory. • His investigation is the foundation of mathematics, led him to consider the type of individuals, the type of first order functions (predicates), ... • If θ ( x ) is a predicate, what is the place from which x may be taken s.t. θ ( x ) is a sensible assertion? For example, if θ ( x ) stands for " x is either true or false", then x should be a proposition. • The basic notion in modern type theory is that each object is assigned a type, and this type is something to which the object is explicitly linked. Morteza Moniri Homotopy Type Theory 3/21

  11. Curry-Howard Isomorphism Curry-Howard (1934) : Corresponding between Computations in type theory and Natural Deduction proofs f : A → B x : A f ( x ) : B Morteza Moniri Homotopy Type Theory 4/21

  12. Proposition as types HoTT is based on constructive intentional type theory (Mortin-Löf 1975-1982-1984). Morteza Moniri Homotopy Type Theory 5/21

  13. Proposition as types HoTT is based on constructive intentional type theory (Mortin-Löf 1975-1982-1984). Propositions as types: Morteza Moniri Homotopy Type Theory 5/21

  14. Proposition as types HoTT is based on constructive intentional type theory (Mortin-Löf 1975-1982-1984). Propositions as types: • Each proposition is the type (set) of its proofs (these are the only types). Morteza Moniri Homotopy Type Theory 5/21

  15. Proposition as types HoTT is based on constructive intentional type theory (Mortin-Löf 1975-1982-1984). Propositions as types: • Each proposition is the type (set) of its proofs (these are the only types). • Propositions are syntactic objects, like 2 + 3 = 5 . On the other hand, " 2 + 2 = 4 is true" is a judgement. Morteza Moniri Homotopy Type Theory 5/21

  16. Proposition as types HoTT is based on constructive intentional type theory (Mortin-Löf 1975-1982-1984). Propositions as types: • Each proposition is the type (set) of its proofs (these are the only types). • Propositions are syntactic objects, like 2 + 3 = 5 . On the other hand, " 2 + 2 = 4 is true" is a judgement. • A proposition is true if we have a token of the corresponding type. Morteza Moniri Homotopy Type Theory 5/21

  17. Logical operators • Correspondence between logical operators and types: Morteza Moniri Homotopy Type Theory 6/21

  18. Logical operators • Correspondence between logical operators and types: A → B = B A A ∧ B = A × B A ∨ B = A + B ¬ A = ∅ A ⊥ = ∅ ⊤ = { 0 } Morteza Moniri Homotopy Type Theory 6/21

  19. Logical operators • Correspondence between logical operators and types: A → B = B A A ∧ B = A × B A ∨ B = A + B ¬ A = ∅ A ⊥ = ∅ ⊤ = { 0 } Identity Type : For a, b of type U , we have the type Id U ( a, b ) . Morteza Moniri Homotopy Type Theory 6/21

  20. Dependent types • Dependent types: Morteza Moniri Homotopy Type Theory 7/21

  21. Dependent types • Dependent types: A proof of ∀ x : A ϕ ( x ) is a function with domain A s.t. for x : A we have f ( x ) : ϕ ( x ) . ∏ ∀ x : A ϕ ( x ) = ϕ ( x ) x ∈ A ⨿ ∃ x : A ϕ ( x ) = ϕ ( x ) � �� � x : A a pair ( x,y ) s.t. x : A and y : ϕ ( x ) � �� � coproduct or disjoint union Morteza Moniri Homotopy Type Theory 7/21

  22. Types in HoTT • The basic way to construct types in HoTT is essentially similar to constructing types in MLTT. Morteza Moniri Homotopy Type Theory 8/21

  23. Types in HoTT • The basic way to construct types in HoTT is essentially similar to constructing types in MLTT. • " exp 1 = exp 2 " means expressions exp 1 and exp 2 name the same tokens or types. Morteza Moniri Homotopy Type Theory 8/21

  24. Types in HoTT • The basic way to construct types in HoTT is essentially similar to constructing types in MLTT. • " exp 1 = exp 2 " means expressions exp 1 and exp 2 name the same tokens or types. • " exp 1 := exp 2 " means "by definition, expression exp 1 names the same tokens or types as exp 2 ". Morteza Moniri Homotopy Type Theory 8/21

  25. Identity Type About the Identity Type: Morteza Moniri Homotopy Type Theory 9/21

  26. Identity Type About the Identity Type: } a ∈ U • Id U ( a, b ) is a type b ∈ U Morteza Moniri Homotopy Type Theory 9/21

  27. Identity Type About the Identity Type: } a ∈ U • Id U ( a, b ) is a type b ∈ U • refl a : Id U ( a, a ) (reflexivity of identity) • We have a = b ⇒ Id U ( a, b ) ̸ = ∅ Morteza Moniri Homotopy Type Theory 9/21

  28. Identity Type About the Identity Type: } a ∈ U • Id U ( a, b ) is a type b ∈ U • refl a : Id U ( a, a ) (reflexivity of identity) • We have a = b ⇒ Id U ( a, b ) ̸ = ∅ a = b ̸⇐ Id U ( a, b ) ̸ = ∅ This failure is definition of intentionality for a type theory Morteza Moniri Homotopy Type Theory 9/21

  29. Path Induction For any type U and property P that can be asserted of identifications between tokens of U , if we can prove that P holds of all trivial self-identifications refl a for all a ∈ U , then it holds of all identifications in U . Morteza Moniri Homotopy Type Theory 10/21

  30. Univalence Axiom Univalence Axiom (Voevodsky): ( A ≃ B ) ≃ Id U ( A, B ) . Morteza Moniri Homotopy Type Theory 11/21

  31. Univalence Axiom Univalence Axiom (Voevodsky): ( A ≃ B ) ≃ Id U ( A, B ) . • A ≃ B is the type of equivalences between A and B , i.e. types of functions f : A → B for which there exists a quasi-invense. Morteza Moniri Homotopy Type Theory 11/21

  32. Isomorphisms are Identities • Steve Awodey argues that the Univalence Axiom implies that Isomorphic Structures are Identical. Morteza Moniri Homotopy Type Theory 12/21

  33. Isomorphisms are Identities • Steve Awodey argues that the Univalence Axiom implies that Isomorphic Structures are Identical. • why is UA plausible? Morteza Moniri Homotopy Type Theory 12/21

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend