1. Introduction
In [
1], Kaneko and Tsumura proposed a study of
multiple T-values (MTVs):
as level two variations of
multiple zeta values (MZVs), which, in turn, were first studied by Zagier [
2] and Hoffman [
3] independently:
where
is the set of positive integers. These series converge if and only if
, in which case we say
s is admissible. As usual, we call
the weight and
d the depth. Note that the series becomes Riemann zeta values when
. One of the most important properties of these values is that they can be expressed by iterated integrals. The main motivation to consider MTVs is that they are also equipped with the following iterated integral expressions:
which provide the MTVs with a
-algebra structure because of the shuffle product property satisfied by iterated integral multiplication (see, e.g., [
4], Lemma 2.1.2(iv)).
In addition to MTVs, many other variants of MZVs have been studied due to their important connections to a variety of objects in both mathematics and theoretical physics. For example, Yamamoto [
5] defined the interpolated version of MZVs, which connects ordinary MZVs to the starred version; Hoffman [
6] defined an odd variant by restricting the summation indices
’s to odd numbers only; Xu and the author [
7,
8] further extended both Kaneko-Tsumura and Hoffman’s versions to allow for all possible parity patterns.
On the other hand, the congruence properties of the partial sums of MZVs were first considered by Hoffman [
9] and the author (see the arxiv paper math/0301252) independently. Contrary to the classical cases, only a few variants of these sums exist (see, e.g., [
10,
11,
12]). In this paper, the author will concentrate on the finite analog of MTVs defined by (
1).
Let
be the set of primes. Then by putting
we can define the
finite multiple zeta values (FMZVs) according to the following:
Nowadays, the main motivation for studying FMZVs is to understand a deep conjecture proposed by Kaneko and Zagier around 2014 (see Conjecture 1 below for a generalization). Although this conjecture is far from being proved, many parallel results have been shown to hold for both MZVs and FMZVs simultaneously (see, e.g., [
13,
14,
15]). In particular, for each positive integer
, the element
is the finite analog of
, where
’s are the Bernoulli numbers defined by
which have played very important roles in many areas of mathematical studies, such as Clifford analysis [
16] and topology [
17].
Furthermore, the connection goes even further to their alternating versions—the Euler sums and finite Euler sums. For
and
, we define the
Euler sumsIn order to save space, if
, then
will be used, and if a substring,
S, repeats
n times in the list, then
will be used. For example, the finite analog of
is the Fermat quotient
Write
and
if
. For
, we can define the finite
Euler sums as
In [
4], Conjecture 8.6.9, we extended the Kakeko–Zagier conjecture to the setting of the Euler sums. For
, define the symmetric version of the alternating Euler sums
where
(
or ш) are regularized values (see [
4], Proposition 13.3.8). They are called ♯-regularized
symmetric Euler sums. If
, then they are called ♯-regularized
symmetric multiple zeta values (SMZVs).
Conjecture 1 (cf. [
4], Conjecture 8.6.9)
. For any , let (resp. ) be the -vector space generated by all finite Euler sums (resp. Euler sums) of weight w. Then, there is an isomorphism:where or ш.
We remark that
always lies in
, see [
4], Exercise 8.7. Thus, it does not matter which version of the symmetric Euler sums is used in the conjecture.
Problem 1. What is the correct generalization of [4], Theorem 6.3.5, for symmetric Euler sums? What is the correct extension of [4], Theorem 8.5.10, to finite Euler sums? Our primary motivation for studying alternating MTVs is to better understand this mysterious relation,
. One of the main results of this paper is the discovery of the linear shuffle relations among the finite alternating MTVs given by Theorem 2. For example, it immediately implies the highly nontrivial result in Proposition 7: for all
, we have
We now briefly describe the content of this paper. We will start the next section by defining finite MTVs and symmetric MTVs, which can be shown to appear on the two sides of Conjecture 1, respectively. The most useful property of MTVs is that they have the iterated integral expressions (
3), satisfying shuffle multiplication. This leads us to the discovery of the linear shuffle relations for the finite MTVs (and their alternating version) in
Section 3 and some interesting applications of these relations.
Section 4 is devoted to presenting a few results about the alternating MTVs and providing their structures explicitly when the weight is one or two. In the last section, we consider both the finite MTVs and their alternating version by computing the dimension of the weight
w piece for
and then compare these data to their Archimedean counterparts, as obtained by Xu and the author [
7,
8].
2. Symmetric and Finite Multiple -Values
It turns out that finite MTVs are closely related to another variant called finite MSVs. For all admissible
, we define the
finite multiple T-values (FMTVs) and the
finite multiple S-values (FMSVs) as
Motivated by Conjecture 1, we provide the following definition.
Definition 1. Let and . Let or T. We define the ♯-regularized MTVs
( or ш) and MSVs
as We define the ♯-symmetric multiple
T-values
(SMTVs) and ♯-symmetric multiple
S-values
(SMSVs) aswhere and we set, as usual, . Proposition 1. Suppose is defined as per Conjecture 1. Let or ш. Then, for all , we have and modulo .
Proof. Suppose
d is even and
. Then, modulo
The MSVs and the odd d cases can all be computed similarly and are left to the interested reader. □
Hence, we expect that whenever certain relations hold on the finite side, then the same relations should hold for the symmetric version, at least modulo , and vice versa. Sometimes, they are valid for the symmetric version even without modulo . For example, the following reversal relations hold for both types of sums (see Proposition 2.8 and 2.9 in our arxiv paper 2402.08160). For , we state .
Proposition 2 (Reversal relations)
. For all , if d is even, thenand if d is odd, then 3. Linear Shuffle Relations for Finite Alternating Multiple -Values
One of the most important tools for studying MZVs and Euler sums is to consider the double shuffle relations that are produced in two ways to express these sums: one as series (by definition) and the other as iterated integrals. This idea will play the key role in the following discovery of the linear shuffle relations for finite multiple T-values (FMTVs) and their alternating version.
The linear shuffle relations for Euler sums are given in [[
4], Theorem 8.4.3]. First, we extend MTVs and FMTVs to their alternating version. For all admissible
(i.e.,
), we define the alternating multiple
T-values as
This is basically the same definition we used in our arxiv paper 2208.09593, except for a possible sign difference. If we denote the version in loc. cit. as
, then
We changed to our new convention in this paper because of the significant simplification in this special case. However, the old convention is still superior when treating the general alternating multiple mixed values. Similar to the convention for Euler sums, we will save space by putting a bar on top of
if
. For example,
In order to study the alternating MTVs, it is to our advantage to consider the
alternating multiple T-functions of one variable, as follows: for any real number,
x, define
In the non-alternating case, this function is the A-function (up to a power of 2) used by Kaneko and Tsumura in [
1]. For all
, it is then easy to evaluate the iterated integral:
Let
By changing the indices
, we immediately obtain
where
for all
and
represent the conversions between the series and the integral expressions of alternating MTVs:
Namely,
pushes a word used in the series definition to a word used in the integral expression, whereas
goes backward. See our arxiv paper 2208.09593 for more details.
In order to state the linear shuffle relations among FMTVs and their alternating version, first, we quickly review the algebra setup and the corresponding results for Euler sums. Let
(resp.
) be the
-algebra of words on
(resp.
) with concatenation as the product. Let
(
) be the sub-algebra generated by the words not ending with
. Then, for each word
, we define
where
and
for all
. Set
and
Theorem 1. ([
4], Theorem 8.4.3)
For all words, , , and , we have- (i)
;
- (ii)
;
- (iii)
For alternating MTVs, we can similarly let
(resp.
) be the
-algebra of words on
(resp.
) with concatenation as the product. Let
(
) be the sub-algebra generated by the words not ending with
. Then, for each word
, let
be the two maps defined in (
8) and (9). Then, we can extend the definition of alternating MTVs and their corresponding one-variable functions to the word level:
where
can be either
,
, or
or even their partial sums, such as
For all words
, we set
Further, set
and
Theorem 2. For all words , and , we have
- (i)
if is even;
- (ii)
if is even;
- (iii)
if is odd.
Proof. By taking and then setting , we see that (ii) implies (i). By decomposing into strings of type , we see that (iii) implies (ii). So, we only need to prove (iii).
For simplicity, write
and
for the rest of this proof. Observe that for any odd prime
p, the coefficient of
of
is nontrivial if and only if
is odd. Therefore, if the depth
d of the word
is even, the coefficient of
in
is given as
since
. Observe that
Hence, if
is odd, then, by first applying
to the above and then extracting the coefficients of
from both sides, we obtain
from shuffling the product property of the iterated integrals. Now, the last sum is
p-integral since
and
, and therefore, we obtain
which completes the proof of (iii). □
Remark 1. In [18], Jarossay showed that the corresponding results of Theorem 1 hold for SMZVs. Theorem 2, Conjecture 1 and Proposition 1 clearly imply that similar statements also hold true for SMTVs when the depth conditions are satisfied, as in Theorem 2. However, it is possible to prove this unconditionally by using the generalized Drinfeld associator and considering the words of the form in [4], Theorem 13.4.1. The details of this work will appear in a future paper. We can now derive a sum formula for FMTVs.
Theorem 3. Suppose is odd. For all , we haveby taking and in Theorem 2(iii). Proof. This follows immediately from the linear shuffle relation
□
The following conjecture is supported by all , numerically.
Proposition 3. If k is odd, then for all , we haveIf, in addition, we assume Conjecture 2 holds, then Proof. For all
, we see the linear shuffle relations
Thus, by setting
, we obtain
Hence,
which yields (
10). Then, (
11) follows immediately if we assume Conjecture 2. □
3.1. Values at Small Depths/Weights
First, we observe that since
for all
, according to [
4], Theorem 8.2.7, then
where
is the Fermat quotient (
6), and
is given in (
5). Further, in depth two, according to Proposition 2.6 in our arxiv paper 2402.08160, we see that for all
, if
is odd, then
The depth three case is already complicated, and we do not have a general formula. This is expected since such a formula does not exist for FMZVs. In the rest of this section, we will deal with some special cases.
Next, we prove a proposition that improves a result that Tauraso and the author obtained more than a decade ago by applying the newly discovered linear shuffle relations above.
Proof. It immediately follows on from [
19], Proposition 7.3 and Proposition 7.6, that
According to the linear shuffle relations for finite Euler sums, we have
which readily yields the identity
which in turn quickly implies all the evaluations in the proposition. □
Proof. The corollary is an immediate consequence of the definitions using Proposition 4. Alternatively, we can prove it directly, as follows: since
from a reversal, and
, we obtain
according to [
4], Theorem 8.6.4. □
Proof. The weighted three Euler sums are all expressible in terms of
and
by [
4], Proposition 14.2.7. Hence, one easily deduces that
In [
4], Proposition 14.2.7, we have
Thus, we get
as desired. □
In general, we can use linear shuffles to derive many relations from the finite Euler sums. For example,
We can also use reversal and shuffle relations to express all finite Euler sums of weight up to 6 according to the explicitly given basis in each weight. Aided by Maple computation, we arrive at the following main theorem on the structure of finite Euler sums of a lower weight.
Theorem 4. Let be the -vector space generated by finite Euler sums of weight w. Then, we have the following generating sets for : Let be the Fibonnacci sequence defined by and for all . Then, Theorem 4 provides strong support for the next conjecture.
Conjecture 3. For every positive integer w, the -space has the following basis:Consequently, for all .
One may compare this to the conjecture on the ordinary Euler sums proposed by Zlobin [
4], Conjecture 14.2.3.
Conjecture 4. For every positive integer w the -space has the following basis:Consequently, for all .
Theorem 4 implies that the set in Conjecture 3 is a generating set for all
since
where
and
.
By using the evaluations of finite Euler sums, we can find all FMTVs of weight less than 7. For example, we have
We then have the following structural theorem for these FMTVs:
Theorem 5. Let be the -vector space generated by FMTVs of weight w. Then, we have the following generating sets for : Moreover, by using numerical computation aided by Maple (see [
4], Appendix D, for the pseudo codes), we can find a generating set of
for every
We will list the corresponding dimensions at the end of this paper.
3.2. Homogeneous Cases
In this subsection, we will compute finite Euler sums when s is homogeneous, i.e., for some . Then, we will consider the corresponding results for FMTVs.
Proposition 6. Let be the set of odd positive integers. For any , we havewhere is the Kronecker symbol. In particular, for all even s. Proof. Let
denote any partition of
into odd parts, i.e., all of
’s are odd numbers, where
is the cardinality of the set
. Let
Observe that
if
n is even. Then, it follows easily from [
20], (18), that
The proposition follows from (
12) immediately. □
Example 1. There are many ways to partition 6 elements, say into odd parts: one way to get , ways to obtain (e.g., ), ways to obtain , and ways to obtain . Hence,when using the formula in (12). We would like to point out that the term (corresponding to the second term on the right-hand side above) was accidentally dropped from the right-hand side of [19], (36). One may compare the next corollary with the well-known result that
for all
(see, e.g., [
4], Theorem 8.5.1).
Proof. Taking in Theorem 3 yields the proposition at once. □
We now derive the symmetric MTV version of Proposition 7.
Proof. For any
, we have the relation for the regularized value (see, e.g., [
21],
Section 2)
which implies that
According to the definition,
as desired. □
By conducting extensive numerical experiments, we found that the following relations must be valid.
Conjecture 5. For all odd , we have The conjecture holds when
according to Corollary 1 and Proposition 5. Aided by Maple, we can also rigorously prove the conjecture for
and
by using the tables of values of finite Euler sums produced by reversal, shuffle, and linear shuffle relations, and the table of values for Euler sums is available online [
22].
Moreover, Conjecture 5 still holds true for when w is even because of Propositions 7 and 8. However, for S-values, we have another conjecture.
Conjecture 6. For all even , there are rational numbers , , such thatMoreover, and are -linearly independent, and and are -linearly independent.
Note that when are all real numbers.
4. Alternating Multiple T-Values
We now turn to the alternating version of MTVs and derive some relations among them. These values are intimately related to the colored MZVs of level 4 (i.e., multiple polylogarithms evaluated for the fourth roots of unity). We refer the interested reader to [
7,
8] for the fundamental results concerning these values.
Recall that for any
, we have defined the finite alternating multiple
T-values as
We have seen from Theorem 2 in
Section 3 that these values satisfy the linear shuffle relations. It is also not hard to get the reversal relations when the depth is even, as shown below.
Proposition 9 (Reversal relations of finite alternating MTVs)
. Let for some even . Then,where the element . Proof. Let
p be an odd prime. Then, by changing the indices
, we obtain
Let
,
, and
. Then, by changing the indices, we obtain
(since
d is even)
as desired. □
It should be clear to the attentive reader that T-values are always intimately related to the S-values when the depth is odd because of the reversal relations. Even though we did not consider this in the above, it plays a key role in the proof of the next result.
Proposition 10. Let for all . Then, we have Proof. According to [
23], Theorem 3.2, we see that
Since
, we immediately see that
. By taking the reversal, we obtain
as desired. □
As we analyzed in [
4], p. 239, there is overwhelming evidence that
in
. In [
24], Theorem 1, Silverman even showed that if abc-conjecture holds, then
In fact, we are sure the following conjecture is true.
Conjecture 7. For every pair of positive integers , , there are infinitely many primes such that .
Theorem 6. If Conjecture 7 holds for , then and are -linearly independent.
Proof. If in for some , then, according to Proposition 10, we see that for infinitely many primes . If Conjecture 7 holds the form , then for infinitely many primes . This would force . A similar consideration for primes implies that . Hence, we must have , which shows that and are -linearly independent. □
Define the
finite Catalan’s constant as
Proposition 11. Let be the vector space generated by finite alternating MTVs over . We have the following generating sets of for : Proof. The
case is trivial. For
, we already know
from Theorem 5. Let
,
, and
in the rest of the proof. For alternating values, we first have the linear shuffle relation
By using complicated computation (see Proposition 4.4 of our arxiv paper 2402.08160 and notice (
7)), we have the additional relation
Then, from the reversal relation (
15), we easily see that
This completes the proof of the proposition. □
5. Dimensions of and
We first need to point out that it is possible to study the alternating MTVs by converting them into colored MZVs of level 4 and then applying the setup in [
12]. For example,
The caveat is that we need to extend our scalars to
in general. At the end of [
12], we observed that
for all
, where
is the space spanned by all colored MVZ of level 4 and weight
w over
. By the following, we expect that the
where
is the space spanned by all the finite multiple mixed values. Here, according to [
7], the multiple mixed values mean we allow all possible even/odd combinations in the definition of such series instead of a fixed pattern, such as that which appears in MTVs and MSVs).
Conjecture-Principle-Philosophy 1. Let S be a set of colored MZVs (including MZVs and Euler sums) or (alternating) multiple mixed values (or their variations/analogs, such as finite, symmetric, interpolated versions, etc.). Then, the following statements should hold.
- (1)
Suppose all elements in S have the same weight. If they are linearly independent over , then they are algebraically independent over .
- (2)
If the weights of the values in S are all different, then the values are linearly independent over (but, of course, may not be algebraically independent over ).
- (3)
If there is only one nonzero element in S, then it is transcendental over .
For example, we expect that ’s are not only irrational but are also transcendental for all . We also expect that and are transcendental for all odd and are all algebraically independent over
Recall that
(resp.
) is the
-vector space generated by MTVs (resp. finite MTVs) of weight
w. Similarly, according to
(resp.
), we denote the space generated by alternating MTVs (resp. finite alternating MTVs) of weight
w. From numerical computation, we conjecture the following upper bounds for the dimensions of
and
. In order to compare to the classical case, we tabulate the results together in
Table 1. The main software we used was the open source computer algebra system GP-Pari.
With strong numerical support, Xu and the author conjecture that
form the tribonacci sequence (see [
8], Conjecture 5.2). For MTVs, Kaneko and Tsumura conjecture in [
1] that, for all
From numerical computation, we can formulate its finite analog as follows: