A General Method of Researching the N-Ordered Fixed Point on a Metric Space with a Graph ()
1. Introduction
Since Banach Contraction Principle was first shown in 1922 [1], some mathematicians have improved and generalized this principle to discuss fixed point theorems of various mappings on different spaces. In 1969, S. B. Nadler [2] applied the Pompeiu-Hausdorff metric to study the fixed point theory of set-valued mapping in metric space. Then, many fixed point theorems of set-valued mappings appeared, such as [3] [4] [5] [6]. In 2004, Ran and Reurings [7] built the fixed point theories on partially ordered metric spaces. In 2008, J. Jachymski [8] established some fixed point results on a metric space with a graph. The results extended and unified some results in metric spaces endowed with a partial order. Since then, many scholars began to study the fixed point theory on a metric space with a graph (one can refer [4] [5] [6] [9] [10] [11] and references therein).
The definition of coupled fixed point was given by Bhaskar and Lakshmikantham [12]. Since coupled fixed point theory has wide applications in nonlinear differential, nonlinear integral equations and partially ordered metric space, some coupled, tripled and N-order fixed point theorems appearing in [12] - [18] and reference therein.
Based on the results obtained in [2] and [8], I. Beg, etc. [4] proposed a contraction principle for set-valued mappings on a metric space with a graph in 2010. In 2015, M. R. Alfuraidan [5] proposed monotone set-valued mappings on a metric space with a graph which is somewhat different from that in [4]. In 2018, M. R. Alfuraidan and M. A. Khamsi [5] discussed the coupled fixed point theorems of single-valued and set-valued mappings, in which there was an important situation:
, such that for
with
, it holds that
(1.1)
The inequalities similar with (1.1) appeared in many literatures about fixed point theories such as [12] [13] [15] [19] [20]. Most of the recent literatures considered N-order fixed point theorems and the inequalities similar with (1.1) only from the aspect of
(or
) rather than
which is a product metric space
endowed with a graph
, thus, the proofs are tediously long. When we turn our attention to
and the mapping
(resp.,
), we find that the N-order fixed point theories are very concise and straightforward for both set-valued mappings and single-valued mappings.
We focus on two aspects: one is to construct a concise method to study the fixed point theory; the other is to construct the N-order fixed point theories of single-valued and set-valued mappings. First, we define
which is induced by
. We transfer the N-order fixed point of
(resp.,
), to the fixed point of
(resp.,
). Next, we construct the N-order fixed point theories of single-valued and set-valued mappings.
2. Preliminaries
We first introduce a terminology of graph theory. Consider a complete metric space
endowed with a directed graph G, denoted by
. The vertices set
coincides X and the edges set
contains the diagonal elements of
. Assume that G has no parallel edges. The metric between two vertices can be treated as the weight so that G is a weighted graph. Moreover, let
denote the conversion of the graph G, i.e.,
. Simultaneously, let
denote the undirected graph obtained from G, that is
. We say that G is weakly connected if is
connected.
Let
denote the product space of N X’s and
. We say that
is induced by
if
, and
,
and D are defined respectively by:
(2.2)
and
(2.3)
In addition, we use Ɗ to denote the Pompeiu-Hausdorff distance between two sets.
In this paper, we mainly consider the following two properties of
and the mapping
where Y is a metric space with a graph.
: For any sequence
in X, if
and
for any
, then
.
: for given x and a sequence
in X with
and
, we have
.
3. N-Order Fixed Point Theory of Single-Valued Mapping
In this section, We make use of f, F,
to denote the following mappings, respectively,
and
.
For simplicity of description, we denote
.
3.1. Basic Notations
Definition 1. [16] Let X be a nonempty set and
be a given mapping. An element
is called an N-order fixed point of F if
When
, we call it a fixed point, coupled fixed point and tripled fixed point respectively.
Definition 2. Let
be a mapping. We say that F is NG-contractive if it satisfies the following two conditions:
1) NG-monotone property, i.e., for all
with
, it holds that
; (3.1)
2) There exists
such that
for all
with
.
Particularly, when
satisfies (1) and (2) for
, it is called a G-contraction.
The definition “NG-contractive” was first introduced in [6]. In order to study the N-order fixed point theory, we here extend it to N-dimensional space.
We consider the definition of N-order fixed point of the mapping
and find that the N-order fixed point of the mapping F is just the fixed point of the mapping
defined by
(3.2)
which implies that the study of the N-order fixed point can be converted to that of fixed point of
. Simultaneously,
has many properties relative to F. According to Definition 2 and by (2.2), (2.3) and (3.2), if
is G-contractive, then we have:
1) for
with
;
2) there exists
such that
for all
with
, and then
.
Thus, if
is G-contractive, F must be NG-contractive. However, if F is NG-contractive,
is not necessarily G-contractive. We can show it by the following example.
Example 3.1. Let
be endowed with the Euclidean distance
. For any
, we say that
if
.
is induced by
. For
with
, by (2.3), we have
. Let
be defined by
.
It is obvious that
which implies that F is NG-contractive. However,
Notice that when
and
, then
which means
is not G-contractive.
3.2. Main Results
Lemma 3.1. [8] Suppose that
satisfies
. Let the mapping
be G-contractive and
. Then
1) for any
,
has a unique fixed point;
2) if G is weakly connected, then f has a unique fixed point in G;
3) if
, then
has a fixed point in X;
4) if
then f has a fixed point;
5) fix
if and only if
.
Lemma 3.2. [8] Let the mapping
be G-contractive and satisfy
. Then f has a fixed point if there exists
such that
. Moreover, if G is weakly connected, the fixed point is unique.
In the sequel, we study the N-order fixed point results of
by finding the fixed point of
and we give a concise proof. We try to ensure the G-contractive property of
in Theorem 4.3 and Corollary 1.
Theorem 3.1. Suppose that
is induced by
and
satisfies
. Suppose that
satisfies the NG-monotone property (3.4) and there are some constants
with
such that
(3.3)
with
for
Suppose that there is a point
such that
(3.4)
Define
by (3.2). Then,
1) for any
,
has a unique N-order fixed point;
2) if G is weakly connected, then F has a unique N-order fixed point in
;
3) if
, then
has an N-order fixed point in
;
4) if
then F has an N-order fixed point;
5) fix
if and only if
.
Moreover, if
is an N-order fixed point of F with
.
Proof. (1) Since
is induced by
and
is complete, we know that
is complete, and for all
with
,
is defined as (2.2) and D is defined as (2.3). Then, for
, we obtain that
(3.5)
Considering (2.2), (2.3), (3.1), we have
and
Thus
is a G-contraction on
satisfying
by (4.13). Then, by Lemma 3.1, we obtain that
has a unique fixed point
in
which is just the N-order fixed point of F.
At the same time, we have
which implies that
are all N-order fixed points of F. By the uniqueness, we can get
.
(2)-(5) can be proved by Lemma 3.1 similarly. We omit them.
Theorem 3.2. If we replace the condition “
satisfies
” by “
satisfies
” and the other conditions in Theorem 3.1 are satisfied, we can get the same results with Theorem 3.1.
Corollary 1. Suppose that
satisfies
and
satisfies the NG-monotone property (3.1). And
with
(3.6)
where
. If there exists
such that
.
Then there is an N-order fixed point
of F. If G is weakly connected,
is the unique N-order fixed point with
.
Proof. We can easily prove that
defined as (3.2) is G-contractive. By Theorem 3.2, we can get the proof.
Corollary 2. Suppose that a mapping
has an N-order fixed point
. Then
is the unique N-order fixed point and satisfies
if
: for each
, there exists
such that
and
Proof. It is clear that
is connected. By theorem 3.2, we can obtain the result.
In partially ordered set, the assumption
implies the comparable property which is widely used in the uniqueness of fixed point theorems.
Remark The conditions (3.5) appeared in many documents with
, such as, Bhaskar and Lakshmikantham [12], V. Berinde and M. Borcut [15], Agarwal, EI-Gebeily, D. O’Regan [19] and Amini-Harandi [13], M. R. Alfuraidan, M. A. Khamsi [5], etc. Simultaneously, comparable property is used to study the uniqueness of fixed points. Thus, our results extend and unify a more general version. Moreover, the introduction of
provides a new idea to study the N-order fixed point with
.
3.3. Application
The followings are excerpted from [12] and [6]. They can be seen as the corollaries to Theorem 3.2 and Corollary 2.
Corollary 3. [12] Let
be a complete metric space endowed with a partial order
. The mapping
is a continuous mapping. Suppose that
1) F has mixed monotone property: for any
;
2) there is a
such that for all
with
and
,
If there exists
with
and
, then F has a coupled fixed point. Assume that the comparable property holds, we can obtain the uniqueness of the coupled fixed point.
Proof. Set a graph G on X defined as: for
, we say
and
.
Then by mixed monotone property, we know
By Theorem 3.2 and Corollary 2, we can get the proof.
Corollary 4 [6] Let
be a complete metric space endowed with a graph G. The mapping
be a continuous and NG-monotone mapping satisfying that there is a
such that
for
. If there exists
with and
, then F has a coupled fixed point.
Proof. We can get the proof by Theorem 3.2.
4. N-Order Fixed Point Theory of Set-Valued Mapping
Let
and
be defined in Section 2 and
.
We make use of h, H,
to denote the following different set-valued mappings, i.e.,
and
.
For simplicity of description, we denote
.
4.1. Basic Notations
Let
denote the Pompeiu-Hausdorff metric between two sets on
, i.e., for
,
where
.
Definition 3. Let X be a non-empty set and
be a set-valued mapping. An element
is called a fixed point of h provided
.
In order to discuss the fixed point theory of set-valued mappings, many contraction’s notations have been introduced such as [2] [4] [5].
Definition 4. [2] Let
be a non-empty metric space. We say that the set-valued mapping
is set-valued contractive if there exists
such that
for all
.
Definition 5. [4] Let
be a non-empty metric space. We say that the set-valued mapping
is G-contractive if there exists
such that
for all
and, if
and
with
for each
, then
.
Definition 6. [6] Let
be a non-empty metric space with a graph G. Let
be a set-valued mapping. There exists
such that, for
with
and any
, there exists
such that
and
. We say that the mapping
is monotone increasing G-contractive.
For all
, we have
and, for a given number
, for any
, there is a point
such that
( [3] ). Thus, we propose the “SG-contraction” as follows.
Definition 7. Let
be a non-empty metric space with a graph G. Let
be a set-valued mapping. There exists
such that, for
with
and any
, for any
, there exists
such that
and
. We say that the mapping
is SG-contractive.
If h is a single-valued mapping, then SG-contractive property of h implies that,
with
, it holds that
and
which is called G-contractive (see Definition 2).
Let’s investigate the above definitions. “Set-valued contractive” in Definition 4 imlies “SG-contractive” in Definition 7. In Definition 5, the condition “if
and
with
for each
, then
“ is very hard. It is obvious that “G-contractive” in Definition 5 implies “SG-contractive” in Definition 7. And, “monotone increasing G-contractive” in Definition 6 implies “SG-contractive” in Definition 7. Since, for
, there may not be a point
such that
(see [2] ), we can get “set-valued contractive” in Definition 4 doesn’t imply “monotone increasing G-contractive” in Definition 6. Hence, “SG-contractive” in Definition 7 is more general.
Definition 8. The point
is said to be an N-order fixed point of
if
For a set-valued mapping
, we define
as: for
,
. (4.1)
We can see that:
x is an N-order fixed point of H
x is a fixed point of
Thus, we can research the N-order fixed point theory by studying the fixed point theory.
4.2. Main Results
Theorem 4.1. Suppose that
has the property
. Let
be a set-valued SG-contraction. If
, then the following statements hold:
1) for any
,
has a fixed point;
2) if G is weakly connected, then h has a fixed point in G;
3) if
, then
has a fixed point in X;
4) if
then h has a fixed point;
5) fix
if and only if
.
Proof. (1) Considering
, we take a point
. Then there is a point
such that
. Noting that
is an SG-contractive mapping, for
, there is a point
such that
and
By the similar deduction, there is a point
such that
and
.
We can construct a sequence
such that for
and
(4.2)
Since
, we get that
is a Cauchy sequence and converges a point
.
Now, We claim that
under the condition
. By
, we have
. For
, by Definition 7, for
, there exists a point
such that
and
. Thus, for any
,
which implies
. Noting that
, we get
.
We can get the proof of (2)-(5) by the similar deduction of Theorem 3.1 in [5].
Theorem 4.2. Let
be the complete metric space endowed with a graph G. Suppose that h has the property
. Let
be a set-valued SG-contraction. Suppose that h has the property
. If
, then conclusions obtained in Theorem 4.1 remain true.
By the Similar deduction in Section 3.1, in order to discuss the N-order fixed point of H, we try to ensure the SG-contraction of
.
Theorem 4.3. Suppose that
has the property
. Let
be a set-valued mapping. Suppose that there are some constants
with
such that for any
, for any
, there is a point
such that
(4.3)
for
. Suppose that there is a point
such that there is a point
with
and
. (4.4)
Then
1) for any
,
has an N-order fixed point;
2) if G is weakly connected, then H has an N-order fixed point in
;
3) if
, then
has an N-order fixed point in
;
4) if
then H has an N-order fixed point;
5) fix
if and only if
.
Proof. (1) Since
is complete, we know that
is complete. Let
be defined by (4.10).
We first show that
is SG-contractive. For
with
, we obtain that
(4.5)
Let
and
be arbitrary. Considering (4.3), for
, there is a point
such that
For
, there is a point
such that
Then, the point
belongs to
and
Thus
is an SG-contraction on
.
Next
has the property
. In fact, for any sequence
in
, if
and
for any
, then
.
By the property
of
, we get
,
then
.
Last, we can see that
which implies that
. By Theorem 4.3, we get the proof.
Theorem 4.4. Let
be a set-valued mapping and H satisfy the property
.
Suppose that there are some constants
with
such that for any
, for any
, there is a point
such that (4.12) holds for
. Suppose that there is a point
such that (4.13) holds for some
with
. Then the conclusions in Theorem 4.3 hold.
Corollary 5. [6] Let
be a continuous set-valued mapping having the mixed G-monotone property on X and satisfying (MBL) condition. If there exist
and
such that
, then there exists
a coupled fixed point of H.
Proof. The “the mixed G-monotone property” and the “(MBL) condition” on the page 9 in [6] can imply equality (4.3). By Theorem 4.4, we get the proof.
5. Applications
Let
. We discuss the differential equations
(5.1)
with the initial condition
(5.2)
Suppose that there are three continuous mapping
and
with the initial condition
. If there is a constant
such that
then
is called an l−lower solution of differential Equations (5.1) with the initial condition (5.2). Although we use the lower solution definition, we can’t judge
is bigger or smaller than the solution of (5.1) since l is arbitrary bigger than 0. This notation of l-lower solution only shows the relative distance between
and the solution of (5.1).
Theorem 5.1. Let
. Consider the differential Equations (5.1) with the initial condition (5.2) and a constant
. Suppose that the following conditions hold:
1) for
with
, we have
where
with
;
2) there is an l-lower solution of (5.1).
Then the differential Equations (5.1) with initial condition (5.2) has a unique solution
in
. That is,
is the solution of the differential
(5.3)
with the initial condition
.
Proof Let
. It is clear that
is a complete metric space with the metric d defined as
.
Denote
.
We know that B is a closed subset of X. Let G be a graph on X with
and
(5.4)
Clearly,
is an equivalence relation and
. And besides, G is weakly connected.
Define
by
(5.5)
By f’s continuity and (5.4), we know that F is continuous. Then the solution of the differential
Equations (5.1) with initial condition (5.2) are just the tripled fixed point of F. In the following, we discuss the tripled fixed point of F. We will testify that F satisfies the all conditions in Theorem 4.3.
For
, define a graph
and a metric D on
by
and
.
Obviously,
is induced by
. We now prove
if
. Since
,
by (i), we have for
,
(which is a constant)
which implies
and then
.
Moreover, by the above deduction, we have
By (2), the differential Equations (5.1) has an l-lower solution denoted
, we know
.
Thus by Theorem 4.3, F has a unique fixed point
with
.
Thus, the different Equations (5.1) with initial condition (5.2) has a unique solution
and which means
which is equivalent to the different Equations (5.3) with the initial condition
.
Theorem 5.2. Let
satisfy: forgiven
and a sequence
with
and
, we have
. Consider the differential Equations (5.1) with the initial condition (5.2) and a constant
. Suppose that the conditions (1) and (2) in Theorem 5.1 are satisfied. Then we can get the same result with Theorem 5.1.
Proof. Define F as (5.4), then F satisfies
with
. By the similar induction of Theorem 4.3, we can get the proof.
6. Conclusion
We establish N-order fixed point theorems of set-valued and single-valued mapping on product metric space with a graph. We build a unified method to study the N-order fixed point theory.
Acknowledgements
This work is supported by the National Natural Science Foundation of China (Grant No. 11701390).