Colimit

A universal cocone from a diagram, generalizing coproducts, pushouts, and coequalizers.
Colimit

Definition

Let C\mathcal{C} be a and let JJ be an indexing category. A diagram of shape JJ in C\mathcal{C} is a

D:JC. D:J\to \mathcal{C}.

A cocone from DD consists of an object CC of C\mathcal{C} together with morphisms

κj:D(j)C(jOb(J)) \kappa_j: D(j) \to C\quad (j\in \mathrm{Ob}(J))

such that for every morphism α:jk\alpha:j\to k in JJ,

κkD(α)=κj \kappa_k\circ D(\alpha) = \kappa_j

(using ).

A colimit of DD is a cocone (colimD,κj)(\mathrm{colim}\,D,\kappa_j) such that for every other cocone (N,νj)(N,\nu_j) from DD, there exists a unique morphism m:colimDNm:\mathrm{colim}\,D \to N with

mκj=νjfor all j. m\circ \kappa_j = \nu_j\quad\text{for all }j.

One writes colimD\mathrm{colim}\,D (or limD\varinjlim D). If a colimit exists, it is unique up to unique .

Relationship to other constructions

  • The dual notion is the .
  • Equivalently, colimCD\mathrm{colim}_{\mathcal{C}} D is limCopDop\lim_{\mathcal{C}^{op}} D^{op} in the .

Examples

Example (Coproduct)

If JJ is the discrete category on two objects and DD picks out objects XX and YY, then colimD\mathrm{colim}\,D is the X⨿YX\amalg Y.

In Set\mathbf{Set}, this is the disjoint union of sets.

Example (Coequalizer)

If JJ is the “parallel pair” shape ABA \rightrightarrows B, then colimD\mathrm{colim}\,D is the of the two morphisms.

In Set\mathbf{Set}, this is a quotient B/B/{\sim} identifying f(a)g(a)f(a)\sim g(a).

Example (Pushout)

If JJ is the span shape XZYX \leftarrow Z \rightarrow Y, then colimD\mathrm{colim}\,D is the X⨿ZYX\amalg_Z Y.

In Top\mathbf{Top}, this is the usual gluing construction obtained as a quotient of X⨿YX\amalg Y by identifying f(z)f(z) with g(z)g(z).