Abstract
In this paper, we introduce the class of contraction mappings using C-class functions and some improved control functions for a pair of set valued mappings as well as a pair of single-valued mappings, and prove common fixed point theorems for such mappings in a metric space endowed with a graph. Our results unify and generalize many important fixed point results existing in literature. As an application of our main result, we have derived fixed point theorems for a pair of -admissible set valued mappings in a metric space.
MSC:
47H10; 54H25
1. Introduction and Preliminaries
In [1], Ran and Reurings proved the existence of fixed points for single-valued mappings in partially ordered metric spaces, and their results were extended by Neito and Lopez [2]. However, it became clear that the concept of a graph gives a better vision of fixed points instead of partial ordering, and the first attempt in this direction was done by Jachymsky [3]. He defined the Banach G- contraction for single-valued mapping, which was later extended by Beg et al. [4] for the multivalued mappings. After these, there was a lot of work done in the direction of fixed points in metric spaces endowed with graphs, see [5,6,7,8,9,10,11,12,13,14].
In 1973, Geraghty [15] defined as the class of functions such that
and also showed generalizations of the Banach-Neumann contractive mapping principle.
We now recall the following class of functions:
denotes the class of all continuous and non-decreasing functions , such that:
- if, and only if .denotes the class of all lower semi-continuous functions , such that:
- if, and only if .
For more results on contraction principles involving the above said control functions, we refer the reader to [16,17,18].
In [19], the family of -class functions were introduced as follows: belongs to the -class functions if:
- F is continuous,
- ,
- implies that either or ; for all .
In [20], Samet et al. introduced the concept of -admissible mappings, and proved fixed point theorems for - contractive-type mappings, which paved a way to prove new results and generalise existing results in the fixed point theory. For some recent results on fixed point theorems of -admissible mappings, the reader may refer to [21,22,23,24].
In this work, we utilised the C-class functions to give modified versions of contraction principles involving class functions and class functions in the sense that we have relaxed the condition if, and only if in the and class functions to . As an application, we have also deduced some common fixed point theorems for a pair of -admissible mappings.
Throughout this work, will denote the metric space endowed with a directed graph G with and , where denotes the set of vertices, denotes the set of edges of the graph G and .
Definition 1.
[3] is said to have property A if and implies , for all sequences in .
Definition 2.
[16] The pair of self mappings of is g-edge preserving in G, if
Definition 3.
[11] satisfies transitivity property if, and only if for all , and implies .
Let mappings be given. We will make use of the following notations:
- is the set of all common fixed points of S and T
- is the set of all fixed points of T.
2. Main Results
Let be the set of all continuous functions .
be the set of all continuous and non decreasing functions , such that:
- .Let be the set of all lower semi-continuous functions , such that:
- .
Definition 4.
Let be two given mappings. We say that the pair belongs to the class of contractions if, and only if for all with , the following conditions are satisfied:
- (4.1)
- For , there exists such that
- (4.2)
- For , there exists such that
- (4.3)
- there exists , , such that
- and
where
Theorem 1.
Let be complete and satisfy the following:
- (1.1)
- There exists such that and ,
- (1.2)
- satisfy transitivity property,
- (1.3)
- for some and .
Then .
Proof.
By condition (1.1), suppose , and . By condition (4.1), we can find with and
Now again by condition (4.2), for , there exists with and
Continuing inductively, we construct the sequence recursively as for , as
as well as . Our first task is to establish that . Note that if for any n, then
which shows that , and our first task will be complete. So let for any . Then, by definition of , .
If n is odd, we have
Since , we have
For an even number n, a similar argument leads to inequality (6). Thus, is a monotonically non-increasing sequence which is bounded below, and thereby,
Assume that , so that . Taking lim inf on both sides of the inequality (5), we obtain
a contradiction. Hence . Consequently, we have
Next, we prove that is a Cauchy sequence. By (7), it is enough if we show that the subsequence is a Cauchy sequence. Suppose, if possible, is not a Cauchy sequence. Then, there exists and subsequences and , such that is the smallest index for which . That is,
Now, we have
AS , we get
Also, we have
Also by the transitivity property of G, we have . Thus, we have
Letting and making use of (10) and (11), the above inequality yields
a contradiction. Thus, is a Cauchy sequence. By completeness of , we can find , such that as .
We will now prove that . Note that , and so
where
Note that as , , , and so Now, if , then from (13) as , we have
again, a contradiction. Thus, , which implies that , and since is closed, we have .
Now again, we have , and if , since , we get
a contradiction, and thereby, or . Hence, . ☐
We will deduce the following important results from Theorem 1:
Corollary 1.
Let be complete and satisfy conditions (4.1), condition (4.2), condition (1.1), condition (1.2), and the following:
(1.1) For all with
- and
where , and is as in Definition 4. Then, .
Proof.
Take in Theorem 1. ☐
Corollary 2.
Let be complete and satisfy the conditions (4.1), condition (4.2), condition (1.1), condition (1.2), and the following:
(2.1) For all with
- and
where , and is as in Definition 4. .
Proof.
Take in Theorem 1. ☐
Corollary 3.
Let be complete and satisfy the conditions (4.1), (4.2), (1.1) and (1.2), and the following:
(3.1) For all with , there exist , such that
- and
where is as in Definition 4. Then .
Proof.
For some , set . Then,
- and
implies
- and
or
- and
- Now, let and . Then, the above inequality leads to
- and
Thus, all conditions of Corollary 1 are satisfied, and hence, . ☐
Corollary 4.
Let be complete and satisfy the following:
- (4.1)
- There exists , such that and ;
- (4.2)
- For any , there exists , such that ;
- (4.3)
- satisfies the transitivity property;
- (4.4)
where , . Then, .
Proof.
Take in Corollary 1. ☐
Corollary 5.
Let be complete and satisfy conditions (4.1)–(4.3), and the following:
(5.1)
where , . Then, .
Proof.
Take in Corollary 2. ☐
Example 1.
Let , , , with and and be defined by
and
Define by and for all . Clearly, (note that ) and .
- If and with , then andAlso, for , there exists , such that and for , there exists such that .For , there exists such that and for , there exists such that .
- If with , then andAlso, for , there exists such that and for , there exists , such that .For , there exists , such that and for , there exists , such that
- Also, if with , then andAlso, for , there exists , such that and for , there exists , such that .For , there exists , such that and for , there exists , such that .
Thus, we see that for all with
Also, for , there exists such that and for , there exists , such that . Hence, the pair with . Thus, all conditions of Theorem 1 are satisfied, and .
Remark 1.
Corollary 3 (and hence, Corollary 1 and Theorem 1) are proper extensions and generalisations of Theorem 3.1 of [4] and Theorem 4.2 of [8].
Remark 2.
Note that in Example 1, the graph G is a directed graph and not connected, and so Theorem 3.1 of [4] cannot be applied to neither of the mappings S or T. Also note that , and hence a simple extension of Theorem 3.1 of [4] and Theorem 4.2 of [8] to two mappings cannot be applied. However, we see that the mappings S and T satisfy the conditions of Corollary 3, and so Corollary 3 also ensures the existence of a common fixed point of S and T.
Remark 3.
In Theorem 1, if the directed graph G is replaced with an undirected graph with , then Condition (4.3) in Definition 4 can be replaced with only one inequality:
- Similar arguments follow in Corollaries 1–3 also.
Definition 5.
Let . We say that the pair belongs to the class of Jungck type contractions if
- (5.1)
- .
- (5.2)
- .
Let mappings be given. We will make use of the following notations:
- ,
- is the set of all coincidence points of mappings f and g,
- is the set of all common fixed points of mappings f and (g).
- : Collection of all Cauchy sequences in the metric space .
Lemma 1.
Let f and g satisfy the following:
- (1.1)
- (2.1)
Then, .
Proof.
Let and . Then, since (f, g) is compatible, , or in other words, . By Lemma (1), , which, in turn, shows that . ☐
Theorem 2.
Let and be any two metrics defined on , and is complete. Suppose satisfy the following:
- (2.1)
- (2.2)
- (2.3)
- (2.4)
- (2.5)
- (2.6)
Then,
Proof.
Suppose that . Let . Then, and so ; that is, .
Suppose now, . Let , such that . Now, since , using condition (5.1) we can construct sequence in , such that
for all . It is easy to see that if for any , then and the proof is done. So we assume that for all , . Then,
We also have
Substituting in (15), we get t . So by the definition of , we have
Hence, the sequence is non-negative and non-increasing, and thereby we can find , such that . We claim that . Suppose, on the contrary, that . Letting in (15), we obtain
a contradiction. Thus,
We will show that . Suppose and for , , let be the smallest integer with and
Then, we have
Using (16) in the above inequality, we get
By condition (2.4) we get . Thus, we have
where
Letting , we obtain
By inequality (17), we get
a contradiction. So .
We will show that . If , it is trivial. Thus, suppose . Let . Since , by condition (2.5) we see that . Then, there exists with
whenever . So .
Since is - closed and is complete, there exists , such that
By - compatibility of f and g, we have
Then,
Letting and using (18), the continuity of g, and the G- continuity of f, it follows that , which implies that . So and the proof is complete. ☐
If , we have the following
Theorem 3.
Let be complete and satisfy the following:
- (3.1)
- (
- (3.2)
- g is continuous and is closed
- (3.3)
- (3.4)
- satisfies the transitivity property
- (3.5)
- (a) f is G-continuous and f and g are -compatible or(b) has property A.
Then,
Proof.
Proceeding as in the proof of Theorem 2, we see that if then and if then Now since is closed in , there exists , such that
We will show that . Suppose . Then . Note that if for any , then and the proof is done. So we assume that for all , . If condition (3.5a) is satisfied, then proof follows from a similar argument as in Theorem 2. If condition (3.5b) is satisfied, then for each . Thus, we have
which implies that
Since is non-decreasing, we get
where
Using (19), we obtain
Thus, taking in (22), we get , a contradiction. Therefore, and so . ☐
Theorem 4.
Suppose f and g satisfy condition (2.1)–(2.6), condition (2.6) and the following:
(4.1) If and , then .
If , then .
Proof.
By Theorem 2 . Let and suppose so that . By assumption , and we have
which is a contradiction. Therefore, . Now by Lemma 1, . ☐
Corollary 6.
Let and be any two metrics defined on , and is complete. Suppose satisfy conditions (5.1) and Theorem (2.1) to Theorem (2.5), and the following: for some , and all with
Then,
Corollary 7.
Let and be any two metrics defined on and is complete. Suppose satisfy condition (5.1) and condition (2.1) to condition (2.5) and the following: for some , and all with
Then,
Let and be defined by
Then clearly, . We define
Consider the mappings and , defined by
for all .
Let be defined by
and be defined by
and be given by
We will show that the pair is a contraction.
Let . If (which is possible only if ), then and so . If with and , then we obtain , and then , , and thus . Thus, the pair is g-edge preserving in G.
Now, let and . From the argument given above, if , then and satisfy the condition condition (5.2). If with and , then
and so satisfy the condition condition (5.1).
We will show that g and f are - compatible. Let be a sequence in , such that
Note that
Clearly, is G-continuous, and consequently, all the conditions of Theorem 2 are satisfied. Also note that , , and , and thus condition Theorem (4.1) of Theorem 4 is satisfied. Consequently, .
3. Applications
In this section, as an application of our results, we will give some fixed point results for a pair of set valued -admissible contraction mappings in a metric space.
Throughout this section, is any metric space, two given mappings, and .
Definition 6.
We say that the pair is α-admissible if, and only if for all with , the following conditions hold:
- (6.1)
- For , there exists , such that .
- (6.2)
- For , there exists , such that .
Theorem 5.
Suppose the following conditions hold:
- (5.1)
- There exists such that and ,
- (5.2)
- α is a triangular function,
- (5.3)
- The pair is α-admissible,
- (5.4)
- there exists , , such that for all with
- and
where
Then is a singleton set.
Proof.
Consider the graph G on , defined by and . It is easy to see that the functions S and T satisfy all conditions of Theorem 1, and hence, is a singleton set. ☐
Similarly, we have the following results:
Theorem 6.
Suppose conditions Theorem (5.1), Theorem (6.1), Theorem (6.3), and the following hold:
(6.1) for all with
and
where , and is as in Theorem 5. Then .
Theorem 7.
Suppose conditions Theorem (5.1), Theorem (6.1), Theorem (5.3), and the following hold:
(7.1) for all with
and
where , and is as in Theorem 5. Then, .
Example 2.
Let , and let the metrics be defined by
for all , respectively, where L is a constant real number, such that . It is easy to see that . Now, is given by
Consider the mappings and defined by
for all , respectively.
Let be defined by
Next, let if . Then, , and if with , then we obtain and , and we have and . This implies that .
Since , we need to prove that the function is a g-Cauchy sequence in . Let , and let be a sequence in such that is a Cauchy sequence in . Then, there exists , such that for all . Then, we have
This implies that is a g- Cauchy on .
It can easily be shown that is G-continuous. As a result, we will only need to prove that g and f are -compatible. Let be a sequence in , such that
Then, we have and so it follows that . Now, we have
as . It is easy to see that there exists a point , such that , and thus .
Consequently, all the conditions of Theorem 2 are satisfied.
Example 3.
Let and let the metrics be defined by
for all and some . Then clearly, . We define
Consider the mappings and defined by
for all .
Let be defined by
and, be defined by
Next, if and then and if with , then we obtain , and then , , and thus .
Since , we need to prove that the function is a g-Cauchy sequence in . Let , and let be a sequence in such that is a Cauchy sequence in . Then, there exists such that, for all . Then, we have
We will consider the following cases:
Case 1: . Then, we have
Case 2: . Then, we have
Case 3: . Then, we have
Case 1: . Then, we have
Thus, is a g-Cauchy on .
It can be easily shown that is G-continuous. We will show that g and f are compatible. Let be a sequence in , such that
Then, we have , and so it follows that . Now, we have
as . It is easy to see that there exists a point such that , and thus .
Consequently, all the conditions of Theorem 2 are satisfied.
Author Contributions
The authors contributed equally to the research.
Funding
This research received no external funding.
Acknowledgments
This research is supported by Deanship of Scientific Research at Prince Sattam bin Abdulaziz University, Al kharj, Kingdom of Saudi Arabia. The authors are thankful to the anonymous reviewers for their valuable suggestions which helped in improving this paper to its present form.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Ran, A.C.M.; Reurings, M.C.B. A fixed point theorem in partially ordered sets and some applications to matrix equations. Proc. Am. Math. Soc. 2004, 132, 1435–1443. [Google Scholar] [CrossRef]
- Nieto, J.J.; Rodríguez, L. Contractive mapping theorems in partially ordered sets and applications to ordinary differential equations. Order 2005, 22, 223–239. [Google Scholar] [CrossRef]
- Jachymski, J. The contraction principle for mappings on a metric space with a graph. Proc. Am. Math. Soc. 2008, 136, 1359–1373. [Google Scholar] [CrossRef]
- Beg, I.; Butt, A.R.; Radojevic, S. The contraction principle for set valued mappings on a metric space with a graph. Comput. Math. Appl. 2010, 60, 1214–1219. [Google Scholar] [CrossRef]
- Alfuraidan, M.R. Remarks on monotone multivalued mappings on a metric spaces with a graph. J. Inequal. Appl. 2015, 2015, 202. [Google Scholar] [CrossRef]
- Bojor, F. Fixed point theorems for Reich type contractios on metric spaces with graph. Nonlinear Anal. 2012, 75, 3895–3901. [Google Scholar] [CrossRef]
- Hanjing, A.; Suantai, S. Coincidence point and fixed point theorems for a new type of G-contraction multivalued mappings on a metric space endowedwith a graph. Fixed Point Theory Appl. 2015, 2015, 171. [Google Scholar] [CrossRef]
- Nicolae, A.; O’Regan, D.; Petrusel, A. Fixed point theorems for single-valued and multi-valued generalized contractions in metric spaces endowed with a graph. Georgian Math. J. 2011, 18, 307–327. [Google Scholar]
- Mohanta, S.; Patra, S. Coincidence Points and Common Fixed points for Hybrid Pair of Mappings in b-metric spaces Endowed with a Graph. J. Linear Topol. Algebra 2017, 6, 301–321. [Google Scholar]
- Phon-on, A.; Sama-Ae Makaje, N.; Riyapan, P.; Busaman, S. Coincidence point theorems for weak graph preserving multi-valued mapping. Fixed Point Theory Appl. 2014, 2014, 248. [Google Scholar] [CrossRef]
- Sauntai, S.; Charoensawan, P.; Lampert, T.A. Common Coupled Fixed Point Theorems for θ-ψ-Contraction mappings Endowed with a Directed Graph. Fixed Point Theory Appl. 2015, 2015, 224. [Google Scholar] [CrossRef]
- Sultana, A.; Vetrivel, V. Fixed points of Mizoguchi-Takahashi contraction on a metric space with a graph and applications. J. Math. Anal. Appl. 2014, 417, 336–344. [Google Scholar] [CrossRef]
- Dinevari, T.; Frigon, M. Fixed point results for multivalued contractions on a metric space with a graph. J. Math. Anal. Appl. 2013, 405, 507–517. [Google Scholar] [CrossRef]
- Tiammee, J.; Suantai, S. Coincidence point theorems for graph-preserving multi-valued mappings. Fixed Point Theory Appl. 2014, 2014, 70. [Google Scholar] [CrossRef]
- Geraghty, M.A. On Contractive Mappings. Proc. Am. Math. Soc. 1973, 40, 604–608. [Google Scholar] [CrossRef]
- Charoensawan, P.; Atiponrat, W. Common Fixed Point and Coupled Coincidence Point Theorems for Gerathy’s Type Contraction Mapping with Two Metrics Endowed with Directed Graph. Hindawi J. Math. 2017, 2017, 9. [Google Scholar] [CrossRef]
- Doric, D. Common Fixed Point for Generalized (ψ-φ) Contractions. Appl. Math. Lett. 2009, 3, 1896–1900. [Google Scholar] [CrossRef]
- Khan, M.S.; Swaleh, M.; Sessa, S. Fixed Point Theorems by Altering Distances Between the Points. Bull. Aust. Math. Soc. 1984, 30, 1–9. [Google Scholar] [CrossRef]
- Ansari, A.H. Note on φ-ψ -contractive type mappings and related fixed point. In The 2nd Regional Conference on Mathematics and Applications; Payame Noor University: Tehran, Iran, 2014; pp. 377–380. [Google Scholar]
- Samet, B.; Vetro, C.; Vetro, P. Fixed point theorems for α-ψcontractive mappings. Nonlinear Anal. 2012, 75, 2154–2165. [Google Scholar] [CrossRef]
- Reny, G.; Rajagopalan, R.; Hossam, A.N.; Stojan, R. Dislocated cone metric space over Banach algebra and α-quasi contraction mappings of Perov type. Fixed Point Theory Appl. 2017, 2017, 24. [Google Scholar] [CrossRef]
- De La Sen, M.; Roldan, A.F. Some results on best proximity points of cyclic alpha-psi contractions in Menger probabilistic metric spaces. Math. Sci. 2017, 11, 95–111. [Google Scholar] [CrossRef]
- Abbas, M.; Iqbal, H.; De La Sen, M. Common fixed points of (α, η)-(θ, F) rational contractions with applications. J. Math. 2019, 7, 392. [Google Scholar] [CrossRef]
- Hasanzade Asl, J.; Rezapoue, S.; Shahzad, N. On fixed points of α-ψ contractive multifunctions. Fixed Point Theory Appl. 2012, 2012, 212. [Google Scholar] [CrossRef]
© 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).