Category Theory
Zulip Server
Archive

You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.


Stream: learning: questions

Topic: preliminaries to Yoneda Lemma


view this post on Zulip Eduard BABKIN (Sep 29 2020 at 05:48):

Consequent reflection upon the Yoneda lemma moved me to the following case and a basic question:

Given a discrete category CC with a single object aa and a single morphism idaid_a, we can define two functors F, G, both CSetC \rightarrow Set.
Now imagine, that F maps the object aa to a set with mm elements, while G maps aa to the set with nn elements.
Let's consider natural transformation between F and G. its single component αa\alpha_a is a morphism in Set between the images of F and G correspondingly (Fa ->Ga ). Any morphism in Set category is a function between sets. So, in principle we are able to define nmn^m different mappings between the image of F and the image of G.

And now the question: what is the correct choice: (1) the single component αa\alpha_a denotes a whole set of defined mappings Fa->Ga or (2) actually
there is a plenty of components of natural transformation, and each of them corresponds to one particular mapping ?

view this post on Zulip Morgan Rogers (he/him) (Sep 29 2020 at 08:49):

There are actually nmn^m natural transformations between the functors you describe. Each of the possible functions describes a valid natural transformation, because the naturality condition is trivial.

view this post on Zulip Morgan Rogers (he/him) (Sep 29 2020 at 08:51):

However, the Yoneda lemma refers to representable functors. In this case, the representable functor y(a):C=CopSety(a):C=C^{\mathrm{op}} \to \mathbf{Set} sends the unique object of CC to the 11-element set. And indeed, you'll notice that if GG is as you describe, there are exactly n=G(a)n = |G(a)| natural transformations from y(a)y(a) to GG.

view this post on Zulip Eduard BABKIN (Sep 30 2020 at 07:07):

[Mod] Morgan Rogers said:

There are actually nmn^m natural transformations between the functors you describe. Each of the possible functions describes a valid natural transformation, because the naturality condition is trivial.

Thank you for clarification, Morgan

In that case I have a technical question: how we can denote each component of natural transformation ?
Because we have a discrete category with a single element aa, could each component be named as αai \alpha_{a_i} , where i i runs from 1 to nmn^m ?

Or for that case we can say, that the set of components contains sets as elements, so, we have a singleton set of the components of natural transformation (αa \alpha_a ), but the element of that set is the set itself (with nm n^m elements -- all possible functions) ?

view this post on Zulip Eduard BABKIN (Sep 30 2020 at 07:47):

[Mod] Morgan Rogers said:

However, the Yoneda lemma refers to representable functors. In this case, the representable functor y(a):C=CopSety(a):C=C^{\mathrm{op}} \to \mathbf{Set} sends the unique object of CC to the 11-element set. And indeed, you'll notice that if GG is as you describe, there are exactly n=G(a)n = |G(a)| natural transformations from y(a)y(a) to GG.

Am I right that when you speak about the representable functor in the context of Yoneda Lemma, You actually mean only the functor yy, while the functor GG can be not representable ?

Now after preliminaries I can come closer the main subject -- the confusion about Yoneda lemma:
For the main case I wish to use the category 2 ( objects: aa and bb, morphism f:abf : a \rightarrow b) and a covariant type of Yoneda lemma Nat(Hom(a,),G)Ga Nat(Hom(a,-), G) \sim Ga , G:2SetG : 2 \rightarrow Set .
Let define a simple case of functor GG when it sends aa to one singleton set in SetSet, and bb to another singleton set.

if I'm not mistaken, the Hom-functor Hom(a,) Hom(a,-) sends aa from category 2 to a singleton set (Hom(a,a) Hom(a,a) ), while bb is also sent to another singleton set (Hom(a,b) Hom(a,b) ). For such a trivial case we can determine two components of natural transformation between Hom(a,) Hom(a,-) and G G :
αa \alpha_a and αb \alpha_b correspondingly. These components are simple functions on sets.

Now I recall that Yoneda lemma says about bijection between the set of components of natural transformation (Nat(..)Nat(..)) and the GaGa (also the set).
However the set of the components contains 2 elements (αa\alpha_a and αb\alpha_b ), while GaGa has only one element in the set.
That is a point of my confusion.

Where is a flaw in the speculations above ?

view this post on Zulip Morgan Rogers (he/him) (Sep 30 2020 at 08:50):

Eduard BABKIN said:

I have a technical question: how we can denote each component of natural transformation ?
Because we have a discrete category with a single element aa, could each component be named as αai \alpha_{a_i} , where i i runs from 1 to nmn^m ?

Or for that case we can say, that the set of components contains sets as elements, so, we have a singleton set of the components of natural transformation (αa \alpha_a ), but the element of that set is the set itself (with nm n^m elements -- all possible functions) ?

Hmm it seems there is some confusion about the data of natural transformations here.
Given functors F,G:CDF,G: \mathcal{C} \to \mathcal{D}, a natural transformation α\alpha from FF to GG consists of a morphism αA:F(A)G(A)\alpha_A: F(A) \to G(A) for each object of C\mathcal{C}, subject to a naturality condition for each morphism of C\mathcal{C}. In your example, C\mathcal{C} has just one object, so a natural transformation consists of a single morphism.

As we have seen, there may be many (distinct!) natural transformations between a pair of functors, but they are separate, not all part of the same transformation.

view this post on Zulip Morgan Rogers (he/him) (Sep 30 2020 at 08:58):

Eduard BABKIN said:

Now I recall that Yoneda lemma says about bijection between the set of components of natural transformation (Nat(..)Nat(..)) and the GaGa (also the set).
However the set of the components contains 2 elements (αa\alpha_a and αb\alpha_b ), while GaGa has only one element in the set.
That is a point of my confusion.

Where is a flaw in the speculations above ?

The same confusion is happening here. Yoneda talks about natural transformations, not their components.
Here there is exactly one natural transformation Hom(a,)G\mathrm{Hom}(a,-) \to G, and its components are the ones you identify, the unique functions between these one-element sets. And indeed, we see that the Yoneda lemma is verified: G(a)G(a) has exactly one element.

view this post on Zulip Eduard BABKIN (Sep 30 2020 at 11:02):

[Mod] Morgan Rogers said:

Eduard BABKIN said:

I have a technical question: how we can denote each component of natural transformation ?
Because we have a discrete category with a single element aa, could each component be named as αai \alpha_{a_i} , where i i runs from 1 to nmn^m ?

Or for that case we can say, that the set of components contains sets as elements, so, we have a singleton set of the components of natural transformation (αa \alpha_a ), but the element of that set is the set itself (with nm n^m elements -- all possible functions) ?

Hmm it seems there is some confusion about the data of natural transformations here.
Given functors F,G:CDF,G: \mathcal{C} \to \mathcal{D}, a natural transformation α\alpha from FF to GG consists of a morphism αA:F(A)G(A)\alpha_A: F(A) \to G(A) for each object of C\mathcal{C}, subject to a naturality condition for each morphism of C\mathcal{C}. In your example, C\mathcal{C} has just one object, so a natural transformation consists of a single morphism.

As we have seen, there may be many (distinct!) natural transformations between a pair of functors, but they are separate, not all part of the same transformation.

It seems, I catch the idea. So, am I right, that in the case of the simple discrete category and nmn^m functions between the image-sets of FF and GG there are actually nmn^m distinct natural transformations, and their components may be named as αa,βa,...\alpha_a , \beta_a, ... (up to nm n^m -th symbol in the component's name ) ?

view this post on Zulip Eduard BABKIN (Sep 30 2020 at 11:14):

[Mod] Morgan Rogers said:

Eduard BABKIN said:

Now I recall that Yoneda lemma says about bijection between the set of components of natural transformation (Nat(..)Nat(..)) and the GaGa (also the set).
However the set of the components contains 2 elements (αa\alpha_a and αb\alpha_b ), while GaGa has only one element in the set.
That is a point of my confusion.

Where is a flaw in the speculations above ?

The same confusion is happening here. Yoneda talks about natural transformations, not their components.
Here there is exactly one natural transformation Hom(a,)G\mathrm{Hom}(a,-) \to G, and its components are the ones you identify, the unique functions between these one-element sets. And indeed, we see that the Yoneda lemma is verified: G(a)G(a) has exactly one element.

Thank you for pointing a correct view point. Now I see, that Yoneda lemma in our second case tells about bijection between the set GaGa and a rather "special" set: the set of morphisms between the object Hom(a,)Hom(a,-) and the object GG in the category [C,Set][C,Set]. Indeed these sets are equivalent and have one element. The single morphism Hom(a,)GaHom(a,-) \rightarrow Ga can "cover under the hood" multiple components of natural transformation, but Yoneda lemma keeps silence about that subject.

view this post on Zulip Morgan Rogers (he/him) (Sep 30 2020 at 11:26):

Indeed, natural transformations are actually a neat package of information, and when the categories get more complicated it's a lot more convenient to think of them as "just morphisms in a functor category" without worrying about the information they carry. This is the same kind of information hiding for clarity that pops up all over category theory, like thinking about sets or vector spaces or groups as "just objects" in their respective categories.