On the zeros of Riemann $\Xi(z)$ function
Yaoming Shi

TL;DR
This paper constructs a sequence of approximations to the Riemann Xi function using Fourier transforms and proves that all its zeros are real, supporting the Riemann Hypothesis.
Contribution
It introduces new families of functions approximating Xi(z) and proves their zeros are real, providing evidence for the Riemann Hypothesis.
Findings
Constructed Fourier-based approximations to Xi(z)
Proved zeros of approximations are real and simple
Established zero-free region for Xi(z) in the critical strip
Abstract
The Riemann function (even in ) admits a Fourier transform of an even kernel . Here and is a Jacobi theta function, a modular form of weight . (A) We discover a family of functions whose Fourier transform on compact support , , converges to uniformly in the critical strip . (B) Based on this we then construct another family of functions and show that it uniformly converges to in the critical strip . (C) Based on this we construct another family of functions and show that if all the zeros of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Advanced Mathematical Identities · Mathematical functions and polynomials
On the zeros of Riemann function
Y. SHI
(Date: Version of )
Abstract.
The Riemann function (even in ) admits a Fourier transform of an even kernel . Here and is a Jacobi theta function, a modular form of weight . (A) We discover a family of functions whose Fourier transform on compact support , , converges to uniformly in the critical strip . (B) Based on this we then construct another family of functions and show that it uniformly converges to in the critical strip . (C) Based on this we construct another family of functions and show that if all the zeros of in the critical strip are real, then all the zeros of in the critical strip are real. (D) We then show that and and have only real, positive and simple zeros. And there exists a positive integer such that for all , the zeros of are strictly left-interlacing with those of . Using an entire function equivalent to Hermite-Kakeya Theorem for polynomials we show that has only real, positive and simple zeros. Thus have only real and imple zeros. (E) Using a corollary of Hurwitz’s theorem in complex analysis we prove that has no zeros in , i.e., is a zero-free region for . Since all the zeros of are in , all the zeros of are in , i.e., all the zeros of are real.
Key words and phrases:
Fourier transforms, Laguerre-Pólya class, positive definite kernels, Riemann Xi-function, entire functions, Polynomials
2010 Mathematics Subject Classification:
30D10, 30D15, 42A82, 43A35, 43A50, 11M26, 11N99, 12D10, 26C10
00footnotetext: [email protected]
**Pre-introduction
**
We diligently follow Scott Aaronsen’s guideline to get rid of “Ten Signs a Claimed Mathematical Breakthrough is Wrong” in an effort to make our manuscript readable by professional mathematicians.
This manuscript is written from a view point of amateurs like us. We want this manuscript to be as rigorous as possible so that for any theorem/lamma/corollary, we either find a proof reference for it in a timely manner from the literature or we supply a proof for it. There may be a lot of materials in this paper that seem standard to experts in this field. But they are certainly new to amateurs like us. Therefore we do not claim originality to any individual theorem/lemma/corollary in this manuscript that does not have a reference. We only claim the originality of putting them together to reach our final goal.
1. Introduction
Let be two complex variables, be the Riemann -function, and
[TABLE]
be the Riemann (lower case) -function, which is an entire function [20, 49] satisfying the functional equation and the equation . Riemann hypothesis [2, 7] is then equivalent to the statement that all the zeros of are on the critical line .
Let be the total zeros in the section of the critical strip and be the total zeros in the section of the critical line. Let
[TABLE]
Riemann [46] in 1859 proved that all the zeros of are in the strip . Hadamard [26] and de la Vallée-Poussin [51] in 1896 independently proved that no zeros could lie on the line (and thus also no zeros on the line ). Hardy [24] in 1914 and Hardy and Littlewood [25] in 1921 showed there are infinitely many zeros on the critical line. Selberg [47] in 1946 proved that at least a (small) positive proportion of zeros lie on the line (). Levinson [35] in 1974 improved this to one-third of the zeros (). Conrey [6] in 1989 improved this further to two-fifths (). This number is now slowly creeping up.
De la Vallée-Poussin [52] in 1899-1900 proved that if is a zero of the Riemann zeta function, then
[TABLE]
for some positive constant . In other words, zeros cannot be too close to the line : there is a zero-free region close to this line. This zero-free region has been enlarged by several authors using methods such as Vinogradov’s mean-value theorem. Ford [21] in 2002 gave a version with explicit numerical constants: whenever and
[TABLE]
Let
[TABLE]
be the Riemann (upper case) -function, which is an entire function [20, 49] satisfying the functional equation and the equation . The critical line then becomes the line of and the critical strip becomes . Riemann hypothesis [46, 2, 7] is then the statement that has only real zeros.
Riemann function can be expressed as a Fourier transformation.
[TABLE]
Pólya [41, 42] noticed that . So he approximated with and by keeping only the leading () term and replacing with :
[TABLE]
[TABLE]
Thus . Pólya proved that and have only real zeros.
De Bruijn [14] approximated with :
[TABLE]
De Bruijn proved that the function has only real zeros.
Hejhal [27] approximated with :
[TABLE]
Hejhal proved that almost all the zeros of the function are real.
We notice ([48], theorem 2) that there is one thing in common in Pólya’s approximation of (1.7) and (1.8), de Bruijin’s approximation of (1.9), and Hejhal’s approximation of (1.10), they all captured the contribution of the tail part (as ) of in the Fourier transformation. But none of them converges to at . This aspect is clearly shown in Figure 1. Thus they can hardly capture the contribution of the head part (at ) of in the Fourier transformation.
A natural question then arises: Is it possible to find approximations to such that they converge to at and , and the corresponding Fourier transforms have only real zeros ? We gave a positive answer to this question in [48]. Let and
[TABLE]
So . The actual values of parameters and are then used to satisfy the other two criteria; namely (ii) , (iii) has only real zeros.
Here is one such example ([48],theorem 2) where we approximate with .
Theorem 1.1**.**
Let ,
[TABLE]
[TABLE]
[TABLE]
If satisfies the equation:
[TABLE]
and
[TABLE]
Then
(A);
(B);
(C)the entire function has only real zeros.
But our approximation to in (1.14) is clearly a better resemblance to in shape but not in essence.
As pointed out by Dimitrov and Rusev [16] and Dimitrov [13]:“A natural approach to resolving the Riemann hypothesis is to establish criteria for an entire function, or more specifically, a Fourier transform of a kernel, to possess only real zeros and to apply them to the Riemann function. There is no doubt that this was the main reason why so many celebrated mathematicians have been interested in the zero distribution of entire functions and, in particular, of Fourier transforms. Among them are such distinguished masters of the Classical Analysis as Hurwitz, Jensen, Pólya, Hardy, Tichmarsh, de Bruijn, Newman, Obrechkoff, Tchakaloff etc.”
“The efforts to settle the Riemann hypothesis establishing the fact that define as Fourier transform of has (so far) failed despite the efforts of Pólya [41, 42], de Bruijn [14], Newman [39] and many other celebrated mathematician for two reasons. The first one is that Pólya’s question ‘What properties of the function are sufficient to secure that its Fourier transform has only real zeros’ remains open. The second is that the sufficient conditions for the kernels that have been proved either are extremely difficult to be verified for or simply do not hold for it.”
For complete review of the research in this direction we refer the readers to the excellent 108 page review paper, Zeros of Entire Fourier Transforms, by Dimitrov and Rusev [16] and references therein. See also the review paper by Ki [29] and Hallum’s Master Thesis [23](an easy-to-read reference).
See also recent work by Csordas and Varga [11], Csordas and Dimitrov [10], Cardon [3], Adam and Cardon [4], and Csordas and Yang [12] etc.
Din [18] and Din and Moneta [19] studied the zeros of the Mellin transform of various kernel :
[TABLE]
Our current approach is greatly influenced by the comments of Din [18] and Din and Moneta [19]. They pointed out in [19] that“There exists a great number of different attempts to prove the Riemann Hypothesis and very often they result in the statement of another equivalent hypothesis, frequently concerning a field of mathematics more or less unrelated to complex analysis [for a review see [7]]. Concerning approaches using complex analysis, it is somewhat surprising that historically there has been no serious attempt to investigate the validity of the Riemann Hypothesis in terms of the well-known Hurtwitz theorem of complex analysis [see [38]], which in a quite manifestly (way) concerns the issue at hand about zeros of analytic functions. This theorem states that if an analytic function is a limit of a sequence of analytic functions, uniformly convergent on a compact subset of the complex plane, then any zero of the function in the subset must be a limit of the zeros of the sequence functions. In particular, if the zeros of the approximants were all real, then the same would be true for the limit function. One explanation for the apparent lack of interest in trying to apply the Hurtwitz theorem may be related to the fact that, apart from knowing that a certain entire function may theoretically be represented by a product involving its zeroes, then it is in general not obvious how to construct explicitly an appropriate sequence of analytic functions converging to the given function. For the problem of the Riemann Hypothesis, of course ‘appropriate’ here means that the approximating functions should have only real zeros so as to be able to infer that the same would be the case for the limit function.”
What is new in this paper is that we stick to the following 3 guidelines.
(A) Simplifying Kernel while insuring uniform convergence:
We directly simplify itself and in the beginning do not worry about the locations of the zeros of the corresponding Fourier transform. However we do keep in mind that when the simplifying nob (e.g., ) turns to one extreme (e.g., ) the simplified kernel function (e.g., ) should go back to the original kernel function; i.e., ; its corresponding Fourier transform on compact support , , should uniformly converge to in the critical strip .
(B) Simplifying while insuring uniform convergence until all the zeros of the resulting functions are real:
We try to prove that there exists a positive integer such that all the zeros of are real. If not, we keep simplifying while insuring its uniform convergence to in the critical strip . In the end, we discover two families of functions, , and such that (B.1) uniformly converges to in the critical strip ; (B.2) has only real zeros; (B.3) That has only real zeros implies has only real zeros.
(C) Applying a corollary of Hurwitz theorem in complex analysis to complete the analysis:
Now using a corollary of Hurwitz theorem in complex analysis we can prove that is a zero-free region for . Thus all the zeros of in are on . Combining this with Riemann’s result ( is a zero-free region for ) and the Prime Number Theory result ( is a zero-free region for ), we finally conclude that has only real zeros.
In section (2) we construct a family of functions () by truncating the infinite summation up to the first terms and then symmetrizing the result with respect to to make it an even function of (cf. (2.15)). We then truncate the support of Fourier transform from to where (cf. (2.47)) such that uniformly converges to in the critical strip (cf. theorem 2.8). We also find that
[TABLE]
where .
The infinite summation of in (1.18) is still not convenient for our further analysis. So in section (3), by truncating the summation of up to the first terms , we construct another family of functions, () (3.5).
[TABLE]
We prove that uniformly converges to in the critical strip (cf. theorem 3.3). We also prove that , , uniformly converges to in the critical strip (cf. theorem 3.6).
Because , to prove that there exists a positive inetger such that all the zeros of in the critical strip are real, it is then suffice to prove that all the zeros of in the critical strip are real.
In section (4), we set and separate the even terms from the odd terms in (1.19) and define
[TABLE]
Note that functions are all even in . We discover that functions have only real and simple zeros and . And there exists a sufficiently large and positive integer such that for all the positive real and simple zeros of are strictly left-interlacing with those of ;the negative real and simple zeros of are strictly right-interlacing with those of .
In section (5), we construct Hadmard factorizations for entire functions of order one, and . Let be the -th order polynomials ( and does not particularly stand for prime in this paper) that we obtain by keeping only the first terms in the infinite products of and . We prove that their difference, , uniformly converges to in the compact disk . In addition, has only real zeros. Using a corollary of Hurwitz’s theorem in complex analysis we prove that has no zeros in , i.e., is a zero-free region for . Since all the zeros of are in , therefore all the zeros of are in , i.e., all the zeros of are real.
Our proof of proposition 4.2 turned out to be extremely lengthy. It takes about two thirds of the space of the whole paper (it spans section (6-8) and Appendices A and B). In section (6-7) and Appendices A and B, we present supporting lemmas and theorems. In section (8) we present the detailed proof of proposition 4.2 in theorem 8.1.
2. A family of entire functions that uniformly converge to
Riemann function can be expressed as [46, 20, 49, 17]:
[TABLE]
where
[TABLE]
The function above is a special case of the Jacobi theta function:
[TABLE]
It satisfies the periodic relation and the self-inverse relation
[TABLE]
[TABLE]
Remark 2.1**.**
Because of the factors appeared in (2.6), . Thus unlike , is no longer periodic anymore .
Using the (2.5), it can be shown [17] that,
[TABLE]
Thus (2.1) becomes
[TABLE]
And (2.1) can also be written as a Mellin transform ()
[TABLE]
If we substitute (2.2) into (2.1), exchange the order of integration with summation, then we obtain
[TABLE]
Setting we obtain
[TABLE]
Set in (2.1), then and Riemann function can be expressed as a Fourier transformation [46, 20, 49, 17]:
[TABLE]
where
[TABLE]
Among the properties that satisfies, we would like to emphasize the following three that are used in this paper:
Lemma 2.2** ( [31], Lemma 3.1).**
(1) of (2.12) is an even function:
(2)
In order to simplify the analysis, we, follow [22], first truncate the infinite summation for kernel in (2.12) up to the first terms
[TABLE]
But is no longer an even function of . This violates the property that is even in . As pointed out by Pólya that the Fourier transform of an asymmetric (in ) kernel will have infinite non-real zeros.
So we mend this problem by symmetrizing and consider the Kernel
[TABLE]
We then find out that the Fourier transform of does not converges to uniformly in the critical strip . After further analysis, we find out that if we truncate the support of Fourier transform from to , then the corresponding Fourier transform on finite support does converge to uniformly in . All the details are summarized in theorem 2.3 and theorem 2.8 below.
Theorem 2.3**.**
Let , , , , and
[TABLE]
where is defined in (2.12). Let
[TABLE]
Then converges to uniformly in .
Proof.
Let . Then in the critical strip we have and consequently
[TABLE]
We now calculate the supreme of for .
[TABLE]
where
[TABLE]
The interchange in integration and summation above will be justified after we show that ,.
We will now calculate . For , we have
[TABLE]
where the last line defined function . Because
[TABLE]
therefore is a positive and monotonic decreasing function for . We then have [15]
[TABLE]
In the above derivation, we make use of lemma 2.7.
Define
[TABLE]
Then
[TABLE]
Thus . Consequently we have
[TABLE]
Next we calculate . For , we have
[TABLE]
[TABLE]
[TABLE]
Because , so
[TABLE]
therefore is a positive and monotonically decreasing function for . We have
[TABLE]
In the above derivation, we make use of lemma 2.7 as well.
[TABLE]
We now substitute into the equation above and obtain:
[TABLE]
It is obvious that
[TABLE]
If , then
[TABLE]
If , then
[TABLE]
Thus
[TABLE]
Since
[TABLE]
is positive and monotonically decreasing for .
Finally we can formulate the conclusion: Let be the solution to equation . For every , there exists a natural number such that for all and for all , we have .Thus converges to uniformly in .
If , then
[TABLE]
We now define as
[TABLE]
[TABLE]
Thus is a positive and monotonically decreasing function for .
Denote the lower branch, , of the Lambert function. decreases from to . We can explicitly solve for in terms of and obtain
[TABLE]
Numerical results show that if , then ; if , then ; , then .
∎
Remark 2.4**.**
If we begin with setting in (2.16), then we obtain . Thus we of (2.16) does not uniformly converges to in .
Setting in (2.16) and completing the integration, we obtain
[TABLE]
Comparing (2.42) against (2.9), we find that , but the convergence is not uniform.
Remark 2.5**.**
If we begin with setting in (2.16), then we obtain . It is obvious that . Thus of (2.16) does uniformly converges to in . However we will not continue along this direction because we only truncate the Fourier transform range from to and there is still an infinite sum in the definition of the kernel (cf. (2.12)).
Remark 2.6**.**
From (2.11) and (2.12), we obtain
[TABLE]
*where is defined in (2.12) and the invariance of the kernel with respect to is shown explicitly.
There is an infinite summation and an infinite integration in (2.43). Summarizing the findings in theorem 2.3, remark 2.4, and remark 2.5, it is quite interesting to see that
(A) truncation of the Fourier transform range alone from to in (2.43) does generate a family of entire functions that uniformly converges to in the critical strip ;
(B) truncation of the summation range alone from to in (2.43) does not generate a family of entire functions that uniformly converges to in the critical strip ;
(C) truncation of the Fourier transform range from to and summation range from to in a concerted fashion in (2.43) does generate a family of entire functions that uniformly converges to in the critical strip ;*
Lemma 2.7** ( [5]).**
Let be the complementary error function, defined as:
[TABLE]
then
[TABLE]
For convenience in the subsequent sections, we will now set (thus ).
Theorem 2.8**.**
Let , ,and
[TABLE]
Let
[TABLE]
*Then
(1) converges to uniformly in the critical strip .
(2)*
[TABLE]
(3)
[TABLE]
(4)
[TABLE]
where
[TABLE]
[TABLE]
(5)
[TABLE]
With
[TABLE]
where
[TABLE]
Proof.
Claim (1) is obvious because this is special case of theorem 2.8. Substituting of (2.15) into (2.16) and carrying out the Fourier transform on compact support , we prove Claim (2).
Claim (3): The lower incomplete gamma function admits a series expansion:
[TABLE]
Let
[TABLE]
[TABLE]
Substitution of the series expansion of into (2.57) and (2.58) leads to
[TABLE]
[TABLE]
Further simplification of the result leads to
[TABLE]
[TABLE]
Since
[TABLE]
and
[TABLE]
We obtain
[TABLE]
Writing and simplification of the result using leads to
[TABLE]
Thus
[TABLE]
Finally we have:
[TABLE]
Claim (4):
Since
[TABLE]
We have
[TABLE]
Substituting (2.70) into (2.68) and comparing the result against (2.50) leads to
[TABLE]
Claim (5): From (2.50) and (2.52), we have
[TABLE]
Substituting into above expression leads to
[TABLE]
Setting we obtain
[TABLE]
∎
Remark 2.9**.**
Using (2.11) and (2.48) we obtain numerical results: , , , , . Thus converges to quite quickly.
Remark 2.10**.**
What is the geometric meaning of the half-length of support, , of the Fourier transform in (2.47)?
Here are the plots of vs. and vs. . Here . We can clearly see that .
*Thus by truncating the Fourier transform range from to
, we exclude the contribution from the negative part of the kernel and only keep the contribution from the dominant positive part of the kernel .*
*Let be the smallest positive zero of . Numerical results show that
. Further numerical calculation leads us to propose the following*
Conjecture 2.11**.**
For each , the function has only one zero, , in the interval . And , .
All the reasoning in this remark based on numerical analysis is thus ad hoc in nature. We do not have a proof for 2.11. But our subsequent analysis does not depend on the proof/disproof of 2.11.
Remark 2.12**.**
If we expand of in (2.15) as a Taylor series in terms of ,then we can directly obtain as in(2.51). We found this shortcut pretty late in our endeavor. Our current presentation follows closely to our original thought process.
In the last part of this section we will introduce an interesting and related recent work by Van Malderen [53] on alternating ( function is related to alternating zeta function just like Riemann function is related to Riemann zeta function ). We summarize his results in the following theorem and his reasoning (scattered in his paper) in the proof.
Theorem 2.13** ( [53]).**
Let
[TABLE]
[TABLE]
[TABLE]
*Then
(1)*
[TABLE]
(2)
[TABLE]
(3)
[TABLE]
(4) is an entire function and it can be expressed as a Mellin transform
[TABLE]
(5)
[TABLE]
(6)
[TABLE]
Proof.
Claims (1), (2), (3): Note that
[TABLE]
Similarly
[TABLE]
Where are Jacobi theta functions defined
[TABLE]
Because are modular forms of weight , satisfying the following two relations
[TABLE]
Thus
[TABLE]
[TABLE]
So we prove Claim (1).
And
[TABLE]
[TABLE]
Therefore
[TABLE]
So we prove Claim (2).
[TABLE]
[TABLE]
Thus
[TABLE]
So we prove Claim (3).
Claim(4): Consider the integral
[TABLE]
Then
[TABLE]
Multiplying (2.97) by :
[TABLE]
Thus
[TABLE]
We now define
[TABLE]
[TABLE]
Remark 2.14**.**
Our definition of differs by a minus sign from those in [53]. The reason is to make positive for (c.f. lemma 2.17).
Then
[TABLE]
Claim (5): Using (1.1), (2.75), and (2.77), we obtain
[TABLE]
Remark 2.15**.**
It is well known that Riemann [46] used the factor to compensate the simple pole of at and the factor to compensate the simple pole of at . Van Malderen [53] used the factor to compensate the simple pole of at and the factor to compensate the simple pole of at . Of course that has extra zeros at ,i.e., on the boundaries of the critical strip .
Claim (6): Now we have
[TABLE]
The wording of H.M. Edwards used for the case of [2, p.16] is also applicable to (2.104): Because decreases more rapidly than any power of as , the integral in (2.104) converges in the entire plane.
Substituting (2.95) into (2.106) and completing the integration leads to
[TABLE]
Using and , we obtain
[TABLE]
∎
Remark 2.16**.**
We now copy a similar formula (2.10) for here for comparison
[TABLE]
We notice the great similarity between (2.8) and (2.106). We do not use (2.107) in the subsequent analysis because the truncated series of (2.107) does not converges to uniformly in (cf. remark 2.4). It will be interesting to see whether the truncated series of (2.106) converges to uniformly in or not.
Lemma 2.17**.**
Let and
[TABLE]
Then .
Proof.
[TABLE]
If , then
[TABLE]
If , then using (2.79) we obtain
[TABLE]
∎
3. A family of functions that converges to uniformly in
The expressions for in (2.49) and (2.50) contain one finite sum for hidden in the definition of [cf. (2.46)] and still contain an infinite sum for . In this section, in order to simply it further, we would like to truncate the infinite sum and only keep the first terms ().
We first introduce two lemmas.
Lemma 3.1** ( [45]).**
An upper bound and a lower bound for , valid for all positive integers , are given by
[TABLE]
Lemma 3.2** ([28]).**
An lower/upper bound for the sum of th power of the first integers, , is given by:
[TABLE]
Proof.
For fixed , since is monotonically increasing for , thus
[TABLE]
∎
Theorem 3.3**.**
Let , and
[TABLE]
Let
[TABLE]
Then converges to uniformly in .
Proof.
Let ,
[TABLE]
[TABLE]
Using the upper bound for shown in lemma 3.2, we have
[TABLE]
Therefore
[TABLE]
Assuming,
[TABLE]
so for
[TABLE]
[TABLE]
Using the lower bound for shown in lemma 3.1 we obtain:
[TABLE]
[TABLE]
We now define
[TABLE]
Because (cf. (3.10)), therefore
[TABLE]
Thus is a positive and monotonically decreasing function for .
Let be the upper branch, , of the Lambert W function. increase from through to . We can explicitly solve for in terms of . Here are the detailed steps:
[TABLE]
[TABLE]
[TABLE]
where
[TABLE]
From (3.19), we obtain
[TABLE]
[TABLE]
Because for , , thus is a positive and monotonically increasing function of . Since , therefore and . So we have
[TABLE]
Thus when , the assumption that we make in (3.10) is automatically satisfied.
Finally we can formulate the conclusion: Let be the solution to equation as shown in (3.15). For any , there exists a natural number such that for all and for all , we have . Thus converges to uniformly in . ∎
Lemma 3.4** ( [54]).**
(1) The Taylor series of Lambert-W function around [math] can be found using Lagrange inversion theorem and is given by
[TABLE]
The radius of convergence is ,as may be seen by the ratio test.
(2) For , we have
[TABLE]
Proof.
The proof of Claim (1) can be found in [54].
To prove Claim (2), we notice that the Taylor series is alternating in sign so for , we have
[TABLE]
∎
We also need upper bounds for various dependent functions defined below.
Lemma 3.5**.**
Let and as defined in (2.39), as defined in (3.20), as defined in (3.21), as defined in (3.22), as defined in (3.15), let
[TABLE]
Then
[TABLE]
Proof.
[TABLE]
[TABLE]
So are positive and monotonic decreasing functions for .
Thus , .
[TABLE]
[TABLE]
therefore
[TABLE]
∎
Theorem 3.6**.**
Let , and as defined in eq. 2.11, as defined in (2.49) of theorem 2.8, as defined in (3.5) of theorem 3.3. Let
[TABLE]
[TABLE]
Then converges to uniformly in .
Proof.
For given ,let be the unique and positive solutions to the following two equations
[TABLE]
Let . When , because
[TABLE]
We have
[TABLE]
From lemma 3.5 we know that
[TABLE]
Combination of (3.38) with (3.39) leads to
[TABLE]
From lemma 3.5 we also know that for
[TABLE]
Thus we have
[TABLE]
Since
[TABLE]
and
[TABLE]
we finally obtain
[TABLE]
Thus converges to uniformly in .
Numerical results show that if , then ,; if , then , ; , then , .
∎
Theorem 3.7** (Hurwitz’s theorem).**
Let be a sequence of functions, analytic on a region , which converges uniformly to a function , on a compact set, . If is a limit point of zeros of the sequence , then .
Conversely, if ,, possibly of multiplicity greater than one, and is a neighborhood of which contains no other zeros of inside of it or on its boundary, then there exists such that for , and have the same number of zeros inside (counting multiplicities).
Corollary 3.8** (of Hurwitz’s theorem [8], VII.2.5-6).**
if and are analytic functions on a domain , converges to uniformly on compact subsets of , and all but finitely many have no zeros in , then either is identically zero or has no zeros in .
Theorem 3.9**.**
Let , as defined in (2.11), as defined in (3.35) of theorem 3.6.
If there exists a sufficiently large and positive integer such that for all all the zeros of in are real,
then all the zeros of in are real.
Proof.
Both and are entire functions so they are analytical in . In theorem 3.9 we prove that converges to uniformly in .
Since for all all the zeros of in are real, we have that , have no zeros in . Since is not identically zero, we deduce by applying corollary 3.8 of Hurwitz’s Theorem that has no zeros in .
Since is not identically zero and all the zeros of are in , therefore all the zeros of in must be in . Thus they are all real. ∎
Remark 3.10**.**
Why we prefer to use corollary 3.8 of Hurwitz’s Theorem instead of of Hurwitz’s Theorem itself ( theorem 3.7 ) in this proof is explained in remark 5.13.
Our goal in the next sections becomes to prove that all the zeros of in are real.
For future convenience we now set and study the zeros of .
Lemma 3.11**.**
Let , as defined in (3.35) of theorem 3.6. Let
[TABLE]
If there exists a sufficiently large and positive integer such that all the zeros of in are real,
then all the zeros of in are real.
Proof.
Because of (3.46), all the zeros of in are real is equivalent to that all the zeros of in are real.
Since , we have . The claim then follows.
Using (3.35) we obtain
[TABLE]
where
[TABLE]
Comparing (3.47) against (3.35), we find out that is no longer multiplying in (3.47). Thus the function is little bit simpler than the function . This is the reason we apply this scaling change. ∎
4.
We will first introduce a theorem by Pólya.
Theorem 4.1** ( [40]).**
*If is positive, continuous, and increasing function for , then
(1)the function*
[TABLE]
*has only real and simple zeros.
(2) Each interval contains exactly one zero.*
Proposition 4.2**.**
Let (i.e., are odd), and
[TABLE]
[TABLE]
Then there exists a sufficiently large and positive integer such that
[TABLE]
hold for all and all .
Proof.
see section 9 theorem 8.1. ∎
We now introduce a theorem by Zhou.
Theorem 4.3** ( [55]).**
**
Suppose .
(A) are smooth, positive functions for ;
(B) is a smooth, nonnegative and monotonically decreasing function for ;
(C) ;
(D) for ;
(E) there is exactly one such that ;
(F) there is exactly one such that .
Then .
Proof.
: We first prove that for any , .
Assume there was such that . Since , there would be such that . This contradicts (E).
From this assertion, we have for any . Since , must hold. ∎
Theorem 4.4**.**
Let , ,and
[TABLE]
Let
[TABLE]
then
(1)
[TABLE]
where
[TABLE]
and
[TABLE]
(2) and have only real zeros.
(3A) Each interval contains exactly one zero,, for and exactly one zero, , for . i.e., and .
*(3B) are also zeros of . are also zeros of . *
Remark 4.5**.**
The claim (3A) and (3B) account for all the zeros of and .
(4A) The real zeros of are determined by
[TABLE]
(4B) The real zeros of are determined by
[TABLE]
where
[TABLE]
(5) The intervals can be shortened to such that
[TABLE]
There exists a sufficiently large and positive integer such that
(6A) the positive zeros of are left-interlacing with the positive zeros of . i.e,
[TABLE]
(6B) the negative zeros of are right-interlacing with the negative zeros of . i.e,
[TABLE]
Proof.
Claim(1):
For ,we have
[TABLE]
Substitution of this into (4.6) and separation of the terms even in from the terms odd in and comparison of the results against (4.8) leads to Claim (1).
Claim (2) and Claim (3A):
To apply Pólya theorem 4.1, we need to prove that are positive and increasing for . Thus it is suffice to prove that (A) ,(B) .
Since
[TABLE]
And
[TABLE]
Claim(3B): This is obvious because and are even functions of .
Claim (4A) and Claim (4B): To study the real zeros of , we can now focus on .
Since
[TABLE]
We have
[TABLE]
The real zeros for are then given by:
[TABLE]
or
[TABLE]
Similarly we have
[TABLE]
The real zeros for are then given by:
[TABLE]
Claim (5A): We notice that
[TABLE]
[TABLE]
so there is one zero for and one zero for in . Combining this result with Claim (3A), we conclude that each interval contains exactly one zero for and one zero for . Claim (5B) follows because and are even functions of .
Claim (6A):
Let and
[TABLE]
From the definition (4.12) and (4.27), we know that
(a) are smooth, positive functions of ;
(b) is a smooth, nonnegative and monotonically decreasing (thus single-valued) function for ;
(c) .
From proposition 4.2, which is proved in theorem 8.1, we know that
(d) ,
From Claim (3A), we know that
(e) the curve intersects curve only once at .
(f) the curve also intersects curve only once at
Using Zhou’s theorem 4.3, we conclude that
[TABLE]
Claim (6B) follows because and are even functions of .
∎
Lemma 4.6**.**
Let (i.e., are odd), and
[TABLE]
[TABLE]
[TABLE]
Then
[TABLE]
Proof.
Let and
[TABLE]
We now inspect each term in the summation in (4.30) and in (4.31). Since for each , and are positive and monotonically increasing function for , it is then suffice to prove that for each , is positive and monotonically increasing function for .
The derivative is given by
[TABLE]
Thus is monotonically increasing function for . The Claim then follows. ∎
5. Hadamard’s factorization for and
Theorem 5.1** (Paley-Wiener Theorem [1], p.103).**
If is continuous on the interval ,
[TABLE]
then is entire, and of order one and type less than or equal to .
Theorem 5.2** (Hadamard’s Factorization Theorem [37], p.289).**
If is an entire function of finite order , then
[TABLE]
where is a polynomial of degree less than or equal to , , and (with the convention that the exponential factors in the product are not present when ). The integer is called the genus of and it may be shown that either or .
Definition 5.3**.**
. A real entire function is in the Laguerre-Pólya class, written , if
[TABLE]
where , , and
Remark 5.4**.**
The significance of the Laguerre-Pólya class in the theory of entire function stems from the fact that functions in this class, and only these, are the uniform limits, on compact subsets of the complex plane, of polynomials with only real zeros (see [9] and [34], ch.8).
Definition 5.5**.**
. A real entire function is in the Laguerre-Pólya class , written , if
[TABLE]
where , , and
Definition 5.6**.**
A function is in if all of its zeros are in the interval .
The relations follow directly from the definitions above.
Theorem 5.7** (Hermite-Kakeya Theorem [44], p.197).**
Given two real-valued polynomials, and , then has only real zeros for every and and have real interlacing zeros.
Theorem 5.8**.**
Let ,
[TABLE]
let
[TABLE]
and
[TABLE]
Let be the zeros of and be the zeros of . Let
[TABLE]
Then
(1) are entire functions of order 1.
(2)
[TABLE]
Proof.
claim (1): This is obvious because from Paley-Wiener Theorem we know that are entire functions of order 1.
claim (2): Since
[TABLE]
Applying Hadamard’s factorization theorem (with order and ), we can express as an infinite product
[TABLE]
Since is an even function, the constant above must be set to zero. Since (cf. (4.12)) the nonnegative integer must be set to zero. Then (5.11) becomes
[TABLE]
Similarly
[TABLE]
∎
Theorem 5.9** ( [56]).**
Let and (in this paper does not specifically refer to prime )
[TABLE]
Then
* converges to uniformly in the compact disk .*
Proof.
[TABLE]
In the first part of (5.15),
[TABLE]
In the second part of (5.15),
[TABLE]
where is a polygamma function. It may be represented as
[TABLE]
Since
[TABLE]
Therefore
[TABLE]
Consequently
[TABLE]
Let . Thus for any , there exist a natural number such that for all and for all we have . i.e., convergences to uniformly in the compact disk .
∎
Theorem 5.10**.**
Let and let be a sufficiently large and positive integer. Let
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Then
(1) converges to zero uniformly in the compact disk .
(2) converges to zero uniformly in .
(3) converges to zero uniformly in ;
(4) all the zeros of in are real.
(5) all the zeros of in are real.
Proof.
Claims (1),(2), and (3): Because are monotonically increasing for , is also monotonically increasing for . Set to in the proof of theorem 5.9 above, we obtain
[TABLE]
[TABLE]
[TABLE]
Let . Thus for any , there exist a natural number such that for all and for all we have , , and . i.e., convergence to [math] uniformly in ; convergence to [math] uniformly in ; convergence to [math] uniformly in .
Claim (4):
Remark 5.11**.**
Since the positive zeros of are strictly left-interlacing with the positive zeros of and the negative zeros of are strictly right-interlacing with the negative zeros of , we can not directly use Hermite-Kakeya theorem theorem 5.7 to prove claim (4) that all the zeros of are real.
Remark 5.12**.**
Since all the zeros of and are positive and the zeros of are strictly left-interlacing with those of , we could directly use Hermite-Kakeya theorem theorem 5.7 to prove that all the zeros of are real. But we still can not prove that they are positive. Thus we can not directly prove Claim (4) that all the zeros of are real.
So we will use a different method.
Typical profiles of polynomials and for is displayed in the Figure 4 below.
Because
[TABLE]
Thus there exist one real zero, , of in this interval, i.e.,
[TABLE]
Typical profiles of polynomials and for is displayed in the Figure 5 below.
We notice that
[TABLE]
Thus there exist one real zero, , of in this interval, i.e.,
[TABLE]
Similarly since
[TABLE]
Thus there exist exactly one real zero, , of in this interval, i.e.,
[TABLE]
We notice that the intervals bounding the roots in (5.31), (5.33), and (5.35) are disjointed, thus we located simple and positive zeros for .
Since is a -th order even polynomial of , and we located all zeros, , on the real axis. Thus all the zeros of in are real.
Claim (5): and are entire functions and uniformly converges to zero in . Since all the zeros of are real, we deduce that have no zeros in . Since is not identically zero, we conclude, after applying corollary 3.8 of Hurwitz’s theorem, that has no zeros in . Thus all the zeros of are real. ∎
Remark 5.13**.**
Now we can count how many zeros of in the interval . From theorem 4.4 we know that the positive zeros of , , are left-interlacing with the positive zeros of , . i.e,
[TABLE]
From theorem 5.10 we know that the positive zeros of are in the range
[TABLE]
Denote the positive zeros of . Since uniformly converges to zero in the critical section and the regions in (5.37) that contain the positive zeros of are disjoint. Thus we deduce that the number of positive zeros of in the interval is given by . And the number of positive zeros of in the interval is given by . This number clearly goes to infinity as . But converges to uniformly in and the numbers of zeros of in is . One possible way to resolve this dilemma of number of zeros discrepancy could be that there exists a large scale accumulation of these positive zeros of as . Let . On average a single positive zero of is the accumulation of about positive zeros of .
Detailed analysis of the this possible accumulation process seems extremely difficult to us and is beyond our current capability. This is the main reason why in theorem 3.9 we prefer to use corollary 3.8 of Hurwitz theorem in complex analysis instead of Hurwitz theorem itself ( theorem 3.7). As shown in theorem 3.9 that after applying corollary 3.8 of Hurwitz theorem we prove that is a zero-free region for and for . This is because the zero-free region is unaffected by the possible accumulation of the real zeros (which remain real). Thus we are able to bypass analyzing the number of zeros discrepancy dilemma in this paper.
6. Formulas for and
In this section we prove a theorem that will be used in the proof of theorem 8.1.
Theorem 6.1**.**
Let . Let
[TABLE]
[TABLE]
Then
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Proof.
The functions () in (7.204), (7.205) can be rewritten as
[TABLE]
and where
[TABLE]
Because [33] ,, we obtain
[TABLE]
[TABLE]
Since ,, we can add odd power terms in the summation of and add even power terms in the summation of , obtaining
[TABLE]
[TABLE]
[TABLE]
[TABLE]
We notice that
[TABLE]
After the completion of summation for , we obtain
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Using
[TABLE]
with , we obtain
[TABLE]
[TABLE]
For convenience we rewrite (6.21), (6.17), (6.22), and (6.19) as summation of two components that are suitable for further treatment.
[TABLE]
[TABLE]
[TABLE]
[TABLE]
We also notice that
[TABLE]
∎
7. Bounds on
In this section we prove several lemmas and theorems that will be used in the eventual proof of theorem 8.1.
Definition 7.1**.**
The generalized hyper geometric function is defined
[TABLE]
The generalized hyper geometric function is defined
[TABLE]
Lemma 7.2**.**
Let , then
[TABLE]
where , , and .
Proof.
Using the upper bound for in lemma 3.1, we have
[TABLE]
where and
Using the lower bound for in lemma 3.1, we have
[TABLE]
Where .
∎
Lemma 7.3**.**
Let
[TABLE]
then
[TABLE]
Proof.
It is suffice to prove that
[TABLE]
Using Euler’s integral transform formula and , we have
[TABLE]
Therefore
[TABLE]
[TABLE]
Finally we have
[TABLE]
where and .
∎
Now we introduce a theorem (important to us) by Prof. Temme and Prof. Zhou.
Proposition 7.4** ( [50]).**
Let ; ; and . Let the function be defined in terms of the incomplete gamma function or Kummer function as
[TABLE]
Then there exists a positive constant and complex functions such that
[TABLE]
*holds for all and all .
Proof.
See theorem 10.1. ∎
Remark 7.5**.**
*In an earlier draft of this paper, we presented our original proof proposition 7.4. This proposition 7.4 is then heavily used in the subsequent analysis. An expert pointed out a critical error, which was also spotted by Prof. Zhou, in our original proof of proposition 7.4. We then asked help from Prof. Temme, an expert in, among others, the asymptotic expansion theory of the incomplete gamma function . Prof. Temme and Prof. Zhou eventually worked out a proof, which is presented in theorem 10.1 of Appendix A. So the full credit of proof for proposition 7.4 goes to them. If there is any error in the presentation of this proof, it is due to us.
In later version draft of this paper, we realized that the error bound for in (7.14), , is not sharp enough for us. So proposition 7.4 is eventually not used in the current version of this paper. In proposition 7.6 and proposition 7.7 below we, follow the main idea in the proof of proposition 7.4 by Prof. Temme and Prof. Zhou, carried out one more integration by parts, completed tedious analysis and finally obtained sharp error bound for in (7.17), and sharp error bound for in (7.20), . These bounds just fit to our needs. So the major credit for the proof of proposition 7.6 (presented in theorem 10.2) and proposition 7.7 (presented in theorem 10.3) still goes to Prof. Temme and Prof. Zhou. Of course, if there is any error in current presentation, it is due to us.
Proposition 7.6**.**
Let ; ; . Let the function be defined in terms of the incomplete gamma function or Kummer function as
[TABLE]
[TABLE]
Then there exists a positive constant and a complex function such that
[TABLE]
holds for all and all .
Proof.
See theorem 10.2. ∎
Proposition 7.7**.**
Let ; ; . Let the function be defined in terms of the incomplete gamma function or Kummer function as
[TABLE]
[TABLE]
Then there exists a positive constant and a real function such that
[TABLE]
holds for all and all .
Proof.
See theorem 10.3. ∎
We now present another theorem (important to us) by Prof. Zhou.
Proposition 7.8** ( [56]).**
Let . Then there exists a positive constant and a real function such that
[TABLE]
holds for all .
Proof.
See theorem 11.1.
∎
Proposition 7.9**.**
Let . Then there exists positive number and real functions such that
[TABLE]
holds for all and all .
Proof.
See theorem 11.2. ∎
Remark 7.10**.**
This is just a slight extension of proposition 7.8. So the major credit for the proof of proposition 7.9 (presented in theorem 11.2) goes to Prof. Zhou. If there is any error in current presentation, it is due to us.
7.1. Bounds of and
Theorem 7.11**.**
Let . Let
[TABLE]
Then there exists a constant and a real function such that
[TABLE]
holds for and all .
Proof.
The incomplete gamma function is related to Kummer function via
[TABLE]
Setting and substituting the result into (7.23) leads to
[TABLE]
Set in proposition 7.6, we know that there exists a positive constant and real functions and such that for all and all we have
[TABLE]
Substituting this into (7.26) leads to
[TABLE]
To simplify the notation we set . Since , we have . Then the real part of (7.28) becomes
[TABLE]
Since all he terms associated with square brackets are of oder , we can combine them and define
[TABLE]
Because ,
[TABLE]
Thus with we can write
[TABLE]
Since all he terms associated with square brackets are of oder , we can combine them and define
[TABLE]
[TABLE]
Let , we finally obtain that
[TABLE]
Holds for all and all .
The most significant term in and is .
[TABLE]
We can use to bound all the other terms.
For all we have
[TABLE]
And
[TABLE]
For all we have
[TABLE]
And
[TABLE]
Let .Thus
[TABLE]
where
[TABLE]
Since
[TABLE]
Let .Then we have
[TABLE]
∎
Theorem 7.12**.**
Let . Let
[TABLE]
Then there exists a constant and a real function such that
[TABLE]
holds for and all .
Proof.
The incomplete function is related to the Kummer via
[TABLE]
Setting and substituting the result into (7.45) leads to
[TABLE]
Set in proposition 7.7, we know that there exists a positive constant and real functions and such that for all and all we have
[TABLE]
Substituting this into (7.48) leads to
[TABLE]
To simplify the notation we set . Since , we have . Then the real part of (7.50) becomes
[TABLE]
Since the terms associated with square brackets are of oder , we can combine them and define
[TABLE]
Since
[TABLE]
Thus we conclude that there exists a real function such that
[TABLE]
Since the terms associated with square brackets are of oder , we can combine them and define
[TABLE]
[TABLE]
Let .
[TABLE]
The most significant term in and is .
[TABLE]
We can use to bound all the other terms.
For all we have
[TABLE]
And
[TABLE]
For all we have
[TABLE]
And
[TABLE]
Let .Thus
[TABLE]
where
[TABLE]
Since
[TABLE]
Let .Then we have
[TABLE]
∎
7.2. Bounds of and
Theorem 7.13**.**
Let ; . Let
[TABLE]
Then
[TABLE]
Proof.
Set in proposition 7.9 we know that there exists a positive constant and real functions such that
[TABLE]
holds for all and .
Thus
[TABLE]
[TABLE]
We now define the quantity in square bracket [] as
[TABLE]
Since
[TABLE]
We have
[TABLE]
where
Set in proposition 7.8, we know that there exists a positive constant and real function such that
[TABLE]
holds for all .
Substituting it into (xx) leads to
[TABLE]
where
[TABLE]
Since
[TABLE]
Thus
[TABLE]
or
[TABLE]
Where .
Note that . Among the terms and , the largest one is .
[TABLE]
[TABLE]
Thus we can use to bound the other terms.
For all we have
[TABLE]
And
[TABLE]
For all we also have
[TABLE]
And
[TABLE]
Thus we can write
[TABLE]
Where .
We can combine the 3 error terms and define
[TABLE]
Since
[TABLE]
We have
[TABLE]
where .
∎
Theorem 7.14**.**
Let ; . Let
[TABLE]
Then
[TABLE]
Proof.
Set in proposition 7.9 we know that there exists a positive constant and real functions such that
[TABLE]
holds for all and .
Thus
[TABLE]
[TABLE]
Where
[TABLE]
Since
[TABLE]
Consequently
[TABLE]
where .
Set in proposition 7.8, we know that there exists a positive constant and real function such that
[TABLE]
holds for all .
[TABLE]
where and
[TABLE]
[TABLE]
Note . Among the terms and , the largest one is .
[TABLE]
[TABLE]
Thus we can use to bound the other terms.
For all we have
[TABLE]
And
[TABLE]
For all we also have
[TABLE]
And
[TABLE]
Thus we can write
[TABLE]
Where .
We can combine the 3 error terms and define
[TABLE]
Since
[TABLE]
We have
[TABLE]
∎
7.3. Bounds of and
Theorem 7.15**.**
Let ; . Let
[TABLE]
Then
[TABLE]
Proof.
Because is odd, so .
Set in proposition 7.9 we know that there exists a positive constant and real functions such that
[TABLE]
holds for all and .
Thus
[TABLE]
[TABLE]
We now define the quantity in square bracket [] as
[TABLE]
Since
[TABLE]
We have
[TABLE]
where
Set in proposition 7.8, we know that there exists a positive constant and real function such that
[TABLE]
holds for all .
Substituting it into (xx) leads to
[TABLE]
where
[TABLE]
Since
[TABLE]
Thus
[TABLE]
or
[TABLE]
Where .
Note . Among the terms and , the largest one is .
[TABLE]
[TABLE]
Thus we can use to bound the other terms.
For all we have
[TABLE]
And
[TABLE]
For all we also have
[TABLE]
And
[TABLE]
Thus we can write
[TABLE]
Where .
We can combine the 3 error terms and define
[TABLE]
Since
[TABLE]
We have
[TABLE]
where .
∎
Theorem 7.16**.**
Let ; . Let
[TABLE]
Then
[TABLE]
Proof.
Because is odd, so .
Set in proposition 7.9 we know that there exists a positive constant and real functions such that
[TABLE]
holds for all and .
Thus
[TABLE]
[TABLE]
Where
[TABLE]
Since
[TABLE]
Consequently
[TABLE]
where .
Set in proposition 7.8, we know that there exists a positive constant and real function such that
[TABLE]
holds for all .
[TABLE]
where and
[TABLE]
[TABLE]
Note . Among the terms and , the largest one is .
[TABLE]
[TABLE]
Thus we can use to bound the other terms.
For all we have
[TABLE]
And
[TABLE]
For all we also have
[TABLE]
And
[TABLE]
Thus we can write
[TABLE]
Where .
We can combine the 3 error terms and define
[TABLE]
Since
[TABLE]
We have
[TABLE]
∎
7.4. Bounds of and
Theorem 7.17**.**
Let . Let
[TABLE]
Then
[TABLE]
holds for all and all .
Proof.
From the recursive relation for the incomplete gamma function,
[TABLE]
We obtain
[TABLE]
The incomplete gamma function is related to Kummer function via
[TABLE]
Using (7.162) three times and (7.163) once we can convert (7.159) to
[TABLE]
[TABLE]
Where
[TABLE]
[TABLE]
[TABLE]
where
[TABLE]
[TABLE]
Setting we obtain
[TABLE]
[TABLE]
Set in lemma 7.3, we know that there exist real functions and such that for all and all we have
[TABLE]
Thus
[TABLE]
Where and .
Thus
[TABLE]
Set we obtain
[TABLE]
Thus
[TABLE]
[TABLE]
[TABLE]
Therefore
[TABLE]
∎
Theorem 7.18**.**
Let . Let
[TABLE]
Then
[TABLE]
holds for all and all .
Proof.
From the recursive relation for the incomplete gamma function,
[TABLE]
We obtain
[TABLE]
The incomplete gamma function is related to Kummer function via
[TABLE]
Using (7.184) three times and (7.185) once we can convert (7.181) to
[TABLE]
[TABLE]
Where
[TABLE]
[TABLE]
where
[TABLE]
[TABLE]
[TABLE]
Setting we obtain
[TABLE]
[TABLE]
Set in lemma 7.3, we know that there exist real functions and such that for all and all we have
[TABLE]
Thus
[TABLE]
Where and .
Thus
[TABLE]
Set we obtain
[TABLE]
Thus
[TABLE]
[TABLE]
[TABLE]
Therefore
[TABLE]
∎
Theorem 7.19**.**
Let . Let
[TABLE]
[TABLE]
[TABLE]
Then there exists a constant and a real function such that for all and all we have
[TABLE]
[TABLE]
Proof.
(A) Using theorem 6.1 we obtain
[TABLE]
Further using theorem 7.11, and theorem 7.13, we know that there exists constants and a real function such that for and all we have
[TABLE]
where
[TABLE]
Since
[TABLE]
Substituting the upper bound of from lemma 3.1 we obtain
[TABLE]
Thus we have
[TABLE]
where .
(B) Similarly Using theorem 6.1 we obtain
[TABLE]
Further using theorem 7.12, and theorem 7.14, we know that there exists constants and a real functions such that for and all we have
[TABLE]
where
[TABLE]
Since
[TABLE]
Substituting the upper bound of from lemma 3.1 we obtain
[TABLE]
Thus we have
[TABLE]
where .
(C) Using theorem 6.1 we obtain
[TABLE]
Further using theorem 7.17, and theorem 7.15, we know that there exists constants and a real function such that for and all we have
[TABLE]
where
[TABLE]
Since
[TABLE]
Substituting the lower bound of from lemma 3.1 we obtain
[TABLE]
Thus we have
[TABLE]
where .
(D) Using theorem 6.1 we obtain
[TABLE]
Further using theorem 7.18, and theorem 7.16, we know that there exists constants and a real function such that for and all we have
[TABLE]
where
[TABLE]
Since
[TABLE]
Substituting the lower bound of from lemma 3.1 we obtain
[TABLE]
Thus we have
[TABLE]
where . ∎
8. , ,
Theorem 8.1** ((new result)= proposition 4.2).**
Let . Let
[TABLE]
[TABLE]
then exists a sufficiently large natural number such that
(A1)
[TABLE]
(B1)
[TABLE]
(C1)
[TABLE]
Proof.
Let
[TABLE]
Then
[TABLE]
Because , claims (A1), (B1), and (C1) are then equivalent to
(A2)
[TABLE]
(B2)
[TABLE]
(C2)
[TABLE]
Substitution of (8.1) into (8.2) and making use of
[TABLE]
leads to
[TABLE]
[TABLE]
Where
[TABLE]
Let
[TABLE]
The claims (A2), (B2), and (C2) are then equivalent to
(A3)
[TABLE]
(B3)
[TABLE]
(C3)
[TABLE]
In theorem 7.19 we proved that
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Thus we have
[TABLE]
where
[TABLE]
[TABLE]
[TABLE]
where
[TABLE]
Since
[TABLE]
We can thus write
[TABLE]
where .
From (8.19), (8.20) and (8.29), we deduce that there exists a natural number , such that for all and all , the following inequalities hold
[TABLE]
Thus we proved claims (A3), (B3), and (C3). ∎
9. Acknowledgment
We really appreciate the continuing support and help from Prof. Zixiang ZHOU (math. dept. of Fudan University, Shanghai). Without his help the current paper could only be completed with much lower quality. We also like to thank Prof. Haseo Ki (math. dept. of Yonsei University, Seoul) for reading an earlier draft of this paper and for pointing out an crucial error in the original proof of proposition 7.4. We like to thank Prof. Nico Temme (Centrum Wiskunde and Informatica (CWI), Amsterdam) as well, together with Prof. Zixiang ZHOU, for providing us with the proof of proposition 7.4. We appreciate the continuing support and help from Prof. Jie QING (math dept. of University of California at Santa Cruz, California), Prof. Xinyi YUAN (math dept. of University of California at Berkeley, California). We appreciate the help from Dr. Liming YANG, Dr. Lefang ZHONG, and Dr. Shaowei Zhang. We appreciate the support and help from the (anonymous) experts at open forums: math.stackexchange.com, tex.stackexchange.com.
10. **Appendix A **
In this appendix we present Temme and Zhou’s proof for proposition 7.4 and two more theorems that build on proposition 7.4. For convenience we copy proposition 7.4 as
Theorem 10.1** (= proposition 7.4 [50]).**
Let ; ; and . Let the function be defined in terms of the incomplete gamma function or Kummer function as
[TABLE]
Then there exists a positive constant and a complex function such that
[TABLE]
holds for all and all .
Proof.
To show this, we use integration by parts starting with
[TABLE]
which gives, because the integrated term vanishes at when ,
[TABLE]
where
[TABLE]
We now define
[TABLE]
It is then suffice to prove that is bounded by .
[TABLE]
Thus
[TABLE]
Thus is bounded by for all and all .
This shows the validity of (10.2).
∎
Theorem 10.2** (= proposition 7.6).**
Let ; ; . Let the function be defined in terms of the incomplete gamma function or Kummer function as
[TABLE]
[TABLE]
Then there exists a positive constant and a complex function such that
[TABLE]
holds for all and all .
Proof.
To show this, we use integration by parts starting with
[TABLE]
which gives, because the integrated term vanishes at when ,
[TABLE]
where
[TABLE]
We use integration by parts again starting with
[TABLE]
which gives, because the integrated term vanishes at when ,
[TABLE]
where
[TABLE]
Thus we can write
[TABLE]
Where
[TABLE]
[TABLE]
[TABLE]
It is then suffice to prove that is bounded by .
[TABLE]
is bounded for all and all .
[TABLE]
where
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Thus is bounded for all and all .
[TABLE]
Therefore
[TABLE]
Note
[TABLE]
Thus
[TABLE]
and
[TABLE]
Finally we have
[TABLE]
Thus is bounded by for all and all .
This shows the validity of (10.11).
∎
Theorem 10.3** (= proposition 7.7).**
Let ; ; . Let the function be defined in terms of the incomplete gamma function or Kummer function as
[TABLE]
[TABLE]
Then there exists a positive constant and a real function such that
[TABLE]
holds for all and all .
Proof.
To show this, we use integration by parts starting with
[TABLE]
which gives, because the integrated term vanishes at when ,
[TABLE]
where
[TABLE]
We use integration by parts again starting with
[TABLE]
which gives, because the integrated term vanishes at when ,
[TABLE]
where
[TABLE]
Thus we can write
[TABLE]
Where
[TABLE]
[TABLE]
[TABLE]
It is then suffice to prove that is bounded by .
When , , so we only need to consider the case when .
[TABLE]
[TABLE]
[TABLE]
is bounded by for all and all .
[TABLE]
[TABLE]
Note
[TABLE]
[TABLE]
[TABLE]
Since , we have . Therefore
[TABLE]
Thus
[TABLE]
[TABLE]
is bounded by for all and all .
[TABLE]
[TABLE]
[TABLE]
where
[TABLE]
[TABLE]
where
[TABLE]
[TABLE]
where
[TABLE]
Thus
[TABLE]
[TABLE]
where
[TABLE]
[TABLE]
Thus
[TABLE]
Because , so we have ; ; ; ,
Thus
[TABLE]
[TABLE]
Therefore
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Since , we have . Thus
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Because
[TABLE]
[TABLE]
Thus is bounded by for all and all .
∎
11. Appendix B
In this appendix we present Zhou’s proof for theorem 11.1 and one more theorem that builds on theorem 11.1. For convenience we copy theorem 11.1 as
Theorem 11.1** (= proposition 7.8 [56]).**
Let . Then there exists a positive constant and a real function such that
[TABLE]
holds for all .
Proof.
Let
[TABLE]
It is then suffice to prove that is bounded by for all .
Since
[TABLE]
We have
[TABLE]
If then so there is only one term in summation of . Thus
[TABLE]
For , we have
[TABLE]
When we have , thus
[TABLE]
Using when , we obtain
[TABLE]
Thus .
[TABLE]
Combining this result with that for , we conclude that when ,
[TABLE]
Therefore is bounded by .
∎
Theorem 11.2** (= proposition 7.9).**
Let . Then there exists positive number and real functions such that
[TABLE]
holds for all and all .
Proof.
Let
[TABLE]
It is then suffice to prove that is bound by and is bounded by .
Since
[TABLE]
We have
[TABLE]
Thus
[TABLE]
Therefore is bounded by .
For we have . For all and all we have
[TABLE]
[TABLE]
Therefore is also bounded by . ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] R. P. Boas, Entire Functions, Academic Press Inc, New York, 1954
- 2[2] E. Bombieri, The Riemann Hypothesis-Official Problem Description. Clay Mathematics Institute,2001
- 3[3] D. A. Cardon, Fourier transforms aaving only real zeros, Proc. Amer. Math. Soc. 133 , no. 5 (2004): 1349-1356.
- 4[4] S. R. Adams and D. A. Cardon, Sums of entire functions having only real zeros Proc. Amer. Math. Soc. 135 , no. 12 (2007): 3857-3866.
- 5[5] M. Chiani, D. Dardari, M. K. Simon, New Exponential Bounds and Approximations for the Computation of Error Probability in Fading Channels,, IEEE Transactions on Wireless Communications, , 4 (2)(2003), 840?845
- 6[6] J. B. Conrey, More than two fifths of the zeros of the Riemann zeta function are on the critical line J. Reine angew. Math. 399 , no. 2 (1989): 1-16.
- 7[7] J. B. Conrey, The Riemann Hypothesis, Notices of the American Mathematical Society, 341-353, Mar. 2003
- 8[8] J.B. Conway, Functions of One Complex Variable, Springer-Verlag New York Inc. Second Edition. 1978
