• No results found

On the maximum modulus of a polynomial and its polar derivative

N/A
N/A
Protected

Academic year: 2020

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

Copied!
9
0
0

Loading.... (view fulltext now)

Full text

(1)

R E S E A R C H

Open Access

On the maximum modulus of a polynomial and

its polar derivative

Ahmad Zireh

Correspondence: [email protected] Department of Mathematics, Shahrood University of Technology, Shahrood, Iran

Abstract

For a polynomialp(z) of degreen, having all zeros in |z| ≤1, Jain is shown that

max

|z|=1

Dαt· · ·21p(z)≥

n(n−1)· · ·(nt+ 1)

2t ×[

{(|α1| −1)· · ·(|αt| −1)}max |z|=1p(z)+

2t(|α1| · · · |αt|)− {(|α1| −1)· · ·(|αt| −1)}

min

|z|=1 p(z)

,

|α1| ≥1, |α2| ≥1,· · · |αt| ≥1, (t<n).

In this paper, the above inequality is extended for the polynomials having all zeros in |z|≤k, wherek≤1. Our result generalizes certain well-known polynomial

inequalities.

(2010) Mathematics Subject Classification. Primary 30A10; Secondary 30C10, 30D15.

Keywords:Polar derivative, Polynomial, Inequality, Maximum modulus, Zeros

1. Introduction and statement of results

Let p(z) be a polynomial of degree n, then according to the well-known Bernstein’s inequality [1] on the derivative of a polynomial, we have

max

|z|=1p

(z)nmax

|z|=1p(z). (1:1)

This result is best possible and equality holding for a polynomial that has all zeros at the origin.

If we restrict to the class of polynomials which have all zeros in |z|≤ 1, then it has been proved by Turan [2] that

max

|z|=1p

(z) n

2max|z|=1p(z). (1:2)

The inequality (1.2) is sharp and equality holds for a polynomial that has all zeros on |z| = 1.

As an extension to (1.2), Malik [3] proved that ifp(z) has all zeros in |z|≤k, where

k≤1, then

(2)

max

|z|=1

p(z)≥ n 1 +kmax|z|=1

p(z). (1:3)

This result is best possible and equality holds for p(z) = (z-k)n.

Aziz and Dawood [4] obtained the following refinement of the inequality (1.2) and proved that ifp(z) has all zeros in |z|≤1, then

max

|z|=1p

(z) n

2

max

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

. (1:4)

This result is best possible and equality attains for a polynomial that has all zeros on |z| = 1.

Let Dap(z) denote the polar differentiation of the polynomialp(z) of degree nwith respect to a Î ℂ. Then, Dap(z) = np(z) + (a- z)p’(z). The polynomialDap(z) is of degree at most n- 1, and it generalizes the ordinary derivative in the sense that

lim α→∞

Dαp(z)

α

=p(z).

Shah [5] extended (1.2) to the polar derivative of p(z) and proved that if all zeros of the polynomialp(z) lie in |z|≤1, then for everyawith |a|≥1, we have

max

|z|=1

Dαp(z)≥ n

2(|α| −1)max|z|=1

p(z). (1:5)

This result is best possible and equality holdsas p(z) = (z- 1)nwitha≥1.

Aziz and Rather [6] generalized (1.5) by extending (1.3) to the polar derivative of a polynomial. In fact, they proved that if all zeros of p(z) lie in |z|≤k, wherek≤1, then for everya with |a|≥k, we get

max

|z|=1

Dαp(z)≥ n

1 +k(|α| −k)max|z|=1

p(z). (1:6)

This result is best possible and equality holds for p(z) = (z-k)nwitha≥k.

In the same paper, Aziz and Rather [6] sharpened the inequality (1.5) by proving that if all the zeros ofp(z) lie in |z|≤1, then for everyawith |a|≥1, we would obtain

max

|z|=1Dαp(z)≥ n

2

(|α| −1)max

|z|=1p(z)+(|α| −1)min|z|=1p(z)

. (1:7)

This result is best possible and equality attains for p(z) = (z- 1)nwitha≥1.

As an extension to the inequality (1.7), Jain [7] proved that ifp(z) has all zeros in |z|

≤1, then for alla1,...atÎ ℂwith |a1|≥1, |a2|≥1, ..., |at|≥1, (1≤t<n), we have

max

|z|=1Dαt· · ·21p(z)≥

n(n−1)· · ·(nt+ 1)

2t [

{(|α1| −1)· · ·(|αt| −1)}max |z|=1p(z)+

2t(|α1| · · · |αt|)− {(|α1| −1)· · ·(|αt| −1)}

min

|z|=1p(z)

,

(3)

where

DαjDαj−1· · ·1p(z) =pj(z) =

(nj+ 1)pj−1(z) + (αjz)pj−1(z), j= 1, 2,· · · ,t, p0(z) =p(z).

This result is best possible and equality holds asp(z) = (z- 1)nwitha1≥1,a2≥1,...,

at≥1.

The following result proposes an extension to (1.8). In a precise set up, we have

Theorem 1.1.Let p(z)be a polynomial of degree n having all zeros in|z|≤k,where k

≤1,then for alla1, ...atÎℂwith|a1|≥k, |a2|≥k,..., |at|≥k, (1≤t<n),

max

|z|=1Dαt· · ·21p(z)≥

n(n−1)· · ·(nt+ 1) (1 +k)t [

{(|α1| −k)· · ·(|αt| −k)}max |z|=1

p(z)+

(1 +k)t(|α1| · · · |αt|)− {(|α1| −k)· · ·(|αt| −k)}

knmin

|z|=kp(z)

.

(1:9)

This result is best possible and equality holds for p(z) = (z-k)nwitha1≥k,a2 ≥k,...,

at≥k.

If we takek= 1 in Theorem 1.1, then inequality (1.9) reduces to inequality (1.8).

If we take t= 1 in Theorem 1.1, the following refinement of inequality (1.6) can be

obtained.

Corollary 1.2. Letp(z) be a polynomial of degreen, having all zeros in |z|≤k, where

k≤1, then for everyaÎℂwith |a|≥k,

max

|z|=1Dαp(z)≥ n

1 +k

(|α| −k)max

|z|=1p(z)+(|α|+ 1)k

−(n−1)min |z|=kp(z)

. (1:10)

This result is best possible and equality occurs ifp(z)=(z - k)nwitha≥k.

If we divide both sides of the above inequality in (1.10) by |a| and make |a| ®∞,

we obtain a result proved by Govil [8].

2. Lemmas

For proof of the theorem, the following lemmas are needed. The first lemma is due to Laguerre [9].

Lemma 2.1.If all the zeros of an nth degree polynomial p(z)lie in a circular region C and w is any zero of Dap(z),then at most one of the points w andamay lie outside C.

Lemma 2.2.If p(z)is a polynomial of degree n, having all zeros in the closed disk|z|

≤k,k≤1,then on|z| = 1,

p(z)≥ n

1 +kp(z). (2:1)

This lemma is due to Govil [10].

Lemma 2.3.If p(z)is a polynomial of degree n, having no zeros in|z| <k,k≥1,then on|z| = 1,

kp(z)≤q(z), (2:2)

(4)

The above lemma is due to Chan and Malik [11].

Lemma 2.4.If p(z)is a polynomial of degree n, having all zeros in the closed disk|z|

≤k,k≤1,then on|z| = 1,

q(z)≤kp(z), (2:3)

where q(z) =znp(1/¯z).

Proof. Sincep(z) has all its zeros in |z|≤ k, k≤1, thereforeq(z) has no zero in |z| < 1/k, 1/k≥1. Now applying Lemma 2.3 to the polynomialq(z) and the result follows.

Lemma 2.5.If p(z)is a polynomial of degree n, having all zeros in the closed disk|z|

≤k,k≤1,then for every real or complex numberawith|a|≥k and|z| = 1,we have

Dαp(z)≥ n

1 +k(|α| −k)p(z). (2:4)

Proof. Let q(z) =znp(1/z¯), then |q’(z)| = |np(z) - zp’(z)| on |z| = 1. Thus, on |z| = 1, we get

Dαp(z)=np(z) + (αz)p(z)=αp(z) +np(z)−zp(z)≥

αp(z)− |np(z)−zp(z),

that implies

Dαp(z)≥ |α|p(z)−q(z). (2:5)

By combining (2.3) and (2.5), we obtain

Dαp(z)≥(|α| −k)p(z).

that along Lemma 2.2, yields

Dαp(z)≥ n

1 +k(|α| −k)p(z).

Lemma 2.6.If p(z) =a0+a1z+

n

i=2aiz

iis a polynomial of degree n, having no zeros

in|z| <k,k≥1,then

k|a1| |a0| ≤

n. (2:6)

The above lemma is due to Gardner et al. [12].

Lemma 2.7.If p(z) =ni=0aiziis a polynomial of degree n, having all zeros in|z|≤k,

k≤1,then

|an−1| |an| ≤

nk. (2:7)

Proof. Sincep(z) has all zeros in |z|≤k,k≤1, therefore

q(z) =znp(1/¯z) =an+an−1z+· · ·+a1zn−1+a0zn,

(5)

1

k|an−1|

|an| ≤

degree{q(z)} ≤n,

which completes the proof.

Lemma 2.8.If p(z)is a polynomial of degree n having all zeros in|z|≤k, k≤1,then for alla1, ...atÎℂwith|a1|≥k, |a2|≥k,..., |at|≥k, (1≤t<n),and|z| = 1we have

Dαt· · ·Dα21p(z)≥

n(n−1)· · ·(nt+ 1) (1 +k)t ×

{(|α1| −k)· · ·(|αt| −k)}p(z).

(2:8)

Proof. If |aj| = kfor at least onej; 1≤j≤t, then inequality (2.8) is trivial. Therefore,

we assume that |aj| >kfor allj; 1≤j≤t.

In the rest, we proceed by mathematical induction. The result is true for t= 1, by

Lemma 2.5, that means if |a1| >kthen 1p(z)≥

n

1 +k(|α1| −k)p(z). (2:9)

Now fort= 2, since Dα1p(z) =(nanα1+an−1)z

n−1+· · ·+(na

0+α1a1), and |a1| >k,

then Dα1p(z) will be a polynomial of degree (n - 1). If it is not true, then the

coeffi-cient of zn-1must be equal to zero, which implies

nanα1+an−1= 0,

i.e,

|α1|= | an−1| n|an| .

Applying Lemma 2.7, we get

|α1|= |an−1| n|an| ≤

k.

But this result contradicts the fact that |a1| >k. Hence, the polynomial 1p(z) must

be of degree (n- 1).

On the other hand, since all the zeros of p(z) lie in |z| ≤k, therefore by applying Lemma 2.1, all the zeros of Dα1p(z) lie in |z|≤k, then using Lemma 2.5 for the

poly-nomial Dα1p(z) of degreen- 1, and |a2 | >k, it concludes that Dα2

Dα1p(z)≥

(n−1)

1 +k (|α2| −k)Dα1p(z).

Substituting the term 1p(z) from (2.9) in the above inequality, we obtain

Dα21p(z)≥

n(n−1)

(1 +k)2 (|α1| −k) (|α2| −k)p(z).

This implies result is true fort= 2.

(6)

Dαs· · ·21p(z)≥

n(n−1)· · ·(ns+ 1) (1 +k)s ×

{(|α1| −k)· · ·(|αs| −k)}p(z),

(2:10)

and we will prove that the result is true fort=s+ 1 <n.

According to the above procedure, using Lemmas 2.7 and 2.1, the polynomial

2Dα1p(z)must be of degree (n- 2) for |a1| >k, |a2| >k, and has all zeros in |z|≤k.

One can continue that Dαs· · ·21p(z) will be a polynomial of degree (n-s) for all

a1,...as Î ℂwith |a1| ≥k, |a2| ≥k,..., |as|≥ k, (s <n), and has all zeros in |z|≤ k.

Therefore, for |as+1| >k, by applying Lemma 2.5 to Dαs· · ·21p(z), we get Dαs+1

Dαs· · ·2Dα1p(z)≥

(ns)

1 +k (|αs+1| −k)Dαs· · ·2Dα1p(z). (2:11)

By combining the terms (2.10) and (2.11), we obtain

Dαs+1Dαs· · ·21p(z)≥

n(n−1)· · ·(ns) (1 +k)s+1 ×

{(|α1| −k)· · ·(|αs+1| −k)}p(z).

This implies that the result is true fort=s+ 1. The proof is complete.

Lemma 2.9. If p(z) =ni=0aizi isa polynomial of degree n, p(z)≠0in|z| <k,then m

< |p(z)|for|z| <k, and in particular m< |a0|,where m= min|z|=k|p(z)|.

The above lemma is due to Gardner et al. [13].

Lemma 2.10.If p(z) =ni=0aiziis a polynomial of degree n having all zeros in|z|≤

k, then

mkn|an|, (2:12)

where m= min|z|=k|p(z)|.

Proof. If k= 0, then inequality (2.12) is trivial. Now we suppose thatk> 0. Since the polynomial p(z) =ni=0aizi has all zeros in |z|≤k, the polynomial q(z) =znp(1/z) =

an+ ... +a0znhas no zero in |z|< 1k. Thus, by applying Lemma 2.9 for the polynomial

q(z), we get

min

|z|=1

k

q(z)<|an|.

(2:13)

Since min|z|=1

k

q(z)= k1nmin|z|=kp(z), (2.13) implies that m

kn <|an|.

3. Proof of the theorem

Proof of Theorem 1.1. Letm= min|z|=k |p(z)|. Ifp(z) has a zero on |z| =k, thenm=

0 and the result follows from Lemma 2.8. Henceforth, we suppose that all the zeros of

(7)

G(z) =p(z)−λ(m

kn)z

n, hence the polynomial G(z) =p(z)λ(m

kn)z

n is of degree n.

Now we can apply Lemma 2.8 for the polynomialG(z) of degreenwhich has all zeros

in |z|≤k. This implies that for all a1,... atÎℂwith |a1|≥k, |a2|≥k, ..., |at|≥k, (t

<n), on |z| = 1,

Dαt· · ·21G(z)≥

n(n−1)· · ·(nt+ 1) (1 +k)t ×

{(|α1| −k)· · ·(|αt| −k)}G(z).

Equivalently

Dαt· · ·21p(z)−λ m kn

n(n−1)· · ·(nt+ 1)α1α2· · ·α1

znt

n(n−1)· · ·(nt+ 1)

(1 +k)t {(|α1| −k)· · ·(|αt| −k)}

p(z)−λm z

k n

.

(3:1)

But by Lemma 2.1, the polynomial T(z) =Dαt· · ·21G(z) has all zeros in |z|≤k.

That is,

T(z) =Dαt· · ·21G(z)= 0, for |z|>k.

Then, substitutingG(z) in the above, we conclude that for everylwith |l| < 1, and |

z| >k,

T(z) =Dαt· · ·21p(z)−

λm

kn

n(n−1)· · ·(nt+ 1)α1α2· · ·αt

znt= 0. (3:2)

Thus, for |z| >k,

Dαt· · ·21p(z)≥ m kn

n(n−1)· · ·(nt+ 1)|α1| |α2| · · · |αt| znt. (3:3)

If the inequality (3.3) is not true, then there is a point z=z0 with |z0| >ksuch that Dαt· · ·21p(z0)<

m kn

n(n−1)· · ·(nt+ 1)|α1| |α2| · · · |αt| zn0−t.

Now take

λ= Dαt· · ·21p(z0)

m kn

n(n−1)· · ·(nt+ 1)α1α2· · ·αt

zn0t,

then |l| < 1 and with this choice ofl, we have,T(z0) = 0 for |z0| >k, from (3.2). But

it contradicts the fact thatT(z)≠0 for |z| >k. Hence, for |z| >k, we have

Dαt· · ·21p(z)≥ m kn

n(n−1)· · ·(nt+ 1)|α1| |α2| · · · |αt| znt.

Taking a relevant choice of argument of l, arg

λ= argDαt· · ·21p(z)

−argα1α2· · ·αtznt

(8)

|Dαt· · ·21p(z)−

λm

kn

n(n−1)· · ·(nt+ 1)α1α2· · ·αt

znt|=

|Dαt· · ·21p(z)− |λ|m

kn

n(n−1)· · ·(nt+ 1)|α1||α2| · · · |αt|

|znt|,

where |z| = 1.

Therefore, we can rewrite (3.1) as

Dαt· · ·21p(z)− |λ| m

kn

n(n−1)· · ·(nt+ 1)|α1| |α2| · · · |αt|

znt

n(n−1)· · ·(nt+ 1)

(1 +k)t {(|α1| −k)· · ·(|αt| −k)}

p(z)− |λ|m

kn|z| n,

where |z| = 1. In an equivalent way

Dαt· · ·21p(z)≥

n(n−1)· · ·(nt+ 1) (1 +k)t [

(|α1| −k)· · ·(|αt| −k)p(z)+ |λ|(1 +k)t(|α1| |α2| · · · |αt|)− {(|α1| −k)· · ·(|αt| −k)}

m

kn].

Making |l|®1, Theorem 1.1 follows.

Acknowledgements

The author is grateful to the referees, for the careful reading of the paper and for the helpful suggestions and comments. This research was supported by Shahrood University of Technology.

Competing interests

The author declares that they have no competing interests.

Received: 25 April 2011 Accepted: 10 November 2011 Published: 10 November 2011

References

1. Bernstein, S: Leons sur les Proprits Extrmales et la Meilleure Approximation des Fonctions Analytiques dune Variable relle. Gauthier Villars, Paris (1926)

2. Turan, P: Uber die ableitung von Polynomen. Compositio Math.7, 89–95 (1939)

3. Malik, MA: On the derivative of a polynomial. J Lond Math Soc.1, 57–60 (1969). doi:10.1112/jlms/s2-1.1.57

4. Aziz, A, Dawood, QM: Inequalities for a polynomial and its derivative. J Approx Theory.54, 306313 (1988). doi:10.1016/ 0021-9045(88)90006-8

5. Shah, WM: A generalization of a theorem of Paul Turan. J Ramanujan Math Soc.1, 6772 (1996)

6. Aziz, A, Rather, NA: A refinement of a theorem of Paul Turan concerning polynomials. Math Ineq Appl.1, 231–238 (1998)

7. Jain, VK: Generalization of an inequality involving maximum moduli of a polynomial and its polar derivative. Bull Math Soc Sci Math Roum Tome.98, 67–74 (2007)

8. Govil, NK: Some inequalities for derivative of polynomials. J Approx Theory.66, 29–35 (1991). doi:10.1016/0021-9045(91) 90052-C

9. Laguerre, E: OEuvres. Vol. pp. 4866. Chelsea, New York, 21,

10. Govil, NK: On the derivative of a polynomial. Proc Am Math Soc.41, 543–546 (1973). doi:10.1090/S0002-9939-1973-0325932-8

11. Chan, TN, Malik, MA: On Erdoös-Lax Theorem. Proc. Indian Acad Sci.92, 191–193 (1983). doi:10.1007/BF02876763 12. Gardner, RB, Govil, NK, Weems, A: Some results concerning rate of growth of polynomials. East J on Approx.10,

301–312 (2004)

(9)

doi:10.1186/1029-242X-2011-111

Cite this article as:Zireh:On the maximum modulus of a polynomial and its polar derivative.Journal of

Inequalities and Applications20112011:111.

Submit your manuscript to a

journal and benefi t from:

7Convenient online submission

7Rigorous peer review

7Immediate publication on acceptance

7Open access: articles freely available online

7High visibility within the fi eld

7Retaining the copyright to your article

References

Related documents

Key words: antitrust damage; consumers; arbitration; alternative dispute resolution; mediation; consensual dispute resolution; Lithuania; private enforcement of competition

emphasize, that because of increasing demands on safety and quality foods, actors of the food and feed chains continuously have to work on innovations of products, processes and

Witchcraft or the power of witches and wizards relate with individual and family’s income, health of people, success level, favour, and stress condition.. The different types

An axonemal location of phospho- tyrosine proteins was also supported by flagellum extraction of procyclic form cells and staining with the anti-phosphotyrosine 4G10 antibody (Fig..

1.Item Size: Size of a data item in bytes; 2.DatabaseSize: Size of database in data items; 3.NumClients: Number of mobile client hosts; 4.ClientQryTime: Service time for a

The parasites removal efficiencies and mean concentrations for treated wastewater in African treatment plants also vary between the types of treatment systems.. According to

KEYWORDS: piecewise affine systems, region of stability, limit cycle, convex optimization, genetic

Melanoma secondary prophylaxis consists of regular self− and clinical examination of the skin in order to diagnose tumors at an early stage and to identify individuals at increased