Limit and Colimit
Limits and colimits unify products, equalizers, pullbacks, and all other universal constructions into a single framework. A limit is a universal cone over a diagram; a colimit is a universal cocone. Together they form the backbone of categorical constructions.
Diagrams and Cones
A diagram of shape in a category is a functor , where is a small category called the index category or shape.
A cone over a diagram with apex is a natural transformation from the constant functor (sending everything to ) to . Explicitly, it is a family of morphisms
such that for every morphism in , we have .
A limit of is a cone that is universal (terminal) among all cones: for every cone , there exists a unique morphism such that for all .
We write or for the limit object.
Dually, a colimit of is a universal cocone : a cocone that is initial among all cocones. For every cocone , there exists a unique morphism with .
Special Cases
Different shapes give different constructions:
| Shape | Limit | Colimit | |---|---|---| | Discrete (no non-identity morphisms) | Product | Coproduct | | | Equalizer | Coequalizer | | | Pullback | (dual: pushout) | | | (dual: pullback) | Pushout | | Empty category | Terminal object | Initial object | | Directed poset | Inverse limit | Direct limit (filtered colimit) |
The equalizer of two morphisms is the limit of the diagram . It is an object with such that , universal with this property.
In : .
A filtered colimit is a colimit over a filtered category (every finite diagram in has a cocone). Filtered colimits commute with finite limits in and in module categories.
Examples
When is discrete with objects , a diagram is a family of objects , a cone is a family of maps from a single object to each , and the limit is the product .
In , the equalizer of is the kernel of : .
The inverse limit (over the system ) is the -adic integers . This is a filtered inverse limit in .
The direct limit over the inclusions gives the group . More generally, every module is a filtered colimit of its finitely generated submodules.
The coequalizer of in is the quotient where is the equivalence relation generated by for all .
In , the coequalizer of is the quotient where is the normal subgroup generated by .
For a sheaf on a topological space , the stalk at is the filtered colimit over all open neighborhoods of .
In the functor category , limits are computed pointwise: if has all limits of shape , then for each . This is why presheaf categories have all limits and colimits.
The limit can be described as the equalizer of two maps between products: . This gives the construction of limits via products and equalizers.
The profinite completion of a group is the inverse limit . The profinite completion of is .
Any group is a filtered colimit of its finitely generated subgroups. Any -module is a filtered colimit of its finitely generated submodules. Any ring is a filtered colimit of its finitely generated subrings.
In , limits are formed by taking the limit of the underlying sets (computed in ) and equipping it with the initial topology (coarsest making all projections continuous). Colimits use the final topology.
Complete and Cocomplete Categories
A category is complete if it has all small limits (limits over all small index categories). It is cocomplete if it has all small colimits.
A category is complete if and only if it has all products and all equalizers. Dually, is cocomplete if and only if it has all coproducts and all coequalizers.
The categories , , , , , and (when is complete/cocomplete) are all complete and cocomplete.
Right adjoint functors preserve all limits, and left adjoints preserve all colimits. This is the RAPL theorem (Right Adjoints Preserve Limits). Conversely, the Freyd adjoint functor theorem gives conditions under which a limit-preserving functor must have a left adjoint.