Derived -categories as exact completions
arXiv:2310.12925
Abstract
We develop the theory of exact completions of regular -categories, and show that the -categorical exact completion (resp. hypercompletion) of an abelian category recovers the connective half of its bounded (resp. unbounded) derived -category. Along the way, we prove that a finitely complete -category is exact and additive if and only if it is prestable, extending a classical characterization of abelian categories. We also establish -categorical versions of Barr's embedding theorem and Makkai's image theorem.