HoTT Book in Lean

This file lists which sections of the HoTT book have been covered in the Lean HoTT library.

Summary

The rows indicate the chapters, the columns the sections.

+: completely formalized
¼, ½ or ¾: partly formalized
-: not formalized
.: no formalizable content

	1	2	3	4	5	6	7	8	9	10	11	12	13	14	15
Ch 1	.	.	.	.	+	+	+	+	+	.	+	+
Ch 2	+	+	+	+	.	+	+	+	+	+	+	+	+	+	+
Ch 3	+	+	+	+	½	+	+	-	+	.	+
Ch 4	-	+	+	+	.	+	½	+	+
Ch 5	-	.	½	-	-	.	.	½
Ch 6	.	+	+	+	+	½	½	+	¾	¼	¾	-	.
Ch 7	+	+	+	-	½	-	-
Ch 8	¾	-	-	-	-	-	-	-	-	-
Ch 9	¾	+	+	¼	¾	½	-	-	-
Ch 10	-	-	-	-	-
Ch 11	-	-	-	-	-	-

Theorems and definitions in the library which are not in the book:

One major difference is that in this library we heavily use pathovers, so we need less theorems about transports, but instead corresponding theorems about pathovers. These are in init.pathover. For higher paths there are squares, squareovers, and the rudiments of cubes and cubeovers.

Chapter 1: Type theory

1.1 (Type theory versus set theory): no formalizable content.
1.2 (Function types): no formalizable content. Related: init.function
1.3 (Universes and families): no formalizable content (Lean also has a hierarchy of universes Type.{i} : Type.{i + 1}, but they are not cumulative).
1.4 (Dependent function types (Π-types)): no formalizable content. Related: init.function
1.5 (Product types): declaration in init.datatypes, notation in init.types
1.6 (Dependent pair types (Σ-types)): declaration in init.datatypes, notation in init.types
1.7 (Coproduct types): declaration in init.datatypes, notation in init.types
1.8 (The type of booleans): declaration in init.datatypes, notation in init.bool
1.9 (The natural numbers): init.nat (declaration in init.datatypes)
1.10 (Pattern matching and recursion): no formalizable content (we can use the "pattern matching" notation using the function definition package, which are reduced to applying recursors).
1.11 (Propositions as types): some logic is in init.logic and init.types.
1.12 (Identity types): declaration in init.datatypes, more in init.logic

Chapter 2: Homotopy type theory

2.1 (Types are higher groupoids): init.path (pointed types and loop spaces in types.pointed)
2.2 (Functions are functors): init.path
2.3 (Type families are fibrations): init.path
2.4 (Homotopies and equivalences): homotopies in init.path and equivalences in init.equiv
2.5 (The higher groupoid structure of type formers): no formalizable content
2.6 (Cartesian product types): types.prod
2.7 (Σ-types): types.sigma
2.8 (The unit type): special case of init.trunc
2.9 (Π-types and the function extensionality axiom): init.funext and types.pi
2.10 (Universes and the univalence axiom): init.ua
2.11 (Identity type): init.equiv (ap is equivalence), types.eq and cubical.square (characterization of pathovers in equality types)
2.12 (Coproducts): types.sum
2.13 (Natural numbers): types.nat.hott
2.14 (Example: equality of structures): algebra formalized in algebra.group.
2.15 (Universal properties): in the corresponding file in the types folder.

Chapter 3: Sets and logic

3.1 (Sets and n-types): init.trunc. Example 3.1.9 in types.univ
3.2 (Propositions as types?): types.univ
3.3 (Mere propositions): init.trunc and hprop_trunc (Lemma 3.3.5).
3.4 (Classical vs. intuitionistic logic): decidable is defined in init.logic
3.5 (Subsets and propositional resizing): Lemma 3.5.1 is subtype_eq in types.sigma, we don't have propositional resizing as axiom yet.
3.6 (The logic of mere propositions): in the corresponding file in the types folder. (is_trunc_prod is defined in types.sigma)
3.7 (Propositional truncation): init.hit and hit.trunc
3.8 (The axiom of choice): not formalized
3.9 (The principle of unique choice): Lemma 9.3.1 in hit.trunc, Lemma 9.3.2 in types.trunc
3.10 (When are propositions truncated?): no formalizable content
3.11 (Contractibility): init.trunc (mostly), types.pi (Lemma 3.11.6), types.trunc (Lemma 3.11.7), types.sigma (Lemma 3.11.9)

Chapter 4: Equivalences

4.1 (Quasi-inverses): not formalized
4.2 (Half adjoint equivalences): init.equiv and types.equiv
4.3 (Bi-invertible maps): function ("biinv f" is "is_retraction f × is_section f")
4.4 (Contractible fibers): types.equiv
4.5 (On the definition of equivalences): no formalizable content
4.6 (Surjections and embeddings): function
4.7 (Closure properties of equivalences): 4.7.1 in init.equiv; 4.7.2 in function; 4.7.5 and 4.7.7 in types.sigma (sigma_functor is a generalization of total(f)); and 4.7.6 in 4.7.6 in types.fiber.
4.8 (The object classifier): 4.8.1 and 4.8.2 in types.fiber; 4.8.3 and 4.8.4 in types.univ
4.9 (Univalence implies function extensionality): init.funext

Chapter 5: Induction

5.1 (Introduction to inductive types): not formalized
5.2 (Uniqueness of inductive types): no formalizable content
5.3 (W-types): types.W defines W-types.
5.4 (Inductive types are initial algebras): not formalized
5.5 (Homotopy-inductive types): not formalized
5.6 (The general syntax of inductive definitions): no formalizable content
5.7 (Generalizations of inductive types): no formalizable content. Lean has inductive families and mutual induction, but no induction-induction or induction-recursion
5.8 (Identity types and identity systems): 5.8.1-5.8.4 not formalized, 5.8.5 in init.ua and 5.8.6 in init.funext

Chapter 6: Higher inductive types

6.1 (Introduction): no formalizable content
6.2 (Induction principles and dependent paths): dependent paths in init.pathover, circle in homotopy.circle
6.3 (The interval): homotopy.interval
6.4 (Circles and spheres): homotopy.sphere and homotopy.circle
6.5 (Suspensions): homotopy.suspension (we define the circle to be the suspension of bool, but Lemma 6.5.1 is similar to proving the ordinary induction principle for the circle in homotopy.circle) and a bit in homotopy.sphere and types.pointed
6.6 (Cell complexes): we define the torus using the quotient, see hit.two_quotient and homotopy.torus (no dependent eliminator defined yet)
6.7 (Hubs and spokes): hit.two_quotient and homotopy.torus (no dependent eliminator defined yet)
6.8 (Pushouts): hit.pushout. Some of the "standard homotopy-theoretic constructions" have separate files, although not all of them have been defined explicitly yet
6.9 (Truncations): hit.trunc (except Lemma 6.9.3)
6.10 (Quotients): hit.set_quotient (up to 6.10.3). We define integers differently, to make them compute, in the folder types.int. 6.10.13 is in types.int.hott
6.11 (Algebra): algebra.group, algebra.fundamental_group (no homotopy groups yet)
6.12 (The flattening lemma): not formalized yet
6.13 (The general syntax of higher inductive definitions): no formalizable content

Chapter 7: Homotopy n-types

7.1 (Definition of n-types): init.trunc, types.trunc, types.sigma (Theorem 7.1.8), types.pi (Theorem 7.1.9), hprop_trunc (Theorem 7.1.10)
7.2 (Uniqueness of identity proofs and Hedberg’s theorem): init.hedberg and types.trunc
7.3 (Truncations): init.hit, hit.trunc and types.trunc
7.4 (Colimits of n-types): not formalized
7.5 (Connectedness): homotopy.connectedness (just the beginning so far)
7.6 (Orthogonal factorization): not formalized
7.7 (Modalities): not formalized, and may be unformalizable in general because it's unclear how to define modalities

Chapter 8: Homotopy theory

Unless otherwise noted, the files are in the folder homotopy

8.1 (π_1(S^1)): homotopy.circle (only one of the proofs)
8.2 (Connectedness of suspensions): not formalized
8.3 (πk≤n of an n-connected space and π_{k<n}(S^n)): not formalized
8.4 (Fiber sequences and the long exact sequence): not formalized
8.5 (The Hopf fibration): not formalized
8.6 (The Freudenthal suspension theorem): not formalized
8.7 (The van Kampen theorem): not formalized
8.8 (Whitehead’s theorem and Whitehead’s principle): not formalized
8.9 (A general statement of the encode-decode method): not formalized
8.10 (Additional Results): not formalized

Chapter 9: Category theory

Every file is in the folder algebra.category

9.1 (Categories and precategories): precategory, iso, category, groupoid (mostly)
9.2 (Functors and transformations): functor, nat_trans, constructions.functor
9.3 (Adjunctions): adjoint
9.4 (Equivalences): adjoint (only definitions)
9.5 (The Yoneda lemma): constructions.opposite, constructions.product, yoneda (up to Theorem 9.5.9)
9.6 (Strict categories): strict (only definition)
9.7 (†-categories): not formalized
9.8 (The structure identity principle): not formalized
9.9 (The Rezk completion): not formalized

Chapter 10: Set theory

Not formalized, and parts may be unformalizable because Lean lacks induction-recursion.

Chapter 11: Real numbers

11.1 (The field of rational numbers): To be ported from the standard library.

The rest is not formalized, and parts may be unformalizable because Lean lacks induction-induction

12 KiB Raw Blame History Unescape Escape