Alternating sum of multiple zetas equals always 1?

Question

This is more in the category of "recreational math"...
I was playing with multiple zetas, in the notation of $\zeta(k),\zeta(k,k),\zeta(k,k,k),\ldots$ as given in wikipedia.
Looking at the alternating sums $$A_m=\zeta(m)-\zeta(m,m)+\zeta(m,m,m)- \ldots + \ldots $$ it seems, that for any natural $m \ge 2$ we get $A_m = 1 $. Even if we set $m=1$ and replace $\zeta(1)$ by the Euler-Mascheroni constant $\gamma$ (as done by Ramanujan in his summation) and compute the multiple zetas based on this we seem to approach $1$ when the number of multiple zetas increases without bound.

[update] It seems to be true for $m \gt 0 $ and even for complex m, if $\Re(m) \gt 0$. [/update]

Q1: Is this true (and maybe even trivial)?
Q2: if the answer for Q1 is "true", then what is the range for m?

Example: the multiple zetas beginning at $\zeta(2)$ are $$ \small \begin{array} {rr|l} \zeta(2)&=& 1.64493406685 \\ \zeta(2,2)&=& 0.811742425283 \\ \zeta(2,2,2)&=& 0.190751824122 \\ \zeta(2,2,2,2)&=& 0.0261478478177 \\ \zeta(2,2,2,2,2)&=& 0.00234608103546 \\ \ldots \\ \end{array} $$ The partial sums of the alternating series are $$ \small \begin{array} {} 1.64493406685 \\ 0.833191641565 \\ 1.02394346569 \\ 0.997795617869 \\ 1.00014169890 \\ 0.999993270112 \\ 1.00000024599 \\ 0.999999992864 \\ 1.00000000017 \\ 0.999999999997 \\ 1.00000000000 \\ \ldots \end{array} $$ [update 2] The answer of @Achille Hui reminded me that it was of importance to remark that I compute the multiple zetas by the Newton-formula for the conversion between power-sums and elementary symmetric polynomials. Let $\operatorname{s2e}(v) $ be the function, which converts a vector v of powersums of consecutive exponents into a vector of elementary symmetric polynomials , then $$ \operatorname{s2e}([\zeta(m),\zeta(2 m), \zeta(3 m),\ldots])=[\zeta(m),\zeta(m,m),\zeta(m,m,m),\ldots]$$ and the alternating sum $1-A_m$ can -at least formally- be rewritten as $$1-A_m = (1-1)(1-1/2^m)(1-1/3^m)\cdots$$ as @Achille hui has pointed out.

If that is a correct interpretation it is clear, that (if the product from the second term on converges for some m ) the complete result is zero for that same m.
This is backed by the observation, that if I remove the first (=zero)-parenthese, and then equivalently use $\zeta(\cdot)-1$ instead of $\zeta(\cdot)$ for the powersums, then for the well converging cases we seem to get again identity.

So if this is all "waterproof", then the question Q2 remains:

Q2: for which range of m (even from the complex numbers) do we have $1-A_m = 0$ ?

(I exclude so far all m , for which it can happen with some $k \in \mathbb N$ that $k\cdot m=1$) which simply means to avoid the occurence of $\zeta(1)$

Answer 1

We have $\zeta(k)=\sum_{m=1}^{\infty}\frac{1}{m^k}$

Define $\zeta(k,k)=\sum_{m=1}^{\infty}\frac{\prod_2 m}{m^k}$

where $\prod_2 m$ denotes the number of ways to express $m$ as a product of two distinct numbers(without counting orders, so $2\times 3= 3\times 2$ counted only once).

similarly define $\prod_r m$, the number of ways to express $m$ as a product of $r$ distinct numbers.

so that the $r$ th multiple zeta function value at $k$, satisfies $\zeta(k,\cdots,k) = \sum_{m=1}^{\infty} \frac{\prod_r m}{m^k}$.

Thus, the question boils down to checking whether $$ 1-\prod_2 m +\prod_3 m -+ \cdots + (-1)^{r-1} \prod_r m +\cdots = 0 $$ if $m\geq 2$.

Considering that multiplying $1$ is also counted, we see that expression with $1$ and without $1$ cancels out. Thus our claim is true.

For example with $m=6$, we have

(-) for $1\times 6$, $2\times 3$

(+) for $1\times 2\times 3$. Here $2\times 3$ and $1\times 2\times 3$ cancels out.

For $m=12$,

(-) for $1\times 12$, $2\times 6$, $3\times 4$.

(+) for $1\times 2\times 6$, $1\times 3\times 4$. Here $2\times 6$ and $1\times 2\times 6$. $3\times 4$ with $1\times 3\times 4$ cancel out.

Answer 2

If found a partial answer in this paper by Ihara, Kaneko and Zagier. Formula (4.6) $$\exp_\star(\log_\circ(1+z)) =\frac{1}{1-z}$$ implies $1 = \zeta(m) - \zeta(m,m) + \zeta(m,m,m) - \ldots$ for all natural numbers $m \geq 2$. I'll explain the notation and how the formula implies the result.

Put $z_m := x^{m-1}y$, a word over the alphabet $\{x,y\}$ (or a monomial in non-commutating variables $x,y$ if you prefer). One defines $$\zeta(z_{m_1}\cdots z_{m_n}) := \zeta(m_1,\ldots,m_n)$$ for $m_i \geq 1$, $m_1 \geq 2$. One extends this to (finite or infinite) sums by linearity and puts $\zeta(1) = 1$. For example, $$\zeta(xxyxxxy + xy + 1) = \zeta(3,4) + \zeta(2) + 1.$$ One defines the harmonic product inductively by $$1 \star w = w \star 1 = w,\\ z_k w_1 \star z_l w_2 = z_k(w_1 \star z_l w_2) + z_l(z_k w_1 \star w_2) + z_{k+l}(w_1 \star w_2).$$ A theorem says that $\zeta$ is a homomorphism with respect to "$\star$", i.e. $$\zeta(w_1 \star w_2) = \zeta(w_1) \zeta(w_2).$$ One also defines the circle product by $$w_1 \circ w_2 = w_1 \star w_2 - w_1w_2 - w_2w_1,$$ so in particular $z_k \circ z_l = z_{k+l}$. Then, with $$\exp_\star(z) := 1 + z + \frac{1}{2} z\star z + \ldots,\\ \log_\circ(1+z) := z - \frac{1}{2} z \circ z + \frac{1}{3} z \circ z \circ z - \ldots,\\ \frac{1}{1-z} := 1 + z + z^2 + z^3 + \ldots$$ one has the formula stated above: $$\exp_\star(\log_\circ(1+z)) =\frac{1}{1+z}.$$ Putting $z := -z_m$ and applying $\zeta$, the right hand side gives $$\zeta(1 - z_m + z_m^2 - z_m^3 + \ldots) = 1 - \zeta(m) + \zeta(m,m) - \zeta(m,m,m) + \ldots$$ and the left hand side gives \begin{align*} \zeta(\exp_\star(\log_\circ(1-z_m))) &= \exp(\zeta(\log_\circ(1-z_m))) \\ &= \exp(-\sum_{n = 1}^\infty \frac{1}{n} \zeta(z_{mn}))\\ &= 0 \end{align*} since $\sum_{n = 1}^\infty \frac{1}{n} \zeta(z_{mn}) \geq \sum_{n = 1}^\infty \frac{1}{n} = \infty$. Equating the two yields $$1 - \zeta(m) + \zeta(m,m) - \zeta(m,m,m) + \ldots = 0.$$

Answer 3

Given any sequence $(u_i)_{i\in\mathbb{Z}_{+}}$ with $u_i \in [0,1]$ and $\sum_{i=1}^{\infty} u_i < \infty$, we have:

$$\prod_{i=1}^{\infty} (1 - u_i ) = 1 + \sum_{k=1}^{\infty} (-1)^k \prod_{0 < i_1 < \ldots < i_k} u_{i_1}\cdots u_{i_k}$$

The RHS converges absolutely as a series because the $k^{th}$ term of it:

$$\prod_{0 < i_1 < \ldots < i_k} u_{i_1}\cdots u_{i_k} < \frac{1}{k!}\left(\sum_{i=1}^{\infty} u_i\right)^k$$

is bounded by the $k^{th}$ term of expansion of $\exp( \sum_{i=1}^{\infty} u_i)$.

Apply this to $u_n = n^{-m}$ where $m \ge 2$ and notice $u_1 = 1$, we get:

$$0 = 1 - \zeta(m) + \zeta(m,m) - \zeta(m,m,m) + \cdots$$

Answer 4

(This is not a new answer but just an additional example of data, reflecting the comment of @Achille hui concerning $\Re(m) \lt 1$)

Here is a list of the first few multiple zetas and the partial sums of the alternating series for $m=\sqrt{0.5}$ where the series-representation of $\zeta(m)$ is not convergent (and none of the powersums equals the $\zeta(1)$): $$ \small \small \begin{array} {r|r|r} k & \zeta_k(m) \text{ : k'th mult.} \zeta() & \text{partial altern. sum} \\ \hline 1 & -2.85873148777 & -2.85873148777 \\ 2 & 2.57580401985 & -5.43453550762 \\ 3 & 0.938727829684 & -4.49580767793 \\ 4 & -4.02972075888 & -0.466086919058 \\ 5 & 3.46585761472 & 2.99977069567 \\ 6 & -0.626085735043 & 3.62585643071 \\ 7 & -1.29780958922 & 2.32804684149 \\ 8 & 1.28297262963 & 1.04507421187 \\ 9 & -0.436367742286 & 0.608706469581 \\ 10 & -0.122662257866 & 0.731368727447 \\ 11 & 0.200808483827 & 0.932177211274 \\ 12 & -0.0882083797854 & 1.02038559106 \\ 13 & 0.00437308895501 & 1.02475868001 \\ 14 & 0.0155665983724 & 1.00919208164 \\ 15 & -0.00874359614267 & 1.00044848550 \\ \cdots & \cdots &\cdots \\ 60 & -1.92516635703E-31 & 1.00000000000 \\ 61 & -2.39632638182E-33 & 1.00000000000 \\ 62 & 5.31122663432E-33 & 1.00000000000 \\ 63 & -9.45648541011E-34 & 1.00000000000 \\ 64 & 4.89013667885E-35 & 1.00000000000 \\ \cdots & \cdots &\cdots \\ \end{array} $$ This looks similar with any value $m \gt 0$, only that the index k from where the multiple zetas begin to vanish may become higher. We can even use complex m, for instance from the nontrivial roots and can directly or Eulersum the alternating series ...

Here is a list using the negative value $m=-1$. The alternating series needs now a procedure for divergent summation, like Borel-summation (it seems, that Euler-summation may not suffice) . We get $$ \small \small \begin{array} {r|r|r} k & \zeta_k(-1) \text{ : k'th mult.} \zeta() & \text{partial altern. sum} \\ & & \text{divergent summation } \\ \hline 1 & -0.0833333333333 & -0.0833333333333 \\ 2 & 0.00347222222222 & -0.0848429951691 \\ 3 & 0.00268132716049 & -0.0852728890865 \\ 4 & -0.000229472093621 & -0.0853089197972 \\ 5 & -0.000784039221720 & -0.0852036275208 \\ 6 & 0.0000697281375837 & -0.0850590273088 \\ 7 & 0.000592166437354 & -0.0849170033670 \\ 8 & -0.0000517179090826 & -0.0847934738378 \\ 9 & -0.000839498720672 & -0.0846927757523 \\ 10 & 0.0000720489541602 & -0.0846141577213 \\ 11 & 0.00191443849857 & -0.0845548301287 \\ 12 & -0.000162516262784 & -0.0845114155482 \\ 13 & -0.00640336283381 & -0.0844806229031 \\ 14 & 0.000540164767893 & -0.0844595354062 \\ 15 & 0.0295278809457 & -0.0844457052452 \\ 16 & -0.00248174360026 & -0.0844371535103 \\ 17 & -0.179540117061 & -0.0844323265957 \\ 18 & 0.0150561130400 & -0.0844300358670 \\ 19 & 1.39180109327 & -0.0844293944146 \\ 20 & -0.116546276599 & -0.0844297577262 \\ 21 & -13.3979854551 & -0.0844306713024 \\ 22 & 1.12080446429 & -0.0844318261930 \\ 23 & 156.801412704 & -0.0844330223409 \\ 24 & -13.1078630226 & -0.0844341390840 \\ 25 & -2192.55553609 & -0.0844351119332 \\ \cdots & \cdots &\cdots \\ 60 & -5.03959577267E29 & -0.0844375513246 \\ 61 & -5.42046040306E32 & -0.0844375514123 \\ 62 & 4.51885202016E31 & -0.0844375514570 \\ 63 & 5.19276945836E34 & -0.0844375514751 \\ 64 & -4.32892308840E33 & -0.0844375514782 \\ \cdots & \cdots &\cdots \\ \end{array} $$
Using Wolframalpha for a guess for the result we find that possibly $$ A_{-1} \underset{\text{guessed}}{=} 1-{\exp(1) \over \sqrt{2\pi}} \sim -0.084437551419227546612 $$

[update 2] It seems, there is an alternative formula for the computation of the $A_m$ possible, however I've still no well working summation procedure for the resulting alternative, but still divergent, series.

First, for smoothing everything let's introduce the function $$ B(m) = 1- A_m = 1- \zeta(m) + \zeta(m,m) - \zeta(m,m,m) + \ldots - \ldots $$ Next, let's formally rewrite this as infinite product $$ P(m) = (1-1^{m})(1-1/2^{m}) (1-1/3^{m}) \ldots \underset{\text{formally}}{=}B(m)$$ Then the log of $P(m)$ is a sum of logs $$ L(m)=\log(P(m)) = \log(1-1^{m}) + \log(1-1/2^{m}) + \log(1-1/3^{m}) \ldots $$which can be rewritten as a double series involving the well known Mercator-series for the logarithm. Then we change order of summation; this seem to result -again formally- in the following sum of zetas $$ L(m)= -\zeta(1m)/1 - \zeta(2m)/2 - \zeta(3m)/3 - \ldots $$ Of course, all this is just handwaving and needs formal justification.

However, just feeding the latter formula, using $m=-1$ into a summation-procedure for divergent summation I arrive at the same result as with the original computation: $$ B(-1) = \exp(L(-1)) \underset{\mathfrak N}{=} {\exp(1) \over \sqrt{2 \pi}}$$ where $ \mathfrak N$ indicates a customized Noerlund procedure for divergent summation.

So we may take the hypothesis as granted, that this replacement of the original computation is valid. Unfortunately it is still strongly diverging, and the rate of growth increases with the absolute value of m (unless of course m is a multiple of $-2$). Here are a couple more rough estimates: $$ \small \begin{array} {r|lr} m & B(m) (\text{ using } \mathfrak N ) \\ \hline -1 & 1.0844375514192275466 & \qquad (= 1-A_{-1} )\\ -1/2 & 1.2904007518681174634 \\ -1/3 & 1.48044921903 \\ -1/4 & 1.65184851943 \end{array} $$