1 Introduction and preliminaries

Cyclic maps were introduced by Kirk, Srinavasan and Veeramani [1] in 2003 to extend the celebrated Banach contraction principle [2]: In a complete metric space (X,d), every contraction T:XX has a unique fixed point. In this principle, the mapping T is necessarily continuous. In the context of cyclic mapping, the authors [1] observed the analog of Banach contraction principle for discontinuous mapping. Cyclic maps and related fixed point theorems have been investigated densely by a number of authors who have been interested in nonlinear analysis.

Let A and B be nonempty subsets of a nonempty set S. A map T:ABAB is called a cyclic map if T(A)B and T(B)A. Let (X,d) be a metric space and T:ABAB be a cyclic map. We denote the distance of the nonempty subsets A and B of X by

dist(A,B)=inf { d ( x , y ) : x A , y B } .

A point xAB is said to be a best proximity point for T if d(x,Tx)=dist(A,B). A map T:ABAB is called a cyclic contraction if the following conditions hold:

  1. (i)

    T(A)B and T(B)A;

  2. (ii)

    There exists k(0,1) such that d(Tx,Ty)kd(x,y)+(1k)dist(A,B) for all xA,yB.

In the last decade, a number of generalizations in various directions on the existence and uniqueness of a best proximity point were investigated by several authors (see, e.g., [1, 313] and references therein). In particular, Eldred and Veeramani [3] obtained the following interesting best proximity point result.

Theorem 1.1 ([[3], Proposition 3.2])

Let A and B be nonempty closed subsets of a complete metric space X. Let T:ABAB be a cyclic contraction map, x 1 A and define x n + 1 =T x n , nN. Suppose that { x 2 n 1 } has a convergent subsequence in A. Then there exists xA such that d(x,Tx)=dist(A,B).

In 1976, Caristi [14] proved the following remarkable result that is one of the most valuable and applicable generalizations of the Banach contraction principle.

Theorem 1.2 (Caristi’s fixed point theorem [14])

Let (X,d) be a complete metric space and f:XR be a lower semicontinuous and bounded below function. Suppose that T is a Caristi-type map on X dominated by f; that is, T satisfies

d(x,Tx)f(x)f(Tx)for each xX.

Then T has a fixed point in X.

Caristi’s fixed point theorem has various applications in nonlinear sciences since it is an important diversity and equivalence of Ekeland’s variational principle [15, 16] and Takahashi’s nonconvex minimization theorem [17, 18]. Due to its application potential, Caristi’s fixed point theorem has been investigated, extended, generalized and improved in various ways by several authors; see, e.g., [1726] and references therein. Very recently, in [25], the first author established some new fixed point theorems for Caristi-type maps. Indeed, the author [25] considered some suitable generalized distances without assuming that the dominated functions possess the lower semicontinuity property. More precisely, he utilized the new versions of Caristi-type fixed point theorem to deal with the existence results for any map T satisfying

d(Tx,Ty)α ( d ( x , y ) ) d(x,y)for all x,yX,

where α:[0,)[0,1) is a function satisfying lim sup s t + α(s)<1 for all t[0,); for more detail, one can refer to [25].

In this note, we first introduce the concept of Caristi-type cyclic map and present a new convergence theorem to achieve a best proximity point theorem for Caristi-type cyclic maps. It should be mentioned that in this paper we remove the lower semicontinuity property of the dominated functions in Caristi-type cyclic maps. As interesting applications of our results, we show that some results in the literature, such as [3, 12] and others, are concluded from both the new convergence theorem and the best proximity point theorem. The results of this paper extend, improve and generalize some well-known results on the topic in the literature.

2 New results for Caristi-type cyclic maps

Throughout this paper, we denote by ℕ and ℝ the sets of positive integers and real numbers, respectively. Let (X,d) be a metric space. An extended real-valued function ϕ:X(,+] is said to be lower semicontinuous (l.s.c. for short) at wX if for any sequence { x n } in X with x n w as n, we have ϕ(w) lim inf n ϕ( x n ). The function ϕ is called to be l.s.c. on X if ϕ is l.s.c. at every point of X. The function ϕ is said to be proper if ϕ+.

In this paper, we first introduce the concept of Caristi-type cyclic map.

Definition 2.1 Let A and B be nonempty subsets of a metric space (X,d) and f:AB(,+] and φ:R(0,+) be functions. A self-map T:ABAB is called a Caristi-type cyclic map dominated by f and φ on AB if the following conditions are satisfied :

  1. (CC1)

    T(A)B and T(B)A,

  2. (CC2)

    d(x,Tx)dist(A,B)φ(f(x))(f(x)f(Tx)) for all xAB.

In particular, if condition (CC2) is replaced with the following condition:

(CC3) d(x,Tx)dist(A,B)f(x)f(Tx) for all xAB (that is, φ(t)=1 for all tR in (CC2)),

then T is called a Caristi-type cyclic map dominated by f on AB.

Example 2.1 Let X=(10,10) with the usual metric d(x,y)=|xy|. Then (X,d) is a metric space. Let A=[1,5] and B=[5,1] be nonempty subsets of (X,d). Clearly, dist(A,B)=2. Let f:ABR and φ:R(0,+) be defined by

f(x)= { 1 2 x 12 if  x [ 1 , 3 ) , 50 8 x if  x [ 3 , 5 ] , 1 4 x 12 if  x ( 3 , 1 ] , 48 15 x if  x [ 5 , 3 ] ,

and

φ(t)=10for all tR,

respectively. Let T:ABAB be defined by

Tx=xfor all xAB.

Then T(A)B and T(B)A (i.e., (CC1) holds). We claim that T is a Caristi-type cyclic map dominated by f and φ, but not a Caristi-type cyclic map dominated by f. We consider the following four possible cases.

Case 1. For x[1,3), we have

d ( x , T x ) dist ( A , B ) = 2 x 2 < 10 ( 1 4 x ) = φ ( f ( x ) ) ( f ( x ) f ( T x ) ) .

Case 2. For x[3,5], we have

d ( x , T x ) dist ( A , B ) = 2 x 2 < 10 ( 7 x + 2 ) = φ ( f ( x ) ) ( f ( x ) f ( T x ) ) .

Case 3. For x(3,1], we have

d ( x , T x ) dist ( A , B ) = 2 x 2 < 10 ( 1 4 x ) = φ ( f ( x ) ) ( f ( x ) f ( T x ) ) .

Case 4. For x[5,3], we have

d ( x , T x ) dist ( A , B ) = 2 x 2 < 10 ( 7 x 2 ) = φ ( f ( x ) ) ( f ( x ) f ( T x ) ) .

By Cases 1-4, we verify that

d(x,Tx)dist(A,B)φ ( f ( x ) ) ( f ( x ) f ( T x ) ) for all xAB,

that is, (CC2) holds. So, T is a Caristi-type cyclic map dominated by f and φ. Notice that

d(x,Tx)dist(A,B)=2x2> 1 4 x=f(x)f(Tx)for all x[2,3),

which means that (CC3) does not hold. Therefore T is not a Caristi-type cyclic map dominated by f.

The following convergence theorem is one of the main results of this paper.

Theorem 2.1 Let A and B be nonempty subsets of a metric space (X,d). Assume that φ:R(0,+) is a nondecreasing function and f:AB(,+] is a proper function which is bounded below. If T:ABAB is a Caristi-type cyclic map dominated by f and φ, then for any uAB with f(u)<+, the sequence { x n } n N in AB defined by x 1 =u and x n + 1 =T x n for nN satisfies the following conditions:

  1. (a)

    f( x n + 1 )f( x n )<+ for each nN,

  2. (b)

    d( x n , x n + 1 )dist(A,B)φ(f( x n ))(f( x n )f( x n + 1 )) for all nN,

  3. (c)

    lim n d( x n , x n + 1 )=dist(A,B).

Proof Let S={xAB:f(x)<+}. Since f is proper, S. Let uS. Define x 1 =u and x n + 1 =T x n = T n u for each nN. Clearly, we have f( x 1 )<+ for x 1 =u. Without loss of generality, we may assume x 1 A. By (CC1), we have x 2 n 1 A and x 2 n B for all nN. Clearly,

dist(A,B)d( x n , x n + 1 )for all nN.
(2.1)

From (CC2) we have

d ( x 1 , x 2 ) dist ( A , B ) = d ( x 1 , T x 1 ) dist ( A , B ) φ ( f ( x 1 ) ) ( f ( x 1 ) f ( T x 1 ) ) = φ ( f ( x 1 ) ) ( f ( x 1 ) f ( x 2 ) ) ,

which implies

f( x 2 )f( x 1 )<+.

Similarly, we have

d( x 2 , x 3 )dist(A,B)φ ( f ( x 2 ) ) ( f ( x 2 ) f ( x 3 ) )

and

f( x 3 )f( x 2 )f( x 1 )<+.

Hence, by induction, we can obtain the following inequalities:

d( x n , x n + 1 )dist(A,B)φ ( f ( x n ) ) ( f ( x n ) f ( x n + 1 ) )
(2.2)

and

f( x n + 1 )f( x n )<+for each nN.
(2.3)

Consequently, we have that (a) and (b) hold. Finally, let us prove (c). Since f is bounded below,

γ:= lim n f( x n )= inf n N f( x n ) exists.
(2.4)

Since φ is nondecreasing, by (2.3), we have

φ ( f ( x n ) ) φ ( f ( x 1 ) ) for all nN.
(2.5)

Taking into account (2.1), (2.2), (2.4) and (2.5), we get

dist(A,B)d( x n , x n + 1 )φ ( f ( x 1 ) ) ( f ( x n ) γ ) +dist(A,B).

Since lim n f( x n )=γ, the last inequality implies

lim n d( x n , x n + 1 )=dist(A,B).

So, we conclude that (c) holds. The proof is completed. □

Applying Theorem 2.1, we establish the following new best proximity point theorem for Caristi-type cyclic maps.

Theorem 2.2 Let A and B be nonempty subsets of a metric space (X,d). Suppose that φ:R(0,+) is a nondecreasing function and f:AB(,+] is a proper function that is bounded below. Let uA with f(u)<+ and T:ABAB be a Caristi-type cyclic map dominated by f and φ. Define a sequence { x n } n N in AB by x 1 =u and x n + 1 =T x n for nN. Suppose that one of the following conditions is satisfied:

  1. (H1)

    T is continuous on AB;

  2. (H2)

    d(Tx,Ty)d(x,y) for any xA and yB;

  3. (H3)

    The map g:X[0,) defined by g(x)=d(x,Tx) is l.s.c.

Then the following statements hold.

  1. (a)

    If { x 2 n 1 } has a convergent subsequence in A, then there exists vA such that d(v,Tv)=dist(A,B).

  2. (b)

    If { x 2 n } has a convergent subsequence in B, then there exists vB such that d(v,Tv)=dist(A,B).

Proof Applying Theorem 2.1, we have

lim n d( x n , x n + 1 )=dist(A,B).
(2.6)

Since x 1 =uA, we have x 2 n 1 A and x 2 n B for all nN. Let us prove the conclusion (a). Assume that { x 2 n 1 } has a convergent subsequence { x 2 n k 1 } in A. Hence there exists vA such that x 2 n k 1 v as k or

lim k d(v, x 2 n k 1 )=0.
(2.7)

Clearly, we have

dist(A,B)d(v, x 2 n k )d(v, x 2 n k 1 )+d( x 2 n k 1 , x 2 n k )for all kN.
(2.8)

Taking into account (2.6), (2.7) and (2.8), we get

lim n d(v, x 2 n k )=dist(A,B).
(2.9)

Now, we verify d(v,Tv)=dist(A,B). Suppose that (H1) holds. By the continuity of T, we derive

x 2 n k =T x 2 n k 1 Tvas k.
(2.10)

By (2.9) and (2.10), we get d(v,Tv)=dist(A,B).

If (H2) holds, since

dist(A,B)d(Tv, x 2 n k + 1 )d(v, x 2 n k )for all kN

and (2.9), we find that d(v,Tv)=dist(A,B).

Finally, assume that (H3) holds. By the lower semicontinuity of g, x 2 n k 1 v as k and (2.6), we obtain

dist ( A , B ) d ( v , T v ) = g ( v ) lim inf k g ( x 2 n k 1 ) = lim k d ( x 2 n k 1 , x 2 n k ) = dist ( A , B ) ,

which implies d(v,Tv)=dist(A,B).

Following a similar argument as in the proof of (a), one can also show the desired conclusion (b). □

Here, we give an example illustrating Theorem 2.2.

Example 2.2 Let X, A, B, f, φ and T be the same as in Example 2.1. Hence T is a Caristi-type cyclic map dominated by f and φ. Note that f is not lower semicontinuous at x=3 and −3, so f is not lower semicontinuous on AB. Since f(x)100 for all xAB, f is a bounded below function on AB. By the definition of T, we know that T is continuous on AB. Hence (H1) as in Theorem 2.2 holds. It is obvious that

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

On the other hand, let x 1 =1A and x n + 1 =T x n for nN. Then we have x 2 n 1 =1A and x 2 n =1B for all nN. So { x 2 n 1 } and { x 2 n } have convergent subsequences in A and B, respectively. Therefore, all the assumptions of Theorem 2.2 are satisfied. Applying Theorem 2.2, we also prove that there exist vA and wB (precisely speaking, v=1 and w=1) such that d(v,Tv)=d(w,Tw)=dist(A,B).

3 Some applications

A function α: [0,)[0,1) is said to be an MT-function (or ℛ-function) [12, 2530] if lim sup s t + α(s)<1 for all t[0,). It is obvious that if α: [0,)[0,1) is a nondecreasing function or a nonincreasing function, then α is an MT-function. So the set of MT-functions is a rich class.

Recently, Du [28] first proved the following characterizations of MT-functions which are quite useful for proving our main results.

Theorem D ([[28], Theorem 2.1])

Let α:[0,)[0,1) be a function. Then the following statements are equivalent.

  1. (a)

    α is an MT-function.

  2. (b)

    For each t[0,), there exist r t ( 1 ) [0,1) and ε t ( 1 ) >0 such that α(s) r t ( 1 ) for all s(t,t+ ε t ( 1 ) ).

  3. (c)

    For each t[0,), there exist r t ( 2 ) [0,1) and ε t ( 2 ) >0 such that α(s) r t ( 2 ) for all s[t,t+ ε t ( 2 ) ].

  4. (d)

    For each t[0,), there exist r t ( 3 ) [0,1) and ε t ( 3 ) >0 such that α(s) r t ( 3 ) for all s(t,t+ ε t ( 3 ) ].

  5. (e)

    For each t[0,), there exist r t ( 4 ) [0,1) and ε t ( 4 ) >0 such that α(s) r t ( 4 ) for all s[t,t+ ε t ( 4 ) ).

  6. (f)

    For any nonincreasing sequence { x n } n N in [0,), we have 0 sup n N α( x n )<1.

  7. (g)

    α is a function of contractive factor; that is, for any strictly decreasing sequence { x n } n N in [0,), we have 0 sup n N α( x n )<1.

Let us recall the concept of MT-cyclic contractions introduced first by Du and Lakzian [12].

Definition 3.1 [12]

Let A and B be nonempty subsets of a metric space (X,d). If a map T:ABAB satisfies

  1. (MT1)

    T(A)B and T(B)A;

  2. (MT2)

    there exists an MT-function α: [0,)[0,1) such that

    d(Tx,Ty)α ( d ( x , y ) ) d(x,y)+ ( 1 α ( d ( x , y ) ) ) dist(A,B)for any xA and yB,

then T is called an MT-cyclic contraction with respect to α on AB.

The following example shows that there exists an MT-cyclic contraction which is not a cyclic contraction.

Example 3.1 [12]

Let X={ v 1 , v 2 , v 3 ,} be a countable set and { τ n } be a strictly increasing convergent sequence of positive real numbers. Denote by τ := lim n τ n . Then τ 2 < τ . Let d:X×X[0,) be defined by d( v n , v n )=0 for all nN and d( v n , v m )=d( v m , v n )= τ m if m>n. Then d is a metric on X. Set A={ v 1 , v 3 , v 5 ,}, B={ v 2 , v 4 , v 6 ,}. Define a map T:ABAB by

T v n = def { v 2 if  n = 1 , v n 1 if  n > 1

for nN and define α:[0,)[0,1) by

α(t) = def { τ n 1 τ n if  t = τ n  for some  n N  with  n > 2 , 0 otherwise .

Then T is an MT-cyclic contraction with respect to α, but not a cyclic contraction on AB.

The following result tells us the relation between an MT-cyclic contraction and a Caristi-type cyclic map.

Theorem 3.1 Let A and B be nonempty subsets of a metric space (X,d) and T:ABAB be an MT-cyclic contraction with respect to α. Then there exist a bounded below function f:ABR and a nondecreasing function φ:R(0,+) such that T is a Caristi-type cyclic map dominated by f and φ.

Proof Denote T 0 =I (the identity mapping). Let xAB be given. Define a sequence { w n } n N in AB by w 1 =x and w n =T w n = T n 1 x for nN. Clearly, the condition (MT2) implies that T satisfies

d(Tx,Ty)d(x,y)for any xA and yB.

So from the last inequality we deduce

d( w n + 1 , w n + 2 )d( w n , w n + 1 )for all nN.

Hence the sequence {d( w n , w n + 1 )} is nonincreasing in [0,). Since α is an MT-function, by (g) of Theorem D, we obtain

0 sup n N α ( d ( w n , w n + 1 ) ) <1.

Since xAB is arbitrary, we can define a new function β:AB[0,1) by

β(x):= sup n N α ( d ( w n , w n + 1 ) ) = sup n N α ( d ( T n 1 x , T n x ) ) for xAB.

Clearly, for each xAB, we have

β(Tx)β(x)
(3.1)

and

α ( d ( T n 1 x , T n x ) ) β(x)for all nN.
(3.2)

Let xAB be given. Without loss of generality, we may assume xA. Then TxB. By (MT2), we get

d ( T x , T 2 x ) dist(A,B)α ( d ( x , T x ) ) ( d ( x , T x ) dist ( A , B ) )

and hence

d(x,Tx)α ( d ( x , T x ) ) ( d ( x , T x ) dist ( A , B ) ) d(x,Tx)d ( T x , T 2 x ) +dist(A,B).
(3.3)

By exploiting inequalities (3.1), (3.2) and (3.3), we obtain

d ( x , T x ) dist ( A , B ) 1 1 α ( d ( x , T x ) ) d ( x , T x ) 1 1 α ( d ( x , T x ) ) d ( T x , T 2 x ) 1 1 β ( x ) d ( x , T x ) 1 1 β ( T x ) d ( T x , T 2 x ) .

Let φ:R[0,+) and f:ABR be defined by

φ(t)=1for tR

and

f(x)= 1 1 β ( x ) d(x,Tx)for xAB,

respectively. Then φ is a nondecreasing function and f is a bounded below function. Clearly, f(x)<+ for all xAB. From (3.3), we obtain

d(x,Tx)dist(A,B)φ ( f ( x ) ) ( f ( x ) f ( T x ) ) for all xAB,

which means that T is a Caristi-type cyclic map dominated by f and φ. □

Theorem 3.2 [12]

Let A and B be nonempty subsets of a metric space (X,d) and T:ABAB be an MT-cyclic contraction with respect to α. Then there exists a sequence { x n } n N such that

lim n d( x n ,T x n )= inf n N d( x n ,T x n )=dist(A,B).

Proof Applying Theorem 3.1, there exist a bounded below function f:ABR and a nondecreasing function φ:R(0,+) such that T is a Caristi-type cyclic map dominated by f and φ. Let uAB be given. Let { x n } n N AB be defined by x 1 =u and x n + 1 =T x n for nN. Applying Theorem 2.1, we have

lim n d( x n , x n + 1 )=dist(A,B).
(3.4)

Since the condition (MT2) implies that T satisfies

d(Tx,Ty)d(x,y)for any xA and yB,

we know that the sequence {d( x n , x n + 1 )} is nonincreasing in [0,). By (3.4), we get

dist(A,B)= lim n d( x n , x n + 1 )= inf n N d( x n , x n + 1 )0.

The proof is completed. □

Theorem 3.3 [12]

Let A and B be nonempty subsets of a metric space (X,d) and T:ABAB be an MT-cyclic contraction with respect to α. For a given x 1 A, define an iterative sequence { x n } n N by x n + 1 =T x n for nN. Suppose that { x 2 n 1 } has a convergent subsequence in A, then there exists vA such that d(v,Tv)=dist(A,B).

Proof Applying Theorem 3.1, there exist a bounded below function f:ABR and a nondecreasing function φ:R(0,+) such that T is a Caristi-type cyclic map dominated by f and φ. Let u= x 1 A be given. Let { x n } n N AB be defined by x n + 1 =T x n for nN. Since the condition (MT2) implies the condition (H2) as in Theorem 2.2, all the assumptions of Theorem 2.2 are satisfied. By applying (a) of Theorem 2.2, there exists vA such that d(v,Tv)=dist(A,B). □

Remark 3.1 ([[3], Proposition 3.2])

(i.e., Theorem 1.1) is a special case of Theorem 3.3.

Finally, applying Theorem 2.1, we can establish a new Caristi-type fixed point theorem without assuming that the dominated functions possess the lower semicontinuity property.

Theorem 3.4 Let M be a nonempty subset of a metric space (X,d), f:M(,+] be a proper and bounded below function, φ:R(0,+) be a nondecreasing function and T:MM be a selfmap on X. Suppose that T is of Caristi type on M dominated by φ and f, that is,

d(x,Tx)φ ( f ( x ) ) ( f ( x ) f ( T x ) ) for each xM.
(3.5)

Then there exists a sequence { x n } n N in M such that { x n } n N is Cauchy.

Moreover, if (X,d) is complete and M is closed in X, and one of the following conditions is satisfied:

  1. (D1)

    T is continuous on M;

  2. (D2)

    T is closed, that is, GrT={(x,y)M×M:y=Tx}, the graph of T, is closed in M×M;

  3. (D3)

    T he map g:X[0,) defined by g(x)=d(x,Tx) is l.s.c.

Then the mapping T admits a fixed point in X, and for any uX with f(u)<+, the sequence { T n u } n N converges to a fixed point of T.

Proof Let A=B=M. Then we have AB=M, T(A)B, T(B)A and dist(A,B)=0. So (3.5) implies

d(x,Tx)dist(A,B)φ ( f ( x ) ) ( f ( x ) f ( T x ) ) for all xAB=M.

Hence T a Caristi-type cyclic map dominated by f and φ on AB. Since f is proper, there exists uM=AB such that f(u)<+. Let { x n } n N M be defined by x 1 =u and x n + 1 =T x n for nN. By applying Theorem 2.1, we have

  1. (a)

    f( x n + 1 )f( x n )<+ for each nN,

  2. (b)

    d( x n , x n + 1 )φ(f( x n ))(f( x n )f( x n + 1 )) for all nN,

  3. (c)

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

Since φ is nondecreasing, by (a), we have

φ ( f ( x n ) ) φ ( f ( x 1 ) ) for all nN.
(3.6)

Since f is bounded below and the sequence { f ( x n ) } n N is nonincreasing in [0,+),

γ:= lim n f( x n )= inf n N f( x n ) exists.
(3.7)

For m>n with m,nN, taking into account (3.5), (3.6) and (3.7), we get

d( x n , x m ) j = n m 1 d( x j , x j + 1 )φ ( f ( x 1 ) ) ( f ( x n ) γ ) .

Let λ n =φ(f( x 1 ))(f( x n )γ), nN. Then

sup { d ( x n , x m ) : m > n } λ n for each nN.
(3.8)

Since lim n f( x n )=γ, lim n λ n =0. From (3.8) we obtain

lim n sup { d ( x n , x m ) : m > n } =0,

which proves that { x n } n N is a Cauchy sequence in M.

Moreover, assume that (X,d) is complete and M is closed in X. So (M,d) is a complete metric space. By the completeness of M, there exists v u M such that x n v u as n. We claim v u F(T). If (D1) holds, since T is continuous on M, x n + 1 =T x n for each nN and x n v u as n, we get

v u = lim n x n = lim n x n + 1 = lim n T x n =T ( lim n x n ) =T v u ,

If (D2) holds, since T is closed, x n + 1 =T x n for each nN and x n v u as n, we have T v u = v u . Finally, assume that (D3) holds. Since lim n d( x n , x n + 1 )=0, we obtain

d ( v u , T v u ) = g ( v u ) lim inf n g ( x n ) = lim n d ( x n , x n + 1 ) = 0 ,

we obtain d( v u ,T v u )=0 and hence T v u = v u . This completes the proof. □