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.
I have started reading "Generalized Congruences - Epimorphisms in " as part of an effort to understand questions related to those raised in in #learning: questions > equivalence relationships preserved by endofunctors.
The authors note that, given a functor , the image of is not generally a category. However, they note it is possible to create a "smallest" subcategory of containing the objects and morphisms of .
The "smallest" of anything usually seems to be a limit or colimit of some kind. To get practice with this kind of thinking, I was trying to express "smallest subcategory of containing the image " as a limit or colimit. However, it feels like I am running into a problem based on the fact that isn't necessarily a category. In particular, I'm not seeing how to diagrammatically describe a category that contains the objects and morphisms of .
Any hints are appreciated.
"Just" take the class of all subcategories containing the image and take their intersection (= greatest lower bound).
That would work, thanks.
However, I guess I was hoping to describe the property "is a subcategory containing the image " using a diagram. My reasoning is that things described as diagrams are often easier to generalize or dualize.
That would be a subcategory through which F factors. You could express it as a commutative triangle.
Ah, I think that's it!
If I understand you correctly, category would be such a category:
subcategory containing image
where is a monomorphism and the diagram commutes.
Yes. The image (for want of a better name) would be the smallest (= initial) such category.
David wrote:
The authors note that, given a functor F:A→B, the image of F is not generally a category.
Why not?
(Please: nobody else answer this.)
Intuitively, one reason this happens is because pairs of morphisms that weren't compatible to compose in can become compatible to compose in . By a pair of morphisms that are "compatible to compose", I mean two morphisms where the source of one is the target of the other. This can result in a situation where we can't compose some compatible morphisms in . If this happens, then fails to be a category.
In more detail, say and are two non-compatible morphisms in . Let act so that and become compatible to compose. For to be a category, we need to be able to compose these to form . If and were compatible in , then we would have . That, is we would be able to form this composite in the image of . However, since and aren't compatible, there is no guarantee we can form their composite in the image of .
The authors of that paper have a nice figure illustrating this:
image of G is not a category
In the category on the right, the composite of the two morphisms in the middle is the morphism on the right. However, sends to a different morphism. and are compatible to compose, but are not actually possible to compose while staying within the image of . So, the image of is not a category here.
Incidentally, I suppose this particular problem only occurs when has more than one object. So, unless there are other problems I'm not thinking of, we can expect the image of a functor from a category with one object to be a category. I suppose this is one way to see that the image of a group homomorphism has at least a chance to be a subgroup (should be closed under composition).
Nice! I don't get why the picture involves two functors, and . We were talking about a single functor . So that picture is confusing to me. But it doesn't matter much, since your verbal explanation before the picture is fine.
Saying it in my own way: to check that the image of is a subcategory we need to check that the composite of two composable morphisms in the image, say and , is again in the image. That is, we need to check that is of some morphism. But what could it be? The only thing to guess here is , but that may not make sense, since the target of may not be the source of . Once you notice this you can easily cook up a counterexample.
(The reason there are two functors in the picture is that the picture is a screenshot from that paper, and they're illustrating something else with it).
Okay. So I like this stuff a lot, and it makes want to give you a little puzzle.
What's the simplest condition you can put on the functor to avoid the problem we just noticed?
For a functor with this property, its image will be a subcategory.
Hmmm, let's see.
We want any two morphisms in the image of to be composable into a morphism that is still in the image of . This will let the image of be a category.
So, for any composable morphisms and in the image of (where are morphisms in ) we need to also be in the image of . That is, we need for some morphism in . I think this is all we need.
That's true, but that's just basically saying that the image of is a subcategory.
I was looking for a simple interesting condition on that implies the image of is a subcategory. Maybe it takes some mathematical expertise to see this condition, so I'll tell you what I'm talking about: " is one-to-one on objects".
Oh, interesting! I guess the idea is that morphisms that aren't composible stay non-composable in the image in this case. That's because the only way to make morphisms composable when they weren't composable to begin with is to send objects that were different to objects that are the same: so that sources and targets that were distinct become the same.
Right.
There are functors that aren't one-to-one on objects whose image is still a subcategory, but the "obvious" way to show a composite is in the image of is to have it equal , and if is one-to-one on objects that will always be true.
Demanding that the functor was full would also do it.
It would suffice for the functor to "reflect isomorphy" in the sense that objects that become isomorphic in the codomain must already be isomorphic. This is not a very natural condition though. Full-on-isomorphisms would be a better categorification of "injective map".