Complete category


In mathematics, a complete category is a category in which all small limits exist. That is, a category C is complete if every diagram F : JC has a limit in C. Dually, a cocomplete category is one in which all small colimits exist. A bicomplete category is a category which is both complete and cocomplete.
The existence of all limits is too strong to be practically relevant. Any category with this property is necessarily a thin category: for any two objects there can be at most one morphism from one object to the other.
A weaker form of completeness is that of finite completeness. A category is finitely complete if all finite limits exists. Dually, a category is finitely cocomplete if all finite colimits exist.

Theorems

It follows from the existence theorem for limits that a category is complete if and only if it has equalizers and all products. Since equalizers may be constructed from pullbacks and binary products, a category is complete if and only if it has pullbacks and products.
Dually, a category is cocomplete if and only if it has coequalizers and all coproducts, or, equivalently, pushouts and coproducts.
Finite completeness can be characterized in several ways. For a category C, the following are all equivalent:
The dual statements are also equivalent.
A small category C is complete if and only if it is cocomplete. A small complete category is necessarily thin.
A posetal category vacuously has all equalizers and coequalizers, whence it is complete if and only if it has all products, and dually for cocompleteness. Without the finiteness restriction a posetal category with all products is automatically cocomplete, and dually, by a theorem about complete lattices.

Examples and nonexamples