Derived ∞-categories as exact completions

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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…