1. Introduction
Let
$\mathcal {H}$
denote the class of analytic functions in the unit disk
$\mathbb {D}:=\{z\in \mathbb {C}:\, |z|<1\}$
. Here
$\mathcal {H}$
is a locally convex topological vector space endowed with the topology of uniform convergence over compact subsets of
$\mathbb {D}$
. Let
$\mathcal {A}$
denote the class of functions
$f\in \mathcal {H}$
such that
$f(0)=0$
and
$f'(0)=1$
. Let
$\mathcal {S}$
denote the subclass of
$\mathcal {A}$
consisting of functions which are univalent (that is, one-to-one) in
$\mathbb {D}$
. If
$f\in \mathcal {A}$
, then it has the series representation
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqn1.png?pub-status=live)
For
$q,n \in \mathbb {N}$
, the Hankel determinant
$H_{q,n}(f)$
of the Taylor coefficients of the function
$f \in \mathcal {A}$
of the form (1.1) is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu1.png?pub-status=live)
Hankel determinants of various orders have been studied in many contexts (see for instance [Reference Allu, Lecko and Thomas5]). The Fekete–Szegö functional is the second Hankel determinant
$H_{2,1}(f)$
. Fekete–Szegö obtained estimates for
$|a_3 - \mu a_2 ^2|$
with
$\mu $
real (see [Reference Duren10, Theorem 3.8]).
Let g be the inverse function of
$f\in \mathcal {S}$
defined in a neighbourhood of the origin with the Taylor series expansion
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqn2.png?pub-status=live)
where we may choose
$|w| < 1/4$
from Koebe’s
$1/4$
-theorem. Using variational methods, Löwner [Reference Löwner16] obtained the sharp estimate
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu2.png?pub-status=live)
where
$K_n = (2n)!/(n!(n + 1)!)$
and
$K(w) = w + K_2w^2 + K_3w^3 + \cdots $
is the inverse of the Koebe function. Let
$f(z)= z+\sum _{n=2}^{\infty }a_n z^n $
be a function in class
$\mathcal {S}$
. Since
$f(f^{-1})(w)=w$
, it follows from (1.2) that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu3.png?pub-status=live)
The logarithmic coefficients
$\gamma _{n}$
of
$f\in \mathcal {S}$
are defined by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqn3.png?pub-status=live)
Few exact upper bounds for
$\gamma _{n}$
have been established. The significance of this problem in the context of the Bieberbach conjecture was pointed out by Milin [Reference Milin17]. Milin’s conjecture that for
$f\in \mathcal {S}$
and
$n\ge 2$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu4.png?pub-status=live)
led De Branges, by proving this conjecture, to the proof of the Bieberbach conjecture [Reference de Branges9]. For the Koebe function
$k(z)=z/(1-z)^{2}$
, the logarithmic coefficients are
$\gamma _{n}=1/n$
. Since the Koebe function k plays the role of extremal function for most of the extremal problems in the class
$\mathcal {S}$
, it might be expected that
$|\gamma _{n}|\le 1/n$
holds for functions in
$\mathcal {S}$
. However, this is not true in general, even in order of magnitude. Indeed, there exists a bounded function f in the class
$\mathcal {S}$
with logarithmic coefficients
$\gamma _{n}\ne O(n^{-0.83})$
(see [Reference Duren10, Theorem 8.4]). By differentiating (1.3) and equating coefficients,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqn4.png?pub-status=live)
If
$f\in \mathcal {S}$
, it is easy to see that
$|\gamma _{1}|\le 1$
, because
$|a_2| \leq 2$
. Using the Fekete–Szegö inequality [Reference Duren10, Theorem 3.8] for functions in
$\mathcal {S}$
in (1.3), we obtain the sharp estimate
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu5.png?pub-status=live)
For
$n\ge 3$
, the problem seems much harder and no significant bound for
$|\gamma _{n}|$
when
$f\in \mathcal {S}$
appears to be known. In 2017, Ali and Allu [Reference Ali and Allu1] obtained initial logarithmic coefficient bounds for close-to-convex functions. For recent results on several subclasses of close-to-convex functions, see [Reference Ali and Allu2, Reference Cho, Kowalczyk, Kwon, Lecko and Sim6, Reference Ponnusamy, Sharma and Wirths21].
The notion of logarithmic inverse coefficients, that is, logarithmic coefficients of the inverse of f, was proposed by Ponnusamy et al. [Reference Ponnusamy, Sharma and Wirths20]. The logarithmic inverse coefficients
$\Gamma _n$
,
$n \in \mathbb {N}$
, of f are defined by the equation
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu6.png?pub-status=live)
In [Reference Ponnusamy, Sharma and Wirths20], Ponnusamy et al. found sharp upper bounds for the logarithmic inverse coefficients for the class
$\mathcal {S}$
, namely
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu7.png?pub-status=live)
with equality only for the Koebe function or one of its rotations. Ponnusamy et al. [Reference Ponnusamy, Sharma and Wirths20] also obtained sharp bounds for the initial logarithmic inverse coefficients for some of the important geometric subclasses of
$ \mathcal {S}$
.
Recently, Kowalczyk and Lecko [Reference Kowalczyk and Lecko12] proposed the study of the Hankel determinant whose entries are logarithmic coefficients of
$ f \in \mathcal {S}$
, given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu8.png?pub-status=live)
Kowalczyk and Lecko [Reference Kowalczyk and Lecko12] obtained a sharp bound for the second Hankel determinant
$H_{2,1}(F_f/2)$
for starlike and convex functions. Sharp bounds for
$H_{2,1}(F_f/2)$
for various subclasses of
$\mathcal {S}$
are considered in [Reference Allu and Arora3, Reference Allu, Arora and Shaji4, Reference Kowalczyk and Lecko11, Reference Kowalczyk and Lecko13, Reference Mundalia and Kumar18]).
In this paper, we consider the second Hankel determinant for logarithmic inverse coefficients. From (1.4), for
$ f \in \mathcal {S}$
given by (1.1), the second Hankel determinant of
$F_{f^{-1}}/2$
is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqn5.png?pub-status=live)
We note that
|$H_{2,1}(F_{f^{-1}}/2)|$
is invariant under rotation, since for
$f_{\theta }(z):=e^{-i \theta } f(e^{i \theta } z)$
,
$\theta \in \mathbb {R}$
and
$f \in \mathcal {S}$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu9.png?pub-status=live)
The main aim of this paper is to find a sharp upper bound for
$|H_{2,1}(F_{f^{-1}}/2)| $
when f belongs to the class of convex or starlike functions. A domain
$\Omega \subseteq \mathbb {C}$
is said to be starlike with respect to a point
$z_{0}\in \Omega $
if the line segment joining
$z_{0}$
to any point in
$\Omega $
lies entirely in
$\Omega $
. If
$z_0$
is the origin, then we say that
$\Omega $
is a starlike domain. A function
$f \in \mathcal {A}$
is said to be starlike if
$f(\mathbb {D})$
is a starlike domain. We denote by
$\mathcal {S}^*$
the class of starlike functions f in
$\mathcal {S}$
. It is well known that a function
$f \in \mathcal {A}$
is in
$\mathcal {S}^*$
if and only if
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqn6.png?pub-status=live)
Further, a domain
$\Omega \subseteq \mathbb {C}$
is called convex if the line segment joining any two points of
$\Omega $
lies entirely in
$\Omega $
. A function
$f\in \mathcal {A}$
is called convex if
$f(\mathbb {D})$
is a convex domain. We denote by
$\mathcal {C}$
the class of convex functions in
$\mathcal {S}$
. A function
$f \in \mathcal {A}$
is in
$\mathcal {C}$
if and only if
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqn7.png?pub-status=live)
2. Preliminary results
In this section, we present the key lemmas which will be used to prove the main results of this paper. Let
$\mathcal {P}$
denote the class of all analytic functions p having positive real part in
$\mathbb {D}$
, with the form
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqn8.png?pub-status=live)
A member of
$\mathcal {P}$
is called a Carathéodory function. It is known that
$|c_{n}| \leq 2, n \geq 1$
, for
$p \in \mathcal {P}$
. By using (1.6) and (1.7), functions in the classes
$\mathcal {S}^*$
and
$\mathcal {C}$
can be represented in terms of functions in the Carathéodory class
$\mathcal {P}$
.
Parametric representations of the coefficients are often useful. In Lemma 2.1, (2.2) is due to Carathéodory [Reference Duren10]. Equation (2.3) can be found in [Reference Pommerenke19]. In 1982, Libera and Zlotkiewicz [Reference Libera and Zlotkiewicz14, Reference Libera and Zlotkiewicz15] derived (2.4) with the assumption that
$c_1 \geq 0$
. Later, Cho et al. [Reference Cho, Kowalczyk and Lecko7] derived (2.4) in the general case and gave the explicit form of the extremal function.
Lemma 2.1. If
$p \in \mathcal {P}$
is of the form (2.1), then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqn9.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqn10.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqn11.png?pub-status=live)
for some
$p_{1}, p_{2}, p_{3} \in \overline {\mathbb {D}}:=\{z \in \mathbb {C}:|z| \leq 1\}$
.
For
$p_{1} \in \mathbb {T}:=\{z \in \mathbb {C}:|z|=1\}$
, there is a unique function
$p \in \mathcal {P}$
with
$c_{1}$
as in (2.2), namely
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu10.png?pub-status=live)
For
$p_{1} \in \mathbb {D}$
and
$p_{2} \in \mathbb {T}$
, there is a unique function
$p \in \mathcal {P}$
with
$c_{1}$
and
$c_{2}$
as in (2.2) and (2.3), namely
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqn12.png?pub-status=live)
For
$p_{1}, p_{2} \in \mathbb {D}$
and
$p_{3} \in \mathbb {T}$
, there is unique function
$p \in \mathcal {P}$
with
$c_{1}, c_{2}$
and
$c_{3}$
as in (2.2)–(2.4), namely
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu11.png?pub-status=live)
Next we recall the following well-known result due to Choi et al. [Reference Choi, Kim and Sugawa8].
Lemma 2.2. Let
$A, B, C$
be real numbers and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu12.png?pub-status=live)
-
(i) If
$A C \geq 0$ , then
$$ \begin{align*} Y(A, B, C)= \begin{cases}|A|+|B|+|C|, & |B| \geq 2(1-|C|), \\ 1+|A|+\displaystyle\frac{B^{2}}{4(1-|C|)}, & |B|<2(1-|C|) .\end{cases} \end{align*} $$
-
(ii) If
$A C<0$ , then
$$ \begin{align*} Y(A, B, C)= \begin{cases}1-|A|+\displaystyle\frac{B^{2}}{4(1-|C|)}, & -4 A C(C^{-2}-1) \leq B^{2} \wedge|B|<2(1-|C|), \\ 1+|A|+\displaystyle\frac{B^{2}}{4(1+|C|)}, & B^{2}<\min \{4(1+|C|)^{2},-4 A C(C^{-2}-1)\}, \\ R(A, B, C), & \text {otherwise, }\end{cases} \end{align*} $$
where
$$ \begin{align*} R(A, B, C)= \begin{cases}|A|+|B|+|C|, & |C|(|B|+4|A|) \leq|A B|, \\ -|A|+|B|+|C|, & |A B| \leq|C|(|B|-4|A|), \\ (|A|+|C|) \sqrt{1-\displaystyle\frac{B^{2}}{4 A C}}, & \! \ \text{otherwise.}\end{cases} \end{align*} $$
3. Main results
Now we will prove the first main result of this paper. We obtain the following sharp bound for
$H_{2,1}(F_{f^{-1}}/2)$
for functions in the class
$\mathcal {C}$
.
Theorem 3.1. For
$f\in \mathcal {C}$
given by (1.1),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqn13.png?pub-status=live)
The inequality is sharp.
Proof. Let
$f\in \mathcal {C}$
be of the form (1.1). Then by (1.7),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqn14.png?pub-status=live)
for some
$p \in \mathcal {P}$
of the form (2.1). Since the class
$\mathcal {C}$
is invariant under rotation and the function is also rotationally invariant, we can assume that
$c_1 \in [0,2]$
. Comparing the coefficients on both sides of (3.2) yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu16.png?pub-status=live)
Hence, by (1.5),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu17.png?pub-status=live)
By (2.2)–(2.4), after simplification,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqn15.png?pub-status=live)
We consider three cases according to the value of
$p_1$
.
Case 1:
$p_1=1$
. By (3.3),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu18.png?pub-status=live)
Case 2:
$p_1=0$
. By (3.3),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu19.png?pub-status=live)
Case 3:
$p_1 \in (0,1)$
. Since
$|p_3| \leq 1$
, applying the triangle inequality in (3.3) gives
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqn16.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu20.png?pub-status=live)
Since
$AC < 0$
, we can apply Lemma 2.2(ii). The argument now divides into five parts.
3(a). For
$p_{1} \in (0,1)$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu21.png?pub-status=live)
The inequality
$|B|<2(1-|C|)$
is equivalent to
$p_1(4 - 6 p_1 + 5 p_1^2) < 0$
which is not true for
$p_{1} \in (0,1)$
.
3(b). It is easy to check that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu22.png?pub-status=live)
and from 3(a),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu23.png?pub-status=live)
Therefore, the inequality
$B^{2} < \min \{4(1+|C|)^{2},-4 A C({1}/{C^{2}}-1)\}$
does not hold for
$0<p_1<1$
.
3(c). The inequality
$|C|(|B|\hspace{-0.5pt}+\hspace{-0.5pt}4|A|)\hspace{-0.5pt}-\hspace{-0.5pt}|A B|\hspace{-0.5pt} \leq\hspace{-0.5pt} 0$
is equivalent to
${4\hspace{-0.5pt}+\hspace{-0.5pt}6p_1^2\hspace{-0.5pt}-\hspace{-0.5pt}p_1^4\hspace{-0.5pt}\leq\hspace{-0.5pt} 0}$
, which is false for
$p_{1} \in (0,1)$
.
3(d). The inequality
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu24.png?pub-status=live)
is equivalent to
$9 p_1^4+10 p_1^2-4\leq 0$
, which is true for
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu25.png?pub-status=live)
It follows from Lemma 2.2 and (3.4) that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu26.png?pub-status=live)
where
$h(x)=4+4x^2-11x^4$
. By a simple calculation, the maximum of the function
$h(x)$
for
$0<x\leq p_1'$
occurs at the point
$x_0=\sqrt {2/11}$
. We conclude that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu27.png?pub-status=live)
3(e). For
$p_1'<p_1<1$
, we use the last case of Lemma 2.2 together with (3.4) to obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu28.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu29.png?pub-status=live)
We want to find the maximum of
$k(x)$
over the interval
$p_1'<x<1$
. Observe that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu30.png?pub-status=live)
if and only if
$92 - 54x^2 - 15 x^4 + 4 x^6=0$
. However, all the real roots of this equation lie outside the interval
$p_1'<x<1$
and
$k'(x)<0$
for
$p_1'<x<1$
. So k is decreasing and hence
$k(x)\leq k(p_1')$
for
$p_1'<x<1$
. We conclude that, for
$p_1'<x<1,$
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu31.png?pub-status=live)
The desired inequality (3.1) follows from Cases 1–3. By tracking back in the proof, we see that equality in (3.1) holds when
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu32.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqn17.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu33.png?pub-status=live)
Indeed, we can easily verify that one of the solutions of (3.5) is
$p_2=1.$
In view of Lemma 2.2, we conclude that equality holds for the function
$f\in \mathcal {A}$
given by (1.7), corresponding to the function
$p \in \mathcal {P}$
of the form (2.5) with
$p_1=\sqrt {2/11},p_2=1$
and
$p_3=1$
, that is,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu34.png?pub-status=live)
This complete the proof.
Next, we obtain the sharp bound for
$H_{2,1}(F_{f^{-1}}/2)$
for functions in the class
$\mathcal {S}^*$
.
Theorem 3.2. For
$f\in \mathcal {S}^*$
given by (1.1),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqn18.png?pub-status=live)
The inequality is sharp.
Proof. Let
$f\in \mathcal {S}^*$
be of the form (1.1). By (1.6),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqn19.png?pub-status=live)
for some
$p \in \mathcal {P}$
of the form (2.1). By comparing the coefficients on both sides of (3.7),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu35.png?pub-status=live)
Hence, by (1.5),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu36.png?pub-status=live)
From (2.2)–(2.4), by straightforward computation,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqn20.png?pub-status=live)
Now we consider three cases according to the value of
$p_1$
.
Case 1:
$p_1=1$
. By (3.8),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu37.png?pub-status=live)
Case 2:
$p_1=0$
. By (3.8),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu38.png?pub-status=live)
Case 3:
$p_1 \in (0,1)$
. Applying the triangle inequality in (3.8) and using the fact that
$|p_3| \leq 1$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu39.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu40.png?pub-status=live)
Since
$AC < 0$
, we can apply Lemma 2.2(ii).
3(a). For
$p_{1} \in (0,1)$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu41.png?pub-status=live)
The inequality
$|B|<2(1-|C|)$
is equivalent to
$3 - 4 p_1 + 2 p_1^2 < 0$
which is not true for
$p_{1} \in (0,1)$
.
3(b). It is easy to see that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu42.png?pub-status=live)
and from
$3(a),$
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu43.png?pub-status=live)
Therefore, the inequality
$B^{2} < \min \{4(1+|C|)^{2},-4 A C({1}/{C^{2}}-1)\}$
does not hold for
$0<p_1<1$
.
3(c). The inequality
$|C|(|B|+4|A|)-|A B| \leq 0$
is equivalent to the inequality
$44p_1^4-68p_1^2 -16-p_1^4\geq 0$
, which is false for
$p_{1} \in (0,1)$
.
3(d). The inequality
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu44.png?pub-status=live)
is equivalent to
$96 p_1^4+88 p_1^2-15\leq 0$
, which is true for
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu45.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqn21.png?pub-status=live)
where
$h(x)=3+8x^2-24x^4$
. Since
$h'(x)>0$
in
$ 0< x\leq p_1"$
, we have
$h(x)\leq h(p_1")$
for
$ 0< x\leq p_1"$
. Therefore,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu46.png?pub-status=live)
3(e). Furthermore, for
$p_1"<p_1<1$
, from (3.8) and Lemma 2.2,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu47.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu48.png?pub-status=live)
As
$k'(x)=0$
has no solution in
$(p_1",1)$
and
$k'(x)>0$
, the maximum occurs at
$x=1$
and we conclude that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu49.png?pub-status=live)
The desired inequality (3.6) follows from Cases 1–3. For the equality, consider the Koebe function
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu50.png?pub-status=live)
Clearly,
$k \in \mathcal {S}^*$
and it is easy to show that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240417093513475-0549:S0004972724000200:S0004972724000200_eqnu51.png?pub-status=live)
This completes the proof.