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: induced automorphisms


view this post on Zulip David Egolf (Sep 06 2023 at 22:30):

I was reading the start of Leinster's "Galois Theory" (here). On page 15, this example of a group action is provided:

Let GG be the 48-element group of isometries (rotations and reflections) of a cube. Then GG acts on the 6-element set of faces of the cube: any isometry maps faces to faces.

Intuitively, specifying a way to transform a cube so that it "lands back on itself" provides an induced permutation of the faces of the cube.

This leads me wonder: When (and how) can we induce automorphisms of one object from automorphisms of a different object?

I find it helpful to think about this in the category of sets. Consider the set {1,2,3,4}\{1,2,3,4\} together with the subset {1,2}\{1,2\}. Then there are lots of automorphisms of {1,2,3,4}\{1,2,3,4\} that don't induce automorphisms of {1,2}\{1,2\} in a nice way. For example, the permutation 14,41,22,331 \mapsto 4, 4 \mapsto 1, 2 \mapsto 2, 3 \mapsto 3 does not nicely induce a permutation of {1,2}\{1,2\}, because under this permutation 11 gets mapped to an element outside of {1,2}\{1,2\}.

Motivated by this, I started considering commutative squares like this one:
commutative square

Here, XX and YY are objects in some category CC, g:XXg: X \to X is an automorphism, and m:YXm: Y \to X is a monomorphism. The intuitive intent is that the square commuting ensures that the YY-part of XX gets mapped to itself under gg. We can ask under what conditions a gˉ\bar{g} will exist so that the square commutes. When gˉ\bar{g} does exist and is an automorphism, we might say it is the automorphism of YY induced by the automorphism g:XXg: X \to X. By the way, I believe that if gˉ\bar{g} exists, it is unique, because if gm=mgˉ=mgˉg \circ m = m \circ \bar{g} = m \circ \bar{g}', then gˉ=gˉ\bar{g} = \bar{g}', because mm is a monomorphism.

In this context, we can consider a few questions:

Although I mention some specific questions above for concreteness, it could be interesting to discuss related concepts in this direction too! So please don't hesitate to mention something just because it doesn't directly answer one of my specific questions.

view this post on Zulip James Deikun (Sep 06 2023 at 22:53):

I think for finite sets in classical foundations, g\overline{g} will always be an automorphism if it exists; for infinite sets you probably need something else -- probably for the square to be a pullback.

view this post on Zulip Mike Shulman (Sep 06 2023 at 22:55):

As a concrete counterexample, let X=ZX=\mathbb{Z}, g(x)=x+1g(x) = x+1, and Y=NY = \mathbb{N} with mm the inclusion. Then gˉ\bar{g} exists, but is not an automorphism of N\mathbb{N}.

view this post on Zulip James Deikun (Sep 06 2023 at 23:12):

If mm pulls back to itself along an isomorphism, then the other projection of the pullback is an isomorphism: take the unique arrow hh from Y to Y induced by the arrows g1mg^{-1}m and idY\mathrm{id}_Y, it will be a section of g\overline{g} because idY\mathrm{id}_Y induced it and a retraction of g\overline{g} because ghg=g\overline{g}h\overline{g} = \overline{g} and mhg=g1gmhg=g1mghg=g1mg=mmh\overline{g} = g^{-1}gmh\overline{g} = g^{-1}m\overline{g}h\overline{g} = g^{-1}m\overline{g} = m so hgh\overline{g} has the same cone as (and is therefore identical to) idY\mathrm{id}_Y.

view this post on Zulip James Deikun (Sep 06 2023 at 23:18):

Similarly if a square like this exists with gg, g\overline{g} automorphisms, it is a pullback because given a pullback cone x:ZX,y:ZYx : Z \to X, y : Z \to Y where gx=mygx = my, g1y\overline{g}^{-1}y induces the cone (yy is immediate, xx because mg1y=g1my=g1gx=xm\overline{g}^{-1}y = g^{-1}my = g^{-1}gx = x). So being a pullback is exactly enough.

view this post on Zulip James Deikun (Sep 06 2023 at 23:24):

(Oh, and the inducing morphism is unique because mm is a mono. Or because g\overline{g} is an iso hence a mono. Take your pick.)

view this post on Zulip David Egolf (Sep 07 2023 at 16:01):

Mike Shulman said:

As a concrete counterexample, let X=ZX=\mathbb{Z}, g(x)=x+1g(x) = x+1, and Y=NY = \mathbb{N} with mm the inclusion. Then gˉ\bar{g} exists, but is not an automorphism of N\mathbb{N}.

Ah, so sometimes gˉ\bar{g} is not an automorphism. I guess that means my plan for inducing automorphisms doesn't always work out!
(In this case gˉ\bar{g} I think also adds one to each N\mathbb{N}, but this is not a bijection and hence not an automorphism of N\mathbb{N} in Set\mathsf{Set}.)

view this post on Zulip Mike Shulman (Sep 07 2023 at 16:10):

If what you're after is some way of inducing automorphisms on a subobject, then you may want to consider the stabilizer subgroup of that subobject. In set-theoretic language, if a group GG acts on a set XX, and SS is a subset of XX, for gGg\in G we define gS={gssS}g\cdot S = \{ g\cdot s \mid s\in S\}, and then the stabilizer of SS is StabG(S)={gGgS=S}\mathrm{Stab}_G(S) = \{ g\in G \mid g\cdot S = S\}. Your hypothesis of the existence of gˉ\bar{g} corresponds in this language to asking that gSSg\cdot S \subseteq S, which isn't strong enough to yield a subgroup of GG, but the stronger condition gS=Sg\cdot S = S is.

In categorical language, gS=Sg\cdot S = S corresponds to asking that the composite SmXgXS \xrightarrow{m} X \xrightarrow{g} X is equal to mm "as a subobject of XX", which means that they are isomorphic (necessarily uniquely) in the slice category over XX. This amounts to explicitly requiring the existence of a gˉ\bar{g} that is an isomorphism, so from this point of view we're just solving the problem by fiat. However, the notion of stabilizer of a subobject is a fairly well-studied one, so at least it makes a connection to well-known concepts.

view this post on Zulip David Egolf (Sep 07 2023 at 16:18):

And thanks @James Deikun for thinking about this! However, I'm still learning the basics of category theory, and it will take me some work to understand your response. If I understand correctly, you are considering the case where YY together with maps m:YXm: Y \to X and gˉ:YY\bar{g}: Y \to Y is a pullback of the diagram corresponding to the maps g:XXg: X \to X and m:YXm: Y \to X.

Considering the case where the diagram is a pullback wouldn't have occurred to me. I guess I don't have a lot of intuition for when pullbacks are relevant yet, or what they are really like!

I don't understand what this means: "take the unique arrow hh from Y to Y induced by the arrows g1mg^{-1}m and idY\mathrm{id}_Y". We have that g1mg^{-1} \circ m is a morphism from YY to XX, and of course idY\mathrm{id}_Y goes from YY to YY. So I'm assuming there is some standard way of inducing a morphism from YY to YY given a morphism from YY to XX and a morphism from YY to YY, using a pullback diagram of the form pictured above. However, I don't know what this way is!

EDIT:
Ah, I think I see the idea! The maps g1m:YXg^{-1} \circ m:Y \to X and 1Y:YY1_Y: Y \to Y together with YY would provide another cone over the diagram corresponding to the maps g:XXg: X \to X and m:YXm: Y \to X. Then we want to use the universal property of the pullback to induce hh.

I'll try and see how much further I can get, understanding this.

view this post on Zulip David Egolf (Sep 07 2023 at 16:27):

Mike Shulman said:

Your hypothesis of the existence of gˉ\bar{g} corresponds in this language to asking that gSSg\cdot S \subseteq S, which isn't strong enough to yield a subgroup of GG, but the stronger condition gS=Sg\cdot S = S is.

I think this was illustrated in that example above, where the action of the +1+1 automorphism of Z\mathbb{Z} (where +1:ZZ+1: \mathbb{Z} \to \mathbb{Z} and +1(x)=x+1+1(x) = x+1 for each xZx \in \mathbb{Z}) on N\mathbb{N} is such that +1(N)N+1(\mathbb{N}) \subseteq \mathbb{N}, but +1(N)N+1(\mathbb{N}) \neq \mathbb{N}.

view this post on Zulip David Egolf (Sep 07 2023 at 18:08):

James Deikun said:

If mm pulls back to itself along an isomorphism, then the other projection of the pullback is an isomorphism: take the unique arrow hh from Y to Y induced by the arrows g1mg^{-1}m and idY\mathrm{id}_Y, it will be a section of g\overline{g} because idY\mathrm{id}_Y induced it and a retraction of g\overline{g} because ghg=g\overline{g}h\overline{g} = \overline{g} and mhg=g1gmhg=g1mghg=g1mg=mmh\overline{g} = g^{-1}gmh\overline{g} = g^{-1}m\overline{g}h\overline{g} = g^{-1}m\overline{g} = m so hgh\overline{g} has the same cone as (and is therefore identical to) idX\mathrm{id}_X.

I think I now follow all of this! The idea that a morphism like hgh \overline{g} can have a cone confused me for a while. I think the idea is that we can get a new cone from the pullback cone by precomposing at the apex using hg:YYh \overline{g}: Y \to Y. That's pretty cool - I don't think I'd really realized you can get new cones from old ones in this way.

The technique of finding two cone morphisms to the pullback cone, each having the same source cone, and then concluding these two cone morphisms are the same (because there is a unique cone morphism to the pullback cone from any other cone over the appropriate diagram) was also very interesting to see.

(By the way, I think it should be idY\mathrm{id}_Y, not idX\mathrm{id}_X in the last sentence).

view this post on Zulip James Deikun (Sep 07 2023 at 18:09):

Ah, yes, you're right. Fixed.

view this post on Zulip James Deikun (Sep 07 2023 at 18:15):

As for "why a pullback in the first place", a pullback of two monos in Set\bold{Set} displays the intersection of two subsets, so generalizing from that it seemed likely to work.

view this post on Zulip David Egolf (Sep 07 2023 at 18:26):

James Deikun said:

Similarly if a square like this exists with gg, g\overline{g} automorphisms, it is a pullback because given a pullback cone x:ZX,y:ZYx : Z \to X, y : Z \to Y where gx=mygx = my, g1y\overline{g}^{-1}y induces the cone (yy is immediate, xx because mg1y=g1my=g1gx=xm\overline{g}^{-1}y = g^{-1}my = g^{-1}gx = x). So being a pullback is exactly enough.

And this all makes sense to me as well! Hooray!

So, in summary, the original commutative square is a pullback square if and only if gˉ\bar{g} is an automorphism.

view this post on Zulip David Egolf (Sep 07 2023 at 18:44):

James Deikun said:

As for "why a pullback in the first place", a pullback of two monos in Set\bold{Set} displays the intersection of two subsets, so generalizing from that it seemed likely to work.

Thanks for explaining! This helps provide some additional intuition (for me) regarding what a pullback is like.