• No results found

On the derivative and maximum modulus of a polynomial

N/A
N/A
Protected

Academic year: 2020

Share "On the derivative and maximum modulus of a polynomial"

Copied!
6
0
0

Loading.... (view fulltext now)

Full text

(1)

A POLYNOMIAL

K. K. DEWAN, N. K. GOVIL, ABDULLAH MIR, AND M. S. PUKHTA

Received 2 October 2004; Accepted 11 October 2004

Ifp(z)=nv=0avzvis a polynomial of degreen, having all its zeros in|z| ≤1, then it was proved by Tur´an that|p(z)| ≥(n/2) max|z|=

1|p(z)|. This result of Tur´an was generalized by Govil, who proved that ifp(z) has all its zeros in|z| ≤K,K≥1, then max|z|=1|p(z)| ≥ (n/(1 +Kn)) max|z|=1|p(z)|,K≥1. In this paper, we sharpen this, and some other related results.

Copyright © 2006 K. K. Dewan et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

1. Introduction and statement of results

Ifp(z)=nv=0avzvis a polynomial of degreen, then it is well known that

max

|z|=1

p(z)nmax |z|=1

p(z). (1.1)

The above inequality, which is an immediate consequence of Bernstein’s inequality on the derivative of a trigonometric polynomial, is best possible with equality holding for the polynomialp(z)=λzn,λbeing a complex number.

If we restrict ourselves to the class of polynomials having no zeros in|z|<1, then the above inequality can be sharpened. In fact Erd¨os conjectured and later Lax [7] proved that ifp(z)=0 in|z|<1, then

max

|z|=1

p(z)n

2max|z|=1

p(z). (1.2)

If the polynomialp(z) of degreenhas all its zeros in|z| ≤1, then it was proved by Tur´an [9], that

max

|z|=1

p(z)n

2max|z|=1

p(z). (1.3)

Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 2006, Article ID 54816, Pages1–6

(2)

The inequalities (1.2) and (1.3) are also best possible, and become equality for poly-nomials which have all its zeros on|z| =1.

The above inequality (1.3) of Tur´an [9] was generalized by Govil [3], who proved that ifp(z) is a polynomial of degreenhaving all its zeros in|z| ≤K, then

max

|z|=1

p(z) n

1 +Kmax|z|=1

p(z), ifK1, (1.4)

max

|z|=1

p(z) n

1 +Knmax|z|=1

p(z), ifK1. (1.5)

Both the above inequalities are best possible, with equality in (1.4) holding forp(z)= (z+K)n, while in (1.5) the equality holds for the polynomialp(z)=zn+Kn. The inequal-ity (1.4) was also proved by Malik [8].

The inequality (1.5) was later sharpened by Govil [4, page 67], who proved the following theorem.

Theorem1.1. If p(z)=nv=0avzv,an=0, is a polynomial of degreenhaving all its zeros

in|z| ≤K,K≥1, then

max

|z|=1

p(z) n

1 +Knmax|z|=1 p(z)

+ nan−1 K1 +Kn

Kn

1 n −K

n−21

n−2

+a1

1 1 K2

(1.6)

ifn >2, and

max

|z|=1

p(z) n

1 +Knmax|z|=1

p(z)+Kn1

Kn+ 1a1 (1.7)

ifn=2.

The above inequalities are best possible and are attained for the polynomial p(z)=zn+ Kn.

In this paper, we prove the following refinement ofTheorem 1.1, which in turn gives the refinements of inequalities (1.3), and (1.5).

Theorem1.2. If p(z)=nv=0avzv,an=0, is a polynomial of degreenhaving all its zeros

in|z| ≤K,K≥1, then

max

|z|=1

p(z) n

1 +Kn

max

|z|=1

p(z)+ min

|z|=Kp(z) +a1

1K12

+ nan−1 K1 +Kn

Kn1

n −K n−21

n−2

(3)

ifn >2, and

max

|z|=1

p(z) n

1 +Kn

max

|z|=1

p(z)+ min |z|=Kp(z)

+Kn−1

Kn+ 1a1 (1.9)

ifn=2.

Both the above inequalities are best possible and are attained for the polynomialp(z)= zn+Kn.

If we takeK=1 in the above theorem, we get the following result, which was proved by Aziz and Dawood [1].

Corollary1.3. Ifp(z)=nv=0avzv,an=0, is a polynomial of degreenhaving all its zeros

in|z| ≤1, then

max

|z|=1

p(z)n

2

max

|z|=1

p(z)+ min |z|=1

p(z). (1.10)

2. Lemmas

We will need the following lemmas.

Lemma2.1. Ifp(z)is a polynomial of degreen, having all its zeros in|z| ≤1, then

max

|z|=1

p(z)n

2

max

|z|=1

p(z)+ min |z|=1

p(z). (2.1)

The result is best possible and the equality holds for the polynomialp(z)=(z+ 1)n.

The above result is due to Aziz and Dawood [1] (also see Govil [5, Theorem 2, inequal-ity (1.7)]).

Lemma2.2. Ifp(z)=nv=0avzvis a polynomial of degreen, having no zeros on|z|<1, then

forR≥1,

max

|z|=R≥1

p(z)Rn+ 1 2

max

|z|=1|p(z)| − Rn

1 2

min

|z|=1 p(z)

−a1 Rn1

n −R n−21

n−2

, ifn >2,

(2.2)

max

|z|=R≥1|p(z)| ≤

Rn+ 1

2

max

|z|=1

p(z)Rn1 2

min

|z|=1 p(z)

−a1(R−1) n

2 , ifn=2.

(2.3)

(4)

Lemma2.3. Ifp(z)=nv=0avzvis a polynomial of degreen,n≥1, then for allR≥1,

max

|z|=Rp(z)≤R nmax

|z|=1

p(z)

RnRn−2p(0), ifn2, (2.4)

max

|z|=Rp(z)≤Rmax|z|=1

p(z)(R1)p(0), ifn=1. (2.5)

The inequality (2.4) is due to Frappier et al. [2, Theorem 2], while (2.5) follows triv-ially.

3. Proof of the theorem

We first consider the case whenp(z) is degreen >2. Sincep(z) has all its zeros in|z| ≤K, K≥1, the polynomialP(z)=p(Kz) is of degreen, and has all its zeros in|z| ≤1. Hence if we applyLemma 2.1to the polynomialP(z), we will get

max

|z|=1

P(z)n

2

max

|z|=1|P(z)|+ min|z|=1

P(z), (3.1)

which is equivalent to

Kmax

|z|=Kp

(z)n

2

max

|z|=Kp(z)+ min|z|=Kp(z)

. (3.2)

The polynomial p(z) is of degreen >2, and so the polynomialp(z) is of degreen− 1, wheren−12, and hence applyingLemma 2.3to the polynomial p(z), we get for K≥1,

max

|z|=Kp

(z)Kn−1max |z|=1

p(z)Kn−1Kn−3a

1. (3.3)

Combining (3.2) and (3.3), we get forK≥1,

Kn−1max |z|=1

p(z)Kn−1Kn−3a 1 n

2K

max

|z|=Kp(z)+ min|z|=Kp(z)

, (3.4)

which is equivalent to

Knmax

|z|=1

p(z)KnKn−2a 1≥n

2

max

|z|=Kp(z)+ min|z|=Kp(z)

. (3.5)

Since the polynomial p(z) has all its zeros in|z| ≤K,K≥1, the polynomialq(z)= znp(1/z) has no zeros in|z|<1/K, hence the polynomialq(z/K) is of degreen >2, and has no zeros in|z|<1. Therefore, on applyingLemma 2.2to the polynomialq(z/K), we get

max

|z|=K≥1

q(z/K)Kn+ 1 2 max|z|=1

q(z/K)Kn1 2 min|z|=1

q(z/K)

−anK1

Kn1

n −K n−21

n−2

,

(5)

which is equivalent to

max

|z|=1

p(z)Kn+ 1

2Kn max|z|=Kp(z) Kn1

2Kn |minz|=Kp(z)

−anK1

Kn1

n −K n−21

n−2

.

(3.7)

The above inequality easily gives

max

|z|=Kp(z) 2Kn Kn+ 1max|z|=1

p(z)+Kn1

Kn+ 1|minz|=Kp(z)

+ 2Kn− 1

1 +Knan−1

Kn1

n −K n−21

n−2

,

(3.8)

and this when combined with (3.5) gives

2Kn n max|z|=1

p(z)2

KnKn−2

n a1min |z|=Kp(z)

K2nKn + 1max|z|=1

p(z)+Kn1

Kn+ 1|minz|=Kp(z)+ 2Kn−1 1 +Knan−1

Kn1

n −K n−21

n−2

. (3.9)

The above inequality (3.9) is clearly equivalent to

max

|z|=1

p(z)a 1

1 1 K2

+ n

Kn+ 1

max

|z|=1

p(z)+ min |z|=Kp(z)

+ nan−1 K1 +Kn

Kn

1 n −K

n−21

n−2

,

(3.10)

which is inequality (1.8), and thus our theorem, in the casen >2, is proved.

The proof of the theorem in the casen=2 follows on the same lines as above except that instead of inequalities (2.2) and (2.4), we use inequalities (2.3) and (2.5), respectively.

References

[1] A. Aziz and Q. M. Dawood,Inequalities for a polynomial and its derivative, Journal of Approxi-mation Theory54(1988), no. 3, 306–313.

[2] C. Frappier, Q. I. Rahman, and St. Ruscheweyh,New inequalities for polynomials, Transactions of the American Mathematical Society288(1985), no. 1, 69–99.

[3] N. K. Govil,On the derivative of a polynomial, Proceedings of the American Mathematical Soci-ety41(1973), 543–546.

[4] ,Inequalities for the derivative of a polynomial, Journal of Approximation Theory63 (1990), no. 1, 65–71.

[5] ,Some inequalities for derivatives of polynomials, Journal of Approximation Theory66 (1991), no. 1, 29–35.

(6)

[7] P. D. Lax,Proof of a conjecture of P. Erd¨os on the derivative of a polynomial, American Mathemat-ical Society. Bulletin50(1944), 509–513.

[8] M. A. Malik,On the derivative of a polynomial, Journal of the London Mathematical Society. Second Series1(1969), 57–60.

[9] P. Tur´an,Uber die Ableitung von Polynomen¨ , Compositio Mathematica7(1939), 89–95 (Ger-man).

K. K. Dewan: Department of Mathematics, Jamia Millia Islamia, New Delhi 110025, India

E-mail address:[email protected]

N. K. Govil: Department of Mathematics, Auburn University, Auburn, AL 36849-5310, USA

E-mail address:[email protected]

Abdullah Mir: Department of Mathematics, Jamia Millia Islamia, New Delhi 110025, India

References

Related documents

Monier Maher wrote his first games in the 80's and got back to game development when he co-founded AGEIA Technologies in 2002 to accelerate game physics. Now at NVIDIA,

M ake sure your garden tools are sharp for the winter pruning of fruit trees and general chopping back. Sharp tools are easier to use so don’t forget the Telopea Sharpening

According to the NCEA (National Center on Elderly Abuse), &#34;30% of adults with disabilities, who used PAS for support of activities of daily living, reported one or more types

While social workers play a role in the production and distribution mechanisms of social welfare as a professional structure within the state, they should take a

Night dreaming was reported in 79% of all REM awakenings, more often in phasic (84%) than in tonic (73%) REM, with no significant difference as to phasic/tonic. Mood after

Brandewinder M, Berthomier C, Gouin J-P, Sleep spindles may predict response to cognitive behavioral therapy for chronic insomnia, Sleep Medicine (2017),

(A) A single spindle event displayed as smoothed multiunit activity in VB (red) together with TC cells (black) and nRT terminals (magenta) recorded by the same electrode shank

144, D-86165 Augsburg, Tel.: +49 (0) 8 21/7 97-40 00, Fax: +49 (0) 8 21/7 97-16 16, http://www.kuka-roboter.de I 25.5.99 I CollegeI D I 247 Configuration error.