nLab
co-Yoneda lemma

Contents

Idea

The co-Yoneda lemma is a statement which is related by duality to the Yoneda lemma.

Definition

Recall that the Yoneda lemma says that for C a V-enriched category, F:C opV a V-valued presheaf on C and cC an object of C, there is a natural isomorphism in V

[C op,V](C(,c),F)F(c).[C^{op},V](C(-,c), F) \simeq F(c) \,.

Using the definition of the enriched functor category on the left in terms of an end, this reads

cCV(C(c,c),F(c))F(c).\int_{c' \in C} V(C(c',c), F(c')) \simeq F(c) \,.

In this form the Yoneda lemma is also referred to as Yoneda reduction.

Under abstract duality an end turns into a coend, so a co-Yoneda lemma ought to be a similarly fundamental expression for F(c) in terms of a coend.

The natural candidate is the statement that every presheaf is a colimit of representables which may be stated as

F(c) cCC(c,c)F(c)F(c) \simeq \int^{c' \in C} C(c,c')\otimes F(c')

hence

F() cCY(c)F(c),F(-) \simeq \int^{c' \in C} Y(c')\otimes F(c') \,,

where Y denotes the Yoneda embedding. In module language (…I forget which entry gives the discussion of this…) this reads

F(c)C(c,) CF.F(c) \simeq C(c,-)\otimes_C F \,.

This statement we call the co-Yoneda lemma.

Yet another way to state this is as a colimit over the comma category (Y,F), for Y the Yoneda embedding:

Fcolim (UF)(Y,F)Y(U).F \simeq colim_{(U \to F) \in (Y,F)} Y(U) \,.

Urs: what is, generally, a good elegant way to see the relation between the expression of Kan extension in terms of (co)ends and in terms of (co)limits over comma categories. Currently at Kan extension only the latter formula is discussed.

Mike: With tongue in cheek, I would say that there isn’t any elegant way to see it, because it’s not an elegant statement: it doesn’t have any enriched analogue. But it is an instance of the general fact that W-weighted colimits for any Set-weight W:DSet can be computed as ‘unweighted’ colimits over the category of elements of W (see section 3.4 of Kelly’s book).

Proof of co-Yoneda lemma

Proof

To show that a presheaf F:C opSet is canonically presented as a colimit of representables, we exhibit a natural isomorphism

c:CF(c)×hom C(,c)F\int^{c: C} F(c) \times \hom_C(-, c) \cong F

By the definition of coend, maps cF(c)×hom C(,c)G() are in natural bijection with families of maps F(c)×hom C(d,c)G(d) extranatural in c and natural in d. Those are in natural bijection with families of maps F(c)hom(hom C(d,c),G(d)) natural in c and extranatural in d. These are in natural bijection with families of maps F(c)Nat(hom C(,c),G)G(c) (natural in c), where the isomorphism is by the Yoneda lemma. Thus we have exhibited a natural isomorphism

Nat( cF(c)×hom C(,c),G)Nat(F,G)Nat(\int^c F(c) \times \hom_C(-, c), G) \cong Nat(F, G)

(natural in G). By Yoneda again, this gives cF(c)×hom C(,c)F.

If one follows the Yoneda-lemma argument at the end, one arrives at the explicit isomorphism

cF(c)×hom C(,c)F\int^c F(c) \times \hom_C(-, c) \to F

Namely, it corresponds to the family of maps

F(c)×hom C(d,c)F(d)F(c) \times \hom_C(d, c) \to F(d)

(extranatural in c and natural in d) which in turn corresponds to the natural family

hom C(d,c)hom(F(c),F(d))\hom_C(d, c) \to \hom(F(c), F(d))

associated with the structure of the functor F:C opSet.

MacLane’s co-Yoneda lemma

In a brief uncommented exercise on p. 62 of

the following statement, which is atrributed to Kan, is called the co-Yoneda lemma.

For D a category, Set the category of sets, K:DSet a functor, let (*K) be the comma category of elements xKd, let Π:(*K)D be the projection (xKd)d and let for each aD the functor Δ a:(*K)D be the diagonal functor sending everything to the constant value a.

The co-Yoneda lemma in the sense of Kan/MacLane is the statement that there is a natural isomorphism of functor categories

[D,Set](K,D(a,))[(*K),D](Δ a,Π).[D,Set](K, D(a, -)) \cong [(*\darr K), D](\Delta_a, \Pi).

Proof of the MacLane version of co-Yoneda

outline of an explicit proof

A natural transformation ϕ:KD(a,) assigns to each element xKc an element ϕ c(x)D(a,c), i.e., an arrow ϕ c(x):ac. We define a corresponding transformation ψ:Δ aΠ which assigns to each object (c,xKc) in (*K) the morphism ϕ c(x):ac=Π(c,x). It is easy to check that the naturality condition on ϕ corresponds to the naturality condition on ψ, and that the correspondence is bijective.

a conceptual proof in terms of comma categories

Set classifies discrete fibrations, in the sense that a functor G:DSet classifies the discrete fibration

Q:Π G:El(G)DQ : \Pi_G : El(G) \to D

and natural transformations α:GF correspond to maps of fibrations

El(G)El(f)El(G) \to El(f)

i.e. functor which commute on the nose with the projections Π G, Π F to the base category D).

This applies in particular to F=hom(a,). Notice the category of elements El(hom(a,)) is the co-slice (aD), with its usual projection Π to D.

However, the comma category (aD) is the “lax pullback” (really, the comma object, the discussion at 2-limit) appearing in

(aD) Π D Id * a D\array{ (a \downarrow D) &\stackrel{\Pi}{\to}& D \\ \downarrow &\Uparrow& \downarrow^{Id} \\ * &\stackrel{a}{\to}& D }

and so a fibration map El(G)(aD) corresponds exactly to a lax square

El(G) Π G D Id * a D.\array{ El(G) &\stackrel{\Pi_G}{\to}& D \\ \downarrow &\Uparrow& \downarrow^{Id} \\ * &\stackrel{a}{\to}& D } \,.

This yields the co-Yoneda lemma in the sense of MacLane’s exercise.

References

The coYoneda lemma appears as a brief uncommented exercise on p. 63 of

where it is atributed to Kan.

A blog discussion which led to the creation of this entry is here.