🔢 mathematics

A Weighted Sum Formula for Double Eisenstein Series

This paper proves a weighted sum formula for double Eisenstein series, which confirms a conjecture regarding multiple divisor sums by leveraging restricted double-shuffle relations for the former and combinatorial generating series arguments for the latter.

Original authors: Henrik Bachmann

Published 2026-07-24

📖 6 min read🧠 Deep dive

CC BY 4.0

Original authors: Henrik Bachmann

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are a detective trying to solve a mystery about how numbers behave when you add them up in very specific, fancy ways. In the world of mathematics, there is a special club called "number theory," where researchers study the hidden patterns of whole numbers. One of the most famous puzzles in this club involves "zeta values," which are like the ultimate scores you get when you add up fractions in a never-ending sequence. For a long time, mathematicians have known that these scores follow strict rules, like a secret code. But there's a twist: these rules get even more interesting when you look at "double" or "multiple" versions of these sums, where you are juggling two or more sequences at once.

To make things even more magical, mathematicians have created "Eisenstein series." Think of these as a special kind of musical instrument made of numbers. When you play them, they produce a sound (a mathematical formula) that connects the world of simple number sums to the complex, swirling world of shapes called "modular forms." Recently, a researcher named Henrik Bachmann noticed something curious: if you take these musical instruments and play them at a specific "weight" (a measure of their complexity, specifically 6 or higher), the notes they produce seem to follow a very precise weighted sum formula. It's like discovering that if you mix three specific ingredients in a cake, the flavor always balances out in a way that was predicted by a recipe written years ago, but nobody had actually baked the cake to prove it until now. This paper is about baking that cake and proving the recipe works.

The Recipe for Number Cakes

In this paper, Henrik Bachmann proves a specific, heavy-duty recipe for mixing "double Eisenstein series." You can think of these series as complex recipes where you are combining different types of number ingredients. The main discovery is a "weighted sum formula." Imagine you have a giant scale. On one side, you put a single, heavy ingredient called $G_k$ (which represents a complex sum of numbers). On the other side, you don't just put one thing; you put a whole pile of smaller, mixed ingredients called $G_{a,b}$ (double sums), but you have to weigh them down with very specific numbers (coefficients) to make the scale balance perfectly.

The paper proves that for any "weight" $k$ that is 6 or bigger, this balance is always true. The formula says that the single complex sum $G_k$ is exactly equal to a sum of double sums $G_{a,b}$ , where the weights ( $\alpha_{a,b}$ ) are calculated using a specific mathematical recipe involving factorials and powers of 2. It's like saying, "If you want to build a tower of height 10, you don't need a single giant block; you can build it perfectly by stacking smaller blocks of height 3 and 7, or 4 and 6, as long as you use the right amount of glue for each pair."

The Two-Part Proof: The Algebraic and The Combinatorial

What makes this paper special is that the author didn't just guess the recipe; he proved it in two completely different ways, like solving a mystery using both a fingerprint and a witness statement.

1. The Algebraic Proof (The "Double-Step" Dance)
The first proof uses a set of rules called "restricted double-shuffle relations." Imagine you have two ways to mix your ingredients: the "stuffle" method (where you mix them in a specific order) and the "shuffle" method (where you mix them in a different order). Usually, these two methods give you different results. However, the paper shows that for these specific number series, if you subtract the result of one method from the other, the difference is zero (or very close to it). By using this "dance" of algebra, the author shows that the complex single sum $G_k$ must be a combination of the double sums $G_{a,b}$ to keep the math from breaking. This part of the proof relies on deep algebraic structures that were already known to be true, connecting them to the new formula.

2. The Combinatorial Proof (The "Counting" Method)
The second proof is more like a game of counting. Instead of using the heavy algebra, the author looks at the "generating series," which is a fancy way of writing down all the possible sums in a single giant formula. He treats these formulas like polynomials (expressions with $X$ and $Y$ ) and uses a special mathematical "machine" (a differential operator) to chop and change them. By carefully counting the terms and watching how they cancel each other out, he derives the exact same formula. This proof is particularly cool because it also reveals a "correction" for lower weights. It shows that if you try to use this recipe for weights smaller than 6, the scale doesn't balance perfectly unless you add a few extra "correction terms" (specifically involving $g_{k-2}$ and $g_{k-4}$ ).

What This Means for the Numbers

The paper confirms a conjecture that the author made in his master's thesis years ago. Before this, mathematicians had strong hints (numerical evidence) that this formula was true, but they didn't have a formal proof. Now, we know for sure that for every integer weight $k \ge 6$ , the relationship holds.

The author also points out that for weights below 6, there are likely no such relations at all. It's as if the "magic" of this specific balancing act only starts working once the numbers get big enough (weight 6). The first time this formula kicks in is at weight 6, where the single sum $G_6$ is perfectly balanced by a mix of $G_{3,3}$ and $G_{4,2}$ .

In short, this paper takes a beautiful, suspected pattern in the world of number theory and locks it down with two solid proofs. It connects the abstract world of "multiple zeta values" (the ultimate scores) with the concrete world of "q-series" (the recipes), showing that they speak the same language. It's a victory for the idea that even the most complex, swirling patterns of numbers follow a strict, predictable, and elegant order.

Technical Summary: A Weighted Sum Formula for Double Eisenstein Series

Problem Statement
The paper addresses the linear relations among multiple Eisenstein series and their $q$ -analogues, specifically focusing on the "double" case (depth two). Multiple Eisenstein series, introduced by Gangl, Kaneko, and Zagier, connect double zeta values with modular forms. While it is expected that multiple Eisenstein series ( $G$ ) and their associated $q$ -series ( $g$ ) satisfy the same linear relations modulo lower-weight terms, explicit formulas for these relations have been difficult to establish. The author previously conjectured a specific weighted sum formula for double divisor sums in their master's thesis but lacked a proof. This paper aims to prove this conjecture in two compatible forms: one for the multiple Eisenstein series and one for the $q$ -series.

Methodology
The paper provides two distinct proofs for the main identity, demonstrating its validity through both algebraic and combinatorial approaches.

Algebraic Approach (Proof of Main Theorem A):
- This proof relies on the restricted double-shuffle relations established by the author and Tasaka.
- The author utilizes the algebraic structure of the harmonic (stuffle) product and the shuffle product on the algebra of words $H_1 = \mathbb{Q} + Hy$ .
- By defining a specific symmetric homogeneous polynomial $H_k(X, Y)$ and utilizing a coefficient criterion derived from [GKZ] and [BT], the author shows that a specific linear combination of depth-two words lies in the kernel of the shuffle-regularized multiple Eisenstein series map.
- This algebraic manipulation confirms that the weighted sum of double Eisenstein series equals the single Eisenstein series, modulo terms that vanish under the map.
Combinatorial Approach (Proof of Main Theorem B):
- This proof is independent of the Eisenstein series context and focuses directly on the $q$ -series $g_{k_1, \dots, k_r}$ .
- The author defines exponential generating series $T(X)$ and $T(X, Y)$ for the divisor sums.
- By analyzing the product $T(X)T(Y)$ , the author derives two different decompositions: one based on the stuffle decomposition (separating equal and unequal indices) and another based on summing over lattice points directly.
- A differential operator $L = \partial_X \partial_Y (\partial_X - \partial_Y)^2$ is applied to equate these decompositions.
- The proof involves extracting coefficients of specific powers of $Z$ and utilizing elementary power-sum identities to isolate the lower-weight correction terms.

Key Contributions and Results

Main Theorem A (Eisenstein Series): For every integer $k \ge 6$ , the single Eisenstein series $G_k$ is expressed as a weighted sum of double Eisenstein series $G_{a,b}$ :
$G_k = \sum_{\substack{a+b=k \\ a \ge 3, b \ge 2}} \alpha_{a,b} G_{a,b}$
where $\alpha_{a,b}$ are explicit rational coefficients involving binomial coefficients and powers of 2.
Main Theorem B ( $q$ -Series Identity): For every integer $k \ge 6$ , the corresponding identity for the $q$ -series $g_k$ includes explicit lower-weight correction terms:
$g_k - \frac{5}{(k-1)(k-2)}g_{k-2} + \frac{4}{(k-1)(k-2)(k-3)(k-4)}g_{k-4} = \sum_{\substack{a+b=k \\ a \ge 3, b \ge 2}} \alpha_{a,b} g_{a,b}$
This confirms the author's previous conjecture regarding the divisor-sum identity.
Equivalence and Limits: The paper notes that multiplying the $q$ -series identity by $(1-q)^k$ and taking the limit $q \to 1^-$ recovers the weighted sum formula for multiple zeta values:
$\zeta(k) = \sum_{\substack{a+b=k \\ a \ge 3, b \ge 2}} \alpha_{a,b} \zeta(a, b)$
This limit is also obtainable from the constant term of Main Theorem A.
Explicit Examples: The paper provides the first four cases of the relation (for $k=6, 7, 8, 9$ ), illustrating the specific coefficients. For instance, $G_6 = 6G_{3,3} - 3G_{4,2}$ .

Significance and Claims
The paper claims to provide the first proof of a specific weighted sum formula for double Eisenstein series that was previously a conjecture. The significance lies in:

Verification of Conjecture: It confirms the identity formulated in the author's master's thesis [B, Vermutung 5.2.7].
Dual Proofs: It establishes the result through two compatible but distinct methods (algebraic via double-shuffle relations and combinatorial via generating series), reinforcing the robustness of the identity.
Lower-Weight Corrections: It explicitly identifies and calculates the lower-weight correction terms ( $g_{k-2}$ and $g_{k-4}$ ) required for the $q$ -series identity, which are absent in the homogeneous weight- $k$ relation for the Eisenstein series $G$ .
Foundational Relations: The author posits that based on prior work [BKM], there are no relations among multiple Eisenstein series in weights below 6. Consequently, the relation for $G_6$ is expected to be the first non-trivial relation among multiple Eisenstein series.

The paper does not propose new applications or future experimental directions but focuses strictly on establishing these algebraic and combinatorial identities within the existing framework of multiple zeta values and modular forms.

The Recipe for Number Cakes

The Two-Part Proof: The Algebraic and The Combinatorial

What This Means for the Numbers

Technical Summary: A Weighted Sum Formula for Double Eisenstein Series

More like this