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
:
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,
:
Definition
Multiple zeta functions arise as special cases of the multiple polylogarithms
:
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
are ''n''
th roots of unity and the
are all nonnegative integers, the values of the multiple polylogarithm are called colored multiple zeta values of level
. In particular, when
, they are called Euler sums or alternating multiple zeta values, and when
they are simply called multiple zeta values. Multiple zeta values are often written
:
and Euler sums are written
:
where
. Sometimes, authors will write a bar over an
corresponding to an
equal to
, so for example
:
.
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
:
Using this convention, the result can be stated as follows:
:
where
for
.
This result is extremely useful due to a well-known result regarding products of iterated integrals, namely that
:
where
and
is the
symmetric group on
symbols.
To utilize this in the context of multiple zeta values, define
,
to be the
free monoid generated by
and
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 ...
-
vector space generated by
.
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
,
, and define
:
for any
,
which, by the aforementioned integral
identity, makes
:
Then, the integral identity on products gives
:
Two parameters case
In the particular case of only two parameters we have (with ''s'' > 1 and ''n'', ''m'' integers):
:
:
where
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 ...
:
:
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):
:
Note that if
we have
irreducibles, i.e. these MZVs cannot be written as function of
only.
Three parameters case
In the particular case of only three parameters we have (with ''a'' > 1 and ''n'', ''j'', ''i'' integers):
:
Euler reflection formula
The above MZVs satisfy the Euler reflection formula:
:
for
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:
:
for
This function can be seen as a generalization of the reflection formulas.
Symmetric sums in terms of the zeta function
Let
, and for a partition
of the set
, let
. Also, given such a
and a ''k''-tuple
of exponents, define
.
The relations between the
and
are:
and
Theorem 1 (Hoffman)
For any
real ,
.
Proof. Assume the
are all distinct. (There is no loss of generality, since we can take limits.) The left-hand side can be written as
. Now thinking on the symmetric
group
as acting on ''k''-tuple
of positive integers. A given ''k''-tuple
has an isotropy group
and an associated partition
of
:
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
iff
, and
. Now the term
occurs on the left-hand side of
exactly
times. It occurs on the right-hand side in those terms corresponding to partitions
that are refinements of
: letting
denote refinement,
occurs
times. Thus, the conclusion will follow if
for any ''k''-tuple
and associated partition
.
To see this, note that
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
: since any elements of
has a unique cycle type specified by a partition that refines
, the result follows.
For
, the theorem says
for
. This is the main result of.
Having
. To state the analog of Theorem 1 for the
, we require one bit of notation. For a partition
of
, let
.
Theorem 2 (Hoffman)
For any real
,
.
Proof. We follow the same line of argument as in the preceding proof. The left-hand side is now
, and a term
occurs on the left-hand since once if all the
are distinct, and not at all otherwise. Thus, it suffices to show
(1)
To prove this, note first that the sign of
is positive if the permutations of cycle type
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
. But such an isotropy group has equal numbers of even and odd permutations unless it is trivial, i.e. unless the associated partition
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'',
, where the sum is extended over ''k''-tuples
of positive integers with
.
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
. Second, in the case
it says that
, or using the relation between the
and
and Theorem 1,
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 on the set
of finite
sequences of positive integers whose first element is greater than 1. Let
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
be the function that sends a sequence in
to its sequence of partial sums. If
is the set of sequences in
whose last element is at most
, we have two commuting involutions
and
on
defined by
and
= complement of
in
arranged in increasing order. The our definition of
is
for
with
.
For example,
We shall say the sequences
and
are dual to each other, and refer to a sequence fixed by
as self-dual.
Duality conjecture (Hoffman). If
is dual to
, then
.
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:
:
For example with length ''k'' = 2 and weight ''n'' = 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
:
with
are the
generalized harmonic numbers.
:
with
:
:
with
:
with
:
:
As a variant of the
Dirichlet eta function we define
:
with
:
Reflection formula
The reflection formula
can be generalized as follows:
:
:
:
if
we have