nLab
presheaf

Contents

Definition

A presheaf on a category C is nothing but a functor

F:C opSetF : C^{op} \to Set

where C op is the opposite category of C. More generally, given any category S, an S-valued presheaf on C is a functor

C opSC^{op} \to S

The category of presheaves on C, usually denoted Set C op or [C op,Set], but often abbreviated as Ĉ, has:

As such, it is an example of a functor category.

Remarks

  • There are certain special contexts in which one calls functors F:C opS ‘presheaves’ instead of just functors, namely:

    • when S=Set, and especially one is interested in the Yoneda embedding of a category C into its presheaf category [C op,Set] for purposes of studying, for instance, limits, colimits, ind-objects, and pro-objects of C;

    • or when there is the structure of a site on C, such that it makes sense to ask if a given presheaf is actually a sheaf.

  • One generally useful way to think of presheaves is in the sense of space and quantity.

  • In the case where S=Set and C is small, an important general principle is that the presheaf category [C op,Set] is the free cocompletion of C. Intuitively, it is formed by taking C and ‘freely throwing in small colimits’. The category C is contained in [C op,Set] via the Yoneda embedding

    Y:C[C op,Set]Y : C \to [C^{op},Set]

    The Yoneda embedding sends each object cC to the presheaf

    F()=hom(,c)F(-) = hom(-, c)

    Presheaves of this form, or isomorphic to those of this form, are called representable; among their properties, representable presheaves always turn colimits into limits, in the sense that a representable functor from C op to Set turns colimits in C (i.e., limits in C op) into limits in Set (i.e., colimits in Set op). In general, such continuity is a necessary but not sufficient criterion for representability; however, nicely enough, it is sufficient when C itself is a presheaf category. To see this, suppose K is such a presheaf on C=[D op,Set], and let G=KY, a presheaf on D. By the Yoneda lemma, we have a natural isomorphism between [D op,Set](Y(),G) and KY(). But by the free cocompletion property of the Yoneda embedding, a colimit-preserving functor on presheaves is entirely determined by its precomposition with Y; accordingly, our isomorphism must extend to an identification of [C op,Set](,G) with K(), thus establishing the representability of K.

Properties of presheaves

Any category of presheaves is complete and cocomplete, with both limits and colimits being computed pointwise. That is, to compute the limit or colimit of a diagram F:DSet C op, we think of it as a functor F:D×C opSet and take the limit or colimit in the D variable.

Every presheaf is a colimit of representable presheaves.

An elegant way to express this for any preaheaf F:C opSet is as the coend identity

F()= cCF(c)×hom C(,c)F(-) = \int^{c \in C} F(c) \times hom_C(-,c)

using Yoneda reduction.

Another way to express the same is as follows: let Y:C[C op,Set] be the Yoneda embedding and let C F be the corresponding comma category

C F:={Y(V) Y(f) Y(V) f f F}C_F := \left\lbrace \array{ Y(V) &&\stackrel{Y(f)}{\to}&& Y(V') \\ & {}_f\searrow && \swarrow_{f'} \\ && F } \right\rbrace

and let p:C FC the canonical functor. Then

Fcolim (Y(V)F)C F(Yp).F \simeq colim_{(Y(V) \to F) \in C_F} (Y\circ p) \,.

To see this notice that for every B[C op,Set] and using the property of the Hom we have

Hom [C op,Set](colim (Y(V)F)C F(Yp),B) lim (Y(V)F)C FHom [C op,Set](Y(V),B) lim (Y(V)F)C FB(V)\begin{aligned} Hom_{[C^{op}, Set]}(colim_{(Y(V) \to F) \in C_F} (Y\circ p),B) &\simeq lim_{(Y(V) \to F) \in C_F} Hom_{[C^{op}, Set]}(Y(V),B) \\ & \simeq lim_{(Y(V) \to F) \in C_F} B(V) \end{aligned}

by the Yoneda lemma. But the last term is seen by inspection to be equivalent to

Hom [C op,Set](F,G).\cdots \simeq Hom_{[C^{op}, Set]}(F,G) \,.

Since this holds for all B, the claim follows, again using Yoneda.