If the opposite category is total, is called cototal.
The definition above requires some set-theoretic assumption to ensure that the functor category exists, but it can be rephrased to say that the colimit of weighted by exists, for any . (This still involves quantification over large objects, however, so some foundational care is needed.) This version has an evident generalization to enriched categories.
Since the Yoneda embedding is a full and faithful functor, a total category induces an idempotent monad on its category of presheaves, hence a modality. One says that is a totally distributive category if this modality is itself the right adjoint of an adjoint modality.
The -adjunction of a total category is closely related to the -adjunction discussed at Isbell duality and at function algebras on ∞-stacks. In that context the -modality deserves to be called the affine modality.
Although the definition refers explicitly only to colimits, every total category is also complete, i.e. has all small limits. It also has some large limits. In fact, it has “all possible” large limits that a locally small category can have: if is a functor such that is a small set for all , then has a limit.
Any cocomplete and epi-cocomplete category with a generator is total. (And more generally, any cocomplete and -complete category with an -generator is total, for a suitable class .) See (Day), theorem 1, for a proof. This includes:
Also, totality lifts along solid functors; that is, if the codomain of a solid functor is total, then so is its domain. See (Tholen) for a proof. This implies that the following types of categories are total:
any reflective subcategory of a total category
Thus, “most naturally-occurring” cocomplete categories are in fact total. However, cototality is more rare. But cototal categories do occur:
Set is cototal (as well as total).
Any totally distributive category is cototal (as well as total).
Any coreflective subcategory of a cototal category is cototal.