🔢 mathematics

Formal finite multiple zeta values

This paper investigates the algebra of formal finite multiple zeta values by imposing Kaneko and Zagier's relations, establishing a surjective homomorphism to formal symmetric multiple zeta values, proving a parity reduction in depth at most four, and constructing explicit relations among depth-four values using even period polynomials.

Original authors: Henrik Bachmann, Risan

Published 2026-08-18

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Henrik Bachmann, Risan

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

In the vast landscape of number theory, there exists a family of numbers known as multiple zeta values. These are not ordinary integers or simple fractions; they are infinite sums built from patterns of whole numbers, where each term in the sequence is raised to a specific power. Mathematicians have long been fascinated by how these numbers relate to one another, discovering that they obey strict algebraic rules, much like how musical notes follow the laws of harmony. Among these rules are two distinct ways of combining the numbers, often described as "stuffling" and "shuffling." While these terms sound playful, they refer to precise methods of rearranging the components of the sums to see if the total value remains unchanged. For decades, a major question has lingered: do these known rules explain every possible relationship between these numbers, or are there hidden connections waiting to be found?

To tackle this, researchers have developed two special "finite" versions of these numbers. One version, called the finite multiple zeta value, is constructed by performing calculations within a specific system of modular arithmetic, essentially looking at the remainders when numbers are divided by prime numbers. The other, the symmetric multiple zeta value, is derived from a different mathematical construction involving alternating sums. Although these two versions are built in completely different ways, a bold conjecture by mathematicians Kaneko and Zagier suggests they are secretly identical in their underlying structure. If true, this would mean that the complex web of relationships governing the finite numbers is exactly the same as the one governing the symmetric numbers, providing a unified key to understanding these mysterious values.

In this new work, Henrik Bachmann and Rislan set out to test the strength of this conjecture by building a universal mathematical framework. Instead of trying to calculate specific numerical values, which can be incredibly difficult, they created a formal algebra. Think of this as a theoretical sandbox where they defined the rules of the game first: they took the known stuffle and shuffle relations and declared them to be the absolute laws of this new system. Within this sandbox, they created "formal" versions of the finite and symmetric numbers. These are not numbers you can write down on a piece of paper, but rather abstract objects that exist solely to obey the rules the researchers imposed. By doing this, they could ask a fundamental question: if you start with the rules for the finite numbers, do you inevitably arrive at the rules for the symmetric numbers?

The authors proved that the answer is yes, at least in a specific direction. They demonstrated that there is a clear, surjective mapping from their formal finite system to their formal symmetric system. In simpler terms, every relationship that holds true for the symmetric numbers can be traced back to a corresponding relationship in the finite system. This confirms that the finite system is at least as rich and complex as the symmetric one. However, the reverse—whether the symmetric system captures every nuance of the finite one—remains an open question, mirroring the original conjecture. This result is significant because it establishes a solid bridge between the two worlds, showing that the finite numbers are not just a chaotic collection of remainders but possess a deep, structured order that aligns perfectly with the symmetric counterparts.

Beyond this structural link, the paper delves into the concept of "depth," which refers to how many terms are added together in a single sum. The researchers investigated whether sums with a high number of terms could be simplified into sums with fewer terms, a property known as parity reduction. They proved that for sums with a depth of four or less, if the total weight of the numbers matches the depth in a specific way, the complex sum can indeed be reduced to a simpler form. This was a known fact for the symmetric numbers, but proving it for the formal finite system was a major hurdle. The authors succeeded by showing that the complex four-term sums could be broken down into products of simpler, single-term values, effectively clearing a path through the mathematical clutter.

The final part of the study focuses on a specific type of relationship involving four-term sums that appear in even-numbered weights. The researchers constructed a new space of mathematical objects, which they call a formal double zeta space, designed to capture the essence of these relationships. They showed that this space is spanned by a specific set of elements that correspond to the finite zeta values. By connecting these elements to objects known as period polynomials—mathematical expressions that encode deep symmetries—the authors were able to generate explicit formulas for the relationships between these values. They verified these formulas for weights up to one hundred, finding that the relationships predicted by the period polynomials hold true. For example, they recovered a specific, non-trivial equation involving four terms that had been previously observed by Kaneko and Zagier, confirming that their new method works.

While the paper does not prove the full conjecture that the finite and symmetric systems are perfectly identical, it provides strong evidence and a powerful new toolkit for exploring them. The authors have shown that the formal finite system behaves exactly as the conjecture predicts it should in terms of its basic structure and its ability to simplify complex sums. They have also provided a concrete method to generate all known relationships among these values using period polynomials. The work stands as a rigorous verification that the finite numbers, despite their chaotic appearance, follow a disciplined and predictable pattern that mirrors the elegant symmetry of their counterparts, bringing mathematicians one step closer to unlocking the full secret of these infinite sums.

Technical Summary: Formal Finite Multiple Zeta Values

Problem Statement
The paper investigates the algebraic structure of finite multiple zeta values (FMZVs), denoted $\zeta_A(k_1, \dots, k_r)$ , and their relationship to symmetric multiple zeta values (SMZVs), denoted $\zeta_S(k_1, \dots, k_r)$ . These values are finite counterparts to classical multiple zeta values (MZVs). While FMZVs and SMZVs satisfy the same "stuffle" (quasi-shuffle) product relations and linear "shuffle" relations, it is an open conjecture by Kaneko and Zagier that the assignment $\zeta_A \mapsto \zeta_S$ induces an isomorphism between the algebra of FMZVs and the algebra of SMZVs modulo $\zeta(2)$ .

The authors address the lack of a universal framework to study these relations without relying on specific numerical realizations. They define an algebra of formal finite multiple zeta values, $\mathcal{Z}_A^f$ , generated by symbols $\zeta_A^f(k_1, \dots, k_r)$ subject only to the stuffle and linear shuffle relations. The goal is to analyze the structure of this universal algebra, specifically regarding depth filtration and the generation of relations via period polynomials, and to compare it with the formal symmetric algebra $\mathcal{Z}^f$ .

Methodology
The authors employ a purely algebraic approach within the framework of Hopf algebras and graded vector spaces.

Universal Algebra Construction: They define $\mathcal{Z}_A^f$ as the quotient of the stuffle algebra $\mathbb{Q}\langle x, y \rangle$ by the ideal generated by the linear shuffle relations. This allows them to study properties that hold for any realization satisfying these relations, including both classical FMZVs and SMZVs.
Formal Symmetric Values: They construct formal symmetric values $\zeta_S^f$ within the formal MZV algebra $\mathcal{Z}^f$ using a deconcatenation convolution of regularized stuffle and shuffle maps.
Depth Filtration and Parity: The authors analyze the depth filtration $\text{Fil}_d \mathcal{Z}_{A,k}^f$ (values of weight $k$ and depth $\le d$ ). They utilize the antipode of the Hopf algebra and specific recurrence relations derived from the linear shuffle product to reduce depth.
Period Polynomial Relations: For even weights $k$ , they utilize the formal double zeta space $\mathcal{D}_k$ (introduced by Gangl, Kaneko, and Zagier) and its quotient $\tilde{\mathcal{D}}_k$ . They construct explicit maps from $\tilde{\mathcal{D}}_k$ to the depth-four subspace of $\mathcal{Z}_{A,k}^f$ and $\mathcal{Z}_{A,k}$ . This involves defining specific elements $H_{r,s}$ in $\tilde{\mathcal{D}}_k$ and proving they span the space.
Matrix Inversion and Determinants: To establish the correspondence between period polynomials and relations among FMZVs, they construct a matrix $A_k$ with binomial and Bernoulli number entries. They use Cramer's rule to derive explicit linear relations among the values $\zeta_A(2a, 1, 2b, 1)$ corresponding to even period polynomials.

Key Contributions and Results

Main Theorem A (Surjective Homomorphism): The authors prove the existence of a surjective homomorphism of graded $\mathbb{Q}$ -algebras $\phi: \mathcal{Z}_A^f \to \mathcal{Z}^f$ mapping $\zeta_A^f(k) \mapsto \zeta_S^f(k)$ . This is a formal version of Yasuda's theorem. While surjectivity is established, injectivity remains open and is identified as the formal analogue of the Kaneko–Zagier conjecture.
Main Theorem B (Parity Reduction in Depth $\le 4$ ): They prove that for weight $k$ and depth $d$ where $k \equiv d \pmod 2$ and $d \le 4$ , the space $\text{Fil}_d \mathcal{Z}_{A,k}^f$ is contained in $\text{Fil}_{d-1} \mathcal{Z}_{A,k}^f$ . This confirms a parity reduction property in the universal formal algebra for depths up to four. The proof reduces depth-four values to products of odd-weight single values and eliminates them using generating series derived from the $1+3$ linear shuffle relation.
Main Theorem C and D (Depth-Four Generators and Relations):
- They define a reduced formal double zeta space $\tilde{\mathcal{D}}_k$ and show that elements $H_{r,s}$ (constructed from double zeta symbols) span this space.
- Assuming a specific conjecture (Conjecture 5.6) regarding depth-three values, they construct a surjective map $\beta_k^f: \tilde{\mathcal{D}}_k \to \text{Fil}_4 \mathcal{Z}_{A,k}^f$ .
- Unconditionally, they construct a surjective map $\beta_k: \tilde{\mathcal{D}}_k \to \text{Fil}_4 \mathcal{Z}_{A,k}$ for classical finite multiple zeta values. This proves that the values $\zeta_A(r-1, 1, s-1, 1)$ (for odd $r,s$ ) span the depth-four part of the algebra and satisfy at least $\dim \mathcal{S}_k$ independent linear relations, where $\mathcal{S}_k$ is the space of cusp forms of weight $k$ .
Explicit Period Polynomial Relations (Theorem 5.17): The authors provide an explicit algorithm to generate linear relations among $\zeta_A(2a, 1, 2b, 1)$ from even period polynomials. They define a matrix $A_k$ and show that if $\det A_k \neq 0$ (verified computationally for even $k \le 100$ ), the relations derived from period polynomials exhaust all relations among the depth-four generators. They recover the specific relation $16\zeta_A(2, 1, 8, 1) + 9\zeta_A(4, 1, 6, 1) + 18\zeta_A(6, 1, 4, 1) - 2\zeta_A(8, 1, 2, 1) = 0$ observed by Kaneko and Zagier as a specific instance of this construction.

Significance and Claims
The paper claims to provide a rigorous algebraic foundation for the study of finite multiple zeta values by isolating the relations that are purely consequences of the stuffle and shuffle structures, independent of specific arithmetic realizations.

Formal Correspondence: The construction of the surjective map $\phi$ establishes that the algebra of formal finite MZVs is a "universal" object that maps onto the formal symmetric MZVs. The open question of injectivity is framed precisely as the formal version of the Kaneko–Zagier conjecture.
Depth Reduction: The proof of parity reduction for depth $\le 4$ in the universal algebra is significant because it applies simultaneously to both finite and symmetric realizations, bypassing the need for separate proofs for each.
Connection to Modular Forms: The work explicitly links the algebraic structure of depth-four FMZVs to the space of cusp forms $\mathcal{S}_k$ . By constructing maps from the reduced double zeta space (whose dimension is determined by $\dim \mathcal{S}_k$ ) to the depth-four subspace, the authors demonstrate that the number of independent relations among these values is at least the dimension of the space of cusp forms.
Explicit Relations: The paper provides a concrete method (via the matrix $A_k$ and period polynomials) to generate all known relations among the specific family $\zeta_A(2a, 1, 2b, 1)$ , suggesting that these relations are exhaustive if the determinant conjecture holds.

The authors maintain a modest tone regarding the injectivity of the main homomorphism and the validity of Conjecture 5.6 in arbitrary weights, noting that these remain open problems. They emphasize that their results for classical finite values (Theorem D) are unconditional, while the formal analogues (Theorem C) rely on the conjectured identity for depth-three values.

More like this