Multiple Zeta Value
   HOME

TheInfoList



OR:

In
mathematics Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics ...
, the multiple zeta functions are generalizations of the
Riemann zeta function The Riemann zeta function or Euler–Riemann zeta function, denoted by the Greek letter (zeta), is a mathematical function of a complex variable defined as \zeta(s) = \sum_^\infty \frac = \frac + \frac + \frac + \cdots for \operatorname(s) > ...
, defined by :\zeta(s_1,\ldots,s_k) = \sum_\ \frac = \sum_\ \prod_^k \frac,\! and converge when Re(''s''1) + ... + 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''1, ..., ''s''''k'' are all positive integers (with ''s''1 > 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''1 + ... + ''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, : \zeta(2,1,2,1,3) = \zeta(\^2,3).


Definition

Multiple zeta functions arise as special cases of the multiple polylogarithms :\mathrm_(\mu_1,\ldots,\mu_d) = \sum\limits_\frac which are generalizations of the
polylogarithm In mathematics, the polylogarithm (also known as Jonquière's function, for Alfred Jonquière) is a special function of order and argument . Only for special values of does the polylogarithm reduce to an elementary function such as the natur ...
functions. When all of the \mu_i are ''n''th roots of unity and the s_i are all nonnegative integers, the values of the multiple polylogarithm are called colored multiple zeta values of level n. In particular, when n=2, they are called Euler sums or alternating multiple zeta values, and when n=1 they are simply called multiple zeta values. Multiple zeta values are often written :\zeta(s_1,\ldots,s_d) = \sum\limits_ \frac and Euler sums are written :\zeta(s_1,\ldots,s_d;\varepsilon_1,\ldots,\varepsilon_d) = \sum\limits_ \frac where \varepsilon_i = \pm 1. Sometimes, authors will write a bar over an s_i corresponding to an \varepsilon_i equal to -1, so for example :\zeta(\overline,b) = \zeta(a,b;-1,1) .


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 :\int_0^x f_1(t) dt \cdots f_d(t) dt = \int_0^x f_1(t_1)\left(\int_0^f_2(t_2)\left(\int_0^ \cdots \left( \int_0^ f_d(t_d) dt_d\right)\right)dt_2\right)dt_1 Using this convention, the result can be stated as follows: :\mathrm_(\mu_1,\ldots,\mu_d) = \int_0^1 \left(\frac\right)^\frac\cdots \left(\frac\right)^ \frac where a_j = \prod\limits_^j \mu_i^ for j = 1,2,\ldots,d. This result is extremely useful due to a well-known result regarding products of iterated integrals, namely that :\left(\int_0^x f_1(t)dt \cdots f_n(t) dt \right)\!\left(\int_0^x f_(t)dt\cdots f_m(t) dt \right) = \sum\limits_\int_0^x f_(t)\cdots f_(t) where \mathfrak_=\ and S_m is the symmetric group on m symbols. To utilize this in the context of multiple zeta values, define X = \, X^* to be the free monoid generated by X and \mathfrak to be the
free Free may refer to: Concept * Freedom, having the ability to do something, without having to obey anyone/anything * Freethought, a position that beliefs should be formed only on the basis of logic, reason, and empiricism * Emancipate, to procur ...
\Q- vector space generated by X^*. \mathfrak 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 a = \frac, b = \frac, and define :\zeta(\mathbf) = \int_0^1 \mathbf for any \mathbf \in X^*, which, by the aforementioned integral identity, makes :\zeta(a^b\cdots a^b) = \zeta(s_1,\ldots,s_d). Then, the integral identity on products gives :\zeta(w)\zeta(v) = \zeta(w \text v).


Two parameters case

In the particular case of only two parameters we have (with ''s'' > 1 and ''n'', ''m'' integers): :\zeta(s,t) = \sum_ \ \frac = \sum_^ \frac \sum_^ \frac = \sum_^ \frac \sum_^ \frac :\zeta(s,t) = \sum_^\infty \frac where H_ 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 Leonhard Euler ( , ; 15 April 170718 September 1783) was a Swiss mathematician, physicist, astronomer, geographer, logician and engineer who founded the studies of graph theory and topology and made pioneering and influential discoveries in ma ...
: :\sum_^\infty \frac = \zeta(2,1) = \zeta(3) = \sum_^\infty \frac,\! 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'' = 2''N''+1 (taking if necessary ''ζ''(0) = 0): :\zeta(s,t) = \zeta(s)\zeta(t) + \tfrac\Big tbinom-1\Bigzeta(s+t) - \sum_^\Big tbinom+\tbinom\Bigzeta(2r+1)\zeta(s+t-1-2r) Note that if s+t=2p+2 we have p/3 irreducibles, i.e. these MZVs cannot be written as function of \zeta(a) only.


Three parameters case

In the particular case of only three parameters we have (with ''a'' > 1 and ''n'', ''j'', ''i'' integers): :\zeta(a,b,c) = \sum_\ \frac = \sum_^ \frac \sum_^n \frac \sum_^ \frac = \sum_^ \frac \sum_^n \frac


Euler reflection formula

The above MZVs satisfy the Euler reflection formula: :\zeta(a,b)+\zeta(b,a)=\zeta(a)\zeta(b)-\zeta(a+b) for a,b>1 Using the shuffle relations, it is easy to
prove Proof most often refers to: * Proof (truth), argument or sufficient evidence for the truth of a proposition * Alcohol proof, a measure of an alcoholic drink's strength Proof may also refer to: Mathematics and formal logic * Formal proof, a con ...
that: :\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) for a,b,c>1 This function can be seen as a generalization of the reflection formulas.


Symmetric sums in terms of the zeta function

Let S(i_1,i_2,\cdots,i_k) = \sum_\frac, and for a partition \Pi=\ of the set \, let c(\Pi) = (\left, P_1\-1)!(\left, P_2\-1)!\cdots(\left, P_l\-1)!. Also, given such a \Pi and a ''k''-tuple i=\ of exponents, define \prod_^l \zeta(\sum_ i_j). The relations between the \zeta and S are: S(i_1,i_2)=\zeta(i_1,i_2)+\zeta(i_1+i_2) and 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).


Theorem 1 (Hoffman)

For any real i_1,\cdots,i_k >1,, \sum_S(i_, \dots, i_) = \sum_c(\Pi)\zeta(i,\Pi). Proof. Assume the i_j are all distinct. (There is no loss of generality, since we can take limits.) The left-hand side can be written as \sum_\sum_ \frac. Now thinking on the symmetric group \Sigma_k as acting on ''k''-tuple n = (1,\cdots,k) of positive integers. A given ''k''-tuple n=(n_1,\cdots,n_k) has an isotropy group \Sigma_k(n) and an associated partition \Lambda of (1,2,\cdots,k): \Lambda is the set of
equivalence class In mathematics, when the elements of some set S have a notion of equivalence (formalized as an equivalence relation), then one may naturally split the set S into equivalence classes. These equivalence classes are constructed so that elements a ...
es of the
relation Relation or relations may refer to: General uses *International relations, the study of interconnection of politics, economics, and law on a global level *Interpersonal relationship, association or acquaintance between two or more people *Public ...
given by i \sim j iff n_i=n_j, and \Sigma_k(n) = \. Now the term \frac occurs on the left-hand side of \sum_S(i_, \dots, i_) = \sum_c(\Pi)\zeta(i,\Pi) exactly \left, \Sigma_k(n) \ times. It occurs on the right-hand side in those terms corresponding to partitions \Pi that are refinements of \Lambda: letting \succeq denote refinement, \frac occurs \sum_(\Pi) times. Thus, the conclusion will follow if \left, \Sigma_k(n) \ =\sum_c(\Pi) for any ''k''-tuple n=\ and associated partition \Lambda. To see this, note that c(\Pi) counts the permutations having
cycle type In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or pro ...
specified by \Pi: since any elements of \Sigma_k(n) has a unique cycle type specified by a partition that refines \Lambda, the result follows. For k=3, the theorem says \sum_S(i_,i_,i_) = \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) for i_1,i_2,i_3>1. This is the main result of. Having \zeta(i_1,i_2,\cdots,i_k)=\sum_\frac. To state the analog of Theorem 1 for the \zeta's, we require one bit of notation. For a partition \Pi = \ of \, let \tilde(\Pi)=(-1)^c(\Pi).


Theorem 2 (Hoffman)

For any real i_1,\cdots,i_k>1, \sum_\zeta(i_, \dots, i_)=\sum_\tilde(\Pi)\zeta(i,\Pi). Proof. We follow the same line of argument as in the preceding proof. The left-hand side is now \sum_\sum_ \frac, and a term \frac occurs on the left-hand since once if all the n_i are distinct, and not at all otherwise. Thus, it suffices to show \sum_\tilde(\Pi)=\begin 1,\text \left, \Lambda \=k \\ 0, \text. \end (1) To prove this, note first that the sign of \tilde(\Pi) is positive if the permutations of cycle type \Pi 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 \Sigma_k(n). But such an isotropy group has equal numbers of even and odd permutations unless it is trivial, i.e. unless the associated partition \Lambda is \.


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'', \sum_\zeta(i_1,\cdots,i_k) = \zeta(n), where the sum is extended over ''k''-tuples i_1,\cdots,i_k of positive integers with i_1>1. Three remarks concerning this
conjecture In mathematics, a conjecture is a conclusion or a proposition that is proffered on a tentative basis without proof. Some conjectures, such as the Riemann hypothesis (still a conjecture) or Fermat's Last Theorem (a conjecture until proven in 19 ...
are in order. First, it implies \sum_S(i_1,\cdots,i_k)=\zeta(n). Second, in the case k=2 it says that \zeta(n-1,1)+\zeta(n-2,2)+\cdots+\zeta(2,n-2)=\zeta(n), or using the relation between the \zeta's and S's and Theorem 1, 2S(n-1,1)=(n+1)\zeta(n)-\sum_^\zeta(k)\zeta(n-k). 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 \tau on the set \Im of finite sequences of positive integers whose first element is greater than 1. Let \Tau be the set of
strictly increasing In mathematics, a monotonic function (or monotone function) is a function between ordered sets that preserves or reverses the given order. This concept first arose in calculus, and was later generalized to the more abstract setting of order ...
finite sequences of positive integers, and let \Sigma : \Im \rightarrow \Tau be the function that sends a sequence in \Im to its sequence of partial sums. If \Tau_n is the set of sequences in \Tau whose last element is at most n, we have two commuting involutions R_n and C_n on \Tau_n defined by R_n(a_1,a_2,\dots,a_l)=(n+1-a_l,n+1-a_,\dots,n+1-a_1) and C_n(a_1,\dots,a_l) = complement of \ in \ arranged in increasing order. The our definition of \tau is \tau(I) = \Sigma^R_nC_n\Sigma(I) = \Sigma^C_nR_n\Sigma(I) for I=(i_1,i_2,\dots,i_k) \in \Im with i_1+\cdots+i_k=n. For example, \tau(3,4,1) = \Sigma^C_8R_8(3,7,8) = \Sigma^(3,4,5,7,8) = (3,1,1,2,1). We shall say the sequences (i_1,\dots,i_k) and \tau(i_1,\dots,i_k) are dual to each other, and refer to a sequence fixed by \tau as self-dual. Duality conjecture (Hoffman). If (h_1,\dots,h_) is dual to (i_1,\dots,i_k), then \zeta(h_1,\dots,h_) = \zeta(i_1,\dots,i_k). 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 > 1) MZVs of the partitions of length ''k'' and weight ''n'', with 1 ≤ ''k'' ≤ ''n'' − 1. In formula: :\sum_\stackrel\zeta(s_1, \ldots, s_k) = \zeta(n). For example with length ''k'' = 2 and weight ''n'' = 7: :\zeta(6,1)+\zeta(5,2)+\zeta(4,3)+\zeta(3,4)+\zeta(2,5) = \zeta(7).


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

:\sum_^\infty \frac=\zeta(\bar,b) with H_n^=+1+\frac+\frac+\cdots are the generalized harmonic numbers. :\sum_^\infty \frac=\zeta(a,\bar) with \bar_n^=-1+\frac-\frac+\cdots :\sum_^\infty \frac=\zeta(\bar,\bar) :\sum_^\infty \frac\sum_^\infty \frac =\zeta(\bar,\bar,\bar) with \bar_n^=-1+\frac-\frac+\cdots :\sum_^\infty \frac\sum_^\infty \frac=\zeta(\bar,b,c) with H_n^=+1+\frac+\frac+\cdots :\sum_^\infty \frac\sum_^\infty \frac=\zeta(a,\bar,c) :\sum_^\infty \frac\sum_^\infty \frac=\zeta(a,b,\bar) As a variant of the Dirichlet eta function we define :\phi(s) = \frac \zeta(s) with s>1 :\phi(1) = -\ln 2


Reflection formula

The reflection formula \zeta(a,b)+\zeta(b,a)=\zeta(a)\zeta(b)-\zeta(a+b) can be generalized as follows: :\zeta(a,\bar)+\zeta(\bar,a)=\zeta(a)\phi(b)-\phi(a+b) :\zeta(\bar,b)+\zeta(b,\bar)=\zeta(b)\phi(a)-\phi(a+b) :\zeta(\bar,\bar)+\zeta(\bar,\bar)=\phi(a)\phi(b)-\zeta(a+b) if a=b we have \zeta(\bar,\bar)=\tfrac\Big phi^2(a)-\zeta(2a)\Big/math>


Other relations

Using the series definition it is easy to prove: :\zeta(a,b)+\zeta(a,\bar)+\zeta(\bar,b)+\zeta(\bar,\bar)=\frac with a>1 :\zeta(a,b,c)+\zeta(a,b,\bar)+\zeta(a,\bar,c)+\zeta(\bar,b,c)+\zeta(a,\bar,\bar)+\zeta(\bar,b,\bar)+\zeta(\bar,\bar,c)+\zeta(\bar,\bar,\bar)=\frac with a>1 A further useful relation is: :\zeta(a,b)+\zeta(\bar,\bar)=\sum_ (a+b-s-1)!\Big frac+\frac\Big/math> where Z_a(s,t)=\zeta(s,t)+\zeta(\bar,t)-\frac and Z_b(s,t)=\frac Note that s must be used for all value >1 for which the argument of the factorials is \geqslant0


Other results

For all positive integers a,b,\dots,k: :\sum_^ \zeta(n,k) = \zeta(k+1) or more generally: :\sum_^ \zeta(n,a,b,\dots,k) = \zeta(a+1,b,\dots,k) :\sum_^ \zeta(n,\bar) = -\phi(k+1) :\sum_^ \zeta(n,\bar,b) = \zeta(\overline,b) :\sum_^ \zeta(n,a,\bar) = \zeta(a+1,\bar) :\sum_^ \zeta(n,\bar,\bar) = \zeta(\overline,\bar) :\lim_\zeta(n,k) = \zeta(n)-1 :1-\zeta(2)+\zeta(3)-\zeta(4)+\cdots=, \frac, :\zeta(a,a)=\tfrac\Big \zeta(a))^-\zeta(2a)\Big/math> :\zeta(a,a,a)=\tfrac(\zeta(a))^+\tfrac\zeta(3a)-\tfrac\zeta(a)\zeta(2a)


Mordell–Tornheim zeta values

The Mordell–Tornheim zeta function, introduced by who was motivated by the papers and , is defined by :\zeta_(s_1,\dots,s_r;s_)=\sum_\frac It is a special case of the Shintani zeta function.


References

* * * * * * * * * * * *


Notes


External links

* * * *{{cite web , first1=José Ignacio , last1=Burgos Gil , first2=Javier , last2=Fresán , title=Multiple zeta values: from numbers to motives , url=http://javier.fresan.perso.math.cnrs.fr/mzv.pdf Zeta and L-functions