On the asymptotic variance of the number of real roots of random polynomial systems
Diego Armentano, Jean-Marc Aza\"is, Federico Dalmao, Jos\'e R. Le\'on

TL;DR
This paper derives the asymptotic variance of the normalized count of real roots in high-degree Kostlan-Shub-Smale random polynomial systems, using Kac-Rice formula and Hermite expansions.
Contribution
It provides the first explicit asymptotic variance formula for the number of real roots in these polynomial systems, extending understanding of their probabilistic behavior.
Findings
Asymptotic variance formula derived for large degree
Utilizes Kac-Rice formula for second factorial moment
Employs Hermite expansion to analyze the variance
Abstract
We obtain the asymptotic variance, as the degree goes to infinity, of the normalized number of real roots of a square Kostlan-Shub-Smale random polynomial system of any size. Our main tools are the Kac-Rice formula for the second factorial moment of the number of roots and a Hermite expansion of this random variable.
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.
On the asymptotic variance of the number of real roots of random polynomial systems
Diego Armentano Jean-Marc Azaïs Federico Dalmao José R. León CMAT, Universidad de la República, Montevideo, Uruguay. E-mail: [email protected], UMR CNRS 5219, Université de Toulouse, Email: [email protected] DMEL, Universidad de la República, Salto, Uruguay. E-mail: [email protected], Universidad de la República, Montevideo, Uruguay and Escuela de Matemática. Facultad de Ciencias. Universidad Central de Venezuela, Caracas, Venezuela. E-mail: [email protected]
Abstract
We obtain the asymptotic variance, as the degree goes to infinity, of the normalized number of real roots of a square Kostlan-Shub-Smale random polynomial system of any size. Our main tools are the Kac-Rice formula for the second factorial moment of the number of roots and a Hermite expansion of this random variable.
Keywords: *Kostlan-Shub-Smale ramdom polynomials, Kac-Rice formula, Hermite expansion.
*AMS subjet classification: Primary: 60F05, 30C15. Secondary: 60G60, 65H10
1 Introduction
The study of the roots of random polynomials is among the most important and popular topics in Mathematics and in some areas of Physics. For almost a century a considerable amount of literature about this problem has emerged from fields as probability, geometry, algebraic geometry, algorithm complexity, quantum physics, etc. In spite of its rich history it is still an extremely active field.
There are several reasons that lead to consider random polynomials and several ways to randomize them, see Bharucha-Reid and Sambandham [3].
The case of algebraic polynomials with independent identically distributed coefficients was the first one to be extensively studied and was completely understood during the 70s. If is centered, and for some , then, the asymptotic expectation and the asymptotic variance of the number of real roots of , as the degree tends to infinity, are of order and, once normalized, the number of real roots converges in distribution towards a centered Gaussian random variable. See the books by Farahmand [7] and Bharucha-Reid and Sambandham [3] and the references therein for the whole picture.
The case of systems of polynomial equations seems to be considerably harder and has received in consequence much less attention. The results in this direction are confined to the Shub-Smale model and some other invariant distributions. The ensemble of Shub-Smale random polynomials was introduced in the early 90s by Kostlan [9]. Kostlan argues that this is the most natural distribution for a polynomial system. The exact expectation was obtained in the early 90’s by geometric means, see Edelman and Kostlan [5] for the one-dimensional case and Shub and Smale [18] for the multi-dimensional one. In 2004, 2005 Azaïs and Wschebor [2] and Wschebor [19] obtained by probabilistic methods the asymptotic variance as the number of equations and variables tends to infinity. Recently, Dalmao [4] obtained the asymptotic variance and a CLT for the number of zeros as the degree goes to infinity in the case of one equation in one variable. Letendre in [13] studied the asymptotic behavior of the volume of random real algebraic submanifolds. His results include the finiteness of the limit variance, when the degree tends to infinity, of the volume of the zero sets of Kostlan-Shub-Smale systems with strictly less equations than variables. Some results for the expectation and variance of related models are included in [2, 11, 12].
In the present paper we prove that, as the degree goes to infinity, the asymptotic variance of the normalized number of real roots of a Kostlan-Shub-Smale square random system with equations and variables exists in . We use Rice Formulas [1] to show the finiteness of the limit variance and Hermite expansions as in Kratz and León [10] to show that it is strictly positive. Furthermore, we strongly exploit the invariance under isometries of the distribution of the polynomials.
The reader may wonder, in view of the results mentioned above, if the normalized number of roots satisfies a CLT when the degree of the system tends to infinity. The answer is affirmative if [4] but for the time being we cannot give an answer to this question for . The ingredients to prove a CLT for a non linear functional of a Gaussian process are: a) to write a representation in the Itô-Wiener chaos of the normalized functional; b) to demonstrate that each component verifies a CLT (Fourth Moment Theorem [16], [17]) and if the functional has an expansion involving infinitely many terms: c) to prove that the tail of the asymptotic variance tends uniformly (w.r.t. ) to zero. In the present case we lack a proof of c). For the fact that the invariance by rotations is equivalent with the stationarity allows to build a proof similar to the one made for the number of crossings of a stationary Gaussian process.
The rest of the paper is organized as follows. Section 2 sets the problem and presents the main result. Section 3 deals with the proof and Section 4 presents some auxiliary results as well as the explicit form of the asymptotic variance.
2 Main Result
Consider a square system of polynomial equations in variables with common degree . More precisely, let with
[TABLE]
where
and ; 2. 2.
, , ; 3. 3.
and .
We say that has the Kostlan-Shub-Smale (KSS for short) distribution if the coefficients are independent centered normally distributed random variables with variances
[TABLE]
We are interested in the number of real roots of that we denote by . Shub and Smale [18] proved that . Our main result is the following.
Theorem 1**.**
Let be a KSS random polynomial system with equations, variables and degree . Then, as we have
[TABLE]
where .
2.1 Explicit expression of the variance
Using the method of section 12.1.2 of [1] an explicit expression for the limit variance can be given.
For let be independent standard normal random vectors on . Let us define
- •
;
- •
;
- •
where is the Euclidean norm on ;
- •
for , ;
- •
for ,
Theorem 2**.**
We have
[TABLE]
∎
3 Proof
3.1 Preliminaries
It is customary and convenient to homogenize the polynomials. That is, to add an auxiliary variable and to multiply the monomial in corresponding to the index by . Let denote the resulting vector of homogeneous polynomials in real variables with common degree . We have,
[TABLE]
where this time ; ; ; and .
Since is homogeneous, its roots consist of lines through [math] in . Then, it is easy to check that each root of corresponds exactly to two (opposite) roots of on the unit sphere of . Furthermore, one can prove that the subset of homogeneous polynomials with roots lying in the hyperplane has Lebesgue measure zero. Then, denoting by the number of roots of on , we have almost surely.
From now on we work with the homogenized version . The standard multinomial formula shows that for all we have
[TABLE]
where is the usual inner product in . As a consequence, we see that the distribution of the system is invariant under the action of the orthogonal group in . For the ease of notation we omit the dependence on of .
In the sequel we need to consider the derivative of , . Since the parameter space is the sphere , the derivative is taken in the sense of the sphere, that is, the spherical derivative of is the orthogonal projection of the free gradient on the tangent space of at . The -th component of at a given basis of the tangent space is denoted by .
The covariances between the derivatives and between the derivatives and the process are obtained via routine computations from the covariance of . In particular, the invariance under isometries is preserved after derivation and for each , is independent from .
3.2 Finiteness of the limit variance
In this section we prove that
[TABLE]
Recall that , we write
[TABLE]
The quantity is computed using Rice formula [1, Th. 6.3] and a localisation argument.
[TABLE]
Here and are the -geometric measure on but we will use in other parts and for the Lebesgue measure.
The following Lemma allows us to reduce this integral to a one-dimensional one. The proof is a direct consequence of the co-area formula.
Lemma 1**.**
Let be a measurable function defined on . Then, we have
[TABLE]
where is the -geometric measure of . ∎
Let be the canonical basis of . Because of the invariance of by isometries we can assume without loss of generality that
[TABLE]
For we choose as basis and for . Finally, take and use Lemma 1. Hence,
[TABLE]
where is the conditional expectation written for as in (3.2).
Now, we deal with the conditional expectation . Introduce the following notation
[TABLE]
and -omitting the -
[TABLE]
Thus, the variance-covariance matrix of the vector at the given basis, can be written in the following form
[TABLE]
where is the identity matrix,
[TABLE]
and is the diagonal matrix
Gaussian regression formulas (see [1, Proposition 1.2]) imply that the conditional distribution of the vector \big{(}{\frac{Y^{\prime}_{\ell}(s)}{\sqrt{d}},\frac{Y^{\prime}_{\ell}(t)}{\sqrt{d}}}\big{)} (conditioned on ) is centered normal with variance-covariance matrix given by
[TABLE]
with and .
It is important to remark that if is a matrix with columns vectors , it holds that for a certain polynomial of degree from to . Using representation of Gaussian vectors from a standard one we can write
[TABLE]
where is the standard normal density in . Because of the homogeneity of the determinant we have
[TABLE]
where .
Now, we return to the expression of the variance in (3.1). We have
[TABLE]
The proof of the convergence of this integral is done in several steps.
In the rest of this section denotes an unimportant constant, its value can change from one occurrence to another. It can depend on , but recall that is fixed.
Step 1: Bounds for .
- •
;
- •
;
- •
; ;
- •
;
- •
any partial derivative of is a polynomial of degree and thus it is bounded by .
Applying that to a point between and , we get
[TABLE]
and
[TABLE]
The finiteness of all the moments of the supremum of Gaussian random variables finally yields
[TABLE]
Step 2: Point-wise convergence. It is a direct consequence of the expansions of sine and cosine functions. As tends to infinity:
- •
;
- •
;
- •
and tend to ;
- •
;
- •
;
being and as in Subsection 2.1. This, in view of the continuity of the function , implies the point-wise convergence of the integrand in (3.10).
Step 3: Symmetrization. We have , , , , and . Hence, in (3.9) becomes
[TABLE]
the rest being unchanged. This corresponds, for example to performing some change of signs (depending on the parity of ) on the coordinates of . Gathering the different this may imply a change of sign in that plays no role because of the absolute value. As a consequence
[TABLE]
In conclusion, for the next step it suffices to dominate the integral in the r.h.s of (3.10) restricted to the interval .
Step 4: Domination. The following lemma gives bounds for the different terms.
Lemma 2**.**
There exists some constant , and some integer such that for and :
- •
;
- •
;
- •
;
- •
for , ;
- •
;
- •
.
Proof.
We give the proof of 1, the other cases are similar or easier. On there exists , such that
[TABLE]
Thus,
[TABLE]
as soon as and is big enough. ∎
We have to find a dominant and to prove the convergence of the integral at zero and at infinity.
At zero, since the function is bounded we have to give bounds for
[TABLE]
Clearly, . Besides,
[TABLE]
where .
For the denominator, using Lemma 2, we have
[TABLE]
We turn now to the numerator, let be a formal Gaussian stationary process on the line with covariance . Hence,
[TABLE]
where we used the Taylor formula with the integral form of the remainder. The covariance function corresponds to the spectral measure \mu=\frac{1}{2}\big{(}\delta_{-d^{-1/2}}+\delta_{d^{-1/2}}\big{)}, see [1]. The spectral measure associated to is the -th convolution of and a direct computation shows that its fourth spectral moment exists and is bounded uniformly in . As a consequence, is bounded uniformely in , yielding that
[TABLE]
Using (3.11) and (3.12) we get the convergence at zero.
At infinity, define
[TABLE]
Multiplication of bounded Lipchitz functions gives a Lipchitz function, thus
[TABLE]
The proof is achieved with Lemma 2.
3.3 Positivity of the limit variance
3.3.1 Hermite expansion of the number of real roots
We introduce the Hermite polynomials by , and . The multi-dimensional versions are, for multi-indexes and , and vectors and
[TABLE]
It is well known that the standardized Hermite polynomials , and form orthonormal bases of the spaces , and respectively. Here, stands for the standard Gaussian measure on () and , . See [16, 17] for a general picture of Hermite polynomials.
Before stating the Hermite expansion for the normalized number of roots of we need to introduce some coefficients. Let () be the coefficients in the Hermite’s basis of the function such that . That is with
[TABLE]
with and : .
Parseval’s Theorem entails . Moreover, since the function is even w.r.t. each column, the above coefficients are zero whenever is odd for at least one
To introduce the next coefficients let us consider first the coefficients in the Hermite’s basis in for the Dirac delta . They are and zero for odd indices [10]. Introducing now the distribution and denoting as its coefficients it holds
[TABLE]
or if at least one index is odd.
Since the formulas for the covariances of Hermite polynomials work in a neater way when the underlying random variables are standardized, we define the standardized derivative as
[TABLE]
where denotes the spherical derivative of at . As said above, the -th component of in a given basis is denoted by .
Proposition 1**.**
With the same notations as above, we have, in the sense, that
[TABLE]
where
[TABLE]
with and and .
Remark 1**.**
Hermite polynomials’ properties imply that for
[TABLE]
Remark 2**.**
The main difficulty in order to obtain a CLT relies on the bound of the variance of the tail because of the degeneracy of the covariances of near the diagonal . Besides, on the sphere finding a convenient re-scaling as in the one-dimensional case [4] is a difficult issue.
Proposition 1 is a direct consequence of the following lemma.
Lemma 3**.**
For define
[TABLE]
where for , and is the spherical derivative of . Then, we have the following.
For , let denote the number of real roots in of the equation . Then, is bounded above by almost surely. 2. 2.
* almost surely and in the sense as .* 3. 3.
The random variable admits a Hermite’s expansion.
Proof.
Since the paths of are smooth, Proposition 6.5 of [1] implies that for every almost surely there is no point such that and the spherical gradient is singular. Using the local inversion theorem, this implies that the roots of are isolated and by compactness they are finitely many. As a consequence, is well defined and a.s. finite. Moreover, for every such that , we have that the set is almost surely linearly independent in . This implies that is uniformly bounded by the Bézout’s number concluding 1 (see for example Milnor [15, Lemma 1, pag. 275]).
By the inverse function theorem, a.s. for every regular value , is locally constant in a neighborhood of . Furthermore, by the Area Formula (see Federer [8], or [1] Proposition 6.1), for small we have
[TABLE]
Hence,
[TABLE]
From 1. and (3.15) we have a.s. Then, the convergence in (3.16) also happens in .
This convergence allows us getting a Hermite’s expansion. We have
[TABLE]
[TABLE]
where are the Hermite coefficients of and the have been already defined. Furthermore, we know that . Now, taking limit and regrouping terms we get as in Estrade and León [6] that
[TABLE]
This concludes the proof. ∎
3.3.2
To prove that we use the Hermite expansion. In fact,
[TABLE]
By Proposition 1, we have,
[TABLE]
The coefficients vanish for any odd and . Thus, the only possibilities to satisfy the condition are that either only one of the indices is and the rest vanish, or that for some and the rest vanish. Hence,
[TABLE]
where , and , . By (3.7)-(3.8) the variables in different sums are orthogonal when evaluated at . Now, by Mehler’s formula, for jointly normal variables . Hence, bounding the sum of the variances by one convenient term, we have
[TABLE]
where last equality is a consequence of (3.3).
The integral tends to a positive limit as can be seen using Lemma 1 and the scaling as in Section 3.2.
Finally, by (3.14) . Besides, by the symmetry of the function and (3.13), for all . Therefore, adding up (3.13) w.r.t. and , we get
[TABLE]
being is Frobenious’ norm and an standard Gaussian matrix. Straightforward computations using polar coordinates show that for all . This concludes the proof.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J-M Azaïs and M. Wschebor. Level sets and extrema of random processes and fields. John Wiley & Sons Inc., Hoboken, NJ, (2009), ISBN: 978-0-470-40933-6.
- 2[2] J-M Azaïs and M. Wschebor. On the roots of a random system of equations. The theorem on Shub and Smale and some extensions. Found. Comput. Math. 5 (2005), no. 2, 125-144.
- 3[3] A.T. Bharucha-Reid and M. Sambandham. Random polynomials. Probability and Mathematical Statistics. Academic Press, Inc., Orlando, FL, (1986), xvi+206 pp. ISBN: 0-12-095710-8.
- 4[4] F. Dalmao. Asymptotic variance and CLT for the number of zeros of Kostlan Shub Smale random Polynomials. C.R. Acad. Sci. Paris Ser. I 353 (2015), 1141-1145.
- 5[5] A. Edelman and E. Kostlan. How many zeros of a random polynomial are real? Bull. Amer. Math. Soc. (N.S.) 32 (1995), no. 1, 1-37.
- 6[6] A. Estrade and J.R. León. A central limit theorem for the Euler characteristic of a Gaussian excursion set. Ann. Probab. 44 (2016), no. 6, 3849-3878.
- 7[7] K. Farahmand. Topics in random polynomials. Pitman Research Notes in Mathematics Series, 393. Longman, Harlow, (1998), x+163 pp. ISBN: 0-582-35622-9.
- 8[8] H. Federer. Two theorems in geometric measure theory. Bull. Amer. Math. Soc., 72, (1966), 719.
