ScalingStacks

Let \(\mathcal C\in \mathrm{Pr}^{\mathrm{L},\mathrm{c}}\) and \(S\) a small set of compact generators. Then the set \(S\subseteq \mathcal C^{c}\) generates the full subcategory \(\mathcal C^{c}\) under retracts and finite colimits. In particular, every compact object in \(\mathcal C\) is a retract of an iterated finite colimit of objects in \(S\).