nLab preserved limit

Preservation of limits

Preservation of limits

Idea

If J:ICJ\colon I \to C is a diagram and xx is a limit of it in CC, then we may naïvely say that this limit is preserved by a functor F:CDF\colon C \to D if F(x)F(x) is a limit of the composite diagram IJCFDI \overset{J}\to C \overset{F}\to D. However, it is not enough to state this at the level of objects; we also need to impose some coherence conditions, preserving the entire universal cone. Furthermore, we can use a trick involving the Yoneda embedding to get a meaningful condition even if JJ has no limit in CC at all.

Definitions

Definition

Let F:CDF\colon C \to D be a functor, J:ICJ\colon I \to C a diagram, and η:const x IJ\eta \colon const^I_x \to J be a cone over JJ. Suppose (x,η)(x, \eta) is a limit for JJ. The functor FF preserves this limit if (F(x),Fη)(F(x), F \cdot \eta) is a limit of FJF \circ J.

Here, Fη:const F(x) IFJF\cdot\eta\colon \const^I_{F(x)} \to F \circ J is a whiskering.

Dually, FF preserves a colimit of JJ if F op:C opD opF^\op\colon C^\op \to D^\op preserves it as a limit of J op:I opC opJ^\op\colon I^\op \to C^\op.

For instance:

  • Let II be the empty category, so that a limit of the unique functor J:ICJ\colon I \to C is a terminal object 11. Then FF preserves this terminal object if and only if F(1)F(1) is a terminal object of DD.

  • Let II be the discrete category 2\mathbf{2}, so that JJ picks out two objects aa and bb of CC and the limit of JJ is a product a×ba \times b of aa and bb. Note that this product comes equipped with product projections π:a×ba\pi\colon a \times b \to a and ρ:a×bb\rho\colon a \times b \to b. Then FF preserves this product if and only if F(a×b)F(a \times b) is a product of F(a)F(a) and F(b)F(b) and furthermore the product projections are F(π)F(\pi) and F(ρ)F(\rho).

Definition

If FF preserves all limits/colimits for a specified diagram J:ICJ\colon I \to C, we say that FF preserves limits of JJ.

If FF preserves all limits or colimits of a given type (i.e. over a given category II), we simply say that FF preserves that sort of limit (e.g. FF preserves products, FF preserves equalizers, etc.).

Definition

A functor that preserves all small limits in CC that exist is called a continuous functor.

Usually this term is only used when CC has all small limits, i.e. is a complete category.

Properties

Proposition

If there exists at least one limit (x,η)(x, \eta) for JJ that is preserved by FF, then every limit for JJ is preserved by FF.

Proof

Any other limit (y,μ)(y, \mu) is uniquely isomorphic to (x,η)(x, \eta), and FF preserves this isomorphism (as all functors do). This implies (F(y),Fμ)(F(y), F \cdot \mu) is a limit for FJF \circ J.

Thus, for a specified diagram J:ICJ\colon I \to C, preservation of limits either holds vacuously (if JJ has no limit in CC), or holds for all limit cones over JJ.

Proposition

Suppose (x,η)(x, \eta) is a limit for JJ and (y,μ)(y, \mu) is a limit for FJF \circ J. Since (F(x),Fη)(F(x), F \cdot \eta) is a cone over FJF \circ J, there is a canonical comparision map f:F(x)yf \colon F(x) \to y with (Fη) j=μ jf(F \cdot \eta)_j = \mu_j \circ f for each jIj \in I. Then FF preserves (x,η)(x, \eta) if and only if this comparision map is an isomorphism.

Proof

FF preserves (x,η)(x, \eta) if and only if (F(x),Fη)(F(x), F \cdot \eta) is a limit for FJF \circ J. Since (y,μ)(y, \mu) is already a limit for FJF \circ J, that is if and only if (F(x),Fη)(F(x), F \cdot \eta) is isomorphic to (y,μ)(y, \mu) in the category of cones over FJF \circ J. And since (y,μ)(y, \mu) is terminal in this category, that’s if and only if the comparison map, between the unique morphism (F(x),Fη)(y,μ)(F(x), F \cdot \eta) \to (y, \mu) in the cone category, is an isomorphism.

Proposition

Let F i:CD iF_i \colon C \to D_i be a family of functors, and J:ICJ \colon I \to C a diagram. Then every F iF_i preserves limits of JJ if and only if their product F:C iD iF \colon C \to \prod_i D_i preserves limits of JJ.

Proof

We exploit limits in product categories are computed componentwise. If every F iF_i preserves a limit (x,η)(x, \eta) of JJ, then the (F i(x),F iη)(F_i(x), F_i \cdot \eta) collectively determine a limit (F(x),Fη)(F(x), F \cdot \eta), so that FF preserves this. Conversely, if FF preserves the limit, then limits being computed componentwise implies each F iF_i preserves the limit.

For the following properties, we have J:ICJ \colon I \to C a diagram, and F:CD,G:DEF \colon C \to D, G \colon D \to E functors.

Proposition

If FF preserves limits of JJ and GG preserves limits of FJF \circ J, we have that GFG \circ F preserves limits of JJ.

Proof

Take a limit (x,η)(x, \eta) for JJ. Then (F(x),Fη)(F(x), F \cdot \eta) is a limit for FJF \circ J since FF preserves this limit, and then ((GF)(x),(GF)η)((G \circ F)(x), (G \circ F) \cdot \eta) is a limit for (GF)J(G \circ F) \circ J since GG preserves this limit, as required.

Proposition

If GFG \circ F preserves limits of JJ and GG reflects limits of FJF \circ J, we have that FF preserves limits of JJ.

Proof

Take a limit (x,η)(x, \eta) for JJ. We want to show (F(x),Fη)(F(x), F \cdot \eta) is a limit for FJF \circ J. Since GG reflects limits of FJF \circ J, it suffices to show ((GF)(x),(GF)η)((G \circ F)(x), (G \circ F) \cdot \eta) is a limit for (GF)J(G \circ F) \circ J. But this follows since GFG \circ F preserves limits of JJ.

Proposition

If GFG \circ F preserves limits of JJ and FF lifts limits for JJ, we have that GG preserves limits of FJF \circ J.

Proof

Take a limit (y,μ)(y, \mu) for FJF \circ J. We want to show (G(y),Gμ)(G(y), G \cdot \mu) is a limit for (GF)J(G \circ F) \circ J. Since FF lifts limits for JJ, there is some limit cone (x,η)(x, \eta) over JJ with (F(x),Fη)(y,μ)(F(x), F \cdot \eta) \cong (y, \mu) in the category of cones over FJF \circ J. Thus, ((GF)(x),(GF)η)(G(y),Gμ)((G \circ F)(x), (G \circ F) \cdot \eta) \cong (G(y), G \cdot \mu) in the category of cones over (GF)J(G \circ F) \circ J. But the former is a limit for (GF)J(G \circ F) \circ J since GFG \circ F preserves limits of JJ, implying the latter is too.

The propositions above taken together imply the following:

  • If GG preserves and reflects limits of FJF \circ J, then FF preserves limits of JJ if and only if GFG \circ F does.
  • If FF preserves and lifts limits of JJ, then GG preserves limits of FJF \circ J if and only if GFG \circ F preserves limits of JJ.

Examples

Non-Examples

Let AA be any infinite set, and consider the constant functor Δ A:CSet\Delta_A \colon C \to Set sending every object of CC to AA, and every morphism to the identity.

Then this functor preserves binary products objectwise, since Δ A(x×y)=AA×AΔ A(x)×Δ A(y)\Delta_A(x \times y) = A \cong A \times A \cong \Delta_A(x) \times \Delta_A(y). However, it does not preserve the product of xx and yy in the sense above, since the projection maps π x:x×yx,π y:x×yy\pi_x \colon x \times y \to x, \pi_y \colon x \times y \to y get sent to identities AAA \to A, which do not form a limit cone in SetSet.

This illustrates that it is not enough to merely show that F(limJ)F(\lim J) is a limit of FJF \circ J at the level of objects - we also need that the projections get mapped to the corresponding projections.

We can also view this through the language of representable functors. Preserving limits “objectwise” means F(limJ)F(\lim J) represents the presheaf dCones(d,FJ):=Nat(Δ d,FJ)d \mapsto Cones(d, F \circ J) := Nat(\Delta_d, F \circ J) on DD, so that there is a natural isomorphism D(,F(limJ))Cones(,FJ)D(-, F(\lim J)) \cong Cones(-, F \circ J). However, for FF to preserve the limit we don’t just care that F(limJ)F(\lim J) represents this functor, but how it does - in other words, we need the corresponding universal element in Cones(F(limJ),FJ)Cones(F(\lim J), F \circ J) to be FF applied to the projections in Cones(limJ,J)Cones(\lim J, J). Given the natural isomorphism, then, we can check FF preserves the limit by following the identity F(limJ)F(limJ)F(\lim J) \to F(\lim J) and checking it maps to the correct element.

Preservation of weighted limits

Analogously, an enriched functor between enriched categories may preserve weighted limits. Are there any tricky points that we should mention?

Preservation of limits that don't exist

Sometimes we want to say that a functor F:CDF\colon C \to D preserves a limit that does not actually exist in CC. For instance, a finitely continuous functor is usually defined as one that preserves all finite limits. If CC is a finitely complete category, then this is fine; such a functor is called left exact. But what if CC does not have all finite limits?

If CC and DD are locally small, then we can use the Yoneda lemma to turn the question into one involving categories that do have the required limits (and in fact have all limits), the presheaf categories [C op,Set][C^op,Set] and [D op,Set][D^op,Set]. (For colimits, use [C,Set][C,Set] and [D,Set][D,Set]; for VV-enriched categories, use [C op,V][C^op,V] and [D op,V][D^op,V], which will work if VV is complete.)

The left Kan extension of the composite CFDYon[D op,Set]C \overset{F}\to D \overset{Yon}\hookrightarrow [D^\op,Set] along the Yoneda embedding CYon[C op,Set]C \overset{Yon}\hookrightarrow [C^\op,Set] (which always exists) is a functor from [C op,Set][C^op,Set] to [D op,Set][D^op,Set], which may be written as F- \otimes F (alluding to the bimodule nature of profunctors). A diagram J:ICJ\colon I \to C becomes a diagram IJCYon[C op,Set]I \overset{J}\to C \overset{Yon}\hookrightarrow [C^op,Set] in [C op,Set][C^op,Set], where it has a limit. If F- \otimes F preserves this limit, then we say that FF preserves the hypothetical limit of JJ.

Since the Yoneda embedding preserves and reflects all limits, if JJ has a limit in CC, then this condition is equivalent to the condition that FF preserve it in the ordinary sense, but in general it is stronger than requiring that FF preserve the limit only if it exists in CC.

Finishing the motivating example, a flat functor may be defined as one that preserves all finite limits, whether or not they exist.

References

Last revised on February 10, 2026 at 12:13:48. See the history of this page for a list of all contributions to it.