Homotopy Type Theory

Homotopy

() () () ()

p : x =_A y.

p, q : x =_A y.

2-path/homotopy

r:p=x=Ayq.

Types Are Higher Groupoids

inverse : =-symmetry

First proof.

λ(A).λ(a).λ(b).λ(p). {ind}_{=_{A}} (λ(a).λ(b).λ(p). (a = b), λa. {refl}_{a}, a, b, p) : (A : U) → (a, b : A) → (a = b) → (b = a) .

concatenate/compose : =-transitivity

λA.λa.λb.λc.λp.λq. {ind}_{=_{A}} (λa.λb.λp.λc.λq. (a = c), {ind}_{=_{A}} (λa.λc.λq. (a = c), {refl}_{a})) : (A : U) → (a, b, c : A) → (a = b) → (b = c) → (a = c) .

Lemma

A : U → x, y, z, w : A → p : x = y, q : y = z, r : z = w → 1. p = p ⋅ ↺_y, p = ↺_x ⋅ p. 2. p^[−1] ⋅ p = ↺_y, p ⋅ p^[−1] = ↺_x. 3. (p^[−1])^[−1] = p. 4. p ⋅ (q ⋅ r) = (p ⋅ q) ⋅ r.

Eckmann–Hilton

α, β : Ω^2 (A, a) → α ⋅ β = β ⋅ α.

Pointed type

() ()

Loop space

() () () () () (()) () (()) (()) () ()

Functions Are Functors

Lemma

() (() ()) () () () () () () () (() ()) () () () ()

Lemma

Dependent Types are Fibrations

Transport

a : A → P : U → p : x =_A y → p_* ≡ transport^P (p, –) ≡ ind_[=_A] (D, d, x, y, p) : P (x) → P (y), D ≡ x, y : A, p : x =_A y → P (x) = P (y), d ≡ x : A → id_[P (x)], ind_=_A (D, d, x, y, p) : P (x) → P (y) for p : x = y.

Type theory: P respects equality: x = y → P(x) ≃ P(y). Topology: path lifting in a fibration P with base space A, with P(x) being the fibre over x and with Σ_[x : A] P being the total space of the fibration, with the first projection Σ_[x : A] P(x) → A.

Path lifting property

A : U → a : A → P : U,  a_0 : A, p_0 : P → p : x =_A y → lift (p_0, p) : (x, p_0) = (y, p_* (p_0)), pr_1 (lift (p_0, p)) = p.

Dependent map

(()) () () () (()) () ()

Lemma

(() ()) ((()) ()) ((()) ()) (() ())

Lemma

() (()) () ()

Lemma

(())

Lemma

() (())

Homotopies and Equivalences

Homotopies

Natural transformations.

\frac{f, g : (a : A) → B (a)}{(f ∼ g) ≡ (a : A) → (f (a) = g (a))} .

Equivalence Relation

(() ()) () (() ()) () () (() ()) () () ()

Lemma

() () () () ()

Corollary

() () (()) (())

Quasi-Inverse

Homotopy equivalence, 'equivalence of (higher) groupoids'.

() () () ()

Example

() ()

Example

Equivalence

1. (a : A) → f : B → qinv (f) → is-equiv (f) . 2. (a : A) → f : B → is-equiv (f) → qinv (f) . 3. e_1, e_2 : is-equiv (f) → e_1 = e_2. g \overset{β}{\sim} h ◦ f ◦ g \overset{α}{\sim} h, A ≃ B ≡ (f : A → B), is-equiv (f) .

Lemma

1. A ≃ A. 2. A ≃ B → B ≃ A. 3. A ≃ B → B ≃ C → A ≃ C.

The Higher Groupoid Structure of type formers

×

Theorem

(x =_{A × B} y) → ({pr}_{1} (x) =_{A} {pr}_{1} (y)) × ({pr}_{3} (x) =_{B} {pr}_{3} (y)) .

Introduction rule for =_{A × B}

Elimination rule for =_{A × B}

Propositional computation rule for =_{A × B}

Propositional uniqueness principle for =_{A × B}

Theorem

Dependent ×

Theorem

w, w' : (a : A, P) → (w = w') ≃ p : w_0 = w'_0, p_* (w_1) = w'_1.

Propositional uniqueness principle

z : (a : A) × P (a) → z = ({pr}_{1} (z), {pr}_{3} (z)) .

Theorem

() () () () () (() (()) ())

𝟏

Theorem

() () ()

Π-types and the function extensionality axiom

Function extensionality

a : A → B : U → f, g : B → (f = g) ≃ (a : A → f (a) =_[B (a)] g (a)) . happly : (f =_B g) → (a : A → f (a) =_[B (a)] g (x)), _ : is-equiv (happly) . funext : (a : A → f =_B g) → f =_B g.

Lemma

() () (()) (() ())

Lemma

() () (()) ()

Universes and the univalence axiom

Lemma

() ()

Univalence

() ()

Remark

Introduction rule for =_𝒰

() ()

Elimination rule for =_𝒰

() ()

Propositional computation rule for =_𝒰

(()) ()

Propositional uniqueness rule for =_𝒰

(())

↺_A = ua(id_A).
ua(f) ⋅ ua(g) = ua(g ◦ f).
ua(f)^[−1] = ua(f^[−1]).

Lemma

=

Theorem

(a =_A a') → (b (a) =_B b (a'))

Lemma

Theorem

+

(inj_1 (a) = inj_1 (a')) ≃ (a = a') (inj_2 (b) = inj_2 (b')) ≃ (b = b') (inj_1 (a) = inj_2 (b)) ≃ 𝟎 code (inj_1 (a)) ≡ (a_0 = a), code (inj_2 (b)) ≡ 𝟎.

Theorem

ℕ

() (()) (()) (() ()) () () () (()) ()

Theorem

m, n : ℕ → (m = n) ≃ code (m, n) . encode : m, n : ℕ → (m = n) → code (m, n), encode (m, n, p) ≡ transport^[code (m, –)] (p, r (m)), decode : m, n : ℕ → code (m, n) → (m = n) (by double induction on m, n) . code (succ (m), succ (n)) ≡ code (m, n) \overset{decode (m, n)}{\to} (m = n) \overset{ap_[succ]}{\to} succ (m) = succ (n) .

Equality of Structures

Semigroup structures

(m : A → A → A, x, y, z : A) → m (x, m (y, z)) = m (m (x, y), z)

Universal Properties

×

Mapping in, non-dependent.

() () ()

\frac{\frac{\frac{f : X → A × B}{{pr}_{1} f : X → A {pr}_{3} f : X → B}}{({pr}_{1} f, {pr}_{3} f) : (X → A) × (X → B)} ×-introduction}{λf. ({pr}_{1} f, {pr}_{3} f) : (X → A × B) → ((X → A) × (X → B))} →-introduction.

\frac{\frac{a : X → A   b : X → B}{(a, b) : (X → A) × (X → B)} ×-introduction}{λ (a, b) .λx. (a x, b x) : ((X → A) × (X → B)) → (X → A × B)} →-introduction.

By type theory#×-induction.

\begin{array}{l} {ind}_{(X → A) × (X → B)} & ( & C, c, & ( & a, b & ) & ) & ≡ c & ( & a & ) & ( & b & ) & , \\ {ind}_{(X → A) × (X → B)} & : & ( & C : & ( & ( & X → A & ) & × & ( & X → B & ) & ) & → 𝒰 & ) & → & ( & ( & a : X → A & ) & → & ( & b : X → B & ) & → C & ( & ( & a, b & ) & ) & ) & → & ( & x : & ( & X → A & ) & × & ( & X → B & ) & ) & → C & ( & x & ) & . \\ λx. & ( & ( & {pr}_{1} & f x, & {pr}_{3} & f x & ) & ) & ≡ f, \\ ( & λx.a & ( & x & ) & , λx.b & ( & x & ) & ) & ≡ & ( & a, b & ) & . \end{array}

Mapping in, dependent.

((x : X) → (A (x) × B (x))) → ((x : X) → A (x)) × ((x : X) → B (x))

Mapping out, non-dependent.

(()) (())

Mapping out, dependent.

(() ()) (() (() ()))

Dependent ×

Mapping in, dependent.

Axiom of chice.

() ((()) () ()) (() ()) (() () (()))

Mapping out, dependent.

((() ()) ()) (() ((()) ()))

+

() () ()

𝟏

𝟎

?

(() () ()) () () () (() ())

Higher Inductive Types

𝕊¹

'Circle'.

Formation Rule

\frac{}{𝕊^{1} : 𝒰} .

Introduction Rules

\frac{}{base : 𝕊^{1}}, \frac{}{loop : base =_{𝕊^{1}} base}

Induction principle and dependent path

𝕀

'Interval'.

Formation Rule

\frac{}{𝕀 : 𝒰} .

Introduction Rules

\frac{}{0_{𝕀} : 𝕀}, \frac{}{1_{𝕀} : 𝕀}, \frac{}{seg : 0_{𝕀} =_{𝕀} 1_{𝕀}}

Recursion Principle

Function Extensionality

Lemma

()

Lemma

() (() ()) ()

Circle and Sphere

Lemma

loop ≠ ↺_[base].

Lemma

f : (x : 𝕊^1) → (x = x),  f ≠ x ↦ ↺_x.

Corollary

𝕊^1 : U,  is-truncated_1 (U) → 0.

Lemma

() ()

Lemma

() () () ()

Lemma

Suspension

N : ΣA,
S : ΣA,
merid : A → (N =_[ΣA] S).

Lemma

Σ𝟐 ≃ S_1.

Lemma

() () ()

Lemma

() () () ()

Cell Complex

Hub and Spoke

Pushout

Truncation

Lemma

(||A ∪^C B||_0 → E) ≃ {cocone}_{D} (E) .

Quotient

Algebra

Theorem

(()) ()

Monoid

()

(x, y) ↦ x y : G × G → G,
1 : G,
(x : G) → (x 1 = x) × (1 x = x),
(x, y, z : G) → x (y z) = (x y) z.

Group

x ↦ x^[−1] : G → G,
(x : G) → (x x^[−1] = 1) × (x^[−1] x = 1).

Flattening Lemma

General Syntax

Example

() ()

Quotient

(a, b : A) × R (a, b) ⇉ A.

q : A → A / R,
(a, b : A) → R(a, b) → (q(a) = q(b)),
(x, y : A / R) → (r, s : x = y) → (r = s).

Integers

() () () ()

Lemma

(() ()) () () (()) () (()) (() (() ()))

Corollary

Lemma

P : Z → U,

d_0 : P(0),
d_+ : (n : N) → P(n) → P(succ(n)),
d_− : (n : N) → P(−n) → P(−succ(n))

→ f : z : Z → P(z),

f(0) = d_0,
(n : N) → f(succ(n)) = d_+(n, f(n)),
(n : N) → f(−succ(n)) = d_−(n, f(−n)).

Corollary

p : a = a, n ↦ p_n : (n : Z) → (a = a), p^0 ≡ ↺_a, p^[n + 1] ≡ p^n p  for 0 ≤ n, p^[n − 1] ≡ p^n p^[−1]  for n ≤ 0.

Homotopy Type Theory

Contents

Homotopy

Types Are Higher Groupoids

inverse : =-symmetry

concatenate/compose : =-transitivity

Lemma

Eckmann–Hilton

Pointed type

Loop space

Functions Are Functors

Lemma

Lemma

Dependent Types are Fibrations

Transport

Transport

Path lifting property

Dependent map

Lemma

Lemma

Lemma

Lemma

Lemma

Homotopies and Equivalences

Homotopies

Equivalence Relation

Lemma

Corollary

Quasi-Inverse

Example

Example

Example

Equivalence

Lemma

The Higher Groupoid Structure of type formers

×

Theorem

Introduction rule for =A × B

Elimination rule for =A × B

Propositional computation rule for =A × B

Propositional uniqueness principle for =A × B

Theorem

Theorem

Dependent ×

Theorem

Propositional uniqueness principle

Theorem

𝟏

Theorem

Π-types and the function extensionality axiom

Function extensionality

Lemma

Lemma

Universes and the univalence axiom

Lemma

Univalence

Remark

Introduction rule for =𝒰

Elimination rule for =𝒰

Propositional computation rule for =𝒰

Propositional uniqueness rule for =𝒰

Lemma

=

Theorem

Lemma

Lemma

Theorem

Theorem

+

Theorem

ℕ

Theorem

Equality of Structures

Semigroup structures

Universal Properties

×

Mapping in, non-dependent.

Mapping in, dependent.

Dependent ×

Mapping in, dependent.

Introduction rule for =_{A × B}

Elimination rule for =_{A × B}

Propositional computation rule for =_{A × B}

Propositional uniqueness principle for =_{A × B}

Introduction rule for =_𝒰

Elimination rule for =_𝒰

Propositional computation rule for =_𝒰

Propositional uniqueness rule for =_𝒰

𝕊¹