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: image subcategories structure


view this post on Zulip David Egolf (Jan 16 2022 at 01:04):

Let F:ABF: A \to B be a functor, and let ImFIm F be the smallest subcategory of BB that contains F(A)F(A).

I think we can view ImFIm F as "information about AA observed by BB through FF". From this perspective some functors will be more informative than others, I think. For example, if ImGIm G is a proper subcategory of ImFIm F, we might say that GG is a less informative observation of AA in BB. Perhaps similarly, we might say that FF is no more informative than GG if there is a functor H:BBH: B \to B so that HG=FH \circ G = F.

Consider now the collection of all subcategories of BB of the form ImFIm F for some functor F:ABF: A \to B. Does this collection have some natural kind of structure (perhaps ordered with respect to "informativeness")? Intuitively it feels like it should reflect in some way the structure of the subobjects of AA.

view this post on Zulip John Baez (Jan 16 2022 at 02:32):

If AA is any subcategory of BB, there is a functor F:ABF: A \to B that is the identity on objects of AA and morphisms of AA: this is usually called "the inclusion of AA in BB".

Note that A=ImFA = Im F, i.e. AA is the smallest subcategory of BB that contains F(A)F(A) (=A= A).

So when you say

view this post on Zulip John Baez (Jan 16 2022 at 02:33):

Consider now the collection of all subcategories of BB of the form ImFIm F for some functor F:ABF: A \to B.

this is equivalent to saying "consider now the collection of all subcategories of BB". I think this is a simpler way to think about things.

view this post on Zulip John Baez (Jan 16 2022 at 02:34):

Does this collection have some natural kind of structure (perhaps ordered with respect to "informativeness")?

It is partially ordered by inclusion: that is, we can say AAA \le A' if every object (resp. morphism) of AA is an object (resp. morphism) of AA', and this relation \le is a partial order.

view this post on Zulip David Egolf (Jan 16 2022 at 02:56):

Thanks @John Baez for your thoughts above. It makes sense that the subcategories of BB are ordered by inclusion.
However, I am actually primarily interested in the case where AA is fixed (maybe I didn't convey that very clearly, though). Then, it often isn't the case that we can express any subcategory of BB as the smallest subcategory containing the image of some functor FF mapping from AA.
For example, consider two sets AA and BB as discrete categories, with a functor F:ABF: A \to B being a function between them. Then if AA has fewer elements than BB, then we can't express every subcategory (subset) of BB as the image of some function F:ABF: A \to B.
I suppose, however, that the resulting subcategories are still ordered by inclusion.

view this post on Zulip David Egolf (Jan 16 2022 at 03:01):

It can also be interesting to think about what happens as BB varies, but AA is held fixed. For example, consider the case where AA and BB are sets viewed as discrete categories, and BB has a single element. Then we only have one functor from AA to BB - the functor that sends everything to a single object. The fact that this image subcategory of BB exists tells us that AA has at least one element, but not anything more. If BB has two elements, then functors into BB can start to detect a bit more about AA. Although, it is interesting to note here that not all functors from AA in this case are equally informative. I suppose an ordering on these can be inherited from the ordering by inclusion of the subcategories they induce.

view this post on Zulip David Egolf (Jan 16 2022 at 03:05):

For context, I was learning a bit about reflective subcategories. The "reflection" in a subcategory of an object I think corresponds to the one that detects as much as possible in that subcategory about the object being reflected.

view this post on Zulip David Egolf (Jan 16 2022 at 03:06):

This is the diagram I have in mind motivating this line of thought, although the notation used here annoyingly swaps AA and BB compared to what I said above:
reflection

(image from "Abstract and Concrete Categories", here A\mathbf{A} is a subcategory of B\mathbf{B}, also AA is an object of A\mathbf{A} and BB an object of B\mathbf{B})

view this post on Zulip John Baez (Jan 16 2022 at 03:11):

David Egolf said:

Thanks John Baez for your thoughts above. It makes sense that the subcategories of BB are ordered by inclusion. However, I am actually primarily interested in the case where AA is fixed (maybe I didn't convey that very clearly, though).

Oh, wow! Okay, that's more subtle.

Although, it is interesting to note here that not all functors from AA in this case are equally informative.

I wish you'd give a formal definition of what you mean here by "equally informative". Maybe you have some intuition for it but are still struggling to formalize it. But it's a bit hard for mathematicians to help until you do.

view this post on Zulip John Baez (Jan 16 2022 at 03:14):

Here's a simple and interesting case to think about.

Suppose BB is the category whose objects are natural numbers, with a single morphism from mm to nn if mnm \le n and none otherwise. Category theorists might draw this as

\bullet \to \bullet \to \bullet \to \cdots

Then taking A=BA = B, there are infinitely many functors F:ABF : A \to B with different images. You can probably think of infinitely many rather quickly. But in fact there are uncountably many, so maybe it's a fun puzzle to see why.

view this post on Zulip John Baez (Jan 16 2022 at 03:15):

Or, maybe you'll decide that this infinite stuff is not at all what you're interested in!

view this post on Zulip David Egolf (Jan 16 2022 at 03:16):

John Baez said:

I wish you'd give a formal definition of what you mean here by "equally informative". Maybe you have some intuition for it but are still struggling to formalize it. But it's a bit hard for mathematicians to help until you do.

I think this is what I mean (trying to express some intuition precisely): let F:ABF: A \to B and G:ABG: A \to B be functors. Then we say that FF is "at least as informative as GG about AA" exactly if there exists a functor H:BBH: B \to B so that G=HFG = H \circ F.

view this post on Zulip David Egolf (Jan 16 2022 at 03:17):

The idea is - that whatever GG is calculating about AA, that calculation can still be performed using the results of whatever FF is doing to AA.

view this post on Zulip David Egolf (Jan 16 2022 at 03:18):

So, two functors FF and GG should be equally informative about AA if there exists H1H_1 and H2H_2 so that G=H2FG = H_2 \circ F and F=H1GF = H_1 \circ G.

view this post on Zulip John Baez (Jan 16 2022 at 03:21):

Oh, wow! The great thing about this definition is that mathematicians will automatically find it familiar and interesting. In this situation we say "GG factors through FF". This concept makes sense and is widely studied, not just for categories and functors, but for objects and morphisms in any category.

Given objects AA and BB in any category, there's a preorder on the set of morphisms from AA to BB such that GFG \le F if GG factors through FF. You might enjoy checking that it's a preorder.

It's not a partial ordering because it's not true that

FG and GF    F=GF \le G \text{ and } G \le F \implies F = G

view this post on Zulip John Baez (Jan 16 2022 at 03:23):

Whenever we have any preorder, we can define FGF \sim G to mean FGF \le G and GFG \le F. Then \sim is an equivalence relation.

view this post on Zulip John Baez (Jan 16 2022 at 03:24):

In the particular case where the category is Cat, when GFG \le F you're saying "FF is at least as informative as GG", and when FGF \sim G you're saying "FF and GG are equally informative".

view this post on Zulip John Baez (Jan 16 2022 at 03:25):

You'll notice I'm telling you the various facts at a fairly high level of generality: "in any category" and "whenever we have any preorder". This is what category theorists like to do.

view this post on Zulip John Baez (Jan 16 2022 at 03:26):

That way we build up an arsenal of widely useful tools.

view this post on Zulip David Egolf (Jan 16 2022 at 03:27):

Ah, excellent! I will probably indeed enjoy checking that this "informativeness" (or factoring through) gives a preorder.
One reason I care about this is that one could imagine using this concept to put an ordering on some observation-generating part of an imaging system.

view this post on Zulip David Egolf (Jan 16 2022 at 03:27):

Although I guess it's not a very subtle ordering. But perhaps one could do more complex things like considering "informative with respect to observing property PP".

view this post on Zulip David Egolf (Jan 16 2022 at 03:28):

And then consider a few properties at the same time.

view this post on Zulip David Egolf (Jan 16 2022 at 03:28):

Anyways, thanks!

view this post on Zulip Zhen Lin Low (Jan 16 2022 at 03:32):

Before you get too excited it might be good to check that your definition lives up to your expectations. For example, according to your definition, if A is a single point, then all functors A → B are "equally informative". Is that what you expect?

view this post on Zulip John Baez (Jan 16 2022 at 03:35):

I don't think that's actually true, but it's definitely worth thinking about.

I'm pretty sure that if B is a single point then all functors A → B are "equally informative".

view this post on Zulip David Egolf (Jan 16 2022 at 03:35):

Ok, I see it does indeed form a preorder.
FFF \leq F because F=idBFF = id_B \circ F
If MGM \leq G and GFG \leq F then we have M=H2GM=H_2 \circ G and G=H1FG = H_1 \circ F.
But then M=(H2H1)FM = (H_2 \circ H_1) \circ F. So MFM \leq F.

view this post on Zulip John Baez (Jan 16 2022 at 03:38):

Right, the second one is the interesting part of the definition of preorder: the transitive law. The first part, the reflexive law, is kinda obvious.

view this post on Zulip Zhen Lin Low (Jan 16 2022 at 03:39):

@John Baez It doesn't matter whether B is a point or not. You can collapse B to a point and then map it to any other point. The relevant triangle commutes because A is just a point and cannot see that you have collapsed B to a point.

view this post on Zulip John Baez (Jan 16 2022 at 03:40):

You're right. Good point (pardon the pun).

view this post on Zulip David Egolf (Jan 16 2022 at 03:41):

I'm considering the statement "if A is a single point, then all functors ABA \to B are equally informative".
Let AA be the category with a single object and its identity morphism.
Let F,GF, G be functors to BB.
Then FF is specified by the object it sends the single object of AA to.
Similarly, GG is specified by the object it sends the single object of AA to.
It seems like there exists a functor H:BBH: B \to B that sends one distinguished object to another.
It seems like FF and GG are always "equally informative" in this case.

view this post on Zulip David Egolf (Jan 16 2022 at 03:42):

But this makes intuitive sense to me. There isn't a lot to say about AA besides "it has one object". We can look at ImFIm F and ImGIm G and see that both FF and GG are informing us that AA has at least one object. Since there isn't anything else to say, it makes sense any observations need to be equally informative.

view this post on Zulip Zhen Lin Low (Jan 16 2022 at 03:48):

Well, if you believe the conclusion then I suppose you can go ahead with your definition. Personally, I do not agree – for me it is intuitive that some objects in a category are more informative than others. What is more, which objects are more informative depend on the context.

view this post on Zulip David Egolf (Jan 16 2022 at 03:51):

Zhen Lin Low said:

Well, if you believe the conclusion then I suppose you can go ahead with your definition. Personally, I do not agree – for me it is intuitive that some objects in a category are more informative than others. What is more, which objects are more informative depend on the context.

I think it depends on how broadly one considers the "informativeness" of an object. As you say, it depends on context.

Here I am considering a concept that describes how informative functors are with respect to a fixed object. One could consider a more broad concept that considers how informative objects are (in terms of the informativeness of the functors they support) with respect to a collection of objects, and that should lead to different conclusions.

view this post on Zulip David Egolf (Jan 16 2022 at 04:29):

I suppose a follow up question would be: Does this preoder on functors from AA to BB (ordered by "informativeness" or by saying GFG \leq F if GG factors though FF) have meets or joins?

view this post on Zulip David Egolf (Jan 16 2022 at 17:26):

Incidentally, I'm pretty sure that GFG \leq F implies that ImGIm G is a subcategory of ImFIm F.

view this post on Zulip David Egolf (Jan 16 2022 at 17:26):

So this is (if correct) a more concrete way of saying that "FF observes at least as much about AA as GG does"

view this post on Zulip John Baez (Jan 16 2022 at 17:33):

David Egolf said:

Incidentally, I'm pretty sure that GFG \leq F implies that ImGIm G is a subcategory of ImFIm F.

I don't think so. For a simple counterexample, take AA to be (i.e. a category with one object and one morphism), take BB to be a category with just two objects and their identity morphisms, and let FF and GG be the two different functors F,G:ABF, G: A \to B.

Zhen Lin showed that if AA is just a point, and BB is any category whatsoever, and F,G:ABF, G : A \to B are any functors whatsoever, then GG always factors through FF... which we're writing as GFG \le F.

view this post on Zulip John Baez (Jan 16 2022 at 17:34):

In this situation ImFIm F and ImGIm G can each be any subcategory of BB that consists of a single object and its identity morphism.

view this post on Zulip John Baez (Jan 16 2022 at 17:34):

So, typically ImGIm G is not a subcategory of ImFIm F.

view this post on Zulip David Egolf (Jan 16 2022 at 17:47):

Oh yes, good point.
I'll have to think about this some more.

view this post on Zulip David Egolf (Jan 16 2022 at 17:51):

So, if GFG \leq F, then there exists an HH so that G=HFG = H \circ F.
The idea I'm trying to get at is that HH should be sending ImFIm F to ImGIm G.

view this post on Zulip John Baez (Jan 16 2022 at 17:52):

It probably does.

view this post on Zulip John Baez (Jan 16 2022 at 17:52):

But that's really different than saying ImF=ImGIm F = Im G.

view this post on Zulip John Baez (Jan 16 2022 at 17:55):

Maybe you're trying to dream up a preorder on the subcategories of a category.

view this post on Zulip David Egolf (Jan 16 2022 at 18:14):

For context, I was reading a paper on "generalized congruences". I think from that paper that ImFIm F is isomorphic to a "quotient category" of AA induced by FF, which is called A/FA/\sim_F in that paper. The intuition I'm trying to figure out here is that more informative observations should correspond to observing quotient categories of AA with less quotienting of things.
Maybe we can say that one subcategory ImGIm G is "contained inside of" ImFIm F in a general sense if there is a monomorphic functor from ImGIm G to ImFIm F. So, then, I guess I am hoping that if GFG \leq F then there is a monomorphic functor sending ImGIm G to ImFIm F.

view this post on Zulip David Egolf (Jan 16 2022 at 18:16):

If this was the case, I think this could indeed end up leading to a preorder on these image subcategories.

view this post on Zulip David Egolf (Jan 16 2022 at 18:22):

Maybe a better way to think about this - Can we quotient Im(F)Im(F) to get Im(G)Im(G)?

view this post on Zulip David Egolf (Jan 16 2022 at 18:23):

I am tempted to guess that Im(F)/HIm(G)Im(F)/\sim_H \cong Im(G) if G=HFG = H \circ F.

view this post on Zulip David Egolf (Jan 16 2022 at 18:25):

For reference, this is the quotienting operation I'm referring to:
quotient

(from "Generalized Congruences — Epimorphisms in Cat")

view this post on Zulip David Egolf (Jan 16 2022 at 18:27):

(Every functor FF induces a "generalized congruence" defined by identifying objects sent to the same object by FF, and identifying morphism sequences that are sent to the same morphism by FF upon composition in the image).

view this post on Zulip David Egolf (Jan 16 2022 at 18:51):

One possible chain of reasoning to relate Im(F)Im(F) and Im(G)Im(G):
Im(G)=Im(HF)A/(HF)(A/F)/(H)Im(F)/HIm(G) = Im(H \circ F) \cong A/(\sim_{H \circ F}) \cong (A / \sim_F) / (\sim_H) \cong Im(F) /\sim _H

view this post on Zulip David Egolf (Jan 16 2022 at 18:51):

However, I need to check that each step of this is actually valid. (Note: I would need to define what I mean by successive quotienting).

view this post on Zulip David Egolf (Jan 16 2022 at 19:30):

One thing that would be helpful to know is this:
Does H(Im(F))=Im(HF)H(Im(F)) = Im(H \circ F) for F:ABF: A \to B and H:BBH: B \to B?

view this post on Zulip David Egolf (Jan 16 2022 at 19:32):

(where Im(F)Im(F) is the smallest subcategory of BB containing F(A)F(A))

view this post on Zulip David Egolf (Jan 16 2022 at 19:33):

Actually, I think we want to know if the smallest subcategory containing H(Im(F))H(Im(F)) is the same as Im(HF)Im(H \circ F).

view this post on Zulip David Egolf (Jan 16 2022 at 19:39):

This feels really painfully messy. Maybe there is a better way to think about this.

view this post on Zulip David Egolf (Jan 16 2022 at 20:28):

I think this picture helps;

diagram

The quotient functor QFQ_{\sim_F} for F:ABF: A \to B sends AA to A/FA/\sim_F.
I believe that A/FA/\sim_F is isomorphic to ImFIm F, and so is isomorphic to a subcategory of BB.

view this post on Zulip David Egolf (Jan 16 2022 at 20:29):

That's why I have drawn monic arrows from those quotient categories into BB.

view this post on Zulip David Egolf (Jan 16 2022 at 20:37):

The top two cells and the bottom-most cell should commute.
If this is true, then G=HF=kQ(HF)=jQ(Hi)QFG = H \circ F = k \circ Q_{\sim (H \circ F) } = j \circ Q_{\sim (H \circ i)} \circ Q_{\sim F}.
I think this means that A/HFA/{\sim_{H \circ F}} is mapped into the same subcategory of BB as is (AF)/Hi(A_{\sim F})/\sim_{ H \circ i}

view this post on Zulip David Egolf (Jan 16 2022 at 20:39):

So, I think Im(G)Im(G) is isomorphic to Im(F)/HIm(F)/\sim_{H}.

view this post on Zulip David Egolf (Jan 16 2022 at 20:45):

If this is true, this describes how different observations of the same category are related in terms of the smallest subcategory of the image they specify. If FF is "at least as informative as GG", then you can compute the subcategory ImGIm G by quotienting ImFIm F.

view this post on Zulip David Egolf (Jan 16 2022 at 20:52):

As a test, say AA is a set with two elements viewed as a discrete category, and say BB is also a set with two elements. Let F:ABF: A \to B be a function that sends a1b1a_1 \mapsto b_1 and a2b2a_2 \mapsto b_2. Let G:ABG: A \to B be a function that sends both elements to b1b_1. Then G=HFG = H \circ F, where H:BBH: B \to B sends both elements to b1b_1.
In this case ImF=BIm F = B and A/FAA/\sim_F \cong A. We also have that ImGIm G is the subcategory of BB corresponding to the single element b1b_1 and B/GB /\sim_G is a category with a single object and no non-identity morphisms.

view this post on Zulip David Egolf (Jan 16 2022 at 20:54):

Now, we want to compute Im(F)/HIm(F)/\sim_H. This is a category with a single object and no non-identity morphisms, as HH sends each element of Im(F)Im(F) to the same element. This is indeed isomorphic to Im(G)Im(G).

view this post on Zulip David Egolf (Jan 16 2022 at 20:55):

So, at least in this case, we were able to compute ImGIm G from ImFIm F by doing a quotienting specified by HH.

view this post on Zulip David Egolf (Jan 16 2022 at 20:55):

I'm not sure I have the willpower to take the sketch based on that picture above and make a proper proof, but this has been interesting anyways.