Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs 2016
DOI: 10.1145/2854065.2854076
|View full text |Cite
|
Sign up to set email alerts
|

Constructing the propositional truncation using non-recursive HITs

Abstract: In homotopy type theory, we construct the propositional truncation as a colimit, using only non-recursive higher inductive types (HITs). This is a first step towards reducing recursive HITs to non-recursive HITs. This construction gives a characterization of functions from the propositional truncation to an arbitrary type, extending the universal property of the propositional truncation. We have fully formalized all the results in a new proof assistant, Lean.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
18
0

Year Published

2016
2016
2019
2019

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 19 publications
(18 citation statements)
references
References 7 publications
0
18
0
Order By: Relevance
“…This means we have a function |−| : A → A , precomposition with which gives an equivalence ( A → B) (A → B) for any mere proposition B. There are several constructions of the propositional truncation in terms of pushouts and colimits due to Van Doorn [3], Kraus [7], and the second-named author [9].…”
Section: Introductionmentioning
confidence: 99%
“…This means we have a function |−| : A → A , precomposition with which gives an equivalence ( A → B) (A → B) for any mere proposition B. There are several constructions of the propositional truncation in terms of pushouts and colimits due to Van Doorn [3], Kraus [7], and the second-named author [9].…”
Section: Introductionmentioning
confidence: 99%
“…As for (3), if A and P are sets we can consider it justified by UFP 2013, Theorem 10.1.5 (surjections of sets are regular epimorphisms). The general case requires a more refined notion of "quotient map", but is also true when suitably formulated (see Kraus 2016;Rijke 2017;van Doorn 2016).…”
Section: The ♯ Modality and Codiscretenessmentioning
confidence: 99%
“…Most of the higher inductive types that are commonly used can be constructed just from pushouts and the other con-structions in MLTT with univalent universes. These include joins and suspensions (and therefore, spheres), cofibers (and thus smash products), sequential colimits, the propositional truncation [22,31] and all the higher truncations [43], set quotients, and in fact, all non-recursive HITs specified using point-, 1-, and 2-constructors by a construction due to van Doorn [24]. We also get cell complexes [15], Eilenberg-MacLane spaces [33], and projective spaces [17], and so a lot of algebraic topology can be developed on this basis, and even a theory of ∞-groups [14] and spectra (and thus homology and cohomology theory), culminating in a proof that π 4 (S 3 ) = Z/2Z [13], and a formalized proof of the Serre spectral sequence for cohomology [23].…”
Section: Bmentioning
confidence: 99%