1. Introduction and Motivation
The Geometric Function Theory has become one of the important growing research subjects of complex analysis due to its numerous applications in some areas of science. The present far-reaching development of the geometric properties of analytic functions has attracted a large number of contributions [
1,
2,
3,
4,
5,
6,
7,
8,
9]. In recent years, due to its numerous applications in various branches of science and engineering, the Mittag-Leffler function is one of the most important special functions whose geometric properties were extensively studied by several researchers (see, for instance, [
10,
11,
12,
13,
14]). The Barnes–Mittag-Leffler function is connected to the Mittag-Leffler function. In the present investigation, we aim to present some geometric properties of a class of functions associated with the Barnes–Mittag-Leffler function. Let us recall some basic definitions and analytic description related to the context. Let
denote the class of all analytic functions in the unit disk
Let
be the class of analytic function
satisfying the normalization conditions
and
i.e.,
The function
is called a starlike function in
, if
is univalent in
and
is a starlike domain with respect to the origin. It is worth mentioning that the characterization of such a starlike function (see Duren’s book [
15]) is
MacGregor, in [
16], proved that if a function
such that
then
is starlike in
If
is a univalent function in
and
is a convex domain in
, then
is said to be a convex function in
. It is worth mentioning that the characterization of such a convex function in
is
Again, MacGregor, in [
17], established that for any analytic function
that satisfies the following inequality:
for
, then
is convex in
It is well known that an analytic function
is convex if and only if the function
is starlike.
An analytic function
in
is called close to convex in the open unit disk
if there exists a starlike function
in the unit disk such that
It can be easily verified that every starlike (or convex) function is close to convex. Furthermore, it is worth mentioning here that in 1935, Ozaki [
18] established that any analytic function
such that
and it satisfies
or if
then
is close to convex with respect to the function
In 1941, Ozaki [
19] derived that for any function
in the form (1) such that
or if
then
is close to convex with respect to the function
A function
in
is called uniformly convex in
if for every circular arc
contained in
with the center
, the image arc
is convex with respect to
; for more details see [
20]. We denote by UCV the class of all functions that are uniformly convex. It is also important to note here that V. Ravichandran [
21] proved that if a function
satisfies the following condition:
then
The two-parameter Mittag-Leffler function
is defined by [
22,
23] as follows:
For some properties involving the two-parameter Mittag-Leffler function, we refer to [
24,
25]. The Barnes–Mittag-Leffler function
is defined by [
26] as follows:
To discuss some geometric properties of the Barnes–Mittag-Leffler function, we consider the following normalized form:
where:
Here, we use
to denote the digamma (psi) function defined by
where
is an Euler–Mascheroni constant.
2. The Main Results
Theorem 1. Assume that and The following statements hold:
- (a).
If the following inequalities
hold, then the function is close to convex with respect to the function .
- (b).
If the following inequalities
hold true, then the function is close to convex with respect to the function
Proof.
(a). By using the given condition, we obtain the following:
For
a simple computation gives the following:
Then, we obtain the following:
In view of the fact that the digamma function
is increasing in
we obtain that the function
is decreasing on
In particular, for
we have
by our assumption. Consequently, the function
is also decreasing in
. By (
6), the sequence
is decreasing. Hence, the function
is close to convex with respect to the function
- (b).
From (
4) we obtain the following:
Under our assumption, we have
Moreover, for
we obtain the following:
By a similar argument as in the proof of part (a), we derive that the function
is decreasing on
if
and consequently, we deduce that the sequence
is decreasing. This completes the proof. □
Taking in part (a) (resp. part (b)) of Theorem 1, we derive the following results.
Corollary 1. Assume that and The following statements hold:
- (a).
If the following inequality
is valid, then the function is close to convex with respect to the function
- (b).
If the following inequality
hold true, then the function is close to convex with respect to the function
Remark 1. Since any close-to-convex function is univalent in (see, for instance, [
18,
27]
), we deduce by Theorem 1 that the functions and are univalent in under the given assumptions asserted in Theorem 1. Taking in Theorem 1, we derive the following result:
Corollary 2. Assume that The following statements hold:
- (a).
If the following inequalities
hold true, then the function defined byis close to convex with respect to the function - (b).
If the following inequalities
hold true, then the function is close to convex with respect to the function
Remark 2. In [11] (Theorem 4), the authors proved that the function is close to convex with respect to the function for However, if we let and , we obtain that the function is close to convex with respect to the function . More precisely, Corollary 2 improves the corresponding result proved in [11]. Theorem 2. Let the parameter space be the same as in Theorem 1. Also, we assume that Then, we have the following: Proof. By using (
5) we have the following:
In the proof of part (a) of Theorem 1, we have derived that the sequence
is decreasing. Furthermore, for
we have the following:
Moreover, due to the monotonicity of the digamma function, we conclude that the function
is increasing on
and consequently the sequence
defined by
is increasing. Therefore, the sequence
defined by
is also increasing. Then, for
we obtain the following:
But in our condition, we have the following:
Hence, according to the above inequality and (
10), we obtain the following:
Then, in view of (
9) and (
11), we find that
for
, but
for each
Then, the sequence
is convex. On the other hand, according to Fejér [
28], if a function
where
and
for
is analytic in the unit disc
and if the sequence
is decreasing and convex, then
This proves the result asserted by Theorem 2. □
Theorem 3. Assume that and such that Then, the function is starlike in
Proof. Let
. Then, we have the following:
where:
Differentiating
with respect to
t, we obtain the following:
However, the function
is increasing on
and thus the function
is decreasing on
We thus rewrite the sequence
as
Then, the sequence
is decreasing, as is the product of two positive and decreasing sequences. Hence, by this observation and (
12), we obtain the following:
Thus, the proof is complete. □
Upon taking in Theorem 3, we obtain the following result reads as follows:
Corollary 3. Let and such that the following condition is valid. Then, the function is starlike in
We set in Corollary 3, and compute the following result:
Corollary 4. If then the function is starlike in
Taking in Theorem 3, we derive the following statement:
Corollary 5. Let such that Then, the function is starlike in
Remark 3. In [13] (Theorem 2.4), the authors derived that the function is starlike in for and Moreover, we can verify that the function is starlike in for any Theorem 4. Let and Then, the function is convex in
Proof. A straightforward computation gives
where:
Note that the function
defined by
is decreasing on
for
This in turn implies that the sequence
is decreasing. From this fact and with the help of (
15), we obtain the following:
which is less than or equal to 1 by the condition
□
Taking in Theorem 4 the values , we compute the following result:
Corollary 6. Let and Then, the function is convex in
Taking in Theorem 4, we derive the following result:
Corollary 7. Let and . Then, the function is convex in
Remark 4. In [13] (Theorem 2.4), the authors proved that the function is convex in if and However, in view of Corollary 7, we deduce that the function is convex in for Theorem 5. Let and If then the function is starlike in
Proof. To prove that the function
is starlike in
it suffices to prove the inequality
For this objective, it suffices to establish that
for
By (
5) and routine algebra, we obtain the following:
where
is defined in (
13). By our condition, the sequence
is decreasing (see the proof of Theorem 3) and consequently we have the following:
By combining the above inequality with (
19), we obtain the following:
Furthermore, we have the following:
Then, having (
21) and (
22) in mind, we deduce that the inequality (
18) is valid for
□
Specifying in Theorem 5, we obtain the following result:
Corollary 8. For any and such that the function is starlike in
Taking in Corollary 8, we derive the following result reads as follows:
Corollary 9. If then the function is starlike in
Example 1. The function is starlike in
If we take in Theorem 5, we compute the following sufficient conditions for the starlikeness property of the function in the unit disk.
Corollary 10. Let If then the function is starlike in
Remark 5. In [13] (Theorem 2.2), the authors proved that the function is starlike in if and Also, in [11] (Theorem 2), Noreen et al. obtained that the function is starlike in if and Moreover, in view of the above Corollary, we conclude that the function is starlike in for any . Moreover, a numerical computation shows that the function is starlike in for any Theorem 6. Let and If inequalities are valid, then the function is convex in .
Proof. According to the analytic characterizations of convex functions, to prove that the function
is convex in
it is enough to prove that the function
is starlike in
For this, it suffices to prove the inequality
For any
we obtain the following:
We now make use of inequality [
29], using Equation (
17):
to obtain the following:
A simple computation gives the following:
for
This in turn implies that the function
is decreasing on
. As
we deduce that the function
is decreasing on
This fact implies that the sequence
is also decreasing. Thus, by (
24) we obtain the following:
Furthermore, for any
we find that:
As we showed above, the function
is decreasing on
and consequently the function
is also decreasing on
, which in turn implies that the sequence
is decreasing. Therefore, we obtain the following:
Hence, by combining (
28) and (
30) we obtain the following:
which is less than 1 by our assumption. □
Specifying in Theorem 6, we obtain the following:
Corollary 11. Let such that the following inequalities hold true, and then the function is convex in .
Remark 6. In [11] (Theorem 7), it is shown that is convex in if and By Corollary 11, we deduce that the function is convex in for . Theorem 7. Let , and . Assume that the following inequalities hold true. Then, .
Proof. Assume that
A routine algebra gives the following:
By examining the proof of Theorem 6, we observe that the sequence
is decreasing. In view of (
32) we have the following:
Moreover, for
we obtain the following:
Similarly to the proof of Theorem 6, the sequence
is decreasing. Then, we have the following:
Hence, by (
33) and (
35) we have the following:
Then, in view of (
2) we conclude that
. □
Finally, we take in Theorem 7 and we compute the following result involving the normalized Mittag-Leffler function, which reads as follows:
Corollary 12. Let If the inequality holds true, then the function
Remark 7. The authors [10] (Theorem 2.6) proved that the function if and In view of Corollary 12, we deduce that the function for