International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169

Volume: 5 Issue: 7 457 – 481

_______________________________________________________________________________________________
Some Special Functions of Complex Variable

Dr. T. Ravi
Assistant Professor (Contract Basis) In Mathematics,
University College Of Engineering (K.U.),
Kothagudem-507101, Telangana, India.
Mobile: 9701409620,
E-Mail address: [email protected] & [email protected]

Abstract: Main aim of this article is the discussion of Univalent complex functions, Cap like complex functions, and star
like complex functions, close-to-cap like complex functions.

Keywords: Univalent function; BEIRBARBACH Conjecture; Cap like function; Star like function; KOEBE’s
function; HADAMARD Product (Convolution). Close-to-Cap like functions.
__________________________________________________*****_________________________________________________

Introduction: We know that a complex valued function is said to be regular or analytic in a domain D (a non-
empty open connected subset of the complex plane £ ) if it has a uniquely determined derivative at each point of D.

Definition 1: A function f( z ) is said to be a univalent in a domain D if f( z1 )  f( z2 ) for all { z1 , z2 }  D with

z1  z2 .
A necessary condition for analytic function f( z ) to be univalent in D is f ( z )  0 in D. This condition is not
sufficient since f( z )  e z is clearly not univalent since f(0)  e0  1  e 2  f(2 ) but f ( z )  e z  0 .
By Riemann mapping theorem, one function may map any simply connected domain onto the open unit disc in a
one-one conformal manner. Hence, without loss of generality, we confine our attention to the functions that are
univalent and analytic in the open unit disc { z | z |  1} .

Notation: We denote by A the class of functions f( z ) that are analytic in the open unit disc { z | z |  1} with the
conditions f(0)  0, f (0)  1 . Then we say that
f( z )  A  f( z )  
k 0 ak z ,| z | 1 with a0  0, a1  1
k
 f( z )  z  
k 2 ak z ,| z | 1.
k

We denote by U the class of functions f( z )  A and are univalent in an open disc { z | z |  c  1} .

BEIRBARBACH Conjecture: In 1916, BEIRBERBACH proved that | a2 |  2 for every f( z ) in U whose

Taylor’s expansion about the origin is f( z )  z  
k 2 ak z .He also showed that | a2 |  2 for the function
k

f( z )  z(1   z )2 , |  |  1 , which is known as KOEBE’s function. Note that singularity of KOEBE’s function is
z   1 which is outside the open unit disc { z | z |  1} since | z |  |  1 |  |  |1  1 ; thus KOEBE’s function is
analytic in the open unit disc { z | z |  1} . And f ( z )  z(2)(1   z )3 ( )  1(2)(1   z )2 implies
f (0)  0(2)(1   0) ( )  1(1   0)  1.
3 2

Clearly f(0)  0. So KOEBE’s function is in U .

457
IJRITCC | July 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 7 457 – 481
_______________________________________________________________________________________________
Motivated by the extremal property of the KOEBE’s function , BEIRBERBACH conjectured that
| an |  n ( n  2, 3, 4,) for every f( z )  U . This is known as BEIRBERBACH conjecture which is a
challenging problem in mathematics that took almost 70 years to prove it . LOUIS BRANZES has
proved the conjecture in full in 1985.

Problem : f( z )    k
k 0 ak z is univalent  c f( z ) is univalent in { z | z |  c  1}.

Proof : Let f( z )  z   
k 2 ak z
k
 c f( z )  cz   
k 2 ak cz  g( z ) where 0  c  1.
k

f( z )  z   
k 2 ak z is univalent in the disc { z | z |  1}
k

 f( z1 )  f( z2 ) { z1 , z2 }  { z | z |  1} with z1  z2
 c f( z1 )  c f( z2 ) { z1 , z2 }  { z | z |  1} with z1  z2
 g( z1 )  g( z2 ) { z1 , z2 }  { z | z |  1} with z1  z2

 c f( z )  cz   
k 2 ak cz  g( z ) is univalent in the disc { z | z |  1}. / /
k

Theorem 1 : If f( z )  U, then | ak |  1 ( k  2, 3, 4,) where ak is coefficient of z k in

taylor series of f( z ).
Proof : Let f( z )  U  | ak |  k ( k  2, 3, 4,) by BEIRBERBACH conjecture.

And f( z )  z    k
k 2 ak z .

Put g( z )  z f ( z )  z[1   
k 2 kak z
k 1
]  z   k 2 kak z k  z   k 2 bk z k where bk  kak

Let z1  z2 . Then z1k  z 2k . Then ak z 1k  ak z 2k ( k  2, 3, 4,). But we say that the

inequality z1   nk 2 ak z1k  z2   nk 2 ak z 2k may or may not hold . So we can do some work .

Since z1  z2 , we have z1  z2  0  | z1  z2 |  0  0  | z1  z2 | .
Let   | z1 |  | z2 | r  1  r    | z2 |  | z1 |  | z2  z1 | by triangle inequality.

Consider g( z1 )  g( z2 )  z1 f ( z1 )  z2 f ( z2 )  [ z1    k 
k 2 kak z1 ]  [ z2   k 2 kak z2 ]
k

i .e. g( z1 )  g( z2 )  z1  z2  [  k  k 
k 2 kak z1   k 2 kak z2 ]  z1  z2   k 2 kak [ z1  z2 ]
k k

By triangle inequality, | z1  z2   k 2 kak [ z1k  z2k ]|  | z1  z2 |  |  k 2 kak [ z1k  z2k ]|

 g( z1 )  g( z2 )  | z1  z2 |  |   k k 
k 2 kak [ z1  z2 ]|  r    |  k 2 kak [ z1  z2 ]|
k k

Again by triangle inequality, we have

|  k 2 kak [ z1k  z2k ]|   nk 2 | kak [ z1k  z2k ]|   k 2 k | ak || z1k  z2k |   k 2 kk [| z1k |  | z2k |]
i .e. |  k 2 kak [ z1k  z2k ]|   k 2 k 2 [| z1 |k  | z2 |k ]   k 2 k 2[r k  r k ]   k 2 k 2 2r k .
i .e. |  k 2 kak [ z1k  z2k ]|  2 k 2 k 2 r k  2 
k 2[ k ( k  1)  k ] r
k

i .e. |  k 2 kak [ z1k  z2k ]|  2[ k 2 k ( k  1)r k   k 2 k r k ]

i .e. |  k 2 kak [ z1k  z2k ]|  2[r 2  k 2 k ( k  1)r k 2  r  k 2 k r k 1 ]
458
IJRITCC | July 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 7 457 – 481
_______________________________________________________________________________________________
 2  2  
i .e. |  k 2 kak [ z1k  z2k ]|  2r 2  d 2 r k  2r  d r k  2r 2 d 2  r k  2r d  r k
k 2 dr k 2 dr dr k 2 dr k 2
2  
i .e. |  k 2 kak [ z1k  z2k ]|  2r 2 d 2  1  r   r k   2r  1  r   r k 
d
dr  k 0  dr  k 0 
2
1  1 
i .e. |  k 2 kak [ z1k  z2k ]|  2r 2 d 2  1  r   2r  1  r 
d
dr  1  r  dr  1  r 

i .e. |  k 2 kak [ z1k  z2k ]|  2r 2 0  2  

 2r  1 
1   2r
 2r  1
1 
 (1  r )3   (1  r )2
  (1  r )3
(1  r )2 

i .e. |  k 2 kak [ z1k  z2k ]|  2r 2r  1 3r  1  2r  r 1 

 1
 (1  r ) (1  r )
3
 
 r 1   r 1 
 k 2 kak [ z1  z2 ]|  2r 
 |   1  2r 1 
k k
3
(1  r )  (1  r ) 
3

Thus we have

   2( r  1) 
| g( z1 )  g( z2 ) |  r    |  k 2 kak [ z1k  z2k ]|  r    2r 1  r  1 3   r 3  3

 (1  r )   (1  r ) 
By taking limit   | z1 | 0 on both sides since either 0  | z1 | | z2 | or 0  | z1 | | z2 |,

 2( r  1)   2( r  1)   2( r  1) 
| g( z1 )  g( z2 ) |  r 3  3
 lim  0   r 3  3
 0  r 3  3
.
 (1  r )   (1  r )   (1  r ) 
Hence, for | g( z1 )  g( z2 ) |  0 i .e. g( z1 )  g( z2 ), we must have
2r  2 2r  2
3 0  3
(1  r )3 (1  r )3

 3(1  r )3  2r  2 ( r  1 i .e. 0  1  r )  3[1  r 3  3r (1  r )]  2r  2

 3  3r 3  9r  9r 2  2  2r  1  11r  9r 2  3r 3  0
1 1 1
 1  11  9 2  3 3  0 ( rR  1, where R  1 since r  1)
R R R
 R3  11R2  9R  3  0  R3  11R2  9R  3  R( R2  11R  9)  3

 ( 11)  ( 11)2  4(1)9  ( 11)  ( 11)2  4(1)9

 R R    R  3
 2  2 
11  121  36   11  121  36
 R  R    R   3
 2  2

11  121  36   11  121  36

 R  R    R    3
 2 2

11  85  11  85
 R  R    R    3  0 ( 85  9.2195)
 2 2

 Either R  11  85  11  9.2195  2.2195  1.10975,

 2 2 2
 
or R  11  85  11  9.2195  20.2195  10.10975
 2 2 2
459
IJRITCC | July 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 7 457 – 481
_______________________________________________________________________________________________
Suppose that

11  85 11  85
1 R   i .e. 1  R  1.10975  10.10975
2 2
 0  1.10975  R  1.10975  1  0.10975, 0  10.10975  R  10.10975  1  9.10975
 0  [1.10975  R][10.10975  R]  (0.10975)(9.10975)  0.999795
 0  R[ R  1.10975][ R  10.10975]  1.10975(0.999795)  1.10952257  3
This is contradiction . Thus our supposition is wrong . Hence we have

11  85 1 11  85 2 2(11  85) 2(11  85)

R    r  
2 r 2 11  85 121  85 36
11  85
i .e. 0    | z1 |  | z2 |  r   0.0989  1.
18
Thus, for 0    | z1 |  | z2 | r  c  1, we have

 c  11  85  0.0989  1  ,  2(1  r ) 
  | g( z1 )  g( z2 ) |  r 3   0
 18   (1  r )3 

i .e. g( z1 )  g( z2 ) i .e. g( z )  z   
k 2 bk z is univalent in { z | z |  c  1}.
k

 | bk |  k ( k  2, 3, 4,) by BEIRBERBACH conjecture

 | k ak |  k or k | ak |  k ( k  2, 3, 4,)  | ak |  1 ( k  2, 3, 4,). / /

Theorem 2 : f( z )  z    1
k 2 ak z in | z |  1 is univalent in { z | z |  3  1}.
k

Proof : Let f( z )  z   
k 2 ak z is univalent in the open disc { z | z |  c  1}.
k

 | ak |  1 ( k  2, 3, 4,) by Theorem1.
Let z1  z2  z1  z2  0  | z1  z2 |  0  0  | z1  z2 | .
Let   | z1 |  | z2 | r  1  r    | z2 |  | z1 |  | z1  z2 | by triangle inequality.
Consider

f( z1 )  f( z2 )  | [ z1    k  k 
k 2 ak z1 ]  [ z2   k 2 ak z2 ] |  | z1  z2   k 2 ak [ z1  z2 ] | .
k k

By triangle inequality, | z1  z2   k 2 ak [ z1k  z2k ] |  | z1  z2 |  |  k 2 ak [ z1k  z2k ]|

 f( z1 )  f( z2 )  | z1  z2 |  |   k k 
k 2 ak [ z1  z2 ]|  r    |  k 2 ak [ z1  z2 ]|
k k

Again by triangle inequality, we have

|  k 2 ak [ z1k  z2k ]|   nk 2 | ak [ z1k  z2k ]|   k 2 | ak || z1k  z2k |   k 2 1 [| z1k |  | z2k |]

i .e. |  k 2 ak [ z1k  z2k ]|   k 2 [| z1 |k  | z2 |k ]   k 2[r k  r k ]   k 2 2 r k  2 k 2 r k
1 1  (1  r ) 
i .e. |  k 2 ak [ z1k  z2k ]|  2   k 0 r k  1  r   2   1  r   2   r
1  r 
  1r 
1
i .e. |  k 2 ak [ z1k  z2k ]|  2  r
 r   2r   1
1  r  1  r 
460
IJRITCC | July 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 7 457 – 481
_______________________________________________________________________________________________
Thus we have

| f( z1 )  f( z2 ) |  r    |  k 2 ak [ z1k  z2k ]|  r    2r 1  1   r 3  2   
 1  r   1  r 
By taking limit   | z1 | 0 on both sides since either 0  | z1 |  | z2 | or 0  | z1 |  | z2 |,

| f( z1 )  f( z2 ) |  r 3  2   lim  0   r 3  2   0  r 3  2  .
 1  r   1  r   1  r 
Hence, for | f( z1 )  f( z2 ) |  0 i .e. f( z1 )  f( z2 ), we must have
2 2
3 0  3  3(1  r )  2 ( r  1 i .e. 0  1  r )
1r 1r
 3  3r  2  1  3r  3r  1  r  31

Therefore f( z )  z    1
k 2 ak z is univalent in the open disc { z | z |  3  1}. / /
k

Definition 2 : A function f( z )  z   
k 2 ak z in | z |  1 is said to be cap like function
k

in the open disc { z | z |  c  1} if

z f ( z ) 
Re 1   0, | z |  c.
 f ( z ) 

Definition 3 : A function f( z )  z   
k 2 ak z in | z |  1 is said to be star like function in
k

the open disc { z | z |  c  1} if f( z ) univalent in { z | z |  c  1}, and

z f ( z ) 
Re   0, | z |  c.
 f( z ) 

Theorem 3 : If f( z )  U, then f( z ) is cap like function in { z | z |  61  1}.

Proof : Let f( z )  U . Then | ak |  1 ( k  2, 3, 4,) by Theorem1;

And f( z )  z    1
k 2 ak z is univalent in { z | z |  3 } by Theorem2. Let us consider
k

z f ( z )  z f ( z ) 
Re 1    1  Re  .
 
f ( z)   f ( z ) 
We know that
2 2
 Re  z f ( z )    z f ( z )  
z f ( z )
 Re 
z f ( z )  z f ( z )

  f ( z )   f ( z ) f ( z )  f ( z )  f ( z )
z f ( z ) z f ( z )  z f ( z ) 
 1  1  Re    Re 1 
f ( z )  f ( z )   f ( z ) 
z f ( z )  z f ( z ) z f ( z ) f ( z )  z f ( z )
 Re 1   1 1 
 f ( z )  f ( z ) f ( z ) f ( z )

We have f ( z )  1   
k 2 ak kz
k 1
 f ( z )   
k 2 ak k ( k  1) z
k 2

 z f ( z )  |  
k 2 ak k ( k  1) z
k 1
|  k 2| ak | k ( k  1) | z |k 1   k 2 1k ( k  1) | z |k 1
461
IJRITCC | July 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 7 457 – 481
_______________________________________________________________________________________________
By Triangle inequality, f ( z )  | 1   
k 2 ak k z
k 1
|  1  |  k 2 ak k z k 1 |
But |  k 2 ak k z k 1 |   k 2| ak | k | z |k 1   k 2 1k | z |k 1   k 2 k | z |k 1
Put | z | r  z f ( z )   
k 2 ( k  k ) r
2 k 1
, and f ( z )  1   
k 2 k r
k 1

 f ( z )  z f ( z )  1   
k 2 k r
k 1
 
k 2 ( k  k ) r
2 k 1
 1   2 k 1
k 2 k r .

We have

 2 k 1
k 2 k r  
k 2[ k ( k  1)  k ] r
k 1
 
k 2 k ( k  1) r
k 1
 
k 2 k r
k 1

 
k 2 k ( k  1) r
k 1
 
k 2 k r
k 1
 r 
k 2 k ( k  1) r
k 2
 
k 2 k r
k 1
.
 d2 k  d k d2  d   d2 d  
i .e.  2 k 1
k 2 k r r  2
r   r  r 2  r k   r k  r 2    r k
k 2 dr k 2 dr dr k 2 dr k 2  dr dr  k 2
 d2 d    d2 d  1
i .e.  2 k 1
k 2 k r  r 2     r k  1  r   r 2    1  r
 dr dr 
  k 0 
  dr dr  
1  r 
2 1 2r  1  r r 1
i .e.  2 k 1
k 2 k r r  1  1  1
(1  r )3 (1  r )2 (1  r )3 (1  r )3
Thus we have
r 1 r 1
f ( z )  z f ( z )  1    2 k 1
k 2 k r 1 1  2
(1  r )3
(1  r )3
Hence, for f ( z )  z f ( z )  0, we must have

r 1 r 1
f ( z )  z f ( z )  2  0  2  2(1  r )3  r  1
(1  r )3 (1  r )3

 2[1  r 3  3r (1  r )]  r  1  2  2r 3  6r  6r 2  r  1
1 1 1
 1  7r  6r 2  2r 3  0  1  7  6 2  2 3  0 ( Rr  1, R  1 since r  1)
R R R
 R3  7 R 2  6 R  2  0  R3  7 R 2  6 R  2  R( R 2  7 R  6 )  2
 R( R  1)( R  6)  2  R  6 ( R  1).
1 1 1
 6  r  |z|
r 6 6
Thus, for | z |  61  1, we have

r 1 z f ( z )  f ( z )  z f ( z )
f ( z )  z f ( z )  2  0  Re 1    0.
(1  r )3  f ( z )  f ( z )

Hence f( z ) is cap like function in the open disc | z |  61  1. / /

Theorem 4 : Let f( z )  z   
k 2 ak z
k
is cap like function and is univlent . Then z f ( z ) is
star like in { z | z |  c  1} where

6 3 6
c 1  .
3 3
462
IJRITCC | July 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 7 457 – 481
_______________________________________________________________________________________________
Proof : Let f( z )  z    k
k 2 ak z is univlent  | ak |  1 ( k  2, 3, 4,)

Put g( z )  z f ( z )  z[1   
k 2 kak z
k 1
]  z   k 2 kak z k  z   k 2 bk z k where bk  kak
Let z1  z2 , we have z1  z2  0  | z1  z2 |  0  0  | z1  z2 | .
Let   | z1 |  | z2 | r  1  0  r    | z2 |  | z1 |  | z1  z2 | by triangle inequality.

Consider g( z1 )  g( z2 )  [ z1    k 
k 2 kak z1 ]  [ z2   k 2 kak z2 ]
k

i .e. g( z1 )  g( z2 )  z1  z2  [  k  k 
k 2 kak z1   k 2 kak z2 ]  z1  z2   k 2 kak [ z1  z2 ]
k k

 g( z1 )  g( z2 )  | z1  z2   
k 2 kak [ z1  z2 ] |
k k

By triangle inequality, | z1  z2   k 2 kak [ z1k  z2k ] |  | z1  z2 |  |  k 2 kak [ z1k  z2k ]|

 g( z1 )  g( z2 )  | z1  z2 |  |   k k 
k 2 kak [ z1  z2 ]|  r    |  k 2 kak [ z1  z2 ]|
k k

Again by triangle inequality, we have

|  nk 2 kak [ z1k  z2k ]|   nk 2 | kak [ z1k  z2k ]|   kn 2 k | ak || z1k  z2k |   kn 2 k .1. [| z1k |  | z2k |]
i .e. |  nk 2 kak [ z1k  z2k ]|   nk 2 k [| z1 |k  | z2 |k ]   nk 2 k[r k  r k ]   k 2 k 2r k  2 
k 2 k r
k

 d  d 
r  2r  r k  2r   r k  1  r 
d k
i .e. |  k 2 kak [ z1k  z2k ]|  2r  k 2 k r k 1  2r 
k 2 dr dr k 2 dr  k 0 

i .e. |  k 2 kak [ z1k  z2k ]|  2r d  1  1  r   2r  1  0  1  2r  1  1

dr 1  r  (1  r )2  (1  r )2 
   
 1 
  | 
k 2 kak [ z1  z2 ]|  2r 1 
k k
2
 (1  r ) 
Thus we have

| g( z1 )  g( z2 ) |  r    |  k 2 kak [ z1k  z2k ]|

 1  2r  2 
 r    2r 1  2
 r  2r     r 3  2

 (1  r )  (1  r )  (1  r ) 
2

By taking limit   | z1 | 0 on both sides since either 0  | z1 | | z2 | or 0  | z1 | | z2 |,

 2   2   2 
| g( z1 )  g( z2 ) |  r 3   lim  0   r 3   0  r 3  .
 (1  r )2   (1  r )2
  (1  r )2 
Hence, for | g( z1 )  g( z2 ) |  0, we must have
2 2 2
3 0  3  (1  r )2 
(1  r )2 (1  r )2 3

2 2 2 6
 1r   1 r  r 1 1  0.1835  1.
3 3 3 3
Thus, for 0    | z1 |  | z2 |  r  c  1, we have

 2   c  1  6  3  6  0.1835 
| g( z1 )  g( z2 ) |  r 3     0,  
 (1  r )2   3 3 
 g( z1 )  g( z2 ) for z1  z2 i .e. g( z ) is univalent function in { z | z |  1  31 6  1}.

463
IJRITCC | July 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 7 457 – 481
_______________________________________________________________________________________________
Since f( z ) is cap like function , we have
z f ( z )  f ( z )  z f ( z )   1 d  1
0  Re 1   Re     
d
 f ( z )    f ( z )   Re f ( z ) dz [ z f ( z )]  Re  z f ( z ) z dz [ z f ( z )] ,

Now g( z )  z f ( z )  f ( z ) will exist since f( z ) is analytic; and g(0)  0 f (0)  0  1  0
Thus g(0)  0 f (0)  f (0)  f (0)  1 and g( z ) is analytic in the open unit disc { z | z |  1}.

Hence g( z )  z f ( z ) is star like function is in the disc | z |  c  1  31 6  1. / /

Problem : Let f( z )  z    k
k 2 ak z is star like function . Then

1
0  Re  z [ z f( z )]
d
 z f( z ) dz 
and z f( z ) is analytic in the open unit disc{ z | z |  1}, but z f( z ) is not univalent in the open disc
{ z | z |  r  1}, thus z f( z ) is not star like function .

Proof : Let f( z )  z    k
k 2 ak z is star like function . Then

z f ( z )  z f ( z )  z f ( z )  z f ( z )  f( z )  1 d
0  Re    Re    1  Re   1  Re    Re  [ z f( z )]
 f( z )   f( z )   f( z )   f( z )  f( z ) dz 
And f( z ) is univalent in an open disc { z | z |  r  1}

And g( z )  z f( z )  z[ z    
k 2 ak z ]  z   k 2 ak z
k 2 k 1
is analytic in open unit disc { z | z |  1}
 g(0)  0 f(0)  0  0  0, g( z )  z f ( z )  f( z ) but g(0)  0 f (0)  f(0)  f (0)  0  1.
Consider

g( z1 )  g( z2 )  z1 f( z1 )  z2 f( z2 )  [ z12    k 1  k 1
k 2 ak z1 ]  [ z2   k 2 ak z2 ]
2

 z12  z22   k 2 ak z1k 1   k 2 ak z2k 1  z12  z22   k 2 ak [ z1k 1  z2k 1 ]

Let z1  z2 in the open disc { z | z |  r  1} such that z1   z2  z12  z22

 g( z1 )  g( z2 )    k 1
k 2 ak z1   k 1
k 2 ak z2 may or may not be 0.
Thus g( z ) is not univalent in { z | z |  r  1}. So g( z )  z f( z ) is not star like function . / /

Definition 4 : A function f( z ) that is analytic in the open unit disc { z | z |  1} with f(0)  0,
f (0)  1 is said to be cap like function of order  (c ) in the open disc { z | z |  c  1 if
z f ( z ) 
Re 1    (c ), | z |  c  1, 0   (c )  1.
 f ( z ) 

Definition 5 : A function f( z ) that is analytic in the open unit disc { z | z |  1} and univalent
in open disc { z | z |  c  1} with f(0)  0, f (0)  1 is said to be star like function of order  ( c ) if
z f ( z ) 
Re    (c ), | z |  c  1, 0   (c )  1.
 f( z ) 

464
IJRITCC | July 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 7 457 – 481
_______________________________________________________________________________________________
Theorem 5 : If f( z )  z   
k 2 ak z in | z |  1 is star like function of order   1, then
k

( z  1) f( z ) is star like function of order   0.4.

Proof : Let f( z ) is star like function of order   1.
z f ( z ) 
 Re  , f( z )  U
 f( z ) 
By Theorem 1, | ak |  1 ( k  2, 3, 4,) since f( z )  U .
Now g( z )  ( z  1) f( z ) is analytic in the open unit disc { z | z |  1} since f( z ) is analytic,

 g(0)  1 f(0)  1  0  0, and

 
g( z )  ( z  1) f ( z )  f( z )  g(0)  (0  1) f (0)  f(0)  f (0)  0  1.

Consider z f( z )  z[ z    k 2 
k 2 ak z ]  z   k 2 ak z
k 1
.

 ( z  1) f( z )  z 2   
k 2 ak z
k 1
 z  
k  2 ak z
k

 z  z2   
k 12 ak 1 z
k 11
 
k 2 ak z
k

 z  z2    k  k 2 
k 3 ak 1 z  a2   k 3 ak z  z  (1  a2 ) z   k 3 ( ak 1  ak ) z
k

Put 1  a2  b2 , ak 1  ak  bk ( k  3, 4, 5,)  g( z )  ( z  1) f( z )  z    k
k 2 bk z .

Let z1  z2 , we have z1  z2  0  | z1  z2 |  0  0  | z1  z2 | .
Let   | z1 |  | z2 | r  1  0  r    | z2 |  | z1 |  | z1  z2 | by triangle inequality.
Consider
g( z1 )  g( z2 )  ( z1  1) f ( z1 )  ( z2  1) f ( z2 )

 [ z1    
k 2 bk z1 ]  [ z2   k 2 bk z2 ]
k k

 z1  z2  [  k  k 
k 2 bk z1   k 2 bk z2 ]  z1  z2   k 2 bk [ z1  z2 ]
k k

 | g( z1 )  g( z2 ) |  | z1  z2   k 2 bk [ z1k  z2k ]|
By triangle inequality, | z1  z2   k 2 bk [ z1k  z2k ]|  | z1  z2 |  |  k 2 bk [ z1k  z2k ]|
 | g( z1 )  g( z2 ) |  | z1  z2 |  |  k 2 bk [ z1k  z2k ]|  r    |  k 2 bk [ z1k  z2k ]|
Consider

|  k 2 bk [ z1k  z2k ]|   k 2 | bk | [| z1 |k  | z2 |k ]    
k 2 | bk | [r  r ]  2 k 2 | bk | r .
k k k

| b2 |  | 1  a2 |  1 | a2 |  1  1  2, | bk |  | ak 1  ak |  | ak 1 |  | ak |  1  1  2.
Then we have

|  k 2 bk [ z1k  z2k ]|  2 k 2 | bk | r k  2 k 2 2 r k  4  
k 2 r  4[ k 0 r  1  r ]
k k

Thus we have

| g( z1 )  g( z2 ) |  | z1  z2 |  |  k 2 bk [ z1k  z2k ]|  r    4 k 2 r k
2
i .e. | g( z1 )  g( z2 ) |  r    4 r  r 1  4r   
1r  1  r 
By taking limit   | z1 | 0 on both sides since either 0  | z1 | | z2 | or 0  | z1 | | z2 |,

465
IJRITCC | July 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 7 457 – 481
_______________________________________________________________________________________________
| g( z1 )  g( z2 ) |  r 1  4r   lim  0   r 1  4r   0  r 1  4r  .
 1  r   1  r   1  r 
Hence, for | g( z1 )  g( z2 ) |  0, we must have
4r 4r
1 0  1  1  r  4r ( 0  r  1 i .e. 0  1  r )
1r 1r
 1  5r  5r  1  r  0.2
Thus, for 0    | z1 |  | z2 |  r  0.2, we have

| g( z1 )  g( z2 ) |  r 1  4r     0 i .e. g( z1 )  g( z2 )
 1  r 
Thus g( z ) is univalent in the open disc { z | z |  0.2  1}.
We have
1 d z[( z  1)f ( z )  f( z )] ( z  1) z f ( z )  z f( z ) z f ( z ) z
z [( z  1)f( z )]    
( z  1)f( z ) dz ( z  1)f( z ) ( z  1) f( z ) f( z ) z  1
Consider
z f ( z ) z f ( z )  z  1  1
Re 
z 
 Re   Re 
z 
   Re 
z 
      Re 
 f( z ) z  1   f( z )  
 z  1 
 
 z  1 
 
 z  1 
1  1 
Re  [( z  1)f( z )]    Re 1     1  Re 
z d
i .e.
( z  1)f( z ) dz   z  1  z  1

i .e. Re 
1
z [( z  1)f( z )]    1  Re 
d 1     1  Re  1  x   y 
( z  1)f( z ) dz   x   y  1 (1  x )2  y 2 
 
1 1 x
Re  z [( z  1)f( z )]    1 
d
i .e.
( z  1)f( z ) dz  (1  x )2  y 2
Let | z |  c  1  | z |2  c2  1  x2  y 2  c2  1
 x2  x2  y 2  c2  1   1  c  x  c  1  01c 1 x 1 c 2
But 0  (1  x )2  (1  x )2  y 2
1 1 1 x 1 x 1 1
     
(1  x )2  y 2 (1  x )2 (1  x )2  y 2 (1  x )2 1  x 1  c
1 x 1
  
(1  x )2  y 2 1c

1 x 1   1  (  1)c  1   2c
  1  1  
(1  x )  y
2 2 1c 1c 1c
Thus we have
1 1 x   2c
Re  z [( z  1)f( z )]    1 
d
 0
( z  1)f( z ) dz  (1  x )2  y 2 1  c
for   2c  0 or   2c or 2c   or c  0.5  1 since   1.
2   2c   2(0.2)   0.4
c  0.2  0.5  1      0
5 1c 1  0.2 0.8
So g( z )  ( z  1) f( z ) is star like function of order   0.4 in the open disc | z |  0.2  1. / /
466
IJRITCC | July 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 7 457 – 481
_______________________________________________________________________________________________
Definition 6 : n-th partial sum of the function f( z )   k 0 ak z k is sn ( z , f)   nk 0 ak z k .

Theorem 6 : Let f( z )  z   k 2 ak z k in { z | z |  1} is univalent . Then sn ( z , f) is analytic in

the disc { z | z |  1} with sn (0,f)  0, sn (0, f)  1, and is univalent function in | z |  31  1 for all
integers n  2, 3, 4 .

Proof : sn ( z , f)  z   nk 2 ak z k in | z |  1 is analytic with sn (0, f)  0, sn (0, f)  1.

Let z1  z2 , we have z1  z2  0  | z1  z2 |  0  0  | z1  z2 | .
Let   | z1 |  | z2 | r  1  0  r    | z2 |  | z1 |  | z1  z2 | by triangle inequality.
Consider

sn ( z1 , f)  sn ( z2 , f)   z1   kn 2 ak z1k    z2   kn 2 ak z2k 

 z1  z2  [ kn 2 ak z1k   kn 2 ak z2k ]  z1  z2   kn 2 ak [ z1k  z2k ]

 sn ( z1 , f)  sn ( z2 , f)  | z1  z2   kn 2 ak [ z1k  z2k ]|

By triangle inequality, | z1  z2   kn 2 ak [ z1k  z2k ]|  | z1  z2 |  |  nk 2 ak [ z1k  z2k ]|

 sn ( z1 , f)  sn ( z2 , f)  | z1  z2 |  |  nk 2 ak [ z1k  z2k ]|  r    |  nk 2 ak [ z1k  z2k ]|
Note that f( z )  U  | ak |  1 ( k  2, 3, 4,) by Theorem 1.
Again by triangle inequality,

|  nk 2 ak [ z1k  z2k ]|   kn 2 | ak [ z1k  z2k ]|   nk 2 | ak || z1k  z2k |   nk 2 1[| z1k |  | z2k |]

i .e. |  nk 2 ak [ z1k  z2k ]|   nk 2 [| z1 |k  | z2 |k ]   nk 2[r k  r k ] since | z1 |  | z2 |  r .

1  r n 1 
i .e. |  nk 2 ak [ z1k  z2k ]|   nk 2 2 r k  2 nk 2 r k  2[ nk 0 r k  1  r ]  2  1  r
 1r 
1  r n 1   1  r n 1  1  r 2  1  r n 1 
  |  nk 2 ak [ z1k  z2k ]|  2   1  r   2 1  r   2
 1r   1  r   1r 

  r 2  r n 1  2r 2 2r n 1 2r 2 2r 2

i .e.  |  nk 2 ak [ z1k  z2k ]|  2      0 
 1  r  1  r 1  r 1  r 1r
Thus we have
2r 2 2r 
sn ( z1 , f)  sn ( z2 , f)  r    |  nk 2 ak [ z1k  z2k ]|  r     r 1   .
1r 
 1  r 
By taking limit   | z1 | 0 on both sides since either 0  | z1 | | z2 | or 0  | z1 | | z2 |,

| sn ( z1 , f)  sn ( z2 , f) |  r 1  2r   lim  0   r 1  2r   0  r 1  2r  .
 1  r   1  r   1  r 
Hence, for | sn ( z1 , f)  sn ( z2 , f) |  0, we must have
2r 2r
1 0  1  1  r  2r ( 0  r  1 i .e. 0  1  r )
1r 1r
 1  5r  3r  1  r  31

467
IJRITCC | July 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 7 457 – 481
_______________________________________________________________________________________________
Thus, for 0    | z1 |  | z2 |  r  31 , we have

| sn ( z1 , f)  sn ( z2 , f |  r 1  2r     0 i .e. sn ( z1 , f)  sn ( z2 , f)
 1  r 
Hence sn ( z , f) is univalent function in the disc | z |  31 for all n. / /

Theorem 7 : If f( z )  z   k 2 ak z k is star like function in { z | z |  1}, then sn ( z ,f ) are star

like functions in | z |  1  4 2.

Proof : Let f( z )  z   k 2 ak z k is star like function in { z | z |  1}.

zf ( z ) 
 Re   0, | z |  1.
 f( z ) 
And f( z ) is univalent  | ak |  1, k  2, 3, 4, by Theorem1.
Partial sum of f( z ) is sn ( z ,f )  z   nk 2 ak z k . Consider

z sn ( z ,f ) z [1   nk 2 ak k z k 1 ] 1   nk 2 ak k z k 1 1   nk 2 ak k z k 1
  
sn ( z ,f ) z   nk 2 ak z k 1   nk 2 ak z k 1 hn ( z )

z s ( z ,f )  1   nk 2 ak k z k 1   h n ( z ) [1   nk 2 ak k z k 1 ]
 Re  n  Re    Re  
 sn ( z ,f )   hn ( z )   hn ( z ) hn ( z ) 
z s ( z ,f )   h n ( z )  h n ( z ) nk 2 ak k z k 1 
i .e. Re  n  Re  
 sn ( z ,f )   | h n ( z ) |2 
z s ( z ,f )  1
i .e. Re  n  Re 1   nk 2 ak z k 1  [1   nk 2 ak z k 1 ] nk 2 ak k z k 1 
 sn ( z ,f )  | h n ( z ) |2

Put ( z )   nk 2 ak z k 1  [1   nk 2 ak z k 1 ] nk 2 ak k z k 1 . Then we have

zs ( z ,f )  1 1
Re  n  Re 1  ( z )  1  Re ( z )
 sn ( z ,f )  | h n ( z ) |2 | h n ( z ) |2
We have  | ( z ) |   Re ( z )  | ( z ) | since  Re ( z )2  | ( z ) |2 .
Thus we have
z sn ( z ,f ) 
| h n ( z ) |2 Re   1  Re ( z )  1 | ( z ) |
 sn ( z ,f ) 
Consider

| ( z ) |   nk 2 ak z k 1  [1   nk 2 ak z k 1 ] nk 2 ak k z k 1 .

  nk 2 ak z k 1  [1   nk 2 ak z k 1 ] nk 2 ak k z k 1

  nk 2 ak z k 1  1   nk 2 ak k z k 1   nk 2 ak k z k 1

  nk 2 ak z k 1  1   nk 2 ak k z k 1    nk 2 ak k z k 1

  nk 2 | ak | | z k 1 |  1   nk 2| ak | | z k 1 |   kn 2| ak | k | z k 1 |

  nk 2 | ak | | z |k 1  1   nk 2 | ak | | z |k 1    nk 2 | ak | k | z |k 1
468
IJRITCC | July 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 7 457 – 481
_______________________________________________________________________________________________
Put | z | r  1. Then

| ( z ) |   nk 2 | ak |  r k 1  1   kn 2| ak |  r k 1    kn 2| ak | k  r k 1

  nk 2 1  r k 1  1   nk 2 1  r k 1    nk 2 1  k r k 1
n d
 r 1  nk 2 r k  1  r 1  nk 2 r k    r k
k 2 dr

1 1
   nk 0 r k  1  r   1    nk 0 r k  1  r      nk 0 r k  1  r 
d
r  r  dr
1 1  r n 1   1 1  r n 1  d 1  r n 1 
   1  r   1    1  r     1  r
r 1r   r  1  r  dr  1  r 
1  r n 1 1  1  r n 1 1   d  1  r n 1  
   1  1    1     0  1
r (1  r ) r  r (1  r ) r  
dr 1  r  
1  r n 1 1r 1  r n 1 1  r   d  1  r n 1  
  1      1
r (1  r ) r (1  r )  r (1  r ) r (1  r )   dr  1  r  

1  r n 1  1  r 1  r n 1  1  r  (1  r )( ( n  1)r n )  (1  r n 1 )( 1) 

 1    1
r (1  r )  r (1  r )   (1  r )2 

r  r n 1  r  r n 1   (1  r )( n  1)r n  1  r n 1 
  1   2 
 1
(1  r ) 2
 (1  r )   (1  r )2

n 1
r  r n 1  (1  r )( n  1)r n  r n 1 
i .e. | ( z ) |  r  r 1 
2 
 1 2  1
(1  r )2 (1  r )  (1  r )2
(1  r ) 
n 1
r  r n 1 (r  r )[(1  r )( n  1)r n  r n 1 ] r  r n 1 r  r n 1
 1  
(1  r ) 2
(1  r )4
(1  r )
4
(1  r )
2

( r  r n 1 )[(1  r )( n  1)r n  r n 1 ]  r n 1 r
 1  
(1  r )4 (1  r )4
Thus

 ( r  r n 1 )[(1 r )( n 1)r n  r n 1 ] r n 1 r 
1 | ( z ) |  1   1 
 (1 r ) 4
(1 r )4 

( r  r n 1 )[(1  r )( n  1)r n  r n 1 ]  r n 1 r 1
11  20
(1  r ) 4
(1  r ) 4
(1  r )4

since 0  r  1 i .e. 0  r n 1  r n    r 2  r  1  0  1  r , 0  r  r n 1 ,  r  1.

Assume that

1 1 1 1
2 0  2  (1  r )4   1 r  4
(1  r )4 (1  r )4 2 2


1
1 4  r
2

1
r  1  4  1;
2 1  12  1  0.84  0.1591
4


1
1 4  r
2

1
r  1  4  1;
2 1  12  1  0.84  0.1591
4

469
IJRITCC | July 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 7 457 – 481
_______________________________________________________________________________________________
Thus we have

| h n ( z ) |2 Re 
z sn ( z ,f ) 
 n
s ( z ,f ) 

 1 | ( z ) |  2 
(1
1
 r )4
 0, | z |  r  1  12  1
4


z s ( z ,f ) 
Re  n
 sn ( z ,f ) 
 0, | z |  r  1  12  1 .
4

Hence sn ( z ,f ) are star like functions in | z |  1  4 2. / /

Theorem 8 : Let L( z )  z (1  z )1 . Then sn ( z , L) ( n  2, 3, 4,) is cap like function in disc

| z |  0.25.

Proof : L( z )  z (1  z )1  z  k 0 z k   k 0 z k 1   k 10 z k 11   k 1 z k  z   k 2 ak z k

where ak  1 ( k  2, 3, 4,). Then we have

n n n n 1 1  zn
sn ( z ,L)  z   z k   z k   z k 1  z  z k 1  z
k 2 k 1 k 11 k 0 1 z

(1  z )[1  ( n  1) z n ]  (0  1)[ z  z n 1 ]
 sn ( z ,L) 
(1  z )2

1  z  ( n  1) z n  ( n  1) z n 1  z  z n 1 1  ( n  1) z n  nz n 1
 
(1  z )2 (1  z )2

 log sn ( z ,L)  log[1  ( n  1) z n  nz n 1 ]  2 log(1  z )

By taking the derivative on both sides, we have

sn( z ,L) 0  ( n  1)nz n 1  n( n  1) z n 1 ( n  1)nz n 1 [1  z ] 2

  2  

sn ( z ,L) 1  ( n  1) z  nz
n n  1 1  z 1  ( n  1) z  nz
n n  1 1 z

sn( z ,L) ( n  1)nz n [1  z ] 2z N ( z ) 2z

 z    
sn ( z ,L) 1  ( n  1) z n  nz n 1 1  z D( z ) 1  z

sn( z ,L) ( n  1)nz n [1  z ] 2z ( n  1)nz n [1  z ] 1  z

 1 z 1   
sn ( z ,L) 1  ( n  1) z n  nz n 1 1  z 1  ( n  1) z n  nz n 1 1  z

To simplify the notations, put

1 z
N ( z )  ( n  1)nz n [1  z ], D( z )  1  ( n  1) z n  nz n 1 ,  w  u  v
1 z
sn( z ,L) N ( z )
 1 z  w
sn ( z ,L) D( z )

s( z ,L) 
Re 1  z n  Re   w  Re 
N ( z )
 Re w  Re 
N ( z) N ( z )
    u  (1)
 sn ( z , L)   D( z )   D( z )   D( z ) 
We have

1 z
w   w  wz  1  z  w  1  z  wz  w  1  (1  w) z
1 z
Consider
470
IJRITCC | July 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 7 457 – 481
_______________________________________________________________________________________________
1 w1 1
|z|    4| w 1|  | w 1|
4 w1 4
 4 | u  v  1 |  | u  v  1 |  16 | u  1  v |2  | u  1  v |2

 16[(u  1)2  v2 ]  [(u  1)2  v2 ]  16[u 2  2u  1  v2 ]  [u 2  2u  1  v2 ]

 16u 2  32u  16  16v2  u 2  2u  1  v2  15u 2  34u  15  15v2  0

   
2 2
34 17 17 17
 u2  u  1  v2  0  u2  2 u   1  v2  0
15 15 15 15

u  1715  v  289 225 15

2 2
289  225 64 8
 2
1    .
225 225
Consider

     
2
17  8 2 2 8
2
max u   max  v   i.e. max will exist at v  0
15  15  15

u  1715  158  
2 2
17 8 17 8
 u   u 
15 15 15 15
17 8 25 17 8 9
 u   or u    .
15 15 15 15 15 15
Hence it is clear that the Mobius ( Bilinear ) transformation
1 z
w
1 z
maps the circle | z |  41 in xy -plane into the the circle

   
2 2
17 8
u  v2 
15 15
in uv-plane such that the line segment AB on u -axis (v  0) is a diameter where

A 159 ,0  53,0 , and B 1525,0  35,0 .

9 25 3 5
 u or u  (2).
15 15 5 3
Observe that | N ( z ) |  | ( n  1)nz n [ 1  z ]|  ( n  1)n | z n | | 1  z |  ( n  1)n | z |n [1  | z |]

Let | z |  41. Then | N ( z ) |  ( n  1)n | z |n [1  | z |]  ( n  1)n (41 )n [1  41 ]

i .e. | N ( z ) |  ( n  1)n (41 )n [1  41 ]  ( n  1)n 4 n 1 [4  1]

i .e. | N ( z ) |  5( n  1)n 4 n 1.

Consider | nz n1  ( n  1) z n |  | nz n1 |  | ( n  1) z n |  n | z |n 1  ( n  1) | z |n

Let | z |  41. Then n | z |n 1  ( n  1) | z |n  n4 n 1  ( n  1)4 n

Thus, by transitive law , | nz n 1  ( n  1) z n |  n4 n 1  ( n  1)4 n  1

  | nz n 1  ( n  1) z n |   n4 n 1  ( n  1)4 n  1

 1 | nz n 1  ( n  1) z n |  1  n4 n 1  ( n  1)4 n  1  1  0

471
IJRITCC | July 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 7 457 – 481
_______________________________________________________________________________________________
But | D( z ) |  | 1  nz n 1  ( n  1) z n |  1 | nz n 1  ( n  1) z n |  0
1 1
  for | z |  41.
| D( z ) | 1  n4 n 1  ( n  1)4 n

Thus we have, for | z |  41 ,

N ( z) | N ( z) | 5( n  1)n 4 n 1 5( n  1)n
   n 1  (3).
D( z ) | D( z ) | 1  n4  n 1
 ( n  1)4  n
4  n  ( n  1)4
Observe that
5( n  1)n 5(2  1)2 10(3) 10(3) 3
n2      .
4n 1  n  ( n  1)4 421  2  (2  1)4 64  2  12 50 5

5( n  1)n 3 25 4n 1  n  ( n  1)4 4n
     1  1 (4).
4  n  ( n  1)4 5
n 1 12 4( n  1)n ( n  1)n 4( n  1) n

We know that
1 1 1 1 1 1
 1, 1    1,   1     1  1
4( n  1) n 4( n  1) n 4( n  1) n
for any n  2, 3, 4,

4n 43 64 25
n 3     .
n( n  1) 3(3  1) 12 12
Observe that for all integers k

 4k 1 4k 4k 4 4k 4 1
     
 ( k  1)( k  2) k ( k  1) ( k  1)( k  2) k ( k  1) k 2 k

 4k  k  2  3k  2
Since 3k  2 for all integers k  1, we have

4k 1 4k 43 64
    .
( k  1)( k  2) k ( k  1) 3(3  1) 12
Thus we have

4n 64 4n
 ( n  3, 4, 5,)   1  1  64  2  40  25
n( n  1) 12 ( n  1)n 4( n  1) n 12 12 12
Thus, from (4), we have
5( n  1)n 3
 .
4 n 1
 n  ( n  1)4 5
Thus, from (3), we have
N ( z) 5( n  1)n 3 3 N (z)
     .
D( z ) 4n 1  n  ( n  1)4 5 5 D( z )

We know that | f( z ) |2  [Ref( z )]2  [Im f( z )]2  [Ref( z )]2

 [Ref( z )]2  | f( z ) |2   | f( z ) |  Ref( z )  | f ( z ) | .

Hence we have
472
IJRITCC | July 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 7 457 – 481
_______________________________________________________________________________________________
3 3
 Re 
N ( z )
Re 
N ( z) N ( z )
     .
5 D( z )  D( z )   D( z )  5
Therefore, from (1) and (2), we have
s( z ,L)  3 3
Re 1  z n  Re 
N ( z )
   u     0.
 s 
n ( z , L )   D ( z )  5 5
It remains to show that 0.25 is maximal radius. This is seen for s2 ( z ,L)  z  z 2 . Then
s2( z ,L) 0  2 1  4z
1 z 1 z 
s2 ( z ,L) 1  2z 1  2z
has singularity at z  0.25, and thus analytic within | z |  0.25.
Clearly sn ( z ,L)  z   nk 2 z k is analytic within | z |  0.25, and sn (0, L)  0,
Since sn ( z ,L)  1   nk 2 k z k 1 , we have sn (0,L)  1   nk 2 k 0k 1  1.
Hence sn ( z ,L) is cap like function in the open disc | z |  0.25. / /

Definition 7 : Hadamard product (Convolution ) of two analytic functions f( z )   k 0 ak z k

in the open disc | z |  r1 and g( z )   k 0 bk z k in the open disc | z |  r2 is denoted by f  g and is
defined as an anlytic function (f  g)( z )   k 0 ak bk z k in the open disc | z |  r1 r2 .

Theorem 9 : Let f( z )  z    
k 2 ak z , and g( z )  z   k 2 bk z are univalent functions .
k k

Then (f  g)( z ) is cap like function in the open disc | z |  61  1, and is univalent in the open disc
{z | z |  31  1}.

Proof : By Theorem 1, | ak |  1 ( k  2, 3, 4,), and | bk |  1 ( k  2, 3, 4,) since

f( z ), g( z ) are univalent in the unit open disc | z |  1.
Now (f  g)( z )  z   
k 2 ak bk z
k

Let us consider
z (f  g)( z )  z (f  g)( z ) 
Re 1    1  Re  .
 
(f  g) ( z )   (f  g)( z ) 
We know that
2 2
 Re  z (f  g)( z )    z (f  g)( z )  
z (f  g)( z )
 Re 
z (f  g)( z )  z (f  g)( z )

  (f  g)( z )   (f  g)( z ) (f  g)( z )  (f  g)( z )  (f  g)( z )
z (f  g)( z ) z (f  g)( z )  z (f  g)( z ) 
 1  1  Re    Re 1 
(f  g)( z )  ( f  g)( z )   (f  g)( z ) 
z (f  g)( z )  z (f  g)( z ) z (f  g)( z ) (f  g)( z )  z (f  g)( z )
 Re 1   1 1 
 (f  g)( z )  (f  g)( z ) (f  g)( z ) (f  g)( z )

We have (f  g)( z )  1   
k 2 ak bk kz
k 1

 (f  g)( z )   
k 2 ak bk k ( k  1) z
k 2
 z (f  g)( z )   
k 2 ak bk k ( k  1) z
k 1

 z (f  g)( z )  |  
k 2 ak bk k ( k  1) z
k 1
|  k 2| ak || bk | k ( k  1) | z |k 1   k 2 1k ( k  1) | z |k 1
473
IJRITCC | July 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 7 457 – 481
_______________________________________________________________________________________________
Put | z |  r  z (f  g)( z )   
k 2 ( k  k ) r
2 k 1
.

By Triangle inequality, 1  | 
k 2 ak bk k z
k 1
|  | 1   k 2 ak bk k z k 1 |  (f  g)( z )
 (f  g)( z )  1  |  
k 2 ak bk k z
k 1
|
But |  k 2 ak bk k z k 1 |   k 2| ak || bk | k | z |k 1   k 2 1k | z |k 1   k 2 k r k 1
 (f  g)( z )  1  |  
k 2 ak bk k z
k 1
|  1   k 2 k r k 1
 (f  g)( z )  z (f  g)( z )  1   
k 2 k r
k 1
 
k 2 ( k  k ) r
2 k 1
 1   2 k 1
k 2 k r .
We have

 2 k 1
k 2 k r  
k 2[ k ( k  1)  k ] r
k 1
 
k 2 k ( k  1) r
k 1
 
k 2 k r
k 1

 
k 2 k ( k  1) r
k 1
 
k 2 k r
k 1
 r 
k 2 k ( k  1) r
k 2
 
k 2 k r
k 1
.
 d2 k  d k d2  d   d2 d  
i .e.  2 k 1
k 2 k r r  2
r   r  r 2  r k   r k  r 2    r k
k 2 dr k 2 dr dr k 2 dr k 2  dr dr  k 2
 d2 d    d2 d  1
i .e.  2 k 1
k 2 k r  r 2     r k  1  r   r 2    1  r
 dr dr   k 0   dr dr  1  r 
2 1 2r  1  r r 1
i .e.  2 k 1
k 2 k r r  1  1  1
(1  r ) (1  r )
3 2
(1  r )3
(1  r )3
Thus we have
r 1 r 1
(f  g)( z )  z (f  g)( z )  1    2 k 1
k 2 k r 1 1  2
(1  r )3
(1  r )3
We have
r 1 r 1
2 0  2  2(1  r )3  r  1
(1  r )3 (1  r )3
 2[1  r 3  3r (1  r )]  r  1  2  2r 3  6r  6r 2  r  1
1 1 1
 1  7r  6r 2  2r 3  0  1  7  6 2  2 3  0 ( Rr  1, R  1 since r  1)
R R R
 R3  7 R 2  6 R  2  0  R3  7 R 2  6 R  2  R( R 2  7 R  6)  2
 R( R  1)( R  6)  2  R  6 ( R  1)
1 1 1
 6  r  | z |   1.
r 6 6
Thus, for | z |  61  1, we have
r 1
(f  g)( z )  z (f  g)( z )  2  0
(1  r )3
z (f  g)( z )  (f  g)( z )  z (f  g)( z )
 Re 1    0.
 (f  g)( z )  (f  g)( z )

Hence (f  g)( z ) is cap like function in the open disc | z |  61  1.

Let z1  z2 , we have z1  z2  0  | z1  z2 |  0  0  | z1  z2 | .
Let   | z1 |  | z2 | r  1  0  r    | z2 |  | z1 |  | z1  z2 | by triangle inequality.
474
IJRITCC | July 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 7 457 – 481
_______________________________________________________________________________________________
Consider

(f  g)( z1 )  (f  g)( z2 )  [ z1    
k 2 ak bk kz1 ]  [ z2   k 2 kak bk z2 ]
k k

 z1  z2  [ k 2 ak bk z1k   k 2 ak bk z2k ]  z1  z2   k 2 ak bk [ z1k  z2k ]

 (f  g)( z1 )  (f  g)( z2 )  | z1  z2   
k 2 ak bk [ z1  z2 ]|
k k

By triangle inequality, | z1  z2   k 2 ak bk [ z1k  z2k ]|  | z1  z2 |  |  k 2 ak bk [ z1k  z2k ]|

 (f  g)( z1 )  (f  g)( z2 )  | z1  z2 |  |   k k 
k 2 ak bk [ z1  z2 ]|  r    |  k 2 ak bk [ z1  z2 ]|
k k

Again by triangle inequality; and since | ak |  1, | bk |  1; we have

|  nk 2 ak bk [ z1k  z2k ]|   nk 2 | ak bk [ z1k  z2k ]|   nk 2 | ak || bk || z1k  z2k |

  nk 2 1(1) [| z1k |  | z2k |]

  nk 2 [| z1 |k  | z2 |k ]   nk 2[r k  r k ].

r2 2r 2
i .e. |  k 2 kak [ z1k  z2k ]|  2 k 2 r k 2   | 
k 2 kak [ z1  z2 ]|  
k k
1r 1r
2r 2 2r 
 (f  g)( z1 )  (f  g)( z2 )  r    |  
k 2 ak bk [ z1  z2 ]|  r   
k k
 r 1  
1r  1  r 
By taking limit   | z1 | 0 on both sides since either 0  | z1 | | z2 | or 0  | z1 | | z2 |,

| (f  g)( z1 )  (f  g)( z2 ) |  r 1  2r   lim  0   r 1  2r   0  r 1  2r  .

 1  r   1  r   1  r 
Hence, for | (f  g)( z1 )  (f  g)( z2 ) |  0, we must have
2r 2r
1 0  1  1  r  2r ( 0  r  1 i .e. 0  1  r )
1r 1r
 1  5r  3r  1  r  31

Thus, for 0    | z1 |  | z2 |  r  31 , we have

2r 
(f  g)( z1 )  (f  g)( z2 )  r 1     0 i .e. (f  g)( z1 )  (f  g)( z2 ).
 1  r 
Thus (f  g)( z ) is univalent in the open disc { z | z |  31  1}. / /

Theorem 10 : Let f( z )  z   k 2 ak z k is univalent function . Then f( z ) is star like function in

the open disc { z | z |  c  1} where c  1  31 6.

Proof : Let g( z )  z   k 2 k 1 z k   k 1 k 1 z k . Then clearly g(0)  0, and g(0)  1.

And g( z )   k 1 z k 1   k 11 z k 11   k 0 z k  (1  z )1  g( z )  (1  z )2

z g( z ) z (1  z )2 z 1 z  z 1 1
 1 1 1    , ( z  x   y ).
g( z ) (1  z ) 1 1  z 1  z 1  z 1  ( x   y)

z g( z ) 1 (1  x )   y z g( z )  (1  x )
i .e. 1    Re 1    .
g( z ) (1  x )   y (1  x )2  y 2  g ( z )  (1  x )2  y 2
For | z |  1, we have x2  x2  y 2  | z |2  1  1  x 1  01 x
475
IJRITCC | July 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 7 457 – 481
_______________________________________________________________________________________________
Thus we have
z g( z )  (1  x )
Re 1     0.
 
g ( z )  (1  x )2  y 2

 g( z ) is cap like function .

Let z1  z2  z1  z2  0  | z1  z2 |  0  0  | z1  z2 | .
Let   | z1 |  | z2 | r  1  r    | z2 |  | z1 |  | z1  z2 | by triangle inequality.
Consider

g( z1 )  g( z2 )   z1   k 2 ak k 1 z1k    z2   k 2 ak k 1 z2k 

 z1  z2  [ k 2 ak k 1 z1k   k 2 ak k 1 z2k ]  z1  z2   k 2 ak k 1[ z1k  z2k ]

By triangle inequality, | z1  z2   k 2 ak k 1[ z1k  z2k ]|  | z1  z2 |  |  k 2 ak k 1[ z1k  z2k ]|

 g( z1 )  g( z2 )  | z1  z2 |  |  k 2 ak k 1[ z1k  z2k ]|  r    |  k 2 ak k 1[ z1k  z2k ]|
By BEIRBERBACH conjecture | ak |  k since f( z )  U .
Again by triangle inequality, we have

|  k 2 ak k 1[ z1k  z2k ]|   k 2 | ak k 1[ z1k  z2k ]|   k 2 | ak | k 1  | z1k  z2k |

  k 2 k k 1 [| z1k |  | z2k |]

i .e. |  k 2 ak k 1[ z1k  z2k ]|   k 2[| z1 |k  | z2 |k ]   k 2[r k  r k ] since | z1 |  | z2 |  r .

r2
i .e. |  k 2 ak k 1[ z1k  z2k ]|   k 2 2 r k  2 k 2 r k  2
1r
Thus we have

2r 2 2r 
g( z1 )  g( z2 )  r    |  k 2 ak k 1[ z1k  z2k ]|  r     r 1   .
1r 
 1  r 
By taking limit   | z1 | 0 on both sides since either 0  | z1 | | z2 | or 0  | z1 | | z2 |,
2r  2r  2r 
g( z1 )  g( z2 )  r 1   lim  0   r 1   0  r 1  .
 1  r   1  r   1  r 
Hence, for g( z1 )  g( z2 )  0, we must have
2r 2r
1 0  1  1  r  2r ( 0  r  1 i .e. 0  1  r )
1r 1r
 1  5r  3r  1  r  31.

Thus, for 0    | z1 |  | z2 |  r  31 , we have

2r 
g( z1 )  g( z2 )  r 1     0 i .e. g( z1 )  g( z2 )  0 i .e. g( z1 )  g( z2 )  0.
 1  r 

Hence g( z ) is univalent function in the disc | z |  31  1.

Convolution of f( z )  z   k 2 ak z k , and g( z )  z   k 2 k 1 z k is (f  g)( z )  z   k 2 ak k 1 z k .

By Theorem 9, we say that (f  g)( z ) is cap like function in the open disc | z |  61  1, and

(f  g)( z ) is univalent in the open disc { z | z |  31  1}.

476
IJRITCC | July 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 7 457 – 481
_______________________________________________________________________________________________
(f  g)( z )  1   k 2 ak k 1 k z k 1  z (f  g)( z )  z   k 2 ak z k  f( z ).

By Theorem 4, f( z )  z (f  g)( z ) is star like function in { z | z |  1  31 6  0.1835  1}.//

Definition 8 : An analytic function f( z ) in { z | z |  1} with f(0)  0, f (0)  1 is said to be

close-to-cap like function if there is a univalnt cap like function g( z ) in { z | z |  1} such that
f ( z ) 
Re   0, | z |  1.
 ( z ) 
g

Theorem 11 : Let g( z )  z    k
k 2 bk z is close-to-cap like function . Then g( z ) is univalnt .

Proof : Let g( z ) is close-to-cap like function . Then there is a univalnt cap like function
h( z ) in { z | z |  1} such that
g( z ) 
Re   0, | z |  1.
h( z ) 
Let | z0 |  1
g( z0 ) 
 Re  0
 ( z0 )
h

 lim g( z )  g( z0 )   g( z )  g( z0 ) 
 zz z  z0   z  z0 
 Re  0  0  Re  lim  0
 lim h( z )  h( z0 )  z  z0 h( z )  h( z0 ) 
 z  z0 z  z0   z  z0 

 g( z )  g( z0 )  g( z )  g( z0 ) 
 Re  lim  0, z  z0  lim Re   0, z  z0
 z  z0 h( z )  h( z0 ) z  z0 h( z )  h( z0 ) 
g( z )  g( z0 ) 
 Re   0, z  z0 .
h( z )  h( z0 )
But h( z )  h( z0 ) for z  z0 since h( z ) is a univalnt function .
 g( z )  g( z0 )  0 for z  z0  g( z )  g( z0 ) for z  z0 .
Thus g( z ) is a univalnt function . / /

Theorem 12 : Let g( z )  z    
k 2 bk z is close-to-cap like function , and f( z )  z   k 2 ak z .
k k

Then (f  g)( z ) is close-to-cap like function provided | (f  g)( z )  g( z )  1 |  1.

Proof : Let g( z ) is close-to-cap like function . Then g( z )  z    k

k 2 bk z ; and there is a

cap like function h( z )  z   

k 2 ck z . in { z | z |  1} such that
k

g( z ) 
Re   0 | z |  1.
h( z ) 
Now h( z )  1   
k 2 ck k z
k 1
.

477
IJRITCC | July 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 7 457 – 481
_______________________________________________________________________________________________
Convolution of f( z )  z   k 2 ak z k , and g( z )  z   k 2 bk z k is (f  g)( z )  z   k 2 ak bk z k .

Consider (f  g)( z )  g( z )  1   k 2 ak bk kz k 1   1   k 2 bk kz k 1    k 2 ( ak bk  bk )kz k 1

Without loss of generality, Put ck  ak bk  bk for k  2, 3, 4,

 (f  g)( z )  g( z )   k 2 ( ak bk  bk )kz k 1   k 2 ck kz k 1  h( z )  1

(f  g)( z ) g( z ) h( z )  1 1 (f  g)( z ) g ( z ) 1

   1 i .e  1
h( z ) h( z ) h( z ) h( z ) h( z ) h( z ) h ( z )

(f  g)( z )   g( z )  1  1   Re  g( z )   1  Re  1   0  1  Re  1 

 Re   Re
 h( z )  h( z ) h( z )  h( z )  h( z )  h( z ) 

(f  g)( z )  1   h( z )   h( z )  Re h( z )

i .e. Re    1  Re    1  Re    1  Re   1
 h( z )  h( z )  h( z )  h( z )  | h( z ) | 
2
| h( z ) |2

Let h( z )  u ( x, y )   v( x, y )  h( z )  u ( x, y )   v( x, y )

 | h( z ) |2  u 2  v2 , and Re h( z )  u .

Thus we have

(f  g)( z ) 
( z )  1  2 u 2  u 2 v 2 u .
2 2
1
Re   1  Re h
 h( z )  | h( z ) |2
u v u v

u 0  u 2  v2  u  0.

0  u  1  u 2  v2 since u 2  v2 | h( z ) |2  | (f  g)( z )  g( z )  1 |  1

 0  u 2  v2  u i .e. u 2  v2  u  0

1u  u  u 2  u 2  v2  0  u 2  v2  u i .e. u 2  v2  u  0.

Thus we have

(f  g)( z )  u 2  v2  u
Re   2 2  0. / /
 h( z )  u v

Theorem 13 : If f( z )  z   k 2 ak z k is close-to-cap like function in { z | z |  1}, then sn ( z ,f )

are close-to-cap like functions in | z |  1  4 2.

Proof : Let f( z )  z   k 2 ak z k is close-to-cap like function in { z | z |  1}. Then there is a

cap like and univalent function h( z ) such that

f ( z ) 
Re   0, | z |  1.
h( z ) 
Clearly | ak |  1, | ck | | ck |  1 since f( z ),h( z ) are univalent .

Partial sum of f( z ) is sn ( z , f )  z   nk 2 ak z k .

Consider

478
IJRITCC | July 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 7 457 – 481
_______________________________________________________________________________________________
s ( z ,f )   h( z ) sn ( z ,f )   h( z ) 1   nk 2 ak k z k 1  
Re  n  Re     Re  
 h( z )   h ( z ) h( z )   | h( z ) |2 
s ( z ,f ) 
i .e. Re  n   1 2 Re  h( z )  h( z ) nk 2 ak k z k 1 

 h ( z )  | h( z ) |
s ( z ,f )  1
i .e. Re  n  Re 1   
k 2 ck k z
k 1
 [1   
k 2 ck k z
k 1
] nk 2 ak k z k 1 
 h( z )  | h( z ) |2 

Put ( z )   
k 2 ck k z
k 1
 [1   
k 2 ck k z
k 1
] kn 2 ak k z k 1 .
s ( z ,f )  1 1
 Re  n   Re 1  ( z )  1  Re ( z )
 h ( z ) 
 | h ( z) |2

| h ( z ) |2

We have  | ( z ) |   Re ( z )  | ( z ) | since  Re ( z )2  | ( z ) |2 .

Thus we have
sn ( z ,f ) 
| h( z ) |2 Re   1  Re ( z )  1 | ( z ) |
 h( z ) 
Consider

| ( z ) |   k 2 ck k z k 1  [1   k 2 ck k z k 1 ] nk 2 ak k z k 1

 
k 2 ck k z
k 1
 [1   
k 2 ck k z
k 1
] nk 2 ak k z k 1
 
k 2 ck k z
k 1
 1  
k 2 ck k z
k 1
  kn 2 ak k z k 1

 
k 2 ck k z
k 1
 1   
k 2 ck k z
k 1
   kn 2 ak k z k 1

 
k 2 | ck | k | z
k 1
|  1   k 2| ck | k | z k 1 |   kn 2| ak | k | z k 1 |
 
k 2 | ck | k | z |
k 1
 1   
k 2 | ck | k | z |
k 1
   kn 2| ak | k | z |k 1

 
k 2 | ck | k  r
k 1
 1   
k 2 | ck | k  r
k 1
   nk 2 | ak | k  r k 1

 
k 2 1  k  r
k 1
 1   
k 2 1  k  r
k 1
   k 2 1  k r
n k 1

 d k   d d  d 
r  1   r k    r k   r k  1   r k    r k
n d d n
 
k 2 dr  
 k 2 dr  k 2 dr dr k 2  
 dr k 2  dr k 2
d r2  d r2  d  n k
  1    r  1  r 
dr 1  r  dr 1  r  dr  k 0 

(1  r )2r  r 2 ( )  (1  r )2r  r 2 ( )  d 1  r n 1 
  1    dr  1  r  1  r 
(1  r )2  (1  r )2

2r  r 2  2r  r 2  (1  r )( ( n  1)r n )  (1  r n 1 )( 1) 
  1  
2 
 0  1
(1  r )  (1  r )  
2
(1  r ) 2


2r  r 2 (1  r  2r )  (2r  r )  (1  r )( n  1)r n  1  r n 1

2 2

    1
(1  r )2 (1  r )2  (1  r )2

2r  r 2 1  (1  r )( n  1)r n  r n 1 1 
  
2 
  1
(1  r ) (1  r ) 
2
(1  r )2
(1  r )2

479
IJRITCC | July 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 7 457 – 481
_______________________________________________________________________________________________
(1  r )( n  1)r n  r n 1
| ( z ) |  2r  r 2 
2
1 1
i .e.   , | z |  r.
(1  r ) (1  r )4 (1  r )4 (1  r )2

 2r  r 2 (1 r )( n 1)r n  r n 1 1 1 
 1 | ( z ) |  1     
(1 r )
2
(1 r ) 4
(1 r ) (1 r )2 
4

2r  r 2 (1  r )( n  1)r n  r n 1 1 1
i .e 1 | ( z ) |  1    
(1  r )2
(1  r ) 4
(1  r ) (1  r )2
4

1  2r  r 2 (1  r )( n  1)r n  r n 1 1
1  
(1  r )2 (1  r )4 (1  r )4

(1  r )( n  1)r n  r n 1 1 1 1
11   20  2
(1  r ) 4
(1  r ) 4
(1  r ) 4
(1  r )4
since 0  r  1 i .e. 0  1  r.
Assume that
1 1 1 1
2 0  2  (1  r )4   1 r  4
(1  r )4 (1  r )4 2 2


1
1 4  r
2

1
r  1  4  1;
2 1  12  1  0.84  0.1591
4

Thus we have
sn ( z ,f ) 
| h( z ) |2 Re 
 h( z )    1 | ( z ) |  2 
1
(1  r )4
 0, | z |  r  1  12  1
4


s ( z ,f ) 
Re  n
 h( z ) 
 0, | z |  r  1  12  1 .
4

Hence sn ( z ,f ) are close-to-cap like functions in | z |  1  4 2. / /

Concluision Entire conclusion of the 13 theorems discussed is presented in the following .

1] Any f( z )  z   
k 2 ak z
k
is univalent function in the open disc { z | z |  31  1} by

the Theorem 2.

2] Let f( z )  z   
k 2 ak z
k
is any univalent function in the disc { z | z |  1}.} Then

i ) f( z ) has the property | ak |  1 ( k  2, 3, 4,) by Theorem 1;

ii ) f( z ) is cap like function in the disc{ z | z |  61  1} by Theorem 3.

iii ) sn ( z , f)  z   kn 2 ak z k is univalent in { z | z |  31 }, n  ¥ -{1} by Theorem 6.

iv ) f( z ) is star like function in the open disc { z | z |  1  31 6  1} by Theorem 10.

480
IJRITCC | July 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 7 457 – 481
_______________________________________________________________________________________________
3] If f( z )  z   
k 2 ak z is univlent and cap like function , then z f ( z ) is star like function
k

in the disc { z | z |  1  31 6  1} by Theorem 4.

4] If f( z )  z   
k 2 ak z is star like function of order   1, then ( z  1) f( z ) is star like
k

function of order   0.4 by Theorem 5.

5] If f( z )  z   k 2 ak z k is star like function in { z | z |  1}, then sn ( z ,f ) (n  2, 3, 4,) are

star like functions in | z |  1  4 2 by Theorem 7.

6] Let L( z )  z (1  z )1 . Then sn ( z , L) ( n  2, 3, 4,) is cap like function in disc | z |  0.25

by Theorem 8.

7] Convolution of any two univalent functions f( z )  z    

k 2 ak z , and g( z )  z   k 2 bk z
k k

defined as (f  g)( z )  z    1
k 2 ak bk z is univlent function in the open disc { z | z |  3 } ,
k

and is cap like functionin the open disc { z | z |  61 } by Theorem 9.

8] Let f( z )  z   
k 2 ak z is any close-to-cap like function in { z | z |  1}. Then
k

i ) f( z ) is univalnt function by Theorem 11.

ii ) sn ( z ,f ) are close-to-cap like functions in | z |  1  4 2 by Theorem 13.

9] Let g( z )  z    
k 2 bk z is close-to-cap like function , f( z )  z   k 2 ak z . Then (f  g)( z )
k k

is close-to-cap like function provided | (f  g)( z )  g( z )  1 |  1 by Theorem 12.

REFERENCES

Beirberbach L Uber dis Koeffiizienten Potenzerihn, Welche cine Shlichta

Abbildung des Einheit skreises Vermittetn.
S.B. Preuiss Akad. Wiss L. Sitzungsb, Berlin,
138(1916) 940  955.

481
IJRITCC | July 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________