1. Introduction
We consider the differential equation
associated with a positive parameter
. By a Sturm-Liouville function, we mean a nontrivial real solution of (1.1). Let
denote the ascending sequence of the zeros of a Sturm-Liouville function in the interval
. The Sturm comparison theorem (see e.g., [1, p.314] or [3, p.56]) states that the second differences of the sequence
are all positive if
and are all negative if
Our main purpose here is to go beyond the second differences and to show that higher consecutive differences of sequences constructed from
are regular in sign. Lorch and Szego [3] initiated the study of the sign-regularity of higher differences of the sequences associated with Sturm-Liouville functions. In particular, if
denotes the
kth positive zero of the general Bessel (cylinder) function
they proved that, for
,
and conjectured [3, p.71] on the basis of numerical evidence that, for
,
The symbol
means, as usual, the
mth (forward) difference of the sequence
:
Note that
is a solution of the equation
with
Since
we see that the Sturm comparison theorem gives the results
and
They also mentioned in [3] that the signs of the first
M differences of zeros of a Sturm-Liouville function of (1.4) could be inferred from the signs of
,
Muldoon [7] made some progress in
He proved that
holds when
([7, Corollary 4.2]).
Our approach here is based on the ideas and results of [10], where the string equation with was considered. Using the eigenvalues and the nodal points, we constructed a sequence of piecewise continuous linear functions which converges to uniformly on . We also obtained a formula for derivatives of in terms of the eigenvalues and the differences of the nodal points.
This paper is organized as follows. In
Section 2, we use the zeros
of a Sturm-Liouville function as nodes to obtain a difference-derivative theorem (Lemma 2.1). We also give asymptotic estimates for
as
(Lemma 2.3). Then we are able to express the higher differences
in terms of the derivatives of
at those zeros. Moreover, the expression can be used to determine the regular manner of these differences (Theorems 2.4 and 2.5). Besides, we construct sequences from
, whose all
mth differences have the same sign (Corollary 2.6). The proofs of Lemmas 2.1 and 2.3 rely on a system of interlaced inductions, which will be given in
Section 5. In
Section 3, we use an approximation process for the zeros of the general Bessel function to prove the conjecture of Lorh and Szego (Theorem 3.1). In
Section 4, the zeros of various orthogonal polynomials with higher degrees are shown to share similar sign-regularity (Theorems 4.1 and 4.2).
The notation used throughout is standard. A function
is said to be
M-monotonic (resp., absolutely
M-monotonic) on an interval
I if
If
holds for
, then
is said to be completely (resp., absolutely) monotonic on
I. A sequence
, depending on a positive parameter
, is said to be asymptotically
M-monotonic (resp., asymptotically absolutely
M-monotonic) if
for
sufficiently large.
2. Main Results
In this section we consider the differential equation
where
is a positive parameter. We shall assume throughout that
is a positive
-function on the interval
. The notation
is reserved for the function
. Let
be a nontrival real solution of (2.1), and let
be the zeros of
in the interval
. For
we denote by
the smallest positive interge
k such that
It is known(see e.g., [9, 10]) that
It follows that
In particular, we have
Thus, by (2.2) and the continuity of
f, we obtain
and, for any fixed
l,
Note that (2.4) means that, as , the sequence behaves as equally distributed.
If
is
m-times differentiable in
and the lower derivatives of
are continuous on
, a mean-value theorem [8, p. 52, no. 98] for differences and derivatives states that there exists a
, such that
where
. It is interesting to look for a difference-derivative theorem which can express the differences of a smooth function on the sequence
in terms of its derivatives at this sequence. The following lemma provides such a result.
Lemma 2.1. Let . If φ is a -function on , then, for
where the coefficients satisfy the recurrence relation:
for
To prove Lemma 2.1, we need a more detailed investigation on the behaviour of
. We use the Prüfer method to achieve our purpose. For each nontrivial solution
of (2.1), we define the Prüfer angle
as follows:
Then
satisfies the differential equation
If we specify the initial condition for
to be
with
then, by the standard results (see e.g., [1, p. 315]), we have
and
Let
Integrating both sides of (2.8) from
to
and using (2.9), we find
Taking the Taylor expansion of
at
and using (2.3), we obtain
The estimate of the second integral in (2.10) is stated as the following lemma. Its proof consists of a reducible system of integrals which will be given in Appendix.
Lemma 2.2. Let . Then, for we have
where the functions depend on and
Note that the first two functions
appeared in
are of the forms
For
using the estimates (2.11),
and
and multiplying (2.10) by
we find the estimate for
where the functions
Note that
Moreover, if we apply the
mth order difference operator to
, then we can find the estimates for differences of the function
at those zeros. Indeed, we have
Lemma 2.3. Let and as above. Then, for we have
The proofs of Lemmas 2.1 and 2.3 will be given in
Section 5.
Now, if we apply Lemma 2.1 to the function
, then, by
we have the estimate for the higher differences of
Moreover, using (2.3) and , iterating for m from 1 to M, and then taking sufficiently large, we can ensure the monotonicity of the sequence by f.
Theorem 2.4. Let and be as those mentioned above. If is M-monotonic on the interval , then the sequence is asymptotically M-monotonic.
Proof. Since
it suffices to show that
as
, to conclude that
We prove
by induction on
M. When
,
reduces to
which is true because
by
Now, suppose that
is true. By
we have
which is nonnegative as
by induction hypothesis, (2.19) and
Thus, by
and , for
by induction hypothesis again. This prove
and thus the theorem. □
Note that, if the factors are deleted from the assumptions (2.19), then, by making the obvious changes in the above proof, the conclusion (2.21) remains valid, provided they are amended by eliminating the factors Thus we have
Theorem 2.5. Let and be as those mentioned above. If is absolutely M-monotonic on the interval , then the sequence is asymptotically absolutely M-monotonic.
As consequences of Lemma 2.1, Theorems 2.4 and 2.5, we can use the zeros of a solution of (2.1) to construct sequences whose all mth differences have the same sign.
Corollary 2.6. (a) Let be M-monotonic on If is also M-monotonic on then the sequence is asymptotically M-monotonic.
(b) Let be absolutely M-monotonic on If is also absolutely M-monotonic on then the sequence is asymptotically absolutely M-monotonic.
Proof. Since
is
M-monotonic on
we see from the proof of Theorem 2.4 that
holds. On the other hand, the
M-monotonicity of
on
means that
It now follows from
(2.22) and
that
for all
k and
as
The proof of (b) is similar to that of part (a). □
Note that, by the definition of the function
the conclusion of Theorem 2.4 (resp., Theorem 2.5) can be inferred directly from the assumptions on
In fact,
(resp.,
) on
for
imply
(resp.,
) on
for
To examine the assertions, we can proceed by induction on
For
by the facts
and
, the assertion is valid. For higher derivatives of
a general term of
would appear as
with exponentials
a negative half-integer and
all nonnegative integers. The induction is carried through by differentiating
We have
and under the conditions
(resp.,
) and the negative
each term in the last sum has opposite sign (resp., the same sign) as
Thus,
and
have alternating signs (resp., the same sign), and then the inductions are complete. Hence we obtain
Corollary 2.7. Let be as above. (a) If is -monotonic on then the sequence is asymptotically M-monotonic.
(b) If is absolutely -monotonic on , then the sequence is asymptotically absolutely M-monotonic.
Although Corollary 2.7(a) is a partial result included in [4, Theorem 3.3], the techniques employ in this section are independent of the methods in the series of papers [4, 5, 7] and the results of Hartman [2, Theorems and .] It also gives the connection of the quantities between the differences of the zeros and the coefficient function However, it might have some numerical interest.
One can find similar results concerned with the critical points of a Sturm-Liouville function of (2.1). In fact, by letting
denote the
kth critical point of a solution
of (2.1) in the interval
and noting the definition of the Prüfer angle
the procedures employed in this section are all valid. Thus if we replace
in Theorems 2.4 and 2.5, and Corollaries 2.6 and 2.7 by
the conclusions in these Theorems and Corollaries still hold.
3. Applications to Bessel Functions.
Let
be the
kth positive zero of the general Bessel (cylinder) function
where
and
denote the Bessel functions with order
of the first and second kind, respectively. The main results in this section are stated as follows:
Theorem 3.1. (a) For we have
(b) For we have
The Airy functions (see e.g., [11, p.18]) satisfy the differential equation
We consider a broader class of functions, including the Airy functions, which satisfy the differential equation (see e.g., [12, p. 97(9)])
where
These functions are closely related to Bessel functions. Indeed,
is a nontrivial real solution of (3.1). Note that, for each
, the
kth positive zeros
of
satisfies the identities
Moreover, for each
, and
we have
and
The identities (3.2) and (3.3) are really the key for us to study the regularity behaviour of the Bessel zeros.
To prove Theorem 3.1, we consider the family of differential equations:
on the interval
Let
be a nontrivial real solution of (3.4) and let the sequence
be the zeros of
with the ascending order in
Following Theorem 2.4 with
and Corollary 2.6(a) with the function
we have
and
as
If we specify the initial conditions for the solution
of (3.4) to be
then it is easy to verify that
for
and hence, for each
converges to
as
Thus, for each
by (3.2) and (3.3), we have
and
Recalling (2.10) and
with the function
and denoting
we have
Note that
and
By (2.14), we have
If we apply the difference operator
to (3.10), by
and
, then we can find
Moreover, multiplying (3.11) by
we have
By (3.12), (3.6),
and
we have
Now, for each
if we choose
sufficiently large such that (3.13) and (3.5) hold, then, by (3.7) and (3.8), we have
and
Secondly, according to
(see e.g., [12, p. 64]), it is easily to verify that
and hence
Thus, for
(3.14) holds and (3.15) holds in the modified form
Thirdly, for any positive zero of is definable as a continuously increasing function of the real variable (see e.g., [12, p. 508]), so that, by an approximating process, (3.14) hold for all
Finally, since neither nor are constant sequences, the results of Lorch, Szego and Muldoon for completely monotonic sequences ([3, p. 72] or [6, Theorem 2]) guarantee the strict inequalities of (3.14) and (3.16). This completes the proof of Theorem 3.1.
5. Proofs of Lemmas 2.1 and 2.3.
In this section we shall prove , , , and by inductions, simultaneously.
For
taking the Taylor expansion of
at
:
where
and using (2.3), we have
and hence
,
and
are valid. If we apply the first order difference operator to
and use
with
then we have
By the fact
we also have
Applying
again to the function
we find that
and then we have
and hence
Thus and are valid. The validity of is the impetus of our induction argument.
Now, suppose
,
,
,
and
are fulfilled for
If we apply
with
to
then we have
that is
Taking the Taylor expansion of
at
:
where
applying the
Nth order difference operator to (5.1) and then using
we have
Following the product rule for higher differences, we know that
If we replace
by
in
for
and use
for
then we obtain
Thus (5.2) and (5.3) imply
Moreover, we have
Applying
with
instead of
for
to (5.4), we find
If we change the order of the summation in (5.5) and shift the index
then we can find
Thus and are valid.
Finally, to prove
applying the
th order difference operator to
we have
Following the product rule for higher differences again, we have
Using
with
replacing
for
and using
for
we obtain
On the other hand, applying
to the functions
and
for
we also have
Applying the estimates (5.7) and (5.8) to (5.6), we obtain
If we replace
by
in
then we have
Note that (5.9) and (5.10) imply
Then by (5.9) and (5.11), we have . This completes the proofs of Lemmas 2.1 and 2.3.