1 Introduction with preliminaries

The concept of a w-distance was initiated by Kada, Suzuki and Takahashi [1] and was primarily utilized to improve Caristi’s fixed point theorem [2], Ekeland’s variational principle [3] and nonconvex minimization theorems whose descriptions and details are available in Takahashi [4]. Proving existence results of fixed points on partially ordered metric spaces has been a relatively new development in metric fixed points theory. In [5], an analogue of Banach’s fixed point theorem in a partially ordered metric space has been proved besides discussing some applications to matrix equations. Ran and Reurings have further weakened the usual contraction condition but merely up to monotone operators.

Branciari [6] established a fixed point result for an integral-type inequality, which is a generalization of the Banach contraction principle. Vijayaraju et al. [7] obtained a general principle, which made it possible to prove many fixed point theorems for pairs of maps satisfying integral-type contraction conditions.

Several fixed point and common fixed point theorems in metric and semi-metric spaces for compatible, weakly compatible and owc mappings satisfying contractive conditions of integral type were proved in [79] and in other papers. Later on, Suzuki [10] proved that integral-type contractions are Meir-Keeler contractions. He also showed that Meir-Keeler contractions of integral type are still Meir-Keeler contractions. Jachymski [11] also proved that most contractive conditions of integral type given recently by many authors coincide with classical ones. But he gave a new contractive condition of integral type which is independent of classical ones. Recently Popa and Mocanu [9] obtained integral-type contractions via an altering distance function and proved general common fixed point results for integral-type contractive conditions.

In [12], Razani et al. proved a fixed point theorem for (ϕ,ψ,p)-contractive mappings on X [i.e., for each x,yX, ϕp(Tx,Ty)ψϕp(x,y)], which is a new version of the main theorem in [6], by considering the concept of a w-distance. In fact, he proved the following result.

Theorem [12]

Let p be a w-distance on a complete metric space (X,d), ϕ be nondecreasing, continuous and ϕ(ϵ)>0 for each ϵ>0 and ψ be nondecreasing, right continuous and ψ(t)<t for all t>0. Suppose T is a (ϕ,ψ,p)-contractive map on X, then T has a unique fixed point in X. Moreover, lim n T n x is a fixed point of T for each xX.

In [13] Lakzian and Lin obtained some generalizations of fixed point theorems by Kada et al. [1], Hicks and Rhoades [14] and several other results with respect to (ϕ,ψ,p)-contractive maps on a complete metric space.

In this paper, we use the concept of a w-distance to prove the fixed point theorems in partially ordered metric spaces. Our results do not only generalize some fixed point theorems, but also improve and simplify the previous results.

Before presenting our results, we collect relevant definitions and results which will be needed in our subsequent discussion.

Definition 1 Let X be a nonempty set. Then (X,d,) is called a partially ordered metric space if

  1. (i)

    (X,) is a partially ordered set and

  2. (ii)

    (X,d) is a metric space.

Definition 2 Let (X,) be a partially ordered set. Then

  1. (a)

    elements x,yX are called comparable with respect to ‘⪯’ if either xy or yx;

  2. (b)

    a mapping T:XX is called nondecreasing with respect to ‘⪯’ if xy implies TxTy.

Definition 3 [1]

Let (X,d) be a metric space. Then the function p:X×X[0,) is called a w-distance on X if the following conditions are satisfied:

  1. (a)

    p(x,z)p(x,y)+p(y,z) for any x,y,zX,

  2. (b)

    for any xX, p(x,):X[0,) is lower semi-continuous, i.e., if xX and y n y in X, then p(x,y) lim inf n p(x, y n ),

  3. (c)

    for any ϵ>0, there exists δ>0 such that p(x,z)δ and p(z,y)δ imply d(x,y)ϵ.

Example 1 [15]

Let (X,d) be a metric space and let g be a continuous mapping from X into itself. Then a function p:X×X[0,) defined by

p(x,y)=max { d ( g x , y ) , d ( g x , g y ) } for every x,yX

is a w-distance on X.

Clearly, every metric is a w-distance but not conversely. The following example substantiates this fact.

Example 2 Let (X,d) be a metric space. A function p:X×X[0,) defined by p(x,y)=k for every x,yX is a w-distance on X, where k is a positive real number. But p is not a metric since p(x,x)=k0 for any xX.

Example 3 Let X={1,2,3,4} be a metric space with a metric

d(x,y)=|xy|for all x,yX.

Let p:X×X[0,) be defined by

p ( 1 , 2 ) = p ( 2 , 1 ) = 3 , p ( 1 , 3 ) = p ( 3 , 1 ) = p ( 2 , 3 ) = p ( 3 , 2 ) = 1 , p ( 1 , 4 ) = p ( 4 , 1 ) = p ( 2 , 4 ) = p ( 4 , 2 ) = p ( 3 , 4 ) = p ( 4 , 3 ) = 2 ,

and p(x,x)=0.6 for every xX.

Clearly, conditions (b) and (c) from the definition of w-distance are satisfied (for every ϵ>0, put δ= 1 2 ), while condition (a) is not satisfied as

p(1,2)=3>1+1=p(1,3)+p(3,2).

Definition 4 Let T:XX be a function.

  1. (a)

    FT={xX|x=T(x)} (i.e., a set of fixed points of T).

  2. (b)

    The function T is called a Picard operator (briefly, PO) if there exists x X such that FT={ x } and { T n (x)} converges to x for all xX.

  3. (c)

    The function T is called orbitally U-continuous for any UX×X if the following condition is satisfied:

For any xX, T n i (x)aX as i and ( T n i (x),a)U for any iN imply that T n i + 1 (x)Ta as i.

Let (X,) be a partially ordered set. Let us denote by X the subset of X×X defined by

X = { ( x , y ) X × X | x y  or  y x } .

Definition 5 A map T:XX is said to be orbitally continuous if xX and T n i (x)aX as i implies that T n i + 1 (x)Ta as i.

Suppose

Φ = { ϕ | ϕ : [ 0 , ) [ 0 , )  is nondecreasing, continuous and  ϕ ( ϵ ) > 0  for each  ϵ > 0 } .

Moreover, let

Ψ = { ψ | ψ : [ 0 , ) [ 0 , )  is nondecreasing, right continuous and  ψ ( t ) < t  for all  t > 0 } .

Also, let

Γ = { γ | γ : [ 0 , ) [ 0 , )  is nondecreasing, continuous and  γ ( t ) = 0  iff  t = 0 } ( cf.  [16]) .

Example 4 Let { a n } n = 1 and { c n } n = 0 be two non-negative sequences such that { a n } is strictly decreasing and converging to zero, and (for each nN) c n 1 a n > a n + 1 , where 0< c n 1 <1. Define ψ:[0,)[0,) by ψ(0)=0, ψ(t)= c n t, if a n + 1 t< a n , ψ(t)= c 0 t if t a 1 , then ψ is in Ψ.

Now, we prove the following two lemmas.

Lemma 1 If ψΨ, then lim n ψ n (t)=0 for each t>0.

Proof Owing to the monotonicity of ψ, for each t>0, { ψ n (t)} is non-increasing and also non-negative. Thus, there exists α0 such that α + = lim n ψ n (t). Suppose on the contrary that α>0. As ψ is right continuous, therefore

0<α= lim n ψ n + 1 (t)=ψ(α),

which is a contradiction as ψ(t)<t. Thus α=0. □

Lemma 2 If ϕΦ(γΓ), { a n }[0,) and lim n ϕ( a n )=0 ( lim n γ( a n )=0), then lim n a n =0.

Proof If there exists ϵ>0 and { n k } k = 1 such that

a n k ϵ>0,

then

lim sup n ϕ( a n ) lim sup k ϕ( a n k )ϕ(ϵ)>0

yielding thereby lim n ϕ( a n )0. □

The following two lemmas are crucial in the proofs of our main results.

Lemma 3 [1, 17]

Let (X,d) be a metric space equipped with a w-distance p. Let { x n } and { y n } be sequences in X whereas { α n } and { β n } be sequences in [0,) converging to zero. Then the following conditions hold (for x,y,zX):

  1. (a)

    if p( x n ,y) α n and p( x n ,z) β n for nN, then y=z. In particular, if p(x,y)=0 and p(x,z)=0, then y=z;

  2. (b)

    if p( x n , y n ) α n and p( x n ,z) β n for nN, then lim n d( y n ,z)=0;

  3. (c)

    if p( x n , x m ) α n for n,mN with m>n, then { x n } is a Cauchy sequence;

  4. (d)

    if p(y, x n ) α n for nN, then { x n } is a Cauchy sequence.

Lemma 4 [1]

Let p be a w-distance on a metric space (X,d) and { x n } be a sequence in X such that for each ϵ>0, there exists N ϵ N such that m>n> N ϵ implies p( x n , x m )<ϵ (or lim m , n p( x n , x m )=0). Then { x n } is a Cauchy sequence.

2 (ϕ,ψ,p)-contractive maps

Now, we present our main result as follows.

Theorem 1 Let (X,d,) be a complete partially ordered metric space equipped with a w-distance p and S:XX be nondecreasing mapping. Suppose that

  1. (a)

    there exists x 0 X such that ( x 0 ,S x 0 ) X ,

  2. (b)

    there exist ψΨ and ϕΦ such that

    ϕ ( p ( S x , S y ) ) ψϕ ( p ( x , y ) )

for all (x,y) X ,

  1. (c)

    either S is orbitally continuous at x 0 or

(c′) S is orbitally X -continuous and there exists a subsequence { S n k x 0 } of { S n x 0 } converging to x such that ( S n k x 0 , x ) X for any kN.

Then FS. Moreover, if x=Sx, then p(x,x)=0.

Proof If x 0 =S x 0 for some x 0 X, then there is nothing to prove. Otherwise, let there be x 0 X such that x 0 S x 0 , and ( x 0 ,S x 0 ) X . Owing to the monotonicity of S, we can write (S x 0 , S 2 x 0 ) X . Continuing this process inductively, we obtain

( S n x 0 , S m x 0 ) X

for any n,mN. Now, we proceed to show that

lim n p ( S n x 0 , S n + 1 x 0 ) =0.
(1)

By using condition (b) and the properties of ϕ, ψ, we get

ϕ ( p ( S n x 0 , S n + 1 x 0 ) ) ψ ϕ ( p ( S n 1 x 0 , S n x 0 ) ) ψ 2 ϕ ( p ( S n 2 x 0 , S n 1 x 0 ) ) ψ n m ϕ ( p ( S m x 0 , S m + 1 x 0 ) ) ψ n ϕ ( p ( x 0 , S x 0 ) ) .
(2)

Now, using Lemma 1, lim n ϕ(p( S n x 0 , S n + 1 x 0 ))=0, which due to Lemma 2 gives rise to

lim n p ( S n x 0 , S n + 1 x 0 ) =0

so that (1) is established.

Similarly, we can show

lim n p ( S n + 1 x 0 , S n x 0 ) =0.
(3)

Next, we proceed to show

lim n , m p ( S n x 0 , S m x 0 ) =0.
(4)

Suppose (4) is untrue. Then we can find a δ>0 with sequences { m k } k = 1 , { n k } k = 1 such that

p ( S n k x 0 , S m k x 0 ) δ,for all k{1,2,3,},
(5)

wherein m k > n k . By (1) there exists k 0 N such that n k > k 0 implies

p ( S n k x 0 , S n k + 1 x 0 ) <δ.
(6)

Notice that in view of (5) and (6), m k n k + 1 . We can assume that m k is a minimum index such that (5) holds so that

p ( S n k x 0 , S r x 0 ) <δ,for r{ n k + 1 , n k + 2 ,, m k 1}.
(7)

Now (1), (5) and (7) imply

o < δ p ( S n k x 0 , S m k x 0 ) p ( S n k x 0 , S m k 1 x 0 ) + p ( S m k 1 x 0 , S m k x 0 ) < δ + p ( S m k 1 x 0 , S m k x 0 )

so that

lim k p ( S n k x 0 , S m k x 0 ) =δ.
(8)

If ϵ= lim sup k p( S n k + 1 x 0 , S m k + 1 x 0 )δ, then there exists { k r } r = 1 such that

lim r p ( S n k r + 1 x 0 , S m k r + 1 x 0 ) =ϵδ.

Since ϕ is continuous and nondecreasing and also ( S n k r x 0 , S m k r x 0 ) X , by using condition (b) and (8), one gets

ϕ(δ)ϕ(ϵ)= lim r ϕ ( p ( S n k r + 1 x 0 , S m k r + 1 x 0 ) ) ψϕ(δ).

Notice that

ϕp ( S n k r x 0 , S m k r x 0 ) ϕ ( δ ) +

and ψ is right continuous, therefore ϕ(δ)=0. This is indeed a contradiction and

lim sup k p ( S n k + 1 x 0 , S m k + 1 x 0 ) <δ,

so we have

δ p ( S n k x 0 , S m k x 0 ) p ( S n k x 0 , S n k + 1 x 0 ) + p ( S n k + 1 x 0 , S m k + 1 x 0 ) + p ( S m k + 1 x 0 , S m k x 0 ) lim k p ( S n k x 0 , S n k + 1 x 0 ) + lim sup k p ( S n k + 1 x 0 , S m k + 1 x 0 ) + lim k p ( S m k + 1 x 0 , S m k x 0 ) = lim sup k p ( S n k + 1 x 0 , S m k + 1 x 0 ) < δ ( on using (1) ) ,

which is a contradiction. Thus, (4) is proved.

Owing to Lemma 4, { S n x 0 } is a Cauchy sequence in X. Since X is a complete metric space, there exists x X such that S n x 0 x as n.

Now, we show that x is a fixed point of S. If (c) holds, then S n + 1 x 0 S x (as n). By the lower semi-continuity of p( S n x 0 ,), we have

p ( S n x 0 , x ) lim inf m p ( S n x 0 , S m x 0 ) = α n (say) , p ( S n x 0 , S x ) lim inf m p ( S n x 0 , S m + 1 x 0 ) = β n (say) .

By using (4), we have α n , β n 0 as n. Now, in view of Lemma 3, we conclude that

S x = x .

Next, suppose that (c′) holds. Since { S n k x 0 } converges to x , ( S n k x 0 , x ) X and S is X -continuous, it follows that { S n k + 1 x 0 } converges to S x . As earlier, by the lower semi-continuity of p( S n x 0 ,), we conclude that S x = x .

If Sx=x, we have

ϕp(x,x)=ϕp(Sx,Sx)ψϕ ( p ( x , x ) ) <ϕp(x,x).

This is a contradiction which amounts to say that ϕp(x,x)=0 so that p(x,x)=0. This completes the proof. □

The following example substantiates the fact that the condition of a partial ordering on the underlying metric space is necessary in Theorem 1.

Example 5 Consider X=[0,1] which is indeed a complete metric space under a usual metric d(x,y)=|xy| (for all x,yX) wherein by defining p(x,y)=3|xy|, we are in the receipt of a w-distance p on (X,d). We consider X as follows:

X = { ( x , y ) X × X : x = y  or  x , y { 0 } { 1 n : n = 1 , 2 , 3 , } } ,

where ‘⪯’ is the usual ordering.

Let S:XX be given by

S(x)= { 0 , if  x = 0 , 1 10 n 1 , if  x = 1 n , 1 2 , otherwise .

Obviously, S is a nondecreasing map. Also, there is x 0 =0 in X such that 0= x 0 S x 0 =0, i.e., ( x 0 ,S x 0 ) X , and S satisfies condition (c′). We now show that S satisfies (b) wherein ϕ,ψ:[0,)[0,) are defined as

ϕ(t)= t 1 2 andψ(t)= 1 2 t ( t [ 0 , ) ) .

Clearly, ϕΦ and ψΨ. If x=y, condition (b) is satisfied.

Let x=0 and y= 1 n , then

ϕ p ( S x , S y ) = ϕ ( 3 10 n 1 ) = ( 3 10 n 1 ) 1 2 1 2 ( 3 n ) 1 2 = 1 2 ϕ ( p ( x , y ) ) = ψ ϕ ( p ( x , y ) ) ,

as for any nN, ( n 10 n 1 ) 1 2 1 2 .

Next, let x= 1 n and y= 1 m with m>n. Then we have

ϕ p ( S x , S y ) = ϕ ( 30 ( m n ) ( 10 n 1 ) ( 10 m 1 ) ) = ( 30 ( m n ) ( 10 n 1 ) ( 10 m 1 ) ) 1 2 1 2 ( 3 ( m n ) m n ) 1 2 = 1 2 ϕ ( p ( x , y ) ) = ψ ϕ ( p ( x , y ) ) ,

as for any nN, ( 10 m n ( 10 n 1 ) ( 10 m 1 ) ) 1 2 1 2 . Hence condition (b) is satisfied.

Thus, all the conditions of Theorem 1 are satisfied implying thereby the existence of a fixed point of the map S, which are indeed two in number, namely: x=0, 1 2 .

Here, it can be pointed out that this example will not work in a metric space equipped with a w-distance without a partial ordering as condition (b) of Theorem 1 will not be satisfied. To substantiate this claim, choosing x= 2 and y=0 in condition (b), we get

which is a contradiction.

In Theorem 1, if S:XX is a continuous map, we deduce the following corollary.

Corollary 1 Let (X,d,) be a complete partially ordered metric space equipped with a w-distance p and S:XX be a continuous and nondecreasing mapping. Suppose that

  1. (a)

    there exists x 0 X such that ( x 0 ,S x 0 ) X ,

  2. (b)

    there exist ϕΦ and ψΨ such that

    ϕp(Sx,Sy)ψϕ ( p ( x , y ) )

for all (x,y) X .

Then FS. Moreover, if x=Sx, then p(x,x)=0.

In Theorem 1, setting ϕ=I, the identity mapping, we deduce the following corollary.

Corollary 2 Let (X,d,) be a complete partially ordered metric space equipped with a w-distance p and S:XX be a nondecreasing mapping. Suppose that

  1. (a)

    there exists x 0 X such that ( x 0 ,S x 0 ) X ,

  2. (b)

    there exists ϕΨ such that

    p(Sx,Sy)ψ ( p ( x , y ) )

for all (x,y) X ,

  1. (c)

    either S is orbitally continuous at x 0 or

(c′) S is orbitally X -continuous and there exists a subsequence { S n k x 0 } of { S n x 0 } which converges to x such that ( S n k x 0 , x ) X for any kN.

Then FS. Moreover, if x=Sx, then p(x,x)=0.

Choosing ϕ=I, the identity mapping and ψ(t)=αt (for all t[0,) and α[0,1)) in Theorem 1, we deduce the following corollary.

Corollary 3 Let (X,d,) be a complete partially ordered metric space equipped with a w-distance p and S:XX be a nondecreasing mapping. Suppose that

  1. (a)

    there exists x 0 X such that ( x 0 ,S x 0 ) X ,

  2. (b)

    if

    p(Sx,Sy)αp(x,y)

for all (x,y) X , where α[0,1) and

  1. (c)

    either S is orbitally continuous at x 0 or

(c′) S is orbitally X -continuous and there exists a subsequence { S n k x 0 } of { S n x 0 } which converges to x such that ( S n k x 0 , x ) X for any kN.

Then FS. Moreover, if x=Sx, then p(x,x)=0.

Suppose, ω: R + R + is a Lebesgue-integrable mapping which is summable and 0 ϵ ω(ξ)dξ>0 for each ϵ>0. Now, in the next corollary, set ϕ(t)= 0 t ω(ξ)dξ and ψ(t)=αt, where α[0,1) in Theorem 3. Clearly, ϕΦ and ψΨ. Hence, we can derive the following corollary as a special case.

Corollary 4 Let (X,d,) be a complete partially ordered metric space equipped with a w-distance p and S:XX be a nondecreasing mapping. Suppose that

  1. (a)

    there exists x 0 X such that ( x 0 ,S x 0 ) X ,

  2. (b)

    for all (x,y) X ,

    0 p ( S x , S y ) ω(ξ)dξα 0 p ( x , y ) ω(ξ)dξ,
  3. (c)

    either S is orbitally continuous at x 0 or

(c′) S is orbitally X -continuous and there exists a subsequence { S n k x 0 } of { S n x 0 } which converges to x such that ( S n k x 0 , x ) X for any kN.

Then FS. Moreover, if x=Sx, then p(x,x)=0.

The following simple example demonstrates Theorem 1.

Example 6 Consider X={(1,0),(0,1)}, which is a complete metric space with d(( x 1 , x 2 ),( y 1 , y 2 ))=| x 1 y 1 |+| x 2 y 2 |. Define g:XX by g(1,0)=(1,0) and g(0,1)=(1,0), which is a continuous map. Moreover, by defining

p ( ( x 1 , x 2 ) , ( y 1 , y 2 ) ) =max { d ( g ( x 1 , x 2 ) , ( y 1 , y 2 ) ) , d ( g ( x 1 , x 2 ) , g ( y 1 , y 2 ) ) } ,

p is a w-distance on (X,d). For (x,y) and (z,t) in X, define ‘⪯’ as follows: (x,y)(z,t)xz and yt (‘≤’ is the usual ordering) so that

X = { ( ( 1 , 0 ) , ( 1 , 0 ) ) , ( ( 0 , 1 ) , ( 0 , 1 ) ) } .

Let S:XX be given by

S(x,y)= { ( 1 , 0 ) , if  ( x , y ) = ( 1 , 0 ) , ( 1 , 0 ) , if  ( x , y ) = ( 0 , 1 ) .

Clearly, S is a nondecreasing and continuous map. Also, (1,0)S(1,0)=(1,0), i.e., ((1,0),S(1,0)) X .

We now show that S satisfies (b) with ϕ,ψ:[0,)[0,) which are defined as

ϕ(t)=2tandψ(t)= 1 2 t ( t [ 0 , ) ) .

Clearly, ϕΦ and ψΨ. Let ((1,0),(1,0)) in X

p ( S ( 1 , 0 ) , S ( 1 , 0 ) ) =p ( ( 1 , 0 ) , ( 1 , 0 ) ) =max { d ( g ( 1 , 0 ) , ( 1 , 0 ) ) , d ( g ( 1 , 0 ) , g ( 1 , 0 ) ) } =0,

and for ((0,1),(0,1)) X , we have

p ( S ( 0 , 1 ) , S ( 0 , 1 ) ) =p ( ( 1 , 0 ) , ( 1 , 0 ) ) =0

and

p ( ( 0 , 1 ) , ( 0 , 1 ) ) =max { d ( g ( 0 , 1 ) , ( 0 , 1 ) ) , d ( g ( 0 , 1 ) , g ( 0 , 1 ) ) } =2.

Therefore, for every (( x 1 , x 2 ),( y 1 , y 2 )) X , we have

ϕp ( S ( x 1 , x 2 ) , S ( y 1 , y 2 ) ) ψϕ ( p ( ( x 1 , x 2 ) , ( y 1 , y 2 ) ) ) .

Thus, all the conditions of Theorem 1 are satisfied implying thereby the existence of a fixed point of S which is indeed (x,y)=(1,0).

Theorem 2 Let (X,d,) be a complete partially ordered metric space equipped with a w-distance p and S:XX be a nondecreasing mapping. Suppose that

  1. (a)

    there exists x 0 X such that ( x 0 ,S x 0 ) X ,

  2. (b)

    there exist ψΨ and ϕΦ such that

    ϕ ( p ( S x , S y ) ) ψϕ ( p ( x , y ) )

for all (x,y) X , and

(c″) for every yX with ySy,

inf { p ( x , y ) + p ( x , S x ) : x X } >0.

Then FS. Moreover, if x=Sx, then p(x,x)=0.

Proof Observe that the sequence { S n x 0 } is a Cauchy sequence (in view of the proof of Theorem 1), and so there exists a point x in X such that lim n S n x 0 = x . Since lim m , n d( S n x 0 , S m x 0 )=0, therefore for each ϵ>0, there exists N ϵ N such that n> N ϵ implies p( S N ϵ x 0 , S n x 0 )<ϵ. Since lim n S n x 0 = x and p(x,) is lower semi-continuous, therefore

p ( S N ϵ x 0 , x ) lim inf n p ( S N ϵ x 0 , S n x 0 ) ϵ.

Therefore, p( S N ϵ , x )ϵ. Set ϵ= 1 k , N ϵ = n k so that

lim k p ( S n k x 0 , x ) =0.

Now, assume that x S x . Then due to hypothesis (c″), we have

0<inf { p ( x , x ) + p ( x , S x ) : x X } inf { p ( S n k x 0 , x ) + p ( S n k x 0 , S n k + 1 x 0 ) : n N } 0

as n. This is a contradiction. Hence x =S x .

If Sx=x, we have

ϕp(x,x)=ϕ ( p ( S x , S x ) ) ψϕ ( p ( x , x ) ) <ϕp(x,x),

which is a contradiction implying thereby ϕp(x,x)=0 so that p(x,x)=0. This completes the proof. □

Corollary 5 Replacing condition (c″) by hypothesis (c) or (c′) of Corollary  2 (also of Corollary  3 or Corollary  4) the fixed point of S continues to exist.

In what follows, we give a sufficient condition for the uniqueness of a fixed point in Theorem 1 which runs as follows:

  1. (A)

    for every x,yX, there exists a lower bound or an upper bound.

    In [18], it is proved that condition (A) is equivalent to the following one:

  2. (B)

    for every x,yX, there exists z=c(x,y)X for which (x,z) X and (y,z) X .

Theorem 3 With the addition of condition (B) to the hypotheses of Theorem  1 (or Theorem  2), the fixed point of S turns out to be unique. Moreover,

lim n S n (x)= x

for every xX provided x F S , i.e., the map S:XX is a Picard operator.

Proof Following the proof of Theorem 1, FS. Suppose there exist two fixed points x and y of S in X. We prove that

p ( y , x ) =0.
(9)

We distinguish two cases.

Case 1: If ( y , x ) X . Suppose that p( y , x )>0, then by using condition (b) and the property of ψ, we get

ϕp ( y , x ) =ϕp ( S y , S x ) ψϕ ( p ( y , x ) ) <ϕp ( y , x ) ,

which is a contradiction. Therefore we have (9).

Also, in view of Theorem 1, we have

p ( y , y ) =0.
(10)

On using (9), (10) and Lemma 3, we have y = x , i.e., the fixed point of S is unique.

Case 2: If ( x , y ) X , then owing to condition (B), there exists zX such that ( x ,z) X and ( y ,z) X . As (z, x ) X and ( y ,z) X , proceeding along the lines of the proof of Theorem 1, we can prove

lim n p ( S n z , x ) =0and lim n p ( S n z , y ) =0.

By using Lemma 3, we infer that y = x , i.e., the fixed point of S is unique. Now, we prove

lim n S n (x)= x

for every xX provided x F S .

Let xX and ( x 0 ,x) X . Proceeding along the lines of the proof of Theorem 1, we can prove lim n p( S n x 0 , S n x)=0, and owing to x F S and p is a w-distance (lower semi-continuous), then lim n p( S n x 0 , x )=0, by Lemma 3, we get

lim n S n x= x .

Suppose xX and ( x 0 ,x) X . Owing to condition (B), there exists some z in X such that ( x 0 ,z) X and (x,z) X .

Since ( x 0 ,z) X and (x,z) X , by using condition (b) (proceeding along the lines of the proof of Theorem 1), we can prove lim n p( S n x 0 , S n z)=0 and lim n p( S n z, S n x)=0.

By the triangular inequality, we can write

p ( S n x 0 , S n x ) p ( S n x 0 , S n z ) +p ( S n z , S n x ) .

Letting n, we get lim n p( S n x 0 , S n x)=0, and also p is a w-distance (lower semi-continuous), we have lim n p( S n x 0 , x )=0, which due to Lemma 3 implies

lim n S n x= x .

This completes the proof. □

The following example demonstrates Theorem 3.

Example 7 Let X={0}{ 1 2 n :n1}, which (X,d,) is a complete partially ordered metric space with the usual metric d and the usual order ‘⪯’. Clearly, condition (B) holds in X. We define p:X×X[0,) by p(x,y)=y. Let ϕ and ψ be the mappings with ϕ,ψ:[0,)[0,) defined by

ϕ(t)= { 2 , if  t > 1 , 2 t , if  t [ 0 , 1 ]

and ψ(t)= 1 2 t. Obviously, ϕΦ and ψΨ. Assume that S:XX by Sx= x 8 for any xX. It is easy to see that S is nondecreasing. Also, there is x 0 =0 in X such that ( x 0 ,S x 0 ) X , and S satisfies (c′). Also, for any nN, we have 1 2 n S( 1 2 n ). So, for arbitrary nN, we have

inf { p ( 1 2 m , 1 2 n ) + p ( 1 2 m , 1 2 m + 1 ) : m N } = 1 2 n >0.

Now, we show that S satisfies (b).

ϕ p ( S x , S y ) = ϕ ( 1 8 y ) = 2 ( y 8 ) = y 4 ( since  y < 1 , y X ) y = ψ ( 2 y ) = ψ ( ϕ ( y ) ) = ψ ( ϕ ( p ( x , y ) ) .

Thus, all the conditions of Theorem 3 are satisfied and x=0 is the unique fixed point for S. Moreover, lim n S n (x)= lim n x 8 n =0.

Corollary 6 With the addition of condition (B) to the hypotheses of Corollary  1 (or Corollaries 2, 3, 4, 5) the fixed point of S turns out to be unique. Moreover,

lim n S n (x)= x

for every xX provided x F S , i.e., the map S:XX is a Picard operator.

Our next example highlights the role of condition (c″) in Theorem 2.

Example 8 Consider X=[0,1], which is a complete metric space with the usual metric d(x,y)=|xy| for all x,yX. Moreover, by defining p(x,y)=2|xy|, p is a w-distance on (X,d). We consider X as follows:

X = { ( x , y ) X × X : x = y  or  x , y { 1 2 n : n = 1 , 2 , 3 , } } ,

where ⪯ is the usual ordering.

Let S:XX be given by

S(x)= { 1 2 n + 1 , if  x = 1 2 n , 1 2 , otherwise .

Obviously, S is a nondecreasing map. Also, there is x 0 = 1 2 in X such that ( x 0 ,S x 0 ) X .

We now show that S satisfies (b) with ϕ,ψ:[0,)[0,) which are defined as

ϕ(t)= { 1 , if  t > 1 , t 1 3 , if  t [ 0 , 1 ] , andψ(t)= 1 2 1 3 t ( t [ 0 , ) ) .

Clearly, ϕΦ and ψΨ. If x=y, condition (b) is satisfied.

Now, let x= 1 2 n and y= 1 2 m (m>n). Then we have

ϕ p ( S x , S y ) = ϕ ( 2 ( 2 m 2 n ) 2 m + n + 1 ) = ϕ ( 1 2 n 2 m 2 n ) = ( 1 2 n 2 m 2 n ) 1 3 = ψ ϕ ( p ( x , y ) )

so that condition (b) is satisfied.

Since 0S0, we have

inf { p ( 1 2 n , 0 ) + p ( 1 2 n , 1 2 n + 1 ) : n N } =inf { 2 2 n + 2 2 n + 1 : n N } =0.

Thus, all the conditions of Theorem 2 are satisfied except (c″).

Clearly, S has got no fixed point in X.

3 (γ,ψ,p)-contractive maps

In this section we state some results in a partial ordered metric space with (γ,ψ,p)-contractive maps. In Section 2 we considered the condition nondecreasing for the function S, but in this section we will prove some theorems by replacing the condition nondecreasing to monotonicity for the function.

Theorem 4 Let (X,d,) be a complete partially ordered metric space equipped with a w-distance p and S:XX be a monotone mapping. Suppose that

  1. (a)

    there exists x 0 X such that ( x 0 ,S x 0 ) X ,

  2. (b)

    there exist ψΨ and γΓ such that

    γ ( p ( S x , S 2 x ) ) ψγ ( p ( x , S x ) )

for all (x,Sx) X ,

  1. (c)

    either S is orbitally continuous at x 0 or

(c′) S is orbitally X -continuous and there exists a subsequence { S n k x 0 } of { S n x 0 } converging to x such that ( S n k x 0 , x ) X for any kN.

Then FS. Moreover, if x=Sx, then p(x,x)=0.

Proof If x 0 =S x 0 for some x 0 X, then there is nothing to prove. Otherwise, let there be x 0 X such that x 0 S x 0 , and ( x 0 ,S x 0 ) X . Owing to monotonicity of S, we can write (S x 0 , S 2 x 0 ) X . Continuing this process inductively, we obtain

( S n x 0 , S n + 1 x 0 ) X

for any n,mN. Now, we proceed to show that

lim n p ( S n x 0 , S n + 1 x 0 ) =0.
(11)

On using condition (b) and the properties of γ, ψ, we get

γ ( p ( S n x 0 , S n + 1 x 0 ) ) ψ γ ( p ( S n 1 x 0 , S n x 0 ) ) ψ 2 γ ( p ( S n 2 x 0 , S n 1 x 0 ) ) ψ n m γ ( p ( S m x 0 , S m + 1 x 0 ) ) ψ n γ ( p ( x 0 , S x 0 ) ) .
(12)

By using Lemma 1, we have lim n γp( S n x 0 , S n + 1 x 0 )=0 so that by Lemma 2, we have

lim n p ( S n x 0 , S n + 1 x 0 ) =0,

which establishes (11).

Similarly, we can show

lim n p ( S n + 1 x 0 , S n x 0 ) =0.
(13)

Now, we proceed to show that { S n x 0 } is a Cauchy sequence. By the triangle inequality, the continuity of γ and (11), we have

γp ( S n x 0 , S n + 2 x 0 ) γ ( p ( S n x 0 , S n + 1 x 0 ) + p ( S n + 1 x 0 , S n + 2 x 0 ) ) 0

as n so that lim n γp( S n x 0 , S n + 2 x 0 )=0, which amounts to say that

lim n p ( S n x 0 , S n + 2 x 0 ) =0.

By induction, for any k>0, we have

lim n p ( S n x 0 , S n + k x 0 ) =0.

So, by Lemma 3, { S n x 0 } is a Cauchy sequence and due to the completeness of X, there exists x X such that lim n S n x 0 = x .

If (c) or (c′) holds, then proceeding along the lines of the proof of Theorem 1, we can show that

S x = x .

If Sx=x, we have

γp(x,x)=γ ( p ( S x , S 2 x ) ) ψγ ( p ( x , S x ) ) <γp(x,x),

which is a contradiction so that γp(x,x)=0, implying thereby p(x,x)=0. This completes the proof. □

Theorem 5 Let (X,d,) be a complete partially ordered metric space equipped with a w-distance p and S:XX be a monotone mapping. Suppose that

  1. (a)

    there exists x 0 X such that ( x 0 ,S x 0 ) X ,

  2. (b)

    there exist ψΨ and γΓ such that

    γ ( p ( S x , S 2 x ) ) ψγ ( p ( x , S x ) )

for all (x,Sx) X , and

(c″) for every yX with ySy,

inf { p ( x , y ) + p ( x , S x ) : x X } >0.

Then FS. Moreover, if x=Sx, then p(x,x)=0.

Proof Proceeding along the lines of the proof of Theorem 4, the sequence { S n x 0 } is a Cauchy sequence, and so there exists a point x in X such that lim n S n x 0 = x . Since lim m , n d( S n x 0 , S m x 0 )=0, therefore for each ϵ>0, there exists N ϵ N such that n> N ϵ implies p( S N ϵ x 0 , S n x 0 )<ϵ. As lim n S n x 0 = x and p(x,) is lower semi-continuous, therefore

p ( S N ϵ x 0 , x ) lim inf n p ( S N ϵ x 0 , S n x 0 ) ϵ.

Therefore p( S N ϵ x 0 , x )ϵ. Setting ϵ= 1 k , N ϵ = n k , we have

lim k p ( S n k x 0 , x ) =0.

Now, assume that x S x . Then by hypothesis (c″), we have

0<inf { p ( x , x ) + p ( x , S x ) : x X } inf { p ( S n x 0 , x ) + p ( S n x 0 , S n + 1 x 0 ) : n N } 0

as n. This is a contradiction so that x =S x .

If Sx=x, we have

γp(x,x)=γ ( p ( S x , S 2 x ) ) ψγ ( p ( x , S x ) ) <γp(x,x),

which is a contradiction so that γp(x,x)=0, yielding thereby p(x,x)=0. This completes the proof. □

Our next example demonstrates Theorem 5 which exhibits the utility of this theorem over Theorems 1 and 2.

Example 9 Consider X=[0,1], which is a complete metric space with the usual metric d(x,y)=|xy| for all x,yX. Moreover, by defining p(x,y)=y, p is a w-distance on (X,d). We consider X as follows:

X = { ( x , y ) X × X : x = y  or  x , y { 0 } { 1 n : n = 1 , 2 , 3 , } } ,

where ⪯ is the usual ordering.

Let S:XX be given by

S(x)= { 1 n + 1 , if  x = 1 n , 0 , if  x = 0 , 1 , otherwise .

Obviously, S is a monotone map. Also, there is x 0 =0 in X such that 0= x 0 S x 0 =0, i.e., ( x 0 ,S x 0 ) X .

We now show that S satisfies (b) with ψ,γ:[0,)[0,) which are respectively defined as ψ(t)= 1 3 t and

γ(t)= { t 1 t , if  t > 0 , 0 , if  t = 0 .

Clearly, ψΨ and γΓ. If x=0 as (0,S0) X , it is easy to show that condition (b) is satisfied.

Suppose x= 1 n as ( 1 n ,S( 1 n )) X , one gets

γ p ( S x , S 2 x ) = γ ( 1 n + 2 ) = ( 1 n + 2 ) 1 1 n + 2 1 3 ( 1 n + 1 ) 1 1 n + 1 = 1 3 γ ( p ( 1 n , S ( 1 n ) ) ) = ψ γ ( p ( x , S x ) )

as for any nN, we have ( n + 1 n + 2 ) n + 1 1 n + 2 1 3 . Hence condition (b) is satisfied.

If y>0, we have ySy so that

inf { p ( x , y ) + p ( x , S x ) : x X } =inf{y+Sx:xX}>0.

Thus, all the conditions of Theorem 5 are satisfied and x=0 is a fixed point of S.

But if x=y0, 1 n is chosen, then γp(Sx,Sy)=1 and ψγ(p(x,y))= 1 3 y 1 y so that γp(Sx,Sy)>ψγ(p(x,y)). Hence, condition (b) of Theorems 1 and 2 does not hold.

Theorem 6 Let (X,d,) be a complete partially ordered metric space equipped with a w-distance p and S:XX be a monotone mapping. Suppose that

  1. (a)

    there exists x 0 X such that ( x 0 ,S x 0 ) X ,

(b1) there exist γΓ and k[0, 1 2 ) such that

γ ( p ( S x , S y ) ) k { γ p ( x , S x ) + γ p ( y , S y ) }

for all (x,y) X ,

(c″) for every yX with ySy,

inf { p ( x , y ) + p ( x , S x ) : x X } >0.

Then FS. Moreover, if x=Sx, then p(x,x)=0.

Proof For xX, set y=Sx and α= k 1 k . Then we have (x,Sx) X and α[0,1). On using condition (b1), we get

γ ( p ( S x , S 2 x ) ) k { γ p ( x , S x ) + γ p ( S x , S 2 x ) } ,

or

γ ( p ( S x , S 2 x ) ) αγp(x,Sx).

Therefore, by choosing ψ(t)=αt, all the conditions of Theorem 5 are satisfied ensuring the conclusions of the theorem. □

The set of all subadditive functions γ in Γ is denoted by Γ .

Theorem 7 Let (X,d,) be a complete partially ordered metric space equipped with a w-distance p and S:XX be a monotone mapping. Suppose that

  1. (a)

    there exists x 0 X such that ( x 0 ,S x 0 ) X ,

(b2) there exist γ Γ and k[0, 1 2 ) such that

γ ( p ( S x , S 2 x ) ) kγ ( p ( x , S 2 x ) )

for all (x,Sx) X , and

inf { p ( x , y ) + p ( x , S x ) : x X } >0

for every yX with ySy. Then FS. Moreover, if x=Sx, then p(x,x)=0.

Proof Set α= k 1 k , then α[0,1). On using condition (b2) (as γ Γ ), we have

γ ( p ( S x , S 2 x ) ) k γ ( p ( x , S 2 x ) ) k γ ( p ( x , S x ) + p ( S x , S 2 x ) ) k γ p ( x , S x ) + k γ p ( S x , S 2 x ) .

Thus, γ(p(Sx, S 2 x))αγ(p(x,Sx)).

Therefore, by choosing ψ(t)=αt, all the conditions of Theorem 5 are satisfied ensuring the conclusions of the theorem. □

Our final example demonstrates Theorem 4.

Example 10 Consider X={(1,0,0),(0,1,0),(0,0,1)}, which is a complete metric space with d(( x 1 , x 2 , x 3 ),( y 1 , y 2 , y 3 ))=| x 1 y 1 |+| x 2 y 2 |+| x 3 y 3 |. Define g:XX by g(1,0,0)=(1,0,0) and g(0,1,0)=(0,0,1), and g(0,0,1)=(0,0,1), which is a continuous map. Moreover, by defining

p ( ( x 1 , x 2 , x 3 ) , ( y 1 , y 2 , y 3 ) ) =max { d ( g ( x 1 , x 2 , x 3 ) , ( y 1 , y 2 , y 3 ) ) , d ( g ( x 1 , x 2 , x 3 ) , g ( y 1 , y 2 , y 3 ) ) } ,

p is a w-distance on (X,d). For (x,y) and (z,t) in X, define ‘⪯’ as follows: ( x 1 , x 2 , x 3 )( y 1 , y 2 , y 3 ) x 1 y 1 and x 2 y 2 and x 3 y 3 , where ‘≤’ is the usual ordering and

X = { ( ( 1 , 0 , 0 ) , ( 1 , 0 , 0 ) ) , ( ( 0 , 1 , 0 ) , ( 0 , 1 , 0 ) ) , ( ( 0 , 0 , 1 ) , ( 0 , 0 , 1 ) ) } .

Define S:XX as

S(x,y)= { ( 1 , 0 , 0 ) , if  ( x , y ) = ( 1 , 0 , 0 ) , ( 1 , 0 , 0 ) , if  ( x , y ) = ( 0 , 1 , 0 ) , ( 0 , 0 , 1 ) , if  ( x , y ) = ( 0 , 0 , 1 ) .

Clearly, S is a monotone and continuous map. Also, (1,0,0)S(1,0,0)=(1,0,0), i.e., ((1,0,0),S(1,0,0)) X .

We now show that S satisfies (b) with γ,ψ:[0,)[0,) which are defined as

γ(t)= t 2 andψ(t)= 1 4 t ( t [ 0 , ) ) .

Notice that γΓ and ψΨ. If ((1,0,0),(1,0,0)) in X , then

p ( S ( 1 , 0 , 0 ) , S 2 ( 1 , 0 , 0 ) ) = p ( ( 1 , 0 , 0 ) , ( 1 , 0 , 0 ) ) = max { d ( g ( 1 , 0 , 0 ) , ( 1 , 0 , 0 ) ) , d ( g ( 1 , 0 , 0 ) , g ( 1 , 0 , 0 ) ) } = 0 ,

and for ((0,0,1),(0,0,1)) X , we have

p ( S ( 0 , 0 , 1 ) , S 2 ( 0 , 0 , 1 ) ) = p ( ( 0 , 0 , 1 ) , ( 0 , 0 , 1 ) ) = max { d ( g ( 0 , 0 , 1 ) , ( 0 , 0 , 1 ) ) , d ( g ( 0 , 0 , 1 ) , g ( 0 , 0 , 1 ) ) } = 0 .

Therefore, for every (( x 1 , x 2 , x 3 ),S( x 1 , x 2 , x 3 )) X , we have

γp ( S ( x 1 , x 2 , x 3 ) , S 2 ( x 1 , x 2 , x 3 ) ) ψγ ( p ( ( x 1 , x 2 , x 3 ) , S ( x 1 , x 2 , x 3 ) ) ) .

Thus, all the conditions of Theorem 4 are satisfied implying thereby the existence of fixed points of the map S which are indeed (1,0,0) and (0,0,1).