pith. sign in

The join construction

3 Pith papers cite this work. Polarity classification is still indexing.

3 Pith papers citing it
abstract

In homotopy type theory we can define the join of maps as a binary operation on maps with a common co-domain. This operation is commutative, associative, and the unique map from the empty type into the common codomain is a neutral element. Moreover, we show that the idempotents of the join of maps are precisely the embeddings, and we prove the `join connectivity theorem', which states that the connectivity of the join of maps equals the join of the connectivities of the individual maps. We define the image of a map $f:A\to X$ in $U$ via the join construction, as the colimit of the finite join powers of $f$. The join powers therefore provide approximations of the image inclusion, and the join connectivity theorem implies that the approximating maps into the image increase in connectivity. A modified version of the join construction can be used to show that for any map $f:A\to X$ in which $X$ is only assumed to be locally small, the image is a small type. We use the modified join construction to give an alternative construction of set-quotients, the Rezk completion of a precategory, and we define the $n$-truncation for any $n:\mathbb{N}$. Thus we see that each of these are definable operations on a univalent universe for Martin-L\"of type theory with a natural numbers object, that is moreover closed under homotopy coequalizers.

verdicts

UNVERDICTED 3

representative citing papers

Classifying Types

math.LO · 2019-06-22 · unverdicted · novelty 5.0

The thesis advances the development of synthetic homotopy theory within homotopy type theory, covering classifying types and internal questions not necessarily tied to classical homotopy.

citing papers explorer

Showing 3 of 3 citing papers.

  • Delooping presented groups in homotopy type theory cs.LO · 2024-05-06 · unverdicted · none · ref 35 · internal anchor

    Simpler delooping constructions for presented groups in HoTT using 2-polygraphs, Cayley graphs, and complexes, formalized in cubical Agda.

  • Constructive higher sheaf models with applications to synthetic mathematics cs.LO · 2026-05-14 · unverdicted · none · ref 33 · 2 links · internal anchor

    Develops constructive higher sheaf models of type theory to support synthetic mathematics with univalence and higher inductive types.

  • Classifying Types math.LO · 2019-06-22 · unverdicted · none · ref 28 · internal anchor

    The thesis advances the development of synthetic homotopy theory within homotopy type theory, covering classifying types and internal questions not necessarily tied to classical homotopy.