Skip to main content

On best proximity points for set-valued contractions of Nadler type with respect to b-generalized pseudodistances in b-metric spaces

Abstract

In this paper, in b-metric space, we introduce the concept of b-generalized pseudodistance which is an extension of the b-metric. Next, inspired by the ideas of Nadler (Pac. J. Math. 30:475-488, 1969) and Abkar and Gabeleh (Rev. R. Acad. Cienc. Exactas Fís. Nat., Ser. A Mat. 107(2):319-325, 2013), we define a new set-valued non-self-mapping contraction of Nadler type with respect to this b-generalized pseudodistance, which is a generalization of Nadler’s contraction. Moreover, we provide the condition guaranteeing the existence of best proximity points for T:A 2 B . A best proximity point theorem furnishes sufficient conditions that ascertain the existence of an optimal solution to the problem of globally minimizing the error inf{d(x,y):yT(x)}, and hence the existence of a consummate approximate solution to the equation T(x)=x. In other words, the best proximity points theorem achieves a global optimal minimum of the map xinf{d(x;y):yT(x)} by stipulating an approximate solution x of the point equation T(x)=x to satisfy the condition that inf{d(x;y):yT(x)}=dist(A;B). The examples which illustrate the main result given. The paper includes also the comparison of our results with those existing in the literature.

MSC:47H10, 54C60, 54E40, 54E35, 54E30.

1 Introduction

A number of authors generalize Banach’s [1] and Nadler’s [2] result and introduce the new concepts of set-valued contractions (cyclic or non-cyclic) of Banach or Nadler type, and they study the problem concerning the existence of best proximity points for such contractions; see e.g. Abkar and Gabeleh [35], Al-Thagafi and Shahzad [6], Suzuki et al. [7], Di Bari et al. [8], Sankar Raj [9], Derafshpour et al. [10], Sadiq Basha [11], and Włodarczyk et al. [12].

In 2012, Abkar and Gabeleh [13] introduced and established the following interesting and important best proximity points theorem for a set-valued non-self-mapping. First, we recall some definitions and notations.

Let A, B be nonempty subsets of a metric space (X,d). Then denote: dist(A,B)=inf{d(x,y):xA,yB}; A 0 ={xA:d(x,y)=dist(A,B) for some yB}; B 0 ={yB:d(x,y)=dist(A,B) for some xA}; D(x,B)=inf{d(x,y):yB} for xX. We say that the pair (A,B) has the P-property if and only if

{ d ( x 1 , y 1 ) = dist ( A , B ) d ( x 2 , y 2 ) = dist ( A , B ) } d( x 1 , x 2 )=d( y 1 , y 2 ),

where x 1 , x 2 A 0 and y 1 , y 2 B 0 .

Theorem 1.1 (Abkar and Gabeleh [13])

Let (A,B) be a pair of nonempty closed subsets of a complete metric space (X,d) such that A 0 and (A,B) has the P-property. Let T:A 2 B be a multivalued non-self-mapping contraction, that is, 0 λ < 1 x , y A {H(T(x),T(y))λd(x,y)}. If T(x) is bounded and closed in B for all xA, and T( x 0 ) B 0 for each x 0 A 0 , then T has a best proximity point in A.

It is worth noticing that the map T in Theorem 1.1 is continuous, so it is u.s.c. on X, which by [[14], Theorem 6, p.112], shows that T is closed on X. In 1998, Czerwik [15] introduced of the concept of a b-metric space. A number of authors study the problem concerning the existence of fixed points and best proximity points in b-metric space; see e.g. Berinde [16], Boriceanu et al. [17, 18], Bota et al. [19] and many others.

In this paper, in a b-metric space, we introduce the concept of a b-generalized pseudodistance which is an extension of the b-metric. The idea of replacing a metric by the more general mapping is not new (see e.g. distances of Tataru [20], w-distances of Kada et al. [21], τ-distances of Suzuki [[22], Section 2] and τ-functions of Lin and Du [23] in metric spaces and distances of Vályi [24] in uniform spaces). Next, inspired by the ideas of Nadler [2] and Abkar and Gabeleh [13], we define a new set-valued non-self-mapping contraction of Nadler type with respect to this b-generalized pseudodistance, which is a generalization of Nadler’s contraction. Moreover, we provide the condition guaranteeing the existence of best proximity points for T:A 2 B . A best proximity point theorem furnishes sufficient conditions that ascertain the existence of an optimal solution to the problem of globally minimizing the error inf{d(x,y):yT(x)}, and hence the existence of a consummate approximate solution to the equation T(X)=x. In other words, the best proximity points theorem achieves a global optimal minimum of the map xinf{d(x;y):yT(x)} by stipulating an approximate solution x of the point equation T(x)=x to satisfy the condition that inf{d(x;y):yT(x)}=dist(A;B). Examples which illustrate the main result are given. The paper includes also the comparison of our results with those existing in the literature. This paper is a continuation of research on b-generalized pseudodistances in the area of b-metric space, which was initiated in [25].

2 On generalized pseudodistance

To begin, we recall the concept of b-metric space, which was introduced by Czerwik [15] in 1998.

Definition 2.1 Let X be a nonempty subset and s1 be a given real number. A function d:X×X[0,) is b-metric if the following three conditions are satisfied: (d1)  x , y X {d(x,y)=0x=y}; (d2) x , y X {d(x,y)=d(y,x)}; and (d3) x , y , z X {d(x,z)s[d(x,y)+d(y,z)]}.

The pair (X,d) is called a b-metric space (with constant s1). It is easy to see that each metric space is a b-metric space.

In the rest of the paper we assume that the b-metric d:X×X[0,) is continuous on  X 2 . Now in b-metric space we introduce the concept of a b-generalized pseudodistance, which is an essential generalization of the b-metric.

Definition 2.2 Let X be a b-metric space (with constant s1). The map J:X×X[0,), is said to be a b-generalized pseudodistance on X if the following two conditions hold:

(J1) x , y , z X {J(x,z)s[J(x,y)+J(y,z)]}; and

(J2) for any sequences ( x m :mN) and ( y m :mN) in X such that

lim n sup m > n J( x n , x m )=0
(2.1)

and

lim m J( x m , y m )=0,
(2.2)

we have

lim m d( x m , y m )=0.
(2.3)

Remark 2.1 (A) If (X,d) is a b-metric space (with s1), then the b-metric d:X×X[0,) is a b-generalized pseudodistance on X. However, there exists a b-generalized pseudodistance on X which is not a b-metric (for details see Example 4.1).

(B) From (J1) and (J2) it follows that if xy, x,yX, then

J(x,y)>0J(y,x)>0.

Indeed, if J(x,y)=0 and J(y,x)=0, then J(x,x)=0, since, by (J1), we get J(x,x)s[J(x,y)+J(y,x)]=s[0+0]=0. Now, defining ( x m =x:mN) and ( y m =y:mN), we conclude that (2.1) and (2.2) hold. Consequently, by (J2), we get (2.3), which implies d(x,y)=0. However, since xy, we have d(x,y)0, a contradiction.

Now, we apply the b-generalized pseudodistance to define the H J -distance of Nadler type.

Definition 2.3 Let X be a b-metric space (with s1). Let the class of all nonempty closed subsets of X be denoted by Cl(X), and let the map J:X×X[0,) be a b-generalized pseudodistance on X. Let u X V Cl ( X ) {J(u,V)= inf v V J(u,v)}. Define H J :Cl(X)×Cl(X)[0,) by

A , B Cl ( X ) { H J ( A , B ) = max { sup u A J ( u , B ) , sup v B J ( v , A ) } } .

We will present now some indications that we will use later in the work.

Let (X,d) be a b-metric space (with s1) and let A and B be subsets of X and let the map J:X×X[0,) be a b-generalized pseudodistance on X. We adopt the following denotations and definitions: A , B Cl ( X ) {dist(A,B)=inf{d(x,y):xA,yB}} and

A 0 = { x A : J ( x , y ) = dist ( A , B )  for some  y B } ; B 0 = { y B : J ( x , y ) = dist ( A , B )  for some  x A } .

Definition 2.4 Let X be a b-metric space (with s1) and let the map J:X×X[0,) be a b-generalized pseudodistance on X. Let (A,B) be a pair of nonempty subset of X with A 0 .

  1. (I)

    The pair (A,B) is said to have the P J -property if and only if

    { [ J ( x 1 , y 1 ) = dist ( A , B ) ] [ J ( x 2 , y 2 ) = dist ( A , B ) ] } { J ( x 1 , x 2 ) = J ( y 1 , y 2 ) } ,

    where x 1 , x 2 A 0 and y 1 , y 2 B 0 .

  2. (II)

    We say that the b-generalized pseudodistance J is associated with the pair (A,B) if for any sequences ( x m :mN) and ( y m :mN) in X such that lim m x m =x; lim m y m =y, and

    m N { J ( x m , y m 1 ) = dist ( A , B ) } ,

then d(x,y)=dist(A,B).

Remark 2.2 If (X,d) is a b-metric space (with s1), and we put J=d, then:

  1. (I)

    The map d is associated with each pair (A,B), where A,BX. It is an easy consequence of the continuity of d.

  2. (II)

    The P d -property is identical with the P-property. In view of this, instead of writing the P d -property we will write shortly the P-property.

3 The best proximity point theorem with respect to a b-generalized pseudodistance

We first recall the definition of closed maps in topological spaces given in Berge [14] and Klein and Thompson [26].

Definition 3.1 Let L be a topological vector space. The set-valued dynamic system (X,T), i.e. T:X 2 X is called closed if whenever ( x m :mN) is a sequence in X converging to xX and ( y m :mN) is a sequence in X satisfying the condition m N { y m T( x m )} and converging to yX, then yT(x).

Next, we introduce the concepts of a set-valued non-self-closed map and a set-valued non-self-mapping contraction of Nadler type with respect to the b-generalized pseudodistance.

Definition 3.2 Let L be a topological vector space. Let X be certain space and A, B be a nonempty subsets of X. The set-valued non-self-mapping T:A 2 B is called closed if whenever ( x m :mN) is a sequence in A converging to xA and ( y m :mN) is a sequence in B satisfying the condition m N { y m T( x m )} and converging to yB, then yT(x).

It is worth noticing that the map T in Theorem 1.1 is continuous, so it is u.s.c. on X, which by [[14], Theorem 6, p.112], shows that T is closed on X.

Definition 3.3 Let X be a b-metric space (with s1) and let the map J:X×X[0,) be a b-generalized pseudodistance on X. Let (A,B) be a pair of nonempty subsets of X. The map T:A 2 B such that T(x)Cl(X), for each xX, we call a set-valued non-self-mapping contraction of Nadler type, if the following condition holds:

0 λ < 1 x , y A { s H J ( T ( x ) , T ( y ) ) λ J ( x , y ) } .
(3.1)

It is worth noticing that if (X,d) is a metric space (i.e. s=1) and we put J=d, then we obtain the classical Nadler condition. Now we prove two auxiliary lemmas.

Lemma 3.1 Let X be a complete b-metric space (with s1). Let (A,B) be a pair of nonempty closed subsets of X and let T:A 2 B . Then

x , y A γ > 0 w T ( x ) v T ( y ) { J ( w , v ) H J ( T ( x ) , T ( y ) ) + γ } .
(3.2)

Proof Let x,yA, γ>0 and wT(x) be arbitrary and fixed. Then, by the definition of infimum, there exists vT(y) such that

J(w,v)<inf { J ( w , u ) : u T ( y ) } +γ.
(3.3)

Next,

inf { J ( w , u ) : u T ( y ) } + γ sup { inf { J ( z , u ) : u T ( y ) } : z T ( x ) } + γ max { sup { inf { J ( z , u ) : u T ( y ) } : z T ( x ) } , sup { inf { J ( u , z ) : z T ( x ) } : u T ( y ) } } + γ = H J ( T ( x ) , T ( y ) ) + γ .

Hence, by (3.3) we obtain J(w,v) H J (T(x),T(y))+γ, thus (3.2) holds. □

Lemma 3.2 Let X be a complete b-metric space (with s1) and let the sequence ( x m :m{0}N) satisfy

lim n sup m > n J( x n , x m )=0.
(3.4)

Then ( x m :m{0}N) is a Cauchy sequence on X.

Proof From (3.4) we claim that

ε > 0 n 1 = n 1 ( ε ) N n > n 1 { sup { J ( x n , x m ) : m > n } < ε }

and, in particular,

ε > 0 n 1 = n 1 ( ε ) N n > n 1 t N { J ( x n , x t + n ) < ε } .
(3.5)

Let i 0 , j 0 N, i 0 > j 0 , be arbitrary and fixed. If we define

z n = x i 0 + n and u n = x j 0 + n for nN,
(3.6)

then (3.5) gives

lim n J( x n , z n )= lim n J( x n , u n )=0.
(3.7)

Therefore, by (3.4), (3.7), and (J2),

lim n d( x n , z n )= lim n d( x n , u n )=0.
(3.8)

From (3.8) and (3.6) we then claim that

ε > 0 n 2 = n 2 ( ε ) N n > n 2 { d ( x n , x i 0 + n ) < ε 2 s }
(3.9)

and

n 3 = n 3 ( ε ) N n > n 3 { d ( x n , x j 0 + n ) < ε 2 s } .
(3.10)

Let now ε 0 >0 be arbitrary and fixed, let n 0 ( ε 0 )=max{ n 2 ( ε 0 ), n 3 ( ε 0 )}+1 and let k,lN be arbitrary and fixed such that k>l> n 0 . Then k= i 0 + n 0 and l= j 0 + n 0 for some i 0 , j 0 N such that i 0 > j 0 and, using (d3), (3.9), and (3.10), we get d( x k , x l )=d( x i 0 + n 0 , x j 0 + n 0 )sd( x n 0 , x i 0 + n 0 )+sd( x n 0 , x j 0 + n 0 )<s ε 0 /2s+s ε 0 /2s= ε 0 .

Hence, we conclude that ε > 0 n 0 = n 0 ( ε ) N k , l N , k > l > n 0 {d( x k , x l )<ε}. Thus the sequence ( x m :m{0}N) is Cauchy. □

Next we present the main result of the paper.

Theorem 3.1 Let X be a complete b-metric space (with s1) and let the map J:X×X[0,) be a b-generalized pseudodistance on X. Let (A,B) be a pair of nonempty closed subsets of X with A 0 and such that (A,B) has the P J -property and J is associated with (A,B). Let T:A 2 B be a closed set-valued non-self-mapping contraction of Nadler type. If T(x) is bounded and closed in B for all xA, and T(x) B 0 for each x A 0 , then T has a best proximity point in A.

Proof To begin, we observe that by assumptions of Theorem 3.1 and by Lemma 3.1, the property (3.2) holds. The proof will be broken into four steps.

Step 1. We can construct the sequences ( w m :m{0}N) and ( v m :m{0}N) such that

m { 0 } N { w m A 0 v m B 0 } ,
(3.11)
m { 0 } N { v m T ( w m ) } ,
(3.12)
m N { J ( w m , v m 1 ) = dist ( A , B ) } ,
(3.13)
m N { J ( v m 1 , v m ) H J ( T ( w m 1 ) , T ( w m ) ) + ( λ s ) m }
(3.14)

and

m N { J ( w m , w m + 1 ) = J ( v m 1 , v m ) } ,
(3.15)
lim n sup m > n J ( w n , w m ) =0,
(3.16)

and

lim n sup m > n J ( v n , v m ) =0.
(3.17)

Indeed, since A 0 and T(x) B 0 for each x A 0 , we may choose w 0 A 0 and next v 0 T( w 0 ) B 0 . By definition of B 0 , there exists w 1 A such that

J ( w 1 , v 0 ) =dist(A,B).
(3.18)

Of course, since v 0 B, by (3.18), we have w 1 A 0 . Next, since T(x) B 0 for each x A 0 , from (3.2) (for x= w 0 , y= w 1 , γ=λ/s, w= v 0 ) we conclude that there exists v 1 T( w 1 ) B 0 (since w 1 A 0 ) such that

J ( v 0 , v 1 ) H J ( T ( w 0 ) , T ( w 1 ) ) + λ s .
(3.19)

Next, since v 1 B 0 , by definition of B 0 , there exists w 2 A such that

J ( w 2 , v 1 ) =dist(A,B).
(3.20)

Of course, since v 1 B, by (3.20), we have w 2 A 0 . Since T(x) B 0 for each x A 0 , from (3.2) (for x= w 1 , y= w 2 , γ= ( λ / s ) 2 , w= v 1 ) we conclude that there exists v 2 T( w 2 ) B 0 (since w 2 A 0 ) such that

J ( v 1 , v 2 ) H J ( T ( w 1 ) , T ( w 2 ) ) + ( λ s ) 2 .
(3.21)

By (3.18)-(3.21) and by the induction, we produce sequences ( w m :m{0}N) and ( v m :m{0}N) such that:

m { 0 } N { w m A 0 v m B 0 } , m { 0 } N { v m T ( w m ) } , m N { J ( w m , v m 1 ) = dist ( A , B ) }

and

m N { J ( v m 1 , v m ) H J ( T ( w m 1 ) , T ( w m ) ) + ( λ s ) m } .

Thus (3.11)-(3.14) hold. In particularly (3.13) gives m N {J( w m , v m 1 )=dist(A,B)J( w m + 1 , v m )=dist(A,B)}. Now, since the pair (A,B) has the P J -property, from the above we conclude

m N { J ( w m , w m + 1 ) = J ( v m 1 , v m ) } .

Consequently, the property (3.15) holds.

We recall that the contractive condition (see (3.1)) is as follows:

0 λ < 1 x , y A { s H J ( T ( x ) , T ( y ) ) λ J ( x , y ) } .
(3.22)

In particular, by (3.22) (for x= w m , y= w m + 1 , m{0}N) we obtain

m { 0 } N { H J ( T ( w m ) , T ( w m + 1 ) ) λ s J ( w m , w m + 1 ) } .
(3.23)

Next, by (3.15), (3.14), and (3.23) we calculate:

m N { J ( w m , w m + 1 ) = J ( v m 1 , v m ) H J ( T ( w m 1 ) , T ( w m ) ) + ( λ s ) m λ s J ( w m 1 , w m ) + ( λ s ) m = λ s J ( v m 2 , v m 1 ) + ( λ s ) m λ s [ H J ( T ( w m 2 ) , T ( w m 1 ) ) + ( λ s ) m 1 ] + ( λ s ) m = λ s H J ( T ( w m 2 ) , T ( w m 1 ) ) + 2 ( λ s ) m ( λ s ) 2 J ( w m 2 , w m 1 ) + 2 ( λ s ) m = ( λ s ) 2 J ( v m 3 , v m 2 ) + 2 ( λ s ) m ( λ s ) 2 [ H J ( T ( w m 3 ) , T ( w m 2 ) ) + ( λ s ) m 2 ] + 2 ( λ s ) m = ( λ s ) 2 H J ( T ( w m 3 ) , T ( w m 2 ) ) + 3 ( λ s ) m ( λ s ) 3 J ( w m 3 , w m 2 ) + 3 ( λ s ) m ( λ s ) m J ( w 0 , w 1 ) + m ( λ s ) m } .

Hence,

m N { J ( w m , w m + 1 ) ( λ s ) m J ( w 0 , w 1 ) + m ( λ s ) m } .
(3.24)

Now, for arbitrary and fixed nN and all mN, m>n, by (3.24) and (d3), we have

J ( w n , w m ) s J ( w n , w n + 1 ) + s J ( w n + 1 , w m ) s J ( w n , w n + 1 ) + s [ s J ( w n + 1 , w n + 2 ) + s J ( w n + 2 , w m ) ] = s J ( w n , w n + 1 ) + s 2 J ( w n + 1 , w n + 2 ) + s 2 J ( w n + 2 , w m ) k = 0 m ( n + 1 ) s k + 1 J ( w n + k , w n + 1 + k ) k = 0 m ( n + 1 ) s k + 1 [ ( λ s ) n + k J ( w 0 , w 1 ) + ( n + k ) ( λ s ) n + k ] = k = 0 m ( n + 1 ) [ ( λ n + k s n 1 ) J ( w 0 , w 1 ) + ( n + k ) ( λ n + k s n 1 ) ] = 1 s n 1 k = 0 m ( n + 1 ) [ λ n + k J ( w 0 , w 1 ) + ( n + k ) λ n + k ] .

Hence

J ( w n , w m ) 1 s n 1 k = 0 m ( n + 1 ) [ J ( w 0 , w 1 ) + ( n + k ) ] λ n + k .
(3.25)

Thus, as n in (3.25), we obtain

lim n sup m > n J ( w n , w m ) =0.

Next, by (3.15) we obtain lim n sup m > n J( v n , v m )=0. Then the properties (3.11)-(3.17) hold.

Step 2. We can show that the sequence ( w m :m{0}N) is Cauchy.

Indeed, it is an easy consequence of (3.16) and Lemma 3.2.

Step 3. We can show that the sequence ( v m :m{0}N) is Cauchy.

Indeed, it follows by Step 1 and by a similar argumentation as in Step 2.

Step 4. There exists a best proximity point, i.e. there exists w 0 A such that

inf { d ( w 0 , z ) : z T ( w 0 ) } =dist(A,B).

Indeed, by Steps 2 and 3, the sequences ( w m :m{0}N) and ( v m :m{0}N) are Cauchy and in particularly satisfy (3.12). Next, since X is a complete space, there exist w 0 , v 0 X such that lim m w m = w 0 and lim m v m = v 0 , respectively. Now, since A and B are closed (we recall that m { 0 } N { w m A v m B}), thus w 0 A and v 0 B. Finally, since by (3.12) we have m { 0 } N { v m T( w m )}, by closedness of T, we have

v 0 T( w 0 ).
(3.26)

Next, since w 0 A, v 0 B and T(A)B, by (3.26) we have T( w 0 )B and

dist ( A , B ) = inf { d ( a , b ) : a A b B } D ( w 0 , B ) D ( w 0 , T ( w 0 ) ) = inf { d ( w 0 , z ) : z T ( w 0 ) } d ( w 0 , v 0 ) .
(3.27)

We know that lim m w m = w 0 , lim m v m = v 0 . Moreover by (3.13)

m N { J ( w m , v m 1 ) = dist ( A , B ) } .

Thus, since J and (A,B) are associated, so by Definition 2.4(II), we conclude that

d( w 0 , v 0 )=dist(A,B).
(3.28)

Finally, (3.27) and (3.28), give inf{d( w 0 ,z):zT( w 0 )}=dist(A,B). □

4 Examples illustrating Theorem 3.1 and some comparisons

Now, we will present some examples illustrating the concepts having been introduced so far. We will show a fundamental difference between Theorem 1.1 and Theorem 3.1. The examples will show that Theorem 3.1 is an essential generalization of Theorem 1.1. First, we present an example of J, a generalized pseudodistance.

Example 4.1 Let X be a b-metric space (with constant s=2) where b-metric d:X×X[0,) is of the form d(x,y)= | x y | 2 , x,yX. Let the closed set EX, containing at least two different points, be arbitrary and fixed. Let c>0 such that c>δ(E), where δ(E)=sup{d(x,y):x,yX} be arbitrary and fixed. Define the map J:X×X[0,) as follows:

J(x,y)= { d ( x , y ) if  { x , y } E = { x , y } , c if  { x , y } E { x , y } .
(4.1)

The map J is a b-generalized pseudodistance on X. Indeed, it is worth noticing that the condition (J1) does not hold only if some x 0 , y 0 , z 0 X such that J( x 0 , z 0 )>s[J( x 0 , y 0 )+J( y 0 , z 0 )] exists. This inequality is equivalent to c>s[d( x 0 , y 0 )+d( y 0 , z 0 )] where J( x 0 , z 0 )=c, J( x 0 , y 0 )=d( x 0 , y 0 ) and J( y 0 , z 0 )=d( y 0 , z 0 ). However, by (4.1), J( x 0 , z 0 )=c shows that there exists v{ x 0 , z 0 } such that vE; J( x 0 , y 0 )=d( x 0 , y 0 ) gives { x 0 , y 0 }E; J( y 0 , z 0 )=d( y 0 , z 0 ) gives { y 0 , z 0 }E. This is impossible. Therefore, x , y , z X {J(x,y)s[J(x,z)+J(z,y)]}, i.e. the condition (J1) holds.

Proving that (J2) holds, we assume that the sequences ( x m :mN) and ( y m :mN) in X satisfy (2.1) and (2.2). Then, in particular, (2.2) yields

0 < ε < c m 0 = m 0 ( ε ) N m m 0 { J ( x m , y m ) < ε } .
(4.2)

By (4.2) and (4.1), since ε<c, we conclude that

m m 0 { E { x m , y m } = { x m , y m } } .
(4.3)

From (4.3), (4.1), and (4.2), we get

0 < ε < c m 0 N m m 0 { d ( x m , y m ) < ε } .

Therefore, the sequences ( x m :mN) and ( y m :mN) satisfy (2.3). Consequently, the property (J2) holds.

The next example illustrates Theorem 3.1.

Example 4.2 Let X be a b-metric space (with constant s=2), where X=[0,3] and d(x,y)= | x y | 2 , x,yX. Let A=[0,1] and B=[2,3]. Let E=[0, 1 4 ][1,3] and let the map J:X×X[0,) be defined as follows:

J(x,y)= { d ( x , y ) if  { x , y } E = { x , y } , 10 if  { x , y } E { x , y } .
(4.4)

Of course, since E is closed set and δ(E)=9<10, by Example 4.1 we see that the map J is the b-generalized pseudodistance on X. Moreover, it is easy to verify that A 0 ={1} and B 0 ={2}. Indeed, dist(A,B)=1, thus

A 0 = { x A = [ 0 , 1 ] : J ( x , y ) = dist ( A , B ) = 1  for some  y B = [ 2 , 3 ] } ,

and by (4.4) {x,y}E={x,y}, so J(x,y)=d(x,y), x[0,1/4]{1} and y[2,3]. Consequently A 0 ={1}. Similarly,

B 0 = { y B = [ 2 , 3 ] : J ( x , y ) = dist ( A , B ) = 1  for some  x A = [ 0 , 1 ] } ,

and, by (4.4), {x,y}E={x,y}, so J(x,y)=d(x,y), y[2,3] and x[0,1/4]{1}. Consequently B 0 ={2}.

Let T:A 2 B be given by the formula

T(x)= { { 2 } [ 11 4 , 3 ] for  x [ 0 , 1 4 ] , [ 11 4 , 3 ] for  x ( 1 4 , 1 2 ) , [ 5 2 , 3 ] for  x [ 1 2 , 3 4 ) , [ 9 4 , 3 ] for  x [ 3 4 , 7 8 ) , { 2 } [ 9 4 , 3 ] for  x = 7 8 , { 2 } for  x ( 7 8 , 1 ] , xX.
(4.5)

We observe the following.

(I) We can show that the pair (A,B) has the P J -property.

Indeed, as we have previously calculated A 0 ={1} and B 0 ={2}. This gives the following result: for each x 1 , x 2 A 0 and y 1 , y 2 B 0 , such that J( x 1 , y 1 )=dist(A,B)=1 and J( x 2 , y 2 )=dist(A,B)=1, since A 0 and B 0 are included in E, by (4.4) we have

J( x 1 , x 2 )=d( x 1 , x 2 )=d(1,1)=0=d(2,2)=d( y 1 , y 2 )=J( y 1 , y 2 ).

(II) We can show that the map J is associated with (A,B).

Indeed, let the sequences ( x m :mN) and ( y m :mN) in X, such that lim m x m =x, lim m y m =y and

m N { J ( x m , y m 1 ) = dist ( A , B ) } ,
(4.6)

be arbitrary and fixed. Then, since dist(A,B)=1<10, by (4.6) and (4.4), we have

m N { d ( x m , y m 1 ) = J ( x m , y m 1 ) = dist ( A , B ) } .
(4.7)

Now, from (4.7) and by continuity of d, we have d(x,y)=dist(A,B).

  1. (III)

    It is easy to see that T is a closed map on X.

  2. (IV)

    We can show that T is a set-valued non-self-mapping contraction of Nadler type with respect J (for λ=1/2; as a reminder: we have s=2).

Indeed, let x,yA be arbitrary and fixed. First we observe that since T(A)B=[2,3]E, by (4.4) we have H J (T(x),T(y))=H(T(x),T(y))1, for each x,yA. We consider the following two cases.

Case 1. If {x,y}E{x,y}, then by (4.4), J(x,y)=10, and consequently H J (T(x),T(y))1<10/4=(1/4)10=(λ/s)J(x,y). In consequence, s H J (T(x),T(y))λJ(x,y).

Case 2. If {x,y}E={x,y}, then x,yE[0,1]=[0,/1/4]{1}. From the obvious property

x , y [ 0 , / 1 / 4 ] { T ( x ) = T ( y ) T ( 1 ) T ( x ) }

can be deduced that x , y [ 0 , / 1 / 4 ] { 1 } { H J (T(x),T(y))=0}. Hence, s H J (T(x),T(y))=0λJ(x,y).

In consequence, T is the set-valued non-self-mapping contraction of Nadler type with respect to J.

  1. (V)

    We can show that T(x) is bounded and closed in B for all xA.

Indeed, it is an easy consequence of (4.5).

  1. (VI)

    We can show that T(x) B 0 for each x A 0 .

Indeed, by (I), we have A 0 ={1} and B 0 ={2}, from which, by (4.5), we get T(1)={2} B 0 .

All assumptions of Theorem 3.1 hold. We see that D(1,T(1))=D(1,{2})=1=dist(A,B), i.e. 1 is the best proximity point of T.

Remark 4.1 (I) The introduction of the concept of b-generalized pseudodistances is essential. If X and T are like in Example 4.2, then we can show that T is not a set-valued non-self-mapping contraction of Nadler type with respect to d. Indeed, suppose that T is a set-valued non-self-mapping contraction of Nadler type, i.e. 0 λ < 1 x , y X {sH(T(x),T(y))λd(x,y)}. In particular, for x 0 = 1 2 and y 0 =1 we have T( x 0 )=[5/2,3], T( y 0 )={2} and 2=2H(T( x 0 ),T( y 0 ))=sH(T( x 0 ),T( y 0 ))λd( x 0 , y 0 )=λ | 1 / 2 1 | 2 =λ1/4<1/4. This is absurd.

(II) If X is metric space (s=1) with metric d(x,y)=|xy|, x,yX, and T is like in Example 4.2, then we can show that T is not a set-valued non-self-mapping contraction of Nadler type with respect to d. Indeed, suppose that T is a set-valued non-self-mapping contraction of Nadler type, i.e. 0 λ < 1 x , y X {H(T(x),T(y))λd(x,y)}. In particular, for x 0 = 1 2 and y 0 =1 we have 2=2H(T( x 0 ),T( y 0 ))=sH(T( x 0 ),T( y 0 ))λd( x 0 , y 0 )=λ|1/21|=λ1/2<1/2. This is absurd. Hence, we find that our theorem is more general than Theorem 1.1 (Abkar and Gabeleh [13]).

References

  1. Banach S: Sur les opérations dans les ensembles abstraits et leurs applications aux équations intégrales. Fundam. Math. 1922, 3: 133–181.

    Google Scholar 

  2. Nadler SB: Multi-valued contraction mappings. Pac. J. Math. 1969, 30: 475–488. 10.2140/pjm.1969.30.475

    Article  MathSciNet  Google Scholar 

  3. Abkar A, Gabeleh M: Best proximity points for asymptotic cyclic contraction mappings. Nonlinear Anal. 2011, 74: 7261–7268. 10.1016/j.na.2011.07.043

    Article  MathSciNet  Google Scholar 

  4. Abkar A, Gabeleh M: Generalized cyclic contractions in partially ordered metric spaces. Optim. Lett. 2012, 6(8):1819–1830. 10.1007/s11590-011-0379-y

    Article  MathSciNet  Google Scholar 

  5. Abkar A, Gabeleh M: Global optimal solutions of noncyclic mappings in metric spaces. J. Optim. Theory Appl. 2012, 153(2):298–305. 10.1007/s10957-011-9966-4

    Article  MathSciNet  Google Scholar 

  6. Al-Thagafi MA, Shahzad N: Convergence and existence results for best proximity points. Nonlinear Anal. 2009, 70: 3665–3671. 10.1016/j.na.2008.07.022

    Article  MathSciNet  Google Scholar 

  7. Suzuki T, Kikkawa M, Vetro C: The existence of best proximity points in metric spaces with the property UC. Nonlinear Anal. 2009, 71: 2918–2926. 10.1016/j.na.2009.01.173

    Article  MathSciNet  Google Scholar 

  8. Di Bari C, Suzuki T, Vetro C: Best proximity points for cyclic Meir-Keeler contractions. Nonlinear Anal. 2008, 69: 3790–3794. 10.1016/j.na.2007.10.014

    Article  MathSciNet  Google Scholar 

  9. Sankar Raj V: A best proximity point theorem for weakly contractive non-self-mappings. Nonlinear Anal. 2011, 74: 4804–4808. 10.1016/j.na.2011.04.052

    Article  MathSciNet  Google Scholar 

  10. Derafshpour M, Rezapour S, Shahzad N: Best proximity of cyclic φ -contractions in ordered metric spaces. Topol. Methods Nonlinear Anal. 2011, 37: 193–202.

    MathSciNet  Google Scholar 

  11. Sadiq Basha S: Best proximity points: global optimal approximate solutions. J. Glob. Optim. 2011, 49: 15–21. 10.1007/s10898-009-9521-0

    Article  MathSciNet  Google Scholar 

  12. Włodarczyk K, Plebaniak R, Obczyński C: Convergence theorems, best approximation and best proximity for set-valued dynamic systems of relatively quasi-asymptotic contractions in cone uniform spaces. Nonlinear Anal. 2010, 72: 794–805. 10.1016/j.na.2009.07.024

    Article  MathSciNet  Google Scholar 

  13. Abkar A, Gabeleh M: The existence of best proximity points for multivalued non-self-mappings. Rev. R. Acad. Cienc. Exactas Fís. Nat., Ser. A Mat. 2013, 107(2):319–325. 10.1007/s13398-012-0074-6

    Article  MathSciNet  Google Scholar 

  14. Berge C: Topological Spaces. Oliver & Boyd, Edinburg; 1963.

    MATH  Google Scholar 

  15. Czerwik S: Nonlinear set-valued contraction mappings in b -metric spaces. Atti Semin. Mat. Fis. Univ. Modena 1998, 46(2):263–276.

    MathSciNet  Google Scholar 

  16. Berinde V: Generalized contractions in quasimetric spaces. 3. Seminar on Fixed Point Theory 1993, 3–9. Cluj-Napoca

    Google Scholar 

  17. Boriceanu M, Petruşel A, Rus IA: Fixed point theorems for some multivalued generalized contractions in b -metric spaces. Int. J. Math. Stat. 2010, 6(S10):65–76.

    MathSciNet  Google Scholar 

  18. Boriceanu M, Bota M, Petruşel A: Multivalued fractals in b -metric spaces. Cent. Eur. J. Math. 2010, 8(2):367–377. 10.2478/s11533-010-0009-4

    Article  MathSciNet  Google Scholar 

  19. Bota M, Molnar A, Varga C: On Ekeland’s variational principle in b -metric spaces. Fixed Point Theory 2011, 12(1):21–28.

    MathSciNet  Google Scholar 

  20. Tataru D: Viscosity solutions of Hamilton-Jacobi equations with unbounded nonlinear terms. J. Math. Anal. Appl. 1992, 163: 345–392. 10.1016/0022-247X(92)90256-D

    Article  MathSciNet  Google Scholar 

  21. Kada O, Suzuki T, Takahashi W: Nonconvex minimization theorems and fixed point theorems in complete metric spaces. Math. Jpn. 1996, 44: 381–391.

    MathSciNet  Google Scholar 

  22. Suzuki T: Generalized distance and existence theorems in complete metric spaces. J. Math. Anal. Appl. 2011, 253: 440–458.

    Article  Google Scholar 

  23. Lin L-J, Du W-S: Ekeland’s variational principle, minimax theorems and existence of nonconvex equilibria in complete metric spaces. J. Math. Anal. Appl. 2006, 323: 360–370. 10.1016/j.jmaa.2005.10.005

    Article  MathSciNet  Google Scholar 

  24. Vályi I: A general maximality principle and a fixed point theorem in uniform spaces. Period. Math. Hung. 1985, 16: 127–134. 10.1007/BF01857592

    Article  Google Scholar 

  25. Plebaniak R: New generalized pseudodistance and coincidence point theorem in a b -metric space. Fixed Point Theory Appl. 2013. 10.1186/1687-1812-2013-270

    Google Scholar 

  26. Klein E, Thompson AC Canadian Mathematical Society Series of Monographs and Advanced Texts. In Theory of Correspondences: Including Applications to Mathematical Economics. Wiley, New York; 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Robert Plebaniak.

Additional information

Competing interests

The author declares that they have no competing interests.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and permissions

About this article

Cite this article

Plebaniak, R. On best proximity points for set-valued contractions of Nadler type with respect to b-generalized pseudodistances in b-metric spaces. Fixed Point Theory Appl 2014, 39 (2014). https://doi.org/10.1186/1687-1812-2014-39

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1186/1687-1812-2014-39

Keywords