
TL;DR
This paper investigates the distribution of real zeros of a random Dirichlet series with random signs, establishing conditions under which the series almost surely has no or infinitely many real zeros.
Contribution
It provides a rigorous analysis of the zero distribution of random Dirichlet series based on the convergence of the sum of reciprocals of the sequence.
Findings
If the sum of reciprocals converges, the series has no real zeros with positive probability.
If the sum diverges, the series almost surely has infinitely many real zeros.
Abstract
Let be the random Dirichlet series , where is an increasing sequence of positive real numbers and is a sequence of i.i.d. random variables with . We prove that, for certain conditions on , if then with positive probability has no real zeros while if , almost surely has an infinite number of real zeros.
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.
Real zeros of Random Dirichlet series
Marco Aymone
Abstract.
Let be the random Dirichlet series , where is an increasing sequence of positive real numbers and is a sequence of i.i.d. random variables with . We prove that, for certain conditions on , if then with positive probability has no real zeros while if , almost surely has an infinite number of real zeros.
1. Introduction.
A Dirichlet series is an infinite sum of the form , where is an increasing sequence of positive real numbers and is any sequence of complex numbers. If converges then converges for all with real part greater than (see [4] Theorem 1.1). The abscissa of convergence of a Dirichlet series is the smallest number for which converges for all .
The problem of finding the zeros of a Dirichlet series is classical in Analytic Number Theory. For instance, the Riemann hypothesis states that the zeros of the analytic continuation of the Riemann zeta function in the half plane all have real part equal to . This analytic continuation can be described in terms of a convergent Dirichlet series – The Dirichlet -function satisfies , for all complex with positive real part. Thus, to find zeros of for is the same as finding non-trivial zeros of .
In this paper we are interested in the real zeros of the random Dirichlet series , where the coefficients are random and satisfies:
[TABLE]
For instance, can be the set of the natural numbers. The conditions imply, in particular, that the series converges for each . Therefore, if is a sequence of i.i.d. random variables with and , then, by the Kolmogorov one-series Theorem, the series has a.s. abscissa of convergence . Moreover, the function of one complex variable is a.s. an analytic function in the half plane . In the case with equal probability, the line is a natural boundary for , see [2] (pg. 44 Theorem 4).
Our main result states:
Theorem 1.1**.**
*Assume that satisfies - and let be i.i.d and such that . Let .
i. If , then with positive probability has no real zeros;
ii. If , then a.s. has an infinite number of real zeros.*
It follows as corollary to the proof of item i. that in the case , with positive probability has no zeros in the interval , for fixed .
Since a Dirichlet series is a random analytic function, it can be viewed as a random Taylor series , where and are random and dependent random variables. The case of random Taylor series and random polynomials where are i.i.d. has been widely studied in the literature, for an historical background we refer to [3] and [5] and the references therein.
2. Preliminaries
2.1. Notation.
We employ both and Vinogradov’s to mean that there exists a constant such that for all sufficiently large , or when is sufficiently close to a certain real number . For , denotes the half plane . The indicator function of a set is denoted by and it is equal to if , or equal to [math] otherwise. We let to denote the counting function of :
[TABLE]
2.2. The Mellin transform for Dirichlet series
In what follows is a set of non-negative real numbers satisfying - above. A generic element of is de noted by , and we employ to denote . Let and . Let be the abscissa of convergence of . Then can be represented as the Mellin transform of the function (see, for instance, Theorem 1.3 of [4]):
[TABLE]
In particular, we can state:
Lemma 2.1**.**
Let be such that is convergent. Then for each and all , for all :
[TABLE]
where the implied constant in the term above can be taken to be .
Proof.
Put . By (1) it follows that
[TABLE]
∎
2.3. A few facts about sums of independent random variables
In what follows we use
Levy’s maximal inequality: Let be independent random variables. Then
[TABLE]
Hoeffding’s inequality: Let be i.i.d. with . Let be real numbers. Then for any
[TABLE]
3. Proof of the main result
Proof of item i.
Since we have by the Kolmogorov one series theorem that the series converges almost surely. In what follows is a large fixed number to be chosen later, is the event in which for all and is the event in which
[TABLE]
We claim that for sufficiently large on the event the function does not vanish for all . Further for sufficiently large we will show that .
On the event we have by lemma 2.1 that
[TABLE]
where . We claim that for each we have that
[TABLE]
In fact, this is a consequence from P2: For any the series diverges . To show that this is true we argue by contraposition: Assume that for some fixed and hence that there exists a constant such that for all , . In that case we have for
[TABLE]
and hence that the series converges. Therefore, we showed that implies that has abscissa of convergence .
Now we may select arbitrarily large values of for which and , and hence, by (4), for all we obtain that
[TABLE]
This proves that on the event we have that for all .
Observe that and are independent and has probability . Now we will show that the complementary event has small probability. Indeed, by applying the Levy’s maximal inequality and the Hoeffding’s inequality, we obtain:
[TABLE]
Since is convergent, the tail converges to [math] as . Therefore, for sufficiently large we can make . ∎
Now we are going to prove Theorem 1.1 part . We present two different proofs. In the first proof we assume that the counting function of
[TABLE]
In this case, for instance, can be the set of prime numbers. In this proof we show that, for close to , the infinite sum can be approximated by the partial sum for a suitable choice of (Lemma 3.1). Then we show that these partial sums change sign for an infinite number of , and hence, changes sign for an infinite number of .
The case in which is the set of natural numbers, the infinite sum can not be approximated by the finite sum , i.e, Lemma 3.1 fails in this case. Thus, our approach is different in the general case. First we show (Lemma 3.3) that implies that
[TABLE]
and second, for each , the event
[TABLE]
is a tail event, and by (6), it has positive probability. Similarly,
[TABLE]
also is a tail event and has positive probability. Thus, by the Kolmogorov Law, with probability , changes sign for an infinite number of .
3.1. Proof of Theorem 1.1 (ii) in the case
Lemma 3.1**.**
Assume that satisfies - and that . Further, assume that . Let and . Then there is a constant such that for all
[TABLE]
Proof.
If then either or . This fact combined with the Hoeffding’s inequality allows us to bound:
[TABLE]
where V_{y}=\sum_{p\leq y}\bigg{(}\frac{1}{p^{\sigma}}-\frac{1}{\sqrt{p}}\bigg{)}^{2} and . To complete the proof we only need to estimate these quantities. By the mean value theorem
[TABLE]
Therefore
[TABLE]
In particular, the choice implies that both variances and are . ∎
The simple random walk where is i.i.d with with probability each, satisfies a.s. and . We follow the same line of reasoning as in the proof of this result ([6] pg. 381, Theorem 2) to prove:
Lemma 3.2**.**
Assume that . Let be a increasing sequence of positive real numbers such that . Then it a.s. holds that:
[TABLE]
Proof.
We begin by observing that is a sequence of independent and symmetric random variables that are uniformly bounded by . It follows that
[TABLE]
and hence this sequence satisfies the Lindenberg condition. By the Central Limit Theorem it follows that for each fixed there exists a such that for sufficiently large
[TABLE]
Next observe that the event in which is a tail event, and hence by the Kolmogorov zero or one law it has either probability zero or one. Since
[TABLE]
it follows that for each fixed , a.s. Similarly, we can conclude that for each fixed , a.s. ∎
Proof of item ii.
Take in Lemma 3.1 and let . Since , it follows that there is a subsequence for which and hence, by the Borel-Cantelli Lemma, it a.s. holds that
[TABLE]
where . This combined with Lemma 3.2 gives a.s.
[TABLE]
Similarly, we conclude that , a.s. Since is a.s. analytic, it follows that there is an infinite number of for which . ∎
3.2. Proof of Theorem 1.1 (ii), the general case
The following Lemma is an adaptation of [1], Theorem 1.2:
Lemma 3.3**.**
Assume that satisfies P1-P2 and that . Then
[TABLE]
Proof.
Let . Observe that as : For each fixed
[TABLE]
Thus, by making in the equation above, we obtain the desired claim.
For each fixed , by the Kolmogorov one series Theorem, we have that converges almost surely as . Since are independent, by the dominated convergence theorem:
[TABLE]
We will show that for each fixed , as . Observe that , so we may assume . Thus, for each fixed we may choose such that and 0\leq 1-\cos\big{(}\frac{t}{V(\sigma)p^{\sigma}}\big{)}\leq\frac{1}{100}, for all .
For , we have that and . Further, . Thus, we have:
[TABLE]
We conclude that as . ∎
Proof of item ii.
Let be as in the proof of Lemma 3.3. Since as , we have, for each fixed
[TABLE]
Thus, for each fixed ,
[TABLE]
is a tail event. By Lemma 3.3, , as . Thus, this tail event has positive probability (see the proof of Lemma 3.2). By the Kolmogorov zero or one Law, a.s.:
[TABLE]
Similarly, a.s.:
[TABLE]
Since is a.s. an analytic function, with probability we have that for an infinite number of . ∎
Acknowledgments. The proof of Theorem 1.1 item ii was initially presented only in the case . I would like to thank the anonymous referee for pointing that this should not be a necessary condition for the existence of an infinite number of real zeros, and for pointing the reference [1], from which I could adapt their Theorem 1.2 for random Dirichlet series (Lemma 3.3).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. Bovier and P. Picco , A law of the iterated logarithm for random geometric series , Ann. Probab., 21 (1993), pp. 168–184.
- 2[2] J.-P. Kahane , Some random series of functions , vol. 5 of Cambridge Studies in Advanced Mathematics, Cambridge University Press, Cambridge, second ed., 1985.
- 3[3] M. R. Krishnapur , Zeros of random analytic functions , Pro Quest LLC, Ann Arbor, MI, 2006. Thesis (Ph.D.)–University of California, Berkeley.
- 4[4] H. L. Montgomery and R. C. Vaughan , Multiplicative number theory. I. Classical theory , vol. 97 of Cambridge Studies in Advanced Mathematics, Cambridge University Press, Cambridge, 2007.
- 5[5] H. Nguyen, O. Nguyen, and V. Vu , On the number of real roots of random polynomials , Commun. Contemp. Math., 18 (2016), pp. 1550052, 17.
- 6[6] A. N. Shiryaev , Probability , vol. 95 of Graduate Texts in Mathematics, Springer-Verlag, New York, second ed., 1996. Translated from the first (1980) Russian edition by R. P. Boas.
