New Results for Weakly Compatible (<i>WC</i>) and <i>R</i>-Weakly Commuting (<i>RWC</i>) Mappings with an Applicationin Dynamic Programming

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 (A), which were introduced in 1976. The theorems are enriched by using the concept of WC 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)