Zeros of polynomials with four-term recurrence
Khang Tran, Andres Zumba

TL;DR
This paper characterizes when the zeros of polynomials satisfying a specific four-term recurrence are all real, providing explicit conditions on parameters and describing the density of zeros on a real interval.
Contribution
It establishes necessary and sufficient conditions for the real zeros of four-term recurrence polynomials and describes the density of their zeros on a specific interval.
Findings
Zeros are real under certain parameter conditions.
Explicit interval where zeros are dense.
Conditions depend on parameters b and c.
Abstract
For any real numbers , we form the sequence of polynomials satisfying the four-term recurrence \[ H_{m}(z)+cH_{m-1}(z)+bH_{m-2}(z)+zH_{m-3}(z)=0,\qquad m\ge3, \] with the initial conditions , , and . We find necessary and sufficient conditions on and under which the zeros of are real for all , and provide an explicit real interval on which is dense where is the set of 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.
Zeros of polynomials with four-term recurrence
Khang Tran and Andres Zumba
Abstract.
For any real numbers , we form the sequence of polynomials satisfying the four-term recurrence
[TABLE]
with the initial conditions , H_{1}(z)=$$-c, and . We find necessary and sufficient conditions on and under which the zeros of are real for all , and provide an explicit real interval on which is dense where is the set of zeros of .
1. Introduction
Consider the sequence of polynomials satisfying a finite recurrence
[TABLE]
where , , are complex polynomials. With certain initial conditions, one may ask for the locations of the zeros of on the complex plane. There are two common approaches: asymptotic location and exact location. The first direction asks for a curve where the zeros of approach as , and the second direction aims at a curve where the zeros of lie exactly on for all (or at least for all large ). Recent works in the first direction include [1, 2, 3, 5, 6]. Results in this first direction are useful to prove the necessary condition for the reality of zeros of that we will see in Section 3.
It is not an easy problem to find an explicit curve (if such exists) where the zeros of all lie for a general recurrence in (1.1). For three-term recurrences with degree two and appropriate initial conditions, the curve containing zeros is given in [10]. The corresponding curve for a three-term recurrence with degree is given in [11]. Among all possible curves containing the zeros of the s, the real line plays an important role. We say that a polynomial is hyperbolic if all of its zeros are real. There are a lot of recent works on hyperbolic polynomials and on linear operators preserving hyperbolicity of polynomials, see for example [4, 7]. In some cases, we could find the curve on the plane containing the zeros of a sequence of polynomials by claiming certain polynomials are hyperbolic, see for example [8].
The main result of this paper is the identification of necessary and sufficient conditions on under which the zeros of the sequence of polynomials satisfying the recurrence
[TABLE]
are real. We use the convention that the zeros of the constant zero polynomial are real. Let denote the set of zeros of .
Theorem 1**.**
Suppose , and let be defined as in (1.2). The zeros of are real for all if and only if one of the two conditions below holds
(i) and
*(ii) and .
Moreover, in the first case with , is dense on . In the second case, is dense on the interval*
[TABLE]
Our paper is organized as follow. In Section 2, we prove the sufficient condition for the reality of the zeros of all in the case . The case follows from similar arguments whose key differences will be mentioned in Section 3. Finally, in Section 4, we prove the necessary condition for the reality of the zeros of .
2. The case and
We write the sequence in (1.2) using its generating function
[TABLE]
From (2.1), if we make the substitutions , , and , it suffices to prove the following form of the theorem.
Theorem 2**.**
Consider the sequence of polynomials generated by
[TABLE]
where If then the zeros of lie on the real interval
[TABLE]
and is dense on .
We will see later that the density of the union of zeros on follows naturally from the proof that and thus we focus on proving this claim. We note that each value of generates a sequence of polynomials . The lemma below asserts that it suffices to prove that for all in a dense subset of .
Lemma 3**.**
Let be a dense subset of , and let be fixed. If
[TABLE]
for all then
[TABLE]
for all .
Proof.
Let be given. By the density of in , we can find a sequence in such that . For any , we will show that . We note that the zeros of lie on the interval whose right endpoint approaches the right endpoint of as . If we let , , be the zeros of then
[TABLE]
where is the lead coefficient of . We will see in the next lemma that is at most . From this finite product and the assumption that , we conclude that there is a fixed (independent of ) so that , for all large . Since is a polynomial in for any fixed , we conclude that
[TABLE]
and the lemma follows. ∎
Lemma 3 allows us to ignore some special values of . In particular, we may assume . In our main approach, we count the number of zeros of on the interval in (2.3) and show that this number of zeros is at least the degree of . To count the number of zeros of on , we write as a strictly increasing function of a variable on the interval . Then we construct a function on with the property that is a zero of on if and only if is a zero of on . From this construction, we count the number of zeros of on which will be the same as the number of zeros of on by the monotonicity of the function . We first obtain an upper bound for the degree of and provide heuristic arguments for the formulas of and .
Lemma 4**.**
The degree of the polynomial defined by (2.2) is at most .
Proof.
We rewrite (2.2) as
[TABLE]
By equating the coefficients in of both sides, we see that the sequence satisfies the recurrence
[TABLE]
and the initial condition , , and . The lemma follows from induction. ∎
2.1. Heuristic arguments
We now provide heuristic arguments to motivate the formulas for two special functions and on . Let , , and be the three zeros of the denominator . We will show rigorously in Section 2.2 that , , are nonzero and distinct with . We let , . We have
[TABLE]
We apply partial fractions to rewrite the generating functions as
[TABLE]
which can be expanded as a series in below
[TABLE]
From this expression, we deduce that is a zero of if and only if
[TABLE]
After multiplying the left side of (2.5) by we obtain the equality
[TABLE]
Setting , we rewrite the left side as
[TABLE]
or equivalently
[TABLE]
We multiply this expression by and set the summation to [math] and rewrite (2.5) as
[TABLE]
The last expression will serve as the definition of .
We next provide a motivation for the specific form of . Since , , and are the zeros of , they satisfy the three identities
[TABLE]
If we divide the first equation by , the second by , and the third by then these identities become
[TABLE]
We next divide the first identity by second, and the second by the third to obtain
[TABLE]
from which we deduce that
[TABLE]
This equation is equivalent to
[TABLE]
or simply
[TABLE]
Lemma 5**.**
For any and , the zeros in of the polynomial
[TABLE]
are real and distinct.
Proof.
We consider the discriminant of the above polynomial in :
[TABLE]
There are three possible cases depending on the value of . If , the inequality comes directly from . If , the claim is trivial since . Finally, if , we have . It follows that the zeros of (2.10) are real and distinct for any and . ∎
To obtain the formula , we multiply both sides of (2.7) and (2.8)
[TABLE]
and divide by (2.9) to arrive at the resulting equation
[TABLE]
2.2. Rigorous proof
Motivated by Section 2.1, we will rigorously prove Theorem (2) in this Section 2.2. We start our proof of Theorem (2) by defining the function according to (2.10):
[TABLE]
which, from Lemma 5, is a real function on with a possible vertical asymptote at
[TABLE]
when . However we note that the function is a real continuous function on .
Lemma 6**.**
Let be defined as in (2.12). Then for every and every with .
Proof.
From (2.10), we note that and
[TABLE]
are the zeros of
[TABLE]
Note that
[TABLE]
If and , this product is negative since
[TABLE]
Thus exactly one of the zeros of the quadratic function lies outside the interval . The claim follows from the fact that . ∎
Although one can prove Lemma 6 for the extreme value or , that will not be necessary by Lemma 3. Next we define the real function by
[TABLE]
on . From Lemma 6, and so does by (2.10). Dividing the numerator and the denominator by and combining with the fact that is continuous on , we conclude that the possible discontinuity of in (2.13) is removable. Finally, motivated by (2.6), we define the function by
[TABLE]
which has the same vertical asymptote as that of in (2.13) when .
From Lemma 6, we see that the sign of the function alternates at values of where . Thus by the Intermediate Value Theorem the function has at least one root on each subinterval whose endpoints are the solution of . However, in the case , one of the subintervals will contain a vertical asymptote given in (2.13). The lemma below counts the number of zeros of on such a subinterval.
Lemma 7**.**
Let be defined as in (2.15). Suppose and . Then there exists such that
[TABLE]
where . Furthermore, as long as
[TABLE]
the function has at least two zeros on the interval
[TABLE]
whenever is at most , and at least one zero when is .
Proof.
Suppose . Since the function is decreasing on the interval , we conclude that
[TABLE]
Then the existence of comes directly from the inequality
[TABLE]
when .
The vertical asympote at of divides the interval in (2.17) into two subintervals. We will show that each subinterval contains at least a zero of if . In the case , only the subinterval on the left contains at least zero of . We analyze these two subintervals in the two cases below.
We consider the first case when and . By Lemma 6 and (2.15) we see that the sign of is . We now show that the sign of is when . From (2.12), we observe that as . Since , the sign of is and consequently the sign of is when by (2.15). By the Intermediate Value Theorem, we obtain at least one zero of in this case.
Next we consider the case when and . In this case the sign of is if by Lemma 6. Since as and the sign of is , the sign of is as . By the Intermediate Value Theorem, we obtain at least one zero of in this case and . ∎
Note that we may assume (2.16) by Lemma3. From the fact that the sign of in (2.15) alternates when , we can find a lower bound for the number of zeros of on by the Intermediate Value Theorem. We will relate the zeros of to the zeros of by (2.6). However to ensure that the partial fractions procedure preceding equation (2.6) is rigorous, we need the lemma below.
Lemma 8**.**
Let such that whenever . The zeros in of are
[TABLE]
where is given in (2.12).
Proof.
We first note that
[TABLE]
where is a root of the quadratic equation . We apply the following identities
[TABLE]
and
[TABLE]
to conclude that . Similarly, we have
[TABLE]
Finally
[TABLE]
∎
As a consequence of Lemma 8, if , then the zeros of will be distinct and since by Lemma 5. Thus we can apply partial fractions given in the beginning of Section 2.1. From this partial fraction decomposition, we conclude that if is a zero of , then will be a zero of . In fact, we claim that each distinct zero of on produces a distinct zero of on . This is the content of the following two lemmas.
Lemma 9**.**
Let be defined as in (2.12). The function defined as in (2.14) is increasing on .
Proof.
Lemma 8 gives
[TABLE]
We differentiate the three terms and obtain
[TABLE]
where
[TABLE]
If we set
[TABLE]
then , and consequently . Thus (2.19) implies that
[TABLE]
After solving this equation for and substituting it into (2.19), we obtain
[TABLE]
With , , we have
[TABLE]
We now substitute and have
[TABLE]
In the formula of in Lemma 8, we substitute and obtain
[TABLE]
We finish this lemma by showing that , which implies and and the lemma will follow from (2.20). We expand and divide both sides of (2.10) by to get
[TABLE]
or equivalently,
[TABLE]
Finally, using the definition of in (2.12) and Lemma 5, we note that
[TABLE]
The proof is complete. ∎
Lemma 10**.**
The function as defined in (2.14) maps the interval onto the interior of .
Proof.
Since is a continuous increasing function on , we only need to evaluate the limits of at the endpoints. Since by Lemma 6, the formula of in (2.12) implies that as . Consequently, (2.18) gives
[TABLE]
Finally, from the fact that
[TABLE]
and (2.14), we have
[TABLE]
where we obtain (2.21) by multiply and divide the fraction by . ∎
Before making final arguments to connect all results in this section, we check the sign of at one of the endpoints.
Lemma 11**.**
If then the sign of is .
Proof.
Since , one can check that
[TABLE]
The result then follows directly from (2.15) and the fact that
[TABLE]
∎
With all the lemmas at our disposal, we produce the final arguments to finish the proof of Theorem 2. We consider the function at the points
[TABLE]
We note that the number of such values of is
[TABLE]
where the equality can be checked by considering congruent to 1, or modulus . From the formula of in (2.15) and Lemma 6, the sign of is . By the Intermediate Value Theorem and Lemma 7, there are at least zeros of on . In fact, we claim that there are at least zeros of on . In the case , we obtain one more zero of from Lemma 11. On the other hand, if , then we obtain another zero of by Lemma 7. From Lemmas 9 and 10, we obtain at least zeros of on . Since the degree of is at most by Lemma 4, all the zeros of lie on . Recall that we can ignore the case by Lemma 3. The density of on comes from the density of on and from being a continuous map.
3. The case and
It is trivial that if and then the zeros of are real under the convention that the constant zero polynomial is hyperbolic. In the case , we make a substitution and reduce the problem to the following theorem.
Theorem 12**.**
The zeros of the sequence of polynomials generated by
[TABLE]
are real, and the set is dense on .
The proof of Theorem 12 follows from a similar procedure seen in Section 2. We will point out some key differences. The following lemma comes directly from the recurrence relation
[TABLE]
and induction.
Lemma 13**.**
The degree of the polynomial generated by (3.1) is at most
[TABLE]
We define the functions
[TABLE]
on the interval .
The proof of the lemma below is similar to that of Lemma 8. We leave the detailed computations to the reader.
Lemma 14**.**
Suppose , , and defined by (3.2). The three zeros of are
[TABLE]
[TABLE]
[TABLE]
Looking at , one can check that is strictly decreasing on the interval . By the partial fraction decomposition of
[TABLE]
similar to the previous section, we conclude that for each zero of on the interval we obtain two zeros of . We can also check by induction that is a simple zero of if is odd, and is not a zero of when is even. The formula of implies that the sign of this function alternates when , that is,
[TABLE]
Since is continuous on , we may apply the Intermediate Value Theorem to compute the number of zeros of on and correspond to the number of zeros of on . We will see that this number is equal to the degree of and Theorem 12 follows. We quickly summarize in the six cases below where denotes the smallest solution on the interval .
- (1)
and is even: there are
[TABLE]
zeros of on , which gives zeros of on . 2. (2)
and is odd: there are
[TABLE]
zeros of on which gives nonzero roots of . We add a simple zero and obtain zeros of on . 3. (3)
and is even: with the observation that and we obtain
[TABLE]
zeros of on , which gives zeros of on . 4. (4)
and is odd: with the observation that and we obtain
[TABLE]
zeros of on , which gives nonzero roots of . We add a simple zero and obtain zeros of on . 5. (5)
and is even: with the observation that , , and we obtain
[TABLE]
zeros of on , which gives zeros of on . 6. (6)
and is odd: with the observation that , , and we obtain
[TABLE]
zeros of on , which gives nonzero roots of . We plus add simple zero and obtain zeros of on .
In all cases above the number of zeros of on corresponds to the degree of and Theorem 12 follows.
4. Necessary condition for the reality of zeros
To prove the necessary condition of Theorem 1, we first show that if and then not all polynomials are hyperbolic. In fact, with the substitution by , we conclude that all the zeros of will be purely imaginary by Theorem 12.
It remains to consider the sequence generated by
[TABLE]
and show that if then there is an such that not all the zeros of are real. In fact, we will show if , is not hyperbolic for all large . To prove this, let us introduce some definitions (discussed in [9]) related to the root distribution of a sequence of functions
[TABLE]
where and are analytic in a domain . We say an index dominant at if for all (). Let
[TABLE]
Let be the set of all such that every neighborhood of has a non-empty intersection with all but finitely many of the sets . Let be the set of all such that every neighborhood of has a non-empty intersection infinitely many of the sets . We will need the following theorem from Sokal ([9, Theorem 1.5]).
Theorem 15**.**
Let be a domain in , and let be analytic function on , none of which is identically zero. Let us further assume a ’no-degenerate-dominance’ condition: there do not exist indices such that for some constant with and such that has nonempty interior. For each integer , define by
[TABLE]
Then , and a point lies in this set if and only if either
(i) there is a unique dominant index at , and , or
(ii) there a two or more dominant indices at .
If such that the zeros in of are distinct then by partial fractions given in (2.4) and Theorem 15, will belong to when the two smallest (in modulus) roots of have the same modulus. We also note that , , and are analytic in a neighborhood of by the Implicit Function Theorem. If we let then the ’no-degenerate-dominance’ condition in Theorem 15 comes directly from equations (2.14) and (2.12) since is a fixed constant (and thus is a fixed point which has empty interior).
Suppose . With the arguments in the previous paragraph, our main goal is to find a so that the zeros of are distinct and the two smallest (in modulus) zeros of this polynomial have the same modulus. If we can find such a point, then . This implies that on a small neighborhood of which does not intersect the real line, there is a non-real zero of for all large by the definition of . Our choice of comes from (2.14) for a special . Unlike in Section 2, will not belong to to ensure that In particular, we consider the two cases and .
Case .
We will pick but sufficiently close to on the left. Since from (2.12)
[TABLE]
we can pick sufficiently close to so that and . By Lemma 8, we have and . The fact that and implies that the polynomial have distinct zeros and not all its zeros are real. We will show that by contradiction. In deed, if then the zeros of the polynomial satisfy and
[TABLE]
This gives a contradiction because the first equation implies that , while the second equation implies that since .
Case .
We will pick so that where . The definition of in (2.12) gives
[TABLE]
where we can easily check that
[TABLE]
Thus if then , , and where the last statement comes from (2.12) and the inequality
[TABLE]
With , , and , we apply the same arguments given in the previous case to complete this section.
Acknowledgments
The authors would like to thank Professor T. Forgács for his careful review of the paper.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] S. Beraha, J. Kahane, N. J. Weiss, Limits of zeroes of recursively defined polynomials, Proc. Nat. Acad. Sci. U.S.A. 72 (1975), no. 11, 4209.
- 2[2] S. Beraha, J. Kahane, N. J. Weiss, Limits of zeros of recursively defined families of polynomials, Studies in foundations and combinatorics, pp. 213–232, Adv. in Math. Suppl. Stud., 1, Academic Press, New York-London, 1978.
- 3[3] Borcea J., Bøgvad R., Shapiro B., On rational approximation of algebraic functions, Adv. Math. 204 (2006), no. 2, 448–480.
- 4[4] ] J. Borcea and P. Brändén, Pólya-Schur master theorems for circular domains and their boundaries, Annals of Math., 170 (2009), 465-492.
- 5[5] R. Boyer, W. M. Y. Goh, On the zero attractor of the Euler polynomials, Adv. in Appl. Math. 38 (2007), no. 1, 97–132.
- 6[6] R. Boyer, W. M. Y. Goh, Polynomials associated with partitions: asymptotics and zeros, Special functions and orthogonal polynomials, 33–45, Contemp. Math., 471, Amer. Math. Soc., Providence, RI, 2008.
- 7[7] T. Forgács and A. Piotrowski, Hermite multiplier sequences and their associated operators, Constr. Approx. 43(3) (2015), pp. 459-479.
- 8[8] T. Forgács , K. Tran , Polynomials with rational generating functions and real zeros, J. Math. Anal. Appl. 443 (2016) pp. 631-651.
