Abstract
Some common fixed point theorems for compatible mappings are shown As an application, the existence and uniqueness of common solutions for a class of functional equations arising in dynamic programmings are discussed.
Highlights
In [1] the concept of compatible mappings was introduced as a generalization of commuting mappings and further investigation was given in [2-9] The purpose of this paper is to prove some common fixed point theorems for compatible mappings, which generalized some recent results of [4, 10-13] As an application, we use the results presented to study the existence and uniqueness problem of a common solution for a class of functional equations arising in dynamic programmings, which generalized the corresponding results of 14,15]
It is clear that commuting mappings and weakly commuting mappings are all compatible mappings, but the converse is false
Theorem 3 4 is a generalization of Theorem 3.2 in 14]
Summary
In [1] the concept of compatible mappings was introduced as a generalization of commuting mappings and further investigation was given in [2-9] The purpose of this paper is to prove some common fixed point theorems for compatible mappings, which generalized some recent results of [4, 10-13] As an application, we use the results presented to study the existence and uniqueness problem of a common solution for a class of functional equations arising in dynamic programmings, which generalized the corresponding results of 14,15]
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
