Blog Archive

Monday, April 8, 2024

Yoneda Lemmma and evaluation map.

The aim of this blog is to provide a trivial but nice example of Yoneda Lemma

The aim of this blog is to provide a trivial but nice example of Yoneda Lemma, and then we prove the Yoneda Lemma.

Let C be a locally small category, that is, ∀X,Y∈Ob(C),HomC(X,Y) is a set.

The Yoneda lemma claim that

Nat(HomC(X,−),F)≅F(X)

Let us look at a simple example. Let C be the category of set, and F be the identity functor.

Then let us consider the natural transformation betwenen HomC(X,−) and IdC.

HomC(X,A)→ηAAf∗↓↓fHomC(X,B)→ηBB

What is natural transormation here? How could you map h:X→A to A and make sure the diagram commute?

The evaluation map! Let us pick a α∈X and let ηA=ηα=ηB. Here ηα is the evaluation map at α.

f∘ηα(h)=f(h(α))=ηα(f∗(h))=ηα(f∘h)=f(h(α))

It is not hard to see the map from X to Nat(HomC(X,−),F) is injective.

To see it is surjective, let A=X and consider ηX(IdX)=α with the following diagram.

HomC(X,X)→ηXXf∗↓↓fHomC(X,A)→ηAA

The diagram tells us that:

ηA(f∗(IdX))=f(ηX(IdX))

i.e. ∀A and f:X→A, we have

ηA(f)=f(α)

Hence the map from X to Nat(HomC(X,−),F) is surjective.

That is a cute example of Yoneda Lemma.

In general, the proof of Yoneda Lemma is literally same idea.

Let F:C→Set be a functor, and considering the following diagram.

HomC(X,X)→ηXF(X)f∗↓↓F(f)HomC(X,A)→ηAF(A)

If ηX(IdX)=u. The diagram shows that for every ηA we have ηA(f∗(IdA))=ηA(f)=F(f)(u).

Hence each ηA (arrow in Set, i.e. function) is completely determined by u​.

i.e.

ηA(f)=F(f)(u)

Conversely, pick an element u∈F(X), consider an function ηX(IdX)=u​

The diagram force us to define ηA(f)=F(f)(u) for all A since

ηA(f∗(IdX))=ηA(f)=F(f)(ηX(IdX))=F(f)(u)

Then we can check that the following diagram commute.

HomC(X,A)→ηAF(A)f∗↓↓F(f)HomC(X,B)→ηBF(B)

Pick a h∈HomC(X,A),

F(f)(ηA(h))=F(f)(F(g)(u))=F(f)∘F(g)(u)=F(f∘g)(u)

Here F(g) is a function from F(X) to F(A), u∈F(X).

ηB(f∗(g))=ηB(f∘g)=F(f∘g)(u)

Hence the diagram commute.

Hence we have

Nat(HomC(X,−),F)≅F(X)◻

The SetCop case is claimed by duality.

 

No comments:

Post a Comment

Popular Posts