Internal Group Actions as Enriched Functors
18 Feb 2024 - Tags: featured
Earlier today this month on the Category Theory Zulip, Bernd Losert asked an
extremely natural question about how we might study topological group
actions via the functorial approach beloved by category theorists.
The usual story is to treat a group
I wouldn’t be writing this post if the answer were “no”, so let’s get into it! This is a great case study in the ideas behind both internalization and enrichment, and I think it’ll make a great learning tool for future mathematicians wondering why you might care about such things.
Hopefully people find this helpful ^_^.
(Also, I’m especially sorry for the wait on this one, since I know at least one person has been waiting on it for two weeks now! Life got busy, but I’m excited to finally get this posted.)
First, let’s take a second to talk about Internalization.
The idea here is to take a construction that’s usually defined for sets, and
interpret it inside some other category. For instance, a group
- a set
- a function
(the multiplication) - a function
(the inversion) - a function
(the unit)
satisfying some axioms.
We can internalize this definition into the category
- a topological space
- a continuous function
- a continuous function
- a continuous function
satisfying the usual axioms. This recovers the usual definition of a topological group.
Similarly we could ask for a manifold
- a
-object - a
-arrow - a
-arrow - a
-arrow
satisfying the usual axioms1.
As a quick aside, notice the crucial use of the terminal object
Now just like we can internalize a group object, we can also internalize a
group action! If
So then a group action internal to
Let’s change tack for a second and talk about the other half of the story.
Now we start with a (symmetric) monoidal closed category. Roughly speaking, this is
a category where the set of arrows
For instance, the category of vector spaces
Another example is the category of (nice3) topological spaces. The
set of continuous functions
The fact that these categories can “talk about their own homsets” might make you wonder about other categories with structured homsets.
For instance, there are lots of categories in the wild whose homsets
are vector spaces! If
Similarly, you can ask about categories where each homset is a
topological space. It turns out that these give a fantastic
first-order approximation4 to the theory of
More generally, we can define a
- A set of objects
- For each pair of objects
, a -object - For each triple of objects, a composition map in
, - For each object
, a distinguished element5 - Satisfying the usual axioms.
And what will be relevant for us, a
Note that every (symmetric monoidal closed)
We’ll also need the notion of a
Given two
For example, a
Now we have all the pieces we’ll need to prove
Theorem: Fix a cartesian closed category
There is a natural bijection between group objects
Moreover, for a fixed group object
Note that
Conversely, say we have a one-object
So the data of an enriched
Now, what is a
We have to send
Now we use cartesian closedness! This arrow transposes (uncurries) to
a
Of course, walking backwards through the above discussion shows that an
internal group action
Your category-theorist senses should be tingling after reading the statement of the previous theorem!
Sure there’s a bijection of group/group actions, but what about the arrows!?
As a cute exercise, prove that this theorem upgrades to an equivalence6 of categories between
and for fixed
Part of the puzzle is how to define some of these notions
(such as “internal
Let’s take a second to meditate on the difference between “internalization”
and “enrichment”. This difference is usually invisible, since for “ordinary”
categories we’re always working both internal to
When you have some gadget and you think
“Gee! I sure wish this gadget automatically had the structure of a
Figuring out exactly how to do this is the purview of much of
categorical logic. We can construct standard ways of interpreting
set theoretic constructions
(such as “
What about enrichment? This is useful when you have an otherwise “normal” category, but your homsets have ~bonus structure~ that you want to respect. For instance, your homsets might be abelian groups, or vector spaces, topological spaces, or chain complexes! Then enriched category theory tells you that, say, yoneda’s lemma still works when you ask that everything in sight respects this ~bonus structure~. This turns out to be the start of an incredibly interesting subject called formal category theory10.
To see how well you understand internal versus enriched things, here’s a cute exercise:
Write out, in some detail, the definition of a category internal to
Both of these concepts are extremely useful in lots of ongoing research in
algebra, logic, and applied category theory!
A category internal to
Ok, this blog post became something much longer than I originally intended (to nobody’s surprise), but let’s have one more cute puzzle before we go.
Another common way group actions get treated is as a group homomoprhism
Again, the answer is yes, but now we need to work with a cartesian closed category with all finite limits.
Given a cartesian closed category with finite limits
Then, once you’ve defined
If you find this exercise hard, maybe that’s incentive to learn some
categorical logic! The category
which we can then cash out for an honest object
Since the usual proof that this set is a group is constructive, we get
for free that any object
Thanks for sticking around! This was a super fun post to write since it touches on a LOT of aspects of “more advanced” category theory that people might struggle with at first. I would normally give more of an outro, but I have some friends coming over in a half hour and I really want to get this posted!
Stay warm, and stay safe, all! We’ll talk soon ^_^
-
Note that the “usual axioms” can all be expressed as equalities between composites of these functions. For instance, the inverse law says that the composite
is the same arrow as
The elementwise definitions in the lower lines are primarily for clarity in showing what these composites “are really doing”, but they can be made precise using the language of “generalized elements”. ↩
-
There turns out to be a deep connection between “algebraic theories” (like groups, rings, etc) and categories with finite products, which I want to write about someday. This is the start of the story of categorical logic, which is near and dear to my heart.
One can view this whole game of “internalization” as a subfield of categorical logic, where we focus in on the things we normally do to sets, and precisely say
- what categories can interpret various set-theoretic constructions
- how to figure out what the “right way” to internalize a given construction is. This turns out to be totally algorithmic!
-
There’s a couple things I could mean by “nice” here. See here for some options, but if pressed I’d probably say compactly generated spaces. Keep in mind that this makes the compact-open topology I linked to incorrect in some edge cases, but morally what I’ve said is right, and I think it’s literally true for compactly generated hausdorff spaces. ↩
-
In fact, every
-category is equivalent (in the appropriate sense) to a category enriched in simplicial sets. See here, for instance.The claim then follows from the fact that the category of simplicial sets (up to homotopy) is equivalent (again, in an appropriate sense) to the category of topological spaces (up to homotopy). ↩
-
Of course, by “element” here I mean a global element. That is, a map from the monoidal unit
. ↩ -
Isomorphism? ↩
-
Ignoring size issues ↩
-
Which for some reason I’m hearing in Tom Mullica’s voice ↩
-
In exactly the same way that, say, gaussian elimination, is routine but annoying. ↩
-
Of course, there’s other more exotic ways to use enriched categories where the hom-objects aren’t structured sets! See, for instance, the famous Lawvere Metric Spaces. These are still extremely interesting, but are of a different flavor to the enriched categories that fit into the story I’m trying to tell. ↩
-
Notice that, in this definition, the
in the existential quantifier is provably unique. This is super important because it means we can make this definition using only finite limits. More complicted existential quantifiers require more structure on our category, namely regularity. For more information see the nlab pages on cartesian logic and regular logic. ↩