Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science 2016
DOI: 10.1145/2933575.2934545
|View full text |Cite
|
Sign up to set email alerts
|

A Mechanization of the Blakers-Massey Connectivity Theorem in Homotopy Type Theory

Abstract: This paper continues investigations in "synthetic homotopy theory": the use of homotopy type theory to give machine-checked proofs of constructions from homotopy theory.We present a mechanized proof of the Blakers-Massey connectivity theorem, a result relating the higher-dimensional homotopy groups of a pushout type (roughly, a space constructed by gluing two spaces along a shared subspace) to those of the components of the pushout. This theorem gives important information about the pushout type, and has a num… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 22 publications
(17 citation statements)
references
References 13 publications
(13 reference statements)
0
17
0
Order By: Relevance
“…Despite a lot of work making use of concrete HITs [4,[9][10][11]23,26,27], and despite the fact that it is usually -on some intuitive level -clear for the expert how the elimination principle for such a HIT can be derived, giving a general specification and a theoretical foundation for HITs has turned out to be a major difficulty. Several approaches have been proposed [6,18,28,33], and they do indeed give a satisfactory specification of HITs in the sense that they cover all HITs which have been used so far (see related work below).…”
Section: Examplementioning
confidence: 99%
“…Despite a lot of work making use of concrete HITs [4,[9][10][11]23,26,27], and despite the fact that it is usually -on some intuitive level -clear for the expert how the elimination principle for such a HIT can be derived, giving a general specification and a theoretical foundation for HITs has turned out to be a major difficulty. Several approaches have been proposed [6,18,28,33], and they do indeed give a satisfactory specification of HITs in the sense that they cover all HITs which have been used so far (see related work below).…”
Section: Examplementioning
confidence: 99%
“…In [38] one may find a proof that the fundamental group of S 1 is Z, and in [32] one may find a formalization of the Seifert-van Kampen theorem. In [33] one may find a formalization of the Blakers-Massey connectedness theorem, using higher inductive types to construct homotopy pushouts. A translation of the formal proof into classical homotopy theory was given in [46], with the expectation that it would go through for any ∞-topos.…”
Section: Further Developmentsmentioning
confidence: 99%
“…In this case, however, we can use the James construction to give an explicit definition of the kernel of that map. We will need the Blakers-Massey theorem (see [4]): If f is n-connected and g is m-connected, then h is (n + m)-connected.…”
Section: Application To Homotopy Groups Of Spheresmentioning
confidence: 99%