Back to Search
Start Over
Univalent categories and the Rezk completion
- Source :
- Mathematical Structures in Computer Science. 25:1010-1039
- Publication Year :
- 2015
- Publisher :
- Cambridge University Press (CUP), 2015.
-
Abstract
- We develop category theory within Univalent Foundations, which is a foundational system for mathematics based on a homotopical interpretation of dependent type theory. In this system, we propose a definition of "category" for which equality and equivalence of categories agree. Such categories satisfy a version of the Univalence Axiom, saying that the type of isomorphisms between any two objects is equivalent to the identity type between these objects; we call them "saturated" or "univalent" categories. Moreover, we show that any category is weakly equivalent to a univalent one in a universal way. In homotopical and higher-categorical semantics, this construction corresponds to a truncated version of the Rezk completion for Segal spaces, and also to the stack completion of a prestack.<br />Comment: 27 pages, ancillary files contain formalized proofs in the proof assistant Coq; v2: version for publication in Math. Struct. in Comp. Sci., incorporating suggestions by referees and Voevodsky
- Subjects :
- Pure mathematics
Equivalence of categories
Mathematics::Complex Variables
Mathematics - Category Theory
Mathematics - Logic
Type (model theory)
18A15
Computer Science Applications
Interpretation (model theory)
Identity (mathematics)
Mathematics (miscellaneous)
Mathematics::Category Theory
FOS: Mathematics
Category Theory (math.CT)
Logic (math.LO)
Univalent foundations
Category theory
Axiom
Mathematics
Stack (mathematics)
Subjects
Details
- ISSN :
- 14698072 and 09601295
- Volume :
- 25
- Database :
- OpenAIRE
- Journal :
- Mathematical Structures in Computer Science
- Accession number :
- edsair.doi.dedup.....032de08582585f9808be168cbf939dbf
- Full Text :
- https://doi.org/10.1017/s0960129514000486