A comparison of definitions of equivariant trees

The paper demonstrates that various categories of trees, including the dendroidal category $\Omega$, the category $\Omega^G$ of trees with a $G$-action, and the category of genuine equivariant trees $\Omega_G$, can be modeled as Grothendieck constructions on categories of trees with a fixed set of leaves.

The Gist

Here is an explanation of the paper "A Comparison of Definitions of Equivariant Trees," translated into everyday language using analogies.

The Big Picture: Building with LEGO and Magic Groups

Imagine you are an architect trying to build complex structures using LEGO trees. In the world of mathematics, these "trees" aren't made of wood; they are diagrams that represent how different things (like numbers or shapes) can be combined together. Mathematicians call these Operads.

The paper is about three different ways to organize these LEGO trees, especially when you have a group of friends (a mathematical "Group $G$") who want to play with them together. The authors, Julia, Maxine, David, Angelica, and Maru, are trying to answer a simple question: "Are these three different rulebooks for building these trees actually describing the same thing?"

Their answer is yes, but to prove it, they have to show how to translate between the rulebooks using a specific mathematical tool called a Grothendieck Construction.

---

Part 1: The Basic Tree (The Non-Equivariant Case)

The Concept:
First, the authors look at trees without any groups involved. Think of a standard tree diagram where leaves are inputs and the root is the output.

• The Problem: If you have a tree with 3 leaves, and you want to attach a new little tree to one of those leaves, you have to decide which leaf to attach it to.
• The Solution: They realized that the entire collection of all possible trees (the category $\Omega$) can be built by taking a "base" set of labels (like a bag of numbered stickers) and attaching trees to them.
• The Analogy: Imagine a factory that makes trees. The factory doesn't just make one tree; it has a machine that takes a specific number of stickers (leaves) and spits out every possible tree you can make with that many stickers. The authors proved that if you run this machine for every possible number of stickers and glue all the results together, you get the entire universe of trees.

Part 2: The Group Play (The "G-Action" Case)

The Concept:
Now, imagine a group of friends, let's call them the "Rotators" (Group $G$). They want to play with the trees. If one friend rotates the tree, the whole tree must rotate with them.

• The Problem: If you have a tree with 4 leaves, and the Rotators swap Leaf 1 with Leaf 2, the tree must look the same after the swap. This restricts which trees are allowed.
• The Solution: The authors created a new rulebook ($\Omega^G$) for these "Rotator Trees."
• The Analogy: Think of a dance troupe. You can't just have one dancer; you have to have a whole troupe moving in sync. If the choreographer (the group) says "Spin!" everyone spins. The authors showed that even with these strict rules, you can still build the entire collection of Rotator Trees by starting with a specific set of labeled leaves and letting the group rotate them. It's like building a dance routine by starting with a single dancer and then cloning them into a synchronized troupe.

Part 3: The "Genuine" Magic (The Real Equivariant Case)

The Concept:
This is the most complex part. In the previous section, the group just rotated the whole tree. But in "Genuine" equivariant math, the group can do something more subtle: Norm Maps.

• The Analogy: Imagine the group isn't just rotating the tree; they can also split the tree into smaller groups or merge different trees together in a way that respects the group's internal hierarchy.
  • Think of a corporate hierarchy. A CEO (the whole group $G$) can give orders to a Manager (a subgroup $H$).
  • In the "Genuine" world, a tree can be a "Manager's tree" (an $H$-tree) that is part of the "CEO's tree" (a $G$-tree).
  • The morphisms (moves) in this category allow you to change the manager. You can take a tree that belongs to Manager A and turn it into a tree that belongs to Manager B, provided the rules of the company allow it.
• The Breakthrough: The authors proved that this complex "Genuine" category ($\Omega_G$) is actually just a double-layered construction.
  1. First, you build trees for every possible subgroup (every possible manager).
  2. Then, you stack these layers on top of each other, allowing you to move between managers.

The "Grothendieck Construction": The Glue

You might be wondering, "What is this 'Grothendieck Construction' they keep mentioning?"

The Analogy:
Imagine you have a Travel Guide (the base category) that lists different cities (subgroups or leaf sets).

• In each city, there is a Local Museum (a category of trees).
• The Grothendieck Construction is the act of building a Super-Mall that contains all these museums.
  • You can walk from the "City of Leaves" museum to the "City of Subgroups" museum.
  • The "Grothendieck Construction" is the mathematical blueprint that tells you exactly how to connect the doors between these museums so that the whole building makes sense.

The paper proves that:

1. The standard tree universe is a Super-Mall built from labeled trees.
2. The "Rotator" tree universe is a Super-Mall built from group-labeled trees.
3. The "Genuine" tree universe is a Super-Mall built inside a Super-Mall (an iterated construction).

Why Does This Matter?

In the world of Stable Equivariant Homotopy Theory (a very advanced branch of math used to study shapes and symmetries in physics and topology), these trees are the "atoms" used to build complex theories.

• Bonventre and Pereira (previous researchers) used the "Genuine" trees to solve hard problems about "Norm Maps" (the corporate hierarchy analogy).
• The Authors of this paper realized that the "Genuine" trees and the "Rotator" trees were being defined in slightly different ways in different papers.
• The Result: They proved that these different definitions are actually equivalent. It's like proving that a "Sedan" and a "Car with 4 doors" are the same thing. This allows mathematicians to switch between the two definitions freely, using the tools that are easiest for the specific problem they are solving.

Summary

The paper is a translation manual. It takes three different languages used to describe complex, symmetric tree structures and proves they all say the exact same thing. It does this by showing that all these structures can be built by stacking layers of simpler, labeled trees together using a specific mathematical "glue" (the Grothendieck construction).

In short: They took a messy pile of different tree definitions, organized them into a neat, multi-layered structure, and showed that no matter which layer you start on, you end up in the same place.

Technical Summary

Here is a detailed technical summary of the paper "A Comparison of Definitions of Equivariant Trees" by Bergner, Calle, Chan, Osorno, and Sarazola.

1. Problem Statement

The paper addresses the need to unify and clarify the relationships between different categorical models used in equivariant homotopy theory, specifically concerning equivariant operads.

• Context: Recent work by Bonventre and Pereira on genuine equivariant operads relies on a category of "genuine equivariant trees" ($\Omega_G$) to encode not only group actions but also norm maps (crucial for stable equivariant homotopy theory).
• The Conflict: There exist multiple definitions of equivariant trees in the literature:
  1. The dendroidal category $\Omega$ (non-equivariant).
  2. The category $\Omega^G$ of trees with a $G$-action (objects in $\Omega$ equipped with a $G$-action).
  3. The category $\Omega_G$ of genuine equivariant trees (introduced by Pereira), which allows for trees with actions by subgroups $H \leq G$ and morphisms that change the subgroup.
  4. Categories of trees with fixed leaf sets labeled by $G$-sets (denoted $T^G(A)$ in previous work by the authors).
• The Goal: The authors aim to demonstrate that these seemingly distinct categories are structurally equivalent via Grothendieck constructions. Specifically, they seek to show that $\Omega_G$ can be modeled as an iterated Grothendieck construction on categories of trees with fixed leaf labels, generalizing known non-equivariant results.

2. Methodology

The paper employs categorical machinery, specifically oplax functors and the Grothendieck construction, to relate these categories.

• Oplax Functors: Unlike strict functors, oplax functors allow for natural transformations that relate the composition of functors to the functor of the composition ($F(gf) \Rightarrow F(f)F(g)$). This flexibility is necessary because the assignment of tree categories to leaf sets does not strictly preserve composition or identities due to the "grafting" of corollas.
• Grothendieck Construction: The authors use this construction to "glue" a family of categories (indexed by a base category) into a single total category.
  • For a functor $F: \mathcal{C}^{op} \to \mathbf{Cat}$, the Grothendieck construction $\int_{\mathcal{C}^{op}} F$ has objects $(c, x)$ where $c \in \mathcal{C}$ and $x \in F(c)$.
• Iterative Approach: The proof strategy proceeds in three stages of increasing equivariant complexity:
  1. Non-equivariant: Relate $\Omega$ to trees with fixed leaf sets.
  2. $G$-equivariant (Action): Relate $\Omega^G$ (trees with $G$-action) to trees with fixed $G$-set leaf labels.
  3. Genuine Equivariant: Relate $\Omega_G$ (genuine trees) to an iterated construction involving subgroups and labeled trees.

3. Key Contributions and Results

A. Non-Equivariant Case: The Dendroidal Category $\Omega$

• Result (Theorem 1.1): The dendroidal category $\Omega$ is equivalent to the Grothendieck construction of an oplax functor $T: \mathcal{F}_*^{op} \to \mathbf{Cat}$.
• Mechanism:
  • $\mathcal{F}_*$ is the category of finite pointed sets.
  • $T(n+)$ is the category of trees with $n$ leaves labeled by $\{1, \dots, n\}$.
  • The functor $T$ is not a strict functor; it is an oplax functor. When a map $\phi: m+ \to n+$ is applied, it grafts corollas onto the leaves of a tree. This operation does not strictly preserve identities or composition, necessitating the oplax structure (natural transformations $\tau$).
  • The morphisms in the Grothendieck construction correspond to the standard morphisms in $\Omega$ (inner/outer face maps, degeneracies, isomorphisms).

B. Intermediate Equivariant Case: Trees with $G$-Action ($\Omega^G$)

• Result (Theorem 3.15): The category $\Omega^G$ (trees with a $G$-action) is equivalent to the Grothendieck construction of an oplax functor $T^G: \mathcal{F}_{G,*}^{op} \to \mathbf{Cat}$.
• Mechanism:
  • The base category is finite pointed $G$-sets ($\mathcal{F}_{G,*}$).
  • $T^G(A+)$ is the category of trees with a $G$-action where the leaves are equivariantly labeled by the $G$-set $A$.
  • The authors prove that the "grafting" operation defined by equivariant maps between $G$-sets yields an oplax functor.
  • This establishes that $\Omega^G$ encodes operads with a $G$-action but not the full structure of norm maps required for genuine equivariant operads.

C. Genuine Equivariant Case: The Category $\Omega_G$

• Result (Theorem 4.18): The genuine equivariant dendroidal category $\Omega_G$ is equivalent to an iterated Grothendieck construction:
  $$\Omega_G \simeq \int_{\mathcal{O}_G^{op}} \left( \int_{\mathcal{F}_{(H),*}^{op}} T^{(H)} \right)$$
  where $\mathcal{O}_G$ is the orbit category of $G$ (objects $G/H$), and $T^{(H)}$ are categories of trees labeled by $H$-sets.
• Mechanism:
  • Step 1: The authors first model $\Omega_G$ as a Grothendieck construction over the orbit category $\mathcal{O}_G^{op}$ using the functor $H \mapsto \Omega^H$ (trees with $H$-action). This relies on a result by Pereira showing $\Omega_G \simeq \int_{\mathcal{O}_G^{op}} \Omega^{(-)}$.
  • Step 2: They substitute the inner category $\Omega^H$ with its equivalent Grothendieck construction over labeled trees (from Section 3).
  • Step 3: They prove that the assignment $G/H \mapsto \int T^{(H)}$ forms a pseudofunctor (or oplax functor) from $\mathcal{O}_G^{op}$ to $\mathbf{Cat}$.
  • Conclusion: An object in $\Omega_G$ is effectively a forest of trees where each tree has an action by a specific subgroup $H$, and the collection of roots forms a transitive $G$-set $G/H$. Morphisms allow for changing the subgroup and relabeling leaves.

4. Technical Nuances

• Forests vs. Trees: In the genuine equivariant setting, objects are often forests (disjoint unions of trees) rather than single trees, because the "output" of an equivariant operation can be an orbit $G/H$ (requiring multiple root edges). The authors rigorously define the category of forests $\Phi$ and its equivariant version $\Phi_G$ to handle this.
• Oplax vs. Strict: A critical technical point is that the assignment of tree categories to leaf sets is never a strict functor. The "grafting" of corollas introduces a discrepancy between $(\phi \circ \psi)^*$ and $\psi^* \circ \phi^*$. The paper carefully constructs the natural transformations (the "oplax" data) required to make the Grothendieck construction work.
• Subgroup Changes: In $\Omega_G$, morphisms can change the acting subgroup (e.g., from $H$ to $K$). The iterated Grothendieck construction naturally encodes this via the morphisms in the orbit category $\mathcal{O}_G$.

5. Significance

• Unification of Models: The paper provides a rigorous bridge between the "naive" equivariant trees (trees with $G$-action) and the "genuine" equivariant trees (incorporating norm maps). It clarifies that the complexity of $\Omega_G$ arises from the interplay between the orbit category and the labeling of leaves.
• Foundation for Homotopy Theory: By establishing $\Omega_G$ as an iterated Grothendieck construction, the authors provide a concrete combinatorial model for genuine equivariant $\infty$-operads. This is essential for developing homotopy theories of equivariant operads, which are central to modern stable homotopy theory (e.g., in the study of $N_\infty$-operads).
• Generalization of Robinson/Heuts-Moerdijk: The results generalize the non-equivariant equivalence between trees and partition complexes (Robinson, Heuts, Moerdijk) to the full equivariant setting, offering a unified framework for future research in equivariant algebraic topology.

In summary, the paper successfully decomposes the complex category of genuine equivariant trees into simpler, well-understood components (labeled trees and orbit categories) using the powerful tool of the Grothendieck construction, thereby solidifying the categorical foundations of genuine equivariant operad theory.