On the sub-adjacent Hopf algebra of the universal enveloping algebra of a post-Lie algebra

This paper establishes a combinatorial antipode formula and a closed inverse formula for the Oudom-Guin isomorphism regarding the sub-adjacent Hopf algebra of the universal enveloping algebra of a post-Lie algebra, while also deriving a cancellation-free antipode formula for the Grossman-Larson Hopf algebra of ordered trees.

The Gist

Imagine a world of mathematical building blocks. In this paper, the author, Yunnan Li, explores a specific type of structure called a Post-Lie algebra. To understand what he does, let's break down the complex jargon into a story about construction, twisting, and cleaning up a messy room.

The Characters: The "Post-Lie" and the "Hopf"

Think of a Post-Lie algebra as a special set of rules for how to combine two things (let's call them "blocks"). It's like a game where you have a standard way to combine blocks, but you also have a second, "post" way to combine them that interacts with the first way in a very specific, balanced manner.

When you take these rules and build a massive, infinite library of all possible combinations of these blocks, you get something called a Universal Enveloping Algebra. In the world of math, this library is a Hopf Algebra. A Hopf Algebra is like a super-organized warehouse that has:

1. A way to multiply (combine blocks).
2. A way to split (break a big block into smaller pieces).
3. An "Undo" button (called the Antipode).

The Problem: The Messy "Undo" Button

In many of these mathematical warehouses, the "Undo" button is incredibly messy. If you try to reverse a complex combination of blocks, the standard formula tells you to add a huge list of terms, but then subtract an even huger list of terms, which then cancel each other out perfectly.

It's like trying to clean a room by throwing everything on the floor, then picking up every single item, only to realize you picked up things you didn't need to move in the first place. You end up with a huge pile of "cancellations" that makes the calculation slow and confusing. Mathematicians hate this because they want a cancellation-free formula—a clean list of steps that gets you the result without any wasted effort.

The Solution: The "Sub-Adjacent" Twist

The author discovers that inside this messy warehouse, there is a hidden, cleaner structure called the Sub-adjacent Hopf Algebra.

Here is the magic trick the author uses:

1. The Twist: He takes the original rules for combining blocks and "twists" them using a special operation (called a Post-Hopf product). Imagine taking a tangled knot of rope and twisting it just right so the knots fall away.
2. The New Product: This twist creates a new way to combine blocks (a new multiplication rule).
3. The Clean Undo: Because of this new twisted rule, the "Undo" button (the Antipode) for this new structure becomes incredibly simple. Instead of a messy list of additions and subtractions, it becomes a neat, step-by-step recipe where every term counts and nothing cancels out.

The "Grossman-Larson" Tree Garden

The paper focuses on a famous example of these structures: the Grossman-Larson Hopf Algebra of ordered trees.

• The Analogy: Imagine a garden of trees where the branches grow in a specific left-to-right order. You can graft (stick) one tree onto another.
• The Challenge: For a long time, mathematicians knew how to "undo" a complex tree structure, but the formula was the messy "add and subtract" version mentioned earlier.
• The Breakthrough: By treating these trees as the "blocks" in the Post-Lie system, the author applies his "twist." He derives a cancellation-free formula for the Grossman-Larson algebra.

What does this formula look like?
Instead of a chaotic sum, the formula tells you to:

1. Look at the tree.
2. Break it into specific groups of branches.
3. Perform a specific "grafting" operation (sticking branches onto other branches) in a very precise order.
4. The result is the "undo" of the tree, and every single term in the calculation is necessary. There is no waste.

The "K-Map" Connection

The paper also connects this to something called Gavrilov's K-map.

• The Analogy: Imagine you have two different maps of the same city. One map (the "Post-Lie" map) shows the streets in a twisted, complex way. The other map (the "Lie" map) shows the streets in a straight, standard way.
• The Bridge: The author finds a direct, closed-formula bridge (an inverse formula) to translate back and forth between these two maps instantly. Before this, translating between them required a slow, recursive process (step-by-step guessing). Now, you can just look at the formula and see the whole picture immediately.

Summary

In simple terms, Yunnan Li found a way to reorganize a complex mathematical system so that its most difficult operation (reversing a combination) becomes clean, efficient, and free of wasted steps.

He did this by:

1. Identifying a hidden, simpler structure inside the complex one.
2. "Twisting" the rules of combination to reveal this structure.
3. Using this new perspective to write down a perfect, step-by-step recipe for the "Undo" button, specifically for a famous system involving ordered trees.

This doesn't just solve a puzzle; it gives mathematicians a much more efficient tool to work with these structures, removing the "noise" of unnecessary calculations.

Technical Summary

Technical Summary: On the Sub-Adjacent Hopf Algebra of the Universal Enveloping Algebra of a Post-Lie Algebra

Problem Statement
The paper addresses the structural and combinatorial properties of the universal enveloping algebra $U(\mathfrak{g})$ of a post-Lie algebra $\mathfrak{g}$. Specifically, it focuses on the "sub-adjacent Hopf algebra" $U(\mathfrak{g})^\triangleright$, a structure introduced by Ebrahimi-Fard, Lundervold, and Munthe-Kaas which assembles a new Hopf algebra structure from $U(\mathfrak{g})$ using the post-Lie product. While the isomorphism between $U(\mathfrak{g})^\triangleright$ and the universal enveloping algebra of the sub-adjacent Lie algebra $U(\mathfrak{g}^\triangleright)$ (the Oudom-Guin isomorphism) is known, explicit combinatorial formulas for the antipode of $U(\mathfrak{g})^\triangleright$ and the inverse of the Oudom-Guin isomorphism have been elusive.

A primary motivation is the Grossman-Larson Hopf algebra of ordered trees, $H_{GL}$, which is isomorphic to the sub-adjacent Hopf algebra of the free post-Lie algebra on one generator. Existing methods for computing the antipode of $H_{GL}$ rely on Takeuchi's general formula, which involves alternating sums with extensive cancellations, making it inefficient for deriving combinatorial identities. The paper seeks to provide a "cancellation-free" antipode formula for $H_{GL}$ and, more generally, for the sub-adjacent Hopf algebra of any post-Lie algebra.

Methodology
The author employs the framework of post-Hopf algebras, a notion recently introduced by the author, Sheng, and Tang, where the universal enveloping algebra of a post-Lie algebra serves as a fundamental example. The methodology proceeds through the following steps:

1. Twisting the Product: The paper introduces a "twisted" binary product, denoted $\triangleright$, on the tensor algebra $T(V)$ (where $V$ is the underlying vector space of the post-Lie algebra). This product is defined by twisting the post-Hopf product $\triangleright$ with the antipode $S$ and a sign factor: $X \triangleright Y \coloneqq (-1)^{|X|} S_\triangleright(X) \triangleright Y$.
2. Recursive and Combinatorial Analysis: Using the properties of the post-Hopf structure, the author derives a recursive formula for the twisted product $\triangleright$. This recursion is then solved combinatorially using permutations and specific bracketing operations, denoted as $[x_1, \dots, x_m; Y]_w$.
3. Partition Sums: The antipode $S_\triangleright$ is expressed as a sum over set partitions of the indices of a word, utilizing the twisted product $\triangleright$. This approach avoids the alternating sums of Takeuchi's formula by leveraging the specific structure of the post-Lie extension.
4. Isomorphism Construction: The twisted product is used to construct a closed-form expression for the inverse of the Oudom-Guin isomorphism (related to Gavrilov's K-map) by relating it to the combinatorial structure of the twisted product.
5. Application to Trees: The general results are specialized to the case of ordered trees, where the magma algebra is generated by a single root. The left grafting operator is identified with the post-Lie product, allowing the general antipode formula to be translated into a concrete tree-grafting expression.

Key Contributions and Results

• Combinatorial Antipode Formula: The paper provides a closed, cancellation-free formula for the antipode $S_\triangleright$ of the sub-adjacent Hopf algebra $U(\mathfrak{g})^\triangleright$ (Theorem 2.17). For a word $x_1 \cdots x_m$, the antipode is given by:
  $$S_\triangleright(x_1 \cdots x_m) = (-1)^m \sum_{\pi} (x_{B_1} \triangleright x_{b_1}) \cdots (x_{B_{|\pi|-1}} \triangleright x_{b_{|\pi|-1}})$$
  where the sum ranges over specific set partitions $\pi$, and the product $\triangleright$ is defined via the twisted post-Hopf structure.

• Closed Inverse for Oudom-Guin Isomorphism: A closed inverse formula for the Oudom-Guin isomorphism $\phi: U(\mathfrak{g}^\triangleright) \to U(\mathfrak{g})^\triangleright$ is derived (Theorem 3.5). This formula is expressed as a sum over set partitions involving the combinatorial elements $[x_I]$, which are constructed from the twisted product. This resolves the difficulty of obtaining a closed formula for the inverse K-map mentioned in previous literature.

• Cancellation-Free Antipode for Grossman-Larson Hopf Algebra: As a specific application, the paper derives a cancellation-free antipode formula for the Grossman-Larson Hopf algebra of ordered trees, $H_{GL}$ (Theorem 4.6). The formula is:
  $$S_{GL}(\tau) = (-1)^m \sum_{\pi} B_+ \left( (\tau^-_{B_1} \triangleright \tau_{b_1}) \cdots (\tau^-_{B_{|\pi|-1}} \triangleright \tau_{b_{|\pi|-1}}) \right)$$
  where $\tau = B_+(\tau_1 \cdots \tau_m)$, and the product $\triangleright$ corresponds to a specific sum of left graftings of trees.

• Combinatorial Interpretation of Twisted Product: The paper provides a concrete interpretation of the twisted product $\triangleright$ in the context of ordered trees (Proposition 4.4), describing it as a sum of left graftings with specific ordering constraints on the scions (sub-trees) attached to a rootstock.

Significance and Claims
The paper claims that the derived formulas are significant because they eliminate the cancellations inherent in the standard Takeuchi antipode formula. This "cancellation-free" property is crucial for combinatorial Hopf algebras, as it allows for the direct derivation of combinatorial identities among elements without the computational overhead of summing and canceling large numbers of terms.

The author notes that while the Grossman-Larson antipode formula was previously considered difficult to derive explicitly, the approach via post-Hopf algebras and the twisted product provides an efficient computational tool. The results also offer a new perspective on the Oudom-Guin isomorphism and Gavrilov's K-map, linking them directly to the combinatorial structure of set partitions and the twisted product. The work serves to generalize existing results on pre-Lie algebras and provides a unified framework for studying the combinatorial Hopf algebras arising in geometric numerical integration, regularity structures, and Lie-Butcher series.