Preprint
Article

This version is not peer-reviewed.

Sharp Estimates and Symmetric Subclasses for Univalent Functions Defined by the nth Derivative of z/f(z)

Submitted:

13 October 2026

Posted:

14 October 2026

You are already at the latest version

Abstract
The Al-Refai--Darus criterion guarantees univalence of a normalized function \( f \) when a weighted sum of \( |(z/f)^{(k)}(0)| \), \( 2\le k\le n-1 \), and of \( \sup|(z/f)^{(n)}| \) does not exceed \( 1 \). For \( n\ge3 \) we study the subclass \( \mathcal C_n \) with \( a_2=\dots=a_n=0 \), in which the whole allowance goes to the \( n \) th derivative. The map \( f\mapsto(z/f)^{(n)} \) is a bijection of \( \mathcal C_n \) onto a closed ball of \( H^\infty \), which turns extremal problems into problems for bounded analytic functions. We prove sharp growth, distortion, covering-radius and coefficient bounds with the \( (n+j) \)-fold symmetric extremal functions \( z/(1+cz^{n+j}) \); the exact region of \( (a_{n+1},a_{n+2}) \), whose boundary is attained by M\"obius parameters written in closed form; and an exact radius for dilations of products \( f_1f_2/z \), sharp both for Aksentev's inequality and for univalence. The \( n \)-fold symmetric members of \( \mathcal C_n \) correspond to \( g(z^n) \) with \( g \) in the same ball, which gives the exact region of \( (a_{n+1},a_{2n+1}) \). For the larger class defined by \( a_2=0 \) and the criterion we obtain sharp bounds as well. The comparison with \( n \)-fold symmetric univalent functions records a gap; it is not a sharpening of known results.
Keywords: 
;  ;  ;  ;  ;  ;  ;  

1. Introduction

Let A be the family of functions f ( z ) = z + ∑ k ≥ 2 a k z k analytic in the disk U = { z : | z | < 1 } , and let S ⊂ A consist of the univalent ones; [1] is the standard reference. The Koebe function k ( z ) = z / ( 1 − z ) 2 is the extremal function of many problems in S . If f ∈ A has no zeros in 0 < | z | < 1 , the quotient
u f ( z ) : = z f ( z )
extends analytically across the origin with u f ( 0 ) = 1 .
A number of sufficient conditions for univalence are phrased through derivatives of u f . Aksentev [2] proved in 1958 that
z 2 f ′ ( z ) f ( z ) 2 − 1 < 1 , z ∈ U ,
guarantees f ∈ S ; the same sufficient condition was proved again, in 1972, by Ozaki and Nunokawa [3]. We call the set of f ∈ A that are zero-free in 0 < | z | < 1 and satisfy (1) Aksentev’s class V ; it is denoted U in [4]. Nunokawa, Obradović and Owa [5] observed that | u f ′ ′ | ≤ 1 implies f ∈ V , and Yang and Liu [6] found that the weaker hypothesis | u f ′ ′ | ≤ 2 still yields univalence. After a change of normalization, the Aksentev-type condition defines the class U ( λ ) of Fournier and Ponnusamy [7], for which coefficient characterizations and sections [8], logarithmic coefficients [9], growth and distortion [10,11] and further geometric properties [12] are available.
Al-Refai and Darus [13] replaced the second derivative by a derivative of arbitrary order. For an integer n ≥ 3 , a function f ∈ A with f ( z ) ≠ 0 in 0 < | z | < 1 is univalent whenever
∑ k = 2 n − 1 k − 1 k ! | μ k | + n − 1 n ! | u f ( n ) ( z ) | ≤ 1 ( z ∈ U ) ,
where μ k : = u f ( k ) ( 0 ) = d k d z k z f ( z ) | z = 0 ( k ≥ 1 ; the criterion uses 2 ≤ k ≤ n − 1 ), and the constant 1 is best possible: it is attained by the Koebe function, by the functions z / ( 1 + a z + z 2 ) with | a | ≤ 2 , and by the functions z / 1 ± z n − 2 n − 1 (for n = 3 these are the Koebe function and its rotation by π ; in general a 2 = ∓ n − 1 n − 2 ≠ 0 , so they are not in the class C n introduced below). Putting n = 2 in (2) gives back the Yang–Liu bound. Obradović and Ponnusamy [4] proved that (2) implies f ∈ V by a different argument. Writing
σ f : = ∑ k = 2 n − 1 k − 1 k ! | μ k | , Λ f : = sup z ∈ U | u f ( n ) ( z ) | ,
condition (2) is the same as σ f + n − 1 n ! Λ f ≤ 1 , and this is the form we shall use. Further criteria and geometric properties for bounded univalent functions are given in [14]. A meromorphic analogue of (2), in terms of the nth derivative of 1 / ( z f ) , together with growth and distortion estimates, is treated in [15].
The paper [13] establishes the criterion (2) and its sharpness. To the best of our knowledge, quantitative information about the class (2) itself, such as growth, distortion or coefficient estimates and statements on products, has not been published; the aim of this paper is to supply it.
Since (2) couples the numbers μ k with the size of u f ( n ) , the sharpest statements are obtained when every μ k vanishes and the whole allowance in (2) is given to Λ f . This is the class C n of Definition 1 below: the zero-free normalized functions with a 2 = … = a n = 0 for which the nth derivative of z / f is bounded by n ! / ( n − 1 ) in U . The vanishing of a 2 , … , a n is equivalent to that of μ 1 , … , μ n − 1 (Lemma 4), and members of C n are univalent because they satisfy (2) (Remark 1). The restriction μ 1 = … = μ n − 1 = 0 is a choice, not a consequence of the criterion; Section 3.4 treats the larger class in which only a 2 = 0 is imposed and shows exactly how much of the strength of the estimates for C n is due to the extra conditions. Moreover, every f ∈ C n begins like an n-fold symmetric function, f = z + a n + 1 z n + 1 + … , which is why symmetric subclasses and symmetric extremal functions occur naturally (Section 6).
The paper is organized as follows. Section 2 gives an exact integral representation of z / f with estimates for its remainder, the formulas relating the Taylor coefficients of f and of ( z / f ) ( n ) , and the parametrization of C n by a ball of H ∞ . Section 3 contains the estimates: a pointwise majorant for Aksentev’s quantity on the whole class (2); growth, distortion and covering radius; coefficient bounds and the exact region of ( a n + 1 , a n + 2 ) ; and sharp bounds on the larger class defined by a 2 = 0 , together with the case n = 2 . Section 4 gives the product theorem with an exact radius. Section 5 compares the estimates with classical ones for S and for n-fold symmetric univalent functions. Section 6 describes the symmetric members of C n , and Section 7 summarizes the results.

2. Preliminaries

Everything in the later sections is derived from a handful of exact formulas for the function u f = z / f . This section establishes them in the form needed, with complete proofs. Throughout, n ≥ 3 is fixed, f ∈ A has no zero in 0 < | z | < 1 , we write u = u f and μ k = u ( k ) ( 0 ) for k ≥ 1 , and we assume Λ f < ∞ (which is automatic under (2)). For a function η analytic and bounded in U we write ∥ η ∥ ∞ = sup U | η | , and H ∞ = H ∞ ( U ) denotes the Banach space of all such functions with this norm. The nth derivative of u is denoted
η ( z ) : = u ( n ) ( z ) = ∑ m ≥ 0 η m z m , | η ( z ) | ≤ Λ f ( z ∈ U ) .
Lemma 1
(Splitting of u). For every z ∈ U ,
u ( z ) = 1 + ∑ k = 1 n − 1 μ k k ! z k + Ω ( z ) , Ω ( z ) : = z n ( n − 1 ) ! ∫ 0 1 ( 1 − s ) n − 1 η ( s z ) d s .
Moreover Ω is analytic in U and Ω ( z ) = O ( z n ) as z → 0 .
Proof. 
Step 0: u is analytic in U . Since f ∈ A , we have f ( z ) / z = 1 + a 2 z + a 3 z 2 + … , which is analytic in U and equals 1 ≠ 0 at z = 0 . By hypothesis f has no zero in 0 < | z | < 1 , so f ( z ) / z has no zero in U at all, and therefore u ( z ) = 1 / f ( z ) / z is analytic in U , with u ( 0 ) = 1 . In particular all derivatives u ( k ) exist in U , so μ k = u ( k ) ( 0 ) and η = u ( n ) are well defined, and η is analytic in U .
Step 1: Taylor’s formula with integral remainder. For g : [ 0 , 1 ] → C with n continuous derivatives,
g ( 1 ) = ∑ k = 0 n − 1 g ( k ) ( 0 ) k ! + 1 ( n − 1 ) ! ∫ 0 1 ( 1 − s ) n − 1 g ( n ) ( s ) d s ;
this is the standard Taylor formula, obtained by induction on n and integration by parts.
Step 2: the choice g ( s ) = u ( s z ) . Fix z ∈ U . For s ∈ [ 0 , 1 ] we have | s z | < 1 , so g ( s ) : = u ( s z ) is defined, and it is infinitely differentiable in the real variable s because u is analytic. Since u is complex differentiable, d d s u ( s z ) = z u ′ ( s z ) , and by induction
g ( k ) ( s ) = z k u ( k ) ( s z ) ( k ≥ 0 ) .
Hence g ( 1 ) = u ( z ) , g ( 0 ) = u ( 0 ) = 1 , g ( k ) ( 0 ) = z k μ k for k ≥ 1 , and g ( n ) ( s ) = z n η ( s z ) . Substituting these into (4) gives
u ( z ) = 1 + ∑ k = 1 n − 1 μ k k ! z k + z n ( n − 1 ) ! ∫ 0 1 ( 1 − s ) n − 1 η ( s z ) d s ,
which is (3).
Step 3: Ω is analytic and O ( z n ) . By (3), Ω ( z ) = u ( z ) − 1 − ∑ k = 1 n − 1 μ k k ! z k is a difference of analytic functions, hence analytic in U . On the compact disk | w | ≤ 1 2 the continuous function η is bounded, say by C; for | z | ≤ 1 2 the points s z lie in that disk, so | Ω ( z ) | ≤ | z | n ( n − 1 ) ! C ∫ 0 1 ( 1 − s ) n − 1 d s = C n ! | z | n . Thus Ω ( z ) = O ( z n ) .    □
Lemma 2
(Size of Ω and of ( Ω / z ) ′ ). For all z ∈ U ,
| Ω ( z ) | ≤ Λ f n ! | z | n , | Ω ( z ) z ′ | ≤ n − 1 n ! Λ f | z | n − 2 .
Proof. 
Fix z ∈ U . For every s ∈ [ 0 , 1 ] the point s z lies in U , so | η ( s z ) | ≤ Λ f .
Step 1: the first estimate. From (3),
| Ω ( z ) | ≤ | z | n ( n − 1 ) ! ∫ 0 1 ( 1 − s ) n − 1 | η ( s z ) | d s ≤ | z | n Λ f ( n − 1 ) ! ∫ 0 1 ( 1 − s ) n − 1 d s = | z | n Λ f ( n − 1 ) ! · 1 n = Λ f n ! | z | n .
Step 2: a formula for ( Ω / z ) ′ . Because Ω is analytic with Ω = O ( z n ) and n ≥ 2 (Lemma 1), the quotient Ω ( z ) / z is analytic in U . By (3),
Ω ( z ) z = z n − 1 ( n − 1 ) ! J ( z ) , J ( z ) : = ∫ 0 1 ( 1 − s ) n − 1 η ( s z ) d s .
Differentiation under the integral sign is permitted (the integrand and its z-derivative are continuous on [ 0 , 1 ] × U ), so J is analytic in U and J ′ ( z ) = ∫ 0 1 ( 1 − s ) n − 1 s η ′ ( s z ) d s . The product rule gives
Ω ( z ) z ′ = ( n − 1 ) z n − 2 ( n − 1 ) ! J ( z ) + z n − 1 ( n − 1 ) ! J ′ ( z ) .
To rewrite the second term, put h ( s ) : = η ( s z ) and p ( s ) : = ( 1 − s ) n − 1 s ; then h ′ ( s ) = z η ′ ( s z ) , so
z J ′ ( z ) = ∫ 0 1 p ( s ) h ′ ( s ) d s .
Integrating by parts,
∫ 0 1 p ( s ) h ′ ( s ) d s = p ( s ) h ( s ) s = 0 s = 1 − ∫ 0 1 p ′ ( s ) h ( s ) d s = − ∫ 0 1 p ′ ( s ) η ( s z ) d s ,
because p ( 0 ) = 0 (factor s) and p ( 1 ) = 0 (factor ( 1 − s ) n − 1 with n − 1 ≥ 1 ). Here p ′ ( s ) = ( 1 − s ) n − 1 − ( n − 1 ) s ( 1 − s ) n − 2 . Therefore
z n − 1 J ′ ( z ) = z n − 2 · z J ′ ( z ) = − z n − 2 ∫ 0 1 ( 1 − s ) n − 1 − ( n − 1 ) s ( 1 − s ) n − 2 η ( s z ) d s .
Inserting this in (6) and collecting the terms with η ( s z ) ,
Ω ( z ) z ′ = z n − 2 ( n − 1 ) ! ∫ 0 1 ( n − 1 ) ( 1 − s ) n − 1 − ( 1 − s ) n − 1 + ( n − 1 ) s ( 1 − s ) n − 2 η ( s z ) d s .
The bracket equals ( n − 2 ) ( 1 − s ) n − 1 + ( n − 1 ) s ( 1 − s ) n − 2 = ( 1 − s ) n − 2 ( n − 2 ) ( 1 − s ) + ( n − 1 ) s = ( 1 − s ) n − 2 ( n − 2 + s ) , so
Ω ( z ) z ′ = z n − 2 ( n − 1 ) ! ∫ 0 1 ( 1 − s ) n − 2 ( n − 2 + s ) η ( s z ) d s .
Step 3: the second estimate. The weight ( 1 − s ) n − 2 ( n − 2 + s ) is non-negative on [ 0 , 1 ] , and | η ( s z ) | ≤ Λ f , so (7) yields
| Ω ( z ) z ′ | ≤ | z | n − 2 Λ f ( n − 1 ) ! ∫ 0 1 ( 1 − s ) n − 2 ( n − 2 + s ) d s .
With t = 1 − s we have n − 2 + s = n − 1 − t , hence
∫ 0 1 ( 1 − s ) n − 2 ( n − 2 + s ) d s = ∫ 0 1 t n − 2 ( n − 1 − t ) d t = ( n − 1 ) · 1 n − 1 − 1 n = n − 1 n .
Therefore | ( Ω / z ) ′ | ≤ | z | n − 2 Λ f ( n − 1 ) ! · n − 1 n = n − 1 n ! Λ f | z | n − 2 , since ( n − 1 ) ! n = n ! .    □
The first estimate in (5) is used in the growth, distortion, covering and product theorems (Theorems 2, 3, 7) and in the proof of Proposition 1; the second is used only in Theorems 1, 3 and 7, where the quantity z Ω ′ − Ω = z 2 ( Ω / z ) ′ appears.
Lemma 3
(Coefficients of Ω ). Writing Ω ( z ) = ∑ j ≥ 0 δ j z n + j , one has
δ j = η j j ! ( n + j ) ! ( j ≥ 0 ) ,
and | η j | ≤ Λ f for every j ≥ 0 . The identity (8) uses only that η is analytic in U .
Proof. 
The formula for δ j . Fix ρ ∈ ( 0 , 1 ) . The Taylor series ∑ m η m w m of the analytic function η has radius of convergence at least 1, so it converges uniformly on the closed disk | w | ≤ ρ . For | z | ≤ ρ and s ∈ [ 0 , 1 ] we have | s z | ≤ ρ ; hence ∑ m η m s m z m = η ( s z ) with uniform convergence in ( s , z ) ∈ [ 0 , 1 ] × { | z | ≤ ρ } , and the series may be integrated termwise in (3):
Ω ( z ) = z n ( n − 1 ) ! ∑ m ≥ 0 η m z m ∫ 0 1 ( 1 − s ) n − 1 s m d s .
The integral is a Beta integral, ∫ 0 1 ( 1 − s ) n − 1 s m d s = B ( m + 1 , n ) = Γ ( m + 1 ) Γ ( n ) Γ ( m + n + 1 ) = m ! ( n − 1 ) ! ( n + m ) ! . Therefore
Ω ( z ) = ∑ m ≥ 0 η m m ! ( n + m ) ! z n + m ( | z | ≤ ρ ) .
As ρ < 1 was arbitrary this holds in U , and by uniqueness of Taylor coefficients the coefficient of z n + j is δ j = η j j ! / ( n + j ) ! .
The bound | η j | ≤ Λ f is Cauchy’s estimate for the Taylor coefficients of a function bounded by Λ f in U (apply the Cauchy integral formula on | w | = ρ and let ρ → 1 − ).    □
For j ≥ 1 the bound | η j | ≤ Λ f is not sharp in general (Wiener’s inequality [17,18] gives | η j | ≤ Λ f − | η 0 | 2 / Λ f for j ≥ 1 ). The improvement is needed only for j = n , in the proof of Theorem 5(b), where it is proved.
We now single out the family studied in the rest of the paper.
Definition 1
(The class C n ). For an integer n ≥ 3 ,
C n : = { f ∈ A : f ( z ) ≠ 0 ( 0 < | z | < 1 ) , a 2 = a 3 = … = a n = 0 , sup z ∈ U | d n d z n z f ( z ) | ≤ n ! n − 1 } .
Equivalently, C n consists of the f ∈ A without zeros in 0 < | z | < 1 for which a 2 = … = a n = 0 and Λ f ≤ n ! / ( n − 1 ) . We write M n : = n ! / ( n − 1 ) .
Lemma 4
(Identification of C n and the tail identity). Let f ∈ A have no zero in 0 < | z | < 1 .
(a) μ 1 = … = μ n − 1 = 0 if and only if a 2 = … = a n = 0 .
(b)If these conditions hold, then
a n + 1 + j = − η j j ! ( n + j ) ! = − δ j ( 0 ≤ j ≤ n − 1 ) .
(c)Identity (9) fails for j = n : under the same conditions,
a 2 n + 1 = δ 0 2 − δ n = η 0 2 ( n ! ) 2 − η n n ! ( 2 n ) ! .
Proof.(a), “if”. Suppose a 2 = … = a n = 0 . Then f ( z ) = z 1 + ϑ ( z ) with ϑ ( z ) = ∑ k ≥ n a k + 1 z k analytic in U and ϑ ( z ) = O ( z n ) . Since 1 + ϑ ( 0 ) = 1 ≠ 0 , the function 1 / ( 1 + ϑ ) is analytic near 0, and for | ϑ ( z ) | < 1 it equals the geometric series 1 − ϑ + ϑ 2 − … , each term beyond the first being O ( z n ) . Hence u ( z ) = 1 / ( 1 + ϑ ( z ) ) = 1 + O ( z n ) near 0, i.e. the Taylor coefficients μ k / k ! of u vanish for 1 ≤ k ≤ n − 1 .
(a), “only if”, and (b). Suppose μ 1 = … = μ n − 1 = 0 . Then (3) reads u = 1 + Ω , and since u = z / f ,
f ( z ) 1 + Ω ( z ) = z ( z ∈ U ) .
Write f ( z ) = ∑ p ≥ 1 a p z p with a 1 = 1 , and Ω ( z ) = ∑ j ≥ 0 δ j z n + j (Lemma 3). The coefficient of z m in the product f ( z ) Ω ( z ) is the sum of δ j a p over all pairs ( j , p ) with j ≥ 0 , p ≥ 1 and ( n + j ) + p = m , that is, over j ≥ 0 with n + j ≤ m − 1 , taking p = m − n − j . Comparing the coefficients of z m on both sides of (11), for every m ≥ 2 (where the right side contributes 0),
a m + ∑ j ≥ 0 n + j ≤ m − 1 δ j a m − n − j = 0 .
Range 2 ≤ m ≤ n . The sum in (12) is empty, because it would require n + j ≤ m − 1 ≤ n − 1 with j ≥ 0 . Hence a m = 0 for 2 ≤ m ≤ n . This proves “only if” in (a).
Range n + 1 ≤ m ≤ 2 n . In (12) the index p = m − n − j satisfies 1 ≤ p ≤ m − n ≤ n . By the previous paragraph a p = 0 for 2 ≤ p ≤ n , so only the term with p = 1 survives. It occurs for j = m − n − 1 , which satisfies 0 ≤ j ≤ n − 1 because n + 1 ≤ m ≤ 2 n , and it equals δ m − n − 1 a 1 = δ m − n − 1 . Hence a m = − δ m − n − 1 . Writing m = n + 1 + j with 0 ≤ j ≤ n − 1 and using (8) gives (9).
(c). Take m = 2 n + 1 in (12). Now j ranges over 0 ≤ j ≤ n (from n + j ≤ 2 n ), and p = m − n − j = n + 1 − j runs through n + 1 , n , … , 1 as j = 0 , 1 , … , n . For 1 ≤ j ≤ n − 1 we have 2 ≤ p ≤ n , so a p = 0 . The remaining two terms are: j = 0 , p = n + 1 , equal to δ 0 a n + 1 = − δ 0 2 by (9); and j = n , p = 1 , equal to δ n a 1 = δ n . So (12) reads a 2 n + 1 − δ 0 2 + δ n = 0 , i.e. a 2 n + 1 = δ 0 2 − δ n . Finally δ 0 = η 0 / n ! and δ n = η n n ! / ( 2 n ) ! by (8).    □
Remark 1.
By Lemma 4(a), every f ∈ C n has μ 1 = … = μ n − 1 = 0 , hence σ f = 0 , and (2) reduces to Λ f ≤ n ! / ( n − 1 ) , which is precisely the last requirement in Definition 1. So C n lies inside the class defined by (2) and its members are univalent [13]. It is the part of that class where the whole allowance in (2) is spent on Λ f and none on the μ k ; this is what makes (9) a one-to-one dictionary between the first n non-trivial coefficients of f and the first n Taylor coefficients of η, with no cross terms. Note that (2) says nothing about μ 1 , so μ 1 = 0 is a genuine extra requirement in C n . Univalence of the members of C n is used in this paper only in the sharpness part of Corollary 1; the univalence of F s in Theorem 7 comes from Aksentev’s theorem, and none of the estimates of Section 3 needs univalence.
Lemma 5
(Monomial test functions). Let p ≥ 2 be an integer, 0 < c ≤ 1 , and f ( z ) = z / ( 1 + c z p ) . Then f ∈ A , f has no zero in 0 < | z | < 1 , and u f ( z ) = 1 + c z p . Moreover:
(a)if p < n , then Λ f = 0 , μ p = c p ! , and μ k = 0 for all other k ∈ { 1 , … , n − 1 } ;
(b)if p ≥ n , then μ k = 0 for 1 ≤ k ≤ n − 1 , a 2 = … = a p = 0 , a p + 1 = − c , and Λ f = c p ! / ( p − n ) ! .
Proof. 
Since | c z p | < 1 in U , the denominator 1 + c z p does not vanish there; the expansion f ( z ) = z ( 1 − c z p + c 2 z 2 p − … ) shows f ∈ A , a k = 0 for 2 ≤ k ≤ p and a p + 1 = − c . Obviously u f = 1 + c z p , so u f ( k ) ( 0 ) = c p ! for k = p and 0 for the other k ≥ 1 . Finally u f ( n ) ( z ) ≡ 0 if p < n , while for p ≥ n it equals c p ! ( p − n ) ! z p − n , whose supremum over U is c p ! / ( p − n ) ! .    □
The next proposition says that C n is as large as a ball of H ∞ , and it turns every sharpness question about C n into a question about bounded analytic functions.
Proposition 1
(Parametrization of C n ). Let B n be the closed ball of radius M n = n ! / ( n − 1 ) in H ∞ ( U ) . The map
Φ : C n → B n , Φ ( f ) = z f ( n ) ,
is a bijection. Its inverse is η ↦ z / ( 1 + Ω η ) , where Ω η ( z ) = z n ( n − 1 ) ! ∫ 0 1 ( 1 − s ) n − 1 η ( s z ) d s .
Proof. 
If f ∈ C n and η = Φ ( f ) , then η ∈ B n by definition, and Lemma 1 with μ 1 = … = μ n − 1 = 0 gives z / f = 1 + Ω η . Hence Φ is injective and its inverse has the stated form.
Conversely let η ∈ B n and define Ω η as above; it is analytic in U . The first estimate in (5) (whose proof only uses | η | ≤ M n ) gives | Ω η ( z ) | ≤ M n n ! | z | n = | z | n n − 1 ≤ 1 2 , because n ≥ 3 . Hence u : = 1 + Ω η has no zeros, and f : = z / u ∈ A has no zeros in 0 < | z | < 1 . Since Ω η = O ( z n ) , we get u = 1 + O ( z n ) and so a 2 = … = a n = 0 by Lemma 4(a). By termwise integration (Lemma 3), Ω η ( z ) = ∑ j η j j ! ( n + j ) ! z n + j , and differentiating n times gives u ( n ) = η . Thus sup | u ( n ) | ≤ M n , f ∈ C n and Φ ( f ) = η .    □

3. Estimates for the Class

Several results of this section are short consequences of the representation of Section 2: Theorems 2 and 4 and Corollary 2 follow from the first estimate in (5) and Cauchy’s estimate for the coefficients of η , and are recorded because their extremal functions are explicit. The substantial results are the distortion theorem, which needs the derivative estimate of Lemma 2, Theorem 5, which needs the Schwarz–Pick and Wiener inequalities, and the product theorem (Theorem 7).

3.1. A Pointwise Majorant for Aksentev’s Quantity

Every function satisfying (2) also lies in Aksentev’s class V ; this inclusion is due to Obradović and Ponnusamy [4]. For T f : = z 2 f ′ / f 2 − 1 one has the general bound | T f | ≤ | z | 2 on all of V (Remark 2). What the criterion adds is an intermediate majorant in terms of the two quantities σ f and Λ f that enter (2); it is attained, and it is much smaller than | z | 2 on C n .
Theorem 1.
Let n ≥ 3 and let f ∈ A , with f ( z ) ≠ 0 for 0 < | z | < 1 , satisfy (2). Then for all z ∈ U
z 2 f ′ ( z ) f ( z ) 2 − 1 ≤ σ f | z | 2 + n − 1 n ! Λ f | z | n ≤ | z | 2 .
In particular f ∈ V . Both inequalities are sharp: for E 0 ( z ) = z / ( 1 + z n / ( n − 1 ) ) (here σ f = 0 ) equality holds in the first one at every z ∈ U , and for Q 2 ( z ) = z / ( 1 + z 2 ) equality holds in the second one at every z ∈ U .
Proof. 
Differentiate u = z / f : u ′ = 1 / f − z f ′ / f 2 , so z u ′ = u − z 2 f ′ / f 2 , that is
z 2 f ′ ( z ) f ( z ) 2 − 1 = u ( z ) − 1 − z u ′ ( z ) = : T ( z ) .
With u ( z ) = 1 + ∑ k ≥ 1 μ k k ! z k one has T ( z ) = − ∑ k ≥ 2 ( k − 1 ) μ k k ! z k . Split T = T 1 + T 2 at k = n . Since every term of T 1 has k ≥ 2 and | z | < 1 ,
| T 1 ( z ) | = | ∑ k = 2 n − 1 ( k − 1 ) μ k k ! z k | ≤ ∑ k = 2 n − 1 k − 1 k ! | μ k | | z | k ≤ σ f | z | 2 .
By Lemma 1, ∑ k ≥ n μ k k ! z k = Ω ( z ) , so T 2 ( z ) = − ∑ k ≥ n ( k − 1 ) μ k k ! z k = Ω ( z ) − z Ω ′ ( z ) = − z 2 Ω ( z ) / z ′ . The second estimate in (5) gives | T 2 ( z ) | ≤ n − 1 n ! Λ f | z | n . Adding the two bounds proves the first inequality in (13). For the second, | z | n ≤ | z | 2 and (2) give σ f | z | 2 + n − 1 n ! Λ f | z | n ≤ | z | 2 σ f + n − 1 n ! Λ f ≤ | z | 2 . Since | z | 2 < 1 , (1) holds.
For E 0 , u = 1 + z n / ( n − 1 ) and T ( z ) = z n n − 1 − n z n n − 1 = − z n , while σ E 0 = 0 and Λ E 0 = n ! / ( n − 1 ) (Lemma 5(b)); so the right-hand side of the first inequality is | z | n = | T ( z ) | . For Q 2 one has u = 1 + z 2 , T ( z ) = − z 2 , μ 2 = 2 , σ = 1 , Λ = 0 (Lemma 5(a)), and the right-hand side of the second inequality is | z | 2 .    □
Remark 2.
Let f ∈ V , that is, | T f | < 1 in U . As in the proof, T f = u − 1 − z u ′ = − ∑ k ≥ 2 ( k − 1 ) μ k k ! z k is analytic in U with T f ( 0 ) = T f ′ ( 0 ) = 0 . Schwarz’s lemma applied to T f and then to T f / z gives | T f ( z ) | ≤ | z | 2 forevery f ∈ V , with equality at one point only for T f = e i θ z 2 (e.g. Q 2 ). Hence the second inequality in (13) and its sharpness are the Schwarz bound for V ; together with the inclusion (2) ⇒ f ∈ V of [4] it is known in substance. The new content of Theorem 1 is the first inequality, in terms of σ f and Λ f , and its sharpness through E 0 . For n = 2 the same computation gives | T f | ≤ 1 2 Λ f | z | 2 under | u ′ ′ | ≤ Λ f .
The classes cut out by (2) for different values of n do not form a chain, as two explicit functions show; neither lies in C n (Example 1 has μ 2 ≠ 0 , and Example 2 violates (2) for n = 3 ). Example 1 satisfies (2) for n = 3 but not the Yang–Liu condition, and Example 2 does the reverse.
Example 1.
Let f ( z ) = z / ( 1 + 0.2 z 2 + 0.4 z 3 ) . Then u f = 1 + 0.2 z 2 + 0.4 z 3 , μ 2 = 0.4 and u f ′ ′ ′ ≡ 2.4 , so for n = 3 the left side of (2) equals 1 2 ( 0.4 ) + 1 3 ( 2.4 ) = 1 , and f satisfies (2). On the other hand sup U | u f ′ ′ | = sup | 0.4 + 2.4 z | = 2.8 > 2 , so the Yang–Liu condition ( n = 2 ) fails.
Example 2.
Let f ( z ) = z / ( 1 + 0.15 z 4 ) . Then u f ′ ′ ( z ) = 1.8 z 2 , so sup U | u f ′ ′ | = 1.8 ≤ 2 and the Yang–Liu condition holds. For n = 3 , however, μ 2 = 0 and u f ′ ′ ′ ( z ) = 3.6 z , giving 1 3 · 3.6 = 1.2 > 1 , so (2) fails.
Consequently the classes for different n share the ceiling | T f | ≤ | z | 2 of V rather than forming an increasing chain.

3.2. Growth, Distortion and Covering Radius

Theorem 2
(Growth). Let f ∈ C n and r = | z | < 1 . Then
| z f ( z ) − 1 | ≤ r n n − 1 and r 1 + r n n − 1 ≤ | f ( z ) | ≤ r 1 − r n n − 1 .
Both bounds on | f ( z ) | are sharp for every n ≥ 3 : equality holds at every fixed r for
E 0 ( z ) = z 1 + z n n − 1 ,
at arg z = 0 for the lower bound and at arg z = π / n for the upper bound.
Proof. 
For f ∈ C n we have μ 1 = … = μ n − 1 = 0 (Lemma 4), so z / f − 1 = Ω , and the first estimate in (5) with Λ f ≤ n ! / ( n − 1 ) gives | z / f − 1 | ≤ r n / ( n − 1 ) . As n ≥ 3 , r n / ( n − 1 ) < 1 , hence
1 − r n n − 1 ≤ | z f ( z ) | ≤ 1 + r n n − 1 ,
and inverting yields the bounds for | f ( z ) | .
For sharpness apply Lemma 5(b) with p = n and c = 1 / ( n − 1 ) ≤ 1 2 : the function E 0 lies in A , has no zero in 0 < | z | < 1 , satisfies a 2 = … = a n = 0 , and Λ E 0 = n ! n − 1 , so E 0 ∈ C n (on the boundary of the family). For z = r we get | E 0 ( r ) | = r / ( 1 + r n / ( n − 1 ) ) , the lower bound; for z = r e i π / n we have z n = − r n and | E 0 ( z ) | = r / ( 1 − r n / ( n − 1 ) ) , the upper bound. This holds for each r ∈ [ 0 , 1 ) and each n ≥ 3 .    □
The first inequality in (14) is also sharp (equality for E 0 at every z). Letting r → 1 gives sup U | f | ≤ n − 1 n − 2 , sharp by E 0 at z = r e i π / n , r → 1 ; so C n consists of bounded univalent functions (compare [14]).
Figure 1 shows, for several n, the image of a circle close to ∂ U under E 0 ; the curves are simple, as expected for a univalent map.
Figure 2 confirms numerically that the two bounds in (14) are attained at the predicted angles.
Figure 3 plots both bounds against r, showing how the admissible region for | f ( z ) | narrows as n increases.
Example 3.
Take n = 3 and E 0 ( z ) = z / ( 1 + z 3 / 2 ) = z − 1 2 z 4 + 1 4 z 7 − … . Then u = 1 + z 3 / 2 , μ 1 = μ 2 = 0 , u ′ ′ ′ ≡ 3 = 3 ! / ( 3 − 1 ) , so E 0 ∈ C 3 . For r = 0.8 the bounds in (14) are 0.8 / ( 1 + 0 . 8 3 / 2 ) = 0.6369 … and 0.8 / ( 1 − 0 . 8 3 / 2 ) = 1.0753 … ; direct evaluation gives | E 0 ( 0.8 ) | = 0.6369 … and | E 0 ( 0.8 e i π / 3 ) | = 1.0753 … .
The growth theorem is a direct consequence of (5). The distortion theorem below needs the derivative estimate in an essential way.
Theorem 3
(Distortion). Let f ∈ C n and r = | z | < 1 . Then
1 − r n 1 + r n n − 1 2 ≤ | f ′ ( z ) | ≤ 1 + r n 1 − r n n − 1 2 .
Both bounds are sharp: for E 0 equality holds at every r, at arg z = 0 in the lower bound and at arg z = π / n in the upper one.
Proof. 
Let u = z / f = 1 + Ω . From f = z / u we get f ′ = ( u − z u ′ ) / u 2 , and u − z u ′ = 1 + Ω − z Ω ′ = 1 − z 2 ( Ω / z ) ′ . By the second estimate in (5) and Λ f ≤ n ! / ( n − 1 ) , | z 2 ( Ω / z ) ′ | ≤ n − 1 n ! Λ f r n ≤ r n , hence 1 − r n ≤ | u − z u ′ | ≤ 1 + r n . By the first estimate, 1 − r n n − 1 ≤ | u | ≤ 1 + r n n − 1 , which gives (15).
For E 0 we have u = 1 + z n / ( n − 1 ) and u − z u ′ = 1 − z n , so E 0 ′ ( z ) = ( 1 − z n ) / ( 1 + z n / ( n − 1 ) ) 2 . At z = r this is the lower bound and at z = r e i π / n (where z n = − r n ) the upper bound.    □
Corollary 1
(Covering radius). Every f ∈ C n satisfies f ( U ) ⊃ { w : | w | < n − 1 n } , and the radius n − 1 n cannot be increased: E 0 ( U ) does not contain E 0 ( 1 ) = n − 1 n .
Proof. 
Fix 0 < r < 1 and let m ( r ) = min | z | = r | f ( z ) | ≥ r / ( 1 + r n / ( n − 1 ) ) by Theorem 2. The set f ( U r ) , U r = { | z | < r } , is open (open mapping theorem) and contains 0, and its boundary lies in f ( { | z | = r } ) , because ∂ f ( U r ) ⊂ f ( U r ) ¯ ∖ f ( U r ) ⊂ f ( U r ¯ ) ∖ f ( U r ) . If some w with | w | < m ( r ) were not in f ( U r ) , the segment from 0 to w would meet ∂ f ( U r ) at a point of modulus < m ( r ) , which is impossible. Hence f ( U ) ⊃ { | w | < m ( r ) } , and letting r → 1 − gives the radius lim r / ( 1 + r n / ( n − 1 ) ) = n − 1 n .
The first part used only the open mapping theorem; univalence enters only in the sharpness part. For sharpness note that E 0 ∈ C n is univalent in U (Remark 1), extends continuously to U ¯ (the denominator does not vanish on | z | = 1 since n ≥ 3 ), and E 0 ( 1 ) = n − 1 n . Suppose E 0 ( z 0 ) = E 0 ( 1 ) with | z 0 | < 1 . As E 0 ′ ( z 0 ) = ( 1 − z 0 n ) / ( … ) 2 ≠ 0 (note that E 0 ′ ( z ) = 0 exactly when z n = 1 , so E 0 is not locally univalent at the boundary point z = 1 , which is why a limiting argument is used instead of univalence on a larger disk), E 0 maps a neighborhood V ⋐ U of z 0 onto a neighborhood of E 0 ( 1 ) . For r close to 1 the point E 0 ( r ) lies in that neighborhood, so E 0 ( r ) = E 0 ( v ) with v ∈ V , and univalence gives r = v ∈ V , which is false for r close to 1. Therefore E 0 ( 1 ) ∉ E 0 ( U ) .    □

3.3. Coefficient Bounds

For f ∈ C n identity (9) makes the first n non-trivial coefficients a n + 1 , … , a 2 n proportional to η 0 , … , η n − 1 , and Lemma 3 bounds each η j . The next two theorems are direct consequences.
Theorem 4.
Let f ∈ C n . For every j = 0 , 1 , … , n − 1 ,
| a n + 1 + j | ≤ 1 ( n − 1 ) n + j j ,
and equality holds for
E j ( z ) = z 1 + z n + j ( n − 1 ) n + j j .
For E j , a k = 0 for 2 ≤ k ≤ n + j and for n + j + 2 ≤ k ≤ 2 ( n + j ) , and a n + j + 1 = − 1 / [ ( n − 1 ) n + j j ] .
Proof. 
By (9), Lemma 3 and the definition of C n ,
| a n + 1 + j | = | η j | j ! ( n + j ) ! ≤ Λ f j ! ( n + j ) ! ≤ n ! n − 1 · j ! ( n + j ) ! = 1 ( n − 1 ) n + j j ,
because n + j j = ( n + j ) ! n ! j ! .
For sharpness let p = n + j and c = 1 / [ ( n − 1 ) n + j j ] ≤ 1 2 in Lemma 5(b). Then Λ E j = c ( n + j ) ! j ! = n ! n − 1 , so E j ∈ C n , and a n + j + 1 = − c . Since 0 < c ≤ 1 2 and | z | < 1 , we have | c z p | < 1 , so the geometric series 1 1 + c z p = ∑ m ≥ 0 ( − c z p ) m converges, and
E j ( z ) = z ∑ m ≥ 0 ( − c ) m z p m = z − c z p + 1 + c 2 z 2 p + 1 − …
with p = n + j . Thus the only non-zero coefficients of E j are a p m + 1 = ( − c ) m ( m ≥ 0 ); in particular a k = 0 for 2 ≤ k ≤ p and for p + 2 ≤ k ≤ 2 p , and a p + 1 = − c .    □
For the logarithmic coefficients write log f ( z ) / z = 2 ∑ k ≥ 1 ℓ k z k ; the branch is fixed by log f ( z ) / z = 0 at z = 0 , and it exists because f ( z ) / z = 1 / u f ( z ) is analytic and zero-free in U .
Corollary 2.
Let f ∈ C n . For every j = 0 , 1 , … , n − 1 ,
| ℓ n + j | ≤ 1 2 ( n − 1 ) n + j j ,
with equality for E j of (17).
Proof. 
On C n , u = 1 + Ω and so log f ( z ) / z = − log ( 1 + Ω ( z ) ) = − Ω ( z ) + 1 2 Ω ( z ) 2 − … . Since Ω 2 = O ( z 2 n ) , for j ≤ n − 1 the coefficient of z n + j on the right is − δ j , which equals a n + 1 + j by (9). Thus 2 ℓ n + j = a n + 1 + j and (18) follows from (16). Equality passes to E j because it holds in (16).    □
Example 4.
Let n = 3 and j = 1 . Then (16) gives | a 5 | ≤ 1 / [ 2 4 1 ] = 1 8 , attained by E 1 ( z ) = z / ( 1 + z 4 / 8 ) = z − 1 8 z 5 + O ( z 9 ) . For the same function log ( E 1 ( z ) / z ) = − 1 8 z 4 + O ( z 8 ) , so 2 ℓ 4 = − 1 8 and | ℓ 4 | = 1 16 , the value given by (18).
Table 1 lists the numerical values of the bounds in Theorem 4 and Corollary 2 for 3 ≤ n ≤ 6 .
The following theorem goes beyond the diagonal bounds of Theorem 4: it uses the parametrization of Proposition 1, and treats a 2 n + 1 , the first coefficient at which the identity (9) breaks down.
Theorem 5.
Let n ≥ 3 .
(a)For f ∈ C n , | a n + 1 | ≤ 1 n − 1 and
| a n + 2 | ≤ 1 − ( n − 1 ) 2 | a n + 1 | 2 n 2 − 1 .
Conversely, every pair ( α , β ) with | α | ≤ 1 n − 1 and | β | ≤ 1 − ( n − 1 ) 2 | α | 2 n 2 − 1 equals ( a n + 1 , a n + 2 ) for some f ∈ C n .
(b)For f ∈ C n , | a 2 n + 1 | ≤ 1 ( n − 1 ) 2 , with equality for E 0 .
Proof. 
Preliminaries. Let f ∈ C n and η = Φ ( f ) . By Proposition 1, η ∈ B n , so φ : = η / M n = ∑ m ≥ 0 φ m z m is analytic in U with | φ | ≤ 1 , and η m = M n φ m . Since μ 1 = … = μ n − 1 = 0 (Lemma 4(a)), the identity (9) applies, and with M n = n ! / ( n − 1 ) ,
a n + 1 = − η 0 n ! = − φ 0 n − 1 , a n + 2 = − η 1 ( n + 1 ) ! = − n ! φ 1 ( n − 1 ) ( n + 1 ) ! = − φ 1 ( n − 1 ) ( n + 1 ) .
We shall use the following form of the Schwarz–Pick inequality: if ψ is analytic in U with | ψ | ≤ 1 , then
| ψ ′ ( 0 ) | ≤ 1 − | ψ ( 0 ) | 2 .
Indeed, if | ψ ( 0 ) | = 1 then ψ is constant by the maximum modulus principle and ψ ′ ( 0 ) = 0 . Otherwise put b = ψ ( 0 ) , | b | < 1 , and τ ( w ) = w − b 1 − b ¯ w , a Möbius automorphism of the unit disk with τ ( b ) = 0 . Then τ ∘ ψ maps U into the closed unit disk and vanishes at 0, so Schwarz’s lemma gives | ( τ ∘ ψ ) ′ ( 0 ) | ≤ 1 . Since τ ′ ( w ) = 1 − | b | 2 ( 1 − b ¯ w ) 2 , we get τ ′ ( b ) = 1 1 − | b | 2 and ( τ ∘ ψ ) ′ ( 0 ) = ψ ′ ( 0 ) 1 − | b | 2 , which is (21).
(a), necessity. Since | φ 0 | ≤ 1 , (20) gives | a n + 1 | = | φ 0 | / ( n − 1 ) ≤ 1 n − 1 . Applying (21) to ψ = φ gives | φ 1 | ≤ 1 − | φ 0 | 2 . By (20), | φ 0 | = ( n − 1 ) | a n + 1 | and | φ 1 | = ( n 2 − 1 ) | a n + 2 | , so
( n 2 − 1 ) | a n + 2 | ≤ 1 − ( n − 1 ) 2 | a n + 1 | 2 ,
which is (19).
(a), sufficiency. Let ( α , β ) satisfy | α | ≤ 1 n − 1 and | β | ≤ 1 − ( n − 1 ) 2 | α | 2 n 2 − 1 , and put c : = − ( n − 1 ) α , so | c | ≤ 1 . If | c | = 1 , the hypothesis on β forces β = 0 ; take φ ≡ c , so φ 0 = c and φ 1 = 0 . If | c | < 1 , put
κ : = − ( n 2 − 1 ) β 1 − | c | 2 , so that | κ | ≤ ( n 2 − 1 ) 1 − | c | 2 · 1 − | c | 2 n 2 − 1 = 1 ,
and define φ ( z ) = c + κ z 1 + c ¯ κ z . This is T c ( κ z ) with T c ( w ) = c + w 1 + c ¯ w , a Möbius automorphism of the unit disk (because | c | < 1 ); since | κ z | < 1 , we have | φ | < 1 in U . Moreover φ 0 = φ ( 0 ) = c , and since T c ′ ( 0 ) = 1 − | c | 2 , φ 1 = φ ′ ( 0 ) = κ ( 1 − | c | 2 ) = − ( n 2 − 1 ) β . In both cases φ is analytic with | φ | ≤ 1 , so M n φ ∈ B n , and f : = Φ − 1 ( M n φ ) ∈ C n by Proposition 1. By (20), a n + 1 = − φ 0 / ( n − 1 ) = α and a n + 2 = − φ 1 / ( n − 1 ) ( n + 1 ) = β .
(b). By (10) and (8), a 2 n + 1 = δ 0 2 − δ n with
δ 0 = η 0 n ! = φ 0 n − 1 , δ n = η n n ! ( 2 n ) ! = φ n n ! n − 1 · n ! ( 2 n ) ! = φ n ( n − 1 ) 2 n n ,
because ( 2 n ) ! ( n ! ) 2 = 2 n n . We need | φ n | ≤ 1 − | φ 0 | 2 . Let ε = e 2 π i / n and ψ ( z ) : = 1 n ∑ k = 0 n − 1 φ ( ε k z ) . As an average of values of φ , | ψ | ≤ 1 . Since ∑ k = 0 n − 1 ε k m equals n if n ∣ m and 0 otherwise, ψ ( z ) = ∑ q ≥ 0 φ n q z n q . Put χ ( ζ ) = ∑ q ≥ 0 φ n q ζ q ; this series converges for | ζ | < 1 (take z with z n = ζ in the series of ψ ), so χ is analytic in U , and χ ( ζ ) = ψ ( z ) for any z with z n = ζ , whence | χ | ≤ 1 . Now χ ( 0 ) = φ 0 and χ ′ ( 0 ) = φ n , so (21) for χ gives | φ n | ≤ 1 − | φ 0 | 2 . With x : = | φ 0 | ∈ [ 0 , 1 ] we obtain
| a 2 n + 1 | ≤ | δ 0 | 2 + | δ n | ≤ x 2 ( n − 1 ) 2 + 1 − x 2 ( n − 1 ) 2 n n .
This is a convex combination, with weights x 2 and 1 − x 2 , of A = 1 ( n − 1 ) 2 and B = 1 ( n − 1 ) 2 n n . Since 2 n n ≥ 2 n > n − 1 we have B < A , so the combination is at most A, i.e. | a 2 n + 1 | ≤ 1 ( n − 1 ) 2 .
For equality, the function E 0 ( z ) = z 1 + z n / ( n − 1 ) = z ∑ m ≥ 0 − z n n − 1 m (geometric series, | z n / ( n − 1 ) | < 1 ) has, as the coefficient of z 2 n + 1 (the term m = 2 ) equal to 1 ( n − 1 ) 2 .    □
(a)).Remark 3 (Closed form of the extremal functions of The region in (a) depends only on | α | and | β | . By Schwarz–Pick equality, a pair on the boundary | φ 1 | = 1 − | φ 0 | 2 with | φ 0 | < 1 arises exactly from a Möbius parameter φ ( z ) = c + κ z 1 + c ¯ κ z , | c | < 1 , | κ | = 1 , that is, η = M n φ . For c ≠ 0 write φ = 1 c ¯ 1 − 1 − | c | 2 1 + p z with p = c ¯ κ . Then Ω η can be integrated in elementary terms:
Ω η ( z ) = n n − 1 z n c ¯ 1 n − ( 1 − | c | 2 ) I n ( p z ) ,
I n ( y ) = 1 y n ( 1 + y ) n − 1 log ( 1 + y ) + ∑ k = 1 n − 1 n − 1 k ( − 1 ) k ( 1 + y ) n − 1 − k ( 1 + y ) k − 1 k ,
where I n ( y ) = ∫ 0 1 ( 1 − s ) n − 1 1 + s y d s (substitute t = 1 + s y ) and the principal logarithm is used ( | y | < 1 ). The extremal function is f = z / ( 1 + Ω η ) . We checked (22) against numerical integration for n = 2 , 3 , 4 (05_verify_revision.py). So the extremal functions of(a)are explicit, involving a logarithm and a polynomial in z; those of all other results are the monomial functions E j and Q 2 .
Remark 4
(Bounds for μ k on the whole class). On the whole class (2) one has, for 2 ≤ k ≤ n − 1 , | μ k | ≤ k ! / ( k − 1 ) , because every summand of σ f is non-negative and σ f ≤ 1 . This is an immediate restatement of the criterion, and it is sharp: Q k ( z ) = z / ( 1 + z k / ( k − 1 ) ) satisfies (2) with equality and μ k = k ! / ( k − 1 ) by Lemma 5(a). For k = 2 , since μ 2 = 2 ( a 2 2 − a 3 ) , it reads | a 2 2 − a 3 | ≤ 1 . This inequality is not specific to the class (2): it holds for every univalent function, because 1 / f ( 1 / ζ ) = ζ − a 2 + ( a 2 2 − a 3 ) ζ − 1 + … belongs to the class Σ and the area theorem bounds its coefficient of ζ − 1 by 1 [1]. The case k = 2 is therefore classical (the Koebe function gives equality), and we do not present it as a Fekete–Szego-type result.

3.4. A Larger Class: a 2 = 0 and the Criterion Itself

Condition (2) does not force μ 2 , … , μ n − 1 to vanish, and the restriction μ 2 = … = μ n − 1 = 0 defining C n is a choice, not a consequence of the criterion. To measure what it buys, let D n be the set of zero-free f ∈ A with a 2 = 0 (equivalently μ 1 = 0 , because u ′ ( 0 ) = − a 2 ) that satisfy (2). Then C n ⊂ D n .
Theorem 6.
Let n ≥ 3 , f ∈ D n and r = | z | < 1 . Then | z / f − 1 | ≤ r 2 ,
r 1 + r 2 ≤ | f ( z ) | ≤ r 1 − r 2 , 1 − r 2 ( 1 + r 2 ) 2 ≤ | f ′ ( z ) | ≤ 1 + r 2 ( 1 − r 2 ) 2 ,
and f ( U ) ⊃ { | w | < 1 2 } . All these estimates are sharp, with extremal function Q 2 ( z ) = z / ( 1 + z 2 ) ∈ D n , and 1 2 cannot be replaced by a larger number.
Proof. 
By Lemma 1 with μ 1 = 0 , u − 1 = ∑ k = 2 n − 1 μ k k ! z k + Ω . Put w k = k − 1 k ! | μ k | and ω = n − 1 n ! Λ f , so ∑ k = 2 n − 1 w k + ω ≤ 1 by (2). Since r k k − 1 ≤ r 2 for k ≥ 2 (the function k ↦ r k / ( k − 1 ) decreases) and r n n − 1 ≤ r 2 , and | Ω | ≤ ω r n n − 1 by (5),
| u − 1 | ≤ ∑ k = 2 n − 1 w k r k k − 1 + ω r n n − 1 ≤ r 2 ∑ k = 2 n − 1 w k + ω ≤ r 2 .
This gives the bounds for | f | = r / | u | . By Theorem 1, | u − z u ′ − 1 | ≤ r 2 , and f ′ = ( u − z u ′ ) / u 2 gives those for | f ′ | . For Q 2 we have u = 1 + z 2 , μ 2 = 2 , σ = 1 , Λ = 0 , so (2) holds with equality and Q 2 ∈ D n ; | Q 2 ( r ) | = r / ( 1 + r 2 ) , | Q 2 ( i r ) | = r / ( 1 − r 2 ) , and Q 2 ′ ( z ) = ( 1 − z 2 ) / ( 1 + z 2 ) 2 equals the lower bound at z = r and the upper bound at z = i r . The covering statement follows as in Corollary 1 from min | z | = r | f | ≥ r / ( 1 + r 2 ) → 1 2 . Finally Q 2 ( z ) = 1 2 iff ( z − 1 ) 2 = 0 , so 1 2 ∉ Q 2 ( U ) .    □
The covering radius 1 2 is smaller than n − 1 n for every n ≥ 3 , and r 2 replaces r n / ( n − 1 ) : the strength of the estimates of C n comes precisely from the vanishing of μ 2 , … , μ n − 1 , and Theorem 6 shows that nothing better than the n = 2 values survives without it.
Remark 5
(The case n = 2 ). For n = 2 the class C 2 is the Yang–Liu class { | u ′ ′ | ≤ 2 } with a 2 = 0 , and C 2 = D 2 . The proofs of Sections 2–4 go through for n = 2 with three changes: in Proposition 1 the bound | Ω η | ≤ | z | n n − 1 ≤ 1 2 is replaced by | Ω η | ≤ | z | 2 < 1 ; the restriction c ≤ 1 2 in Lemma 5 and Theorem 4 becomes c ≤ 1 ; and in Corollary 1 the function E 0 = Q 2 has poles at ± i on the boundary of the disk of convergence of the series, so the sharpness of 1 2 is read off from Q 2 ( z ) = 1 2 ⇔ z = 1 . Univalence of C 2 is the theorem of Yang and Liu [6]. Thus the formulas of Theorems 2 and 3 and Corollary 1 for n = 2 are those of Theorem 6, with s 2 = 3 − 1 / 2 in Theorem 7. The comparisons of Section 5 with n-fold symmetric functions degenerate for n = 2 and are stated for n ≥ 3 .

4. A Product Theorem

Obradović and Ponnusamy [4] proved that if g , h ∈ S and F ( z ) = g ( z ) h ( z ) / z , then F r ( z ) = r − 1 F ( r z ) belongs to Aksentev’s class (their U , defined by (1)) for every r ∈ ( 0 , r 0 ] , where r 0 ≈ 0.3263 is the radius reported there. We prove the corresponding statement for C n , with a radius that is sharp.
Theorem 7.
Let n ≥ 3 , let f 1 , f 2 ∈ C n , and put F ( z ) = f 1 ( z ) f 2 ( z ) / z and F s ( z ) = s − 1 F ( s z ) for 0 < s < 1 . Then F s ∈ A , F s has no zero in 0 < | z | < 1 , and for all z ∈ U
z 2 F s ′ ( z ) F s ( z ) 2 − 1 ≤ 2 s n | z | n + 2 n − 1 ( n − 1 ) 2 s 2 n | z | 2 n .
Consequently, if
s ≤ s n : = n − 1 2 n − 1 1 / n ,
then F s ∈ V , and in particular F s is univalent in U . The radius s n cannot be enlarged, not even for univalence: for every s ∈ ( s n , 1 ) the pair f 1 = f 2 = E 0 gives sup U | z 2 F s ′ / F s 2 − 1 | > 1 , and F s is not univalent in U .
Proof. 
Write z / f i ( z ) = 1 + Ω i ( z ) ( i = 1 , 2 ). Then z / F ( z ) = ( 1 + Ω 1 ) ( 1 + Ω 2 ) = 1 + Ξ with Ξ = Ω 1 + Ω 2 + Ω 1 Ω 2 , and z / F s ( z ) = ( s z ) / F ( s z ) = 1 + Ξ ( s z ) . Let W s ( z ) = 1 + Ξ ( s z ) . As in the proof of Theorem 1, z 2 F s ′ / F s 2 − 1 = W s − 1 − z W s ′ , and with w = s z this equals ( Ξ − w Ξ ′ ) ( w ) . Now
Ξ − w Ξ ′ = ( Ω 1 − w Ω 1 ′ ) + ( Ω 2 − w Ω 2 ′ ) + Ω 1 ( Ω 2 − w Ω 2 ′ ) − w Ω 1 ′ Ω 2 .
For f i ∈ C n we have Λ ≤ M n , so by (5)
| Ω i | ≤ | w | n n − 1 , | Ω i − w Ω i ′ | = | w 2 ( Ω i / w ) ′ | ≤ | w | n ,
and therefore | w Ω i ′ | ≤ | Ω i | + | Ω i − w Ω i ′ | ≤ n n − 1 | w | n . Hence
| Ξ − w Ξ ′ | ≤ 2 | w | n + | w | 2 n n − 1 + n | w | 2 n ( n − 1 ) 2 = 2 | w | n + 2 n − 1 ( n − 1 ) 2 | w | 2 n ,
and (24) follows from | w | = s | z | .
Put t = s n . For | z | < 1 the right-hand side of (24) is < 2 t + 2 n − 1 ( n − 1 ) 2 t 2 , and
2 t + 2 n − 1 ( n − 1 ) 2 t 2 ≤ 1 ⇔ t ≤ t 0 : = n − 1 2 n − 1 .
(The positive root of 2 n − 1 ( n − 1 ) 2 t 2 + 2 t − 1 = 0 is ( n − 1 ) 2 2 n − 1 n n − 1 − 1 = n − 1 2 n − 1 , because the discriminant equals 4 n 2 / ( n − 1 ) 2 .) Thus s ≤ s n gives (1) for F s . It is univalent by Aksentev’s theorem, and F s ∈ A without zeros in 0 < | z | < 1 is clear from the definition.
For sharpness take f 1 = f 2 = E 0 . Then z / F s ( z ) = ( 1 + w n / ( n − 1 ) ) 2 with w = s z , and a direct computation gives z 2 F s ′ / F s 2 − 1 = − 2 w n − 2 n − 1 ( n − 1 ) 2 w 2 n . For z = ρ ∈ ( 0 , 1 ) this is − 2 t ρ n − 2 n − 1 ( n − 1 ) 2 t 2 ρ 2 n , whose modulus tends to 2 t + 2 n − 1 ( n − 1 ) 2 t 2 as ρ → 1 − , and this exceeds 1 when t > t 0 .
Finally we show that F s is not univalent for s > s n . For f 1 = f 2 = E 0 and c = 1 n − 1 we have F ( z ) = E 0 ( z ) 2 / z = z ( 1 + c z n ) − 2 , and differentiation gives
F ′ ( z ) = ( 1 + c z n ) − 2 − 2 n c z n ( 1 + c z n ) − 3 = 1 − ( 2 n − 1 ) c z n ( 1 + c z n ) 3 .
Since ( 2 n − 1 ) c = 2 n − 1 n − 1 , F ′ vanishes at every z with z n = n − 1 2 n − 1 , in particular at the positive number s n (because s n n = t 0 ). As F s ′ ( z ) = F ′ ( s z ) , for s ∈ ( s n , 1 ) the point z 0 = s n / s lies in U and F s ′ ( z 0 ) = 0 . A non-constant analytic function whose derivative vanishes at z 0 is not injective in any neighborhood of z 0 , so F s is not univalent in U .    □
Remark 6.
(a)Limit.Since n − 1 2 n − 1 = 1 2 − 1 2 ( 2 n − 1 ) → 1 2 , we have
n log s n = log n − 1 2 n − 1 ⟶ − log 2 , hence n ( 1 − s n ) → log 2 ( n → ∞ ) ,
so s n → 1 and 1 − s n ∼ ( log 2 ) / n .
(b)Interpretation.Over the class C n the radius s n is exact both for Aksentev’s inequality and for univalence of the dilated product, and this exact value gives the relative size of the room that remains, n ( 1 − s n ) → log 2 . (How this limit should be read is discussed at the start of Section 5.)
Table 2 lists the radius s n for small n.

5. Comparison with Classical Results

The class C n is contained in S , so every classical bound for S [1] holds on C n , and the bounds proved here are smaller or equal for the trivial reason that the class is smaller. Table 3 therefore carries no information beyond the size of the gap; none of its rows is a sharpening of a known theorem, and the rows about coefficients and products compare statements on classes of very different size. The same reading applies to the radius s n : that s n → 1 only reflects that | z / f − 1 | ≤ r n / ( n − 1 ) becomes a trivial restriction as n grows, and the informative statement is the exactness of s n in Theorem 7 for each fixed n. The theorems of this paper assume n ≥ 3 ; the case n = 2 is covered by Remark 5. What is known for n = 2 concerns the criterion itself (Yang–Liu, Nunokawa–Obradović–Owa) and, for the related class U ( λ ) , other quantities [7,8,9,10,12].
Since every member of C n is z + O ( z n + 1 ) , the class S n of n-fold symmetric univalent functions, with the same kind of expansion, is the closer reference.
Definition 2
(The class S n ). For an integer n ≥ 1 let S n : = { f ∈ S : f ( e 2 π i / n z ) = e 2 π i / n f ( z ) for all z ∈ U } ( S 1 = S , and S 2 is the class of odd univalent functions). Every f ∈ S n has the form f ( z ) = g ( z n ) 1 / n with g ∈ S [1], hence only the powers z k n + 1 occur in f.
Applying the classical bounds for S [1] to g gives the left column of Table 4, attained by the n-fold Koebe function z / ( 1 − z n ) 2 / n . Neither S n nor C n contains the other: | a n + 1 | ≤ 1 n − 1 < 2 n on C n , so the n-fold Koebe function is not in C n , while members of C n with a n + 2 ≠ 0 are not n-fold symmetric. Consequently the table compares extremal values, not classes.
Proposition 2.
For every integer n ≥ 3 and 0 < r < 1 :
( i ) r 1 + r n n − 1 > r ( 1 + r n ) 2 / n , ( ii ) r 1 − r n n − 1 < r ( 1 − r n ) 2 / n , ( iii ) n − 1 n > 4 − 1 / n , ( iv ) 1 n − 1 < 2 n .
Proof. 
Put t = r n ∈ ( 0 , 1 ) and p = 2 / n ∈ ( 0 , 1 ) .
(ii) The function t ↦ ( 1 − t ) p is concave, hence lies below its tangent at 0: ( 1 − t ) 2 / n ≤ 1 − 2 t n < 1 − t n − 1 , the last step because 2 n > 1 n − 1 ⇔ n > 2 . Inverting gives (ii), since r n / ( n − 1 ) < 1 .
(i) The function t ↦ ( 1 + t ) p is concave, hence lies above its chord on [ 0 , 1 ] : ( 1 + t ) 2 / n > 1 + ( 2 2 / n − 1 ) t for 0 < t < 1 . It suffices to have 2 2 / n − 1 ≥ 1 n − 1 . For n ≥ 4 , 2 2 / n = e 2 ln 2 / n > 1 + 2 ln 2 n and 2 ln 2 n ≥ 1 n − 1 ⇔ n ( 2 ln 2 − 1 ) ≥ 2 ln 2 , which holds for n ≥ 4 since 4 ( 2 ln 2 − 1 ) = 1.545 > 1.386 = 2 ln 2 . For n = 3 , 2 2 / 3 − 1 = 0.587 > 1 2 . Inverting ( 1 + t ) 2 / n > 1 + t n − 1 gives (i).
(iii) The claim is 1 + 1 n − 1 n < 4 . For n ≥ 4 , 1 + 1 n − 1 n − 1 < e and 1 + 1 n − 1 ≤ 4 3 , so the product is < 4 3 e < 3.63 < 4 . For n = 3 , ( 3 / 2 ) 3 = 3.375 < 4 .
(iv) is equivalent to n < 2 n − 2 , i.e. n > 2 .    □

6. Symmetric Members of C n

Each f ∈ C n begins like an n-fold symmetric function, f = z + a n + 1 z n + 1 + … , and differs from one first at the coefficients a n + 2 , … , a 2 n (Theorem 5). Which members are actually symmetric is answered by the parametrization of Proposition 1. Here ε m = e 2 π i / m .
Proposition 3
(Symmetric members and η ). Let f ∈ C n , η = Φ ( f ) = ∑ j ≥ 0 η j z j and m ≥ 1 . Then f ( ε m z ) = ε m f ( z ) for all z ∈ U if and only if η j = 0 unless m ∣ n + j . In particular, f is n-fold symmetric if and only if η ( z ) = g ( z n ) with g analytic in U , ∥ g ∥ ∞ = ∥ η ∥ ∞ ; and g ↦ Φ − 1 g ( z n ) is a bijection of the closed ball B n of radius M n in H ∞ onto C n ∩ S n .
Proof. 
Since u f = z / f , f ( ε z ) = ε f ( z ) ⇔ u f ( ε z ) = u f ( z ) . By Lemma 1 (with μ 1 = … = μ n − 1 = 0 ) and Lemma 3, u f = 1 + ∑ j ≥ 0 δ j z n + j with δ j = η j j ! / ( n + j ) ! , so δ j = 0 ⇔ η j = 0 . Comparing coefficients, u f ( ε z ) = u f ( z ) iff δ j ( ε n + j − 1 ) = 0 for all j, which is the stated condition. For m = n it reads η j = 0 unless n ∣ j , i.e. η ( z ) = g ( z n ) with g ( ζ ) = ∑ q η n q ζ q , and g ( ζ ) = η ( z ) whenever z n = ζ , so ∥ g ∥ ∞ = ∥ η ∥ ∞ . Conversely, for g ∈ B n the function η = g ( z n ) lies in B n , so f = Φ − 1 ( η ) ∈ C n by Proposition 1; it is n-fold symmetric by the first part and univalent by Remark 1, hence f ∈ S n . Injectivity comes from that of Φ .    □
The extremal functions are symmetric: Φ ( E j ) = M n z j , so E j = z / ( 1 + c z n + j ) is ( n + j ) -fold symmetric, and among them only E 0 is n-fold symmetric. Since E 0 attains the bounds of Theorems 2, 3 and 5(b) and the covering radius, these remain sharp on C n ∩ S n .
Theorem 8
(The pair ( a n + 1 , a 2 n + 1 ) on C n ∩ S n ). Let n ≥ 3 . For f ∈ C n ∩ S n ,
| a n + 1 | ≤ 1 n − 1 , | a 2 n + 1 − a n + 1 2 | ≤ 1 − ( n − 1 ) 2 | a n + 1 | 2 ( n − 1 ) 2 n n ,
and every pair ( α , β ) with | α | ≤ 1 n − 1 and | β − α 2 | ≤ 1 − ( n − 1 ) 2 | α | 2 ( n − 1 ) 2 n n is attained by some f ∈ C n ∩ S n . For | a n + 1 | < 1 n − 1 , equality in the second relation holds exactly for η ( z ) = M n c + κ z n 1 + c ¯ κ z n , | c | < 1 , | κ | = 1 .
Proof. 
By Proposition 3, η ( z ) = M n φ ( z n ) with φ = ∑ q φ q ζ q analytic and | φ | ≤ 1 in U ; so η 0 = M n φ 0 , η n = M n φ 1 . By (9) and (10),
a n + 1 = − η 0 n ! = − φ 0 n − 1 , a 2 n + 1 − a n + 1 2 = − η n n ! ( 2 n ) ! = − φ 1 ( n − 1 ) 2 n n ,
since M n n ! / ( 2 n ) ! = 1 / ( n − 1 ) 2 n n . Now (25) follows from | φ 0 | ≤ 1 and (21), | φ 1 | ≤ 1 − | φ 0 | 2 . Conversely, given ( α , β ) put c = − ( n − 1 ) α and choose φ with φ 0 = c and φ 1 = − ( n − 1 ) 2 n n ( β − α 2 ) as in the sufficiency part of Theorem 5(a); then f = Φ − 1 ( M n φ ( z n ) ) is in C n ∩ S n by Proposition 3 and has the given pair. Equality in (21) with | φ 0 | < 1 holds iff φ is a Möbius automorphism of U .    □
For fixed α the admissible β fill a disk centered at α 2 ; its largest modulus over the region is 1 ( n − 1 ) 2 , reached at α = ± 1 n − 1 , β = α 2 by E 0 and its rotations, so Theorem 5(b) is sharp already on C n ∩ S n .
Remark 7.
If f 1 , f 2 ∈ C n are n-fold symmetric, so are F = f 1 f 2 / z and its dilations F s . The extremal pair f 1 = f 2 = E 0 of Theorem 7 is of this kind, hence the radius s n is exact already for products of n-fold symmetric members of C n , and for s > s n the derivative of the symmetric function F s vanishes at the n points s n ε n k / s ∈ U .

7. Conclusions

We studied the subclass C n of the Al-Refai–Darus class (2), in which the whole allowance of the criterion is spent on the nth derivative of z / f . The central fact is that f ↦ ( z / f ) ( n ) is a bijection of C n onto the closed ball of radius n ! / ( n − 1 ) in H ∞ (Proposition 1), which rests on the integral representation of z / f and the estimates for its remainder (Lemmas 1–4). It gives sharp growth, distortion and covering-radius estimates, with the covering radius ( n − 1 ) / n (Theorems 2, 3, Corollary 1); sharp bounds for a n + 1 , … , a 2 n and ℓ n , … , ℓ 2 n − 1 (Theorem 4, Corollary 2); the exact region of ( a n + 1 , a n + 2 ) , with extremal functions written in closed form (Theorem 5, Remark 3); and a product theorem whose radius s n is exact both for Aksentev’s inequality and for univalence (Theorem 7). The majorant of Theorem 1 for Aksentev’s quantity holds on the whole class (2); its upper bound | z | 2 is the Schwarz-lemma bound valid for all of Aksentev’s class, and the new information is the intermediate bound with σ f and Λ f . Theorem 6 shows what is lost when μ 2 , … , μ n − 1 are allowed to be non-zero: the estimates of C n degrade to those with r 2 in place of r n / ( n − 1 ) .
As for symmetry, the extremal functions z / ( 1 + c z n + j ) are ( n + j ) -fold symmetric, the n-fold symmetric members of C n are in bijection with the same ball of H ∞ through η ( z ) = g ( z n ) , and the exact region of ( a n + 1 , a 2 n + 1 ) on them is (25) (Proposition 3, Theorem 8). The comparison with n-fold symmetric univalent functions (Proposition 2) shows that every extremal value for C n in Table 4 lies strictly inside the corresponding value for S n ; since the classes are not nested, this records a gap and is not an improvement of a known result.

Author Contributions

Conceptualization, O.A.-R. and J.S.; methodology, O.A.-R. and M.A.; software, O.A.-R. and H.U.R.; validation, O.A.-R., M.A. and K.A.-S.; formal analysis, O.A.-R. and M.A.; investigation, O.A.-R., J.S. and A.A.A.; resources, O.A.-R. and K.A.-S.; data curation, O.A.-R. and H.U.R.; writing—original draft preparation, O.A.-R.; writing—review and editing, O.A.-R., J.S., M.A., K.A.-S., H.U.R. and A.A.A.; visualization, O.A.-R. and A.A.A.; supervision, O.A.-R. and M.A.; project administration, O.A.-R. and M.A. 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.

Data Availability Statement

The scripts that verify the lemmas, the extremal functions, the closed forms and the symmetric regions, and that produce the figures (folder codes of the submission, including 05_verify_revision.py), are provided as Supplementary Material.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Duren, P.L. Univalent Functions. In Grundlehren der Mathematischen Wissenschaften; Springer: New York, NY, USA, 1983; Vol. 259. [Google Scholar]
  2. Aksentev, L.A. Sufficient Conditions for Univalence of Regular Functions. Izv. Vyss. Uchebn. Zaved. Mat. (In Russian) 1958, no. 3 (4), 3–7. [Google Scholar]
  3. Ozaki, S.; Nunokawa, M. The Schwarzian Derivative and Univalent Functions. Proc. Am. Math. Soc. 1972, 33, 392–394. [Google Scholar] [CrossRef]
  4. Obradović, M.; Ponnusamy, S. Criteria for Univalent Functions in the Unit Disk. Arch. Math. 2013, 100, 149–157. [Google Scholar] [CrossRef]
  5. Nunokawa, M.; Obradović, M.; Owa, S. One Criterion for Univalency. Proc. Am. Math. Soc. 1989, 106, 1035–1037. [Google Scholar] [CrossRef]
  6. Yang, D.; Liu, J. On a Class of Univalent Functions. Int. J. Math. Math. Sci. 1999, 22, 605–610. [Google Scholar] [CrossRef]
  7. Fournier, R.; Ponnusamy, S. A Class of Locally Univalent Functions Defined by a Differential Inequality. Complex Var. Elliptic Equ. 2007, 52, 1–8. [Google Scholar] [CrossRef]
  8. Obradović, M.; Ponnusamy, S.; Wirths, K.-J. Coefficient Characterizations and Sections for Some Univalent Functions. Sib. Math. J. 2013, 54, 679–696. [Google Scholar] [CrossRef]
  9. Obradović, M.; Ponnusamy, S.; Wirths, K.-J. Logarithmic Coefficients and a Coefficient Conjecture for Univalent Functions. Monatsh. Math. 2018, 185, 489–501. [Google Scholar] [CrossRef]
  10. Vasudevarao, A.; Yanagihara, H. On the Growth of Analytic Functions in the Class U(λ). Comput. Methods Funct. Theory 2013, 13, 613–634. [Google Scholar] [CrossRef]
  11. Obradović, M.; Ponnusamy, S. New Criteria and Distortion Theorems for Univalent Functions. Complex Var. Theory Appl. 2001, 44, 173–191. [Google Scholar] [CrossRef]
  12. Obradović, M.; Ponnusamy, S.; Wirths, K.-J. Geometric Studies on the Class U(λ). Bull. Malays. Math. Sci. Soc. 2016, 39, 1259–1284. [Google Scholar] [CrossRef]
  13. Al-Refai, O.; Darus, M. General Univalence Criterion Associated with the nth Derivative. Abstr. Appl. Anal. 2012, 2012, 307526. [Google Scholar] [CrossRef]
  14. Al-Refai, O. Criteria and Geometric Properties for Bounded Univalent Functions in the Unit Disk. Ital. J. Pure Appl. Math. 2020, 43, 828–841. [Google Scholar]
  15. Al-Refai, O. Sharp Inequalities for Univalence of Meromorphic Functions in the Punctured Unit Disk. TWMS J. Appl. Eng. Math. 2021, 11, 250–261. [Google Scholar]
  16. de Branges, L. A Proof of the Bieberbach Conjecture. Acta Math. 1985, 154, 137–152. [Google Scholar] [CrossRef]
  17. Bohr, H. A Theorem Concerning Power Series. Proc. Lond. Math. Soc. 1914, s2-13, 1–5. [Google Scholar] [CrossRef]
  18. Garnett, J.B. Bounded Analytic Functions, revised. In Graduate Texts in Mathematics, 1st ed.; Springer: New York, NY, USA, 2007; Vol. 236. [Google Scholar]
Figure 1. Images of the circle | z | = 0.999 under E 0 ( z ) = z / ( 1 + z n / ( n − 1 ) ) for n = 3 , 4 , 5 , 6 . None of the curves has a self-intersection.
Figure 1. Images of the circle | z | = 0.999 under E 0 ( z ) = z / ( 1 + z n / ( n − 1 ) ) for n = 3 , 4 , 5 , 6 . None of the curves has a self-intersection.
Preprints 238200 g001
Figure 2. | E 0 ( r e i θ ) | for θ ∈ [ 0 , 2 π ) at r = 0.8 and n = 3 , 4 , 5 , 6 . The lower bound in (14) is touched at θ = 0 and the upper bound at θ = π / n .
Figure 2. | E 0 ( r e i θ ) | for θ ∈ [ 0 , 2 π ) at r = 0.8 and n = 3 , 4 , 5 , 6 . The lower bound in (14) is touched at θ = 0 and the upper bound at θ = π / n .
Preprints 238200 g002
Figure 3. The bounds in (14) as functions of r = | z | for n = 3 , 4 , 5 , 6 .
Figure 3. The bounds in (14) as functions of r = | z | for n = 3 , 4 , 5 , 6 .
Preprints 238200 g003
Table 1. Values of the sharp bounds in Theorem 4 (upper block) and Corollary 2 (lower block). Only 0 ≤ j ≤ n − 1 is covered by the theorems, hence the dashes.
Table 1. Values of the sharp bounds in Theorem 4 (upper block) and Corollary 2 (lower block). Only 0 ≤ j ≤ n − 1 is covered by the theorems, hence the dashes.
j = 0 j = 1 j = 2 j = 3 j = 4 j = 5
bound for | a n + 1 + j |
n = 3 0.5000 0.1250 0.0500 – – –
n = 4 0.3333 0.0667 0.0222 0.0095 – –
n = 5 0.2500 0.0417 0.0119 0.0045 0.0020 –
n = 6 0.2000 0.0286 0.0071 0.0024 0.0010 0.0004
bound for | ℓ n + j |
n = 3 0.2500 0.0625 0.0250 – – –
n = 4 0.1667 0.0333 0.0111 0.0048 – –
n = 5 0.1250 0.0208 0.0060 0.0022 0.0010 –
n = 6 0.1000 0.0143 0.0036 0.0012 0.0005 0.0002
Table 2. The radius s n = ( n − 1 ) / ( 2 n − 1 ) 1 / n of Theorem 7.
Table 2. The radius s n = ( n − 1 ) / ( 2 n − 1 ) 1 / n of Theorem 7.
n 3 4 5 6 8 10
s n 0.7368 0.8091 0.8503 0.8769 0.9091 0.9280
Table 3. Classical estimates for S (sharp for S ) set beside the estimates of this paper on the much smaller class C n ( n ≥ 3 , r = | z | ; sharp for C n ). The table records the size of the gap only.
Table 3. Classical estimates for S (sharp for S ) set beside the estimates of this paper on the much smaller class C n ( n ≥ 3 , r = | z | ; sharp for C n ). The table records the size of the gap only.
Quantity Classical, class S (sharp) This paper, class C n (sharp) Result
| f ( z ) | r ( 1 + r ) 2 ≤ | f | ≤ r ( 1 − r ) 2 r 1 + r n n − 1 ≤ | f | ≤ r 1 − r n n − 1 Thm. 2
| f ′ ( z ) | 1 − r ( 1 + r ) 3 ≤ | f ′ | ≤ 1 + r ( 1 − r ) 3 1 − r n ( 1 + r n n − 1 ) 2 ≤ | f ′ | ≤ 1 + r n ( 1 − r n n − 1 ) 2 Thm. 3
Covering radius of f ( U ) 1 4 (Koebe) n − 1 n Cor. 1
Coefficients | a k | ≤ k [16] | a n + 1 + j | ≤ 1 ( n − 1 ) n + j j , 0 ≤ j ≤ n − 1 ; | a 2 n + 1 | ≤ 1 ( n − 1 ) 2 Thms. 4, 5
Aksentev’s inequality | u f ′ ′ | ≤ 1 ⇒ f ∈ V [5]; | u f ′ ′ | ≤ 2 ⇒ f ∈ S [6] (2) ⇒ | z 2 f ′ / f 2 − 1 | ≤ σ f | z | 2 + n − 1 n ! Λ f | z | n ; the bound | z | 2 holds on all of V (Schwarz) Thm. 1
Products g , h ∈ S ⇒ F r ∈ V for r ≤ r 0 ≈ 0.3263 [4] f 1 , f 2 ∈ C n ⇒ F s ∈ V (so univalent) for s ≤ s n = n − 1 2 n − 1 1 / n ; for larger s, F s can fail to be univalent Thm. 7
Table 4. Sharp values on S n (classical) and on C n (this paper), n ≥ 3 , r = | z | . By Proposition 2 each value for C n lies strictly inside the one for S n .
Table 4. Sharp values on S n (classical) and on C n (this paper), n ≥ 3 , r = | z | . By Proposition 2 each value for C n lies strictly inside the one for S n .
Quantity Class S n Class C n
| f ( z ) | ≥ r ( 1 + r n ) 2 / n r 1 + r n n − 1
| f ( z ) | ≤ r ( 1 − r n ) 2 / n r 1 − r n n − 1
Covering radius 4 − 1 / n n − 1 n
| a n + 1 | ≤ 2 n 1 n − 1
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.