Multiple zeta function

Short description: Generalizations of the Riemann zeta function

In mathematics, the multiple zeta functions are generalizations of the Riemann zeta function, defined by

[math]\displaystyle{ \zeta(s_1,\ldots,s_k) = \sum_{n_1 \gt n_2 \gt \cdots \gt n_k \gt 0}\ \frac{1}{n_1^{s_1} \cdots n_k^{s_k}} = \sum_{n_1 \gt n_2 \gt \cdots \gt n_k \gt 0}\ \prod_{i=1}^k \frac{1}{n_i^{s_i}},\! }[/math]

and converge when Re(s₁) + ... + Re(s_i) > i for all i. Like the Riemann zeta function, the multiple zeta functions can be analytically continued to be meromorphic functions (see, for example, Zhao (1999)). When s₁, ..., s_k are all positive integers (with s₁ > 1) these sums are often called multiple zeta values (MZVs) or Euler sums. These values can also be regarded as special values of the multiple polylogarithms.

The k in the above definition is named the "depth" of a MZV, and the n = s₁ + ... + s_k is known as the "weight".

The standard shorthand for writing multiple zeta functions is to place repeating strings of the argument within braces and use a superscript to indicate the number of repetitions. For example,

[math]\displaystyle{ \zeta(2,1,2,1,3) = \zeta(\{2,1\}^2,3). }[/math]

Definition

Multiple zeta functions arise as special cases of the multiple polylogarithms

[math]\displaystyle{ \mathrm{Li}_{s_1,\ldots,s_d}(\mu_1,\ldots,\mu_d) = \sum\limits_{k_1\gt \cdots\gt k_d\gt 0}\frac{\mu_1^{k_1}\cdots\mu_d^{k_d}}{k_1^{s_1}\cdots k_d^{s_d}} }[/math]

which are generalizations of the polylogarithm functions. When all of the [math]\displaystyle{ \mu_i }[/math] are n^th roots of unity and the [math]\displaystyle{ s_i }[/math] are all nonnegative integers, the values of the multiple polylogarithm are called colored multiple zeta values of level [math]\displaystyle{ n }[/math]. In particular, when [math]\displaystyle{ n=2 }[/math], they are called Euler sums or alternating multiple zeta values, and when [math]\displaystyle{ n=1 }[/math] they are simply called multiple zeta values. Multiple zeta values are often written

[math]\displaystyle{ \zeta(s_1,\ldots,s_d) = \sum\limits_{k_1 \gt \cdots \gt k_d \gt 0} \frac{1}{k_1^{s_1}\cdots k_d^{s_d}} }[/math]

and Euler sums are written

[math]\displaystyle{ \zeta(s_1,\ldots,s_d;\varepsilon_1,\ldots,\varepsilon_d) = \sum\limits_{k_1 \gt \cdots \gt k_d \gt 0} \frac{\varepsilon_1^{k_1}\cdots \varepsilon^{k_d}}{k_1^{s_1}\cdots k_d^{s_d}} }[/math]

where [math]\displaystyle{ \varepsilon_i = \pm 1 }[/math]. Sometimes, authors will write a bar over an [math]\displaystyle{ s_i }[/math] corresponding to an [math]\displaystyle{ \varepsilon_i }[/math] equal to [math]\displaystyle{ -1 }[/math], so for example

[math]\displaystyle{ \zeta(\overline{a},b) = \zeta(a,b;-1,1) }[/math].

Integral structure and identities

It was noticed by Kontsevich that it is possible to express colored multiple zeta values (and thus their special cases) as certain multivariable integrals. This result is often stated with the use of a convention for iterated integrals, wherein

[math]\displaystyle{ \int_0^x f_1(t) dt \cdots f_d(t) dt = \int_0^x f_1(t_1)\left(\int_0^{t_1}f_2(t_2)\left(\int_0^{t_2} \cdots \left( \int_0^{t_d} f_d(t_d) dt_d\right)\right)dt_2\right)dt_1 }[/math]

Using this convention, the result can be stated as follows:

[math]\displaystyle{ \mathrm{Li}_{s_1,\ldots,s_d}(\mu_1,\ldots,\mu_d) = \int_0^1 \left(\frac{dt}{t}\right)^{s_1-1}\frac{dt}{a_1-t}\cdots \left(\frac{dt}{t}\right)^{s_d-1} \frac{dt}{a_d-t} }[/math] where [math]\displaystyle{ a_j = \prod\limits_{i=1}^j \mu_i^{-1} }[/math] for [math]\displaystyle{ j = 1,2,\ldots,d }[/math].

This result is extremely useful due to a well-known result regarding products of iterated integrals, namely that

[math]\displaystyle{ \left(\int_0^x f_1(t)dt \cdots f_n(t) dt \right)\!\left(\int_0^x f_{n+1}(t)dt\cdots f_m(t) dt \right) = \sum\limits_{\sigma \in \mathfrak{Sh}_{n,m}}\int_0^x f_{\sigma(1)}(t)\cdots f_{\sigma(m)}(t) }[/math] where [math]\displaystyle{ \mathfrak{Sh}_{n,m}=\{\sigma \in S_m \mid \sigma(1)\lt \cdots\lt \sigma(n), \sigma(n+1)\lt \cdots\lt \sigma(m)\} }[/math] and [math]\displaystyle{ S_m }[/math] is the symmetric group on [math]\displaystyle{ m }[/math] symbols.

To utilize this in the context of multiple zeta values, define [math]\displaystyle{ X = \{a,b\} }[/math], [math]\displaystyle{ X^* }[/math] to be the free monoid generated by [math]\displaystyle{ X }[/math] and [math]\displaystyle{ \mathfrak{A} }[/math] to be the free [math]\displaystyle{ \Q }[/math]-vector space generated by [math]\displaystyle{ X^* }[/math]. [math]\displaystyle{ \mathfrak{A} }[/math] can be equipped with the shuffle product, turning it into an algebra. Then, the multiple zeta function can be viewed as an evaluation map, where we identify [math]\displaystyle{ a = \frac{dt}{t} }[/math], [math]\displaystyle{ b = \frac{dt}{1-t} }[/math], and define

[math]\displaystyle{ \zeta(\mathbf{w}) = \int_0^1 \mathbf{w} }[/math] for any [math]\displaystyle{ \mathbf{w} \in X^* }[/math],

which, by the aforementioned integral identity, makes

[math]\displaystyle{ \zeta(a^{s_1-1}b\cdots a^{s_d-1}b) = \zeta(s_1,\ldots,s_d). }[/math]

Then, the integral identity on products gives

[math]\displaystyle{ \zeta(w)\zeta(v) = \zeta(w \text{ ⧢ } v). }[/math]

Two parameters case

In the particular case of only two parameters we have (with s > 1 and n, m integers):

[math]\displaystyle{ \zeta(s,t) = \sum_{n \gt m \geq 1} \ \frac{1}{n^{s} m^{t}} = \sum_{n=2}^{\infty} \frac{1}{n^{s}} \sum_{m=1}^{n-1} \frac{1}{m^t} = \sum_{n=1}^{\infty} \frac{1}{(n+1)^{s}} \sum_{m=1}^{n} \frac{1}{m^t} }[/math]

[math]\displaystyle{ \zeta(s,t) = \sum_{n=1}^\infty \frac{H_{n,t}}{(n+1)^s} }[/math] where [math]\displaystyle{ H_{n,t} }[/math] are the generalized harmonic numbers.

Multiple zeta functions are known to satisfy what is known as MZV duality, the simplest case of which is the famous identity of Euler:

[math]\displaystyle{ \sum_{n=1}^\infty \frac{H_n}{(n+1)^2} = \zeta(2,1) = \zeta(3) = \sum_{n=1}^\infty \frac{1}{n^3},\! }[/math]

where H_n are the harmonic numbers.

Special values of double zeta functions, with s > 0 and even, t > 1 and odd, but s+t = 2N+1 (taking if necessary ζ(0) = 0):

[math]\displaystyle{ \zeta(s,t) = \zeta(s)\zeta(t) + \tfrac{1}{2}\Big[\tbinom{s+t}{s}-1\Big]\zeta(s+t) - \sum_{r=1}^{N-1}\Big[\tbinom{2r}{s-1}+\tbinom{2r}{t-1}\Big]\zeta(2r+1)\zeta(s+t-1-2r) }[/math]

s	t	approximate value	explicit formulae	OEIS
2	2	0.811742425283353643637002772406	[math]\displaystyle{ \tfrac{3}{4}\zeta(4) }[/math]	A197110
3	2	0.228810397603353759768746148942	[math]\displaystyle{ 3\zeta(2)\zeta(3)-\tfrac{11}{2}\zeta(5) }[/math]	A258983
4	2	0.088483382454368714294327839086	[math]\displaystyle{ \left (\zeta(3)\right )^2-\tfrac{4}{3}\zeta(6) }[/math]	A258984
5	2	0.038575124342753255505925464373	[math]\displaystyle{ 5\zeta(2)\zeta(5)+2\zeta(3)\zeta(4)-11\zeta(7) }[/math]	A258985
6	2	0.017819740416835988362659530248		A258947
2	3	0.711566197550572432096973806086	[math]\displaystyle{ \tfrac{9}{2}\zeta(5)-2\zeta(2)\zeta(3) }[/math]	A258986
3	3	0.213798868224592547099583574508	[math]\displaystyle{ \tfrac{1}{2}\left (\left (\zeta(3)\right )^2 -\zeta(6)\right ) }[/math]	A258987
4	3	0.085159822534833651406806018872	[math]\displaystyle{ 17\zeta(7)-10\zeta(2)\zeta(5) }[/math]	A258988
5	3	0.037707672984847544011304782294	[math]\displaystyle{ 5\zeta(3)\zeta(5)-\tfrac{147}{24}\zeta(8)-\tfrac{5}{2}\zeta(6,2) }[/math]	A258982
2	4	0.674523914033968140491560608257	[math]\displaystyle{ \tfrac{25}{12}\zeta(6)-\left (\zeta(3)\right )^2 }[/math]	A258989
3	4	0.207505014615732095907807605495	[math]\displaystyle{ 10\zeta(2)\zeta(5)+\zeta(3)\zeta(4)-18\zeta(7) }[/math]	A258990
4	4	0.083673113016495361614890436542	[math]\displaystyle{ \tfrac{1}{2}\left (\left (\zeta(4)\right )^2 -\zeta(8)\right ) }[/math]	A258991

Note that if [math]\displaystyle{ s+t=2p+2 }[/math] we have [math]\displaystyle{ p/3 }[/math] irreducibles, i.e. these MZVs cannot be written as function of [math]\displaystyle{ \zeta(a) }[/math] only.

Three parameters case

In the particular case of only three parameters we have (with a > 1 and n, j, i integers):

[math]\displaystyle{ \zeta(a,b,c) = \sum_{n \gt j \gt i \geq 1}\ \frac{1}{n^{a} j^{b} i^{c}} = \sum_{n=1}^{\infty} \frac{1}{(n+2)^{a}} \sum_{j=1}^n \frac{1}{(j+1)^b} \sum_{i=1}^{j} \frac{1}{(i)^c} = \sum_{n=1}^{\infty} \frac{1}{(n+2)^{a}} \sum_{j=1}^n \frac{H_{j,c}}{(j+1)^b} }[/math]

Euler reflection formula

The above MZVs satisfy the Euler reflection formula:

[math]\displaystyle{ \zeta(a,b)+\zeta(b,a)=\zeta(a)\zeta(b)-\zeta(a+b) }[/math] for [math]\displaystyle{ a,b\gt 1 }[/math]

Using the shuffle relations, it is easy to prove that:

[math]\displaystyle{ \zeta(a,b,c)+\zeta(a,c,b)+\zeta(b,a,c)+\zeta(b,c,a)+\zeta(c,a,b)+\zeta(c,b,a)=\zeta(a)\zeta(b)\zeta(c)+2\zeta(a+b+c)-\zeta(a)\zeta(b+c)-\zeta(b)\zeta(a+c)-\zeta(c)\zeta(a+b) }[/math] for [math]\displaystyle{ a,b,c\gt 1 }[/math]

This function can be seen as a generalization of the reflection formulas.

Symmetric sums in terms of the zeta function

Let [math]\displaystyle{ S(i_1,i_2,\cdots,i_k) = \sum_{n_1 \geq n_2 \geq\cdots n_k \geq 1}\frac{1}{n_1^{i_1} n_2^{i_2}\cdots n_k^{i_k}} }[/math], and for a partition [math]\displaystyle{ \Pi=\{P_1, P_2, \dots,P_l\} }[/math] of the set [math]\displaystyle{ \{1,2,\dots,k\} }[/math], let [math]\displaystyle{ c(\Pi) = (\left|P_1\right|-1)!(\left|P_2\right|-1)!\cdots(\left|P_l\right|-1)! }[/math]. Also, given such a [math]\displaystyle{ \Pi }[/math] and a k-tuple [math]\displaystyle{ i=\{i_1,...,i_k\} }[/math] of exponents, define [math]\displaystyle{ \prod_{s=1}^l \zeta(\sum_{j \in P_s} i_j) }[/math].

The relations between the [math]\displaystyle{ \zeta }[/math] and [math]\displaystyle{ S }[/math] are: [math]\displaystyle{ S(i_1,i_2)=\zeta(i_1,i_2)+\zeta(i_1+i_2) }[/math] and [math]\displaystyle{ S(i_1,i_2,i_3)=\zeta(i_1,i_2,i_3)+\zeta(i_1+i_2,i_3)+\zeta(i_1,i_2+i_3)+\zeta(i_1+i_2+i_3). }[/math]

Theorem 1 (Hoffman)

For any real [math]\displaystyle{ i_1,\cdots,i_k \gt 1, }[/math], [math]\displaystyle{ \sum_{{\sigma \in \Sigma_k}}S(i_{\sigma(1)}, \dots, i_{\sigma(k)}) = \sum_{\text{partitions } \Pi \text{ of } \{1,\dots,k\}}c(\Pi)\zeta(i,\Pi) }[/math].

Proof. Assume the [math]\displaystyle{ i_j }[/math] are all distinct. (There is no loss of generality, since we can take limits.) The left-hand side can be written as [math]\displaystyle{ \sum_{\sigma}\sum_{n_1\geq n_2 \geq \cdots \geq n_k \geq1} \frac{1}{{n^{i_1}}_{\sigma(1)}{n^{i_2}}_{\sigma(2)} \cdots {n^{i_k}}_{\sigma(k)} } }[/math]. Now thinking on the symmetric

group [math]\displaystyle{ \Sigma_k }[/math] as acting on k-tuple [math]\displaystyle{ n = (1,\cdots,k) }[/math] of positive integers. A given k-tuple [math]\displaystyle{ n=(n_1,\cdots,n_k) }[/math] has an isotropy group

[math]\displaystyle{ \Sigma_k(n) }[/math] and an associated partition [math]\displaystyle{ \Lambda }[/math] of [math]\displaystyle{ (1,2,\cdots,k) }[/math]: [math]\displaystyle{ \Lambda }[/math] is the set of equivalence classes of the relation given by [math]\displaystyle{ i \sim j }[/math] iff [math]\displaystyle{ n_i=n_j }[/math], and [math]\displaystyle{ \Sigma_k(n) = \{\sigma \in \Sigma_k : \sigma(i) \sim \forall i\} }[/math]. Now the term [math]\displaystyle{ \frac{1} {{n^{i_1}}_{\sigma(1)}{n^{i_2}}_{\sigma(2)} \cdots {n^{i_k}}_{\sigma(k)}} }[/math] occurs on the left-hand side of [math]\displaystyle{ \sum_{{\sigma \in \Sigma_k}}S(i_{\sigma(1)}, \dots, i_{\sigma(k)}) = \sum_{\text{partitions } \Pi \text{ of } \{1,\dots,k\}}c(\Pi)\zeta(i,\Pi) }[/math] exactly [math]\displaystyle{ \left| \Sigma_k(n) \right| }[/math] times. It occurs on the right-hand side in those terms corresponding to partitions [math]\displaystyle{ \Pi }[/math] that are refinements of [math]\displaystyle{ \Lambda }[/math]: letting [math]\displaystyle{ \succeq }[/math] denote refinement, [math]\displaystyle{ \frac{1} {{n^{i_1}}_{\sigma(1)}{n^{i_2}}_{\sigma(2)} \cdots {n^{i_k}}_{\sigma(k)}} }[/math] occurs [math]\displaystyle{ \sum_{\Pi\succeq\Lambda}(\Pi) }[/math] times. Thus, the conclusion will follow if [math]\displaystyle{ \left| \Sigma_k(n) \right| =\sum_{\Pi\succeq\Lambda}c(\Pi) }[/math] for any k-tuple [math]\displaystyle{ n=\{n_1,\cdots,n_k\} }[/math] and associated partition [math]\displaystyle{ \Lambda }[/math]. To see this, note that [math]\displaystyle{ c(\Pi) }[/math] counts the permutations having cycle type specified by [math]\displaystyle{ \Pi }[/math]: since any elements of [math]\displaystyle{ \Sigma_k(n) }[/math] has a unique cycle type specified by a partition that refines [math]\displaystyle{ \Lambda }[/math], the result follows.

For [math]\displaystyle{ k=3 }[/math], the theorem says [math]\displaystyle{ \sum_{{\sigma \in \Sigma_3}}S(i_{\sigma(1)},i_{\sigma(2)},i_{\sigma(3)}) = \zeta(i_1)\zeta(i_2)\zeta(i_3)+\zeta(i_1+i_2)\zeta(i_3)+\zeta(i_1)\zeta(i_2+i_3)+\zeta(i_1+i_3)\zeta(i_2)+2\zeta(i_1+i_2+i_3) }[/math] for [math]\displaystyle{ i_1,i_2,i_3\gt 1 }[/math]. This is the main result of.

Having [math]\displaystyle{ \zeta(i_1,i_2,\cdots,i_k)=\sum_{n_1\gt n_2\gt \cdots n_k\geq1}\frac{1}{n_1^{i_1} n_2^{i_2}\cdots n_k^{i_k}} }[/math]. To state the analog of Theorem 1 for the [math]\displaystyle{ \zeta's }[/math], we require one bit of notation. For a partition

[math]\displaystyle{ \Pi = \{P_1,\cdots,P_l\} }[/math] of [math]\displaystyle{ \{1,2\cdots,k\} }[/math], let [math]\displaystyle{ \tilde{c}(\Pi)=(-1)^{k-l}c(\Pi) }[/math].

Theorem 2 (Hoffman)

For any real [math]\displaystyle{ i_1,\cdots,i_k\gt 1 }[/math], [math]\displaystyle{ \sum_{{\sigma \in \Sigma_k}}\zeta(i_{\sigma(1)}, \dots, i_{\sigma(k)})=\sum_{\text{partitions } \Pi \text{ of } \{1,\dots,k\}}\tilde{c}(\Pi)\zeta(i,\Pi) }[/math].

Proof. We follow the same line of argument as in the preceding proof. The left-hand side is now [math]\displaystyle{ \sum_{\sigma}\sum_{n_1 \gt n_2 \gt \cdots \gt n_k \geq1} \frac{1}{{n^{i_1}}_{\sigma(1)}{n^{i_2}}_{\sigma(2)} \cdots {n^{i_k}}_{\sigma(k)} } }[/math], and a term [math]\displaystyle{ \frac{1}{n^{i_1}_{1}n^{i_2}_{2} \cdots n^{i_k}_{k}} }[/math] occurs on the left-hand since once if all the [math]\displaystyle{ n_i }[/math] are distinct, and not at all otherwise. Thus, it suffices to show [math]\displaystyle{ \sum_{\Pi\succeq\Lambda}\tilde{c}(\Pi)=\begin{cases} 1,\text{ if } \left| \Lambda \right|=k \\ 0, \text{ otherwise }. \end{cases} }[/math] (1)

To prove this, note first that the sign of [math]\displaystyle{ \tilde{c}(\Pi) }[/math] is positive if the permutations of cycle type [math]\displaystyle{ \Pi }[/math] are even, and negative if they are odd: thus, the left-hand side of (1) is the signed sum of the number of even and odd permutations in the isotropy group [math]\displaystyle{ \Sigma_k(n) }[/math]. But such an isotropy group has equal numbers of even and odd permutations unless it is trivial, i.e. unless the associated partition [math]\displaystyle{ \Lambda }[/math] is [math]\displaystyle{ \{\{1\},\{2\},\cdots,\{k\}\} }[/math].

The sum and duality conjectures

We first state the sum conjecture, which is due to C. Moen.

Sum conjecture (Hoffman). For positive integers k and n, [math]\displaystyle{ \sum_{i_1+\cdots+i_k=n, i_1\gt 1}\zeta(i_1,\cdots,i_k) = \zeta(n) }[/math], where the sum is extended over k-tuples [math]\displaystyle{ i_1,\cdots,i_k }[/math] of positive integers with [math]\displaystyle{ i_1\gt 1 }[/math].

Three remarks concerning this conjecture are in order. First, it implies [math]\displaystyle{ \sum_{i_1+\cdots+i_k=n, i_1\gt 1}S(i_1,\cdots,i_k)={n-1\choose k-1}\zeta(n) }[/math]. Second, in the case [math]\displaystyle{ k=2 }[/math] it says that [math]\displaystyle{ \zeta(n-1,1)+\zeta(n-2,2)+\cdots+\zeta(2,n-2)=\zeta(n) }[/math], or using the relation between the [math]\displaystyle{ \zeta's }[/math] and [math]\displaystyle{ S's }[/math] and Theorem 1, [math]\displaystyle{ 2S(n-1,1)=(n+1)\zeta(n)-\sum_{k=2}^{n-2}\zeta(k)\zeta(n-k). }[/math]

This was proved by Euler and has been rediscovered several times, in particular by Williams. Finally, C. Moen has proved the same conjecture for k=3 by lengthy but elementary arguments. For the duality conjecture, we first define an involution [math]\displaystyle{ \tau }[/math] on the set [math]\displaystyle{ \Im }[/math] of finite sequences of positive integers whose first element is greater than 1. Let [math]\displaystyle{ \Tau }[/math] be the set of strictly increasing finite sequences of positive integers, and let [math]\displaystyle{ \Sigma : \Im \rightarrow \Tau }[/math] be the function that sends a sequence in [math]\displaystyle{ \Im }[/math] to its sequence of partial sums. If [math]\displaystyle{ \Tau_n }[/math] is the set of sequences in [math]\displaystyle{ \Tau }[/math] whose last element is at most [math]\displaystyle{ n }[/math], we have two commuting involutions [math]\displaystyle{ R_n }[/math] and [math]\displaystyle{ C_n }[/math] on [math]\displaystyle{ \Tau_n }[/math] defined by [math]\displaystyle{ R_n(a_1,a_2,\dots,a_l)=(n+1-a_l,n+1-a_{l-1},\dots,n+1-a_1) }[/math] and [math]\displaystyle{ C_n(a_1,\dots,a_l) }[/math] = complement of [math]\displaystyle{ \{a_1,\dots,a_l\} }[/math] in [math]\displaystyle{ \{1,2,\dots,n\} }[/math] arranged in increasing order. The our definition of [math]\displaystyle{ \tau }[/math] is [math]\displaystyle{ \tau(I) = \Sigma^{-1}R_nC_n\Sigma(I) = \Sigma^{-1}C_nR_n\Sigma(I) }[/math] for [math]\displaystyle{ I=(i_1,i_2,\dots,i_k) \in \Im }[/math] with [math]\displaystyle{ i_1+\cdots+i_k=n }[/math].

For example, [math]\displaystyle{ \tau(3,4,1) = \Sigma^{-1}C_8R_8(3,7,8) = \Sigma^{-1}(3,4,5,7,8) = (3,1,1,2,1). }[/math] We shall say the sequences [math]\displaystyle{ (i_1,\dots,i_k) }[/math] and [math]\displaystyle{ \tau(i_1,\dots,i_k) }[/math] are dual to each other, and refer to a sequence fixed by [math]\displaystyle{ \tau }[/math] as self-dual.

Duality conjecture (Hoffman). If [math]\displaystyle{ (h_1,\dots,h_{n-k}) }[/math] is dual to [math]\displaystyle{ (i_1,\dots,i_k) }[/math], then [math]\displaystyle{ \zeta(h_1,\dots,h_{n-k}) = \zeta(i_1,\dots,i_k) }[/math].

This sum conjecture is also known as Sum Theorem, and it may be expressed as follows: the Riemann zeta value of an integer n ≥ 2 is equal to the sum of all the valid (i.e. with s₁ > 1) MZVs of the partitions of length k and weight n, with 1 ≤ k ≤ n − 1. In formula:

[math]\displaystyle{ \sum_\stackrel{s_1 + \cdots + s_k=n}{s_1\gt 1}\zeta(s_1, \ldots, s_k) = \zeta(n). }[/math]

For example, with length k = 2 and weight n = 7:

[math]\displaystyle{ \zeta(6,1)+\zeta(5,2)+\zeta(4,3)+\zeta(3,4)+\zeta(2,5) = \zeta(7). }[/math]

Euler sum with all possible alternations of sign

The Euler sum with alternations of sign appears in studies of the non-alternating Euler sum.

Notation

[math]\displaystyle{ \sum_{n=1}^\infty \frac{H_n^{(b)}(-1)^{(n+1)}}{(n+1)^a}=\zeta(\bar{a},b) }[/math] with [math]\displaystyle{ H_n^{(b)}=+1+\frac{1}{2^b}+\frac{1}{3^b}+\cdots }[/math] are the generalized harmonic numbers.

[math]\displaystyle{ \sum_{n=1}^\infty \frac{\bar{H}_n^{(b)}}{(n+1)^a}=\zeta(a,\bar{b}) }[/math] with [math]\displaystyle{ \bar{H}_n^{(b)}=-1+\frac{1}{2^b}-\frac{1}{3^b}+\cdots }[/math]

[math]\displaystyle{ \sum_{n=1}^\infty \frac{\bar{H}_n^{(b)}(-1)^{(n+1)}}{(n+1)^a}=\zeta(\bar{a},\bar{b}) }[/math]

[math]\displaystyle{ \sum_{n=1}^\infty \frac{(-1)^{n}}{(n+2)^a}\sum_{n=1}^\infty \frac{\bar{H}_n^{(c)}(-1)^{(n+1)}}{(n+1)^b} =\zeta(\bar{a},\bar{b},\bar{c}) }[/math] with [math]\displaystyle{ \bar{H}_n^{(c)}=-1+\frac{1}{2^c}-\frac{1}{3^c}+\cdots }[/math]

[math]\displaystyle{ \sum_{n=1}^\infty \frac{(-1)^{n}}{(n+2)^a}\sum_{n=1}^\infty \frac{H_n^{(c)}}{(n+1)^b}=\zeta(\bar{a},b,c) }[/math] with [math]\displaystyle{ H_n^{(c)}=+1+\frac{1}{2^c}+\frac{1}{3^c}+\cdots }[/math]

[math]\displaystyle{ \sum_{n=1}^\infty \frac{1}{(n+2)^a}\sum_{n=1}^\infty \frac{H_n^{(c)}(-1)^{(n+1)}}{(n+1)^b}=\zeta(a,\bar{b},c) }[/math]

[math]\displaystyle{ \sum_{n=1}^\infty \frac{1}{(n+2)^a}\sum_{n=1}^\infty \frac{\bar{H}_n^{(c)}}{(n+1)^b}=\zeta(a,b,\bar{c}) }[/math]

As a variant of the Dirichlet eta function we define

[math]\displaystyle{ \phi(s) = \frac{1-2^{(s-1)}} {2^{(s-1)}} \zeta(s) }[/math] with [math]\displaystyle{ s\gt 1 }[/math]

[math]\displaystyle{ \phi(1) = -\ln 2 }[/math]

Reflection formula

The reflection formula [math]\displaystyle{ \zeta(a,b)+\zeta(b,a)=\zeta(a)\zeta(b)-\zeta(a+b) }[/math] can be generalized as follows:

[math]\displaystyle{ \zeta(a,\bar{b})+\zeta(\bar{b},a)=\zeta(a)\phi(b)-\phi(a+b) }[/math]

[math]\displaystyle{ \zeta(\bar{a},b)+\zeta(b,\bar{a})=\zeta(b)\phi(a)-\phi(a+b) }[/math]

[math]\displaystyle{ \zeta(\bar{a},\bar{b})+\zeta(\bar{b},\bar{a})=\phi(a)\phi(b)-\zeta(a+b) }[/math]

if [math]\displaystyle{ a=b }[/math] we have [math]\displaystyle{ \zeta(\bar{a},\bar{a})=\tfrac{1}{2}\Big[\phi^2(a)-\zeta(2a)\Big] }[/math]

Other relations

Using the series definition it is easy to prove:

[math]\displaystyle{ \zeta(a,b)+\zeta(a,\bar{b})+\zeta(\bar{a},b)+\zeta(\bar{a},\bar{b})=\frac{\zeta(a,b)}{2^{(a+b-2)}} }[/math] with [math]\displaystyle{ a\gt 1 }[/math]

[math]\displaystyle{ \zeta(a,b,c)+\zeta(a,b,\bar{c})+\zeta(a,\bar{b},c)+\zeta(\bar{a},b,c)+\zeta(a,\bar{b},\bar{c})+\zeta(\bar{a},b,\bar{c})+\zeta(\bar{a},\bar{b},c)+\zeta(\bar{a},\bar{b},\bar{c})=\frac{\zeta(a,b,c)}{2^{(a+b+c-3)}} }[/math] with [math]\displaystyle{ a\gt 1 }[/math]

A further useful relation is:

[math]\displaystyle{ \zeta(a,b)+\zeta(\bar{a},\bar{b})=\sum_{s\gt 0} (a+b-s-1)!\Big[\frac{Z_a(a+b-s,s)}{(a-s)!(b-1)!}+\frac{Z_b(a+b-s,s)}{(b-s)!(a-1)!}\Big] }[/math]

where [math]\displaystyle{ Z_a(s,t)=\zeta(s,t)+\zeta(\bar{s},t)-\frac{\Big[\zeta(s,t)+\zeta(s+t)\Big]}{2^{(s-1)}} }[/math] and [math]\displaystyle{ Z_b(s,t)=\frac{\zeta(s,t)}{2^{(s-1)}} }[/math]

Note that [math]\displaystyle{ s }[/math] must be used for all value [math]\displaystyle{ \gt 1 }[/math] for which the argument of the factorials is [math]\displaystyle{ \geqslant0 }[/math]

Other results

For all positive integers [math]\displaystyle{ a,b,\dots,k }[/math]:

[math]\displaystyle{ \sum_{n=2}^{\infty} \zeta(n,k) = \zeta(k+1) }[/math] or more generally:

[math]\displaystyle{ \sum_{n=2}^{\infty} \zeta(n,a,b,\dots,k) = \zeta(a+1,b,\dots,k) }[/math]

[math]\displaystyle{ \sum_{n=2}^{\infty} \zeta(n,\bar{k}) = -\phi(k+1) }[/math]

[math]\displaystyle{ \sum_{n=2}^{\infty} \zeta(n,\bar{a},b) = \zeta(\overline{a+1},b) }[/math]

[math]\displaystyle{ \sum_{n=2}^{\infty} \zeta(n,a,\bar{b}) = \zeta(a+1,\bar{b}) }[/math]

[math]\displaystyle{ \sum_{n=2}^{\infty} \zeta(n,\bar{a},\bar{b}) = \zeta(\overline{a+1},\bar{b}) }[/math]

[math]\displaystyle{ \lim_{k \to \infty}\zeta(n,k) = \zeta(n)-1 }[/math]

[math]\displaystyle{ 1-\zeta(2)+\zeta(3)-\zeta(4)+\cdots=|\frac{1}{2}| }[/math]

[math]\displaystyle{ \zeta(a,a)=\tfrac{1}{2}\Big[(\zeta(a))^{2}-\zeta(2a)\Big] }[/math]

[math]\displaystyle{ \zeta(a,a,a)=\tfrac{1}{6}(\zeta(a))^{3}+\tfrac{1}{3}\zeta(3a)-\tfrac{1}{2}\zeta(a)\zeta(2a) }[/math]

Mordell–Tornheim zeta values

The Mordell–Tornheim zeta function, introduced by (Matsumoto 2003) who was motivated by the papers (Mordell 1958) and (Tornheim 1950), is defined by

[math]\displaystyle{ \zeta_{MT,r}(s_1,\dots,s_r;s_{r+1})=\sum_{m_1,\dots,m_r\gt 0}\frac{1}{ m_1^{s_1}\cdots m_r^{s_r}(m_1+\dots+m_r)^{s_{r+1}}} }[/math]

It is a special case of the Shintani zeta function.

References

• Tornheim, Leonard (1950). "Harmonic double series". American Journal of Mathematics 72 (2): 303–314. doi:10.2307/2372034. ISSN 0002-9327. 
• Mordell, Louis J. (1958). "On the evaluation of some multiple series". Journal of the London Mathematical Society. Second Series 33 (3): 368–371. doi:10.1112/jlms/s1-33.3.368. ISSN 0024-6107. 
• Apostol, Tom M.; Vu, Thiennu H. (1984), "Dirichlet series related to the Riemann zeta function", Journal of Number Theory 19 (1): 85–102, doi:10.1016/0022-314X(84)90094-5, ISSN 0022-314X 
• Crandall, Richard E.; Buhler, Joe P. (1994). "On the evaluation of Euler Sums". Experimental Mathematics 3 (4): 275. doi:10.1080/10586458.1994.10504297. http://www.emis.de/journals/EM/expmath/volumes/3/3.html. 
• Borwein, Jonathan M.; Girgensohn, Roland (1996). "Evaluation of Triple Euler Sums". Electron. J. Comb. 3 (1): #R23. doi:10.37236/1247. http://www.combinatorics.org/ojs/index.php/eljc/article/view/v3i1r23. 
• Flajolet, Philippe; Salvy, Bruno (1998). "Euler Sums and contour integral representations". Exp. Math. 7: 15–35. doi:10.1080/10586458.1998.10504356. http://www.emis.de/journals/EM/expmath/volumes/7/7.html. 
• Zhao, Jianqiang (1999). "Analytic continuation of multiple zeta functions". Proceedings of the American Mathematical Society 128 (5): 1275–1283. doi:10.1090/S0002-9939-99-05398-8. 
• Matsumoto, Kohji (2003), "On Mordell–Tornheim and other multiple zeta-functions", Proceedings of the Session in Analytic Number Theory and Diophantine Equations, Bonner Math. Schriften, 360, Bonn: Univ. Bonn 
• Espinosa, Olivier; Moll, Victor Hugo (2008). "The evaluation of Tornheim double sums". arXiv:math/0505647.
• Espinosa, Olivier; Moll, Victor Hugo (2010). "The evaluation of Tornheim double sums II". Ramanujan J. 22: 55–99. doi:10.1007/s11139-009-9181-1. 
• Borwein, J.M.; Chan, O-Y. (2010). "Duality in tails of multiple zeta values". Int. J. Number Theory 6 (3): 501–514. doi:10.1142/S1793042110003058. 
• Basu, Ankur (2011). "On the evaluation of Tornheim sums and allied double sums". Ramanujan J. 26 (2): 193–207. doi:10.1007/s11139-011-9302-5. 

External links

• Borwein, Jonathan; Zudilin, Wadim. "Lecture notes on the Multiple Zeta Function". http://carma.newcastle.edu.au/MZVs/. 
• Hoffman, Michael (2012). "Multiple zeta values". http://www.usna.edu/Users/math/meh/mult.html. 
• Zhao, Jianqiang (2016). Multiple Zeta Functions, Multiple Polylogarithms and Their Special Values. Series on Number Theory and its Applications. 12. World Scientific Publishing. doi:10.1142/9634. ISBN 978-981-4689-39-7. 
• Burgos Gil, José Ignacio; Fresán, Javier. "Multiple zeta values: from numbers to motives". http://javier.fresan.perso.math.cnrs.fr/mzv.pdf.