Next Article in Journal
Impact of Regional Difference in Recovery Rate on the Total Population of Infected for a Diffusive SIS Model
Previous Article in Journal
A Compromised Decision-Making Approach to Third-Party Logistics Selection in Sustainable Supply Chain Using Fuzzy AHP and Fuzzy VIKOR Methods
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Generalized and Extended Versions of Ankeny–Rivlin and Improved, Generalized, and Extended Versions of Rivlin Type Inequalities for the sth Derivative of a Polynomial

by
Kshetrimayum Krishnadas
1,*,
Reingachan Ngamchui
2 and
Barchand Chanam
2
1
Department of Mathematics, Shaheed Bhagat Singh College, University of Delhi, Phase II, Sheikh Sarai, New Delhi 110017, Delhi, India
2
Department of Mathematics, National Institute of Technology Manipur, Imphal 795004, Manipur, India
*
Author to whom correspondence should be addressed.
Mathematics 2021, 9(8), 887; https://doi.org/10.3390/math9080887
Submission received: 21 February 2021 / Revised: 9 April 2021 / Accepted: 14 April 2021 / Published: 16 April 2021

Abstract

:
Let p ( z ) be a polynomial of degree n having no zeros in | z | < 1 . In this paper, we generalize and extend a well-known result proven by Ankeny and Rivlin for the s t h derivative of the polynomial. Furthermore, another well-known result proven by Rivlin is also improved, generalized and extended for the s t h derivative of p ( z ) . Our results also give a number of interesting consequences as special cases.
MSC:
30C10; 30C15

1. Introduction

Let p ( z ) be a polynomial of degree n with real or complex coefficients. We denote M ( p , r ) = max | z | = r | p ( z ) | and m ( p , r ) = min | z | = r | p ( z ) | .
If p ( z ) is a polynomial of degree n, then it is well-known that:
M ( p , 1 ) n M ( p , 1 ) .
The result is best possible and the equality holds in (1) for p ( z ) = α z n , α being a complex number. This inequality, which is known as Bernstein’s inequality, was proven by Bernstein [1], although it was also proven by Riesz [2] about 12 years before Bernstein.
Erdös considered the class of polynomials p ( z ) of degree n having no zeros in | z | < 1 and conjectured that:
M ( p , 1 ) n 2 M ( p , 1 ) .
The result is sharp and the equality in (2) holds for p ( z ) = α z n + β , where α and β are complex numbers such that | α | = | β | . This inequality (2) was later verified by Lax [3] in 1944.
It is also well-known that if p ( z ) is a polynomial of degree n, then:
M ( p , R ) R n M ( p , 1 ) , R 1
and
M ( p , r ) r n M ( p , 1 ) , r 1 .
Inequality (3) is a consequence of the Maximum Modulus Principle [4] (p. 137 Problem III 269). Equality in (3) holds if p ( z ) is a constant multiple of z n . Whereas, inequality (4) is due to Zarantonello and Varga [5].
Ankeny and Rivlin [6] improved inequality (3) for the class of polynomials p ( z ) of degree n having no zeros in | z | < 1 . In fact, they proved:
Theorem 1.
If p ( z ) is a polynomial of degree n having no zeros in | z | < 1 , then:
M ( p , R ) R n + 1 2 M ( p , 1 ) , R 1 .
Equality in (5) holds for p ( z ) = α + β z n , where | α | = | β | .
While for the same class of polynomials, Rivlin [7] improved (4) by proving the following result.
Theorem 2.
If p ( z ) is a polynomial of degree n having no zeros in | z | < 1 , then:
M ( p , r ) r + 1 2 n M ( p , 1 ) , r 1 .
Equality in (6) occurs for p ( z ) = α + β z n n , | α | = | β | .
Govil [8] generalized Theorem 2 by proving the following.
Theorem 3.
If p ( z ) is a polynomial of degree n having no zeros in | z | < 1 , then for 0 < r R 1 ,
M ( p , r ) 1 + r 1 + R n M ( p , R ) .
The result is best possible for the polynomial p ( z ) = α + β z n n , | α | = | β | .
There are many extensions of inequality (5) (see Govil [8], Qazi [9], Bidkham and Dewan [10], Govil and Qazi [11], Govil et al. [12], Mir [13]). Some of the results by the above authors considered a more general class of polynomials while some also involve certain coefficients in the inequalities.
Jain [14] proved a generalization of Theorem 1 by simultaneously considering polynomials not vanishing in | z | < k , k 1 as well as the s t h derivative of the polynomials. In fact, he proved:
Theorem 4.
If p ( z ) is a polynomial of degree n having no zeros in | z | < k , k 1 , then for 0 s < n ,
M p ( s ) , R 1 2 d s d R s R n + k n 2 1 + k n M ( p , 1 ) , R k
and
M p ( s ) , R 1 R s + k s d s d x s 1 + x n x = 1 × R + k 1 + k n M ( p , 1 ) , 1 R k .
Equality holds in (8) with k = 1 and s = 0 for p ( z ) = z n + 1 and in (9) for s = 1 and p ( z ) = ( z + k ) n .
The paper is organized as follows. Section 2 includes preliminary results in the form of lemmas which are required to prove the main results and other claims. In Section 3, we state the main theorems of the paper and their implications on the existing results with the help of corollaries and remarks. Section 4 gives the proofs of the main theorems and in Section 5, a conclusion with some possible future prospects of the results is given.

2. Lemmas

The following lemmas are required to prove the results which are stated in the next section.
Lemma 1.
If p ( z ) = ν = 0 n a ν z ν is a polynomial of degree n having no zeros in | z | < k , k 1 , then:
max | z | = 1 | p ( z ) | n 1 + k | λ | 1 + k 2 + 2 k | λ | max | z | = 1 | p ( z ) | ;
furthermore:
max | z | = 1 | p ( z ) | n 1 + k ( 1 | λ | ) ( 1 + k 2 | λ | ) + k ( n 1 ) | μ λ 2 | ( 1 | λ | ) ( 1 k + k 2 + k | λ | ) + k ( n 1 ) | μ λ 2 | max | z | = 1 | p ( z ) | ,
where,
λ = k a 1 n a 0 a n d μ = 2 k 2 n ( n 1 ) a 2 a 0 .
The above lemma is due to Govil et al. [15]. In their paper [15], the authors mentioned that the bound given by (11) improves over the bound given by (10) because of the fact:
( n 1 ) | μ λ 2 | ( 1 | λ | 2 ) .
However, the authors did not discuss it. For the sake of completeness, we give a brief proof of it in Lemma 3 by applying the next lemma.
Lemma 2.
Let a , b , c , d > 0 be real numbers such that c d . If a b then:
a + c b + c a + d b + d .
Proof of Lemma 2.
Suppose that c < d . Then inequality (14) follows easily as:
a b a ( d c ) b ( d c ) ,
which simplifies to:
( a + c ) ( b + d ) ( a + d ) ( b + c ) ,
which gives the desired conclusion of the lemma.
For the case c = d equality in (14) holds trivially.  □
We now show that the bound given by (11) is smaller than the bound given by (10).
Lemma 3.
Let p ( z ) = ν = 0 n a ν z ν be a polynomial of degree n having no zeros in | z | < k , k 1 , then:
n 1 + k ( 1 | λ | ) ( 1 + k 2 | λ | ) + k ( n 1 ) | μ λ 2 | ( 1 | λ | ) ( 1 k + k 2 + k | λ | ) + k ( n 1 ) | μ λ 2 | n 1 + k | λ | 1 + k 2 + 2 k | λ | ,
where λ and μ are given by (12).
Proof of Lemma 3.
Put a = ( 1 | λ | ) ( 1 + k 2 | λ | ) , b = ( 1 | λ | ) ( 1 k + k 2 + k | λ | ) ,
c = k ( n 1 ) | μ λ 2 | , and d = k ( 1 | λ | 2 ) in Lemma 2.
Now by (13), c d and it is easy to see that a b . Hence, it follows from inequality (14) of Lemma 2 that:
( 1 | λ | ) ( 1 + k 2 | λ | ) + k ( n 1 ) | μ λ 2 | ( 1 | λ | ) ( 1 k + k 2 + k | λ | ) + k ( n 1 ) | μ λ 2 | ( 1 | λ | ) ( 1 + k 2 | λ | ) + k ( 1 | λ | 2 ) ( 1 | λ | ) ( 1 k + k 2 + k | λ | ) + k ( 1 | λ | 2 ) .
Equivalently,
n 1 + k ( 1 | λ | ) ( 1 + k 2 | λ | ) + k ( n 1 ) | μ λ 2 | ( 1 | λ | ) ( 1 k + k 2 + k | λ | ) + k ( n 1 ) | μ λ 2 | n 1 + k ( 1 | λ | ) ( 1 + k 2 | λ | ) + k ( 1 | λ | 2 ) ( 1 | λ | ) ( 1 k + k 2 + k | λ | ) + k ( 1 | λ | 2 ) = n 1 + k 1 + k 2 | λ | + k ( 1 + | λ | ) 1 k + k 2 + k | λ | + k ( 1 + | λ | ) = n 1 + k | λ | 1 + k 2 + 2 k | λ | ,
which is the desired conclusion of the lemma.  □
Lemma 4.
Let p ( z ) = ν = 0 n a ν z ν be a polynomial of degree n having no zeros in | z | < k , k > 0 , then for 0 < t k ,
n t + k ( 1 | λ | ) ( t 2 + k 2 | λ | ) + k t ( n 1 ) | μ λ 2 | ( 1 | λ | ) ( t 2 k t + k 2 + k t | λ | ) + k t ( n 1 ) | μ λ 2 | n t + k | λ | t 2 + k 2 + 2 k t | λ | ,
where λ and μ are given by (12).
Proof of Lemma 4.
Let P ( z ) = p ( t z ) , where 0 < t k . Since p ( z ) 0 in | z | < k , then P ( z ) 0 in | z | < k t , where k t 1 . Thus, applying Lemma 3 to the polynomial P ( z ) , we obtain:
n 1 + k t ( 1 | λ | ) 1 + k 2 t 2 | λ | + k t ( n 1 ) | μ λ 2 | ( 1 | λ | ) 1 k t + k 2 t 2 + k t | λ | + k t ( n 1 ) | μ λ 2 | n 1 + k t | λ | 1 + k 2 t 2 + 2 k t | λ |
where,
λ = k t ( a 1 t ) n a 0 = k a 1 n a 0 and μ = 2 k t 2 ( a 2 t 2 ) n ( n 1 ) a 0 = 2 k 2 n ( n 1 ) a 2 a 0 .
Inequality (17), on simplification assumes (16).  □
Lemma 5.
Let P ( z ) be a polynomial of degree n having all its zeros in | z | 1 . If p ( z ) is a polynomial of degree at most n such that:
| p ( z ) | | P ( z ) | o n | z | = 1 ,
then for 0 s < n ,
| p ( s ) ( z ) | | P ( s ) ( z ) | f o r | z | 1 .
Lemma 6.
If p ( z ) is a polynomial of degree at most n, then for 0 s < n ,
| p ( s ) ( z ) | + | q ( s ) ( z ) | d s d z s ( 1 ) + d s d z s ( z n ) M ( p , 1 ) , | z | 1 ,
where,
q ( z ) = z n p 1 z ¯ ¯ .
Lemmas 5 and 6 are due to Jain [14].
Lemma 7.
If p ( z ) = ν = 0 n a ν z ν is a polynomial of degree n having no zeros in | z | < k , k > 0 , then for 0 < r R k ,
M ( p , R ) exp n r R E t , k t + k d t M ( p , r ) ,
where,
E t , k = ( 1 | λ | ) ( t 2 + k 2 | λ | ) + k t ( n 1 ) | μ λ 2 | ( 1 | λ | ) ( t 2 k t + k 2 + k t | λ | ) + k t ( n 1 ) | μ λ 2 | ,
λ and μ are given by (12).
Proof of Lemma 7.
Let P ( z ) = p ( t z ) , where 0 < t k . Since p ( z ) 0 in | z | < k , then P ( z ) 0 in | z | < k t , where k t 1 . Thus, applying inequality (11) of Lemma 1 to the polynomial P ( z ) , we obtain:
max | z | = 1 | P ( z ) | n 1 + k t ( 1 | λ | ) 1 + k 2 t 2 | λ | + k t ( n 1 ) | μ λ 2 | ( 1 | λ | ) 1 k t + k 2 t 2 + k t | λ | + k t ( n 1 ) | μ λ 2 | × max | z | = 1 | P ( z ) | ,
where,
λ = k t ( a 1 t ) n a 0 = k a 1 n a 0 and μ = 2 k t 2 ( a 2 t 2 ) n ( n 1 ) a 0 = 2 k 2 n ( n 1 ) a 2 a 0 .
Inequality (22) on simplification becomes:
max | z | = t | p ( z ) | n t + k ( 1 | λ | ) ( t 2 + k 2 | λ | ) + k t ( n 1 ) | μ λ 2 | ( 1 | λ | ) ( t 2 k t + k 2 + k t | λ | ) + k t ( n 1 ) | μ λ 2 | max | z | = t | p ( z ) | ,
which is equivalent to:
M ( p , t ) n t + k E t , k M ( p , t ) ,
where E t , k is as defined in (21).
We know for 0 < r R k and 0 θ < 2 π :
p ( R e i θ ) p ( r e i θ ) = r R p ( t e i θ ) d t r R p ( t e i θ ) d t i . e . , p ( R e i θ ) p ( r e i θ ) + r R p ( t e i θ ) d t ,
which implies on taking maximum over θ ,
M ( p , R ) M ( p , r ) + r R M ( p , t ) d t .
Inequality (24), in conjunction with (23), gives:
M ( p , R ) M ( p , r ) + n r R E t , k t + k M ( p , t ) d t .
Let ϕ ( R ) denote the right hand side of inequality (25). Then,
ϕ ( R ) = n R + k E R , k M ( p , R )
and M ( p , R ) ϕ ( R ) .
From (26) and (27), we further have:
ϕ ( R ) n R + k E R , k ϕ ( R ) i . e . , ϕ ( R ) n R + k E R , k ϕ ( R ) 0 .
Multiplying (28) by:
exp n E R , k R + k d R ,
we have:
d d R ϕ ( R ) exp n E R , k R + k d R 0 .
Hence, the function:
ψ ( R ) = ϕ ( R ) exp n E R , k R + k d R
is a non-increasing function of R in ( 0 , k ] . Therefore, for 0 < r R k ,
ψ ( r ) ψ ( R ) .
Since ϕ ( R ) M ( p , R ) and ϕ ( r ) = M ( p , r ) , we have from (30):
M ( p , r ) M ( p , R ) exp n r R E t , k t + k d t .
Equivalently,
M ( p , R ) exp n r R E t , k t + k d t M ( p , r )
which completes the proof of Lemma 7.  □
Lemma 8.
If p ( z ) = ν = 0 n a ν z ν is a polynomial of degree n 3 having no zeros in | z | < k , k > 0 , then for 0 < r ρ k ,
M ( p , ρ ) exp n r ρ E t , k t + k d t M ( p , r ) 1 k n ρ n r n exp n r ρ E t , k t + k d t m ( p , k ) ,
where E t , k is given by (21).
Proof of Lemma 8.
If p ( z ) has a zero on | z | = k , then m ( p , k ) = 0 and because of Lemma 7, the result holds trivially. Hence, without loss of generality, we assume that p ( z ) has all its zeros in | z | > k , so that m > 0 and z n p ( z ) is analytic in | z | k . Then, by Maximum Modulus Principle [4] (p. 137, problem III 269), we have for | z | k :
z n p ( z ) max | z | = k z n p ( z ) k n min | z | = k | p ( z ) | = k n m .
Hence, we have:
m | z | n k n | p ( z ) | for | z | k .
By Rouche’s Theorem, for every α with | α | < 1 , the polynomial p ( z ) + α m z n k n has no zeros in | z | < k , k 1 . Hence, p ( z ) + α m z n k n has all its zeros in | z | k , k 1 . Thus, applying Lemma 7 to the polynomial p ( z ) + α m z n k n , we have for 0 < r ρ k and every α with | α | < 1 :
max | z | = ρ p ( z ) + α m z n k n exp n r ρ E t , k t + k d t max | z | = r p ( z ) + α m z n k n .
This implies:
max | z | = ρ p ( z ) + α m z n k n exp n r ρ E t , k t + k d t M ( p , r ) + | α | m r n k n .
Choosing the argument of α suitably such that:
max | z | = ρ p ( z ) + α m z n k n = M ( p , ρ ) + | α | m ρ n k n ,
then inequality (32) gives:
M ( p , ρ ) exp n r ρ E t , k t + k d t M ( p , r ) | α | k n ρ n r n exp n r ρ E t , k t + k d t m ( p , k ) .
Taking the limit as | α | 1 , we get:
M ( p , ρ ) exp n r ρ E t , k t + k d t M ( p , r ) 1 k n ρ n r n exp n r ρ E t , k t + k d t m ( p , k ) ,
which completes the proof of Lemma 8.  □
The next lemma was proved by Aziz and Rather Corollary 1 in [16].
Lemma 9.
If p ( z ) = ν = 0 n a ν z ν is a polynomial of degree n having no zeros in | z | < k , k 1 , then for 1 s < n ,
max | z | = 1 p ( s ) ( z ) n ( n 1 ) ( n s + 1 ) × C ( n , s ) | a 0 | + | a s | k s + 1 C ( n , s ) | a 0 | 1 + k s + 1 + | a s | k s + 1 k s 1 + 1 max | z | = 1 | p ( z ) |
and
1 C ( n , s ) a s a 0 k s 1 ,
where C ( n , s ) = n ! ( n s ) ! s ! .
Remark 1.
From Lemma 9, it is easy to conclude that for 0 s < n ,
max | z | = 1 p ( s ) ( z ) d s d x s x n + 1 x = 1 × C ( n , s ) | a 0 | + | a s | k s + 1 C ( n , s ) | a 0 | 1 + k s + 1 + | a s | k s + 1 k s 1 + 1 max | z | = 1 | p ( z ) |
and
1 C ( n , s ) a s a 0 k s 1 .
The following result is due to Jain Remark 1 in [17].
Lemma 10.
If p ( z ) = ν = 0 n a ν z ν is a polynomial of degree n having no zeros in | z | < k , k > 0 , then:
R 2 + k 2 + 2 k R | δ | r 2 + k 2 + 2 k r | δ | n 2 R + k r + k n for 0 < r R k ,
where, δ = k a 1 n a 0 has absolute value 1 (see Lemma 1 in [9]).
Lemma 11.
Let p ( z ) = ν = 0 n a ν z ν be a polynomial of degree n having no zeros in | z | < k , k > 0 , then:
exp n r R E t , k t + k d t R 2 + k 2 + 2 k R | λ | r 2 + k 2 + 2 k r | λ | n 2 , 0 < r R k
and also:
exp n r R E t , k t + k d t R + k r + k n , 0 < r R k .
In particular, we have for r = 1 and R = k ,
1 k n exp n 1 k E t , k t + k d t 2 + 2 | λ | 1 + k 2 + 2 k | λ | n 2 , k 1
and
1 k n exp n 1 k E t , k t + k d t 2 1 + k n , k 1 ,
where E t , k and λ are given by (21) and (12) respectively.
Proof of Lemma 11.
Integrating on both sides of inequality (16) of Lemma 4 with respect to t from r t o R , where 0 < r R k , we get:
n r R E t , k t + k d t n r R t + k | λ | t 2 + k 2 + 2 k t | λ | d t .
Equivalently,
exp n r R E t , k t + k d t exp n r R t + k | λ | t 2 + k 2 + 2 k t | λ | d t = R 2 + k 2 + 2 k R | λ | r 2 + k 2 + 2 k r | λ | n 2 ,
which is inequality (37).
Again for 0 < r R k , combining (36) with (37), we get (38).
Furthermore, put R = k and r = 1 in (37) and (38), we get (39) and (40) respectively.  □
Lemma 12.
If p ( z ) = ν = 0 n a ν z ν is a polynomial of degree n having no zeros in | z | < k , k 1 , then for 0 s < n and 1 R k ,
1 R s F R , k exp n 1 R E t , k t + k d t 1 R s + k s R + k 1 + k n
where here and throughout the paper,
F R , k = C ( n , s ) | a 0 | R s + 1 + | a s | R s k s + 1 C ( n , s ) | a 0 | R s + 1 + k s + 1 + | a s | R k s + 1 k s 1 + R s 1 ,
C ( n , s ) = n ! ( n s ) ! s ! , and E t , k is given by (21).
Proof of Lemma 12.
Taking r = 1 in Lemma 11, we get from (37):
exp n 1 R E t , k t + k d t R + k 1 + k n .
Now, for 1 R k and 0 s < n , consider:
1 R s + k s F R , k R s
i.e.,
1 R s + k s C ( n , s ) | a 0 | R s + 1 + | a s | R s k s + 1 C ( n , s ) | a 0 | R s R s + 1 + k s + 1 + | a s | R s + 1 k s + 1 k s 1 + R s 1
i.e.,
( k R ) R s k s { C ( n , s ) | a 0 | | a s | k s } R s + k s C ( n , s ) | a 0 | R s R s + 1 + k s + 1 + | a s | R s + 1 k s + 1 k s 1 + R s 1 ,
which in non-negative because, by (35) of Remark 1, C ( n , s ) | a 0 | | a s | k s 0 and the fact R k . Thus, we have:
F R , k R s 1 R s + k s .
Combining (43) and (44) we get the desired inequality (41).  □

3. Main Results

In this paper, by involving certain coefficients of the polynomial, we obtain a generalization and refinement of Theorem 4. Moreover, our results are found to generalize and improve or generalize some other known inequalities. More precisely, we prove:
Theorem 5.
Let p ( z ) = ν = 0 n a ν z ν be a polynomial of degree n having no zeros in | z | < k , k > 0 , then for 0 s < n ,
M ( p ( s ) , R ) 1 2 k n d s d R s ( R n + k n ) × exp n r k E t , k t + k d t M ( p , r ) , 0 < r k R
and
M ( p ( s ) , R ) 1 R s d s d x s ( x n + 1 ) x = 1 × F R , k exp n r R E t , k t + k d t M ( p , r ) , 0 < r R k ,
where E t , k and F R , k are given by (21) and (42) respectively.
Equality occurs in (45) when s = 0 , k = 1 = r for p ( z ) = z n + 1 and in (46) when s = 1 , r = R for p ( z ) = ( z + k ) n .
Taking r = 1 in Theorem 5, we have the following improvement of Theorem 4 proven by Jain [14].
Corollary 1.
Let p ( z ) = ν = 0 n a ν z ν be a polynomial of degree n having no zeros in | z | < k , k 1 , then for 0 s < n ,
M ( p ( s ) , R ) 1 2 k n d s d R s ( R n + k n ) × exp n 1 k E t , k t + k d t M ( p , 1 ) , R k
and
M ( p ( s ) , R ) 1 R s d s d x s ( x n + 1 ) x = 1 × F R , k exp n 1 R E t , k t + k d t M ( p , 1 ) , 1 R k .
Remark 2.
In the light of (40) of Lemma 11 and (41) of Lemma 12, Corollary 1 is an improvement of Theorem 4 due to Jain [14].
Remark 3.
In view of (39) of Lemma 11, inequality (47), under the same hypotheses, gives an improved bound over a result due to Mir ([13], Theorem 2) for R k while the corresponding bound for 1 R k is supplemented by (48).
Remark 4.
Taking s = 0 in Theorem 5, we have the following result.
Corollary 2.
Let p ( z ) = ν = 0 n a ν z ν be a polynomial of degree n having no zeros in | z | < k , k > 0 , then:
M ( p , R ) 1 2 k n ( R n + k n ) × exp n r k E t , k t + k d t M ( p , r ) , 0 < r k R
and
M ( p , R ) exp n r R E t , k t + k d t M ( p , r ) , 0 < r R k .
Inequality (49) reduces to inequality (5) when we set r = k = 1 , and therefore is a generalization of (5) due to Ankeny and Rivlin [6]. Whereas, by inequality (38) of Lemma 11, inequality (50) is an improvement of a result proven by Jain Lemma 6 in [18]. Moreover, (50) is also an improvement of another result proven by Jain Remark 1 in [17].
Remark 5.
If s = 0 and k = 1 in Theorem 5, we have the next result which generalizes Theorem 1 proven by Ankeny and Rivlin [6] and improves Theorem 3 due to Govil [8].
Again putting k = 1 in Corollary 2, we have:
Corollary 3.
If p ( z ) = ν = 0 n a ν z ν is a polynomial of degree n having no zeros in | z | < 1 , then:
M ( p , R ) R n + 1 2 exp n r 1 E t , 1 t + 1 d t M ( p , r ) , 0 < r 1 R
and
M ( p , R ) exp n r R E t , 1 t + 1 d t M ( p , r ) , 0 < r R 1 .
Remark 6.
If we put r = 1 , inequality (51) reduces to (5) due to Ankeny and Rivlin [6].
For k = 1 , inequality (38) gives:
exp n r R E t , 1 t + 1 d t R + 1 r + 1 n ,
which shows that the bound of (52) improves over the bound given by inequality (7) due to Govil [8].
Remark 7.
If we take s = 0 and r = 1 in Theorem 5, we have the following result which improves the result proven by Aziz and Mohammad Theorem 2 in [19].
Corollary 4.
If p ( z ) = ν = 0 n a ν z ν is a polynomial of degree n having no zeros in | z | < k , k 1 , then:
M ( p , R ) 1 2 k n ( R n + k n ) exp n 1 k E t , k t + k d t M ( p , 1 ) , R k
and
M ( p , R ) exp n 1 R E t , k t + k d t M ( p , 1 ) , 1 R k .
Inequality (53) is a generalization of (5). Taking r = 1 in (38), we obtain:
exp n 1 R E t , k t + k d t R + k 1 + k n ,
which verifies that inequality (54) is an improvement of the result mentioned in Remark 7.
Remark 8.
Furthermore, if we take s = 0 and R = k = 1 in Theorem 5, the two inequalities reduce to a single inequality which is found to extend and improve inequality (6) due to Rivlin [7] in the form of the following result.
Corollary 5.
If p ( z ) = ν = 0 n a ν z ν is a polynomial of degree n having no zeros in | z | < 1 , then:
M ( p , r ) 1 exp n r 1 E t , 1 t + 1 d t M ( p , 1 ) , r 1 .
For R = k = 1 in (38), we get:
exp n r 1 E t , 1 t + 1 d t 2 r + 1 n ,
which shows that (55) is an improvement of inequality (6) proven by Rivlin [7].
If s = 1 , Theorem 5 in particular reduces to the following result which has some implications on some known inequalities involving the derivative of p ( z ) .
Corollary 6.
If p ( z ) = ν = 0 n a ν z ν is a polynomial of degree n having no zeros in | z | < k , k > 0 , then:
M ( p , R ) 1 2 k n n R n 1 exp n r k E t , k t + k d t M ( p , r ) , 0 < r k R
and
M ( p , R ) n R + k | λ | R 2 + k 2 + 2 k R | λ | exp n r R E t , k t + k d t M ( p , r ) , 0 < r R k .
Remark 9.
If we choose r = 1 in Corollary 6, we have the next result which is an improvement of the result due to Bidkham and Dewan Theorem 3 in [10].
Corollary 7.
If p ( z ) = ν = 0 n a ν z ν is a polynomial of degree n having no zeros in | z | < k , k 1 , then:
M ( p , R ) 1 2 k n n R n 1 exp n 1 k E t , k t + k d t M ( p , 1 ) , R k
and
M ( p , R ) n R + k | λ | R 2 + k 2 + 2 k R | λ | exp n 1 R E t , k t + k d t M ( p , 1 ) , 1 R k .
Putting r = 1 in (38) of Lemma 11, we have:
exp n 1 R E t , k t + k d t R + k 1 + k n .
We can show that:
R + k | λ | R 2 + k 2 + 2 k R | λ | R + k 1 + k n ( R + k ) n 1 ( 1 + k ) n ,
which is equivalent to:
( R + k | λ | ) ( R + k ) R 2 + k 2 + 2 k R | λ | ,
and it simplifies to:
k R ( 1 | λ | ) k 2 ( 1 | λ | ) ,
which clearly holds as | λ | 1 and R k .
Thus, inequality (59) is an improvement of the result mentioned in Remark 9. On the other hand, inequality (58) gives the corresponding bound when R k .
Remark 10.
Again putting s = 1 , r = 1 , k = 1 , R = 1 in Theorem 5, both the inequalities reduce to the single well-known inequality (2) conjectured by Erdös and later verified by Lax [3].
We further improve Theorem 5 by involving m ( p , k ) . In fact, we prove:
Theorem 6.
Let p ( z ) = ν = 0 n a ν z ν be a polynomial of degree n 3 having no zeros in | z | < k , k > 0 , then for 0 s < n ,
M ( p ( s ) , R ) 1 2 k n d s d R s ( R n + k n ) exp n r k E t , k t + k d t M ( p , r ) 1 k n k n r n exp n r k E t , k t + k m ( p , k ) , 0 < r k R
and
M ( p ( s ) , R ) 1 R s d s d x s ( x n + 1 ) x = 1 F R , k exp n r R E t , k t + k d t M ( p , r ) 1 k n R n r n exp n r R E t , k t + k d t m ( p , k ) , 0 < r R k ,
where E t , k and F R , k are respectively given by (21) and (42).
Equality occurs in (60) when s = 0 , k = 1 = r for p ( z ) = z n + 1 and in (61) when s = 1 , r = R for p ( z ) = ( z + k ) n .
The following result which further improves Corollary 1, is obtained by taking r = 1 in Theorem 6.
Corollary 8.
Let p ( z ) = ν = 0 n a ν z ν be a polynomial of degree n 3 having no zeros in | z | < k , k 1 , then for 0 s < n ,
M ( p ( s ) , R ) 1 2 k n d s d R s ( R n + k n ) exp n 1 k E t , k t + k d t M ( p , 1 ) 1 k n k n exp n 1 k E t , k t + k m ( p , k ) , R k
and
M ( p ( s ) , R ) 1 R s d s d x s ( x n + 1 ) x = 1 F R , k exp n 1 R E t , k t + k d t M ( p , 1 ) 1 k n R n exp n 1 R E t , k t + k d t m ( p , k ) , 1 R k ,
where E t , k and F R , k are respectively given by (21) and (42).
Corollary 8 has special importance that it gives Ankeny and Rivlin’s analogue of the s t h derivative separately by two different forms of bound according as R k and 1 R k .
Remark 11.
In view of (39), inequality (62) gives a better bound than a result due to Mir Theorem 3 in [13] concerning the estimate of M ( p ( s ) , R ) . Whereas, inequality (63) gives an improved and generalized version of the result of Bidkham and Dewan Theorem 3 in [10] concerning s t h derivative.
Remark 12.
Putting s = 0 and k = 1 , (62) reduces to (5) due to Ankeny and Rivlin [6].
Remark 13.
Putting s = 0 , R = k = 1 in Theorem 6, the two inequalities coincide to the following result which further extends and improves (6) due to Rivlin [7].
Corollary 9.
If p ( z ) = ν = 0 n a ν z ν is a polynomial of degree n 3 having no zeros in | z | < 1 , then:
M ( p , r ) M ( p , 1 ) exp n r 1 E t , 1 t + 1 d t + 1 exp n r 1 E t , 1 t + 1 d t r n m ( p , 1 ) , 0 < r 1 ,
where E t , 1 is obtained by taking k = 1 in (21).
For 0 < r 1 , we have 1 + r 2 n r n . Also from (38) for R = k = 1 :
1 exp n r 1 E t , 1 t + 1 d t 1 + r 2 n r n .
Hence,
1 exp n r 1 E t , 1 t + 1 d t r n 0 .
Thus, Corollary 9 is a more improved version of Corollary 5, which further improves Theorem 2 due to Rivlin [7].
Remark 14.
Again, as in Remark 10, if we take s = 1 , r = 1 , k = 1 , R = 1 in (60) and (61) of Theorem 6; both the inequalities also reduce to inequality (2) conjectured by Erdös and later verified by Lax [3].

4. Proofs of the Theorems

We first prove the more refined Theorem 6.
Proof of Theorem 6.
First we prove inequality (60). Since p ( z ) 0 in | z | < k , then T ( z ) = p ( k z ) 0 in | z | < 1 .
Let H ( z ) = z n T 1 z ¯ ¯ , then H ( z ) has all its zeros in | z | 1 and:
| T ( z ) | | H ( z ) | for | z | = 1 .
Applying Lemma 5 to the polynomials T ( z ) and H ( z ) , for 0 s < n and t 1 , we have:
T ( s ) ( t e i θ ) H ( s ) ( t e i θ ) , 0 θ < 2 π .
Furthermore by Lemma 6 for 0 s < n ,
T ( s ) ( t e i θ ) + H ( s ) ( t e i θ ) d s d t s ( 1 + t n ) M ( T , 1 ) , 0 θ < 2 π .
Combining (66) and (67), we get:
T ( s ) ( t e i θ ) 1 2 d s d t s ( 1 + t n ) M ( T , 1 ) i . e . , p ( s ) ( k t e i θ ) 1 2 k s d s d t s ( 1 + t n ) M ( p , k ) .
Putting k t = R in (68), we have:
p ( s ) ( R e i θ ) 1 2 k n d s d R s ( R n + k n ) M ( p , k ) for R k .
Thus,
M ( p ( s ) , R ) 1 2 k n d s d R s ( R n + k n ) M ( p , k ) for R k .
Putting ρ = k in inequality (31), we have for 0 < r k :
M ( p , k ) exp n r k E t , k t + k d t M ( p , r ) 1 k n k n r n exp n r k E t , k t + k d t m ( p , k ) .
Hence, inequality (69), in conjunction with inequality (70), we have:
M ( p ( s ) , R ) 1 2 k n d s d R s ( R n + k n ) exp n r k E t , k t + k d t M ( p , r ) 1 k n k n exp n r k E t , k t + k m ( p , k ) for 0 < r k R ,
which is inequality (60).
Next we prove inequality (61). Let P ( z ) = p ( R z ) where 0 < R k . Since p ( z ) 0 in | z | < k , k > 0 , then P ( z ) does not vanish in | z | < k R , k R 1 . Thus, applying (34) of Remark 1 to the polynomial P ( z ) , we have for 0 s < n and 0 < R k :
R s M ( p ( s ) , R ) d s d x s ( x n + 1 ) x = 1 F R , k M ( p , R ) .
Putting ρ = R in (31) of Lemma 8, we get:
M ( p , R ) exp n r R E t , k t + k d t M ( p , r ) 1 k n R n r n exp n r R E t , k t + k d t m ( p , k ) .
Hence, from (71) and (72) we obtain for 0 s < n and 0 < r R k :
M ( p ( s ) , R ) 1 R s d s d x s ( x n + 1 ) x = 1 F R , k exp n r R E t , k t + k d t M ( p , r ) 1 k n R n r n exp n r R E t , k t + k d t m ( p , k ) ,
which completes the proof of Theorem 6.  □
Proof of Theorem 5.
The proof of Theorem 5 follows along the lines of Theorem 6, on applying (20) of Lemma 7 instead of applying (31) of Lemma 8.  □

5. Conclusions

The well-known result due to Ankeny and Rivlin (Theorem 1), and some related results are generalized and extended by proving inequalities for the s t h derivative involving certain coefficients of the polynomials. In addition, the result due to Rivlin (Theorem 2) and some related results are generalized, improved, and extended in a similar manner. It would be of interest to further extend these results to polar derivatives of a higher order and L p norm inequalities.

Author Contributions

Conceptualization, K.K., R.N. and B.C.; methodology, K.K., R.N. and B.C.; formal analysis, K.K. and R.N.; investigation, K.K. and R.N.; resources, K.K., R.N. and B.C.; writing—original draft preparation, K.K. and B.C.; supervision, B.C.; project administration, B.C. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Bernstein, S. Lecons sur les Propriétés extrémales et la Meilleure Approximation des Fonctions Analytiques d’une Variable Réelle; Gauthier-Villars: Paris, France, 1926. [Google Scholar]
  2. Riesz, M. Eine Trigonometrische interpolation formel und einige Ungleichung für Polynome. Jahresber. Dtsch. Math.-Verein. 1914, 23, 354–368. [Google Scholar]
  3. Lax, P.D. Proof of a Conjecture of P. Erdös on the derivative of a polynomial. Bull. Am. Math. Soc. 1944, 50, 509–513. [Google Scholar] [CrossRef] [Green Version]
  4. Pölya, G.; Szegxox, G. Aufgaben und Lehrsätze aus der Analysis I (Problems and Theorems in Analysis I); Springer: Berlin/Heidelberg, Germany, 1925. [Google Scholar]
  5. Varga, R.S. A comparison of the successive over relaxation method and semi-iterative methods using Chebyshev polynomials. J. Soc. Ind. Appl. Math. 1957, 5, 39–46. [Google Scholar] [CrossRef]
  6. Ankeny, N.C.; Rivlin, T.J. On a Theorem of S. Bernstein. Pac. J. Math. 1955, 5, 849–852. [Google Scholar] [CrossRef]
  7. Rivlin, T.J. On the maximum modulus of polynomials. Am. Math. Mon. 1960, 67, 251–253. [Google Scholar] [CrossRef]
  8. Govil, N.K. On the Maximum Modulus of Polynomials. J. Math. Anal. Appl. 1985, 112, 253–258. [Google Scholar] [CrossRef] [Green Version]
  9. Qazi, M.A. On the Maximum Modulus of Polynomials. Proc. Am. Math. Soc. 1992, 115, 337–343. [Google Scholar] [CrossRef]
  10. Bidkham; Dewan, K.K. Inequalities for a polynomial and its derivative. J. Math. Anal. Appl. 1992, 166, 319–324. [Google Scholar] [CrossRef] [Green Version]
  11. Govil, N.K.; Qazi, M.A. On maximum Modulus of Polynomials and Related Entire Functions with Restricted Zeros. Math. Inequal. Appl. 2003, 5, 57–60. [Google Scholar] [CrossRef] [Green Version]
  12. Govil, N.K.; Qazi, M.A.; Rahman, Q.I. Inequalities describing the growth of polynomials not vanishing in a disk of prescribed radius. Math. Inequal. Appl. 2003, 6, 453–467. [Google Scholar] [CrossRef]
  13. Mir, A. On some inequalities concerning growth and derivatives of a polynomial. J. Anal. 2019, 27, 851–857. [Google Scholar] [CrossRef]
  14. Jain, V.K. A Generalization of Ankeny and Rivlin’s Result on the Maximum Modulus of Polynomials not Vanishing in the Interior of the Unit Circle. Turk. J. Math. 2007, 31, 89–94. [Google Scholar]
  15. Govil, N.K.; Rahman, Q.I.; Schmeisser, G. On the derivative of a polynomial. Ill. J. Math. 1979, 23, 319–329. [Google Scholar] [CrossRef]
  16. Aziz, A.; Rather, N.A. Some Zygmund type Lq inequalities for polynomials. J. Math. Anal. Appl. 2004, 289, 14–29. [Google Scholar] [CrossRef] [Green Version]
  17. Jain, V.K. On Maximum Modulus of Polynomials with Zeros Outside a Circle. Glas. Matematicki 1994, 29, 267–274. [Google Scholar]
  18. Jain, V.K. Converse of an extremal problem in polynomials II. J. Ind. Math. Soc. 1994, 60, 41–47. [Google Scholar]
  19. Aziz, A.; Mohammad, Q.G. Growth of polynomials with zeros outside a circle. Proc. Am. Math. Soc. 1981, 81, 549–553. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Krishnadas, K.; Ngamchui, R.; Chanam, B. Generalized and Extended Versions of Ankeny–Rivlin and Improved, Generalized, and Extended Versions of Rivlin Type Inequalities for the sth Derivative of a Polynomial. Mathematics 2021, 9, 887. https://doi.org/10.3390/math9080887

AMA Style

Krishnadas K, Ngamchui R, Chanam B. Generalized and Extended Versions of Ankeny–Rivlin and Improved, Generalized, and Extended Versions of Rivlin Type Inequalities for the sth Derivative of a Polynomial. Mathematics. 2021; 9(8):887. https://doi.org/10.3390/math9080887

Chicago/Turabian Style

Krishnadas, Kshetrimayum, Reingachan Ngamchui, and Barchand Chanam. 2021. "Generalized and Extended Versions of Ankeny–Rivlin and Improved, Generalized, and Extended Versions of Rivlin Type Inequalities for the sth Derivative of a Polynomial" Mathematics 9, no. 8: 887. https://doi.org/10.3390/math9080887

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop