1 Introduction and preliminaries

In nonlinear functional analysis, fixed point theory and best proximity point theory play a crucial role in the establishment of the existence of certain differential and integral equations. As a consequence, fixed point theory is very useful for various quantitative sciences that involve such equations. To list a few, certain branches of computer sciences, engineering and economics are well-known examples in which fixed point theory is used.

The most remarkable paper in this field was reported by Banach [1] in 1922. In this paper, Banach proved that every contraction in a complete metric space has a unique fixed point. Following this outstanding paper, many authors have extended, generalized and improved this remarkable fixed point theorem of Banach by changing either the conditions of the mappings or the construction of the space. In particular, one of the notable generalizations of Banach fixed point theorem was reported by Geraghty [2].

Theorem 1.1 (Geraghty [2])

Let (X,d) be a complete metric space and T:XX be an operator. Suppose that there exists β:(0,)[0,1) satisfying the condition

β( t n )1implies t n 0.

If T satisfies the following inequality:

d(Tx,Ty)β ( d ( x , y ) ) d(x,y) for any x,yX,
(1)

then T has a unique fixed point.

It is very natural that some mappings, especially non-self-mappings defined on a complete metric space (X,d), do not necessarily possess a fixed point, that is, d(x,Tx)>0 for all xX. In such situations, it is reasonable to search for the existence (and uniqueness) of a point x X such that d( x ,T x ) is an approximation of an xX such that d(x,Tx)=0. In other words, one speculates to determine an approximate solution x that is optimal in the sense that the distance between x and T x is minimum. Here, the point x X is called a best proximity point.

This research subject has attracted attention of a number of authors; for example, see [223]. In this paper we generalize and improve certain results of Caballero et al. in [6]. Notice also that in the best proximity point theory, we usually consider a non-self-mapping. In fixed point theory, almost all maps are self-mappings. For the sake of completeness, we recall some basic definitions and fundamental results on the best proximity theory.

Let (X,d) be a metric space and A and B be nonempty subsets of a metric space (X,d). A mapping T:AB is called a k-contraction if there exists k(0,1) such that d(Tx,Ty)kd(x,y) for any x,yA. It is clear that a k-contraction coincides with the celebrated Banach fixed point theorem if one takes A=B, where A is a complete subset of X.

Let A and B be two nonempty subsets of a metric space (X,d). We denote by A 0 and B 0 the following sets:

A 0 = { x A : d ( x , y ) = d ( A , B )  for some  y B } , B 0 = { y B : d ( x , y ) = d ( A , B )  for some  x A } ,
(2)

where d(A,B)=inf{d(x,y):xA,yB}.

In [13], the authors presented sufficient conditions which determine when the sets A 0 and B 0 are nonempty. In [19], the author introduced the following definition.

Definition 1.1 Let (A,B) be a pair of nonempty subsets of a metric space (X,d) with A 0 . Then the pair (A,B) is said to have the P-property if and only if for any x 1 , x 2 A 0 and y 1 , y 2 B 0 ,

d( x 1 , y 1 )=d(A,B)andd( x 2 , y 2 )=d(A,B)d( x 1 , x 2 )=d( y 1 , y 2 ).
(3)

It can be easily seen that for any nonempty subset A of (X,d), the pair (A,A) has the P-property. In [19], the author proved that any pair (A,B) of nonempty closed convex subsets of a real Hilbert space H satisfies the P-property. Now, we introduce the class F of those functions β:(0,)[0,1) satisfying the following condition:

β( t n )1implies t n 0.
(4)

Definition 1.2 (See [6])

Let A, B be two nonempty subsets of a metric space (X,d). A mapping T:AB is said to be a Geraghty-contraction if there exists βF such that

d(Tx,Ty)β ( d ( x , y ) ) d(x,y)for any x,yA.
(5)

Theorem 1.2 (See [6])

Let (A,B) be a pair of nonempty closed subsets of a complete metric space (X,d) such that A 0 is nonempty. Let T:AB be a continuous Geraghty-contraction satisfying T( A 0 ) B 0 . Suppose that the pair (A,B) has the P-property. Then there exists a unique x in A such that d( x ,T x )=d(A,B).

In the following section, we improve the theorem above by using a distance function ψ in Definition 1.2. In particular, we introduce Definition 2.1 and broaden the scope of Theorem 1.2 to ψ-Geraghty-contractions.

2 Main results

We start this section with the definition of the following auxiliary function. Let Ψ denote the class of functions ψ:[0,)[0,) which satisfy the following conditions:

  1. (a)

    ψ is nondecreasing;

  2. (b)

    ψ is subadditive, that is, ψ(s+t)ψ(s)+ψ(t);

  3. (c)

    ψ is continuous;

  4. (d)

    ψ(t)=0t=0.

We introduce the following contraction.

Definition 2.1 Let A, B be two nonempty subsets of a metric space (X,d). A mapping T:AB is said to be a ψ-Geraghty contraction if there exists βF such that

ψ ( d ( T x , T y ) ) β ( ψ ( d ( x , y ) ) ) ψ ( d ( x , y ) ) for any x,yA.
(6)

Remark 2.1 Notice that since β:(0,)[0,1), we have

ψ ( d ( T x , T y ) ) β ( ψ ( d ( x , y ) ) ) ψ ( d ( x , y ) ) <ψ ( d ( x , y ) ) for any x,yA with xy.
(7)

We are now ready to state and prove our main theorem.

Theorem 2.1 Let (A,B) be a pair of nonempty closed subsets of a complete metric space (X,d) such that A 0 is nonempty. Let T:AB be a ψ-Geraghty contraction satisfying T( A 0 ) B 0 . Suppose that the pair (A,B) has the P-property. Then there exists a unique x in A such that d( x ,T x )=d(A,B).

Proof Regarding that A 0 is nonempty, we take x 0 A 0 . Since T x 0 T( A 0 ) B 0 , we can find x 1 A 0 such that d( x 1 ,T x 0 )=d(A,B). Analogously, regarding the assumption T x 1 T( A 0 ) B 0 , we determine x 2 A 0 such that d( x 2 ,T x 1 )=d(A,B). Recursively, we obtain a sequence { x n } in A 0 satisfying

d( x n + 1 ,T x n )=d(A,B)for any nN.
(8)

Since (A,B) has the P-property, we derive that

d( x n , x n + 1 )=d(T x n 1 ,T x n )for any nN.
(9)

If there exists n 0 N such that d( x n 0 , x n 0 + 1 )=0, then the proof is completed. Indeed,

0=d( x n 0 , x n 0 + 1 )=d(T x n 0 1 ,T x n 0 ),
(10)

and consequently, T x n 0 1 =T x n 0 . On the other hand, due to (8) we have

d( x n 0 ,T x n 0 1 )=d(A,B).

Therefore, we conclude that

d(A,B)=d( x n 0 ,T x n 0 1 )=d( x n 0 ,T x n 0 ).
(11)

For the rest of the proof, we suppose that d( x n , x n + 1 )>0 for any nN. Since T is a ψ-Geraghty contraction, for any ℕ, we have that

ψ ( d ( x n , x n + 1 ) ) = ψ ( d ( T x n 1 , T x n ) ) β ( ψ ( d ( x n 1 , x n ) ) ) ψ ( d ( x n 1 , x n ) ) < ψ ( d ( x n 1 , x n ) ) .
(12)

Consequently, {ψ(d( x n , x n + 1 ))} is a nonincreasing sequence and bounded below, and so lim n ψ(d( x n , x n + 1 ))=L exists. Let lim n ψ(d( x n , x n + 1 ))=L0. Assume that L>0. Then, from (6), we have

ψ ( d ( x n + 1 , x n + 2 ) ) ψ ( d ( x n , x n + 1 ) ) β ( ψ ( d ( x n , x n + 1 ) ) ) 1

for each n1, which implies that

lim n β ( ψ ( d ( x n , x n + 1 ) ) ) =1.

On the other hand, since βF, we conclude L=0, that is,

lim n ψ ( d ( x n , x n + 1 ) ) =0.
(13)

Notice that since d( x n + 1 ,T x n )=d(A,B) for any nN, for fixed p,qN, we have d( x p ,T x p 1 )=d( x q ,T x q 1 )=d(A,B), and since (A,B) satisfies the P-property, d( x p , x q )=d(T x p 1 ,T x q 1 ). In what follows, we prove that { x n } is a Cauchy sequence. On the contrary, assume that we have

ε= lim sup m , n d( x n , x m )>0.
(14)

By using the triangular inequality,

d( x n , x m )d( x n , x n + 1 )+d( x n + 1 , x m + 1 )+d( x m + 1 , x m ).
(15)

By (12) and since d( x n + 1 , x m + 1 )=d(T x n ,T x m ), by the comment mentioned above, regarding the discussion on the P-property above together with (12), (15) and the property of the function ψ, we derive that

ψ ( d ( x n , x m ) ) ψ ( d ( x n , x n + 1 ) + d ( T x n , T x m ) + d ( x m + 1 , x m ) ) ψ ( d ( x n , x n + 1 ) ) + ψ ( d ( T x n , T x m ) ) + ψ ( d ( x m + 1 , x m ) ) ψ ( d ( x n , x n + 1 ) ) + β ( ψ ( d ( x n , x m ) ) ) ψ ( d ( x n , x m ) ) + ψ ( d ( x m + 1 , x m ) ) .
(16)

By a simple manipulation, (16) yields that

ψ ( d ( x n , x m ) ) ( 1 β ( ψ ( d ( x n , x m ) ) ) ) 1 [ ψ ( d ( x n , x n + 1 ) ) + ψ ( d ( x m + 1 , x m ) ) ] .
(17)

By taking the properties of the function ψ into account, together with (13) and lim sup m , n d( x n , x m )=ε>0 and lim n d( x n , x n + 1 )=0, the last inequality yields

lim sup m , n ( 1 β ( ψ ( d ( x n , x m ) ) ) ) 1 =.
(18)

Therefore lim sup m , n β(ψ(d( x n , x m )))=1. By taking the fact βF into account, we get

lim sup m , n ψ ( d ( x n , x m ) ) =0.

Regarding the properties of the function ψ, the limit above contradicts the assumption (14). Therefore, { x n } is a Cauchy sequence.

Since ( x n )A and A is a closed subset of the complete metric space (X,d), we can find x A such that x n x .

We claim that T x n T x . Suppose, on the contrary, that T x n T x . This means that we can find ε>0 such that for each nN, there exists p n with

ε<d ( T x p n , T x ) .
(19)

Due to the properties of ψ, we get

0<ψ(ε)ψ ( d ( T x p n , T x ) ) .
(20)

Using the fact that T is a ψ-Geraghty contraction, we have

ψ(ε)ψ ( d ( T x p n , T x ) ) β ( ψ ( d ( x p n , x ) ) ) ψ ( d ( x p n , x ) )
(21)

for any nN. Since x p n x and ψ(d( x p n , x p n + 1 ))0, we can find n 0 such that for n n 0

ψ ( d ( x p n , x ) ) <ψ(ε)andψ ( d ( x p n , x p n + 1 ) ) <ψ(ε).
(22)

Consequently, for n n 0 we have

0 < ψ ( ε ) ψ ( d ( T x p n , T x ) ) β ( ψ ( d ( x p n , x ) ) ) ψ ( d ( x p n , x ) ) ψ ( d ( x p n , x ) ) < ψ ( ε ) ,
(23)

a contradiction. Therefore, T x n T x .

Regarding the fact that the sequence {d( x n + 1 ,T x n )} is a constant sequence with value d(A,B), we derive

d ( x , T x ) =d(A,B)
(24)

which is equivalent to saying that x is the best proximity point of T. This completes the proof of the existence of a best proximity point.

We shall show the uniqueness of the best proximity point of T. Suppose that x and y are two distinct best proximity points of T, that is, x y . This implies that

d ( x , T x ) =d(A,B)=d ( y , T y ) .
(25)

Using the P-property, we have

d ( x , x 2 ) =d ( T x , T y ) .
(26)

Using the fact that T is a ψ-Geraghty contraction, we have

ψ ( d ( x , y ) ) =ψ ( d ( T x , T y ) ) β ( ψ ( d ( x , y ) ) ) ψ ( d ( x , y ) ) <ψ ( d ( x , y ) ) ,
(27)

a contradiction. This completes the proof. □

Notice that the pair (A,A) satisfies the P-property for any nonempty subset A of X. Consequently, we have the following corollary.

Corollary 2.1 Let (X,d) be a complete metric space and A be a nonempty closed subset of X. Let T:AA be a ψ-Geraghty-contraction. Then T has a unique fixed point.

Proof Apply Theorem 2.1 with A=B. □

If we take ψ(t)=t we obtain Theorem 1.2 as a corollary of Theorem 2.1.

Corollary 2.2 Let (X,d) be a complete metric space and A be a nonempty closed subset of X. Let T:AA be a Geraghty-contraction. Then T has a unique fixed point.

Proof Apply Theorem 2.1 with A=B and ψ(t)=t. □

In order to illustrate our results, we present the following example.

Example 2.1 Suppose that X= R 2 with the metric

d ( ( x , y ) , ( x , y ) ) =max { | x x | , | y y | }

and consider the closed subsets

A = { ( 0 , x ) : 0 x < } , B = { ( 1 , x ) : 0 x < }

and ψ(t)= t 2 and β(t)= ln ( 1 + t ) t .

Set T:AB to be the mapping defined by

T ( ( 0 , x ) ) = ( 1 , ln ( 1 + x ) ) .

Since d(A,B)=1, the pair (A,B) has the P-property.

Notice that A 0 =A and B 0 =B and T( A 0 ) B 0 .

Without loss of generality, we assume that x> x . Moreover,

d ( T ( 0 , x ) , T ( 0 , x ) ) = | ln ( 1 + x ) ln ( 1 + x ) | =|ln ( 1 + x 1 + x ) |

and

d ( ( 0 , x ) , ( 0 , x ) ) = | x x | .

We have

ψ ( d ( T ( 0 , x ) , T ( 0 , x ) ) ) = 1 2 | ln ( 1 + x 1 + x ) | = 1 2 | ln ( 1 + x + x x 1 + x ) | = 1 2 | ln ( 1 + x x 1 + x ) | 1 2 ln ( 1 + | x x | ) ( since  ln ( 1 + t )  is strictly increasing ) ln ( 1 + 1 2 | x x | ) ln ( 1 + 1 2 | x x | ) 1 2 | x x | 1 2 | x x | = β ( ψ ( d ( ( 0 , x ) , ( 0 , x ) ) ) ) ψ ( d ( ( 0 , x ) , ( 0 , x ) ) ) ,

where β:[0,)[0,1) is defined as β(t)= ln ( 1 + t ) t .

Therefore, T is a ψ-Geraghty-contraction. Notice that the pair (A,B) satisfies the P-property. Indeed, if

d ( ( 0 , x ) , ( 1 , x ) ) = max { 1 , | x x | } = d ( A , B ) = 1 , d ( ( 0 , y ) , ( 1 , y ) ) = max { 1 , | y y | } = d ( A , B ) = 1

then x= x and y= y and hence

|xy|=d ( ( 0 , x ) , ( 0 , y ) ) =d ( ( 1 , x ) , ( 1 , y ) ) = | x y | .

Therefore, since the assumptions of Theorem 2.1 are satisfied, by Theorem 2.1 there exists a unique (0, x )A such that

d ( ( 0 , x ) , T ( 0 , x ) ) =1=d(A,B).

More precisely, the point (0,0)A is the best proximity point of T.

Example 2.2 Let X=R and d(x,y)=|xy| be a metric on X. Suppose A=[0,1] and B=[15/8,2] are two closed subsets of ℝ. Define T:AB by Tx= 1 8 x+2. Define β:(0,)[0,1) by β(t)= 1 1 + t and ψ:[0,)[0,) by ψ(t)= 1 2 t. Clearly, d(A,B)=7/8. Now we have

A 0 = { x A : d ( x , y ) = d ( A , B ) = 7 / 8  for some  y B } = { 1 } , B 0 = { y B : d ( x , y ) = d ( A , B ) = 7 / 8  for some  x A } = { 15 / 8 } .

Also, T( A 0 )= B 0 . Further, clearly, the pair (A,B) has the P-property. Let x,yA. Note that, if x=y, then condition (6) holds. Hence, we assume that xy. We shall show that (6) holds. Suppose, on the contrary, there exist x 0 , y 0 A such that

ψ ( d ( T x 0 , T y 0 ) ) >β ( ψ ( d ( x 0 , y 0 ) ) ) ψ ( d ( x 0 , y 0 ) ) ,

and so

1 2 × 1 8 | x 0 y 0 |> 1 2 | x 0 y 0 | 1 + 1 2 | x 0 y 0 | ,

which yields that 14<| x 0 y 0 |, a contradiction. Therefore condition (6) holds for all x,yA. Hence, the conditions of Theorem 2.1 hold and T has a unique best proximity point. Here, x=1 is the best proximity point of T.