1. Introduction and Preliminaries
The core of the metric fixed-point theory is the exploration of generalized contraction principles to add more applicable fixed-point theorems in the theory. The simplest and most applicable contraction principle is the Banach contraction principle. This contraction principle can be applied to show the existence of solutions to equations representing mathematical models. The contraction principle that appeared in [
1] generalizes the Rakotch [
2] contraction concept. Furthermore, Matkowski [
3], Samet et al. [
4], Karapinar et al. [
5], and Pasicki [
6] have all generalized the Boyd-Wong notion. The concept of
F-contraction [
7] is another notable generalization of the Banach contraction principle (BCP), and several research articles have been published in the previous decade (see [
8,
9,
10,
11,
12,
13], and references therein).
The role of fixed point theory in solving real-world problems has been described in many recently published papers. Recently, Turab et al. [
14] proposed a generic stochastic functional equation that can be used to describe several psychological and learning theory experiments. The existence, uniqueness, and stability analysis of the suggested stochastic equation are examined by utilizing the notable fixed point theory tools. Khan et al. [
15] proposed a fixed-point technique to investigate a system of fractional order differential equations. Rezapour et al. [
16] proposed a labeling method for graph vertices, and then presented some existence results for solutions to a family of fractional boundary value problems (FBVPs) on the methyl propane graph by means of Krasnoselskii’s and Scheafer’s fixed point theorems.
The use of partial order, admissibility of a mapping, graph theory and binary relation are all being effectively utilized in metric fixed point theory. Recently, Gordji et al. [
17] presented a special binary relation, termed the orthogonal relation, and presented several examples to clarify the concept of the orthogonal relation and, hence, orthogonal-set (see Ex 2.2 to Ex 2.11). Gordji et al. also presented a generalization of BCP in the
orthogonal metric space. Later, Baghani et al. [
8] generalized the study done in [
17] by using the concept of
F-contraction, while Nazam et al. [
18] broadened the investigation conducted in [
8].
On the other hand, Proinov [
19] offered various fixed-point theorems that built on previous work in [
1,
3,
4,
5,
6,
7]. He introduced a generalized class of contractions by operating two functions
on both sides of the Banach contraction and obtained several fixed point results. The class of contractions given in [
19] encapsulate the contractions defined in [
4,
7,
20,
21].
In this paper, we extend some results of [
19] to multivalued mappings subject to the class of orthogonal contractions. The class of orthogonal contractions generalizes ordered contractions, graphic contractions and
-admissible contractions. We demonstrate that every contraction is orthogonal but not vice versa. Along with several examples to validate the results, we also present an application for solving a fractional differential equation (FDE).
Let
and
satisfying the property (P),
We call the pair an orthogonal set (abbreviated as, O-set). The concept of orthogonality in an inner-product space is an example of ⊥.
For the illustration of the orthogonal set, O-sequence, O-Cauchy and its examples, we suggest the reader read the articles [
17,
22].
Definition 1. [17] The O-set endowed with a metric d is called an O-metric space (in short, OMS) denoted by . Definition 2. [17] Let be an orthogonal metric space. A mapping is said to be an orthogonal contraction if there exists such that Terms such as continuity and orthogonal continuity, completeness and O-completeness, Banach contraction and orthogonal contraction have been explained in [
10,
13,
17,
22]. In the following, we give some comparisons between fundamental notions.
- 1.
The continuity implies orthogonal continuity but the converse is not true. If
is defined by
and the relation
is defined by
Then, f is ⊥-continuous while f is discontinuous on .
- 2.
The completeness of the metric space implies O-completeness, but the converse is not true. We know that
with Euclidean metric
d is not a complete metric space. If we define the relation
by
then
is an O-complete.
- 3.
The Banach contraction implies orthogonal contraction but the converse is not true. Let
with Euclidean metric
d so that
is a metric space. If we define the relation
by
then
is an O-metric space. Define
by
(if
) and
(if
). Since
,
f is not a contraction; rather, it is an orthogonal contraction.
Let
— set of non-empty subsets of .
— set of all non-empty bounded and closed subsets of .
—set of non-empty compact subsets of .
If we let
and
, then
;
d is a metric on
. The mapping
defined by
defines a metric on
. It is also known as the Pompieu-Hausdorff-metric. In the following, we define ⊥-admissible mapping, ⊥-preserving mapping and illustrate them with examples. Let
.
Definition 3. A mappingis said to be strictly ⊥-admissible if for all with and otherwise.
Example 1. Let and define the relation by Then, is an O-set. Define by Then, f is ⊥-admissible.
Definition 4. Letbe a non-empty set. A set-valued mappingsatisfying the property (O) is called ⊥-preserving.
(O). For each and with or , ∃ with or .
Example 2. Let and define a relation by Then, is an O-set. Now for a function defined by Then, t is a ⊥-
admissible mapping. The mapping defined by is a ⊥-
preserving mapping. The following facts have been stated in [
19] and we carry them for our upcoming results.
Lemma 1. Let and it obeys the equation ; then, there are subsequences , and (whenever is not Cauchy) following the equations: The following result appeared in [
23] and is very useful for our upcoming results.
Lemma 2. Let and then, for all , there is a following the inequality: 2. Multivalued -Contractions
This section deals with the multivalued -contractions. To guarantee the presence of fixed points of multivalued -contractions, we study a number of constraints on the real valued nonlinear functions . The multivalued -contraction is defined as follows.
Definition 5. Letbe an OMS. A mappingis called a multivalued-
contraction if there exists a strictly ⊥-
admissible function ν such thatfor all with . Remark 1. The following observations indicate the generality of multivalued contraction for the specific definitions of the mappings .
- 1.
If and , where , then is an orthogonal Nadler contraction [23]. - 2.
If , then is an orthogonal multivalued Boyd-Wong contraction [1]. - 3.
If V is lower semi-continuous and W is upper semi-continuous, then is an orthogonal multivalued variant of the contraction defined in [24]. - 4.
If , then is an orthogonal multivalued variant of the contraction defined in [21]. - 5.
If and , then is an orthogonal variant of the contraction defined in [25]. - 6.
If , then is an orthogonal multivalued variant of the contraction defined in [26]. - 7.
If and , then is an orthogonal multivalued variant of the contraction defined in [20]. - 8.
If , then is an orthogonal multivalued variant of the contraction defined in [7].
Remark 2. It is noted that if
for all
, then the contractive condition (
3) is a multivalued F-contraction [
27]. If
for all
, then it is a multivalued
-contraction [
10]. If we set
for all
c, then we have a Nadler contraction [
23]. For, if the function
is non-decreasing and
for all
with
. Then, defining
and
for all
, we obtain the contraction defined in [
28].
Let ⊥ RCOMS denote a ⊥-regular complete orthogonal metric space.
The following theorem presents the first formula of this paper for the existence of fixed points.
Theorem 1. Letbe a ⊥
RCOMS. Suppose that is a ⊥-
preserving and satisfies (3). If ⊥
is transitive and functions meet the following conditions: - (i)
there existssuch thator, for any,
- (ii)
V is non-decreasing and ∀,
- (iii)
.
Then, there exists such that .
Proof. By (i), for an arbitrary
, there exists
such that
or
. Since the mapping
is ⊥-preserving, there exists
such that
or
and, thus,
such that
or
. In general, there exists
such that
or
for all
. Hence,
for all
. If
(for some
), then
is a fixed-point of
. We assume that
. Then,
. So
and
. Hence, there exists
such that
(see Lemma 2). Since the function
V is increasing, by (
3), we have
Since
, we have
The monotonicity of the function
V implies
and, thus, the sequence
is monotone. Let
satisfy
. If
, by (
4), we have
This is a contradiction to (iii). Thus,
and hence the mapping
is asymptotically-regular.
Now, we show that
is a Cauchy sequence. Contrarily, suppose that the sequence
is not Cauchy. By Lemma 1, there exist two subsequences
,
of
and
such that the Equations (
1) and (
2) hold. By (
1), we get that
. Since
, by transitivity of ⊥, we have
and, hence,
. Setting
and
in (
3), we have
For if
and
, we have
By (
1) and (
2), we have
and
. By (
9), we obtain
But (
6) contradicts (iii), thus,
is a Cauchy sequence in
. Since
is a complete OMS,
for some
. Since the space
is ⊥-regular, we have
or
such that
. We need to show that
and contrarily suppose that
. Then, there exists
such that
for all
. By (
3)
By monotonicity of
V, we obtain that
. Taking the limit as
in (
7), we have
, which is a contradiction. Thus,
. Since
is closed,
. □
The following theorem states another set of terms and conditions ensuring the existence of fixed points of multivalued -contractions.
Theorem 2. Letbe a ⊥
RCOMS with transitive ⊥.
Suppose that is a ⊥-
preserving and satisfies (3) and the functions meet the following conditions: - (i)
there exists such that or , ,
- (ii)
V is non-decreasing and for any ,
- (iii)
,
- (iv)
for the strictly-decreasing sequences and , if , then ,
- (v)
for any ,
- (vi)
for any .
Then, admits at least one fixed-point in .
Proof. By (i), for
, there exists
such that
or
. Since
T is a ⊥-preserving mapping, there exists
such that
or
and then
such that
or
. In general, there exists
such that
or
. Hence,
for all
. If
then
is a fixed-point of
. If
, then
. Since
and
,
, by Lemma 2, there exists
such that
for all
. By monotonicity of
V and (
3), we have
By (
8) we get that
is a strictly decreasing-sequence.
We have two cases:
Case 1. is unbounded below.
By (iii), we have
. This implies that
Thus,
, otherwise, we have
This is a contradiction to the assumption (iii).
Case 2. is bounded below.
The sequence is convergent and by (
8), we have
By (iv), we infer
.
Now, contrarily, if we let the sequence
not be Cauchy, then by Lemma 1, there are subsequences
,
of
and
such that the Equations (
1) and (
2) hold. By (
1), we get that
. Since
, by transitivity of ⊥, we have
and hence
. Setting
and
in (
3), we have
For if
and
, we have
By (
1) and (
2), we have
and
. By (
9), we get that
But (
10) contradicts (v), thus,
is a Cauchy sequence in
. Since
is a complete OMS, the sequence
converges to
.
We show that
is a fixed point of
. There are two possibilities. (P1) If
for a fixed
n, then we have
Taking the limit
, we get
. Thus,
. Since
is closed,
. (P2) If
for all
, then the ⊥-regularity of the space
implies
or
and, thus,
. By the contractive condition (
3), for all
, we have
Set
and
. Then, by (
11), we have
Suppose that
such that
and
. By (
12), we have
If
, then (
13) contradicts (vi). Thus, we have
. Hence
, that is,
is a fixed point of
. □
Remark 3. If we replace with in the contractive condition (3), then according to Ćirić [
29]
, Theorems 1 and 2 remain true. Uniqueness of the fixed point: The following three conditions are essential for the uniqueness of a fixed point of a multivalued mapping.
. For any multivalued mapping , the set of fixed points of () is totally orthogonal (for any either or ).
. Let
For any
, ∃
such that
.
. For all , , whenever .
Theorem 3. Assume that, in addition to conditions stated in Theorem 1 (or Theorem 2), the conditions hold. Then, the mapping admits a unique fixed point in .
Proof. Clearly the mapping
admits at least one fixed point in
(by Theorem 1 (or Theorem 2)). Let
w and
e be two fixed points of
, so that,
and
. By
, for any
, either
or
. In view of
,
satisfying
and
. By
,
, implies that
. Since
so that
, hence,
Now if
, then
. Moreover,
By (ii) stated in Theorem 1 and (
3), we deduce that
As
V is an increasing mapping, we have
, a contradiction, thus,
. Hence, the multivalued mapping
has a unique fixed point. □
Examples for the Explanation of Theory
Example 3. Consider endowed with usual-metric Define the relation by Then, ⊥ is an orthogonal relation and is a complete orthogonal metric space. Define by, Let and Since By virtue of Equations (16) and (18), Equation (14) implies that Define by Then, ν is ⊥-admissible.
Case 1: If and then, and Case 2: If and then, and By (19) and (20), we deduce thatfor all with . Thus, by defining and for all and , we see that V and W satisfy conditions (ii) and (iii) of Theorem 1 and is a multivalued -contraction: Here, we note that the fixed point of is 7, because
Example 4. Consider endowed with the usual metric:
Define the relation by Then, ⊥ is an orthogonal relation and is a complete orthogonal metric space. Define the mapping by,
Let and We know that , and Thus, by (24), we get By Equations (23) and (25), the Equation (21) implies that Define by Then, ν is ⊥-admissible.
Case 1: If and then, and Case 2: If and then, and Thus, for all with , Thus, by defining and for all and , we see that V and W satisfy conditions (ii)–(vi) of Theorem 2 and is a multivalued -contraction: We note that the fixed point of is 20, because
3. Consequences
It is noted that the Nadler fixed point theorem [
30] is a particular case of Theorems 1 and 2 (let
and
for all
and
). The multivalued version of the Wordowski Theorem can be derived by defining
for all
in Theorem 1. If we define
in Theorems 1 and 2, then we have an improvement of the results presented in [
8,
12,
27,
31] as follows:
Corollary 1. Let be a ⊥RCOMS. Suppose that is ⊥-preserving and there exists a ⊥-admissible function ν and such that If there exists such that or , and is nondecreasing, then admits a fixed point in .
Defining
for all
in Theorems 1 and 2, we have the following improvement of the result presented in [
10].
Corollary 2. Letbe a ⊥
RCOMS. Suppose that is ⊥-
preserving and there exists a ⊥-
admissible function ν such that If there exists such that or , and is nondecreasing, then admits a fixed point in .
Defining
for all
in Theorem 1, we have the following improvement of Moradi’s theorem [
21].
Corollary 3. Let be a ⊥RCOMS. Let and is an upper semi-continuous function satisfying for all . Suppose that is ⊥-preserving and there exists a ⊥-admissible function ν such that If there exists such that or , and is nondecreasing, then admits a fixed point in .
Defining () in Corollary 3, we have the following conclusion.
Corollary 4. Let be a ⊥RCOMS. Suppose that is ⊥-preserving and there exists a ⊥-admissible function ν such thatand is nondecreasing. If there exists such that or , , then admits a fixed point in . Remark 4. Corollary 4 shows the improvements of fixed point results presented in [20,32]. If we define
in Theorems 1 and 2, then we have the following improvement of the special case of Skof’s fixed point theorem [
26].
Corollary 5. Letbe a ⊥
RCOMS. Suppose that is ⊥-
preserving and there exists a ⊥-
admissible function ν such thatand V is a nondecreasing function that maps positive real numbers to positive real numbers and . If there exists such that or , , then has a unique fixed point in . On the other hand, if
V is a nondecreasing function that maps positive real numbers to positive real numbers and
meets the condition
for any
, and
and
for all
in Theorem 1, then we have an improvement of a theorem in [
25].
Remark 5. (R1). The ⊥-admissibility of the mapping can be dropped from all of the aforementioned results by replacing with and the Lemma 2 is no more required.
(R2). The condition:can be used as an alternative of the ⊥-
admissibility of in the above theorems.
The following theorem is a particular case of Theorem 1 and is useful for the upcoming result.
Theorem 4. Let be a ⊥-preserving self-mapping defined on ⊥RCOMS such thatfor all with and is nondecreasing and . If there exists such that or ; , then admits a fixed point. Proof. Setting for all in Theorem 1, we have the required result. □
Remark 6. Define as any one of the following. Then, Theorem 4 is applicable.
- (1)
.
- (2)
.
- (3)
.
- (4)
, .
- (5)
, .
- (6)
.