Limits in Presheaf Categories

Summary

Limits (and colimits) in functor categories are computed pointwise when has the relevant limits. Applying this to : all limits and colimits exist and are pointwise. The Density Theorem says every presheaf is a colimit of representables, with the colimit shaped by the category of elements.

Overview

Presheaf categories inherit excellent limit/colimit properties from Set. The pointwise computation makes checking limits easy. The density theorem, in contrast, shows that the representables “generate” the entire presheaf category via colimits — a deep structural fact.

Main Content

Pointwise Limits in Functor Categories

Theorem 6.2.5: Limits in Functor Categories are Pointwise (BCT, Ch. 6.2)

Let have all limits of shape , and let be a diagram of functors. Then:

  1. has limits of shape .
  2. The limit is computed pointwise: for each .

Consequence for presheaf categories: Since Set is complete and cocomplete, is complete and cocomplete, with all limits and colimits computed pointwise:

Example: Product of Presheaves (BCT, Ch. 6.2)

For presheaves , their product is .

Limits Commute with Limits

Proposition 6.2.8: Limits Commute (BCT, Ch. 6.2)

For a diagram (when all relevant limits exist):

This generalises the commutativity of products and intersections in set theory.

Yoneda Embedding Preserves Limits

Corollary 6.2.12: Yoneda Preserves Limits (BCT, Ch. 6.2)

The Yoneda embedding preserves all small limits.

Proof: By Proposition 6.2.2, each preserves limits (as a right adjoint in the representable sense). Since the limit in is pointwise, .

Category of Elements

Definition 6.2.16: Category of Elements

For a functor , the category of elements (also written or ) has:

  • Objects: pairs where and
  • Morphisms : maps in such that

There is a forgetful functor , .

Density Theorem

Theorem 6.2.17: Density Theorem (BCT, Ch. 6.2)

For any small and any presheaf :

i.e., is the colimit of the diagram .

Interpretation: Every presheaf is “built from” representable presheaves via colimits. The category of elements encodes exactly how to assemble from representables.

Analogy: A set is a colimit of one-element sets; a presheaf is a colimit of representables (which are the “one-element sets” of the presheaf world).

Example: Density for Representables

When , the category of elements has objects — i.e., maps into . The density colimit is , which is a Yoneda-type statement.

Connections

See Also