Proposition 5.27.The -category of split-exact
sequences of small stable -categories is accessible. In
particular, there exists a cardinal such that any split-exact
sequence in is a -filtered (and hence filtered)
colimit of -compact split-exact sequences in .
Proof.By proposition 5.26, we may equivalently show that
is accessible. Recall that an adjunction
of -categories can be described as a map which
is both a cocartesian fibration and a cartesian
fibration [52, 5.2.2.1]. This leads us to consider the
commutative diagram of pullback squares
in which
(respectively,
) denote
the subcategories of cocartesian fibrations (respectively, cartesian
fibrations whose straightenings are fully faithful) and functors which
preserve cocartesian (respectively, cartesian) edges.
Since is an accessible functor between
accessible -categories, it suffices, using the [52, 5.4.4.3,
5.4.5.16, 5.4.6.6] and the duality between cartesian and
cocartesian fibrations, to show that
is accessible, and that the
inclusions
are accessible functors.
The straightening functor gives an equivalence
between cartesian fibrations over and presheaves of
-categories on [52, 3.2.0.1].
In order to understand the condition of being fully faithful, we write
as an accessible localization
of simplicial
spaces [47]. A functor is fully faithful when the corresponding
map of (local) simplicial spaces is fully faithful, and recall that a
map of simplicial spaces is fully faithful if
and only if is an
equivalence. It follows that is
the accessible localization of
obtained by also inverting
the pushout product of and
. Thus
and
are accessible.
Finally, it remains to show that the inclusion
is
accessible. First, observe that finite limits commute with filtered colimits in , as is compactly generated, the inclusion preserves limits and filtered colimits [52, 5.3.5.3], and finite limits commute with filtered colimits in presheaf -categories (this uses [52, 5.3.3.3] and the fact that (co)limits in presheaf -categories are computed objectwise). It follows that the filtered colimit of cartesian fibrations
, computed in , is itself a
cartesian fibration ; indeed, the inclusions
preserve cartesian edges over , and
inspection of the fibers
over each vertex shows that is also the colimit in .
∎