ConceptComplete

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

Definition2.9Diagram

A diagram of shape J\mathcal{J} in a category C\mathcal{C} is a functor D:J→CD : \mathcal{J} \to \mathcal{C}, where J\mathcal{J} is a small category called the index category or shape.

Definition2.10Cone

A cone over a diagram D:J→CD : \mathcal{J} \to \mathcal{C} with apex NN is a natural transformation from the constant functor cN:J→Cc_N : \mathcal{J} \to \mathcal{C} (sending everything to NN) to DD. Explicitly, it is a family of morphisms

Ξ»j:Nβ†’D(j)forΒ eachΒ j∈J\lambda_j : N \to D(j) \qquad \text{for each } j \in \mathcal{J}

such that for every morphism u:jβ†’jβ€²u : j \to j' in J\mathcal{J}, we have D(u)∘λj=Ξ»jβ€²D(u) \circ \lambda_j = \lambda_{j'}.

Definition2.11Limit

A limit of D:Jβ†’CD : \mathcal{J} \to \mathcal{C} is a cone (lim←⁑D,{Ο€j})(\varprojlim D, \{\pi_j\}) that is universal (terminal) among all cones: for every cone (N,{Ξ»j})(N, \{\lambda_j\}), there exists a unique morphism h:Nβ†’lim←⁑Dh : N \to \varprojlim D such that Ο€j∘h=Ξ»j\pi_j \circ h = \lambda_j for all jj.

We write lim←⁑D\varprojlim D or lim⁑←D\lim_{\leftarrow} D for the limit object.

Definition2.12Colimit

Dually, a colimit of D:Jβ†’CD : \mathcal{J} \to \mathcal{C} is a universal cocone (lim→⁑D,{ΞΉj})(\varinjlim D, \{\iota_j\}): a cocone that is initial among all cocones. For every cocone (N,{Ξ»j})(N, \{\lambda_j\}), there exists a unique morphism h:lim→⁑Dβ†’Nh : \varinjlim D \to N with h∘ιj=Ξ»jh \circ \iota_j = \lambda_j.


Special Cases

RemarkTaxonomy of limits

Different shapes J\mathcal{J} give different constructions:

| Shape J\mathcal{J} | Limit | Colimit | |---|---|---| | Discrete (no non-identity morphisms) | Product ∏\prod | Coproduct ⨆\bigsqcup | | βˆ™β‡‰βˆ™\bullet \rightrightarrows \bullet | Equalizer | Coequalizer | | βˆ™β†’βˆ™β†βˆ™\bullet \to \bullet \leftarrow \bullet | Pullback | (dual: pushout) | | βˆ™β†βˆ™β†’βˆ™\bullet \leftarrow \bullet \to \bullet | (dual: pullback) | Pushout | | Empty category | Terminal object | Initial object | | Directed poset | Inverse limit | Direct limit (filtered colimit) |

Definition2.13Equalizer

The equalizer of two morphisms f,g:A⇉Bf, g : A \rightrightarrows B is the limit of the diagram A⇉BA \rightrightarrows B. It is an object EE with e:Eβ†’Ae : E \to A such that f∘e=g∘ef \circ e = g \circ e, universal with this property.

In Set\mathbf{Set}: eq(f,g)={a∈A:f(a)=g(a)}\mathrm{eq}(f,g) = \{a \in A : f(a) = g(a)\}.

Definition2.14Filtered Colimit

A filtered colimit is a colimit over a filtered category J\mathcal{J} (every finite diagram in J\mathcal{J} has a cocone). Filtered colimits commute with finite limits in Set\mathbf{Set} and in module categories.


Examples

ExampleLimit over a discrete category

When J\mathcal{J} is discrete with objects {1,…,n}\{1, \ldots, n\}, a diagram is a family of objects A1,…,AnA_1, \ldots, A_n, a cone is a family of maps from a single object to each AiA_i, and the limit is the product A1Γ—β‹―Γ—AnA_1 \times \cdots \times A_n.

ExampleEqualizer in Ab

In Ab\mathbf{Ab}, the equalizer of f,g:Aβ†’Bf, g : A \to B is the kernel of fβˆ’gf - g: eq(f,g)=ker⁑(fβˆ’g)={a∈A:f(a)=g(a)}\mathrm{eq}(f,g) = \ker(f - g) = \{a \in A : f(a) = g(a)\}.

ExampleInverse limit of Z/p^n Z

The inverse limit lim←⁑Z/pnZ\varprojlim \mathbb{Z}/p^n\mathbb{Z} (over the system β‹―β†’Z/p3Zβ†’Z/p2Zβ†’Z/pZ\cdots \to \mathbb{Z}/p^3\mathbb{Z} \to \mathbb{Z}/p^2\mathbb{Z} \to \mathbb{Z}/p\mathbb{Z}) is the pp-adic integers Zp\mathbb{Z}_p. This is a filtered inverse limit in Ring\mathbf{Ring}.

ExampleDirect limit (filtered colimit)

The direct limit lim→⁑Z/n!Z\varinjlim \mathbb{Z}/n!\mathbb{Z} over the inclusions gives the group Q/Z\mathbb{Q}/\mathbb{Z}. More generally, every module is a filtered colimit of its finitely generated submodules.

ExampleCoequalizer in Set

The coequalizer of f,g:A⇉Bf, g : A \rightrightarrows B in Set\mathbf{Set} is the quotient B/∼B / {\sim} where ∼\sim is the equivalence relation generated by f(a)∼g(a)f(a) \sim g(a) for all a∈Aa \in A.

ExampleCoequalizer in Grp gives quotient

In Grp\mathbf{Grp}, the coequalizer of f,g:H⇉Gf, g : H \rightrightarrows G is the quotient G/NG / N where NN is the normal subgroup generated by {f(h)β‹…g(h)βˆ’1:h∈H}\{f(h) \cdot g(h)^{-1} : h \in H\}.

ExampleStalks as filtered colimits

For a sheaf F\mathcal{F} on a topological space XX, the stalk at x∈Xx \in X is the filtered colimit Fx=lim→⁑Uβˆ‹xF(U)\mathcal{F}_x = \varinjlim_{U \ni x} \mathcal{F}(U) over all open neighborhoods of xx.

ExampleLimit in a functor category

In the functor category [C,D][\mathcal{C}, \mathcal{D}], limits are computed pointwise: if D\mathcal{D} has all limits of shape J\mathcal{J}, then (lim←⁑Fi)(A)=lim←⁑Fi(A)(\varprojlim F_i)(A) = \varprojlim F_i(A) for each A∈CA \in \mathcal{C}. This is why presheaf categories [Cop,Set][\mathcal{C}^{\mathrm{op}}, \mathbf{Set}] have all limits and colimits.

ExampleLimit as a section of a projection

The limit lim←⁑D\varprojlim D can be described as the equalizer of two maps between products: lim←⁑D=eq(∏jD(j)β‡‰βˆu:jβ†’jβ€²D(jβ€²))\varprojlim D = \mathrm{eq}\left(\prod_{j} D(j) \rightrightarrows \prod_{u : j \to j'} D(j')\right). This gives the construction of limits via products and equalizers.

ExampleProfinite completion

The profinite completion G^\hat{G} of a group GG is the inverse limit G^=lim←⁑N⊴G, [G:N]<∞G/N\hat{G} = \varprojlim_{N \trianglelefteq G,\, [G:N] < \infty} G/N. The profinite completion of Z\mathbb{Z} is Z^=∏pZp\hat{\mathbb{Z}} = \prod_p \mathbb{Z}_p.

ExampleColimits and quotients

Any group GG is a filtered colimit of its finitely generated subgroups. Any RR-module is a filtered colimit of its finitely generated submodules. Any ring is a filtered colimit of its finitely generated subrings.

ExampleLimits in the category of topological spaces

In Top\mathbf{Top}, limits are formed by taking the limit of the underlying sets (computed in Set\mathbf{Set}) and equipping it with the initial topology (coarsest making all projections continuous). Colimits use the final topology.


Complete and Cocomplete Categories

Definition2.15Complete and Cocomplete

A category C\mathcal{C} is complete if it has all small limits (limits over all small index categories). It is cocomplete if it has all small colimits.

Theorem2.5Completeness criterion

A category C\mathcal{C} is complete if and only if it has all products and all equalizers. Dually, C\mathcal{C} is cocomplete if and only if it has all coproducts and all coequalizers.

ExampleComplete and cocomplete categories

The categories Set\mathbf{Set}, Grp\mathbf{Grp}, Ab\mathbf{Ab}, R-ModR\text{-}\mathbf{Mod}, Top\mathbf{Top}, and [C,D][\mathcal{C}, \mathcal{D}] (when D\mathcal{D} is complete/cocomplete) are all complete and cocomplete.

RemarkLimits and adjunctions

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.