The goal of this short note is to show how to compute the limit or colimit of a diagram of presheaves, and prove that every presheaf can be written as the colimit of representable presheaves, a result known as the density theorem.
Limits and colimits of presheaves
Let I and D be categories. Recall that a limit cone of a diagram F∈[I,D] is the same thing as a universal morphism from the diagonal functor
Δ:D→[I,D];Y⟼Δ(i↦Y)
to F. If a limit exists for each diagram, then they may be assembled into a right adjoint limID:[I,D]→D to Δ. This functor takes a diagram to the apex of its limiting cone in a functorial way. The rest of the cone can be recovered from the counit ϵ of the adjunction Δ⊣limI: for each diagram F, its limiting cone is (limIF,ϵF). We call such a functor a limit functor, which is unique up to natural isomorphism if it exists.
To compute the limit or colimit of a diagram of presheaves, we make use the fact that a diagram of presheaves is equivalent to a presheaf of diagrams, and then compute limits objectwise. This equivalence is a consequence of general fact related to currying, which we state without proof.
Proposition. Let A,B,C be categories. Then there exists an isomorphism of categories
[A,[B,C]]swapA,B[B,[A,C]]
given by [swapA,BF](Y)(X)=F(X)(Y) for all X∈A and Y∈B.
Using this isomorphism, limits and colimits of diagrams of presheaves may be computed as follows.
Theorem. Let C be a category. The category of presheaves [Cop,Set] is complete, and for every small category I, the limit functor is given by
limI[Cop,Set]F=(limISet)∗F
where F=swapI,CopF.
Proof. It suffices to show that limI[Cop,Set] is the right adjoint to the diagonal functor Δ′:[Cop,Set]→[I,[Cop,Set]]. Since Δ′=Δ∗∘swap−1, an adjunction exists if and only if Δ∗⊣(limISet)∗. Now, there exists a natural isomorphism
Θ:Hom[I,Set](Δ[−],−)⟶≅HomSet(−,limISet[−])
via the adjunction Δ⊣limISet, which may be used to construct isomorphisms
It follows that there is an adjunction Δ′⊣limI[Cop,Set].
■
The exact same argument may be carried out for colimits. As such, we state the analogous dual result without proof.
Theorem. Let C be a category. The category of presheaves [Cop,Set] is cocomplete, and for every small category I, the colimit functor is given by
colimI[Cop,Set]F=(colimISet)∗F
where F=swapI,CopF.
Proof. Use the adjunction colimISet⊣Δ to show that (colimISet)∗⊣Δ∗.
■
The density theorem
Let C be a category and let F:Cop→Set be a presheaf of sets on C. The Yoneda lemma implies that there exists an isomorphism of presheaves
Hom[Cop,Set](よ[−],F)≅F,
where よ:C→[Cop,Set] is the Yoneda embedding. In particular, morphisms from よ to F correspond to sections of F. As such, we call the comma category (よ↓F) the category of elements of F, which we also denote by ∫CF. The category of elements comes equipped with a canonical projection
π:∫CF→C;(X,ϕ:よ(X)→F)⟼πX
which may be interpreted as taking a section down to the object it lies over. Roughly speaking, the density theorem states that every presheaf F can be recovered as a colimit over ∫CF of presheaves represented by these projections.
Theorem. Let C be a category and F:Cop→Set be a presheaf of sets. Then there exists a presheaf isomorphism
F≅∫CFcolim(よ∘π),
where π:∫CF→C is the canonical projection map.
Proof. For each (X,ϕ)∈∫CF, let ρX,ϕ=ϕ; we show that (F,ρ) is a universal cocone under よ∘π. By the Yoneda lemma, there exists a natural isomorphism of profunctors
Θ:Hom[Cop,Set](よ[−],−)≅⟨−,−⟩,
where ⟨−,−⟩:Cop×[Cop,Set]→Set is the canonical pairing. A cocone (G,σ) under よ∘π defines, for X∈C, a map
By definition, a presheaf morphism ψ:F→G which induces a morphism of cocones must satisfy Hom(よ(X),ψ)=σX. Since Θ is natural, the diagram
commutes, which determines each component of ψ, since ψX is just the pushforward ⟨X,ψ⟩. It follows that
ψX=ΘX,G−1∘σX∘ΘX,F.(⋆)
It remains to show that such a presheaf morphism ψ exists. Note that a morphism f:Y→X in C induces a morphism f:(Y,ϕ∘よ(f))→(X,ϕ) in the comma category, which implies
σY(ϕ∘よ(f))=σX(ϕ)∘よ(f)
as (G,σ) is a cocone under よ∘π. It follows that σ is natural when viewed as a map Hom(よ[−],F)→Hom(よ[−],G). Furthermore, Θ is already natural in the first argument, so the formula (⋆) indeed defines a morphism of presheaves.