Abstract
We study the class of random entire functions given by power series, in which the coefficients are formed as the product of an arbitrary sequence of complex numbers and two sequences of random variables. One of them is the Rademacher sequence, and the other is an arbitrary complex-valued sequence from the class of sequences of random variables, determined by a certain restriction on the growth of absolute moments of a fixed degree from the maximum of the module of each finite subset of random variables. In the paper we prove sharp Wiman–Valiron’s type inequality for such random entire functions, which for given holds with a probability p outside some set of finite logarithmic measure. We also considered another class of random entire functions given by power series with coefficients, which, as above, are pairwise products of the elements of an arbitrary sequence of complex numbers and a sequence of complex-valued random variables described above. In this case, similar new statements about not improvable inequalities are also obtained.
Keywords:
random entire function; Wiman’s inequality; Levy’s phenomenon; maximum modulus; maximal term; central index; dependent random variables; sub-Gaussian random variables; subexponential random variables; Pareto distribution; Cauchy distribution; maximum modulus of random variables MSC:
30B20; 30D20
1. Introduction
Let us consider an entire functions of the form
Denote
as the maximum modulus, the maximal term, and central index of series (1), respectively.
The following Wiman–Valiron theorem is well known [1,2].
Theorem 1
([1,2]). For every non-constant entire function of form (1) and any there exists a set of finite logarithmic measure, i.e.,
such that for all we have
Note that the constant in the inequality (2) cannot be replaced in general by a smaller number. Indeed, for the entire function we have ([3], p. 177)
Furthermore, from results proved in [4] for entire Dirichlet series it follows that there exists entire function of the form (1) such that
Therefore, inequality (2) is sharp in the class of non-constant entire functions. However, this inequality can be improved in some subclasses of entire functions, i.e., in the subclasses of:
- (1)
- Entire functions of finite order ([3,5,6]);
- (2)
- Entire function, which can be represented by gap power series ([7,8]);
- (3)
- Random entire functions ([9,10,11,12,13]).
In this paper, we consider only random entire functions.
Let be the probability space, which allows the existence of a uniform distribution on it, where is the -algebra of subsets of , P is the probability measure on . In the paper, the notion “almost surely” will be used in the sense that the corresponding property holds almost everywhere with respect to the measure P on . We say that some relation holds almost surely if it holds for each analytic function from some class of almost surely in .
Let be the Rademacher sequence, which is a sequence of independent random variables defined on the Steinhaus probability space . For any we have
Firstly, we consider random entire function of the form
From the results proved in [11], the following theorem can be established.
Theorem 2.
For of the form (4) and any , there almost surely exists a set
of finite logarithmic measure such that for all we have
From the results proved in ([14], p. 45), the following statement can be derived. For the random entire function
we have, almost surely,
Furthermore, from results proved in [4], it follows that there exists a random entire function of the form (4) such that
Wiman’s inequality for the most general class of random entire functions was established in [8]. Let be a sequence of real, independent, centered sub-Gaussian random variables, that is for any , we have and there exist a constant such that for any
Also, for such random variables (see [15]), there exists such that for any and all we have
We denote the class of such random variables by .
For we have ([15], p. 81 [Exercise 7.8]) for any and
where is the variance of random variable
From statement established in [8], the following result can be derived (specifically for the case when ).
Theorem 3
([8]). Let and
Then there exists a set of finite logarithmic measure, such that for all , almost surely
Also in [8], there was constructed an example of random entire function of the form (6), from which it follows necessity of boundedness of sequence
Theorem 4
([8]). For any there exist a sequence of real independent random variables satisfying for all
with the entire function of the form (6) and a constant such that almost surely
It is worth noting that in the statements about random entire functions mentioned above (such as Theorem 1 from [7] and similar results), the expectation of the random variables is zero. In light of this, Professor M. M. Sheremeta, in 1996 asked whether it is possible to derive a sharper Wiman’s inequality for classes of random entire functions of the form
where for . One can find a negative answer to this question in [9].
Let be the class of uniformly bounded real sequences such that
for any
Theorem 5
([9]). If and , then for any and of the form (6) there exists a set of finite logarithmic measure, such that for all almost surely,
The sharpness of inequality (7) follows from the next statement.
Theorem 6
([9]). For any sequence such that and then there exists a function of the form (6) such that, almost surely,
Remark that in all statements about random entire functions cited above, the inequalities were proved only with probability equal to 1 (almost surely) and only for sequences of random variables which are independent and sub-Gaussian.
The following questions also arise in this regard: are we able to obtain sharp estimates of maximum modulus of random entire functions:
- (a)
- with probability ;
- (b)
- in the cases when the sequence :
- (1)
- is not sub-Gaussian;
- (2)
- may not be independent.
In this paper, we provide an answer to all these questions.
2. Additional Notations and Definitions
For two positive functions and the relation as signifies the asymptotic equivalence of the functions up to constant factors. Specifically,
which means that there exist positive constants such that the inequality
holds for sufficiently large N.
Let us consider the random entire functions of the form
where
is the Rademacher sequence, and is a sequence of complex-valued random variables (denote by ) such that there exist a constant and a function
non-decreasing by N and such that
We denote such a class of random entire functions with
Remark that for any sequence function
is non-decreasing by N and because
and by Lyapunov’s inequality for we have
Also, the class of random entire functions of the form
is denoted by
In this paper, we will use the following notations.
3. Auxiliary Statements
We need the following statement about upper and lower bound of
Lemma 1
([8]). For any there exists a set of finite logarithmic measure such that for all , we have
In order to obtain estimates, which hold outside some exception set, the next lemma is useful.
Lemma 2
([9]). Let be a continuous increasing to function on , be a set such that its complement contains an unbounded open set. Then, there is an infinite sequence such that
- (1)
- (2)
- (3)
- if then
- (4)
- the set of indices, for which (3) holds, is unbounded.
The following lemma is about the upper bound of for random entire functions from the class
Lemma 3.
Let For any there exist , a set of finite logarithmic measure such that for all , one has
Proof.
For denote Using Markov’s inequality and (9), we can estimate probabilities of these events. So, for some we have
So,
Let
Then, For , we get
Therefore, for we obtain
Let us choose a set E and a sequence from Lemma 2. Define
By the definition of we get
Then, by the Borel–Cantelli Lemma for almost all for , we obtain
Let be an arbitrary number outside the set By Lemma 2
Therefore, for almost all and outside of a set of finite logarithmic measure E we have
It remains to choose □
4. Main Results
We derive sharp asymptotic estimates for the maximum modulus of functions In this case, the elements of a sequence may not be sub-Gaussian and could be dependent. The main result of this paper is stated in the following theorem.
Theorem 7.
Let For there exist and a set of finite logarithmic measure, such that for all we have, with probability
Remark that the exponent and the degree 1 of function cannot be replaced simultaneously by smaller numbers. This follows from the next theorem.
Theorem 8.
For any non-decreasing function in N and β that satisfies condition (10), there exist a sequence of random variables , an entire function , and a constant such that, almost surely,
Also, we derive sharp asymptotic estimates for the maximum modulus of functions In this case, the elements of a sequence may be dependent or not centered.
Theorem 9.
Let For , there exist and a set of finite logarithmic measure, such that for all we have, with probability ,
Remark that exponent and the degree 1 of function cannot be simultaneously replaced by smaller numbers.
Theorem 10.
For any non-decreasing function in N and β that satisfies condition (10), there exist a sequence of random variables , an entire function and a constant such that for all
Proof of Theorem 7.
By Theorem 2, -almost surely there exists a set of finite logarithmic measure such that for all we have
Then by Lemma 3 we get
where
is the non-negative random variable. Then, by Markov’s inequality, we obtain
Remark that there exist a set of finite logarithmic measure such that for all with probability , we have
Finally, for with probability p we get
or more precisely
□
Proof of Theorem 8.
Let be a non-decreasing function by n and for which (10) holds. Suppose that
Remark that
Then
It follows from (10) that there exists such that we have
Therefore, by inequality (5) we get -almost surely
□
Proof of Theorem 9.
By Theorem 1, there exists a set of finite logarithmic measure such that for all and for almost all , we have
□
Proof of Theorem 10.
Let be a function which satisfies (10) and does not decrease by n and .
Suppose that
Then
As in proof of Theorem 8, for some , we get
Therefore, by inequality (3) for we have for all
□
5. Some Corollaries
First, we consider the case of sequence is an almost surely bounded, i.e., for almost all
Then, we can choose and
Corollary 1.
Let and a sequence be almost surely bounded. Then, for each function there exist and a set of finite logarithmic measure, such that for all we have, with probability ,
Let be the class of random variables such that there exist a constant such that for every and any , we have
Remark, that if then is the class of sub-Gaussian random variables and if then is the class of subexponential random variables.
We prove that for any
Inequality (14) is sharp in the case of . Indeed ([16], p. 28) [Ex.2.5.11], in the case of is a sequence of independent real standard Gaussian random variables there exists a constant such that
We will prove that the degree in inequality (14) is sharp for the class of random variables for any . This follows from such a statement.
Lemma 4.
There exists a sequence such that for any , we have
Proof.
Let be a sequence of independent non-negative random variables such that for any , we have
Then, In this case, we have
One can make the substitution Then, we obtain
□
The following statement holds without the condition of independence of sequence
Theorem 11.
Let and Then, for there exist and a set of finite logarithmic measure, such that for all we have, with probability ,
Proof.
Using Lemma 4, we deduce the following statement.
Theorem 12.
There exist a sequence of random variables , an entire function and a constant such that, almost surely,
Proof.
By Lemma 4, we can choose and and by Theorem 8 we get
□
If satisfies
then we obtain
Corollary 2.
Proof.
Here, we can choose Then
which continues to use Theorem 7. There exist and a set of finite logarithmic measure such that for all we have with probability
□
Let be a sequence of independent Pareto distributed random variables with parameter , which is the density function of
Corollary 3.
Let and be Pareto distributed random variables with parameter . Then, for a random entire function f of the form (8), there exist and a set of finite logarithmic measure, such that for all we have, with probability ,
Proof.
It is enough to remark that satisfies Corollary 2 with for any □
Remark that exponents and in the inequalities of Corollaries 2 and 3, respectively, cannot be replaced by smaller numbers. This follows from the next statement.
Theorem 13.
Let be a sequence of independent Pareto distributed random variables with parameter . For any there exist an entire function and a constant such that, almost surely,
Proof.
Let be a sequence of independent random variables having a Pareto distribution with parameter . Then, for any we get
Firstly, we calculate expectation
One can make the substitution Then
Therefore, We can choose
By Theorem 8, there exist and such that we have almost surely
Also, for any , we choose . Then, almost surely, one has
where □
If has Cauchy distribution for all , i.e., density function of
we obtain such a statement.
Corollary 4.
Let and be a sequence of Cauchy distributed random variables. Then, for random entire function f of form (8) there exist and a set of finite logarithmic measure, such that for all , we obtain, with probability ,
Proof.
Let Remark that
Therefore, we can choose in Corollary 2. So, by Corollary 2, there exist and a set of finite logarithmic measure such that for all we have with probability
It continues to choose □
Remark, that exponent in Corollary 4 cannot be replaced by smaller number. This follows from the next statement.
Theorem 14.
Let be a sequence of independent Cauchy distributed random variables. There exist an entire function and a constant such that, almost surely,
Proof.
Firstly, we remark that for
On the other hand, one has
Now, one can make the substitution Then
It continues to use Theorem 8. Then, there exist an entire function and constant such that we have, almost surely,
□
6. Discussion
Remark 1.
For the random entire function Theorem 13 and Corollaries 1–3 hold when we replace exponent by , and Corollary 4 and Theorem 14 also hold if we replace the exponent by , respectively.
It is obvious that the classical Wiman’s inequality (2) cannot be improved for Finally, we formulate the following open problem
Problem 1.
Is the degree of sharp in the inequality (15)?
7. Conclusions
We prove sharp Wiman–Valiron’s type inequality for random entire functions, which holds with a probability outside the set of finite logarithmic measure. Random variables, which are multipliers of Taylor’s coefficients of entire functions, may not be sub-Gaussian and may not be independent.
Author Contributions
Conceptualization, O.S.; investigation, A.K. and O.S.; writing—original draft preparation, A.K. and O.S.; Writing—Review and Editing, A.B. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Data Availability Statement
Data are contained within the article.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Valiron, G. Fonctions Analytiques; Presses Universitaires de France: Paris, France, 1954. [Google Scholar]
- Wittich, H. Neuere Untersuchungen über Eindeutige Analytische Funktionen; Springer: Berlin/Heidelberg, Germany; Göttingen, Germany, 1955. [Google Scholar]
- Pólya, G.; Szego, G. Aufgaben und Lehrsätze aus der Analysis, 2nd ed.; Springer: Berlin, Germany, 1925. [Google Scholar]
- Skaskiv, O.B. On the classical Wiman inequality for entire Dirichlet series. Visn. L’viv. Univ. Ser. Mekh.-Mat. 1999, 54, 180–182. [Google Scholar]
- Hayman, W.K. The local growth of power series: A survey of the Wiman-Valiron method. Canad. Math. Bull. 1974, 17, 317–358. [Google Scholar] [CrossRef]
- Filevych, P.V. Wiman-Valiron type inequalities for entire and random entire functions of finite logarithmic order. Siberian Math. J. 2003, 42, 579–586. [Google Scholar] [CrossRef]
- Skaskiv, O.B. Random gap power series and Wiman’s inequality. Mat. Stud. 2008, 30, 101–106. Available online: http://matstud.org.ua/texts/2008/30_1/101-106.pdf (accessed on 20 October 2024). (In Ukrainian).
- Kuryliak, A. Subnormal independent random variables and Levy’s phenomenon for entire functions. Mat. Stud. 2017, 47, 10–19. [Google Scholar] [CrossRef]
- Filevych, P.V. Correlation between the maximum modulus and maximal term of random entire functions. Mat. Stud. 1997, 7, 157–166. Available online: http://matstud.org.ua/texts/1997/7_2/7_2_157-166.pdf (accessed on 20 October 2024).
- Filevych, P. Some classes of entire functions in which the Wiman-Valiron inequality can be almost certainly improved. Mat. Stud. 1996, 6, 59–66. Available online: http://matstud.org.ua/texts/1996/6/6_059-066.pdf (accessed on 20 October 2024).
- Erdos, P.; Re´nyi, A. On random entire function. Zastos. Mat. 1969, 10, 47–55. [Google Scholar] [CrossRef]
- Lévy, P. Sur la croissance de fonctions entière. Bull. Soc. Math. Fr. 1930, 58, 127–149. [Google Scholar] [CrossRef][Green Version]
- Steele, J.M. Wiman’s inequality for entire functions with rapidly oscilating coefficients. J. Math. Anal. Appl. 1987, 123, 550–558. [Google Scholar] [CrossRef]
- Hayman, W.K. On the characteristic of functions meromorphic in the plane and of their integrals. Proc. Lond. Math. Soc. 1965, 14, 93–128. [Google Scholar] [CrossRef]
- Kahane, J.P. Some Random Series of Functions; Cambridge University Press: Cambridge, UK, 1985. [Google Scholar]
- Vershynin, R. High-Dimensional Probability; V.47; Cambridge Series in Statistical and Probabilistic Mathematics; Cambridge University Press: Cambridge, UK, 2024. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).