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: functors compatible with automorphisms


view this post on Zulip David Egolf (May 22 2023 at 23:56):

Consider the discrete category 22 with two objects, called o1o_1 and o2o_2. These objects are pretty similar, intuitively, even though they are not isomorphic. In fact, there is an automorphism (an invertible endofunctor) α:22\alpha: 2 \to 2 that swaps the two objects, so that in particular α(o1)=o2\alpha(o_1) = o_2.

Now consider a functor F:2CF: 2 \to C. Then, it is not required by the definition of a functor that F(o1)F(o2)F(o_1) \cong F(o_2). I think it is also not required that there exist an automorphism β:CC\beta: C \to C so that β(F(o1))=F(o2)\beta(F(o_1)) = F(o_2), or even that β(F(o1))F(o2)\beta(F(o_1)) \cong F(o_2).

Sometimes I think of a functor F:DCF: D \to C as realizing the structure of DD as part of CC. The situation described above seems to go against this philosophy: o1o_1 and o2o_2 are related in a certain way in 22, but F(o1)F(o_1) and F(o2)F(o_2) are not necessarily related in a similar way in CC.

Is there a name given to functors that do have the property I discuss above? That is, is there a name for functors F:DCF: D \to C so that for any automorphism α:DD\alpha: D \to D and any objects dd and dd' in DD so that α(d)=d\alpha(d) = d', there then exists an automorphism β:CC\beta: C \to C so that β(F(d))=F(d)\beta(F(d)) = F(d')?

It might be more principled to ask that this only hold up to isomorphism. So, I would also be interested in considering a relaxed version of this condition: Is there a name for functors F:DCF: D \to C so that for any automorphism α:DD\alpha: D \to D and any objects dd and dd' in DD so that α(d)d\alpha(d) \cong d', there then exists an automorphism β:CC\beta: C \to C so that β(F(d))F(d)\beta(F(d)) \cong F(d')?

(A follow-up thought: Maybe things would be nicer if I didn't consider automorphisms of categories, but instead equivalences of a category with itself.)

view this post on Zulip Kevin Arlin (May 23 2023 at 00:19):

I don't think this is really about categories, actually. Groups, for instance, have the same behavior you complain about, where the existence of an automorphism of CC sending g1g_1 to g2,g_2, which certainly says there's something similar about g1g_1 and g2g_2 in C,C, doesn't imply the same for F(g1),F(g2)F(g_1),F(g_2) when F:CDF:C\to D is a homomorphism. (Note that I'm using your notation but there's a level shift here, if we think about groups as categories: g1,g2g_1,g_2 are morphisms.)

Whether in groups or categories, I'm not really sure how to think about your proposed condition. It seems awkward to work just one object at a time. Maybe it would be more natural (without messing up your motivating example) to ask that for any automorphism α\alpha there exist β\beta such that βF=Fα\beta\circ F=F\circ\alpha? It's hard for me to see what this property means, though, except in the case that FF is an isomorphism or an equivalence, where it's always possible by setting α=F1βF.\alpha=F^{-1}\beta F.

view this post on Zulip Morgan Rogers (he/him) (May 23 2023 at 08:20):

This kind of property is more commonly considered as a property of the codomain rather than the functor. There are concepts in model theory of homogeneous object (relative to some class of objects). The "random graph" is an example of this: given any finite graph and two embeddings of that graph into the random graph (or equivalently, given two isomorphic subgraphs), there is an automorphism of the random graph exchanging them.

view this post on Zulip Morgan Rogers (he/him) (May 23 2023 at 08:21):

Actually, maybe "ultrahomogeneous" is the term I should be using for this property. Here's a MO question about those.

view this post on Zulip Morgan Rogers (he/him) (May 23 2023 at 10:14):

Incidentally, a related property studied by Ehresmann and Vanbremeersch (leading to their definition of "multiplicity principle") appears in a paper I am currently reviewing. Hopefully that gives you some keywords to search for.

view this post on Zulip David Egolf (May 23 2023 at 15:03):

Thanks to both of your for your interesting responses! After thinking about them for a bit, I feel like I understand what's going on here a little better. I appreciate the reference to the concept of "ultrahomogeneous" in model theory.

I think it makes sense to me that this kind of property is more often considered as a property of the codomain. I suppose it's actually quite a lot to ask that automorphisms α\alpha of DD extend to automorphisms β\beta of CC for F:DCF: D \to C. Intuitively, for some object dDd \in D, F(d)F(d) and (Fα)(d)(F \circ \alpha)(d) might be connected to other parts of CC in different ways, which starts adding in extra conditions (relating to the structure of CC) for any automorphism of CC that sends F(d)F(d) to (Fα)(d)(F \circ \alpha)(d).

By the way, this question occurred to me while I was thinking about limits. I was wondering if limF\lim F and lim(Fα)\lim (F \circ \alpha) are necessarily isomorphic if they both exist, for α\alpha an invertible endofunctor. I am still hoping this might be true!

view this post on Zulip Josselin Poiret (May 23 2023 at 19:31):

yes, in general any equivalence α \alpha would give you an isomorphism of limits