2. Lemmas
In this section, we first explain the concept of the real multiplicity of a zero of . And then we prove Lemma 3 to support the proof of the RH.
Multiple zeros of and their real multiplicities: As shown in
Figure 1, the multiple zeros of
are defined in terms of the quadruplet, i.e.,
.
There are two different expressions of factors of
for the multiple zeros in
Figure 1, respectively, i.e.,
, or
with
.
To exclude the latter expression, we stipulate that zero
related factors of
take the unique form of
, where
is the real multiplicity of
, here "real" means unique and unchangeable, with which we emphasize the objectivity of the multiplicity of
. In
Figure 1, the real multiplicity of
is 2, i.e.,
.
Remark: Although the real multiplicity of zero of is unknown, it is an objective existence, unique, and unchangeable. 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
real 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.
Next, we exclude the possibility of
and
in Equation (
18) with the help of the real multiplicities of zeros of
.
Considering
, is irreducible over the field
R of real numbers, we know from Equation (
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 definition of real multiplicities of zeros of
.
Thus, in order to keep the real 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 Equation (
18) the following result.
Let
l run over from 1 to
∞, and repeat the above process, we get
Also, based on Equation (
14), we have the following obvious fact
Further, limiting the imaginary parts
of zeros to
in order to keep the real multiplicities of zeros unchanged, we finally get
i.e.,
That completes the proof of Lemma 3.
In order 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 (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) 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, such as, Kenneth Hoffman, Ray Kunze, Linear Algebra (Second Edition), Prentice-Hall, INC., Englewood Cliffs, New Jersey, 1971; Linda Gilbert, Jimmie Gilbert, Elements of Modern Algebra (Seventh Edition), CENGAGE Learning, Belmont, CA, 2009; Henry C. Pinkham, Linear Algebra, Springer, 2015. Then we need only 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) be the statement of Lemma 4, i.e.,
". If is irreducible and divides the product , then divides one of the polynomials " with n replaced by , where , with the ordering that for all natural numbers n, is the smallest limit ordinal other than 0.
Actually, Lemma 4 can be proved by Mathematical Induction, which includes the Base Case: and the Successor Case: or , of this proof.
Next we prove the Limit Case: , 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.