1 Introduction

Fixed point theory is one of the outstanding subfields of nonlinear functional analysis. It has been used in the research areas of mathematics and nonlinear sciences (see, e.g., [18]). In 1922 Banach [10] proved that in a complete metric space every contraction has a unique fixed point. In the proof of this theorem, he not only showed the existence and uniqueness of a fixed point, but also provided a method (generally, iterative) for constructing the fixed point. This property of the Banach theorem differentiates it from other fixed point theorems. Therefore, the Banach fixed point theorem has attracted great attention of authors since then (see, e.g., [1148]). On the other hand, the fixed point technique suggested by Banach attracted many researchers to solve various concrete problems.

2 Main results

In an attempt to generalize the Banach contraction principle, many researchers extended the following result in certain directions.

Theorem 1 (See, e.g., [9, 37, 38])

Let (X,d) be a complete metric space and f:XX be a mapping. Assume that there exists a function β:[0,)[0,1] such that, for any bounded sequence { t n } of positive reals, β( t n )1 implies t n 0 and

d(fx,fy)β ( d ( x , y ) ) d(x,y)

for all x,yX. Then f has a unique fixed point.

Definition 2 (See, e.g., [40]) Let f:XX and α:X×X R + . We say that f is an α-admissible mapping if

α(x,y)1impliesα(fx,fy)1,x,yX.

Example 3 (cf. [40]) Let X=R. Define f:XX and α:X×X[0,) by

fx= { ln | x | if  x 0 , 3 otherwise andα(x,y)= { 3 if  x y , 0 otherwise .

Then f is α-admissible.

Our first result is the following.

Theorem 4 Let (X,d) be a complete metric space and f:XX be an α-admissible mapping. Assume that there exists a function β:[0,)[0,1] such that, for any bounded sequence { t n } of positive reals, β( t n )1 implies t n 0 and

( d ( f x , f y ) + ) α ( x , f x ) α ( y , f y ) β ( d ( x , y ) ) d(x,y)+
(2.1)

for all x,yX where 1. Suppose that either

  1. (a)

    f is continuous, or

  2. (b)

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

If there exists x 0 X such that α( x 0 ,f x 0 )1, then f has a fixed point.

Proof Let x 0 X such that α( x 0 ,f x 0 )1. Define a sequence { x n } in X by x n = f n x 0 =f x n 1 for all nN. If x n + 1 = x n for some nN, then x= x n is a fixed point for f and the result is proved. Hence, we suppose that x n + 1 x n for all nN. Since f is an α-admissible mapping and α( x 0 ,f x 0 )1, we deduce that α( x 1 , x 2 )=α(f x 0 , f 2 x 0 )1. By continuing this process, we get α( x n ,f x n )1 for all nN{0}. By the inequality (2.1), we have

d ( f x n 1 , f x n ) + ( d ( f x n 1 , f x n ) + ) α ( x n 1 , f x n 1 ) α ( x n , f x n ) β ( d ( x n 1 , x n ) ) d ( x n 1 , x n ) + ,

then

d( x n , x n + 1 )β ( d ( x n 1 , x n ) ) d( x n 1 , x n ),
(2.2)

which implies d( x n , x n + 1 )d( x n 1 , x n ). It follows that the sequence {d( x n , x n + 1 )} is decreasing. Thus, there exists d R + such that lim n d( x n , x n + 1 )=d. We will prove that d=0. From (2.2) we have

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

which implies lim n β(d( x n 1 , x n ))=1. Using the property of the function β, we conclude that

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

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

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

By the triangle inequality, we derive that

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

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

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

Again, by the triangle inequality, we find that

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+, together with (2.3) and (2.4), we deduce that

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

From (2.1), (2.4) and (2.5) we have

d ( x n ( k ) + 1 , x m ( k ) + 1 ) + ( d ( x n ( k ) + 1 , x m ( k ) + 1 ) + ) α ( x n ( k ) , f x n ( k ) ) α ( x m ( k ) , f x m ( k ) ) = ( d ( f x n ( k ) , f x m ( k ) ) + ) α ( x n ( k ) , f x n ( k ) ) α ( x m ( k ) , f x m ( k ) ) β ( d ( x n ( k ) , x m ( k ) ) ) d ( x n ( k ) , x m ( k ) ) + .

Hence,

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

Letting k in the above inequality, we get

lim n β ( d ( x n ( k ) , x m ( k ) ) ) =1.

That is, lim k d( x n ( k ) , x m ( k ) )=0<ε, which is a contradiction. Hence { x n } is a Cauchy sequence. Since X is complete, then there is zX such that x n z. First, we suppose that f is continuous. Since f is continuous, then we have

fz= lim n f x n = lim n x n + 1 =z.

So, z is a fixed point of f. Next, we suppose that (b) holds. Then α(z,fz)1. Now, by (2.1) we have

d ( f z , x n + 1 ) + ( d ( f z , f x n ) + ) α ( z , f z ) α ( x n , f x n ) β ( d ( z , x n ) ) d ( z , x n ) + .

That is, d(fz, x n + 1 )β(d(z, x n ))d(z, x n ), and so we get

d(fz,z)d(fz, x n + 1 )+d(z, x n + 1 )β ( d ( z , x n ) ) d(z, x n )+d(z, x n + 1 ).

Letting n in the above inequality, we get d(fz,z)=0, that is, z=fz. □

Example 5 Let X=[0,) be endowed with the usual metric d(x,y)=|xy| for all x,yX and f:XX be defined by

fx={ x x + 1 if  x [ 0 , 1 ] , 2 x if  x ( 1 , ) .

Define also α:X×X[0,+) and β:[0,)[0,1] by

α(x,y)={ 1 if  x , y [ 0 , 1 ] , 0 otherwise andβ(t)= 1 1 + t .

We prove that Theorem 4 can be applied to f, but Theorem 1 cannot be applied to f.

Clearly, (X,d) is a complete metric space. We show that f is an α-admissible mapping. Let x,yX, if α(x,y)1, then x,y[0,1]. On the other hand, for all x[0,1], we have fx1. It follows that α(fx,fy)1. Thus the assertion holds. In reason of the above arguments, α(0,f0)1.

Now, if { x n } is a sequence in X such that α( x n , x n + 1 )1 for all nN{0} and x n x as n+, then { x n }[0,1] and hence x[0,1]. This implies that α(x,fx)1.

Let x,y[0,1] and yx. We get

( d ( f x , f y ) + ) α ( x , f x ) α ( y , f y ) = f y f x + = y y + 1 x x + 1 + = y x ( 1 + x ) ( 1 + y ) + y x 1 + y x + = β ( d ( x , y ) ) d ( x , y ) + .

Otherwise, α(x,fx)α(y,fy)=0 and so

( d ( f x , f y ) + ) α ( x , f x ) α ( y , f y ) =1β ( d ( x , y ) ) d(x,y)+,

then the condition of Theorem 4 holds. Hence, f has a fixed point. Let x=2 and y=3. Then

d(f2,f3)=2> 1 2 = 1 1 + | 2 3 | |23|=β ( d ( 2 , 3 ) ) d(2,3),

that is, the contractive condition of Theorem 1 does not hold for this example.

Theorem 6 Let (X,d) be a complete metric space and f:XX be an α-admissible mapping. Assume that there exists a function β:[0,)[0,1] such that, for any bounded sequence { t n } of positive reals, β( t n )1 implies t n 0 and

( α ( x , f x ) α ( y , f y ) + 1 ) d ( f x , f y ) 2 β ( d ( x , y ) ) d ( x , y )
(2.6)

for all x,yX. Suppose that either

  1. (a)

    f is continuous, or

  2. (b)

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

If there exists x 0 X such that α( x 0 ,f x 0 )1, then f has a fixed point.

Proof Let x 0 X such that α( x 0 ,f x 0 )1. Define a sequence { x n } in X by x n = f n x 0 =f x n 1 for all nN. If x n + 1 = x n for some nN, then x= x n is a fixed point for f and the result is proved. Hence, we suppose that x n + 1 x n for all nN. As in Theorem 4, we conclude that α( x n ,f x n )1 for all nN{0}. Due to (2.6) we have

2 d ( f x n 1 , f x n ) ( α ( x n 1 , f x n 1 ) α ( x n , f x n ) + 1 ) d ( f x n 1 , f x n ) 2 β ( d ( x n 1 , x n ) ) d ( x n 1 , x n ) ,

which yields that

d( x n , x n + 1 )β ( d ( x n 1 , x n ) ) d( x n 1 , x n ).
(2.7)

So, we conclude that d( x n , x n + 1 )d( x n 1 , x n ). It follows that the sequence d n :=d( x n , x n + 1 ) is decreasing. Thus, there exists d R + such that d n d as n. We claim that d=0. Suppose, to the contrary, that d>0. Considering (2.7), we obtain

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

which implies lim n β(d( x n 1 , x n ))=1. Hence, d= lim n d n = lim n d( x n 1 , x n )=0, which is a contradiction. Hence, we derive that

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

We prove that { x n } is a Cauchy sequence. Suppose, to the contrary, that { x n } is not a Cauchy sequence. Then there is ε>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 ) )εandd( x n ( k ) , x m ( k ) 1 )<ε.

Following the related lines in the proof of Theorem 4, we get

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

and

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

Now, from (2.6), (2.8) and (2.9), we have

2 d ( x n ( k ) + 1 , x m ( k ) + 1 ) ( α ( x n ( k ) , f x n ( k ) ) α ( x m ( k ) , f x m ( k ) ) + 1 ) d ( x n ( k ) + 1 , x m ( k ) + 1 ) = ( α ( x n ( k ) , f x n ( k ) ) α ( x m ( k ) , f x m ( k ) ) + 1 ) d ( f x n ( k ) , f x m ( k ) ) 2 β ( d ( x n ( k ) , x m ( k ) ) ) d ( x n ( k ) , x m ( k ) ) .

Hence,

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

By taking limit as k, we get

lim n β ( d ( x n ( k ) , x m ( k ) ) ) =1.

That is, lim k d( x n ( k ) , x m ( k ) )=0<ε, which is a contradiction. Hence { x n } is a Cauchy sequence. Since X is complete, then there is zX such that x n z. First of all, we suppose that f is continuous. We obtain that

fz= lim n f x n = lim n x n + 1 =z

due to the continuity of f. Thus, we derived that z is a fixed point of f.

Next, we suppose that (b) holds. Then, α(z,fz)1. Now, by (2.6) we have

2 d ( f z , x n + 1 ) ( α ( z , f z ) α ( x n , f x n ) + 1 ) d ( f z , f x n ) 2 β ( d ( z , x n ) ) d ( z , x n ) .

That is, d(fz, x n + 1 )β(d(z, x n ))d(z, x n ), and so we get

d(fz,z)d(fz, x n + 1 )+d(z, x n + 1 )β ( d ( z , x n ) ) d(z, x n )+d(z, x n + 1 ).

By taking the limit as n, we get d(fz,z)=0, i.e., z=fz. □

Example 7 Let X=[0,) be endowed with the usual metric d(x,y)=|xy| for all x,yX and f:XX be defined by

fx={ 1 8 x 2 if  x [ 0 , 1 ] , ln x if  x ( 1 , ) .

Define also α:X×X[0,+) and β:[0,)[0,1] by

α(x,y)={ 1 if  x , y [ 0 , 1 ] , 0 otherwise andβ(t)= 1 4 .

We prove that Theorem 6 can be applied to f, but Theorem 1 cannot be applied to f.

By a similar method to that in the proof of Example 5, we can show that f is an α-admissible mapping and α( x n ,f x n )1, x n x as n+ implies that α(x,fx)1. Clearly, α(0,f0)1.

Let x,y[0,1]. Then

( α ( x , f x ) α ( y , f y ) + 1 ) d ( f x , f y ) = 2 | f x f y | = 2 1 8 | x y | | x + y | 2 1 4 | x y | = 2 β ( d ( x , y ) ) d ( x , y ) .

Otherwise, α(x,fx)α(y,fy)=0, and so

( α ( x , f x ) α ( y , f y ) + 1 ) d ( f x , f y ) ( α ( x , f x ) α ( y , f y ) + 1 ) d ( f x , f y ) = 1 d ( f x , f y ) = 2 0 2 β ( d ( x , y ) ) d ( x , y ) ,

then the contractive condition of Theorem 6 holds and f has a fixed point. Let x=2 and y=4; then

d(f2,f4)=ln2> 1 2 = 1 4 |24|=β ( d ( 2 , 4 ) ) d(2,4).

That is, the contractive condition of Theorem 1 does not hold for this example.

Theorem 8 Let (X,d) be a complete metric space and f:XX be an α-admissible mapping. Assume that there exists a function β:[0,)[0,1] such that, for any bounded sequence { t n } of positive reals, β( t n )1 implies t n 0 and

α(x,fx)α(y,fy)d(fx,fy)β ( d ( x , y ) ) d(x,y)
(2.10)

for all x,yX. Suppose that either

  1. (a)

    f is continuous, or

  2. (b)

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

If there exists x 0 X such that α( x 0 ,f x 0 )1, then f has a fixed point.

Proof Let x 0 X such that α( x 0 ,f x 0 )1. Define a sequence { x n } in X by x n = f n x 0 =f x n 1 for all nN. If x n + 1 = x n for some nN, then x= x n is a fixed point for f and the result is proved. Hence, we suppose that x n + 1 x n for all nN. As in Theorem 4, we conclude that α( x n ,f x n )1 for all nN{0}. Now, by (2.10) we have

α( x n 1 ,f x n 1 )α( x n ,f x n )d(f x n 1 ,f x n )β ( d ( x n 1 , x n ) ) d( x n 1 , x n ),

then

d( x n , x n + 1 )β ( d ( x n 1 , x n ) ) d( x n 1 , x n ).
(2.11)

It yields that d( x n , x n + 1 )d( x n 1 , x n ). It follows that the sequence {d( x n , x n + 1 )} is decreasing. Consequently, there exists d R + such that d( x n , x n + 1 )d as n. Regarding (2.11), we observe that

d ( x n , x n + 1 ) d ( x n 1 , x n ) β ( d ( x n 1 , x n ) ) 1.

Thus, we find that lim n β(d( x n 1 , x n ))=1 by the property of the function β. Hence,

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

Next, we will show that the sequence { x n } is Cauchy. Suppose, to the contrary, that { x n } is not a Cauchy sequence. Then there is ε>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 ) )εandd( x n ( k ) , x m ( k ) 1 )<ε.

Again, by following the lines of the proof of Theorem 4, we derive that

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

and

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

Combining (2.10), (2.12) and (2.13), we have

d ( x n ( k ) + 1 , x m ( k ) + 1 ) α ( x n ( k ) , f x n ( k ) ) α ( x m ( k ) , f x m ( k ) ) d ( x n ( k ) + 1 , x m ( k ) + 1 ) = α ( x n ( k ) , f x n ( k ) ) α ( x m ( k ) , f x m ( k ) ) d ( f x n ( k ) , f x m ( k ) ) β ( d ( x n ( k ) , x m ( k ) ) ) d ( x n ( k ) , x m ( k ) ) .

Hence,

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

By taking limit as k, we get

lim n β ( d ( x n ( k ) , x m ( k ) ) ) =1.

That is, lim k d( x n ( k ) , x m ( k ) )=0. Hence { x n } is a Cauchy sequence. Since X is complete, then there is zX such that x n z.

First, suppose that f is continuous. Since f is continuous, then we have

fz= lim n f x n = lim n x n + 1 =z.

So, z is a fixed point of f.

We suppose that (b) holds. Then α(z,fz)1. Now, by (2.10) we have

d ( f z , x n + 1 ) α ( z , f z ) α ( x n , f x n ) d ( f z , f x n ) β ( d ( z , x n ) ) d ( z , x n ) .

That is, d(fz, x n + 1 )β(d(z, x n ))d(z, x n ), and so we get

d(fz,z)d(fz, x n + 1 )+d(z, x n + 1 )β ( d ( z , x n ) ) d(z, x n )+d(z, x n + 1 ).

Letting n in the above inequality, we get d(fz,z)=0, i.e., z=fz. □

Example 9 Let X=[0,) be endowed with the usual metric d(x,y)=|xy| for all x,yX and f:XX be defined by

fx={ 1 4 ( 1 x 2 ) if  x [ 0 , 1 ] , 3 x if  x ( 1 , ) .

Define also α:X×X[0,+) and β:[0,)[0,1] by

α(x,y)={ 1 if  x , y [ 0 , 1 ] , 0 otherwise andβ(t)= 1 2 .

We prove that Theorem 8 can be applied to f (here, a fixed point is u= 5 2), but Theorem 1 cannot be applied to f.

By a similar method to that in the proof of Example 5, we can show that f is an α-admissible mapping and α( x n ,f x n )1, x n x as n+ implies that α(x,fx)1. Clearly, α(0,f0)1.

Let x,y[0,1]. Then

α(x,fx)α(y,fy)d(fx,fy)=|fxfy|= 1 4 |xy||x+y| 1 2 |xy|=β ( d ( x , y ) ) d(x,y).

Otherwise, α(x,fx)α(y,fy)=0, and so

α(x,fx)α(y,fy)d(fx,fy)=0β ( d ( x , y ) ) d(x,y),

then the conditions of Theorem 8 hold and f has a fixed point. Let x=3 and y=4; then

d(f3,f4)=3> 1 2 = 1 2 |34|=β ( d ( 3 , 4 ) ) d(3,4).

That is, the contractive condition of Theorem 1 does not hold for this example.

Theorem 10 Assume that all the hypotheses of Theorems 4, 6 and 8 hold. Adding the following condition:

  1. (c)

    if x=fx then α(x,fx)1,

we obtain the uniqueness of the fixed point of f.

Proof Suppose that z and z are two fixed points of f such that z z . Then α(z,fz)1 and α( z ,f z )1.

For Theorem 4 we have

d ( f z , f z ) + ( d ( f z , f z ) + ) α ( z , f z ) α ( z , f z ) β ( d ( z , z ) ) d ( z , z ) +.

For Theorem 6 we have

( 2 ) d ( f z , f z ) ( α ( z , f z ) α ( z , f z ) + 1 ) d ( f z , f z ) ( 2 ) β ( d ( z , z ) ) d ( z , z ) .

For Theorem 8 we have

d ( f z , f z ) α(z,fz)α ( z , f z ) d ( f z , f z ) β ( d ( z , z ) ) d ( z , z ) .

Hence, all the three inequalities separately imply that β(d(z, z ))=1. Thus d(z, z )=0, i.e., z= z as required. □

Remark 11 By utilizing the technique of Samet et al. [40], we can obtain corresponding coupled fixed point results from our Theorems 4, 6 and 8.