Abstract
We contribute to the theory of (homotopy) colimits inside homotopy type theory. The heart of our work characterizes the connection between colimits in coslices of a universe, called coslice colimits, and colimits in the universe (i.e., ordinary colimits). To derive this characterization, we find an explicit construction of colimits in coslices that is tailored to reveal the connection. We use the construction to derive properties of colimits. Notably, we prove that the forgetful functor from a coslice creates colimits over trees. We also use the construction to examine how colimits interact with orthogonal factorization systems and with cohomology theories. As a consequence of their interaction with orthogonal factorization systems, all pointed colimits (special kinds of coslice colimits) preserve n-connectedness, which implies that higher groups are closed under colimits on directed graphs. We have formalized our main construction of the coslice colimit functor in Agda.
Original language | English (US) |
---|---|
Title of host publication | 33rd EACSL Annual Conference on Computer Science Logic, CSL 2025 |
Editors | Jorg Endrullis, Sylvain Schmitz |
Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
ISBN (Electronic) | 9783959773621 |
DOIs | |
State | Published - Feb 3 2025 |
Event | 33rd EACSL Annual Conference on Computer Science Logic, CSL 2025 - Amsterdam, Netherlands Duration: Feb 10 2025 → Feb 14 2025 |
Publication series
Name | Leibniz International Proceedings in Informatics, LIPIcs |
---|---|
Volume | 326 |
ISSN (Print) | 1868-8969 |
Conference
Conference | 33rd EACSL Annual Conference on Computer Science Logic, CSL 2025 |
---|---|
Country/Territory | Netherlands |
City | Amsterdam |
Period | 2/10/25 → 2/14/25 |
Bibliographical note
Publisher Copyright:© Perry Hart and Kuen-Bang Hou.
Keywords
- category theory
- colimits
- higher inductive types
- homotopy type theory
- synthetic homotopy theory