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.
This is a puzzle for @Jan Pax. Nobody else should answer it.
There's a 2-category of categories, functors and natural transformations. Any group G gives a category BG with one object whose morphisms are elements of G, with composition in BG being multiplication in G. Let me just summarize this by saying "a group is a special sort of category".
So, what's the 2-category of categories that are groups, functors between these, and natural transformations between those?
The last part is the most interesting.
Once they've answered, I have a potentially interesting observation to make about this 2-category.
Let be groups and homomorphisms . The n.t. are arrows in the unique object of hence elements of .
The composition is multiplication in hence by comutativity of the naturality diagram we have where is the operation of .Any such is a n.t.
Now when I clicked on Mentions nothing appears, Before it listed all comments with @Jan Pax :
111.jpg
I don't know why you're seeing no mentions, @Jan Pax. When I click on Mentions I see all comments mentioning my name.
Please don't say anything yet, @Morgan Rogers (he/him), because while @Jan Pax has correctly answered my question, I want a bit more information from him!
So, @Jan Pax: when two group homomorphisms obey
for some and all , what do people say about these homomorphisms?
In other words: what's the usual way of talking about this situation?
and they call it conjugation with .
Right! I think people usually write
and they say is conjugated by .
So conjugation, so important in group theory, becomes visible in the 2-category of groups even though it's not very visible in the category of groups!
This time your question on me was easier than the tin problem.
Tin can problem. (I guess the British call a tin can a "tin".)
Here's another related question. Say we have a group , an automorphism , and a 2-morphism from to . What do we say about in this situation?
I don't know. This means that ?
Oh good, so my questions are finally becoming interesting! Figure it out! Does this imply or not?
You say 'good' so I'd guess from this that it does. But do not know why exactly.
I say "good" because I'm forcing you to think.
This is a sufficient condition but may be not necessary .
Say if is commutative.
Let's not say is commutative: conjugation is extremely boring when is commutative.
So there is something called a centre ?
I suggest doing this: choose a noncommutative group that you understand well, figure out its automorphisms, and figure out which have 2-morphisms to the identity.
I guess the smallest noncommutative group is , so I'd use this one.
But if you like geometry you might choose the group of rotations in 3 dimensions, .
Or if you like matrices you could use the group of invertible real matrices, .
It's good to understand the automorphisms of all these groups...
is fine for me. I would say that inner automoprhisms is again but I haven't carried out all the calculations.
What's an inner automorphism?
one coming from conjugation with . Not every automorphism is inner, I think they are more special.
Now I think maybe you can answer my question:
John Baez said:
Say we have a group , an automorphism , and a 2-morphism from to . What do we say about in this situation?
So whenever conjugation of with is 1 ?
or when is inner automorphism
Yes: in this situation we say is an inner automorphism. That's the answer I wanted.
So you were asking if every automorphism is inner:
Jan Pax said:
I don't know. This means that ?
So now I'll ask you: is every automorphism inner?
I have rather guessed my answer (with being inner) than I would know why it is so.
Okay. So, is every automorphism inner?
We may have a non-inner automorphism otherwise the notion would be uninteresting and would not exist.
if is 1 then is inner.
So you're claiming not every automorphism of every group is inner. Prove it!
just divide by center of . If this is trivial then every is inner.
Prove it!
I'm running this show, Morgan.
I don't think someone can stand having two bossy teachers.
At least, not simultaneously!
I'm happy with @Morgan Rogers (he/him) intervention :-)
Okay! But mainly it's because he let you avoid answering my question.
Please prove to me that not every automorphism is inner.
we just divide out what may cause automorphism to be non-inner.
That's not really a proof.
You seem to be avoiding concrete examples. Please give me an example of a group and an automorphism of that group that is not inner. This is the best way to answer my question.
?
That's a group, please give me a non-inner automorphism of this group.
By the way, I prefer good answers to quick answers.
I'd be perfectly happy if you spend an hour or a day or a week thinking about groups and come back with an example of a non-inner automorphism.
I'm not interested in speed.
with seems to me to be non-inner, but it is not finite.
Why is that automorphism non-inner? (People say "outer".)
I don't care if the group is finite.
no integer will do for all natural numbers to yield their opposite. Again quick and not good ?
It's okay, not great.
There's something about the group that makes it obvious that the identity automorphism is the only inner automorphism of this group. What is it?
torsion-less ?
You're just randomly guessing. I urge you to think until you are sure you have the right answer. I don't care if it takes time. It's good to practice figuring things out and being sure about them.
The great thing about math is that you can think and think until you figure something out, just by thinking. This is not true of most subjects.
Thank you for your advice. I'm never sure whatever I do or say, though. Are you sure that ZFC is consistent ?
No, but I'm sure that there's no proof within ZFC that ZFC is consistent, because I took two courses where we went through the proof of Goedel's theorem. The second one, taught by Kripke, was extremely detailed.
We had lots of long homeworks.
There might be a proof that ZFC is consistent from ZFC. Can you guess when ?
When it's not.
Right!
Anyway, the question I'm asking you now is simpler than the consistency of ZFC.
What property of makes it obvious that the identity automorphism is the only inner automorphism of this group?
Take your time.
If you answer this correctly, you'll know other groups for which the identity automorphism is the only inner automorphism.
And then you can find some more groups that have outer automorphisms.
For for an automorphism to be inner we need that for some integer which is not possible.
You said "an" automorphism.
But I think you mean for the automorphism of sending 1 to -1 (and thus -1 to 1) to be inner we'd need . That's true.
So, here's what I'm asking you again:
John Baez said:
What property of makes it obvious that the identity automorphism is the only inner automorphism of this group?
commutativity
Yes!!!
Great!
So, tell me some finite groups whose only inner automorphism is the identity.
Why?
it is not commutative ?
I said:
What property of makes it obvious that the identity automorphism is the only inner automorphism of this group?
And you said:
commutativitity
And I said:
So, tell me some finite groups whose only inner automorphism is the identity.
And for some mysterious reason you gave me a noncommutative group.
This is an example of why it pays to think carefully before answering my questions. Don't just type the first answer that comes to mind.
Check to see if it's right.
I still got stuck why my answer we would need is not correct? We need this for all so taking we get something obviously false.
I don't understand this.
I think you're confused about something. I think to straighten out your thinking you should prove this for me:
Theorem. If a group is commutative, every inner automorphism of that group is the identity.
because by conjugation with any element we get hence the inner automorphism is an identity .
Okay, good. Now back to my earlier question:
So, tell me some finite groups whose only inner automorphism is the identity.
is incorrect, unless I'm very very confused.
Not you, me.
Okay. Yes, I think has about 5 inner automorphisms that aren't the identity.
So, tell me some finite groups whose only inner automorphism is the identity.
so my guess is
That's one example. How many automorphisms does this group have, by the way?
2
Name them.
That is, say what they do.
transposition and identity
I agree that the identity automorphism is an automorphism of . Explain the other automorphism of . What does it do, exactly?
switches 1 and 2, the 2 elements of .
So you can have an automorphism of a group that doesn't map the identity element to itself?
yes
Hmm, I thought an automorphism of a group preserved multiplication.
Here's the definition of automorphism of a group: it's an invertible map from a group to itself that preserves multiplication in the group.
Can you see why any automorphism of a group must map the identity element to itself?
because it is a homomorphism
so the transposition is not an automorphism right ?
I don't know. Make up your mind!
Here's the answer I wanted to my last question:
Proof that any automorphism of a group, say must preserve the identity.
It preserves multiplication by definition: . So, . But is onto so can be any element of the group. So, for all . So, must equal 1, since a group can only have one identity element.
If a group had two identity elements, say and , we'd have
So, tell me truthfully this time, and make 100% sure before you answer: how many automorphisms does the group have?
I cannot fulfill your query. My guess is "one" but it is still a guess.
But it is quite a strong belief.
because must be for to be bijective. Hence .
May I have a question: why didn't you just multiply as for some ? I just wonder whether this will be correct as the other way.
I was trying to prove that if is a bijection that preserves multiplication it must also have .
Your calculation
seems to assume when you make the step . How do you know if you don't know ?
Jan Pax said:
I cannot fulfill your query. My guess is "one" but it is still a guess.
You don't need to guess. You can list all the bijections from to - there are not very many - and then determine which ones are automorphisms. Take your time!
We have only 2 bijections from to : one is identity which is an automorphism and the second one doesn't preserve 1.So there is only one automorphism..
Also, why have you denied my saying that is not an inner automorphism in Z by this fact: for no integer we have
?
This is by which you say holds for all and multiplied by from the right. You do not need 1=1'.
Jan Pax said:
We have only 2 bijections from to : one is identity which is an automorphism and the second one doesn't preserve 1.So there is only one automorphism.
Good! Correct. So the group has just one automorphism, the identity.
Jan Pax said:
Also, why have you denied my saying that is not an inner automorphism in Z by this fact: for no integer we have
?
I didn't deny it. I already agreed that this is a proof that is not an inner automorphism of . It's a perfectly fine proof.
My next question was: what property of the group makes it obvious that the only inner automorphism of is the identity?
And you answered:
commutativity
And that's correct.
And then my next question was this:
So, tell me some finite groups whose only inner automorphism is the identity.
And you answered
which is false.
So I'm still waiting for you to give me a lot of finite groups whose only inner automorphism is the identity. Take your time: I'd rather have a correct answer than a quick answer.
And when you've done that, I will ask you to find the smallest finite group that has an outer automorphism - that is, an automorphism that's not inner. That's where I'm going with all this.
any commutative group has as only inner automorphism the identity.
Okay, good. Now answer my question: give me a lot of finite groups whose only inner automorphism is the identity. I want specific examples.
You seem to think math is about general concepts, but it's also about getting to know specific examples.
So I want a kind of list of finite groups whose only inner automorphism is the identity.
you want me to give you examples of finite abelian gorups, like cyclic ones ?
I think my question was perfectly clear.
my answer is but that doesn't suffice to you ? Abelian and infinite number of them.
I have a few more, any direct product of cyclic is abelian.
Excellent, now you're giving me lots of specific examples of finite groups whose only inner automorphism is the identity.
So now you're ready to tackle my next question: what is the smallest finite group with an outer automorphism: an automorphism that's not inner?
I'm surprised that we have moved from category theory to group theory.
What about alternating groups, if symmetric do not work ?
subgroups of permutations in of even parity
Jan Pax said:
I'm surprised that we have moved from category theory to group theory.
Groups are categories. I'm trying to lead up to some questions about 2-categories that can use the 2-category of groups as an example. You've learned that the concept of "inner automorphism" is a 2-categorical concept: an automorphism of a group is inner iff there's a 2-morphism between it and the identity automorphism.
By the way, you seem to be randomly guessing answers to the next question, instead of using all the previous information I taught you. My questions aren't random; each one is supposed to build on the previous ones.
So it should be possible now for you to find the smallest group with an outer automorphism and prove your answer is correct.
(An answer without a proof is not worth much.)
Another try. Let be the 3 element alternating group .Conjugation with an odd parity element of gives an outer automorphism which switches the 2 non-identity elements of . It is outer, since all conjugations with elements of gives the 1 (identity, no switch).Checked by computation on one A4 paper with the hope of no mistakes.
This is interesting. What's another name for the 3 element alternating group?
(You keep not using the hints from the earlier exercises.)
Hint:
Jan Pax said:
my answer is but that doesn't suffice to you ? Abelian and infinite number of them.
I'm not aware of any special name for , but once said, I'll remember. Also I'm sometimes confused by your 'hints': are abelian hence the only automorphisms are inner ones but here I'm supposed to come up with non-inner one (outer). What's wrong ?
You're mixed up.
1) You didn't prove that for abelian groups all automorphisms are inner. What you proved was almost the opposite of this. Review what you did.
2) is one of the groups that we were talking about!
I'm afraid of saying anything now. may be ? For outer some will do ? For commutative inner automorphisms are trivial but the rest of automorphisms are outer. This type of confusion I've made is a general patern for my reasoning: I often mix up opposite things.
Jan Pax said:
I'm afraid of saying anything now.
Good! Just think, and write things down on paper, until you're fairly sure of your answers. Learning to check your work is an important of learning math, so I'm trying to teach you to check your work before answering.
For commutative inner automorphisms are trivial but the rest of automorphisms are outer.
Right.
This type of confusion I've made is a general pattern for my reasoning: I often mix up opposite things.
Part of getting good at math is learning how you tend to make mistakes, so it's very good that you realize you have this pattern. When you might mix up opposite things, you can spend an extra minute or two checking.
For example, I often mix up left and right, so I can easily mix up left and right adjoints unless I think about them conceptually, as "free" and "underlying" rather than the more arbitrary-sounding "left" and "right". When I'm afraid I'm about to make a mistake like this, I write some stuff down on paper and try to make sure I get things right.
may be ?
I think you need to learn your small groups. Here are some questions:
How many 1-element groups are there, up to isomorphism? What are they?
How many 2-element groups are there, up to isomorphism? What are they?
How many 3-element groups are there, up to isomorphism? What are they?
How many 4-element groups are there, up to isomorphism? What are they?
How many 5-element groups are there, up to isomorphism? What are they?
How many 6-element groups are there, up to isomorphism? What are they?
These small groups are all very famous and important.
This is good from you that you can help on this level (how do I tend to make mistakes), and don't just give up with me.
I'm used to read pretty abstract difficult papers and I do even find mistakes in them.But at the same time I can claim a total non-sense.
Anyway, you are right that is the smallest group with a nontrivial outer automorphism. But it's easier to see this if you know , or just forget about and think about .
You noticed that has a nontrivial outer automorphism sending to . So, I wanted you to notice that also has an automorphism sending to . If this is nontrivial it must be outer - since you know that for an abelian group all nontrivial automorphisms are outer.
For the automorphism sending to is nontrivial. For and this automorphism is trivial.
Anyway, I think you'll be a better category theorist if you know a few groups. So please answer these. Take your time and answer correctly.
How many 1-element groups are there, up to isomorphism? What are they?
How many 2-element groups are there, up to isomorphism? What are they?
How many 3-element groups are there, up to isomorphism? What are they?
How many 4-element groups are there, up to isomorphism? What are they?
How many 5-element groups are there, up to isomorphism? What are they?
How many 6-element groups are there, up to isomorphism? What are they?
It is really easier to read than to think and write.
It's easier to read because nobody notices your mistakes when you read. :upside_down:
Unless I accept something wrong.
Yes, you may catch your own misunderstandings.
But you're right: it's really important to make the transition from absorbing the math other people have created, to creating your own.
I'm afraid that with this pace of mine I'll be for ever just reading without ever publishing. Not that bad, some will not even read.
Well, I don't know your situation and your goals, but creating your own math doesn't require publishing. I started doing math by just coming up with results and writing them down. I have a lot of friends who do math and blog about it.
An academic career requires either a lot of teaching, or publishing, or both... but I know a lot of mathematicians, including some very good ones, who do a lot of teaching and very little publishing.
My situation allows me to do whatever I wish to. I just read math papers and contemplate on them.
Okay, then you're in luck! If you want to start creating your own math, you can do so without feeling under pressure.
Most of my grad students feel they need to "crank out papers" if they want to get a research job.
May I try to answer your question on finite groups? For primes 2,3,5 there is just one cyclic group of that order. For 4 there are 2, and and for 6 and .
Okay. You seem to have answered a different question than the one I asked. Read my question, and your answer, and you'll see what I mean.
Did you carefully check to see what my question was before writing down your answer?
I have given the finite groups of orders 2,3,4,5 and 6. I'm eager to see what's wrong this time.
I can see now
number 6 has a problem
I asked how many groups there were. You told me there's one cyclic group of orders 2, 3, and 5, and two of order 4...one of which is not really cyclic.
I just want to know how many finite groups there are of each order, I wasn't asking anything about cyclic groups.
So, it's good to practice answering the question asked, without introducing distractions.
This is just a form of practicing how to think clearly.
Anyway, you manage to list all the finite groups of orders 2,3,4, and 5 (up to isomorphism). But you only listed abelian ones, and at some point there will be nonabelian groups too.
I just thought that there is a non abelian group of order 6 but I gave 2 abelian? am I roughly correct with this ?
I've said cyclic just because I silently assume that all finite groups with prime orders are cyclic by some theorem? But of course I'll take care of your correction about introducing notions to questions.
Yes, all groups of prime order are cyclic.
So the only problem is to find that exotic non abelian 6 order group.
There could be more than one.
People who study groups only up to order 6 call nonabelian groups "exotic". :upside_down:
I have one, it is but I expect having said something wrong :-)
Is a 6-element group?
I think it is but nothing comes as a surprise to me today.
Yeah, I think there are permutations of an -element set and 3! = 6.
Is abelian or not?
it is not I'd bet on
Why not?
Prove it.
there are two cleverly chosen permutations whose composition is not the same
I see you need a proof
let be and . , .
Great!
So is nonabelian, so it cannot be isomorphic to or .
By the way, why are and non-isomorphic?
Right, but knowing there is no other which I think it is the case seem hopeless without some theorem.
one has 1 generator and the other 2
But in fact both groups have 6 generators: we can take every element of a group to be a generator!
what about minimal set of generators ?
That's more interesting. So what's your claim, exactly?
every minimal set of generators is 1 element in the first case while 2 in the second. If there were an isomorphism then....
these sets would be in bijection
One of the things you just said is false. It's probably something you didn't check.
You are again failing to check your work before speaking.
would have the same cardinality not necessarily bijective by the isomorphism?
I'm still too used to my intuition which works fine while reading only and in fact this intuition is what allows me to absorb the amount of data we have just exchanged. So I cannot just abandon it.
I don't know what "would have the same cardinality not necessarily bijective by the isomorphism?" means - the grammar is strange. But the mistake was somewhere else, and it's a serious mistake.
I'm not telling you to abandon your intuition. I'm telling you to check claims before stating them to me, so that the fraction of times you correctly answer my questions increases.
Intuition is the starting-point of thinking, but not the end.
So I'm still not at the end of my thinking.
Right. But please finish your thinking before you answer my questions. Everything goes much slower if you rush.
Something here is false:
every minimal set of generators is 1 element in the first case while 2 in the second. If there were an isomorphism then these sets would be in bijection
Is it the number 2 there ?
I'll wait until you find the mistake and correct it. This is not a guessing game.
generates .
so after all.
Okay, great!
Yeah, if and are relatively prime then .
So what do you know about this question?
Note, I'm not asking you what you guess. I'm asking you what you know, so far.
there are at least 2
Distinguishing between what you know and what you guess is important in math.
Just to be sure: why do you know ?
one is commutative and the other not
Okay, good. Now, do you know about "dihedral groups"?
no
Oh, those are some other important finite groups.
The symmetry group of a regular n-gon, counting rotations and reflections, is often called . It has 2n elements.
So for example the symmetry group of the square is called , and it has 8 elements.
You should be glad I didn't ask you about 8-element groups, since there are quite a few:
and one more, which is the most interesting of all.
quaternions ?
Yes, it's called the quaternion group.
It's strange you've heard of that one but not the easier dihedral groups!
Groups whose order is a power of 2 are extremely numerous. There are almost 50 billion groups of order 1024 = , and over 99% of groups of order < 1024 have order exactly 1024.
Anyway, here's my next question: is the dihedral group isomorphic to one of the other two 6-element groups we've seen, or not?
I cannot answer today.
That's okay! Just to help you a tiny bit: is the symmetry group of an equilateral triangle, including rotations and reflections.
John Baez said:
The symmetry group of a regular n-gon, counting rotations and reflections, is often called . It has 2n elements.
I was taught (originally by Julia Goedecke) the convention , to maintain the convention that subscripts tell you the order of the groups. Of course, extending this convention to symmetric groups would make the notation cumbersome rather quickly...
I suppose you could write ''.
My guess is that is since it has 6 elements and is non-commutative: there are 2 reflections which do not commute. If there is no other non-commutative group of order 6 besides then this is it.
I could write the Cayley tables for and and find the isomorphism but it would be tedious.
You should be able to see an isomorphism by looking at their definitions. is the group of symmetries of a triangle, and is the group of permutations of a three element set.
That's a nice observation. So label the vertices by the elements of the three element set and assign the symmetry to the permutation.I was wrong. Even for this fails. has 8 elements but 24 If I'm not creating another typo by this then switching adjacent vertices and keeping the other 2 is not a symmetry.
Right. In fact does give you the symmetries of a regular tetrahedron, since there you can use symmetries to rearrange the vertices however you like.
What for higher 's ?
The symmetries of the regular simplex with vertices in dimensional space are given by .
Oscar Cunningham said:
You should be able to see an isomorphism by looking at their definitions. is the group of symmetries of a triangle, and is the group of permutations of a three element set.
Good! because symmetries of an equilateral triangle give permutations of its set of vertices and vice versa.
So, I was trying to see if I could trick you into believing in the existence of a third group of order 6, but there are just two (up to isomorphism). One is
while the other is
I will not force you to prove that there are just two!
There's just one 7-element group, , since 7 is prime.
I mentioned that there are five 8-element groups:
I think there are just two 9-element groups:
(these should remind you of the two 4-element groups).
I think there are just two 10-element groups:
(a product of two distinct primes always works this way).
There's just one 11-element group:
So, 12-element groups are the first case that makes you really think hard, after the 8-element groups.
But there aren't really many. So the first really hard case is 16-element groups; as I said, powers of 2 are really difficult (and so are powers of 3, etc.).
And if you cheat and look it up, you'll see there are 14 different 16-element groups!
In case you want to cheat more, GroupNames is an amazing resource.
I was linking to GroupProps, which is also an amazing resource. Should they join forces and cooperate, or is it good to have some competition among wikis about finite groups? :thinking:
Okay, now let me pose another question to @Jan Pax.
We have been talking about some 2-categories:
By full I mean that we include all the 1-morphisms between the chosen objects (namely groups), and by 2-full I mean that we also include all the 2-morphisms between those 1-morphisms.
We have also implicitly been talking about another 2-category:
So here's my question:
Describe the 2-morphisms in AbGp as precisely and simply as possible.
You may start with the definition, and then think about it and simplify it.
John Baez said:
I was linking to GroupProps, which is also an amazing resource. Should they join forces and cooperate, or is it good to have some competition among wikis about finite groups? :thinking:
Yes I noticed. That's why I linked to GroupNames. GroupProps is pretty good but it's less organised than GroupNames so it may be more difficult to find what you want.
GroupProps has lots of pages on properties of finite groups... I don't know if GroupNames does that too.
I have one more basic question on the notation yet,before I answer your question on AbGp : in a group as a one object category, the morphisms between the one object i.e. the elements of the group are called 0-cells or 1-cells ?
1-cells. The 0-cells are the objects.
Which is just the unique one in this case.
So do I understand it well that natural transformations between functors and are 3-cells ? Is this called 2-category or 3-category ?
A group is only a 1-category. There are no 2-cells in a group - only in the category of groups which is a sub-2-category of the 2-category of categories.
In Ab the natural transformations from with are all elements in and for there is no natural transformation from to .
Fawzi's answers are correct. A group is a category with one object with all its morphisms invertible. As such Grp becomes a sub-2-category of Cat, as follows:
John Baez said:
- Cat, which is the 2-category of categories, functors and natural transformations
- Grp, which is the "full and 2-full" sub-2-category of Cat where the objects are categories that are just groups.
am I again wrong with my answer ? I ask this because I do not see the connection of @John Baez comment with my answer,is there any? I understand that @Fawzi Hreiki is correct. I meant that and are groups-the one object categories, are functors between them and I tried to investigate the natural transformations from to .
If on a morphism then for no n.t. (i.e. an elmenet of ) is by commutativity of .
am I again wrong with my answer ?
I didn't see you try to answer the question until just now.
I just saw your attempts to clarify the question.
Now I see your answer:
Jan Pax said:
In Ab the natural transformations from with are all elements in and for there is no natural transformation from to .
Yes, that's right!
Okay, I declare this class finished. :+1:
If I've made less mistakes you would continue, right ? So shall we meet in October after several months of rest ? It was of a great value to me for start to think, anyway. Thank you.
I'm sorry, I don't feel like doing this any more - it was fun but exhausting. I hope you practice solving lots of problems, e.g. exercises in textbooks. That's a good way to see how well you understand what you're reading.
For example, Borceux's Handbook of Categorical Algebra is 3 volumes, and it covers a lot of category theory, and it has exercises.
Please, how can I print the entire history of this page say, on my printer ? I have the Firefox browser but ctrl+P
prints only the first page. Is there something like zulipchat meta
for this my question ?
https://categorytheory.zulipchat.com/#narrow/stream/229122-general.3A-meta
Morgan Rogers (he/him) said:
Once they've answered, I have a potentially interesting observation to make about this 2-category.
I had some thoughts too. Interested to see if we're thinking along the same lines.
Ah, yes, I forgot to follow up on this.
My comment is that from any (discrete) group you can build its category of right -sets (I choose the convention of right actions because it coincides with taking presheaves). The resulting categories are Grothendieck toposes; we can actually characterize them as the atomic toposes having a surjective essential point.
Given a group homomorphism , we can construct an essential geometric morphism (adjoint triple of functors) whose inverse image functor (the middle functor in the adjoint triple) is the functor consisting of restriction of an action along . It turns out that all geometric morphisms between these toposes are of this form!
Given a conjugation (natural transformation) between group homomorphisms, we get a natural transformation in the opposite direction between the inverse image functors of the corresponding geometric morphisms.
Altogether, the above mean that, up to reversing the direction of the 2-morphisms, the 2-category of groups is (2-)equivalent to the 2-category of atomic toposes having a surjective essential point.
This 2-equivalence can be put to work in both directions, since at the topos level we can use other toposes to help us understand these ones better, and transfer that understanding down to the groups, and conversely it can make constructions involving these toposes easier, especially combined with the observation that they are coreflective in the 2-category of pointed toposes.
It also means that any property of groups which can be expressed (2-)categorically automatically becomes a property of the corresponding topos, an idea which @Jens Hemelaer and I have only just started exploring in the wider context of monoids (where things become a little more subtle)
Neat! This is a very geometric way of looking at things, whereas I was thinking more algebraically.
The forgetful functor is represented by the group . So for this -category of groups we could look at the functor as a sort of 'underlying groupoid' functor. It sends a group to its groupoid of elements, and conjugations between them. So an isomorphism class of this groupoid is a conjugacy class.
So this gives a weird new perspective on groups, in which the 'elements' of a group are the conjugacy classes. I wondered if this could be made into a genuine algebraic theory. In particular, whether this functor was a right adjoint. But I'm pretty sure it isn't, because if it had a left adjoint and we let be the groupoid with two inequivalent objects, what would be? It would have to be a group such that conjugacy classes of maps out of that group correspond to pairs of conjugacy classes of elements of the target. I can't see any such beast.
But then it occurred to me that while the functor isn't a right adjoint, the functor really is a right adjoint when seen as a funtor . It's left adjoint is just . This is the tensor-hom adjunction.
This therefore gives us a way to see groups as Eilenberg-Moore algebras of the monad . I looked this up and found that over the algebras of are called -mnemoids. Therefore we have a way to view groups as --mnemoids, which is an excellent piece of technobabble.
But I don't yet understand mnemoids very well in general, or --mnemoids in particular. So that's about as far as I got.
What if you consider pointed groupoids? That is, groupoids equipped with a functor from the trivial groupoid? Does that fix anything, since you can always forget (or trivialize) the components disjoint from the pointed one to recover a group?
Interesting thought. I think it's normally natural when considering pointed groupoids to say that the functors between them have to preserve the point, and the natural transformations between functors have to be the identity at the point. (If you do this then you can define the usual -category of groups as the pointed groupoids with one object.) But here we have to forget the second criterion otherwise we won't get a functor from .
So I think you're saying we should look at if the functor is a right adjoint.
We could look at the pointed groupoid with inequivalent objects and no nontrivial morphisms (where now one of those objects is the point) and ask what would be. A functor from to the 'underlying groupoid' of a group, is a list of conjugacy classes of the group where the one corresponding to the point has to be the conjugacy class of the identity. So when we could take , and when we could take , but I think we get stuck in the same way as we did before when .
Morgan Rogers (he/him) said:
Ah, yes, I forgot to follow up on this.
My comment is that from any (discrete) group you can build its category of right -sets (I choose the convention of right actions because it coincides with taking presheaves). The resulting categories are Grothendieck toposes; we can actually characterize them as the atomic toposes having a surjective essential point.
What's a "surjective essential point"? The group itself being a -set, we get a geometric morphism , i.e. a "point". And this is an essential geometric morphism; I guess that's why you're calling it an "essential point". If I'm right so far, I just need to know precisely how it's "surjective". And I'll bet this has something to do with how every -set is a colimit of representables, which are just copies of itself.
(I'm very bad at understanding the different adjectives people stick in front of "geometric morphism", but I want to get better.)
Surjective just means that the inverse image is faithful.
(This is really in the opposite direction since maps of toposes are reversed, like how a sublocale is actually a quotient frame and vice versa)
Thanks. So my guess was wrong; this sort of surjectivity is more about morphisms than objects.
A geometric morphism with faithful inverse image is called a surjection for a few reasons. The original one is that if we take the image factorization of a continuous map, this will correspond to the surjection-inclusion factorization of the corresponding geometric morphism. But for me a better justification is that a geometric morphism is a surjection if and only if its inverse image functor is comonadic; this means that the can be completely recovered from some data on , and while that data doesn't take the form of an equivalence relation, it still somehow carries the intuition that is "covered" by .
Thanks! I think I need to start by seeing how properties of maps between topological spaces translate into properties of geometric morphisms between their sheaf topoi.