Chapter 8 Notes
\topruleTheorem | Status |
---|---|
\midruleฯ1(๐1) | \ding52\ding52 |
ฯk<n(๐n) | \ding52\ding52 |
long-exact-sequence of homotopy groups![]() |
\ding52\ding52 |
total space of Hopf fibration is ๐3 | \ding52 |
ฯ2(๐2) | \ding52\ding52 |
ฯ3(๐2) | \ding52 |
ฯn(๐n) | \ding52\ding52 |
ฯ4(๐3) | \ding52 |
Freudenthal suspension theorem | \ding52\ding52 |
BlakersโMassey theorem | \ding52\ding52 |
EilenbergโMac Lane spaces K(G,n) | \ding52\ding52 |
van Kampen theorem![]() |
\ding52\ding52 |
covering spaces | \ding52\ding52 |
Whiteheadโs principle for n-types | \ding52\ding52 |
\bottomrule |
The theorems described in this chapter are standard results in classical homotopy theory; many are described by [hatcher02topology]. In these notes, we review the development of the new synthetic proofs of them in homotopy type theory. \autoreftab:theorems lists the homotopy-theoretic theorems that have been proven in homotopy type theory, and whether they have been computer-checked. Almost all of these results were developed during the spring term at IAS in 2013, as part of a significant collaborative effort. Many people contributed to these results, for example by being the principal author of a proof, by suggesting problems to work on, by participating in many discussions and seminars about these problems, or by giving feedback on results. The following people were the principal authors of the first homotopy type theory proofs of the above theorems. Unless indicated otherwise, for the theorems that have been computer-checked, the principal authors were also the first ones to formalize the proof using a computer proof assistant.
-
โข
Shulman gave the homotopy-theoretic calculation of ฯ1(๐1). Licata later discovered the encode-decode proof and the encode-decode method.
-
โข
Brunerie calculated ฯk<n(๐n). Licata later gave an encode-decode version.
-
โข
Voevodsky constructed the long exact sequence of homotopy groups.
-
โข
Lumsdaine constructed the Hopf fibration. Brunerie proved that its total space is ๐3, thereby calculating ฯ2(๐2) and ฯ3(๐3).
-
โข
Licata and Brunerie gave a direct calculation of ฯn(๐n).
-
โข
Lumsdaine proved the Freudenthal suspension theorem; Licata and Lumsdaine formalized this proof.
-
โข
Lumsdaine, Finster, and Licata proved the BlakersโMassey theorem; Lumsdaine, Brunerie, Licata, and Hou formalized it.
-
โข
Licata gave an encode-decode calculation of ฯ2(๐2), and a calculation of ฯn(๐n) using the Freudenthal suspension theorem; using similar techniques, he constructed K(G,n).
-
โข
Shulman proved the van Kampen theorem; Hou formalized this proof.
-
โข
Licata proved Whiteheadโs theorem for n-types.
-
โข
Brunerie calculated ฯ4(๐3).
-
โข
Hou established the theory of covering spaces and formalized it.
The interplay between homotopy theory and type theory was crucial to the
development of these results. For example, the first proof that
ฯ1(๐1)=โค was the one given in \autorefsubsec:pi1s1-homotopy-theory, which follows a classical homotopy
theoretic one. A
type-theoretic analysis of this proof resulted in the development of the
encode-decode method. The first calculation of ฯ2(๐2) also followed
classical methods, but this led quickly to an encode-decode proof of the
result. The encode-decode calculation generalized to ฯn(๐n), which
in turn led to the proof of the Freudenthal suspension theorem, by
combining an encode-decode argument with classical homotopy-theoretic
reasoning about connectedness, which in turn led to the BlakersโMassey
theorem and EilenbergโMac Lane spaces. The rapid development of this
series of results illustrates the promise of our new understanding of
the connections
between these two subjects.
Title | Chapter 8 Notes |
---|---|
\metatable |