The co-Yoneda lemma is a statement which is related by duality to the Yoneda lemma.
Recall that the Yoneda lemma says that for a -enriched category, a -valued presheaf on and an object of , there is a natural isomorphism in
Using the definition of the enriched functor category on the left in terms of an end, this reads
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 in terms of a coend.
The natural candidate is the statement that every presheaf is a colimit of representables which may be stated as
hence
where denotes the Yoneda embedding. In module language (…I forget which entry gives the discussion of this…) this reads
This statement we call the co-Yoneda lemma.
Yet another way to state this is as a colimit over the comma category , for the Yoneda embedding:
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 -weighted colimits for any -weight can be computed as ‘unweighted’ colimits over the category of elements of (see section 3.4 of Kelly’s book).
In a brief uncommented exercise on p. 63 of
the following statement, which is atrributed to Kan, is called the co-Yoneda lemma.
For a category, Set the category of sets, a functor, let be the comma category of elements , let be the projection and let for each the functor be the diagonal functor sending everything to the constant value .
The co-Yoneda lemma in the sense of Kan/MacLane is the statement that there is a natural isomorphism of functor categories
A natural transformation assigns to each element an element , i.e., an arrow . We define a corresponding transformation which assigns to each object in the morphism . It is easy to check that the naturality condition on corresponds to the naturality condition on , and that the correspondence is bijective.
Set classifies discrete fibrations, in the sense that a functor classifies the discrete fibration
and natural transformations correspond to maps of fibrations
i.e. functor which commute on the nose with the projections , to the base category ).
This applies in particular to . Notice the category of elements is the co-slice , with its usual projection to .
However, the comma category is the “lax pullback” (really, the comma object, the discussion at 2-limit) appearing in
and so a fibration map corresponds exactly to a lax square
This yields the co-Yoneda lemma in the sense of MacLane’s exercise.
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.