Hermite-Poulain theorems for linear finite difference operators
Olga Katkova, Mikhail Tyaglov, Anna Vishnyakova

TL;DR
This paper extends Hermite-Poulain theorems to finite difference operators, analyzing root locations of polynomials and entire functions, and establishing properties like root simplicity and mesh preservation.
Contribution
It introduces new analogues of Hermite-Poulain theorems for finite difference operators and studies root behavior and mesh preservation in polynomials.
Findings
Roots of difference operators are simple under certain conditions.
The operator does not decrease the mesh of polynomials with roots on a line.
Asymptotic root behavior as |h| approaches infinity is characterized.
Abstract
We establish analogues of the Hermite-Poulain theorem for linear finite difference operators with constant coefficients defined on sets of polynomials with roots on a straight line, in a strip, or in a half-plane. We also consider the central finite difference operator of the form where is a polynomial or an entire function of a certain kind, and prove that the roots of are simple under some conditions. Moreover, we prove that the operator does not decrease the mesh on the set of polynomials with roots on a line and find the minimal mesh. The asymptotics of the roots of as is found for any complex polynomial . Some other interesting roots preserving properties of the…
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.
Hermite-Poulain theorems for linear finite difference operators
Olga Katkova
Department of Science and Mathematics, Wheelock College, USA
,
Mikhail Tyaglov
School of Mathematical Sciences, Shanghai Jiao Tong University
and
Anna Vishnyakova
School of Mathematics and Computer Sciences, Kharkov National V.N.Karazin University
(Date: March 9, 2024)
Abstract.
We establish analogues of the Hermite-Poulain theorem for linear finite difference operators with constant coefficients defined on sets of polynomials with roots on a straight line, in a strip, or in a half-plane. We also consider the central finite difference operator of the form
[TABLE]
where is a polynomial or an entire function of a certain kind, and prove that the roots of are simple under some conditions. Moreover, we prove that the operator does not decrease the mesh on the set of polynomials with roots on a line and find the minimal mesh. The asymptotics of the roots of as is found for any complex polynomial . Some other interesting roots preserving properties of the operator are also studied, and a few examples are presented.
Key words and phrases:
Hyperbolic polynomials; Laguerre-Pólya class; finite difference operators; hyperbolicity preserving linear operators; mesh of polynomial
1991 Mathematics Subject Classification:
30C15; 30D15; 30D35; 26C10; 16C10
1. Introduction
One of the most important problems in the zero distribution theory of polynomials and transcendental entire functions is to describe linear transformations that map polynomials with all roots in a given area into the set of polynomial with all roots in another given area. One of the first researchers who started to study such type of problems systematically were Hermite and, later, Laguerre who considered linear operator preserving the set of hyperbolic polynomials, that is, real polynomials with only real roots.
In 1914 [23], Pólya and Schur completely described the operators acting diagonally on the standard monomial basis , , , …of and preserving .
Later the study of linear transformations sending real-rooted polynomials to real-rooted polynomials was continued by many authors including N. Obreschkov, S. Karlin, B. Levin, G. Csordas, T. Craven, K. de Boor, R. Varga, A. Iserles, S. Nørsett, E. Saff etc. Among recent authors it is especially worth to mention P. Brändén and J. Borcea [1] (see also [2, 3]), who completely characterized all linear operators preserving real-rootedness of real polynomials (and some other root location preservers).
The present work was inspired by the paper [5], where the authors made an attempt to transfer the existing theory of real-rootedness preservers to the basis of Pochhammer symbols and to develop a finite difference analogue of the Pólya-Schur theory. Some results on this topic were also obtained in [16]. But both works deal with finite difference operators with real step defined on a subspace of .
A natural extension of polynomials with real roots is the so-called Laguerre-Pólya class.
Definition 1.1**.**
A real entire function is said to be in the Laguerre-Pólya class, denoted as , if
[TABLE]
where , , , is a non-negative integer and . The product in the right-hand side of (1.1) can be finite or empty (in the latter case the product equals 1).
This class is essential in the theory of entire functions due to the fact that these and only these functions can be uniformly approximated on compact subsets of by a sequence of real polynomials with only real zeros. For various properties and characterizations of the Laguerre-Pólya class see, e.g., [21, p. 100], [23], [19, Chapter VII], [13, pp. 42–47], [20, Kapitel II] or [10].
One of the first results on -preservation properties of linear finite difference operators was obtained by G. Pólya. In [22], he established that if then for every . N.G. de Bruijn observed that this fact can be refined as follows, cf., [6, Theorem 3].
Theorem 1.2** (de Bruijn).**
For any and , the function
[TABLE]
belongs to the class whenever . Here means the complex conjugate to .
One of the main goals of the present work is to extend this result of N.G. de Bruijn and to establish an analogue of the so-called Hermite-Poulain theorem, see, e.g., [20, p. 4] or [24, Part 3, Ch. 1, no. 35], claiming that a finite order linear differential operator with constant coefficients is hyperbolicity preserver if and only if its symbol polynomial is hyperbolic.
In this work, we do not restrict ourselves by real or pure imaginary steps of finite differences, and consider somewhat general central finite difference operators with arbitrary nonzero complex steps:
[TABLE]
where . We are interested in root location of the function with respect to the root location of the polynomial (or entire function) . We also consider compositions of operators of the form (1.2)
If all roots of a polynomial lie on the line
[TABLE]
where and are fixed numbers, then the roots of the polynomial lie on the same line if and only if , and . This fact allows us to establish a finite difference analogue of the Hermite-Poulain theorem mentioned above and even a more general fact.
Theorem 1.3**.**
Let and , , , be two lines on the complex plane. The operator
[TABLE]
sends any polynomial with zeros on the line to a polynomial with zeros on the line if and only if the following conditions hold:
* for some ;*
- 2)
;
- 3)
All the zeros of the generating function
[TABLE]
lie on the unit circle ;
Thus, the operator defined in (1.3) can preserve a class of polynomials with zeros on a line if and only if and , . In particular, the following fact is true.
Corollary 1.4**.**
The linear operator of the form (1.3) preserves the set of hyperbolic polynomials if and only if the following conditions hold
* ;*
- 2)
;
- 3)
All roots of the generating function (1.4) belong to the unit circle ;
- 4)
.
Remark 1.5**.**
The conditions 2) and 3) of Corollary 1.4 mean that the generating function (1.4) has the form
[TABLE]
where the numbers and are real. Thus, Corollary 1.4 states that every linear operator of the form (1.3) that preserves the set of hyperbolic polynomials is a composition of linear operators of the form (1.2) with .
The condition in Corollary 1.4 provides the reality of the coefficients of .
Note also that in Theorem 1.3 as well as in Corollary 1.4, the step of the finite difference operator must be orthogonal to the line where the roots of the given polynomial lie. This condition differs from the conditions of an analogue of the Hermite-Poulain theorem established in [5], where the authors considered the operator (1.3) with a real step undertaking an attempt to transfer the existing theory of real-rootedness preservers to the basis of Pochhammer symbols and to develop a finite difference analogue of the Pólya-Schur theory. They proved that the operator preserves a specific subset of the set of hyperbolic polynomials if and only if its generating function (1.4) has only nonnegative roots. They also found out that a linear operator of the form with polynomials coefficients , , and with a real step preserves the set of hyperbolic polynomials if and only if at most one of coefficients is not identically zero, and is hyperbolic for such a , see [5] for more details.
The fact that every linear operator of the form (1.3) that preserves the set of hyperbolic polynomials is a composition of linear operators of the form (1.2) motivates us to study such kind of operators in more detail. Let us put in (1.2). Then without loss of generality one can consider the operator
[TABLE]
where and for some . If the roots of the polynomial lie on the line , then the roots of not only lie on the same line but also are of multiplicity one (in fact, we prove more, see Theorem 2.4). And this property holds in the case when is an entire function from the closure of the set of polynomials with roots on a line (Theorem 3.2).
Note that the fact that the operator with preserves the real-rootedness of polynomials and entire functions was established by Pólya in [22, Hilfssatz II] (see also Theorem 1.2). However, the simplicity of the roots of seems to be a new property of finite differences. In particular, we have the following extenstion of the Pólya-de Bruijn theorem.
Theorem 1.6**.**
Let , . For any , all the zeros of are real and simple.
For example, if we consider the polynomial with only one (multiple) root, then the roots of the polynomial are simple and lie on the real line . In fact, the roots have the form (see Lemma 4.1):
for ,
[TABLE]
and for ,
[TABLE]
The polynomials
[TABLE]
and their roots play a very important role in our study. For instance, they appear in the estimates of the minimal and maximal roots of for .
Let us denote by and the maximal and the minimal roots of a given hyperbolic polynomial , respectively. Then the following theorem holds.
Theorem 1.7**.**
For any , , and for any , the following inequalities hold
[TABLE]
From (1.6)–(1.7) it follows that
for ,
[TABLE]
and for ,
[TABLE]
Definition 1.8**.**
Given a hyperbolic polynomial denote by its mesh, i.e. the minimal distance between its roots
[TABLE]
where , , and .
If has a multiple root, then by definition. Polynomials of degree at most are defined to have mesh equal to .
Since by Theorem 2.4 the roots of the polynomial are simple for any polynomial , its mesh is positive , and one can pose a question of the minimal value of . The answer to this question is provided by the following theorem.
Theorem 1.9**.**
Let a polynomial of degree is hyperbolic, and let . Then the inequality
[TABLE]
holds for any whenever .
If , the inequality (1.11) is true whenever .
In other words, the operator does not decrease the mesh, and the minimal mesh in the image of this operator on the set is . That is, if for a hyperbolic polynomial of degree , its mesh is less than the mesh of the polynomial , then cannot be represented as for a polynomial . Thus, the minimal mesh for the image of the operator with
[TABLE]
can be easily calculated:
[TABLE]
Thus, for example, if the mesh of a hyperbolic polynomial of degree is less than , then it cannot be represented as for some . It would be interesting to investigate the image of the operator defined on in detail. This topic is discussed in Section 7.
We remind that one of the first results about the mesh of polynomials was established by M.Riesz in 1925 whose elementary proof was given by A. Stoyanoff in [29]. M. Riesz proved that the operator of differentiation on does not decrease the mesh (see Theorem 4.7 of the present work). Moreover, in [11, p. 226, Lemma 8.25] S. Fisk established that any linear operator defined on does not decrease the mesh if it commutes with any shift operator with real step (see Theorem 4.8 for more details). This fact implies Theorem 1.9 partially, since the operator (1.5) obviously commutes with any shift operator, see Section 4. At the same time, Theorem 1.9 not only shows that does not decrease the mesh but also provides a sharp lower bound of the mesh of the image of the operator .
As a by-product of Theorem 1.3, we establish analogues of the Hermite-Poulain theorem for polynomials with roots in strips and half-planes.
Theorem 1.10**.**
Let be a closed strip in the complex plane bounded by lines and , . The operator (1.3) preserves the set of polynomials with roots in if and only if the following conditions hold
;
- 2)
;
- 3)
All the zeros of the generating function (1.4) lie on the unit circle .
If additionally the width of the strip does not exceed , the roots of the polynomial are simple for any polynomial with roots in .
Note that the sufficiency of conditions – in Theorem 1.10 for real polynomials with roots in a strip was proved by N.G. de Bruijn in [6]. In fact, he proved (not only for polynomials but for entire functions as well) that given a real polynomial (or certain real entire function) with roots in , the roots of lie in a more narrow strip if , or are real if provided the conditions – of Theorem 1.10 hold, see [6, Theorems 4 and 8]. A similar result for the operator defined in (1.5) was obtained in [7] for entire functions by a technique different from the one used in [6]. Moreover, in [4] there was a complete characterization of all linear operators which preserve certain spaces of entire functions whose zeros lie in a closed strip. However, in the present work, instead of applying the result of [4] we use another technique which is more close to the one used in the classical papers [6, 22], and, from our point view, is more convenient to finite difference operators we consider. In addition, by our technique we are able to study the multiplicities of the roots of the functions and . We also pay attention of the reader to the work [9], where the authors considered a subclass of real entire functions with zeros in a strip such that the function , , has infinitely many pure imaginary zeros.
It is clear that zero strip preservers are also zero half-plane preservers.
Corollary 1.11**.**
Let be a closed half-plane in the complex plane bounded by a line . The operator (1.3) preserves the set of polynomials with roots in if and only if the conditions – of Theorem 1.10 hold.
For the case when , the sufficiency statement of Corollary 1.11 is a particular case of a result by L. Kuipers [18] (see also [27, Theorem 2.2.1]).
Finally, we notice once again that from the aforementioned results by N.G. de Bruijn it follows that for any real polynomial with roots in a strip , the polynomial has only real roots if the step of the finite difference operator is sufficiently large. However, as is easy to check, this is not true for complex polynomials with non-real roots non-symmetric w.r.t. the real line. In this case, the polynomial may have non-real roots for any finite . This suggested us to find the asymptotics of the roots of as for arbitrary complex polynomial .
Theorem 1.12**.**
Let
[TABLE]
be an arbitrary complex polynomial. The -th root of the polynomial satisfies the following asymptotic formula
[TABLE]
as , where the polynomial , and are its roots defined in (1.6) and (1.7).
For example, for the polynomial of degree , the roots of the polynomial (classical central finite difference) with and are depicted on Figures 2 and 2, respectively.
From the formula (1.12), it follows that for sufficiently large step the roots of tend to a line parallel to . This means that for large , is a zero strip decreasing operator. Calculations show that this operator decreases the strip of roots location for any . However, we do not have a strict proof of this fact, see Section 7 for details.
What is known in this sense is that for pure imaginary step (), the operator is a CZD (complex zero decreasing) operator (see [8]), that is, the number of non-real roots of does not exceed the number of non-real roots of . As was noted in [6, p. 200], this simple fact is a special case of the Hermite-Poulain theorem mentioned above.
The operator also preserves the class of the so-called self-interlacing polynomials (see Theorem 7.2). We remind that a polynomial is called self-interlacing if all its roots are real, simple, and interlacing with the roots of .
The rest of the paper is organized as follows. In Section 2 we study properties of linear finite difference operators defined on the set of polynomials with roots on a straight line and prove Theorem 1.3. In Section 3 we consider a specific set of entire functions with roots on a line and establish Theorem 1.6 and its generalization Theorem 3.2. Sections 2 and 3 are illustrated by some examples from combinatorics and the functions theory, see Proposition 2.5 and Theorem 3.3. Section 4 is devoted to mesh of polynomials with roots on a line. Here we prove formulæ (1.6)–(1.7) and (1.12) as well as Theorems 1.7 and 1.9. In Section 5 we deal with polynomials with roots in a strip or in a half-plain and prove Theorem 1.10. The asymptotics of the roots of as is studied in Section 6 where we prove Theorem 1.12. Finally, in Section 7 we discuss open question related to the considered theory of linear finite differences operators.
2. Hermit-Poulain theorem for polynomials with roots on a straight line
In this section, we prove Theorem 1.3 and Corollary 1.4. We also prove that if the operator (1.3) satisfies the conditions of Theorem 1.3, then all polynomials in its image have only simple roots.
Consider two straight lines in the complex plane
[TABLE]
, , and consider the operator (1.3) having the form
[TABLE]
First we prove the following fact.
Proposition 2.1**.**
Suppose that for every polynomial with roots on the line , all the roots of lie on the line , then .
Proof.
Without loss of generality one can assume that is the real line, and , since the general case can be obtain from the case by changing of variables. Obviously, the operator does not map all hyperbolic polynomials into polynomials of degree 0.
Suppose that is a hyperbolic polynomial such that , so by assumption of the proposition. For , define the polynomial
[TABLE]
which is hyperbolic as well, so we have , and by assumption. Consequently, for every , we obtain , that is possible only if the line is parallel to the real line, that is, if , as required. ∎
Now we are in a position to describe the root location of the generating function defined in (1.4).
Proposition 2.2**.**
Let the operator defined in (2.1) sends every polynomial with roots on the line to a polynomial with roots on the line . Then all zeros of its generating function lie on the unit circle, and the step is orthogonal to the lines and , that is, .
Proof.
First, suppose that , that is, and .
Thus, if is a hyperbolic polynomial, then by assumption the roots of lie on the line
[TABLE]
parallel to the real axis.
Consider the polynomial , . For we have
[TABLE]
By assumption, all the zeros of the rational function lie on the line (2.2). Then the zeros of the polynomial
[TABLE]
lie on the circle
[TABLE]
As , the sequence of polynomials converges uniformly on compact sets to the following entire function
[TABLE]
Each zero of the function is the accumulation point of a sequence of zeros of . It is clear that if a sequence has a limit and if , , then is real. Consequently, all the zeros of the function are real.
Suppose now that is a zero of the generating function defined in (1.4), and let
[TABLE]
Solving the equation
[TABLE]
for real , we obtain
[TABLE]
that implies
[TABLE]
for any , that is possible only if and .
Thus, we proved that if the operator sends a hyperbolic polynomial to a polynomial with roots on a line parallel to the real axis, then the roots of its generating function lie on the unit circle, and the step is pure imaginary, that is, orthogonal to the line and to the real axis.
For the general case, when and is an arbitrary complex number, the assertion of the proposition follows from the previous result by changing variables. ∎
To prove the formula for the step in Condition of Theorem 1.3, let us consider the shift operator
[TABLE]
acting on .
If the operator defined in (2.1) sends every polynomial with roots on a line to a polynomial with roots on a line , then by Propositions 2.1–2.2, , , and all the roots of the generating function lie on the unit circle, that is,
[TABLE]
This implies that the operator can be represented in terms of shift operators as follows
[TABLE]
with .
Our proof of Condition of Theorem 1.3 is based on the following simple fact.
Lemma 2.3**.**
Let with for some , and . If all the roots of a polynomial lie on a straight line for some , then all the roots of the polynomial lie on the line with
[TABLE]
Proof.
Let be a polynomial with all roots on a line . Then it can be represented as follows
[TABLE]
where , and , . If is a zero of the polynomial , then one has
[TABLE]
It is easy to see that for any , the following inequalities hold
[TABLE]
and
[TABLE]
Consequently, all the roots of the polynomial lie on the line
[TABLE]
provided all the zeros of lie on the line . The line (2.8) is exactly the line with given by the formula (2.6), as required. ∎
From (2.6) and (2.8), it follows that if we fix the numbers such that the operator , , sends any polynomial with roots on the line to a polynomial with roots on the line for some , then
[TABLE]
In particular, preserves the set of polynomials with roots on the line if and only if .
Thus, we obtain that the linear finite difference operator defined in (2.1) (see also (2.5)) with the step sends polynomials with roots on the line to polynomials with roots on the line where
[TABLE]
This means that if in the statement of Theorem 1.3, then the formula in Condition of Theorem 1.3 holds. At the same time, if , that is, if the operator preserves the set of polynomials with roots on the line , then and is an arbitrary complex number satisfying the condition .
So the necessity of Conditions – of Theorem 1.3 and Corollary 1.4 are proved, and we remind to the reader that Condition of Corollary 1.4 is necessary to provide the reality of the coefficients of .
The sufficiency of the Conditions – of Theorem 1.3 and Conditions – of Corollary 1.4 can be easily verified using Theorem 1.2 and the formula (2.5) with the corresponding change variables.
Let us finish this section with studying the multiplicities of the roots of polynomials .
Theorem 2.4**.**
Under the conditions of Theorem 1.3, the roots of are all of multiplicity one.
Proof.
Due to the formula (2.5), it is enough to prove that if has all its roots on a line , , , and , , then the roots of the polynomial
[TABLE]
are simple for any . We prove this by contradiction.
The polynomial has the form (2.7). Let be a root of such that
[TABLE]
By Lemma 2.3, has the form
[TABLE]
for some .
From (2.10)–(2.11) it follows that
[TABLE]
that after simple calculations gives us
[TABLE]
But this identity is impossible for any , since the imaginary part of the left-hand side of (2.12) has the form
[TABLE]
while the imaginary part of the right-hand side of (2.12) is
[TABLE]
a contradiction. ∎
We finish this section with a curious example. Let us denote by the forward difference operator with the step :
[TABLE]
where . It is easy to see that
[TABLE]
Consider the monomial
[TABLE]
and describe the root location of the polynomial of degree . By (2.13), one has
[TABLE]
Now from Lemma 2.3 ut is easy to get the following fact.
Proposition 2.5**.**
All the roots of the polynomial of degree , , are simple and located on the line .
Note additionally that
[TABLE]
where are the Stirling numbers of the second kind, see, e.g., [28]. By change of variables, one can get a sequence of polynomials with roots on the critical line.
Corollary 2.6**.**
The roots of the polynomials
[TABLE]
of degree are simple, symmetric w.r.t. real axis, and located on the line .
[TABLE]
Note that the polynomials have the form
[TABLE]
and satisfy the following recurrence relations
[TABLE]
Moreover, the zeros , of the polynomial
[TABLE]
can be found explicitly (see (1.7) and Lemma 4.1):
[TABLE]
so these formulæ agree with Proposition 2.5.
3. Entire functions with roots on a line
In the rest of the paper, we consider the operator defined in (1.5):
[TABLE]
with and .
This section is devoted to the image of the operator on a special set of entire functions to be described below. At first, let us consider the Laguerre-Pólya class of real entire functions, see Definition 1.1, and prove Theorem 1.6. Note that if , then by Theorem 1.2, all the zeros of are real. This also can be proved directly by the limiting considerations, since is the uniform limit, on compact subsets of , of polynomials with only real zeros [25], and since by Corollary 1.4. However, the technique use in the proof of Theorem 1.3 does not allow us to extend it to entire functions, so we cannot assert that the necessity of the conditions of Corollary 1.4 for entire functions. Also we cannot use the limits to extend the result of Theorem 2.4 to entire functions, but we can prove this fact directly as in Theorem 2.4.
Proof of Theorem 1.6.
Without loss of generality, one can suppose that . Let , . As we mentioned above, the reality of zeros of follows from Theorem 1.2, so it suffices to establish the simplicity of these zeros.
Suppose that is a multiple root of . Then and , or, equivalently,
[TABLE]
so
[TABLE]
Since the function can be represented as in (1.1), we have
[TABLE]
hence we obtain
[TABLE]
or
[TABLE]
Comparing the imaginary parts of the left-hand side and the right-hand side of (3.2), one gets
[TABLE]
that implies
[TABLE]
since .
By (1.1), , , and , . Therefore, must be a constant function, so is a constant function, as well, so it cannot have multiple roots, a contradiction. ∎
Consider now a straight line for some , , and introduce the following class of entire functions.
Definition 3.1**.**
A real entire function is said to be in the extended Laguerre-Pólya class, denoted as , if it is the limit, on compact subsets of the complex plane, of a sequence of polynomials with roots on the line .
It is easy to see that if , then
[TABLE]
so from Theorem 1.6 and from the formula (2.5) it is easy to obtain the following fact.
Theorem 3.2**.**
Let the function be in the class . If the linear finite difference operator defined in (1.3) satisfies Conditions – of Corollary 1.4, then all the zeros of lie on the same line and are of multiplicity one.
To illustrate Theorem 1.6, let us consider the reciprocal gamma function
[TABLE]
then by Theorem 1.6, all the roots of the entire the function
[TABLE]
are real and of multiplicity one. This fact implies, for example, the following simple theorem.
Theorem 3.3**.**
The following integral
[TABLE]
represents (after analytic continuation) a meromorphic function on the complex plane that has only real and simple roots and (simple) poles at the points , .
Proof.
Indeed, from (3.3) one has
[TABLE]
This function is meromorphic. It has only simple real zeros and simple poles at the points , .
Now from the Euler integral representation of the gamma function we obtain
[TABLE]
as required. ∎
4. Minimal mesh of finite differences, extremal roots, and Walsh convolution
In this section, we prove that the operator
[TABLE]
defined in (1.5), increases the mesh of hyperbolic polynomials. We remind that by the mesh of a hyperbolic polynomial we understand the minimal distance between the roots of this polynomial, see Definition 1.8. Here we also prove Theorems 1.7 and 1.9. But first, we study the roots of the polynomials defined in (1.8) that play a very important role in this Section.
4.1. Zeros of the polynomials
The polynomials are defined in (1.8). It is easy to see that
[TABLE]
The roots of the equation were announced Introduction by the formulæ (1.6)–(1.7). For completeness, we give here a detailed solution to this equation for arbitrary step and with some additional facts on their behaviour with respect to the parameter .
Lemma 4.1**.**
The zeroes of the polynomial are real and simple and have the form
for ,
[TABLE]
and for ,
[TABLE]
Moreover, whenever , , the roots of and interlace for any . Specifically, the functions are increasing on .
Proof.
The equation
[TABLE]
can be represented in the form
[TABLE]
For , this equation has exactly solutions , , satisfying the identity
[TABLE]
so that have the form (4.2). For the case , the proof is similar.
Furthermore, for , we have
[TABLE]
therefore, for any , the roots of the polynomials and do not coincide. Moreover, it is easy to see that
[TABLE]
since the cotangent function is decreasing between its poles. Consequently, the roots of the polynomials and interlace for any . ∎
Furthermore, it is clear that
[TABLE]
where if , and if provided . Since the cotangent function is strictly decreasing on the interval we obtain that the largest zero of equals , while the minimal zero equals that agrees with formulæ (1.9)–(1.10).
Finally, let us find the mesh of the polynomials . A more general fact is true.
Proposition 4.2**.**
Given the operator defined by the formula (4.1), the mesh of the polynomials , , satisfies the formula (1.12).
Proof.
Suppose first that . It is clear that if
[TABLE]
then
[TABLE]
From the formula of the difference of cotangents we obtain
[TABLE]
Now if we introduce the numbers
[TABLE]
and the function
[TABLE]
then we get
[TABLE]
The function is convex function on the interval satisfying the the following reflection condition
[TABLE]
so that its minimum is achieved at the point .
Since by assumption, it follows that
[TABLE]
Let , . From (4.4) and (4.6) we have
[TABLE]
and
[TABLE]
Moreover,
[TABLE]
Therefore,
[TABLE]
and
[TABLE]
Now if
[TABLE]
that is, if , so that , , then
[TABLE]
So from (4.6) from the convexity of the function we obtain
[TABLE]
consequently,
[TABLE]
that agrees with (1.12). If , then in the same one can show that the is the minimal distance between the roots of , and the formula for the mesh of is the same.
Let now , . From (4.4) and (4.6) we have
[TABLE]
[TABLE]
and
[TABLE]
From the convexity of the function and from its symmetry property (4.5) we obtain that the minimum of can be achieved for if or for if . The inequality
[TABLE]
holds whenever while the inequality
[TABLE]
holds if . Thus, if for some , then
[TABLE]
If for some we obtain analogously
[TABLE]
which agrees with formula (1.12).
The case (or that is the same) can be established analogously. ∎
The correspondent properties of the roots of the polynomials can be obtained by putting in Lemma 4.1 and Proposition 4.2.
4.2. Walsh convolution. Proof of Theorem 1.7
To prove Theorem 1.7 we need a few prelimiary facts and definitions.
Definition 4.3**.**
Two complex polynomials and of degree are called apolar if
[TABLE]
The following remarkable theorem due to J.H. Grace (see, e.g., [25, Chapter 5, §3, Problem 145] and [26]) states that the complex zeros of two apolar polynomials cannot be separated by a straight line or by a circle.
Theorem 4.4** (Grace, 1902).**
Suppose and are two apolar polynomials of degree . If all zeros of lie in a circular region then has at least one zero in .
We remind that a circular region is a closed or open half-plane, disk or exterior of a disk. The following object was studied by T. Takagi [30] in 1921 and by J.L. Walsh [32] in 1922, see also [27, Section 5.3]. It was named after Walsh but seems to be considered by some other researchers before.
Definition 4.5** ([30, 32]).**
For any two complex polynomials and of degree the Walsh convolution is a polynomial of the following form
[TABLE]
From (4.7) and (4.8) it is easy to see that
[TABLE]
Moreover, for the Walsh convolution of two polynomials the following fact is true.
Theorem 4.6** (Oishi 1921).**
Let and be hyperbolic polynomials of degree . Then their Walsh convolution is also hyperbolic.
If in addition all the roots of the polynomial lie in the interval , and all the roots of the polynomial lie in the interval , then all zeros of the polynomial lie in the interval .
This theorem follows from a theorem proved by T. Takagi [30] (see also [27, Theorem 5.3.3]) as it mentioned in [30]. In its turn the Tagaki theorem follows from a theorem proved by J.L. Walsh in [32] (see also [27, Theorem 3.4.1c]). However, in [30] T. Takagi attributed Theorem 4.6 to K. Oishi.
For convenience of the reader we provide a proof of this theorem.
Proof of Theorem 4.6.
First we prove that is hyperbolic whenever and are hyperbolic. Indeed, suppose that this is not true, and there exists a number , such that while and are hyperbolic. Then by (4.9) the polynomials and are apolar. Moreover, by assumption, all the roots of lie on the line , while all the roots of lie on the line . This implies that the roots of the polynomials and can be separated by a straight line that contradicts the Grace theorem 4.4. So is hyperbolic.
Suppose now that all the roots of lie in the interval , and all the roots of the polynomial lie in the interval . Let be a root of . Then the roots of lie in the interval , while the roots of lie in the interval , so by the Grace theorem there exists a point such that
[TABLE]
Consequently,
[TABLE]
as required. ∎
Now we are in a position to prove Theorem 1.7.
Proof of Theorem 1.7.
Let
[TABLE]
be a hyperbolic polynomial. Then
[TABLE]
Now the statement of Theorem 1.7 follows from Theorem 4.6 and from the formula
[TABLE]
∎
Note that the formulæ(1.9)–(1.10) for and follow from (4.2)–(4.3) for
4.3. Proof of Theorem 1.9
In this section, we study the mesh of polynomials in the image of the operator defined in (4.1) acting on the set of all hyperbolic polynomials. Remind that the mesh of a hyperbolic polynomial is the minimal distance between its roots, see Definition 1.8.
One of the first results on operators increasing the mesh of hyperbolic polynomials was obtained by M. Riesz who proved that the operator of differentiation increases the mesh.
Theorem 4.7** (M. Riesz, 1925).**
Let , . Then . If all zeros of are simple, then .
An elementary proof of this theorem was given by A. Stoyanoff [29].
The following a remarkable result saying that if a hyperbolicity preserver commutes with the shift operator, it does not decrease mesh, was established (implicitly) by by S. Fisk [11, p. 226, Lemma 8.25]. This result implies Riesz’s theorem, in particular.
Theorem 4.8** (Fisk [11]).**
If is a linear operator commuting with the shift operator for any , that is, , then for every the following inequality holds
[TABLE]
Here is the shift operator defined in (2.4).
Note that S.Fisk formulated this theorem in another form, so it is not easy to recognize that Fisk’s theorem is the statement above. To make our work more self-contained, we provide a proof of Theorem 4.8 here. To do it we remind to the reader one more definition.
Definition 4.9**.**
Let and be two hyperbolic polynomials of degree with roots and , , respectively. The polynomials and are said to have non-strictly interlacing roots if
[TABLE]
or
[TABLE]
The following theorem is sometimes called Obreschkov’s theorem (see, for example [20, p. 12]). In fact, this theorem rediscovered many times by different authors in the past, see the surveys [14] and [17] for more details.
Theorem 4.10**.**
Two real polynomials and of the same degree have (non-strictly) interlacing roots if and only if the polynomial is hyperbolic for any .
Proof of Theorem 4.8.
Let . If , then the statement of the theorem is obvious (even without the condition for any ).
Suppose now that , that is, the roots of are simple. Note that the zeros of and , , are (non-strictly) interlacing if and only if . So according to Theorem 4.10, the polynomial
[TABLE]
for any if and only if .
By assumption, for any . Therefore, if , then for any , and the polynomial
[TABLE]
is hyperbolic, since is a hyperbolicity preserver by assumption.
Suppose, on the contrary, that for the given polynomial , the operator decreases the mesh, that is, . Then there exists a real number such that
[TABLE]
Consequently, the roots of the polynomials and do not interlace, so by Theorem 4.10 there exist real numbers and such that
[TABLE]
This contradicts to the assumptions that is a hyperbolicity preserver commuting with for any . Therefore, , as required. ∎
Note that in [16] an analogous proof was used for the minimal quotent of roots instead of the minimal distance. Furthermore, by Lemma 2.3, the linear operator is a hyperbolicity preserver for any and . Since commutes with any shift operator, it follows from Theorem 4.8 that does not decrease mesh.
Let us show now that in the class of all hyperbolic polynomials of degree the polynomial is extremal in the sense that the mesh of is minimal among all the meshes in the image of the operator acting on hyperbolic polynomials of degree . To do this we need the following theorem.
Theorem 4.11**.**
Let and be hyperbolic polynomials of degree . Then
[TABLE]
Proof.
For a given complex polynomial, introduce the operator defined by the following formula
[TABLE]
If , then is a hyperbolicity preserver by Theorem 4.6, so it does not decrease mesh, according to Theorem 4.8
[TABLE]
On the other hand, the Takagi-Walsh convolution possesses the following commutative property, see, e.g., formula (5.3.3) in [27],
[TABLE]
Therefore, one has
[TABLE]
as required. ∎
Now we are in a position to prove Theorem 1.9.
Proof of Theorem 1.9.
Let us apply the operator to a hyperbolic polynomial . By (4.10) and (4.11) one obtains
[TABLE]
as required. ∎
Due to the commutativity of the operator with any shift operator for , we have that for any . However, our proof of Theorem 1.9 does not answer the question whether there exists or not a polynomial of some degree , for any , such that , see Section 7 for details.
On some possibilities of extending the results of this section to the Laguerre-Pólya class, see [12].
5. Polynomials with roots in a strip and in a half-plane
In this section, we prove Theorem 1.10, an analogue of the Hermite-Poulain theorem for polynomials with roots in a strip, and also show that if a polynomial has roots in a half-plane, then the roots can be multiple.
Proof of Theorem 1.10.
First, suppose that the roots of a given polynomial lie in the strip
[TABLE]
for some , but not on the same line. Thus, the condition means that the step is pure imaginary.
In this case, the proof of the necessity of the conditions and is similar to the proof of Theorem 1.3. Indeed, suppose that the operator (1.3) preserves the set of complex polynomials with zeros in the strip . Then from (2.3) we get that all the zeros of the rational function
[TABLE]
belong to . Then all the zeros of the function the polynomial
[TABLE]
lie in the the set
[TABLE]
As , the sequence of polynomials converges uniformly on compact sets to the following entire function
[TABLE]
Each zero of the function is the accumulation point of a sequence of zeros of . Clearly, if a sequence has a limit and if , , then is real. In the same way as in the proof of Theorem 1.3, we get that , and any non-zero root of lie on the unit circle. Thus, the operator defined in (1.3) has the form
[TABLE]
where , , , , and the shift operator is defined in (2.4).
Let us now prove the necessity of the condition . Suppose that all roots of a polynomial lie on the line . Then by Lemma 2.3, from (5.1) we have that the roots of the polynomial lie on the line where
[TABLE]
Analogously, if the polynomial has all roots on the line , then all roots of lie on the line with
[TABLE]
Since the operator preserves the strip by assumption, we must have
[TABLE]
that implies
[TABLE]
or, equivalently, as required.
Let us prove now the sufficiency of the conditions – for the operator to preserve the strip . Suppose again that all roots of the polynomial
[TABLE]
lie in the strip , that is, , . Consider the polynomial
[TABLE]
where and .
It is clear that
[TABLE]
Since
[TABLE]
and
[TABLE]
one obtains that all the roots of lie in the strip
[TABLE]
Now since the operator satisfying the conditions – can be represented in the form (5.1) with , we obtain that all the roots of the polynomial lie in the strip
[TABLE]
as required.
Prove now that the roots of the polynomial are simple provided the width of the strip is less than and the operator satisfies the conditions –. Due to the formula (5.1), it is enough to prove that if the roots of a polynomial lie in the strip with , , then the roots of the polynomial
[TABLE]
are simple. We prove this by contradiction.
Let
[TABLE]
with
[TABLE]
Let be a root of such that
[TABLE]
Since
[TABLE]
we have that
[TABLE]
From (5.3)–(5.5) it follows that
[TABLE]
that after simple calculations gives us
[TABLE]
But this identity is impossible, since the imaginary part of the left-hand side of (5.7) has the form
[TABLE]
while the imaginary part of the right-hand side of (5.7) is
[TABLE]
These inequalities follow from the assumptions that not all roots of lie on the same line, and from the inequalities
[TABLE]
implied by (5.4) and (5.6), a contradiction.
Thus, Theorem 1.10 is true for the strip , . The general case of an arbitrary strip bounded by lines and , , can be obtained from this particular case by changing of variables . ∎
Unfortunately, we cannot say whether the restriction on the width of the strip is sharp in Theorem 1.10. Calculations show that the roots of are simple if the width of the strip where the roots of the polynomial lie is less than , and we suppose that this is true, see Section 7 for details.
As we mentioned in Introduction, zero strip preservers are also zero half-plane preservers, see Corollary 1.11. However, in the case of half-planes, for any step there exists a polynomial such that the roots of the polynomial are multiple. For example, for the polynomial , we have
6. Asymptotics of the roots of
In this section, we prove Theorem 1.12 stating that if
[TABLE]
is an arbitrary complex polynomial, then the -th root of the polynomial satisfies the following asymptotic formula
[TABLE]
as , where
[TABLE]
and are its roots defined in (1.6) and (1.7). We remind the reader that the operator is defined in (1.5). The number equals if , and if . For the sake of brevity, we will denote the roots of the polynomial as .
Let us denote
[TABLE]
where is defined in (6.1). Dividing by , one obtains
[TABLE]
Changing variables as follows
[TABLE]
we can reformulate the problem as the finding the asymptotics of the roots of the equation
[TABLE]
as for any . Note that
[TABLE]
so equation (6.4) can be rewritten in the following form
[TABLE]
Let us fix an index , , and introduce the polynomial
[TABLE]
It is easy to see that
[TABLE]
and, in general,
[TABLE]
By Hurwitz’s theorem, there exists a number such that for large values of the number the circle contains only one root of the equation (6.6). This root is , that is,
[TABLE]
Therefore, , and we can divide (6.6) by . So the root satisfies the equation
[TABLE]
Now from (6.9) and (6.10) it follows that
[TABLE]
Furthermore, from (6.8) it follows that the Taylor expansions of the functions , , at have the forms
[TABLE]
[TABLE]
[TABLE]
as .
If now we represent the difference as follow
[TABLE]
and substitute this to (6.10), then with the expansions (6.12)–(6.14), after simplification we get
[TABLE]
where
[TABLE]
Here is a constant.
Note that
[TABLE]
and
[TABLE]
From these formulæ and from (6.15) and (6.16) we obtain (6.2), since
[TABLE]
as required.
7. Conclusion and open problems
In this work, we studied properties of linear finite differences operators to preserve the certain classes of polynomials and entire functions. For the operator (1.3) we establish an analogue of the Hermite-Poulain theorem, and establish a number of remarkable properties of the operator
[TABLE]
defined in (1.5). We showed that this operator preserves the class . More exactly, the operator (1.5) maps into the subclass of of functions with only simple zeros. Moreover, the image of the class of hyperbolic polynomials is the subclass of of polynomials with simple roots with minimal mesh given by (1.11). Thus, in connection with Theorems 1.7 and 1.9 the following natural question arises.
Open problem. To describe the image of the set of hyperbolic polynomials (of the set of hyperbolic polynomials of degrees not greater than a given ) under the linear operator of the form (1.5).
For example, it is easy to see that (1.5) preserves the class of the so-called self-interlacing polynomials for .
Definition 7.1** ([31]).**
A real polynomial is called self-interlacing if it has real and simple roots, and the roots of strictly interlace the roots of . The class of self-interlacing polynomials is denoted SI.
The operator preserves the class SI.
Theorem 7.2**.**
If is a self-interlacing polynomial, then the polynomial
[TABLE]
also is self-interlacing for any .
Proof.
By Theorem 4.10, for any , the polynomial
[TABLE]
as only real (and simple) roots. Let us prove that if
[TABLE]
then the polynomial has only re]al roots for any .
Indeed, it is easy to see that
[TABLE]
Since has only real roots, the polynomial has only real and simple roots by Theorem 1.6. Now from Theorem 4.10, the polynomials and have real simple and interlacing roots. Therefore, , as required. ∎
However, the action of the operator (1.5) on the class of all complex polynomials and its subclasses is also interesting. For example, the self-interlacing polynomials have a strong connection the class of real Hurwitz stable polynomials, the polynomials with roots in the open left half-plane, see [31]. The operator is a complex zero decreasing operator as it was mentioned by N.G. de Bruijn [6]. At the same time, calculations show that the following conjecture can be true.
Conjecture 1**.**
For any stable polynomial the polynomials
[TABLE]
have no nonreal zeroes in the closed right half-plane.
Moreover, calculations allow us to pose the following conjecture.
Conjecture 2**.**
Let be the following polynomial
[TABLE]
then the polynomial is self-interlacing, or self-interlacing multiplied by .
Furthermore, Theorem 1.6 says that if , then all roots of the polynomial are simple. Calculations show that most of the polynomials in the image of the operator have simple roots.
Conjecture 3**.**
For almost all polynomial , the polynomials have only simple roots. The exclusion: Polynomials with multiple roots of the form , .
Such polynomials have the form , where and is an arbitrary complex polynomial.
Finally, note that in [6] and [7], it was proved that the operator (1.5) is zero strip decreasing if defined on . Calculations show that this property is preserved for arbitrary complex polynomials.
Conjecture 4**.**
The operator (1.5) defined on zero strip decreasing.
Acknowledgement
The authors are grateful to J. Xia for his help with preparing the first version of the manuscript.
The work of M. Tyaglov was partially supported by The Program for Professor of Special Appointment (Oriental Scholar) at Shanghai Institutions of Higher Learning, by the Joint NSFC-ISF Research Program, jointly funded by the National Natural Science Foundation of China and the Israel Science Foundation (No.11561141001), and by Grant AF0710021 from Shanghai Jiao Tong University University.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. Borcea and P. Brändén , Pólya-Schur master theorems for circular domains and their boundaries, Ann. of Math. (2), 170 , no. 1, 2009, pp. 465–492.
- 2[2] J. Borcea and P. Brändén , The Lee-Yang and Pólya-Schur programs. I. Linear operators preserving stability. Invent. Math. , 177 , no. 3, 2009, pp. 541–569.
- 3[3] J. Borcea and P. Brändén , The Lee-Yang and Pólya-Schur programs. II. Theory of stable polynomials and applications. Comm. Pure Appl. Math. , 62 , no. 12, 2009, pp. 1595–1631.
- 4[4] P. Brändén and M. Chasse , Classification theorems for operators preserving zeros in a strip, J. Anal. Math. , 132 , no. 1 (2017), pp. 177–215.
- 5[5] P. Brändén, I. Krasikov, and B. Shapiro , Elements of Pólya-Schur theory in finite difference settings, Proc. Amer. Math. Soc. , 144 , no. 11 (2016), pp. 4831–4843.
- 6[6] N. G. de Bruijn , The roots of trigonometric integrals, Duke Math. J. , 17 , no. 3 (1950), pp. 197–226.
- 7[7] D.A. Cardon , Complex zero decreasing operators, J. Math. Anal. Appl. , 426 , no. 1 (2015), pp. 406–422.
- 8[8] T. Craven and G. Csordas , Complex zero decreasing sequences, Methods Appl. Anal. , 2 , no. 4 (1995), pp. 420–441.
