1 Introduction

A wide variety of problems arising in different areas of pure and applied mathematics, such as difference and differential equations, discrete and continuous dynamic systems, and variational analysis, can be modeled as fixed point equations of the form x=Tx. Therefore, fixed point theory plays a crucial role for solving equations of above kind, whose solutions are the fixed points of the mapping T:XX, where X is a nonempty set. Areas of potential applications of this theory include physics, economics, and engineering in dealing with the study of equilibrium points (which are fixed points of certain mappings). On the other hand, if T is a nonself-mapping, the above fixed point equation could have no solutions and, in this case, it is of a certain interest to determine an approximate solution x that is optimal in the sense that the distance between x and Tx is minimum. In this context, best proximity point theory is an useful tool in studying such kind of element. We recall the following concept.

Definition 1.1 Let A, B be two nonempty subsets of a metric space (X,d) and T:AB be a nonself-mapping. An element xA such that d(x,Tx)=d(A,B) is a best proximity point of the nonself-mapping T.

Clearly, if T is a self-mapping, a best proximity point is a fixed point, that is, x=Tx.

From the beginning, best proximity point theory of nonself-mappings has been studied by many authors; see the pioneering papers of Fan [1] and Kirk et al. [2]. The investigation of several variants of conditions for the existence of a best proximity point can be found in [312]. In particular, some significant best proximity point results for multivalued mappings are presented in [13]; see also the references therein.

Inspired and motivated by the above facts, in this paper, we introduce new concepts of contraction mappings. Then we establish certain best proximity point theorems for such kind of mappings in metric spaces. As consequences of these results, we deduce best proximity point theorems in metric spaces endowed with a graph and in partially ordered metric spaces. Moreover, we present an example and some fixed point results to illustrate the usability of the obtained theorems.

2 Preliminaries

In this section, we collect some useful definitions and results from fixed point theory.

Samet et al. [14] defined the notion of α-admissible mapping as follows.

Definition 2.1 ([14])

Let α:X×X[0,+) be a function. We say that a self-mapping T:XX is α-admissible if

x,yX,α(x,y)1α(Tx,Ty)1.

By using this concept, they proved some fixed point results.

Theorem 2.1 ([14])

Let (X,d) be a complete metric space and T:XX be an α-admissible mapping. Assume that the following conditions hold:

  1. (i)

    for all x,yX we have

    α(x,y)d(Tx,Ty)ψ ( d ( x , y ) ) ,
    (1)

    where ψ:[0,+)[0,+) is a nondecreasing function such that n = 1 + ψ n (t)<+ for each t>0,

  2. (ii)

    there exists x 0 X such that α( x 0 ,T x 0 )1,

  3. (iii)

    either T is continuous or for any sequence { x n } in X with α( x n , x n + 1 )1 for all nN{0} and x n x as n+, then α( x n ,x)1 for all nN{0}.

Then T has a fixed point.

Later on, working on these ideas a wide variety of papers appeared in the literature; see for instance [1517]. Finally, we recall that Karapinar et al. [18] introduced the notion of triangular α-admissible mapping as follows.

Definition 2.2 ([18])

Let α:X×X(,+) be a function. We say that a self-mapping T:XX is triangular α-admissible if

( i ) x , y X , α ( x , y ) 1 α ( T x , T y ) 1 , ( ii ) x , y , z X , { α ( x , z ) 1 , α ( z , y ) 1 α ( x , y ) 1 .

For more details and applications of this line of research, we refer the reader to some related papers of the authors and others [1925].

3 Main results in metric spaces

Let A, B be two nonempty subsets of a metric space (X,d). Following the usual notation, we put

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 } .

If AB, then A 0 and B 0 are nonempty. Further, it is interesting to notice that A 0 and B 0 are contained in the boundaries of A and B, respectively, provided A and B are closed subsets of a normed linear space such that d(A,B)>0 (see [26]). Also, we will use the following definition; see [27] for more details.

Definition 3.1 Let A, B be two nonempty subsets of a metric space (X,d). The pair (A,B) is said to have the V-property if, for every sequence { y n } of B that satisfies the condition d(x, y n )d(x,B) for some xA, there is yB such that d(x,y)=d(x,B).

From now on, denote with Ψ the family of all continuous and nondecreasing functions ψ:[0,+)×[0,+)[0,+) such that ψ(x,y)=0 if and only if x=y=0.

Definition 3.2 Let A, B be two nonempty subsets of a metric space (X,d) and α:A×A[0,+) be a function. We say that a nonself-mapping T:AB is triangular α-proximal admissible if, for all x,y,z, x 1 , x 2 , u 1 , u 2 A,

( T 1 ) { α ( x 1 , x 2 ) 1 , d ( u 1 , T x 1 ) = d ( A , B ) , d ( u 2 , T x 2 ) = d ( A , B ) α ( u 1 , u 2 ) 1 , ( T 2 ) { α ( x , z ) 1 , α ( z , y ) 1 α ( x , y ) 1 .

Definition 3.3 Let A, B be two nonempty subsets of a metric space (X,d) and α:A×A[0,+) be a function. We say that a nonself-mapping T:AB is

  1. (i)

    a modified α-proximal C-contraction if, for all u,v,x,yA,

    { α ( x , y ) 1 , d ( u , T x ) = d ( A , B ) , d ( v , T y ) = d ( A , B ) d ( u , v ) 1 2 ( d ( x , v ) + d ( y , u ) ) ψ ( d ( x , v ) , d ( y , u ) ) ,
    (2)
  2. (ii)

    an α-proximal C-contraction of type (I) if, for all u,v,x,yA,

    { d ( u , T x ) = d ( A , B ) , d ( v , T y ) = d ( A , B ) α ( x , y ) d ( u , v ) 1 2 ( d ( x , v ) + d ( y , u ) ) ψ ( d ( x , v ) , d ( y , u ) ) ,

where 0α(x,y)1 for all x,yA,

  1. (iii)

    an α-proximal C-contraction of type (II) if, for all u,v,x,yA,

    { d ( u , T x ) = d ( A , B ) , d ( v , T y ) = d ( A , B ) ( α ( x , y ) + ) d ( u , v ) ( + 1 ) 1 2 ( d ( x , v ) + d ( y , u ) ) ψ ( d ( x , v ) , d ( y , u ) ) ,

where >0.

Remark 3.1 Every α-proximal C-contraction of type (I) and α-proximal C-contraction of type (II) mappings are modified α-proximal C-contraction mappings.

Now we give our main result.

Theorem 3.1 Let A, B be two nonempty subsets of a metric space (X,d) such that A is complete and A 0 is nonempty. Assume that T:AB is a continuous modified α-proximal C-contraction such that the following conditions hold:

  1. (i)

    T is a triangular α-proximal admissible mapping and T( A 0 ) B 0 ,

  2. (ii)

    there exist x 0 , x 1 A 0 such that

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

Then T has a best proximity point. Further, the best proximity point is unique if, for every x,yA such that d(x,Tx)=d(A,B)=d(y,Ty), we have α(x,y)1.

Proof By (ii) there exist x 0 , x 1 A 0 such that

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

On the other hand, T( A 0 ) B 0 , then there exists x 2 A 0 such that

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

Now, since T is triangular α-proximal admissible, we have α( x 1 , x 2 )1. Thus

d( x 2 ,T x 1 )=d(A,B)andα( x 1 , x 2 )1.

Since T( A 0 ) B 0 , there exists x 3 A 0 such that

d( x 3 ,T x 2 )=d(A,B).

Then we have

d( x 2 ,T x 1 )=d(A,B),d( x 3 ,T x 2 )=d(A,B),α( x 1 , x 2 )1.

Again, since T is triangular α-proximal admissible, we obtain α( x 2 , x 3 )1 and hence

d( x 3 ,T x 2 )=d(A,B),α( x 2 , x 3 )1.

By continuing this process, we construct a sequence { x n } such that

{ α ( x n 1 , x n ) 1 , d ( x n , T x n 1 ) = d ( A , B ) , d ( x n + 1 , T x n ) = d ( A , B ) ,
(3)

for all nN. Now, from (2) with u= x n , v= x n + 1 , x= x n 1 and y= x n , we get

d ( x n , x n + 1 ) 1 2 ( d ( x n 1 , x n + 1 ) + d ( x n , x n ) ) ψ ( d ( x n 1 , x n + 1 ) , d ( x n , x n ) ) = 1 2 d ( x n 1 , x n + 1 ) ψ ( d ( x n 1 , x n + 1 ) , 0 ) 1 2 d ( x n 1 , x n + 1 ) 1 2 ( d ( x n 1 , x n ) + d ( x n , x n + 1 ) ) ,
(4)

which implies d( x n , x n + 1 )d( x n 1 , x n ). It follows that the sequence { d n }, where d n :=d( x n , x n + 1 ), is decreasing and so there exists d0 such that d n d as n+. Then, taking the limit as n+ in (4), we obtain

d 1 2 lim n + d( x n 1 , x n + 1 ) 1 2 (d+d)=d,

that is,

lim n + d( x n 1 , x n + 1 )=2d.
(5)

Again taking the limit as n+ in (4), by (5) and the continuity of ψ, we get

ddψ(2d,0),

and so ψ(2d,0)=0. Therefore, by the property of ψ, we get d=0, that is,

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

Now, we prove that { x n } is a Cauchy sequence. Suppose, to the contrary, that { x n } is not a Cauchy sequence. Then there are ε>0 and sequences {m(k)} and {n(k)} such that for all positive integers k

n(k)>m(k)>k,d( x n ( k ) , x m ( k ) )ε,d( x n ( k ) 1 , x m ( k ) )<ε.

This implies that, for all kN, we have

ε d ( x n ( k ) , x m ( k ) ) d ( x n ( k ) , x n ( k ) 1 ) + d ( x n ( k ) 1 , x m ( k ) ) < d ( x n ( k ) , x n ( k ) 1 ) + ε .

Taking the limit as k+ in the above inequality and using (6), we get

lim k + d( x n ( k ) , x m ( k ) )=ε.
(7)

Again, from

d( x n ( k ) , x m ( k ) )d( x m ( k ) , x m ( k ) + 1 )+d( x m ( k ) + 1 , x n ( k ) + 1 )+d( x n ( k ) + 1 , x n ( k ) )

and

d( x n ( k ) + 1 , x m ( k ) + 1 )d( x m ( k ) , x m ( k ) + 1 )+d( x m ( k ) , x n ( k ) )+d( x n ( k ) + 1 , x n ( k ) ),

taking the limit as k+, by (6) and (7) we deduce

lim k + d( x n ( k ) + 1 , x m ( k ) + 1 )=ε.
(8)

Similarly, we deduce

lim k + d( x n ( k ) , x m ( k ) + 1 )=ε
(9)

and

lim k + d( x m ( k ) , x n ( k ) + 1 )=ε.
(10)

We shall show that

α( x m ( k ) , x n ( k ) )1,where n(k)>m(k)>k.
(11)

Since T is a triangular α-proximal admissible mapping and

{ α ( x m ( k ) , x m ( k ) + 1 ) 1 , α ( x m ( k ) + 1 , x m ( k ) + 2 ) 1 ,

by (T2) of Definition 3.2, we have

α( x m ( k ) , x m ( k ) + 2 )1.

Again, since T is a triangular α-proximal admissible mapping and

{ α ( x m ( k ) , x m ( k ) + 2 ) 1 , α ( x m ( k ) + 2 , x m ( k ) + 3 ) 1 ,

by (T2) of Definition 3.2 we have

α( x m ( k ) , x m ( k ) + 3 )1.

Thus, by continuing this process, we get (11).

On the other hand, we know that

{ d ( x m ( k ) + 1 , T x m ( k ) ) = d ( A , B ) , d ( x n ( k ) + 1 , T x n ( k ) ) = d ( A , B ) .

Therefore, from (2) we have

d ( x m ( k ) + 1 , x n ( k ) + 1 ) 1 2 ( d ( x m ( k ) , x n ( k ) + 1 ) + d ( x n ( k ) , x m ( k ) + 1 ) ) ψ ( d ( x m ( k ) , x n ( k ) + 1 ) , d ( x n ( k ) , x m ( k ) + 1 ) ) .

Taking the limit as k+ in the above inequality and using (8), (9), (10) and the continuity of ψ, we get

ε 1 2 (ε+ε)ψ(ε,ε)

and hence ψ(ε,ε)=0, which leads to the contradiction ε=0. Thus, { x n } is a Cauchy sequence. Since A is complete, then there is zA such that x n z. Now, from

d( x n + 1 ,T x n )=d(A,B),for all nN{0},

taking the limit as n+, we deduce d(z,Tz)=d(A,B), because of the continuity of T.

Finally we prove the uniqueness of the point xA such that d(x,Tx)=d(A,B). Indeed, suppose that there exist x,yA which are best proximity points, that is, d(x,Tx)=d(A,B)=d(y,Ty). Since α(x,y)1, we have

d ( x , y ) 1 2 ( d ( x , y ) + d ( y , x ) ) ψ ( d ( x , y ) , d ( y , x ) ) = d ( x , y ) ψ ( d ( x , y ) , d ( x , y ) ) ,

which implies d(x,y)=0, that is, x=y. □

Corollary 3.1 Let A, B be two nonempty subsets of a metric space (X,d) such that A is complete and A 0 is nonempty. Assume that T:AB is a continuous α-proximal C-contraction mapping of type (I) or a continuous α-proximal C-contraction mapping of type (II) such that the following conditions hold:

  1. (i)

    T is a triangular α-proximal admissible mapping and T( A 0 ) B 0 ,

  2. (ii)

    there exist x 0 , x 1 A 0 such that

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

Then T has a best proximity point. Further, the best proximity point is unique if, for every x,yA such that d(x,Tx)=d(A,B)=d(y,Ty), we have α(x,y)1.

In analogy to the main result but omitting the continuity hypothesis of T, we can state the following theorem.

Theorem 3.2 Let A, B be two nonempty subsets of a metric space (X,d) such that A is complete, the pair (A,B) has the V-property and A 0 is nonempty. Assume that T:AB is a modified α-proximal C-contraction such that the following conditions hold:

  1. (i)

    T is a triangular α-proximal admissible mapping and T( A 0 ) B 0 ,

  2. (ii)

    there exist x 0 , x 1 A 0 such that

    d( x 1 ,T x 0 )=d(A,B)andα( x 0 , x 1 )1,
  3. (iii)

    if { x n } is a sequence in A such that α( x n , x n + 1 )1 and x n xA as n+, then α( x n ,x)1 for all nN{0}.

Then T has a best proximity point. Further, the best proximity point is unique if, for every x,yA such that d(x,Tx)=d(A,B)=d(y,Ty), we have α(x,y)1.

Proof Following the proof of Theorem 3.1, there exist a Cauchy sequence { x n }A and zA such that (3) holds and x n z as n+. On the other hand, for all nN, we can write

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

Taking the limit as n+ in the above inequality, we get

lim n + d(z,T x n )=d(z,B)=d(A,B).
(12)

Since the pair (A,B) has the V-property, then there exists wB such that d(z,w)=d(A,B) and hence z A 0 . Moreover, since T( A 0 ) B 0 , then there exists vA such that

d(v,Tz)=d(A,B).

Now, by (iii) and (3), we have α( x n ,z)1 and d( x n + 1 ,T x n )=d(A,B) for all nN{0}. Also, since T is a modified α-proximal C-contraction, we get

d( x n + 1 ,v) 1 2 ( d ( x n , v ) + d ( z , x n + 1 ) ) ψ ( d ( x n , v ) , d ( z , x n + 1 ) ) .

Taking the limit as n+ in the above inequality, we have

d(z,v) 1 2 d(z,v)ψ ( d ( z , v ) , 0 )

which implies, d(z,v)=0, that is, v=z. Hence z is a best proximity point of T. The uniqueness of the best proximity point follows easily proceeding as in Theorem 3.1. □

Next, we use an example to illustrate the efficiency of the new theorem.

Example 3.1 Let X=R be endowed with the usual metric d(x,y)=|xy|, for all x,yX. Consider A=(,1], B=[1,+) and define T:AB by

Tx={ x + 1 , if  x ( , 14 ) , x 2 + 1 , if  x [ 14 , 12 ) , 4 x 4 + 5 , if  x [ 12 , 10 ) , x 3 + 2 , if  x [ 10 , 8 ) , 10 , if  x [ 8 , 6 ) , ln ( | x | + 1 ) , if  x [ 6 , 4 ) , x + | x + 3 | | x + 4 | e x , if  x [ 4 , 2 ) , 1 , if  x [ 2 , 1 ] .

Also, define α:X×X[0,+) by

α(x,y)={ 4 , if  x , y [ 2 , 1 ] , 1 2 , otherwise ,

and ψ:[0,+)×[0,+)[0,+) by

ψ(s,t)= 1 2 (s+t),for all s,tX.

Clearly, the pair (A,B) has the V-property and d(A,B)=2. Now, we have

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

It is immediate to see that T( A 0 ) B 0 , d(1,T(1))=d(A,B)=2 and α(1,1)1.

Now, let α(x,y)1 and α(y,z)1. Therefore, x,y,z[2,1], that is, α(x,z)1. Also suppose

{ α ( x , y ) 1 , d ( u , T x ) = d ( A , B ) = 2 , d ( v , T y ) = d ( A , B ) = 2 ,

then

{ x , y [ 2 , 1 ] , d ( u , T x ) = 2 , d ( v , T y ) = 2 .

Hence, u=v=1, that is, α(u,v)1. Further,

d(u,v)=0 1 2 ( d ( x , v ) + d ( y , u ) ) ψ ( d ( x , v ) , d ( y , u ) ) ,

that is, T is a triangular α-proximal admissible and modified α-proximal C-contraction mapping. Moreover, if { x n } is a sequence such that α( x n , x n + 1 )1 for all nN{0} and x n x as n+, then { x n }[2,1] and hence x[2,1]. Consequently, α( x n ,x)1 for all nN{0}. Therefore all the conditions of Theorem 3.2 hold for this example and T has a best proximity point. Here z=1 is the best proximity point of T.

We conclude this section with another corollary.

Corollary 3.2 Let A, B be two nonempty subsets of a metric space (X,d) such that A is complete, the pair (A,B) has the V-property and A 0 is nonempty. Assume that T:AB is a continuous α-proximal C-contraction mapping of type (I) or a continuous α-proximal C-contraction mapping of type (II) such that the following conditions hold:

  1. (i)

    T is a triangular α-proximal admissible mapping and T( A 0 ) B 0 ,

  2. (ii)

    there exist elements x 0 , x 1 A 0 such that

    d( x 1 ,T x 0 )=d(A,B)andα( x 0 , x 1 )1,
  3. (iii)

    if { x n } is a sequence in A such that α( x n , x n + 1 )1 and x n xA as n+, then α( x n ,x)1 for all nN{0}.

Then T has a best proximity point. Further, the best proximity point is unique if, for every x,yA such that d(x,Tx)=d(A,B)=d(y,Ty), we have α(x,y)1.

4 Some results in metric spaces endowed with a graph

Consistent with Jachymski [28], let (X,d) be a metric space and Δ denotes the diagonal of the Cartesian product X×X. Consider a directed graph G such that the set V(G) of its vertices coincides with X, and the set E(G) of its edges contains all loops, that is, E(G)Δ. We assume that G has no parallel edges, so we can identify G with the pair (V(G),E(G)). Moreover, we may treat G as a weighted graph (see [29], p.309) by assigning to each edge the distance between its vertices. If x and y are vertices in a graph G, then a path in G from x to y of length N (NN) is a sequence { x i } i = 0 N of N+1 vertices such that x 0 =x, x N =y and ( x i 1 , x i )E(G) for i=1,,N. A graph G is connected if there is a path between any two vertices. G is weakly connected if G ˜ is connected (see for details [28, 30]).

Recently, some results have appeared providing sufficient conditions for a mapping to be a Picard operator if (X,d) is endowed with a graph. The first result in this direction was given by Jachymski [28].

Definition 4.1 ([28])

Let (X,d) be a metric space endowed with a graph G. We say that a self-mapping T:XX is a Banach G-contraction or simply a G-contraction if T preserves the edges of G, that is,

for all x,yX,(x,y)E(G)(Tx,Ty)E(G)

and T decreases weights of the edges of G in the following way:

α(0,1),for all x,yX,(x,y)E(G)d(Tx,Ty)αd(x,y).

Definition 4.2 Let A,B be two nonempty closed subsets of a metric space (X,d) endowed with a graph G. We say that a nonself-mapping T:AB is a G-proximal C-contraction if, for all u,v,x,yA,

{ ( x , y ) E ( G ) , d ( u , T x ) = d ( A , B ) , d ( v , T y ) = d ( A , B ) d ( u , v ) 1 2 ( d ( x , v ) + d ( y , u ) ) ψ ( d ( x , v ) , d ( y , u ) )

and

{ ( x , y ) E ( G ) , d ( u , T x ) = d ( A , B ) , d ( v , T y ) = d ( A , B ) (u,v)E(G).

Theorem 4.1 Let A, B be two nonempty closed subsets of a metric space (X,d) endowed with a graph G. Assume that A is complete, A 0 is nonempty and T:AB is a continuous G-proximal C-contraction mapping such that the following conditions hold:

  1. (i)

    T( A 0 ) B 0 ,

  2. (ii)

    there exist elements x 0 , x 1 A 0 such that

    d( x 1 ,T x 0 )=d(A,B)and( x 0 , x 1 )E(G),
  3. (iii)

    for all (x,y)E(G) and (y,z)E(G), we have (x,z)E(G).

Then T has a best proximity point. Further, the best proximity point is unique if, for every x,yA such that d(x,Tx)=d(A,B)=d(y,Ty), we have (x,y)E(G).

Proof Define α:X×X[0,+) by

α(x,y)={ 1 , if  ( x , y ) E ( G ) , 0 , otherwise .

Firstly we prove that T is a triangular α-proximal admissible mapping. To this aim, assume

{ α ( x , y ) 1 , d ( u , T x ) = d ( A , B ) , d ( v , T y ) = d ( A , B ) .

Therefore, we have

{ ( x , y ) E ( G ) , d ( u , T x ) = d ( A , B ) , d ( v , T y ) = d ( A , B ) .

Since T is a G-proximal C-contraction mapping, we get (u,v)E(G), that is, α(u,v)1 and

d(u,v) 1 2 ( d ( x , v ) + d ( y , u ) ) ψ ( d ( x , v ) , d ( y , u ) ) .

Also, let α(x,z)1 and α(z,y)1, then (x,z)E(G) and (z,y)E(G). Consequently, from (iii), we deduce that (x,y)E(G), that is, α(x,y)1. Thus T is a triangular α-proximal admissible mapping with T( A 0 ) B 0 . Moreover, T is a continuous modified α-proximal C-contraction. From (ii) there exist x 0 , x 1 A 0 such that d( x 1 ,T x 0 )=d(A,B) and ( x 0 , x 1 )E(G), that is, d( x 1 ,T x 0 )=d(A,B) and α( x 0 , x 1 )1. Hence, all the conditions of Theorem 3.1 are satisfied and T has a unique fixed point. □

Similarly, by using Theorem 3.2, we can prove the following theorem.

Theorem 4.2 Let A, B be two nonempty closed subsets of a metric space (X,d) endowed with a graph G. Assume that A is complete, the pair (A,B) has the V-property and A 0 is nonempty. Also suppose that T:AB is a G-proximal C-contraction mapping such that the following conditions hold:

  1. (i)

    T( A 0 ) B 0 ,

  2. (ii)

    there exist elements x 0 , x 1 A 0 such that

    d( x 1 ,T x 0 )=d(A,B)and( x 0 , x 1 )E(G),
  3. (iii)

    for all (x,y)E(G) and (y,z)E(G), we have (x,z)E(G),

  4. (iv)

    if { x n } is a sequence in X such that ( x n , x n + 1 )E(G) for all nN{0} and x n x as n+, then ( x n ,x)E(G) for all nN{0}.

Then T has a best proximity point. Further, the best proximity point is unique if, for every x,yA such that d(x,Tx)=d(A,B)=d(y,Ty), we have (x,y)E(G).

5 Some results in partially ordered metric spaces

In recent years, Ran and Reurings [31] initiated the study of weaker contraction conditions by considering self-mappings in partially ordered metric space. Further these results were generalized by many authors; see for instance [32, 33]. Here we consider some recent results of Mongkolkeha et al. [34] and Sadiq Basha et al. [35].

Definition 5.1 ([35])

Let (X,d,) be a partially ordered metric space. We say that a nonself-mapping T:AB is proximally ordered-preserving if and only if, for all x 1 , x 2 , u 1 , u 2 A,

{ x 1 x 2 , d ( u 1 , T x 1 ) = d ( A , B ) , d ( u 2 , T x 2 ) = d ( A , B ) u 1 u 2 .

Theorem 5.1 (Theorem 2.2 of [34])

Let A, B be two nonempty closed subsets of a partially ordered complete metric space (X,d,) such that A 0 is nonempty. Assume that T:AB satisfies the following conditions:

  1. (i)

    T is continuous and proximally ordered-preserving such that T( A 0 ) B 0 ,

  2. (ii)

    there exist elements x 0 , x 1 A 0 such that

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

    for all x,y,u,vA,

    { x y , d ( u , T x ) = d ( A , B ) , d ( y , T y ) = d ( A , B ) d(u,v) 1 2 ( d ( x , v ) + d ( y , u ) ) ψ ( d ( x , v ) , d ( y , u ) ) .

Then T has a best proximity point.

Proof Define α:A×A[0,+) by

α(x,y)={ 1 , if  x y , 0 , otherwise .

Firstly we prove that T is a triangular α-proximal admissible mapping. To this aim, assume

{ α ( x , y ) 1 , d ( u , T x ) = d ( A , B ) , d ( v , T y ) = d ( A , B ) .

Therefore, we have

{ x y , d ( u , T x ) = d ( A , B ) , d ( v , T y ) = d ( A , B ) .

Now, since T is proximally ordered-preserving, then uv, that is, α(u,v)1. Consequently, condition (T1) of Definition 3.2 holds. Also, assume

{ α ( x , z ) 1 , α ( z , y ) 1 ,

so that { x z , z y , and consequently xy, that is, α(x,y)1. Hence, condition (T2) of Definition 3.2 holds. Further, by (ii) we have

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

Moreover, from (iii) we get

{ α ( x , y ) 1 , d ( u , T x ) = d ( A , B ) , d ( y , T y ) = d ( A , B ) d(u,v) 1 2 ( d ( x , v ) + d ( y , u ) ) ψ ( d ( x , v ) , d ( y , u ) ) .

Thus all the conditions of Theorem 3.1 hold and T has a best proximity point. □

Similarly, omitting the continuity hypothesis of T, we can give the following result.

Theorem 5.2 (see Theorem 2.6 of [34])

Let A, B be two nonempty closed subsets of a partially ordered complete metric space (X,d,) such that A 0 is nonempty and the pair (A,B) has the V-property. Assume that T:AB satisfies the following conditions:

  1. (i)

    T is proximally ordered-preserving such that T( A 0 ) B 0 ,

  2. (ii)

    there exist elements x 0 , x 1 A 0 such that

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

    for all x,y,u,vA,

    { x y , d ( u , T x ) = d ( A , B ) , d ( y , T y ) = d ( A , B ) d(u,v) 1 2 ( d ( x , v ) + d ( y , u ) ) ψ ( d ( x , v ) , d ( y , u ) ) ,
  4. (iv)

    if { x n } is an increasing sequence in A converging to xA, then x n x for all nN.

Then T has a best proximity point.

6 Application to fixed point theorems

In this section we briefly collect some fixed point results which are consequences of the results presented in the main section. Stated precisely, from Theorem 3.1, we obtain the following theorems.

Theorem 6.1 Let (X,d) be a complete metric space. Assume that T:XX is a continuous self-mapping satisfying the following conditions:

  1. (i)

    T is triangular α-admissible,

  2. (ii)

    there exists x 0 in X such that α( x 0 ,T x 0 )1,

  3. (iii)

    for all x,yX,

    α(x,y)d(Tx,Ty) 1 2 ( d ( x , T y ) + d ( y , T x ) ) ψ ( d ( x , T y ) , d ( y , T x ) ) .

Then T has a fixed point.

Theorem 6.2 Let (X,d) be a complete metric space. Assume that T:XX is a continuous self-mapping satisfying the following conditions:

  1. (i)

    T is triangular α-admissible,

  2. (ii)

    there exists x 0 in X such that α( x 0 ,T x 0 )1,

  3. (iii)

    for all x,yX,

    ( α ( x , y ) + ) d ( T x , T y ) ( + 1 ) 1 2 ( d ( x , T y ) + d ( y , T x ) ) ψ ( d ( x , T y ) , d ( y , T x ) ) ,

where >0.

Then T has a fixed point.

Analogously, from Theorem 3.2, we obtain the following theorems, which do not require the continuity of T.

Theorem 6.3 Let (X,d) be a complete metric space. Assume that T:XX is a self-mapping satisfying the following conditions:

  1. (i)

    T is triangular α-admissible,

  2. (ii)

    there exists x 0 in X such that α( x 0 ,T x 0 )1,

  3. (iii)

    for all x,yX,

    α(x,y)d(Tx,Ty) 1 2 ( d ( x , T y ) + d ( y , T x ) ) ψ ( d ( x , T y ) , d ( y , T x ) ) ,
  4. (iv)

    if { x n } is a sequence in X such that α( x n , x n + 1 )1 and x n x as n+, then α( x n ,x)1 for all nN.

Then T has a fixed point.

Theorem 6.4 Let (X,d) be a complete metric space. Assume that T:XX is a self-mapping satisfying the following conditions:

  1. (i)

    T is triangular α-admissible,

  2. (ii)

    there exists x 0 in X such that α( x 0 ,T x 0 )1,

  3. (iii)

    for all x,yX,

    ( α ( x , y ) + 1 ) d ( T x , T y ) 2 [ 1 2 ( d ( x , T y ) + d ( y , T x ) ) ψ ( d ( x , T y ) , d ( y , T x ) ) ] ,
  4. (iv)

    if { x n } is a sequence in A such that α( x n , x n + 1 )1 and x n xA as n+, then α( x n ,x)1 for all nN.

Then T has a fixed point.