1. Introduction
In the last few decades one could observe a huge amount of interest for the development of the fixed point theory because of plenty of applications, especially in metric spaces [
1,
2]. Banach’s contraction principle [
3] is one of the most widely applied fixed point theorems in all branches of mathematics [
4,
5,
6,
7,
8,
9,
10,
11,
12]. In recent decades, scholars have devoted themselves to extending the above theorem to all kinds of generalized metric spaces [
13,
14,
15,
16,
17]. In 1993, Czerwik [
18] introduced the concept of
b-metric spaces by weakening the coefficient of the triangle inequality and generalized Banach’s contraction principle to these spaces. Subsequently, Boriceanu, Bota and Petrusel [
19,
20] obtained some concrete examples of
b-metric spaces, and studied the fixed point properties of set-valued operators in
b-metric spaces. The fixed point properties of
b-metric spaces have received much attention; for example, see [
21,
22,
23,
24,
25,
26,
27,
28] and references therein.
In 1970, Takahashi [
29] introduced the concepts of a convex structure and a convex metric space, and formulated some first fixed point theorems for nonexpansive mappings in the convex metric space. In addition, Goebel and Kirk [
30] studied some iterative processes for nonexpansive mappings in the hyperbolic metric space, and in 1988, Xie [
31] found fixed points of quasi-contraction mappings in convex metric spaces by Ishikawa’s iteration scheme. In 1990, Reich and Shafrir [
32] presented nonexpansive iterations in hyperbolic spaces. In general, the Picard iteration algorithm is widely used in studying the fixed point problems for many kinds of contraction mappings and quasi-contraction mappings in
b-metric spaces. However, it is hard to extend other algorithms directly to the
b-metric spaces because of the characteristics of this kind of metric space.
In this work, we firstly introduce the concept of the convex b-metric space by means of the convex structure. Moreover, we extend Mann’s iteration algorithm to the above space. We also present some specific examples of convex b-metric spaces. Furthermore, by means of Mann’s iteration scheme, we obtain strong convergence theorems for two types of contraction mapping in convex b-metric spaces. In addition, we show concrete examples supporting our main results. Moreover, we introduce the concept of weak T-stability of the iteration for mappings in complete metric spaces and discuss the problem of weak T-stability of Mann’s iteration procedure for above two kinds of mappings in complete convex b-metric spaces. As an application, we apply our main result to approximating the solution of the Fredholm linear integral equation.
3. Main Results
In this section, we begin with the definition of a convex b-metric space.
Definition 4. Let the mapping be a convex structure on a b-metric space with constant and . Then is said to be a convex b-metric space.
Let
be a convex
b-metric space and
be a mapping. We generalize Mann’s iteration scheme to the convex
b-metric space as follows:
where
and
. The sequence
is said to be Mann’s iteration sequence for
T.
Let us present now some specific examples of convex b-metric spaces.
Example 1. Let , and for any , let us define the metric by the formula, and the mapping by the formula Then, is a convex b-metric space with . However, is not a metric space in the usual sense.
Indeed, by the help of the fact that for any and , inequality holds, we easily show that is a b-metric space with . Next we verify that w satisfies inequality (1). For any , we getso is a convex b-metric space with . However, is not a metric space in the usual sense because does not satisfy the classical triangle inequality. Indeed, if we put , then Example 2. Let and for all and . Obviously, is a b-metric space with . Let be the mapping defined asfor any . Then, w satisfies inequality (1). Indeed, for all , Hence, is a convex b-metric space. However, similarly to Example 1, it is not a metric space in the usual sense.
The next example shows that the mapping
w defined in Example 2, sometimes may not be a convex structure on some metric spaces (see [
33,
34]).
Example 3. Let , where . We define by the formula Applying inequality holding for all , we easily obtain that is a b-metric space with constant . Let be the mapping defined as Assume that and for any . Then, for all , we getwhich implies that w is not a convex structure on H. Now we will prove Banach’s contraction principle for complete convex b-metric spaces by means of Mann’s iteration algorithm.
Theorem 1. Let be a complete convex b-metric space with constant and be a contraction mapping; that is, there exists such that Let us choose in such a way that and define , where and . If and for each ; then, T has a unique fixed point in H.
Proof. Note that for any
, there holds
and
Let
. Combining this and the above inequality with assumptions
and
holding for each
, we get
which implies that
is a decreasing sequence of non-negative reals. Hence, there exists
such that
We will show that
. Suppose that
. Letting
in inequality (
2), we obtain
a contradiction. Hence, we get that
. Moreover, we have
which shows that
. Now we will show that
is a Cauchy sequence. Indeed, if
is not a Cauchy sequence, then there exist
and the subsequences
and
of
, such that
is the smallest natural index with
,
and
Then, we conclude
which implies that
Noticing that
we obtain
a contradiction. Thus
is a Cauchy sequence in
H. By the completeness of
H, there exists
such that
.
Next, we will verify that
is a fixed point of
T. Note that
Letting
, we deduce that
which implies that
. Hence,
is a fixed point of
T. Now we will explain that
T has a unique fixed point. Suppose that
is another fixed point, that is,
. Then,
for some
, a contradiction. Hence,
which completes the proof. □
Let us give an example illustrating the above theorem.
Example 4. Let and for all . For any , we define function by the formula , while the mapping is defined asSet and , where and . Then, is a complete convex b-metric space with , and T has a unique fixed point in H. Indeed, from Example 1 it follows that is a b-metric space with . In addition, for any , we have Hence, is a convex b-metric space with . It is not difficult to see that T satisfieswhere . We choose . Combining with and , we have Since for all , we obtainLetting , we get that and . We notice that 0 is a fixed point of T in H. Next, we will show that T has a unique fixed point. Suppose that are two distinct fixed points of T. Then,a contradiction. Therefore, 0 is the unique fixed point of T in H. Our next theorem is the Kannan type fixed point theorem for a complete convex b-metric space.
Theorem 2. Let be a complete convex b-metric space with constant , and let the mapping be defined asand for some . Let us choose in such a way that and define for and . If , then T has a unique fixed point in H. Proof. Note that for any
, we have
and
i.e.,
Denote
for
. We deduce that
Combining this and inequality (
5) with the assumptions of the theorem, we get
which implies that
is a decreasing sequence of non-negative reals. Hence, there exists
such that
We will show that
. Suppose
. Letting
in (
6), we obtain that
a contradiction. Hence, we get that
; i.e.,
Moreover, by inequality (
4), we obtain
which implies that
. Now we will show that
is a Cauchy sequence. Indeed, if
is not a Cauchy sequence, then there exist
and the subsequences
and
of
such that
is the smallest natural index with
,
and
Then, we conclude that
which implies that
Noticing that
we obtain
a contradiction. Thus
is a Cauchy sequence in
H. By the completeness of
H, it follows that there exists
such that
Now we will show that
is a fixed point of T. Since
we conclude that
Consequently, we get that , so is a fixed point of T.
In order to show the uniqueness of the fixed point, suppose that
,
, is another fixed point of
T. Then
. However,
a contradiction. Hence,
which completes the proof. □
Next, we will give an example of applying Theorem 2.
Example 5. Let and define the mapping by the formula For any , we define by the formula and the mapping as Let be the initial value and , where . If , then T has a unique fixed point in H.
Proof. From Example 4, it follows that
is a convex
b-metric space with
. We claim that
T satisfies inequality
for any
. In order to prove it, we will consider the following four cases.
(i) If
, then it is easy to see that inequality (
7) holds.
(ii) If
and
, then
which implies that
holds for any
and
.
(iii) If
and
, then, similarly to case (ii), we can also get that inequality (
7) holds.
(iv) If
, then
which shows that
holds for all
. Summarizing, inequality (
7) holds for any
.
Next, we will claim that T has a unique fixed point in H. In order to do it, we will consider the following two cases.
Obviously, as .
If
, then
. From case (a), it follows that
as
. If
, then
. From the above procedure, we can assume that
. Then, we obtain
and
which implies that
. Hence,
, where 0 is a fixed point of
T. Actually, 0 is the unique fixed point of
T in
H. Indeed, suppose that
is also a fixed point of
T. Then
; that is,
which implies
a contradiction. Thus the proof is finished. □
Next, we will consider the problem for the T-stability of Mann’s iteration for the above two kinds of mappings in complete convex b-metric spaces. We first recall the following useful results.
Lemma 1 ([
35]).
Let , be non-negative sequences satisfying for all , , . Then . In 2008, Qing and Rhoades [
24] introduced the concept of
T-stability of the iteration procedure in complete metric spaces in the following:
Definition 5 ([
24]).
Let T be a self-map on a complete metric space (). Assume that is an iteration sequence, which yields a sequence of points from H. Then the sequence is said to be T-stable if converges to a fixed point of T, and if is a sequence in H such that , then we have . Now we show the notion of the weak T-stability of the iteration procedure.
Definition 6. Let T be a self-map on a complete metric space (). Assume that is an iteration sequence, which yields a sequence of points from H. Then the iteration procedure , is said to be weakly T-stable if converges to a fixed point of T, and if is a sequence in H such that and sequence is bounded, then .
Remark 1. It is not difficult to see that if an iteration is T-stable, then it is also weakly T-stable. However, one is not sure if the converse is not true.
Theorem 3. Under the assumptions of Theorem 1, if, additionally, , then Mann’s iteration is weakly T-stable.
Proof. By virtue of Theorem 1, we deduce that
is a unique fixed point of
T in
H. Assume that
is a sequence in
H which satisfies
and
is bounded. We obtain
Noticing that
,
,
and
is bounded, and taking into account Lemma 1, we get that
which completes the proof. □
Theorem 4. Under all the assumptions of Theorem 2, if and if the positive real numbers k and s from Theorem 2 satisfy, additionally, condition , then Mann’s iteration is weakly T-stable.
Proof. From Theorem 2, it follows that
T has a unique fixed point
in
H. Assume that
is a sequence in
H which satisfies
and
is bounded. We obtain
Moreover, for any
, we have
which implies
. Hence,
Noticing that , , and is bounded, and by virtue of Lemma 1, we get that . □