🔢 mathematics

Weighted sum formulas for finite multiple mixed values

This paper establishes a weighted sum formula for finite multiple mixed values using iterated integrals of multiple polylogarithms and applies it to derive relations among level-two variants of finite multiple zeta values.

Original authors: Zhonghua Li, Zhenlu Wang

Published 2026-06-23

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Zhonghua Li, Zhenlu Wang

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 master chef trying to understand the secret recipes of a very complex, infinite banquet. In the world of mathematics, this banquet is made of numbers called Multiple Zeta Values (MZVs). These aren't just simple numbers; they are intricate sums built from adding up fractions in very specific patterns. For decades, mathematicians have been trying to figure out how these different "dishes" relate to one another.

This paper, written by Zhonghua Li and Zhenlu Wang, is like discovering a new universal recipe card that helps you mix and match these dishes in a very specific way.

Here is a breakdown of what they did, using simple analogies:

1. The Ingredients: "Mixed" Flavors

Usually, mathematicians study these number sums where you add up everything in a straight line. But recently, they started looking at "Level-Two" variants. Think of this as adding a twist to the recipe:

Sometimes you only use odd numbers (like picking only odd-numbered seats in a theater).
Sometimes you only use even numbers.
Sometimes you alternate between them.

The authors call these "Finite Multiple Mixed Values" (FMMVs). Imagine these as a giant, infinite pot of soup where the ingredients change based on a specific pattern (like "odd, even, odd, even"). The "Finite" part means they are looking at what happens when you take these sums modulo a prime number (a mathematical trick that wraps the numbers around a clock face, keeping them manageable).

2. The Problem: Too Many Variables

The big question in this field is: If I mix these different patterns together, do they cancel each other out, or do they create a new, predictable total?

Mathematicians already knew some rules for simple cases (like mixing just two ingredients). But when you have a long string of ingredients with different patterns, it gets messy. There are too many combinations to check one by one.

3. The Solution: The "Weighted Sum" Formula

The authors' main achievement is a Weighted Sum Formula.

The Analogy:
Imagine you have a scale. On one side, you put a bunch of different "mixed value" dishes. On the other side, you put a single, specific dish.

The authors found a rule that tells you exactly how much "weight" (a multiplier) to give to each dish on the left side so that the scale balances perfectly with the dish on the right.
Instead of checking every single combination, their formula acts like a master key. It says, "If you have a specific pattern of ingredients (defined by parameters $a$ and $b$ ), here is the exact equation that links them all together."

They proved this using a technique called Iterated Integrals.

The Metaphor: Think of these integrals as a flowing river. Instead of adding numbers one by one, they visualize the numbers as water flowing through a series of pipes. By studying how the water flows and mixes in these pipes, they can predict the final result without having to count every single drop. This "river" method is a powerful tool that lets them see the hidden structure of the numbers.

4. The Results: New Recipes for Specific Cases

Once they proved their "Master Formula" (Theorem 1.1), they used it to derive several specific "recipes" for simpler cases:

Depth-Two Recipes: They looked at sums with just two main ingredients. They found that if you mix "Even" patterns with "Odd" patterns in a specific way, they always add up to a specific "Mixed" result.
Height-Zero and Height-One: They also looked at cases where the "height" (a measure of complexity) was zero or one. They found that for certain patterns, the total sum is actually zero (the ingredients cancel each other out perfectly), or they relate directly to a famous type of number called a Bernoulli number.

5. Why This Matters (According to the Paper)

The paper doesn't claim this will cure diseases or build better bridges. Its value is purely in the structure of mathematics:

It adds to the "dictionary" of how these complex numbers speak to each other.
It helps mathematicians understand the "Q-vector space" (a fancy way of saying the "family tree" or the fundamental building blocks) of these numbers.
It provides a tool to calculate these values more efficiently, which helps in testing deeper conjectures about the nature of numbers.

In Summary:
Li and Wang took a very complex, infinite puzzle of number patterns. They built a new, powerful tool (a weighted sum formula using river-like integrals) that allows mathematicians to predict how these patterns balance out. They then used this tool to solve several smaller, specific puzzles, revealing that many of these complex sums are actually just simple variations of each other.

Technical Summary: Weighted Sum Formulas for Finite Multiple Mixed Values

Problem Statement
The paper addresses the structural properties of finite multiple zeta values (FMZVs) and their level-two variants. While classical multiple zeta values (MZVs) have been extensively studied, with well-established linear relations such as the sum formula and weighted sum formulas (e.g., by Ohno and Zudilin), the arithmetic structure of their finite counterparts and specific parity-restricted variants remains an active area of research. Specifically, the authors focus on "finite multiple mixed values" (FMMVs), a generalization introduced by Zhao that encompasses four distinct level-two variants of FMZVs: finite multiple $t$ -values (FMtVs), finite multiple $E$ -values (FMEVs), finite multiple $T$ -values (FMTVs), and finite multiple $S$ -values (FMSVs). The central problem is to establish a unified weighted sum formula for these FMMVs, which would subsequently yield various relations among the specific level-two variants.

Methodology
The authors employ the iterated integral expression of multiple polylogarithms to derive their results. The methodology proceeds through the following steps:

Integral Representation: The paper utilizes the definition of multiple mixed values (MMVs) via iterated integrals of specific differential 1-forms ( $\omega_0, \omega_1, \omega_{-1}$ ).
Operator Construction: A $\mathbb{Q}$ -linear operator $C_p$ is defined on power series, mapping a series to the sum of its first $p$ coefficients modulo $p$ . This operator connects the infinite series definition of MMVs to the finite modular sums defining FMMVs.
Algebraic Manipulation: The authors construct a specific function $F(z)$ involving binomial expansions of integral forms $\Omega_\tau$ and $\Omega_0$ . By applying the operator $C_p$ to the product of two multiple polylogarithms, they utilize a reversal lemma (Lemma 2.1) to relate the product to a single FMMV with reversed indices and negated signs.
Partitioning Integration Regions: The core of the proof involves partitioning the integration domain of the constructed function $F(z)$ into two regions ( $0 < u_1 < u_2 < z$ and $0 < u_2 < u_1 < z$ ). By expanding these regions using binomial coefficients and comparing the resulting series expansions, the authors derive a general identity.

Key Contributions and Results
The primary contribution of the paper is Theorem 1.1, a general weighted sum formula for finite multiple mixed values. This theorem expresses a linear combination of FMMVs with varying depths and sign patterns as a single FMMV with specific sign modifications. The formula depends on non-negative integers $a, b$ and parameters $\delta_1, \delta_2, \tau \in \{\pm 1\}$ .

From this main theorem, the authors derive several specific corollaries:

Depth-Two Relations (Corollary 3.1): By setting $a=0$ , the authors derive weighted sum formulas for depth-two FMMVs. These formulas establish explicit linear relations between combinations of FMtVs, FMEVs, FMTVs, and FMSVs. For instance, specific choices of parameters yield relations such as $\sum \binom{j}{n} E_A + \sum \binom{j}{b-n} S_A = (-1)^{n+1} S_A$ .
Height-Zero Relations (Corollary 3.2): By setting $b=0$ , the paper provides formulas for FMMVs where the indices are restricted to 1s (height zero). This leads to relations connecting these values to $E_A$ and $t_A$ values, and confirms that $T_A(\{1\}^a) = 0$ for even $a$ .
Height-One Relations (Corollaries 3.3 and 3.4): By setting $b=1$ , the authors derive sum formulas for height-one variants, specifically for FMtVs and FMTVs involving the index 2. Notably, for even $a$ , the sum of height-one FMTVs $\sum T_A(\{1\}^j, 2, \{1\}^{a-j+1})$ is shown to be zero.

Significance
The paper claims significance by providing a unified framework for understanding the linear relations among level-two variants of finite multiple zeta values. By establishing a weighted sum formula for the general FMMV, the authors demonstrate that various specific relations among FMtVs, FMEVs, FMTVs, and FMSVs are not isolated phenomena but rather special cases of a broader algebraic structure. The work extends previous methods used for classical MZVs and FMZVs (citing works by Kamano, Guo, Xie, and Zhao) to the more complex setting of mixed values with parity constraints. The results contribute to the ongoing effort to determine the dimensions of the $\mathbb{Q}$ -vector spaces spanned by these values and to verify conjectures regarding their algebraic independence.

1. The Ingredients: "Mixed" Flavors

2. The Problem: Too Many Variables

3. The Solution: The "Weighted Sum" Formula

4. The Results: New Recipes for Specific Cases

5. Why This Matters (According to the Paper)

More like this