Preprint  The RAAG Functor as a Categorical Embedding
05 Oct 2023  Tags: mypreprints
After almost a year of sitting on my hard drive, I finally had time in August to finish revising my new preprint on Right Angled Artin Groups (Raags). And in September I had time to put it on the arxiv for people to see! Within 24 hours I had an email from somebody who had read it, and was interested in reading it closely! It’s super exciting to see that people are actually reading something I wrote, and it’s really validating to feel like the math I did last year was worth it ^_^. In this post, I’d love to give a quick informal description of what’s going on in that paper.
First, what’s a right angled artin group? We’ve actually talked about them before in the second ever post on this blog (!) but here’s a quick tl;dr.
Fix a (simple, undirected) graph $\Gamma$ with underlying vertex set $V$.
The Right Angled Artin Group $A\Gamma$ is the group
\[\langle v \in V \mid [v_1, v_2] \text{ for } \{v_1, v_2\} \in \Gamma \rangle\]freely generated by the vertices, where two vertices commute if and only if they’re adjacent in $\Gamma$.
For example, in case $\Gamma$ is a complete graph on $n$ vertices, $A\Gamma$ is a free abelian group of rank $n$. If $\Gamma$ has no edges, then $A \Gamma$ is a free group of rank $n$. As a quick exercise, can you convince yourself that for $\Gamma$ as below, we have $A \Gamma \cong F_2 \times F_2$ is a direct product of free groups?
Now, it’s not hard to see that the right angle artin group construction $A$ is actually a functor $A : \mathsf{Gph} \to \mathsf{Grp}$ from the category of graphs to the category of groups. After all, if $\varphi : \Gamma \to \Delta$ is a graph homomorphism^{1} then we get a group homomorphism $A \varphi : A \Gamma \to A \Delta$ given by sending each generator $v \in A \Gamma$ to the generator $\varphi v \in A \Delta$.
Moreover, $A : \mathsf{Gph} \to \mathsf{Grp}$ admits a right adjoint! This makes precise the idea that the raag on $\Gamma$ is a kind of “free group” associated to $\Gamma$. Given a group $G$, we define its Commutation Graph $CG$ to be the graph^{2} whose vertices are elements of $G$ where ${g_1, g_2} \in CG$ is an edge if and only if $g_1$ and $g_2$ commuted in $G$.
This allows us to bring much more powerful category theory to the table. In particular, it lets us use the machinery of comonadic descent to characterize the essential image of $A$. That is, to understand which groups are raags, and to understand which homomorphisms between raags are $A \varphi$ for some graph homomorphism! In fact, we show that $A$ is a categorical embedding, so that $\mathsf{Gph}$ is a (nonfull) subcategory of $\mathsf{Grp}$!
Moreover, the characterization is something we can really calculate with!
The main theorem of the paper states that there is a coalgebra structure we can put on groups so that
 The coalgebra structures on a group $G$ are in bijection with the graphs $\Gamma$ so that $G \cong A\Gamma$
 A homomorphism $f : G \to H$ respects this coalgebra structure if and only if $f = A \varphi$ for a graph homomorphism.
In particular, the raags are exactly the groups admitting such a coalgebra structure.
One thing that I wish more mathematicians would talk about is the kind of meandering nature of research. When you see a paper written in defnitiontheoremproof style, it’s hard to imagine what the discovery process must have looked like. It’s almost always much messier than the final paper would lead you to believe, so I want to take a minute to talk about the history of this paper.
Why was I thinking about all this?
There’s an important open question in the theory of raags about the “nonstandard” embeddings between two raags.
Obviously if $\Gamma$ is a (full) subgraph of $\Delta$, then $A\Gamma$ is a subgroup of $A \Delta$ in a canonical way. But it turns out we can have pairs so that $A \Gamma$ embeds into $A \Delta$, but $\Gamma$ is not a subgraph of $\Delta$! Motivated by questions in geometric group theory, it’s natural to want to understand when these “nonstandard” embeddings are possible.
Now the adjunction comes into play. If we have an embedding $A \Gamma \to A \Delta$, then our adjunction gives us a map of graphs $\Gamma \to CA \Delta$. Since $CA : \mathsf{Gph} \to \mathsf{Gph}$ is a monad on the category of graphs, we (not very creatively) call this construction the Monad Graph of $\Delta$.
It would be nice to have a combinatorial characterization of when a map $\Gamma \to CA \Delta$ transposes to an embedding $A \Gamma \to A \Delta$. But such a characterization is as yet unknown^{3}.
I actually had most of these thoughts back in 2020 when I was first thinking about raags, but they didn’t really go anywhere. Especially since I was focused on life things like passing my quals and finding an advisor. But that all changed in 2022 when I started really trying to understand stacks…
One way to understand stacks^{4} is as “categories satisfying descent”. In the same way that a sheaf on $X$ assigns a set to each open in a way that elements of the set glue along open covers, a stack on $X$ assigns a category to each open in a way that objects and arrows of the category glue along open covers!
This story is closely tied up with the story of descent theory, so I took a detour through understanding that^{5}. Along the way I found out about comonadic descent which (among other things) lets you characterize the image of a left adjoint. I remembered this raags adjunction that I worked on, and knew that its image was pretty easy to understand. Maybe the adjunction was comonadic and I could use this to attack the nonstandard embedding problem!
Once I knew the right question to ask, the proof itself was surprisingly simple, and I had a rough draft within a day or two^{6}.
Next came the process of writing everything up in a way that doesn’t require a ton of category theoretic background. Working out the exposition for the paper was super enlightening for me^{7}. Hopefully it also makes it more accessible for people new to the subject!
Ok, with the history out of the way, let’s talk about
What’s in the paper
This is pretty quick to outline, since I’m assuming a category theory background of my blog readers that I wasn’t assuming of my paper readers. That said, if it ever gets too heavy, feel free to read the first few sections of the paper, since I go into much more detail there.
The main result is implied by the categorical statement that the adjunction $A \dashv C$ is Comonadic. This says that $\mathsf{Gph}$ is equivalent to the category of $AC$coalgebras on $\mathsf{Grp}$, and moreover that the equivalence intertwice the adjunctions $A \dashv C$ (on the $\mathsf{Gph}$ side) and the cofree/forgetful adjunction (on the $\mathsf{Grp}_{AC}$ side).
That is, we have a situation as below:
Really the equivalence $A$ sends a graph $\Gamma$ to the group $A\Gamma$ with the coalgebra structure $A \eta_\Gamma : A \Gamma \to ACA \Gamma$, so that after forgetting this structure we get $A : \mathsf{Gph} \to \mathsf{Grp}$.
How do we show that this really is an equivalence? The answer is Beck’s (Co)monadicity Theorem! It says that for any adjunction $A \dashv C$ the base of that triangle is an equivalence if and only if $A$ reflects isomorphisms and preserves equalizers of “$A$split parallel pairs”.
In the paper we use a different version of the comonadicity theorem which is easier to check, but it boils down to the same proof.
It’s “well known” in raag circles that $A$ is conservative (this can already be found in a 1987 paper of Droms), so we need to check that $A$ preserves certain equalizers. We can do this with a slightly technical argument of combinatorics on words. The key fact is that we have a good understanding of normal forms for the elements in $A\Gamma$^{8}.
The last section of this paper was a small application of this machinery. We’re able to reprove a result that we can effectively recover $\Gamma$ from the isomorphism type of $G \cong A \Gamma$, as long as we’re promised that $G$ really is a raag^{9}. We also show that if we have any concrete examples of groups $G$ with $AC$coalgebra structures, we can really do all the computations that we would want to do!
I think I like this format of blog posts putting more emphasis on the things that were on my mind when I was working on a paper, rather than the contents of the paper itself. Maybe if I write a more detailed paper I can say some informal words about what’s in it, but I think the historical perspective might help younger mathematicians see how messy research can be, and how incidental things can all blend together into a result. I just happened to be thinking about raags a few years before I happened to learn about stacks and descent, which opened the door to a result on descent for raags. Hopefully you all also like the historical perspective ^_^.
I’m also going to try to keep these paper announcement posts a bit less polished. It’s easy to get paralysis and revise posts forever and never finish them (ask me how I know…) I want to make sure that these actually get out, so I’ll try to keep them light on the revision. That shouldn’t be hard if the main point is the history!
Anyways, thanks for hanging out, all. I’m super excited to have a result, and I’ll be submitting to journals in the near future. Stay warm, and we’ll talk soon ^_^.

In the sense that $\varphi : V \to W$ is a function on the underlying vertices preserving the edge relation. So ${v_1, v_2} \in \Gamma$ implies ${ \varphi v_1, \varphi v_2 } \in \Delta$. ↩

In order to make this an honest adjunction, we need to require every vertex of our graph have a self loop. That is, we actually work with reflexive simple undirected graphs. This is a kind of technical point, since if every vertex has a self loop we don’t need to draw them! So the combinatorics remains basically unchanged. ↩

There’s reason to suspect this is a good idea, though! Not only is it categorytheoretically natural, but (as far as I know) the best characterization of raag embeddings we have is due to Kim and Koberda, which shows that whenever $\Gamma$ embeds into their extension graph $\Delta^e$ that $A\Gamma$ embeds into $A\Delta$. The interesting relationship is that $\Delta^e$ is the full subgraph of $CA\Delta$ on the conjugates of the generators!
In fact, Kim and Koberda conjectured that the converse is true too, so that $\Delta^e$ is the right graph to consider to understand the nonstandard embeddings, but this was disproven in a 2013 paper of CasalsRuiz, Duncan, and Kazachov. (Many thanks to CarlFredrik NybergBrodda for telling me about this)
This is actually good news for my paper, since it means that we’ll want to understand more of the monad graph in order to better understand the embeddings, instead of being satisfied understanding a subgraph. ↩

And there are many! I want to write a blog post about them sometime soon. ↩

I was especially drawn to this because I learned that descent is closely related to monads. Even though objectively I’m very comfortable with monads nowadays, deep inside me there’s still a teenage programmer fascinated and confused by monads while learning haskell. It’s kind of wild to think that almost 10 years ago haskell launched me on my category theory journey. It’s even wilder to think of how far I’ve come since then! ↩

I once heard some advice that once you’ve climbed a high mathematical mountain (like geting some comfort with descent theory) it’s worth looking around to see if there’s anything else to do while you’re up there.
This led me to another question about understanding which essentially algebraic theories are secretly algebraic. This amounts to understanding the image of the left (2)adjoint from finite product categories to finite limit categories.
I was actually able to work this out as well during CT2023, but unfortunately I learned while writing it up that Pedicciho and Wood had published the same result in ‘99. I was sad, of course, but I learned a TON while working on that project, about essentailly algebraic theories, locally finitely presentable categories, 2categories, and lots more! That’s actually coming in super handy with my thesis project, since locally presentable categories are the target for factorization homology!
Again, research is a messy and winding road. ↩

For much the same reason that writing these blog posts is often good for me! Teaching is a great way to learn, and to make sure you really understand a subject. ↩

In fact, in multiple of these comonadicity proofs I’ve done, the key to checking this equalizer condition is an understanding of normal forms for the free objects!
This is yet another reason that the search for “normal form” theorems for various algebras is an incredibly useful pursuit! ↩

Determining whether or not a group $G$ is a raag, without being promised that it is one, is undecidable. ↩