1. Introduction
Finding the zeros of polynomials has a rich history. Algebraic formulae giving the zeros of polynomials with real coefficients of degree up to four were known as early as the mid-1540s [
1]. With Abel’s proof of the insolvability of the quintic, the limitations of algebraic solutions became apparent. Restrictions of the location of the zeros became a necessary and popular area of study. The main result of interest to us was proved independently by Gustav Eneström in 1893 and Sōichi Kakeya in 1912 [
2,
3]. As a result, it is called the Eneström–Kakeya Theorem. It involves polynomials with real coefficients, but holds for both real and complex zeros of the polynomial.
Theorem 1 (The Eneström–Kakeya Theorem)
. A polynomial with real coefficients, where , has all of its zeros in .
A large number of generalizations of this theorem exists involving real and complex polynomials. These often result by varying the monotonicity condition on the coefficients in different ways. Several such results concerning complex polynomials are given in
Section 2.
With the recent introduction of an analytic theory of functions of a quaternionic variable [
4], the Eneström–Kakeya Theorem has been extended to polynomials of a quaternionic variable [
5] as follows.
Theorem 2 (The Quaternionic Eneström–Kakeya Theorem)
. A polynomial of a quaternionic variable with real coefficients, where , has all of its zeros in .
Several generalizations of this result also exist, including consideration of polynomials with quaternionic coefficients. Some of these are given in
Section 4.
2. Previous Results for Complex Polynomials
Several generalizations of the Eneström–Kakeya Theorem in the setting of polynomials with complex coefficients exist. In this section, we mention several such results which are relevant to this paper.
In 1980 Aziz and Mohammad [
6] introduced a “
t condition with a reversal” on the real and imaginary parts of the coefficients of an analytic function and used this to get a bound on the zeros of the function as follows.
Theorem 3. Let be analytic in . If and for all and for some k and r,then has all its zeros in A related result for polynomials was given in [
7]:
Theorem 4. Let be a polynomial of degree n. If and for , , and for some μ and θ and some ,then has all its zeros in where The advantages of the type of hypotheses used in Theorem 4 are illustrated by observing that a number of corollaries easily follow. For example, with , , and for , Theorem 4 implies the Eneström–Kakeya Theorem. By manipulating k and r, and with we can apply the result to any polynomial with coefficients which have monotone real and imaginary parts (whether monotone increasing, or monotone decreasing). For example, with , , and we have the hypotheses and .
A related monotonicity condition on the real coefficients of a polynomial was given in [
8]. In this case, an incomplete monotonicity condition is used. Monotonicity is imposed on some of the coefficients and excludes the condition on the first
q coefficients and the last
coefficients. As with the Eneström–Kakeya Theorem the coefficients are real but zeros are allowed to be complex.
Theorem 5. Let be a polynomial of degree n with real coefficients such that for some positive numbers s and r with , the coefficients satisfy . Then all the zeros of P lie in the closed annuluswhere and Notice that with and Theorem 5 implies the Eneström–Kakeya Theorem (and also gives a corresponding inner radius of the zero-containing region).
The monotonicity condition of Theorem 5 was generalized to include multiplicative parameters applied to the first and last coefficients in the monotonicity condition and extended to the real and imaginary parts of the coefficients in ([
9], Theorem 6).
Theorem 6. Let be a polynomial of degree n with complex coefficients. Let and for . Suppose that, for some positive numbers , , , , r, and s with , , , , and , the coefficients satisfy Then the zeros of P lie inwhere and . We get Theorem 5 as a corollary to Theorem 6 by setting
for
and setting
. If we also set
and
then we get ([
10], Theorem 3).
3. Some Properties of Quaternionic Polynomials
The quaternions
form a noncommutative division ring (in fact, they are the standard example of such a structure). The absence of commutativity means that we lose the factor theorem and that the zero-containing set is much more complicated than it is, for example, in the complex setting. As a simple example, the set of zeros of the polynomial equation
is
. So not only does the second-degree polynomial equation
have more than two solutions, it has uncountably infinitely many solutions! However with an appropriate definition of multiplicity of a zero of a quaternionic polynomial, the sum of the multiplicities of the zeros equals the degree of the polynomial. See ([
11], Definition 2.6) where such a definition is given and it is shown that, when applied to the complex setting, it reduces to the usual definition of multiplicity of a polynomial.
Another complication presented by noncommutativity is ambiguity as to how to multiply polynomials (or series). Writing a polynomial with the indeterminate on the left and the coefficients on the right, we define the
regular product of
and
as
where the symbol ∗ represents the regular product. As shown in [
12], the regular product of polynomials
f and
g is zero,
, if and only if
Since we are seeking results applicable to quaternionic polynomials instead of complex polynomials, we cannot simply apply well-known results from the complex setting. In addition to the unusual properties of quaternionic polynomials mentioned above with which we must deal, we also need quaternionic versions of the Maximum Modulus Theorem and Schwarz’s Lemma.
The Maximum Modulus Theorem in the quaternionic setting is as follows ([
4], Theorem 3.4).
Theorem 7. Let be an open ball in with center 0 and radius , and let be a regular function. If has a relative maximum at a point , then f is constant on B.
The complex version of Schwarz’s Lemma (see [
13], 5.5, p. 168); a quaternionic version of Schwarz’s Lemma appears in ([
14], Lemma 1), as follows.
Theorem 8. Let for , where the coefficients for , and variable q are quaternions. Suppose . Thenwhere 4. Previous Eneström–Kakeya-Type Results for Quaternionic Polynomials
Following the introduction of the Eneström–Kakeya Theorem in 2020 (Theorem 2), a large number of generalizations followed. In this section we state several which are relevant to the present work.
The first relevant generalization appeared in the same paper which presented Theorem 2 ([
5], Theorem 9). It involved a monotone increasing condition on the real part and the imaginary parts of the coefficients, as follows.
Theorem 9. If is a quaternionic polynomial of degree n, where for , and satisfying , , , , then all the zeros of p lie in If for in Theorem 9, then it implies Theorem 2.
A result generalizing Theorem 9 in two ways is in ([
15], Theorem 3.1). First, it does not impose any condition on the coefficients
, and second it introduces new parameters
and
which are multiplied by the parts of
and
, respectively, in a monotonicity condition.
Theorem 10. If is a polynomial of degree n with quaternionic coefficients and quaternionic variable where for such that for some and for some , we have:where , then all the zeros of lie inwhere With and , Theorem 10 reduces to Theorem 9. With for , the hypotheses of Theorem 10 are the same as the hypotheses of Theorem 6, so that Theorem 10 implies the outer radius of the zero-containing region in the complex plane of Theorem 6.
A generalization of Theorem 9 is given in ([
16], Theorem 3.2) which imposes a monotonicity condition with a reversal on each of the parts of the coefficients.
Theorem 11. If is a polynomial of degree n with quaternionic coefficients and quaternionic variable where for such that, we have:then all the zeros of lie in With , Theorem 11 reduces to Theorem 9.
A result generalizing both Theorem 9 and Theorem 11 is based on the
t condition of Theorems 3 and 4 applied to the parts of the quaternionic coefficients. It is given in [
14].
Theorem 12. Let be a polynomial of degree n with quaternionic coefficients where for . If and for some μ, θ, λ, and ω and for some then has all its zeroes in whereand With and , Theorem 12 reduces to Theorem 11. It then further reduces to Theorem 9, and ultimately to the Eneström–Kakeya Theorem (in both the quaternionic and complex settings).
5. Results
We now give a result which, under certain conditions, includes the hypotheses of each of the theorems of
Section 2 and
Section 4. Some new conditions are also imposed on the parts of the coefficients. A multiplicative parameter on the parts of the
rth and the
sth coefficients is imposed (similar to Theorem 6). We require the
t condition, a reversal, and a multiplicative parameter on the parts of the coefficients which appear at the reversal. We also leave the option of imposing no condition on the parts of the first
r coefficients nor on the parts of the last
coefficients. In this way, we get each of the results of
Section 4 as corollaries.
Theorem 13. Let be a quaternionic polynomial of degree n with coefficients Let , , , , , , , , , , , and be positive real numbers, and let . Let r, μ, and s be integers between 0 and n. Suppose Then the zero of satisfywherewhere To get the previously mentioned results as corollaries, we assign specific values to the parameters of Theorem 13. With , , , Theorem 13 gives Theorem 12 in the case where . If, in addition, we take in Theorem 13 then get Theorem 11 as a corollary. With these values of the parameters, along with setting yields Theorem 9 as a corollary.
Theorem 13 also implies results of
Section 2. With
,
,
, and
for
, Theorem 4 results in the case
. With
,
, and
for
, we get Theorem 5. Theorem 13 also implies the Eneström–Kakeya Theorem in both the complex setting (Theorem 1) and the quaternionic setting (Theorem 2).
Of course other corollaries follow as well be adjusting the many parameters of Theorem 13. As one example, we get the following generalization of Theorem 11 by setting , , and .
Corollary 1. Let is a polynomial of degree n with quaternionic coefficients and quaternionic variable where for . Let , , , , , , , , , , , and be positive real numbers. Let μ be an integer between 0 and n. Supposethen all the zeros of lie inwhere With , Corollary 1 yields Theorem 11. Another corollary can be similarly obtained. If we do not restrict and , then we have a result with hypotheses similar to both those of Theorem 12 and (when ) similar to those of Theorem 11, but the monotonicity condition imposed on the coefficients is incomplete in that it is imposed only on the parts of coefficients through . This further emphasizes the flexibility of the incomplete monotonicity condition and shows how it results in the admissibility of polynomials not covered by the other results.
We now see that Theorem 13 is a generalization of several of the results given in
Section 4 concerning the location of the zeros of a quaternionic polynomial. Therefore, Theorem 13 gives the same bounds on the zero-containing regions as those other results when both apply. The advantage of Theorem 13 and Corollary 1 is that they are applicable to a more diverse collection of quaternionic polynomials than the existing such results. As a simple example to illustrate this, consider the polynomial
. Notice that none of Theorems 9, 10, 11, 12 apply to this polynomial. However, with
,
,
,
,
,
,
,
,
,
, and the remaining parameters 0, we have that Theorem 13 applies. In fact, it gives that the quaternionic zeros of this polynomial lie in the region
.
6. Proof of the Result
Proof. First, notice that if
for
if and only if
, or
implies
(that is,
), by Equation (
1). So the zeros of
are just the zeros of
and
. Define
by
For
we have
Applying Schwarz’s Lemma (Theorem 8) to
gives
for
. We now have for
Therefore, if then , as claimed.
Now by the Maximum Modulus Theorem (Theorem 7) we have
for
, or
for
. We now have for
,
So for we have . That is, the zeros of all satisfy , as claimed. □
7. Discussion
We have given a result that restricts the location of the zeros of a quaternionic polynomial based on a monotonicity condition on the parts of the coefficients. The monotonicity condition, though complicated, is very flexible. This allows for the extraction of a number of previously known results as corollaries. There seem to be a limited number of numerical approaches to finding the zeros of a quaternionic polynomial (for
some examples see [
17,
18,
19]), so it is desirable to have some restrictions on the zeros. Future research could involve weakened hypotheses which make the results applicable to a larger class of functions. In addition, more parameters could be introduced to further improve the estimated location of the zeros. For example, additional multiplicative parameters could be added to other coefficients, and additional reversals could be added. In this way, the current (and previous results mentioned in
Section 2 and
Section 4) would appear as corollaries to the new results. The monotonicity conditions of this paper could also be applied to the moduli of the coefficients instead of the part of the coefficients. See ([
5], Theorem 10) for an example of such a result.