Resumen de Common best proximity points: global minimal solutions

S. Sadiq Basha

• Let us suppose that A and B are nonempty subsets of a metric space. Let S:A⟶B and T:A⟶B be nonself-mappings. Considering the fact S and T are nonself-mappings, it is feasible that the equations Sx=x and Tx=x have no common solution, designated as a common fixed point of the mappings S and T. Eventually, when the equations have no common solution, one contemplates to figure out an element x that is in close proximity to Sx and Tx in the sense that d(x,Sx) and d(x,Tx) are minimum. In fact, common best proximity point theorems scrutinize the existence of such optimal approximate solutions, known as common best proximity points, to the equations Sx=x and Tx=x in the event that the equations have no common solution. Further, one can perceive that the real-valued functions x⟶d(x,Sx) and x⟶d(x,Tx) estimate the magnitude of the error involved for any common approximate solution of the equations Sx=x and Tx=x. In light of the fact that the distance between x and Sx, and the distance between x and Tx are at least the distance between A and B for all x in A, a common best proximity point theorem ascertains global minimum of both functions x⟶d(x,Sx) and x⟶d(x,Tx) by limiting a common approximate solution of the equations Sx=x and Tx=x to fulfil the requirement that d(x,Sx)=d(A,B) and d(x,Tx)=d(A,B). This article discusses a common best proximity point theorem for a pair of nonself-mappings, one of which dominates the other proximally, thereby yielding common optimal approximate solutions of some fixed point equations when there is no common solution.