Abstract
The aim of this paper is to obtain some new results about common fixed points. Our results use weaker conditions than those previously used. We have relaxed the conditions for commutating pair mappings and compatible mappings of the type , which were introduced in 1976. The theorems are enriched by using the concept of and various types of weakly commuting pairs of maps in metric spaces. To discuss the existence and uniqueness of the common solutions, we have obtained an application to the functional equations in dynamic programming.
Keywords:
weak contraction; weakly compatible (WC) mappings; R-weakly commuting (RWC) mappings; dynamic programming (DP) MSC:
47H10; 54H25
1. Introduction and Preliminaries
In the literature of metric fixed point theory, the Poincaré concept was introduced by Banach [] in a metric space called contraction mapping, and this was the first result after Brouwer [] in which a fixed point of the contraction map was unique. The main beauty of the Banach fixed point theorem is the richness of the hypothesis and the elegant proof of the theorem. One can observe that the metric fixed point theory has immense applications in the fields of financial economics, medical sciences (for most approximate diagnoses of medicine), defense (missile technology to penetrate the target accurately), and various branches of mathematical and computational sciences.
Jungck [] was perhaps the first to utilize the concept of commutative pairs of mappings for obtaining a unique fixed point by generalizing the contraction condition introduced by Banach.
Later, it was quite natural to ask a question among the researchers: Does there exist any condition weaker than commuting pairs of maps? The answer given by Sessa [] in the year 1982 was in the affirmative by generalizing the commuting pair of maps and introduced the weakly commuting pair of maps in a metric space. A pair of self-mappings on a metric space is said to be weakly commuting [] if for all . Furthermore, in 1986, Jungck [] defined more generalized commutativity, known as compatibility. A pair of self-mappings on a metric space is said to be compatible [] if whenever is a sequence in ℧ such that for some in ℧.
Most of the common fixed point results of compatible mappings and its variants require the following:
- (1)
- Continuity of one of the maps under consideration;
- (2)
- Containment of the range spaces;
- (3)
- Completeness of the spaces or range spaces.
In 1996, Jungck [] extended the notion of compatible mappings to a larger class of mappings known as . Let and be two mappings from a metric space into itself. If and commute at their coincidence point (i.e., if for some implies ), then and are called []. In 1994, Pant [] introduced the notion of mappings in metric spaces first to widen the scope of the study of common fixed point theorems from the class of compatibility to the wider class of mappings. Secondly, the maps are not necessarily continuous at the fixed point. A pair of self-mappings on a metric space is said to be [] if there exists some such that for all .
In 1997, Pathak et al. [] introduced the improved notions of mappings and called these maps mappings of the type and mappings of the type :
Definition 1
([]). A pair of self-mappings on a metric space is said to be the following:
- (1)
- mappings of the type if there exists some such that for all ;
- (2)
- mappings of the type if there exists some such that for all ;
In 2009, Kumar et al. [] introduced the notion of mappings of the type as follows:
Definition 2
([]). A pair of self-mappings on a metric space is said to be mappings of the type if there exists some such that for all .
Example 1.
Let and ρ be an usual metric on ℧. We define the self-mappings Ω and Υ on a metric space as
Then, , , , , and for all κ in ℧.
From Example 1, we have the following:
- (1)
- The pair is not weakly commuting;
- (2)
- For , the pair is , of the type , of the type and of the type ;
- (3)
- For , the pair is of the type but not of the types or .
For the results for common fixed points, see [,,,,,,,]. Now, we are ready to establish some common fixed point theorems in metric spaces by using and pairs of maps which are weaker than the variants of weak commuting pairs of maps in metric spaces and other abstract spaces. The results in this paper are new, and other published papers do not cover them.
2. Main Results
In 2021, Kumar et al. [] introduced a new weak contraction that involves the cubic terms of a distance function and proved the common fixed point theorems for compatible mappings and their variants:
Theorem 1
([]). Let ξ, ζ, Ω, and Υ be four mappings of a complete metric space in itself satisfying the following conditions:
(C1) ;
for all , where
In addition, p is a real number satisfying and a continuous function with and for ;
(C3) One of , or Υ is continuous.
Suppose that the pairs and are type- compatible, type- compatible, type- compatible, or type- compatible. Then, and Υ have a unique common fixed point in ℧.
Now, we extend Theorem 1 from the class of compatible mappings to a larger class of mappings having weak compatibility without appealing to the continuity:
Theorem 2.
Let , and Υ be four self-mappings on a metric space satisfying , , and the following condition:
One of the subspaces , , , or is complete.
Then ξ, ζ, Ω, and Υ have a unique common fixed point, provided that the pairs and are .
Proof.
Let be an arbitrary point. From , we can find such that . For this , one can find such that . By continuing in this way, one can construct a sequence such that
From the proof of Theorem 1 [], is a Cauchy sequence.
Let be complete subspace of ℧. Then, there exist such that
Accordingly, we can find such that . A Cauchy sequence has a convergent subsequence , and therefore we have
We show that . By putting and into , we have
where
By letting , we have
where
Upon simplification, we have
This implies that and hence . Therefore, is a point of coincidence of and . Since , there exist such that .
Next, we show that . Upon putting and into , we have
where
By letting , we obtain
where
Upon simplification, we have
This implies that and hence . Thus, is a coincidence point of and . Since the pairs and are , therefore
Next, we show that . Suppose that . Upon putting and into , we obtain
where
By letting , and upon simplification, we obtain
This implies that , which is a contradiction, and hence .
Thus, we have .
Now, we show that . Suppose that . We put and into , and we have
where
By letting , and upon simplification, we obtain
Thus, we have .
Therefore, is a common fixed point of , and .
Similarly, one can complete the proof by taking , , or as a complete subspace of ℧. The uniqueness of a common fixed point follows easily from the condition . This completes the proof. □
If we put into Theorem 2, then we obtain the following result:
Corollary 1.
Let , and Υ be self-mappings on a complete metric space satisfying the following conditions:
- , ;
- for all , whereFurthermore, p is a real number such that and ) is a continuous function with and for each ;
- One of the subspaces , , or is complete.Then ξ, Ω, and Υ have a unique common fixed point, provided that the pairs and are .
If we put (identity map) in Theorem 2, then we obtain the following result:
Corollary 2.
Let ξ and ζ be two self-mappings on a metric space satisfying the following conditions:
for all , where
Furthermore, p is a real number such that and is a continuous function with and for each .
Assume that one subspace or is complete. Then, ξ and ζ have a unique common fixed point.
Now, we prove a theorem for mappings by avoiding the condition of completeness of the subspaces.
Theorem 3.
Let , and Υ be four self-mappings on a complete metric space satisfying , , and the following condition:
One of subspace , , , or is closed;
Then , and Υ have a unique common fixed point provided that the pairs and are .
Proof.
Since the subspace of a complete metric space is complete if and only if it is closed, the conclusion easily follows from Theorem 2.
This completes the proof. □
In the next theorem, we are going to replace the concept of pairs of maps in previously established Theorems 2 and 3 by variants of weakly commuting pair of maps. In addition, we can realize that the conclusions of said theorems still hold well without changing the rest of the hypothesis:
Theorem 4.
The Theorems 2 and 3 remain true if the property of the pairs and is replaced by any one (retaining the rest of hypothesis) of the following:
- (1)
- Pairs and satisfy the property;
- (2)
- Pairs and satisfy the property of types and , respectively;
- (3)
- Pairs and satisfy the property of types and , respectively;
- (4)
- Pairs and satisfy the property of type ;
- (5)
- Pairs and satisfy the weakly commuting property.
Proof.
Since all the conditions of Theorems 2 and 3 are satisfied, then the existence of coincidence points for both the pairs is ensured. Let and be arbitrary points of coincidence for the pairs and , respectively. Then, using the property, we obtain
and
which implies that and . Thus, the pairs and are . Now, using Theorems 2 and 3, we obtain , , , and have a unique common fixed point.
In case the pair satisfies the property of type , then
which implies that .
Additionally, , which provides . Similarly, for the pair , we have .
Similarly, if the pairs and are s of types and , respectively, of type or weakly commuting, then and also commute at their points of coincidence. Now, in view of Theorems 2 and 3, in all four cases, , , , and have a unique common fixed point. □
Example 2.
Let and d be a usual metric. Let , and Υ be four self-mappings on ℧ defined by
Let be a function defined by for . Then, one can easily verify that all the conditions of Theorems 2 and 3 are satisfied for , and two is the unique common fixed point of , and Υ.
3. Applications
Assume that is the state space and is the decision space, where ℧ and Y are Banach spaces. Let and denote the set of all bounded real-valued functions on . Following Bellman and Lee [], the basic form of the functional equation of dynamic programming is defined as follows:
where and represent the state and decision vectors, respectively, is the transformation of the process, and is the optimal return with the initial state , where the opt denotes the maximum or minimum.
In this section, we shall discuss the existence and uniqueness of a common solution to the following functional equations arising in dynamic programming:
where and :
Theorem 5.
Assume that the following conditions are satisfied:
Proof.
Let for any . Then, is a complete metric space. From conditions (1–4), and are self-mappings of , , , and , and the pairs of mappings , and are . Let be any two pints of , and be any positive number. Suppose that there exists in D such that
where , . In addition, we have
Since is any positive number, from Equations (3) and (4) and condition (2), we have
where is same as in Equation (7). The combination of Equations (7) and (8) gives
Since Equation (9) holds for any , and is any positive number, upon taking supremum over all , we have
Remark 1.
On replacing condition (4) of Theorem 5, by any one of the following conditions (a–e), then we obtain applications for Theorem 4.
- (a)
- For all , there exists some such thatand
- (b)
- For all , there exists some such thatand
- (c)
- For all , there exists some such thatand
- (d)
- For all , there exists some such thatand
- (e)
- For all , we haveand
4. Conclusions
We have demonstrated the power of the very essential tools in this paper, such as mappings and variants of pairs of maps. We made use of satisfying the weak contraction condition in which cubic terms exist in the metric function. The results provided here are the extension of the results from the class of compatible mappings to a larger class of mappings having weak compatibility without appealing to continuity in the context of metric fixed point theory and applications. Our results were also obtained using the condition of to avoid the condition of completeness of the subspaces. Finally, as an application of our results, we have discussed the existence and uniqueness of common solutions to the functional equations arising in dynamic programming.
Retrospect:
- The present study under the given title sounds as though a lot of research can also be performed in the area of contraction and weak contraction conditions.
- On the applications side, a lot of work is in progress for applying the concept of the variants of weak commutativity and weak compatibility to the nonlinear integral equations.
- We are also exploring the possibility of obtaining applications of fixed point theory to day-to-day life, such as the recently faced COVID-19 pandemic, for the most appropriate diagnosis.
Author Contributions
Conceptualization, P.P.M., S.K., R.K. and P.S.; formal analysis, P.P.M., Z.D.M. and R.G.; writing—original draft preparation, P.P.M., S.K., R.K. and P.S.; writing—review and editing, P.P.M., S.K., Z.D.M. and R.G.; funding acquisition, R.G. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Acknowledgments
The authors would like to express their deep sense of gratitude to the referees, who have given their valuable suggestions to improve this work to this form.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Banach, S. Surles operations dans les ensembles abstraites et leursapplications. Fundam. Math. 1922, 3, 133–181. [Google Scholar] [CrossRef]
- Brouwer, L.E.J. Über Abbildungen von Mannigfaltigkeiten. Math. Ann. 1912, 71, 97–115. [Google Scholar] [CrossRef]
- Jungck, G. Commuting mappings and fixed points. Amer. Math. Mon. 1976, 83, 261–263. [Google Scholar] [CrossRef]
- Sessa, S. On a weak commutativity conditions of mappings in fixed point consideration. Publ. Inst. Math. 1982, 32, 146–153. [Google Scholar]
- Jungck, G. Compatible mappings and common fixed points. Int. J. Math. Math. Sci. 1986, 9, 771–779. [Google Scholar] [CrossRef]
- Jungck, G.; Rhoades, B.E. Fixed points for set valued functions without continuity. Indian J. Pure Appl. Math. 1998, 9, 227–238. [Google Scholar]
- Pant, R.P. Common fixed points of non-commuting mappings. J. Math. Anal. Appl. 1994, 188, 436–440. [Google Scholar] [CrossRef]
- Pathak, H.K.; Cho, Y.J.; Kang, S.M. Remarks on R-weakly commuting mappings and common fixed point theorems. Bull. Korean Math. Soc. 1997, 34, 247–257. [Google Scholar]
- Kumar, S.; Garg, S.K. Expansion Mapping Theorem in Metric Spaces. Int. J. Contemp. Math. Sci. 2009, 4, 1749–1758. [Google Scholar]
- Pathak, H.K.; Cho, Y.J.; Kang, S.M.; Lee, B.S. Fixed point theorems for compatible mappings of type (P) and applications to dynamic programming. Matematiche 1995, L, 15–33. [Google Scholar]
- Rhoades, B.E. Some theorems on weakly contractive maps. Nonlinear Anal. 2001, 47, 2683–2693. [Google Scholar] [CrossRef]
- Aamri, M.; El Moutawakil, D. Some new common fixed point theorems under strict contractive conditions. J. Math. Anal. Appl. 2002, 270, 181–188. [Google Scholar] [CrossRef]
- Sintunavarat, W.; Kumam, P. Common fixed point theorems for a pair of weakly compatible mappings in fuzzy metric spaces. Hindawi Publ. Corp. J. Appl. Math. 2011, 2011, 637958. [Google Scholar] [CrossRef]
- Agarwal, R.P.; Bisht, R.K.; Shahzad, N. A comparison of various noncommuting conditions in metric fixed point theory and their applications. Fixed Point Theory Appl. 2014, 1, 1–33. [Google Scholar] [CrossRef]
- Aydi, H.; Mitrović, Z.D.; Radenović, S.; de la Sen, M. On a Common Jungck Type Fixed Point Result in Extended Rectangular b-Metric Spaces. Axioms 2020, 9, 4. [Google Scholar] [CrossRef]
- Carić, B.; Došenović, T.; George, R.; Mitrović, Z.D.; Radenović, S. On Jungck–Branciari–Wardowski Type Fixed Point Results. Mathematics 2021, 9, 161. [Google Scholar] [CrossRef]
- Savanović, N.; Arandjelovic, I.D.; Mitrović, Z.D. The Results on Coincidence and Common Fixed Points for a New Type Multivalued Mappings in b-Metric Spaces. Mathematics 2022, 10, 856. [Google Scholar] [CrossRef]
- Kumar, R.; Kumar, S. Fixed points for weak contraction involving cubic terms of distance function. J. Math. Comput. Sci. 2021, 11, 1922–1954. [Google Scholar]
- Bellman, R.; Lee, E.S. Functional equations arising in dynamic programming. Aequationes Math. 1978, 17, 1–18. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 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 (https://creativecommons.org/licenses/by/4.0/).