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.
Consequent reflection upon the Yoneda lemma moved me to the following case and a basic question:
Given a discrete category with a single object and a single morphism , we can define two functors F, G, both .
Now imagine, that F maps the object to a set with elements, while G maps to the set with elements.
Let's consider natural transformation between F and G. its single component 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 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 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 ?
There are actually natural transformations between the functors you describe. Each of the possible functions describes a valid natural transformation, because the naturality condition is trivial.
However, the Yoneda lemma refers to representable functors. In this case, the representable functor sends the unique object of to the -element set. And indeed, you'll notice that if is as you describe, there are exactly natural transformations from to .
[Mod] Morgan Rogers said:
There are actually 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 , could each component be named as , where runs from 1 to ?
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 (), but the element of that set is the set itself (with elements -- all possible functions) ?
[Mod] Morgan Rogers said:
However, the Yoneda lemma refers to representable functors. In this case, the representable functor sends the unique object of to the -element set. And indeed, you'll notice that if is as you describe, there are exactly natural transformations from to .
Am I right that when you speak about the representable functor in the context of Yoneda Lemma, You actually mean only the functor , while the functor 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: and , morphism ) and a covariant type of Yoneda lemma , .
Let define a simple case of functor when it sends to one singleton set in , and to another singleton set.
if I'm not mistaken, the Hom-functor sends from category 2 to a singleton set (), while is also sent to another singleton set (). For such a trivial case we can determine two components of natural transformation between and :
and 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 () and the (also the set).
However the set of the components contains 2 elements ( and ), while has only one element in the set.
That is a point of my confusion.
Where is a flaw in the speculations above ?
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 , could each component be named as , where runs from 1 to ?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 (), but the element of that set is the set itself (with elements -- all possible functions) ?
Hmm it seems there is some confusion about the data of natural transformations here.
Given functors , a natural transformation from to consists of a morphism for each object of , subject to a naturality condition for each morphism of . In your example, 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.
Eduard BABKIN said:
Now I recall that Yoneda lemma says about bijection between the set of components of natural transformation () and the (also the set).
However the set of the components contains 2 elements ( and ), while 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 , 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: has exactly one element.
[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 , could each component be named as , where runs from 1 to ?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 (), but the element of that set is the set itself (with elements -- all possible functions) ?
Hmm it seems there is some confusion about the data of natural transformations here.
Given functors , a natural transformation from to consists of a morphism for each object of , subject to a naturality condition for each morphism of . In your example, 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 functions between the image-sets of and there are actually distinct natural transformations, and their components may be named as (up to -th symbol in the component's name ) ?
[Mod] Morgan Rogers said:
Eduard BABKIN said:
Now I recall that Yoneda lemma says about bijection between the set of components of natural transformation () and the (also the set).
However the set of the components contains 2 elements ( and ), while 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 , 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: 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 and a rather "special" set: the set of morphisms between the object and the object in the category . Indeed these sets are equivalent and have one element. The single morphism can "cover under the hood" multiple components of natural transformation, but Yoneda lemma keeps silence about that subject.
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.