1. Introduction
The RH
is one of the most important unsolved problems in mathematics. Although there are many achievements towards proving this celebrated hypothesis, it remains an open problem [2,3]. The Riemann zeta function is originally defined in the half-plane
by the absolutely convergent series
The connection between the above-defined Riemann zeta function and prime numbers was discovered by Euler, i.e., the famous Euler product
where
p runs over the prime numbers.
Riemann showed in his paper in 1859 how to extend the zeta function to the whole complex plane
by analytic continuation, i.e.
where
is the symbol adopted by Riemann to represent the contour integral from
to
around a domain which includes the value 0 but no other point of discontinuity of the integrand in its interior.
Or equivalently,
where
is the Jaccobi theta function,
is the Gamma function in the following Weierstrass expression
where
is the Euler-Mascheroni constant.
As shown by Riemann,
extends to
as a meromorphic function with only a simple pole at
, with residue 1, and satisfies the following functional equation
The Riemann zeta function
has zeros at the negative even integers:
,
,
,
, ⋯ and one refers to them as the
trivial zeros. The other zeros of
are the complex numbers, i.e.,
non-trivial zeros .
In 1896, Hadamard and Poussin independently proved that no zeros could lie on the line , together with the functional equation and the fact that there are no zeros with real part greater than 1, this showed that all non-trivial zeros must lie in the interior of the critical strip . Later on, Hardy (1914) , Hardy and Littlewood (1921) showed that there are infinitely many zeros on the critical line .
To give a summary of the related research works on the RH, we have the following results on the properties of the non-trivial zeros of [4–9].
Lemma 1: Non-trivial zeroes of , noted as , have the following properties
- 1)
The number of non-trivial zeroes is infinity;
- 2)
;
- 3)
;
- 4)
are all non-trivial zeroes.
As further study, a completed zeta function
is proposed by equation
It is well-known that
is an entire function of order 1. This implies
is analytic, and can be expressed as infinite product of polynomial factors, in the whole complex plane
. In addition, replacing
s with
in Eq.(6), and combining Eq.(5), we obtain the following functional equation
According to the definition of , and recalling Eq.(4), the trivial zeros of are canceled by the poles of . The zero of and the pole of cancel; the zero and the pole of cancel [9,10]. Thus, all the zeros of are exactly the nontrivial zeros of . Then we have the following Lemma 2.
Lemma 2: The zeros of coincide with the non-trivial zeros of .
Consequently, the following two statements are equivalent.
Statement 1: All the non-trivial zeros of have real part equal to .
Statement 2: All zeros of have real part equal to .
To prove the RH, a natural thinking is to estimate the numbers of non-trivial zeros of inside or outside some certain areas according to Argument Principle. Along this train of thought, there are many research works. Let denote the number of non-trivial zeros of inside the rectangle: , and let denote the number of non-trivial zeros of on the line . Selberg proved that there exist positive constants c and , such that , later on, Levinson proved that , Lou and Yao proved that , Conrey proved that , Bui, Conrey and Young proved that , Feng proved that , Wu proved that .
On the other hand, many non-trivial zeros have been calculated by hand or by computer programs. Among others, Riemann found the first three non-trivial zeros . Gram found the first 15 zeros based on Euler-Maclaurin summation . Titchmarsh calculated the 138th to 195th zeros using the Riemann-Siegel formula [20,21]. Here are the first three (pairs of) non-trivial zeros: .
The idea of this paper is originated from Euler’s work on proving the following famous equality
This interesting result is deduced by comparing the like terms of two types of infinite expressions, i.e., infinite polynomial and infinite product, as shown in the following
Then the author of this paper conjectured that
should be factored into
or something like that, which was verified by paring
and
in the Hadamard product of
, i.e.
The Hadamard product of
as shown in Eq.(10) was first proposed by Riemann, however, it was Hadamard who showed the validity of this infinite product expansion
.
where
,
runs over all zeros of
.
Hadamard pointed out that to ensure the absolute convergence of the infinite product expansion,
and
are paired. Later in
Section 3, we will show that
and
can also be paired to ensure the absolute convergence of the infinite product expansion.
2. Lemmas
In this section, we first explain the multiplicity of a quadruplets of zeros of . After that we prove Lemma 3 based on Lemmas 4-8. Lemma 3 is the key lemma to support the proof of the RH.
Multiple zeros of : As shown in
Figure 1, the multiple zeros of
are defined in terms of the quadruplets, i.e.,
.
If without any restriction, there are two different expressions of factors of
for the multiple zeros in
Figure 1, i.e.,
, or
with
.
The latter expression with
can be excluded with the use of multiplicity of zero, which is uniquely determined and then unchangeable, since
is given. In
Figure 1, the multiplicity of
is 2, i.e.,
.
Remark: Although the multiplicity of a quadruplets of zeros of is unknown, it is an objective existence, finite, unique, and then unchangeable, for more details see Lemma 9 and Lemma 10. This is the key point in the proof of Lemma 3.
Lemma 3: Given two absolutely convergent infinite products
and
where
s is a complex variable,
and
are the complex conjugate zeros of
,
and
are real numbers,
is the multiplicity of
,
.
Then we have
where
is the equivalent sign.
Proof: First of all, we have the following fact:
where
is positive integer,
and
are real numbers.
Next, the proof is based on the divisibility of infinite products (or formal power series) with reference to the divisibility of polynomials. It is obvious that
where
with
, and "
l" is an arbitrary element of set
. In brief,
means that
i runs over the elements of
excluding "
l".
Then we have
where "|" is the divisible sign.
We first exclude the possibility of and in Eq.(18) with the help of the uniqueness of the multiplicities of zeros of .
Considering the factor
, with discriminant
, is irreducible over the field
R of real numbers, we know from Eq.(18) that
As explained in the situation of
Figure 1,
means that
and
are the same zeros in terms of quadruplet (
, and
), which contradicts the uniqueness of the multiplicities of zeros of
.
Thus, in order to keep the multiplicities of zeros of
unchanged,
can not divide
,
can not divides
. In addition,
is irreducible over the field
R of real numbers, then by Lemma 8 we know that
and
are relative prime, similarly,
and
are relative prime. Consequently, by Lemma 7, we obtain from Eq.(18) the following result.
Let
l run over from 1 to
∞, and repeat the above process, we get
Also, based on Eq.(14), we have the following obvious fact
Further, limiting the imaginary parts
of zeros to
in order to keep the multiplicities of zeros unchanged, we finally get
i.e.,
That completes the proof of Lemma 3.
To support the proof of Lemma 3, we need the following classical results (Lemma 4 and Lemma 5) in polynomial algebra over fields, with extension to infinite product of polynomial factors as a special expression of formal power series (Lemma 6, Lemma 7, and Lemma 8).
To begin with, we introduce the ring of polynomial: , and the ring of formal power series: .
is defined as the set of all polynomials in
x over the field
R of real numbers, i.e.
is defined as the set of all formal power series (including infinite product of polynomial factors as a special case) in
x over the field
R of real numbers, i.e.
The set equipped with the operations + (addition) and · (multiplication) is the ring of polynomial in x over the field R. Similarly, equipped with the operations + and · is the ring of formal power series in x over the field R. It is clear that is a subset of , and that the algebraic operations of these two rings agree on this subset.
Lemma 4: Let . If is irreducible (prime) and divides the product , then divides one of the polynomials .
Lemma 5: Let . If is irreducible and is any polynomial, then either divides or , (gcd: greatest common divisor).
Lemma 6: Let . If is irreducible and divides the product , then divides one of the polynomials .
Lemma 7: Let . If is irreducible and divides the product , but and are relative prime, then divides .
Lemma 8: Let . If is irreducible, then either divides , or and are relative prime, i.e., .
Remark: The contents of Lemma 4 and Lemma 5 can be found in many textbooks of linear algebra, modern algebra, or abstract algebra, see for example references [24–26]. As to the contents related to formal power series, see references [27,28]. Below we give the proofs of Lemma 6, Lemma 7, and Lemma 8.
Proof of Lemma 6: The proof is conducted by Transfinite Induction.
Let ( is an ordinal number) be the statement:
". If is irreducible and divides the product , then divides one of the polynomials ", where , with the ordering that for all natural numbers n, is the smallest limit ordinal other than 0.
Base Case: is an obvious fact according to Lemma 4 with ;
Successor Case: To prove , we have , where . Then according to Lemma 4 with , we have or . Considering : if divides , then divides one of , thus we know .
Limit Case: We need to prove , is any limit ordinal other than 0. For the sake of contradiction, assume that . Then, considering is irreducible with the properties stated in Lemma 5, we have: , which contradicts .
Thus, we know that the assumption does not hold.
Then is true, i.e., the Limit Case is true.
That completes the proof of Lemma 6.
Proof of Lemma 7: If is irreducible and divides the product , then, according to Lemma 6, divides one of the polynomials . Further, if and are relative prime, then does not divides any factor of (otherwise divides , which contradicts the condition " and are relative prime"). Thus, must divides .
That completes the proof of Lemma 7.
Proof of Lemma 8:
Since is irreducible, then by the definition of irreducible polynomial, either or . It is clear that . Thus, we conclude that either divides or , i.e., and are relative prime.
That completes the proof of Lemma 8.
Additionally, we also need the following results on properties of a zero of entire function in complex analysis for understanding the multiplicity of a zero of .
Lemma 9: The multiplicity of a zero of any non-zero entire function is a finite positive integer.
Proof: Let , be an entire function, which means it is holomorphic on the whole complex plane. Suppose has a zero at of multiplicity m, then , where is also an entire function and .
Assume for contradiction that m is infinite, which implies there exists an accumulation point of zeros in the neighbor of . Then, by Identity Theorem for holomorphic functions, and considering "0" is also an entire function, we have , which contradicts the given condition that . Thus, the assumption is false, i.e., m must be a finite positive integer.
That completes the proof of Lemma 9.
Lemma 10: The multiplicity of a zero of any non-zero entire function is unique.
Proof: Let , be an entire function, which has a multiple zero at of multiplicity m. We can write: , where is also an entire function and .
Assume for contradiction that there exists another integer such that n is also a multiplicity of the zero . This means we can also write: , where is an entire function and .
Since both expressions for must be equal, we then obtain . Without loss of generality, consider , then we have: , which is a contradiction to . Thus, the assumption is false, i.e., the multiplicity of a zero of any non-zero entire function is unique.
That completes the proof of Lemma 10.