The Variance of the Number of Zeros for Complex Random Polynomials Spanned by OPUC
Aaron M. Yeager

TL;DR
This paper investigates the variance of zeros of random linear combinations of orthonormal polynomials on the unit circle, providing estimates and limiting formulas under various conditions on the polynomials and random coefficients.
Contribution
It offers new quantitative estimates and formulas for the variance of zeros of complex random polynomials spanned by OPUC, extending understanding in different regularity and measure cases.
Findings
Variance estimates for zeros in sectors intersecting the unit circle.
Limiting variance formulas for zeros in annuli away from the unit circle.
Results apply to polynomials with coefficients satisfying certain moment bounds.
Abstract
Let be a sequence of orthonormal polynomials on the unit circle (OPUC) with respect to a probability measure . We study the variance of the number of zeros of random linear combinations of the form where are complex-valued random variables. Under the assumption that the distribution for each satisfies certain uniform bounds for the fractional and logarithmic moments, for the cases when are regular in the sense of Ullman-Stahl-Totik or are such that the measure of orthogonality satisfies where , with , , and , we give a quantitative estimate on the the variance of the number of zeros of inβ¦
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.
The Variance of the Number of Zeros for Complex Random Polynomials Spanned by OPUC
Aaron M.Β Yeager
Abstract
Let be a sequence of orthonormal polynomials on the unit circle (OPUC) with respect to a probability measure . We study the variance of the number of zeros of random linear combinations of the form
[TABLE]
where are complex-valued random variables. Under the assumption that the distribution for each satisfies certain uniform bounds for the fractional and logarithmic moments, for the cases when are regular in the sense of Ullman-Stahl-Totik or are such that the measure of orthogonality satisfies where , with , , and , we give a quantitative estimate on the the variance of the number of zeros of in sectors that intersect the unit circle. When are real-valued on the real-line from the Nevai class and are i.i.d.Β complex-valued standard Gaussian, we prove a formula for the limiting value of variance of the number of zeros of in annuli that do not contain the unit circle.
2010 Mathematics Subject Classification : 30C15, 30E15, 26C10, 60B10.
Keywords: Random Polynomials, Orthogonal Polynomials on the Unit Circle, Nevai Class, Ullman-Stahl-Totik Regularity.
1 Introduction
A random polynomial is a polynomial of the form
[TABLE]
where are random variables. The systematic study of zeros of random polynomials has a rich history dating back the classical works starting in the 1930βs (c.f. Bloch and PΓ³lya [2], Littlewood and Offord ([19], [20], [21], [22], [23])). For a summary of the early results in the field we refer the reader to the books by Bharucha-Reid and M. Sambandham [3], and Farahmond [8].
Let denote the number of zeros of in , and be the expected value. When are i.i.d.Β standard Gaussian, in 1943 Kac [18] (and independently Rice [27] in 1945) produced an integral equation for , with . Kac went further to establish the asymptotic
[TABLE]
The error term in the above asymptotic was later sharpened by Hammersley [13], Jamrom ([16], [17]), Wang [32], Edelman and Kostlan [5], and finally Wilkins [33] who showed that
[TABLE]
where are constants.
We denote the variance of the number of zeros of a random polynomial in as
[TABLE]
The first result concerning the variance of the number of real zeros of a random algebraic polynomial with i.i.d.Β real-valued standard Gaussian coefficients was an upper bound provided by Stevens [30] in 1965. Specifically, in this case he gave the upper bound
[TABLE]
Soon after, in 1968 Fairly [10] computed the exact variances in this case and in the case with the coefficients of the random algebraic polynomial take the values with equal probabilities for polynomials of degree up to .
In 1974, Maslova [24] considered the case when the random algebraic polynomial has i.i.d.Β real-valued coefficients such that , , and for some . For this case she established that as it follows that
[TABLE]
where denotes convergence in distribution. We note that Nguyen and Vu [25] have recently generalized Maslovaβs results to hold under the assumption that the distribution of coefficients are independent (but not necessarily identically distributed) and have moderate growth.
In this work we study the variance of the number of zeros in for
[TABLE]
where are complex-valued random variables, and are orthogonal polynomials on the unit circle (OPUC). The OPUC are polynomials that are defined by a probability Borel measure on such that
[TABLE]
We note that the measure above is referred to as the measure of orthogonality for . Observe that OPUC are a direct generalization of the monomials which have .
As the topics in this paper do not cover trigonometric random polynomials, i.e. , we note that asymptotics for the variance of the number of real zeros in has been well studied (cf. Boomolny, Bohigas, Leboeuf [4], Farahmand [9], Grandville and Wigman [12], and Su and Shao [31]). Similarly we mention the works of Forrester and Honner [11], Hannay [14], Shiffman and Zeldtich [28], Bleher and Di [1], that concern asymptotics for variance of the number of zeros for weighted random polynomials, i.e. random polynomials of the form where either or .
2 Main Results
2.1 Variance of the Number of Zeros in Sectors that intersect the Unit Circle
Let
[TABLE]
Consider the random orthogonal polynomial
[TABLE]
where are OPUC, and are complex-valued random variables such that
[TABLE]
and
[TABLE]
We do not assume that random variables are independent nor identically distributed. In the case when the random variables are independent, then all uniform bounds in (3) and (4) reduce to those of a single random variable . We note that the assumption (3) is to ensure that the tails of the distribution have sufficient decay, and the assumption (4) is present so that that random coefficients and do not vanish so often that random orthogonal polynomial has degree less than or factors as times a degree polynomial. Such assumptions hold for a wide class of random variables, which certainly includes Gaussian random variables.
Applying Theorem 3.1 of [26] and further estimating we are able to obtain the following:
Lemma 1**.**
For the random orthogonal polynomial (2) with the uniform estimates (3) and (4) on the coefficients , suppose that the measure of orthogonality associated to is regular in the sense of Ullman-Stahl-Totik, that is,
[TABLE]
where is the leading coefficient of . Then
[TABLE]
Due to Corollary 3.2 in [26] (and the comment preceding this Corollary), it was shown that if the measure of orthogonality associated to the OPUC satisfies , where is a generalized Jacobi weight of the form
[TABLE]
with , , and , then
[TABLE]
We apply (6) and (8) for an estimate of the variance of the number of zeros.
Theorem 2**.**
The random orthogonal polynomial (2) with complex-valued random variables satisfying conditions (3) and (4) possesses the following properties:
If the measure of orthogonality associated to satisfies , where is given by (7), we have
[TABLE] 2. 2.
Under the assumption that are regular in the sense of Ullman-Stahl-Totik, it follows that
[TABLE]
where is given by (5).
2.2 Variance of the Number of Zeros in Annuli not intersecting the Unit Circle
We now consider random orthogonal polynomials
[TABLE]
where are i.i.d.Β complex-valued standard Gaussian, and are OPUC that are real-valued on the real-line and from the Nevai Class. We remind the reader that the Nevai Class of OPUC are the collection of OPUC with property that locally uniformly for we have
[TABLE]
We remark that our assumption that are real-valued on the real-line is to ensure that locally uniformly for it follows that
[TABLE]
In this setting we will study the variance of the number of zeros via examining the first and second correlation functions. We denote the first and second correlation functions for as and , respectively. To see the connection between the variance of the number of zeros and these correlation functions, observe that for a measurable set it follows that
[TABLE]
where the equalities
[TABLE]
are known results.
For the random orthogonal polynomial (11), due to Corollary 2.2 from [34] we have
[TABLE]
locally uniformly for all . While the formula for the second correlation function associated to the random orthogonal polynomial (11) is rather complicated, its limit as tends to infinity has a striking simplicity.
Theorem 3**.**
When and are both in the unit disk or both in the the exterior of the unit disk, the second correlation function for the random orthogonal polynomial (11) satisfies
[TABLE]
where the above convergence takes place locally uniformly.
Our next theorem gives the limiting value of the variance of the number of zeros of the random orthogonal polynomial (11) in an annulus
[TABLE]
that does not contain the unit disk. We remark that our approach allows one to similarly consider sectors that do not contain the unit circle at the expense the below result taking a complicated shape.
Theorem 4**.**
The random orthogonal polynomial (11) possesses the property that
[TABLE]
We note that taking and in the above theorem, we achieve that the random orthogonal polynomial (11) gives the simple formula:
[TABLE]
where .
3 The Proofs
Proof of Lemma 1.
Setting
[TABLE]
by Theorem 3.1 of [26] for all large we have
[TABLE]
where
[TABLE]
Observe that the uniform bounds (3) and (4) on the expectations for the coefficients immediately give that
[TABLE]
Thus to establish (8), it suffices to show
[TABLE]
where .
Writing , equation 1.5.22 of [29] gives
[TABLE]
where are recurrence coefficients coming from the three term recurrence relation (c.f. Theorem 1.5.4 [29]):
[TABLE]
with . For the normalized OPUC, denoted as , we have , so that appealing to (16) and (1.5.17) of Theorem 1.5.3 in [29] yields
[TABLE]
where we have relied on the Cauchy-Schwarz inequality in the last inequality. To estimate the second term above, notice that since each , we have
[TABLE]
Therefore
[TABLE]
where we have relied on (16) for the second term in the equality, which completes the desired estimate to give (6). β
Proof of Theorem 2.
We first prove (9). Observe that
[TABLE]
where we have appealed to (8) in the last equality. Thus
[TABLE]
Therefore
[TABLE]
which gives the result of (9).
For the case are regular in the sense of Ullman-Stahl-Totik, as Lemma 1 gave
[TABLE]
repeating the computation (17) we see that
[TABLE]
Hence repeating the computation (18) we achieve
[TABLE]
and thus completing the desired result (10). β
Proof of Theorem 3.
For the random sum , where are complex valued i.i.d.Β Gaussian random variables and are a polynomial basis with the degree of equal to , Corollary 3.4.2 of [15] gives the following formulas for the correlation functions:
[TABLE]
where denotes the permanent of a matrix, is the conjugate transpose of the matrix , and
[TABLE]
with the second equality in each row above following from the property that the random variables have mean zero and variance one. We remark that for the second correlation function with in the above and and , in this case we have
[TABLE]
As is a polynomial basis with for all , we have and , for some constants with . Thus
[TABLE]
Hence we see that for all . As , we see that the representation
[TABLE]
is valid everywhere for all random polynomials spanned by a polynomial basis.
Expanding the permanent and the determinant in the definition of second correlation function, one sees that can be written as
[TABLE]
where
[TABLE]
and
[TABLE]
We will simplify the above formulas via the Christoffel-Darboux formula. For a collection of OPUC , the Christoffel-Darboux formula (c.f.Β Theorem 2.2.7, p. 124 of [29]) states that for with , we have
[TABLE]
where .
Taking the derivative of (21) with respect to yields
[TABLE]
with
[TABLE]
Differentiating (22) with respect to gives
[TABLE]
with
[TABLE]
Let us rewrite (20) as
[TABLE]
where
[TABLE]
and
[TABLE]
We now introduce the notation that . Observe that since the OPUC have real coefficients, we have . Thus the condition of the OPUC being from the Nevai class can be restated as
[TABLE]
Consequently
[TABLE]
where
[TABLE]
Hence appealing to the above and (21), we see that as the denominator of is
[TABLE]
We now find the asymptotic for . Set
[TABLE]
Using (22) and (24) we see that
[TABLE]
where we have made use of the identity to get the expression in parentheses of (42) in the shape it is in.
We now define
[TABLE]
Simplifying and then appealing to (21), (33), and (34), we see that
[TABLE]
Turning now to the asymptotic for , observe the first summand of (37) and second summand of (40) cancel algebraically, and that the sum of the second summand in (37) and the first summand of (43) simplify to
[TABLE]
The sum of the first summand of (40) and (44) collect to give
[TABLE]
Combining (47) with (48) then appealing to (21), (22), (24) to simplify the expressions, and finally using the asymptotics of (33) and (34) on sees
[TABLE]
For the sum , first notice using (21) the first summand of (38) and the second summand of (41) sum to
[TABLE]
Appealing to (21), the remaining summand of (38) simplifies as
[TABLE]
the remaining summand of (41) reduces to
[TABLE]
and (45) can be written as
[TABLE]
Simplifying the sum of expressions (51), (52), and (53), then combining with (50) we achieve
[TABLE]
Thus the sum of (46), (49), and (54), combine to give
[TABLE]
The calculations for are done in a similar fashion as for . Due the complication nature of the computations, we see fit to include the complete derivation of . Let
[TABLE]
From (22) and (24) it follows that
[TABLE]
We now set
[TABLE]
Simplifying then using the relations (21), (33), and (34) yields
[TABLE]
To begin calculating , first we combine (57), (61), and (65), to give
[TABLE]
Now combing (60) with (64) yields
[TABLE]
Summing (68) with (69) then using (21), (22), (24) to simplify the expressions, and finally appealing the asymptotics of (33) and (34) on sees
[TABLE]
Turning now to , combining the first summands of (58) and (62) and using (21), (22), (24) to further simplify gives
[TABLE]
From the relations (21), (22), and (24), the sum of second summands of (58) and (66) reduces to
[TABLE]
Using (21), (22), and (24), second summand of (62) with first summand of (66) combine to yield
[TABLE]
Combining (71), (72), and (73), then again appealing (21), (22), (24) to simplify the expressions, and using the asymptotics of (33) and (34) it follows that
[TABLE]
Summing (67), (70), and (74), we see that
[TABLE]
Combining (26), (35), (55), and (75), we therefore achieve
[TABLE]
β
Proof of Theorem 4.
Appealing to (12) and (13) gives
[TABLE]
where we have used that the convergence of (13) and (14) are locally uniform on annuli that do not contain the unit circle so that we can pass the limit over the integration. We remark that formally we need to consider a closed annulus the does not contain the unit circle in the above. However, since the measure associated to the integrals is Lebesgue area measure which is absolutely continuous, and the limiting values above are continuous functions away from the unit circle, we have that the boundary of the closed annulus has measure zero. Hence we just consider the open annulus .
Observe that for an annulus not containing the unit circle, (76) simply integrates as
[TABLE]
We will compute (77) separately depending on whether or not the annulus is contained within the unit disk. We first consider the case when the annulus is contained with in the unit disk. Since for we have
[TABLE]
switching to polar coordinates with and , the double integral (77) becomes
[TABLE]
By the convergence of the above series being locally uniform in the unit disk, we can interchange the infinite sums and integrals. After expanding the product of sums, any sum with will give
[TABLE]
and similarly for the terms with . Thus only the terms will survive the integration. This yields (79) is now
[TABLE]
Therefore, combining the above with (78) we see that for
[TABLE]
When , notice that for it follows that
[TABLE]
Thus setting and we have
[TABLE]
As in the case in the unit disk, due to the orthogonality of the exponential function, within the integral of (77) only the terms when will give a nonzero integration to hence yield that (77) is
[TABLE]
Combining the above with (78), we conclude that for it follows that
[TABLE]
β
Acknowledgements. The author would like thank his P.h.D. advisor Igor Pritsker for initiating this project, as well as for the many helpful discussions that led to the results.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] P. Bleher and X. Di, Correlations between zeros of a random polynomial, J. Statist. Phys. 88 (1997), 269β305.
- 2[2] A. Bloch and G. PΓ³lya, On the roots of a certain algebraic equation, Proc. Lond. Math. Soc. 33 (1932), 102β114.
- 3[3] A. T. Bharucha-Reid and M. Sambandham, Random polynomials, Academic Press, Orlando, 1986.
- 4[4] E. Bogomolny, O. Bhigas, and P. Leboeuf, Quantum chaotic dynamics and random polynomials, J. Statist. Phys. 85 (1996), 639β679.
- 5[5] A. Edelman and E. Kostlan, How many zeros of a random polynomial are real?, Bull. Amer. Math. Soc. 32 (1995), 1-37.
- 6[6] P. ErdΕs and A. Offord, On the number of real roots of a random algebraic equation, Proc. Lond. Math. Soc. 6 (1956), 139β160.
- 7[7] P. ErdΕs and P. TurΓ‘n, On the distribution of roots of polynomials, Ann. Math. 51 (1950), 105β119.
- 8[8] K. Farahmand, Topics in random polynomials, Pitman Res. Notes Math. 393, 1998.
