Linear combinations of polynomials with three-term recurrence
Khang Tran, Maverick Zhang

TL;DR
This paper investigates the zero distribution of polynomial sums with three-term recurrence relations and extends the analysis to linear combinations of Chebyshev polynomials, identifying conditions for hyperbolicity.
Contribution
It provides a detailed analysis of zero distributions for polynomials with linear coefficient recurrences and characterizes hyperbolicity conditions for specific Chebyshev polynomial combinations.
Findings
Zero distribution characterized for polynomial sums with three-term recurrence.
Necessary and sufficient conditions for hyperbolicity of Chebyshev linear combinations.
Extension of zero distribution analysis to polynomial combinations with linear coefficients.
Abstract
We study the zero distribution of the sum of the first polynomials satisfying a three-term recurrence whose coefficients are linear polynomials. We also extend this sum to a linear combination, whose coefficients are powers of for , of Chebyshev polynomials. In particular, we find necessary and sufficient conditions on , such that this linear combination is hyperbolic.
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.
linear combinations of polynomials with three-term recurrence
Khang Tran
California State University, Fresno
and
Maverick Zhang
University of California, Berkeley
Abstract.
We study the zero distribution of the sum of the first polynomials satisfying a three-term recurrence whose coefficients are linear polynomials. We also extend this sum to a linear combination, whose coefficients are powers of for , of Chebyshev polynomials. In particular, we find necessary and sufficient conditions on , such that this linear combination is hyperbolic.
2000 Mathematics Subject Classification:
30C15, 26C10
1. Introduction
The sequence of Chebyshev polynomials of the first kind defined by the recurrence
[TABLE]
with and forms a sequence of orthogonal polynomials whose zeros are real (i.e., hyperbolic polynomials). The location of zeros of polynomials satisfying a more general recurrence
[TABLE]
where was given in [3]. In [2], the author studied the set of zeros of a linear combination of Chebyshev polynomials , , and provided a connection between this sequence and the theory of Pisot and Salem numbers in number theory. In the special case when and , the sum of the first Chebyshev polynomials connects to Direchlet kernel in Fourier analysis. In Section 2 of this paper, we to study the zeros of this sum (c.f. Theorem 1) when the sequence of Chebyshev polynomials are replaced by a more general sequence given in (1.1) where and are any linear polynomials with real coefficients.
The sequence of Chebyshev polynomials of the second kind satisfies the same recurrence as that of the first kind with the initial condition and . This initial condition can be written in the form and , . In Section 3 of this paper, we study the zeros of a linear combination of Chebyshev polynomials of the second kind whose coefficients are power of . In particular, we consider
[TABLE]
We find necessary and sufficient conditions on and under which the zeros of resulting polynomials are real (c.f. Theorem 8).
2. Sum of polynomials with three-term recurrence
For , , we let be the sequence of polynomials satisfying the recurrence
[TABLE]
with and , . Equivalently the sequence is generated by
[TABLE]
In this section, we study neccessary and sufficient conditions on , , , and under which all the zeros of the polynomial
[TABLE]
are real. Those polynomials form a sequence whose generating function is
[TABLE]
With the substitutions by , by , and by , and then substitute by , we reduce the generating function to the form
[TABLE]
Note that all the substitutions above preserve the reality of the zeros of the generated sequence of polynomials. We state the main theorem of this section.
Theorem 1**.**
Let . The zeros of all the polynomials generated by
[TABLE]
are real if and only if Under this condition the zeros of lie on
[TABLE]
and are dense there as .
2.1. The sufficient condition
We assume . To prove the zeros of lie on (2.2), we count the number of real zeros of on this interval and show that this number is at least the degree of this polynomial which is given by the lemma below.
Lemma 2**.**
For each , the degree of is at most .
Proof.
We collect the coefficients in of the denominator of the right side of (2.1) and obtain the recurrence
[TABLE]
where and , . The lemma follows from induction. ∎
To count the number of real zeros of , we construct two auxiliary real-valued functions and on . The first function is defined as
[TABLE]
By the quadratic formula, satisfies
[TABLE]
We will show later that there are values of , each of which yields a zero of on (2.2) via . The lemma below ensures a bijective correspondence between and .
Lemma 3**.**
The function is increasing on and it maps this interval onto the interval
[TABLE]
Proof.
To show is increasing, we compute its derivative
[TABLE]
and see that it suffices to show
[TABLE]
The left side is positive and the squares of both sides reduce the inequality to , which shows that is increasing. We complete the lemma by computing the limits
[TABLE]
∎
To define the second function , we need the following lemma.
Lemma 4**.**
For any , we have
[TABLE]
Proof.
From Lemma 3, it suffices to show that
[TABLE]
Since we know the left side is positive by , we obtain the inequality above by squaring both sides. ∎
From Lemma 4, we define the functions
[TABLE]
on .
Lemma 5**.**
For any , the two zeros of
[TABLE]
are and .
Proof.
We verify that satisfy the Vieta’s formulas. Indeed, we have
[TABLE]
and
[TABLE]
From (2.4), we note that
[TABLE]
since . As a consequence, we obtain
[TABLE]
by squaring both sides and applying (2.5). ∎
The lemma below shows that for each , the two zeros of (2.6) lie inside the unit ball.
Lemma 6**.**
For any , we have .
Proof.
From (2.7), (2.9), and (2.4), it suffices to show
[TABLE]
If the right side is negative, the inequality is trivial. If not, we square both sides and the inequality follows from
[TABLE]
∎
For each , the Cauchy differentiation formula gives
[TABLE]
We recall that by Lemma 4. If we integrate the integrand over the circle , , and let , then the integral approaches [math]. Thus the sum of and the residues of the integrand at the three simple poles , and is [math]. We compute these residue and deduce that equals to
[TABLE]
We multiply this expression by , which is nonzero , and conclude is a zero of if and only if it is a zero of
[TABLE]
or equivalently a zero of
[TABLE]
With the trigonometric identity , we write the expression above as
[TABLE]
We note that if
[TABLE]
then the sign of (2.10) is since by Lemma 6. By the intermediate value theorem, (2.10) has at least solution on . We also note that as , the sign of (2.10) is negative since approaches and . Thus (2.10) has another zero on . From Lemma 3, each zero in of (2.10) gives exactly one zero in of on
[TABLE]
Thus all the zeros of lie on the interval above by the fundamental theorem of algebra and Lemma 2. The density of the zeros of as on this interval follows directly from the density of the solutions of (2.10) and the continuity of .
2.2. The necessary condition
In this section, we will show that if either
- (1)
or 2. (2)
then not all polynomials are hyperbolic. By [1, Theorem 1.5], it suffices to find such that the zeros of
[TABLE]
are distinct and the two smallest (in modulus) zeros of this polynomial have the same modulus. Note that every small neighborhood of such will contain a zero of for all large and consequently is not hyperbolic for all large . For more details on this application of the theorem, see [4].
For the first case , we let be any angle with and let be any zero of
[TABLE]
Note that since
[TABLE]
and consequently by the definition of . With the note that is nonreal (and thus nonzero), we choose
[TABLE]
which is nonreal since . From the definitions of , , and above, the two solutions of
[TABLE]
are since they satisfy the Vieta’s formulas
[TABLE]
and
[TABLE]
Since and are solutions of , we have . Thus the two smallest (in modulus) zeros of (2.11) equal in modulus and we complete the case .
We now consider the case . We will find so that the smaller (in modulus) zero of lie on the unit circle. The inequality implies that
[TABLE]
and consequently
[TABLE]
We conclude there is sufficiently close to [math] when or close to when such that
[TABLE]
With this choice of , we have
[TABLE]
We define
[TABLE]
and write
[TABLE]
as to conclude that is a zero of this polynomial. Since the product of the two zeros of this polynomial is , we claim that the other zero of this polynomial is more than in modulus by showing that
[TABLE]
Indeed, from the definition of , this inequality is equivalent to (2.12). We note that since a solution of (2.13) is and the other solution is more than in modulus.
3. Linear combination of chebyshev polynomials
The goal this section is to study necessary and sufficient conditions under which the zeros of (1.2) are real. The sequence in (1.2) is generated by
[TABLE]
With the substitution by and then by , it suffice to study the hyperbolicity of the sequence generated of polynomials by
[TABLE]
As a small digression of the main goal, we will prove following theorem which states that the positivity of the - coefficient in the factor is important to ensure the hyperbolicity of the generated sequence of polynomials.
Theorem 7**.**
Suppose where . If , then not all the polynomials generated by
[TABLE]
are hyperbolic.
We note that if , the sequence of generated polynomials satisfy a three-term recurrence and their zeros have been studied in [3]. Under the condition , with the substitution , we can assume . The following theorem settles the necessary and sufficient conditions for the hyperbolicity of (1.2).
Theorem 8**.**
Suppose . The zeros of all the polynomials generated by
[TABLE]
are real if and only if . Moreover when , the zeros of lies on and are dense there as .
3.1. Proof of Theorem 7
In the case , with the substitution , it suffices to show that for any , not all the polynomials generated by
[TABLE]
are hyperbolic. Recall a consequence of [1, Theorem 1.5] that we will need to find so that the two smallest zeros of
[TABLE]
equal in modulus.
In the case , we choose where
[TABLE]
if and if . The two zeros of ,
[TABLE]
lie on the unit circle and thus their modulus is less than
[TABLE]
For the remainder of Section 3.1, we assume . To make a suitable choice for , we consider the following lemma.
Lemma 9**.**
With the principal cut, there exists , , such that
[TABLE]
Proof.
We note that since
[TABLE]
Thus with the principle cut, the function
[TABLE]
is meromorphic on the open unit ball with the possible pole at if To prove this lemma, we will find and such that .
We note that if , then is analytic on the unit ball and
[TABLE]
Thus by the maximum modulus principle for some . We can choose such by the continuity of .
On the other hand if , then the Cauchy integral formula implies that
[TABLE]
Consequently for some or for all and the lemma follows. ∎
We now define
[TABLE]
where is given in Lemma 9. With this definition, is a solution of
[TABLE]
from which we deduce that
[TABLE]
is a zero in of
[TABLE]
The modulus of (3.2) is the same as the modulus of the zero in of which is at most by the definition of . This modulus is larger than the modulus of the other zero of since the product of two zeros of this polynomial is . We finish the proof of Theorem 7 by noting that since the two zeros of are neither real nor complex conjugate.
3.2. Proof of Theorem 8
3.2.1. The sufficient condition
Let be the sequence of polynomials defined in (3.1) where . The proof of the following lemma is the same as that of Lemma 4 in [4]. For brevity, we omit the proof in this paper.
Lemma 10**.**
For each let be a dense subset of
[TABLE]
and be fixed. If for any , the zeros of lie on , then the same conclusion holds for any in (3.3) .
Suppose . From Lemma 10, it suffices to consider . We define the monotone function on and note that for each the two zeros of are . We consider the function
[TABLE]
which has a vertical asymptote at if . For any such that , the Cauchy differentiation formula gives
[TABLE]
After computing the residue of the integrand at the three nonzero simple poles , and letting the radius of the integral approach infinity, we apply similar computations in (2.10) to conclude that , , is a zero of if and only if it is a zero of
[TABLE]
From Lemma 10, it suffices to consider . We note that the limits of (3.4) as and are
[TABLE]
and
[TABLE]
respectively.
In the case , (3.4) is a continuous function of on and its sign at , for , is since
[TABLE]
By the intermediate value theorem, we obtain at least zeros of (3.4) on . If , then (3.5) is positive since and we obtain at least another zero of (3.4) on . On the other hand, if , then the inequalities
[TABLE]
imply that the sign of (3.6) is and we have at least another zero of (3.4) on . We conclude that when , (3.4) has at least zeros on , each of which yields a zero of on the interval by the map . Thus all the zeros of lie on by the fundamental theorem of algebra.
We now consider the case . As a function of on , (3.4) has a vertical asymptote at since does. By Lemma 10, we can assume
[TABLE]
Thus for some , the open interval
[TABLE]
contains . We note that this interval may or may not contain a zero of (3.4). In the case , we observe that (3.5) is positive and the sign of (3.6) is . Thus there are at least zeros of (3.4) on the intervals , for and and we conclude all the zeros of lie on by the same argument in the previous case. On the other hand, if , then the limits (3.4) as approaches the left and right of are
[TABLE]
and
[TABLE]
respectively. If and , then we conclude that (3.7) contains at least two zeros of (3.4). Thus we obtain at least zeros of this expression on the intervals , for . In the case or , (3.7) contains at least one zero of (3.4) and thus there are at least zeros of (3.4) on the intervals , for and .
3.2.2. The necessary condition
In this section, we assume and show that not all zeros of defined in (3.1) are real when is large. From [1, Theorem 1.5] , it suffices find so that where
[TABLE]
and and are the two zeros of . To motivate the choice of , we provide heuristic arguments by noticing that and letting
[TABLE]
[TABLE]
The equation yields
[TABLE]
or equivalently
[TABLE]
With a choice of branch cut which will be specified later, the equation above has two solutions
[TABLE]
and the corresponding values for are
[TABLE]
For a formal proof of the necessary condition, we consider the following cases.
Case 1: . We have the inequality
[TABLE]
with equality if and only if . This implies
[TABLE]
and
[TABLE]
with equality if and only if and . We define sufficiently close to [math] or such that is close to if . If , we pick any . With this choice of and the principal cut, we let
[TABLE]
With this choice of , (3.11) holds and consequently and defined in (3.9) and (3.10) are the zeros of . If , then
[TABLE]
since . If then the inequalities and (3.13) imply that . As a consequence, (3.16) follows from (3.8), (3.9), (3.10), and (3.15). Finally, if , then from (3.12) and (3.14), we conclude approaches
[TABLE]
as . Thus from (3.9) and (3.10) there is sufficiently close to [math] or such that
[TABLE]
We also note that since if , then the fact that by (3.9) and (3.10) implies which contradicts to .
Case 2: and . By the intermediate value theorem there is such that
[TABLE]
since the the left side is when and its limit is when . With the choice , we have
[TABLE]
and the modulus of the smaller zero of is
[TABLE]
Case 3: and . If , then with the same choice of and and the same argument as in the first case, this case follows from
[TABLE]
We now consider** .** We square both sides of to obtain
[TABLE]
which implies that, with the cut , the function
[TABLE]
is analytic on a small region containing the closed unit ball. From the maximum modulus principle and the fact that
[TABLE]
we conclude there is so that . With this , we let
[TABLE]
and apply (3.8), (3.9), (3.10), and (3.12) to conclude . The fact that follows from the same argument in the previous case.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. Sokal, Chromatic roots are dense in the whole complex plane, Combin. Probab. Comput. 13 (2004), no. 2, 221–261.
- 2[2] D. Stankov, On linear combinations of Chebyshev polynomials. Publ. Inst. Math. (Beograd) (N.S.) 97(111) (2015), 57–67.
- 3[3] K. Tran, Connections between discriminants and the root distribution of polynomials with rational generating function, J. Math. Anal. Appl. 410 (2014), 330–340.
- 4[4] K. Tran, A. Zumba, Zeros of polynomials with four-term recurrence. Involve, a Journal of Mathematics Vol. 11 (2018), No. 3, 501–518.
