1 Introduction

In recent years many authors established interesting results in fixed point theory in (ordered) metric spaces. One of the popular topics in the fixed point theory is the cyclic contraction. Kirk et al. [1] established the first result in this interesting area. Meantime, other authors obtained important results in this area (see [112]).

We begin with the definition of a cyclic map.

Definition 1.1 Let A and B be non-empty subsets of a metric space (X,d) and T:ABAB. Then T is called a cyclic map if T(A)B and T(B)A.

In 2003, Kirk et al. [1] gave the following interesting theorem in fixed point theory for a cyclic map.

Theorem 1.1 ([1])

Let A and B be nonempty closed subsets of a complete metric space (X,d). Suppose that T:ABAB is a cyclic map such that

d(Tx,Ty)kd(x,y)xA,yB.

If k[0,1), then T has a unique fixed point in AB.

Recently, several authors proved many results in fixed point theory for cyclic mappings, satisfying various (nonlinear) contractive conditions (see [112]). Some of contractive conditions are based on functions called control functions which alter the distance between two points in a metric space. Such functions were introduced by Khan et al. [13].

Definition 1.2 (altering distance function, [13])

The function ϕ:[0,+)[0,+) is called an altering distance function if the following properties are satisfied:

  1. (1)

    ϕ is continuous and nondecreasing;

  2. (2)

    ϕ(t)=0 if and only if t=0.

For some fixed point theorems based on an altering distance function, we refer the reader to [1420].

Let X be a nonempty set. Then (X,d,) is called an ordered metric space if and only if (X,d) is a metric space and (X,) is a partially ordered set. Two elements x,yX are called comparable if xy or yx.

Altun et al. [21, 22] introduced the notion of weakly increasing mappings and proved some existing theorems. For some works in the theory of weakly increasing mappings, we refer the reader to [23, 24].

Definition 1.3 ([21])

Let (X,) be a partially ordered set. Two mappings F,G:XX are said to be weakly increasing if FxGFx and GxFGx for all xX.

The purpose of this paper is to obtain common fixed point results for mappings satisfying nonlinear contractive conditions of a cyclic form based on the notion of an altering distance function.

2 Main result

We start with the following definition.

Definition 2.1 Let (X,d,) be an ordered metric space and A, B be nonempty closed subsets of X. Let f,T:XX be two mappings. The pair (f,T) is called a cyclic (ψ,A,B)-contraction if

  1. (1)

    ψ is an altering distance function;

  2. (2)

    AB has a cyclic representation w.r.t. the pair (f,T); that is, fAB, TBA and X=AB;

  3. (3)

    There exists 0<δ<1 such that for any comparable elements x,yX with xA and yB, we have

    (2.1)

Definition 2.2 Let (X,) be a partially ordered set and A, B be closed subsets of X with X=AB. Let f,T:XX be two mappings. The pair (f,T) is said to be (A,B)-weakly increasing if fxTfx for all xA and TxfTx for all xB.

From now on, by ψ we mean altering distance functions unless otherwise stated.

In the rest of this paper, ℕ stands for the set of nonnegative integer numbers.

Theorem 2.1 Let (X,d,) be an ordered complete metric space and A, B be nonempty closed subsets of X. Let f,T:XX be two mappings such that the pair (f,T) is (A,B)-weakly increasing. Assume the following:

  1. (1)

    The pair (f,T) is a cyclic (ψ,A,B)-contraction;

  2. (2)

    f or T is continuous.

Then f and T have a common fixed point.

Proof Choose x 0 A. Let x 1 =f x 0 . Since fAB, we have x 1 B. Also, let x 2 =T x 1 . Since TBA, we have x 2 A. Continuing this process, we can construct a sequence { x n } in X such x 2 n + 1 =f x 2 n , x 2 n + 2 =T x 2 n + 1 , x 2 n A and x 2 n + 1 B.

Since f and T are (A,B)-weakly increasing, we have

x 1 =f x 0 Tf x 0 =T x 1 = x 2 fT x 1 =f x 2 = x 3 .

We divide our proof into the following steps.

Step 1: We will show that { x n } is a Cauchy sequence in (X,d).

Subcase 1: Suppose that x 2 n = x 2 n + 1 for some nN. Since x 2 n and x 2 n + 1 are comparable elements in X with x 2 n A and x 2 n + 1 B, we have

ψ ( d ( x 2 n + 1 , x 2 n + 2 ) ) = ψ ( d ( f x 2 n , T x 2 n + 1 ) ) δ ψ ( max { d ( x 2 n , x 2 n + 1 ) , d ( x 2 n , f x 2 n ) , d ( x 2 n + 1 , T x 2 n + 1 ) , 1 2 ( d ( x 2 n , T x 2 n + 1 ) + d ( f x 2 n , x 2 n + 1 ) ) } ) = δ ψ ( max { d ( x 2 n , x 2 n + 1 ) , d ( x 2 n , x 2 n + 1 ) , d ( x 2 n + 1 , x 2 n + 2 ) , 1 2 ( d ( x 2 n , x 2 n + 2 ) + d ( x 2 n + 1 , x 2 n + 1 ) ) } ) δ ψ ( d ( x 2 n + 1 , x 2 n + 2 ) ) .

Since δ<1, we have ψ(d( x 2 n + 1 , x 2 n + 2 ))=0 and hence x 2 n + 2 = x 2 n + 1 . Similarly, we may show that x 2 n + 3 = x 2 n + 2 . Hence { x n } is a constant sequence in X, so it is a Cauchy sequence in (X,d).

Subcase 2: x 2 n x 2 n + 1 for all nN. Given nN. If n is even, then n=2t for some tN. Since x 2 t A, x 2 t + 1 B and x 2 t , x 2 t + 1 are comparable, we have

If

max { d ( x 2 t , x 2 t + 1 ) , d ( x 2 t + 1 , x 2 t + 2 ) } =d( x 2 t + 1 , x 2 t + 2 ),

then

ψ ( d ( x 2 t + 1 , x 2 t + 2 ) ) δψ ( d ( x 2 t + 1 , x 2 t + 2 ) ) <ψ ( d ( x 2 t + 1 , x 2 t + 2 ) ) ,

which is a contradiction. Thus

max { d ( x 2 t , x 2 t + 1 ) , d ( x 2 t + 1 , x 2 t + 2 ) } =d( x 2 t , x 2 t + 1 ),
(2.2)

therefore

ψ ( d ( x 2 t + 1 , x 2 t + 2 ) ) δψ ( d ( x 2 t , x 2 t + 1 ) ) .
(2.3)

If n is odd, then n=2t+1 for some tN. Since x 2 t + 2 and x 2 t + 1 are comparable with x 2 t + 2 A and x 2 t + 1 B, we have

If

max { d ( x 2 t + 2 , x 2 t + 1 ) , d ( x 2 t + 2 , x 2 t + 3 ) } =d( x 2 t + 2 , x 2 t + 3 ),

then

ψ ( d ( x 2 t + 3 , x 2 t + 2 ) ) δψ ( d ( x 2 t + 2 , x 2 t + 3 ) ) <ψ ( d ( x 2 t + 2 , x 2 t + 3 ) ) ,

which is a contradiction. Therefore

max { d ( x 2 t + 2 , x 2 t + 1 ) , d ( x 2 t + 2 , x 2 t + 3 ) } =d( x 2 t + 2 , x 2 t + 1 ),
(2.4)

and hence

ψ ( d ( x 2 t + 3 , x 2 t + 2 ) ) δψ ( d ( x 2 t + 2 , x 2 t + 1 ) ) .
(2.5)

From (2.3) and (2.5), we have

ψ ( d ( x n + 1 , x n + 2 ) ) δψ ( d ( x n , x n + 1 ) ) .
(2.6)

Since ψ is an altering distance function, we have {d( x n + 1 , x n + 2 ):nN{0}} is a bounded nonincreasing sequence. Thus there exists r0 such that

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

On letting n+ in (2.6), we have

ψ(r)δψ(r).

Since δ<1, we have ψ(r)=0 and hence r=0. Thus

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

Next, we show that { x n } is a Cauchy sequence in the metric space (X,d). It is sufficient to show that { x 2 n } is a Cauchy sequence in (X,d). Suppose to the contrary; that is, { x 2 n } is not a Cauchy sequence in (X,d). Then there exists ϵ>0 for which we can find two subsequences { x 2 m ( i ) } and { x 2 n ( i ) } of { x 2 n } such that n(i) is the smallest index for which

n(i)>m(i)>i,d( x 2 m ( i ) , x 2 n ( i ) )ϵ.
(2.8)

This means that

d( x 2 m ( i ) , x 2 n ( i ) 2 )<ϵ.
(2.9)

From (2.8), (2.9) and the triangular inequality, we get that

ϵ d ( x 2 m ( i ) , x 2 n ( i ) ) d ( x 2 m ( i ) , x 2 n ( i ) 2 ) + d ( x 2 n ( i ) 2 , x 2 n ( i ) 1 ) + d ( x 2 n ( i ) 1 , x 2 n ( i ) ) < ϵ + d ( x 2 n ( i ) 2 , x 2 n ( i ) 1 ) + d ( x 2 n ( i ) 1 , x 2 n ( i ) ) .

On letting i+ in the above inequalities and using (2.7), we have

lim i + d( x 2 m ( i ) , x 2 n ( i ) )=ϵ.
(2.10)

Again, from (2.8) and the triangular inequality, we get that

ϵ d ( x 2 m ( i ) , x 2 n ( i ) ) d ( x 2 n ( i ) , x 2 n ( i ) 1 ) + d ( x 2 n ( i ) 1 , x 2 m ( i ) ) d ( x 2 n ( i ) , x 2 n ( i ) 1 ) + d ( x 2 n ( i ) 1 , x 2 m ( i ) + 1 ) + d ( x 2 m ( i ) + 1 , x 2 m ( i ) ) d ( x 2 n ( i ) , x 2 n ( i ) 1 ) + d ( x 2 n ( i ) 1 , x 2 m ( i ) ) + 2 d ( x 2 m ( i ) + 1 , x 2 m ( i ) ) 2 d ( x 2 n ( i ) , x 2 n ( i ) 1 ) + d ( x 2 n ( i ) , x 2 m ( i ) ) + 2 d ( x 2 m ( i ) + 1 , x 2 m ( i ) ) .

Letting i+ in the above inequalities and using (2.7) and (2.10), we get that

lim i + d ( x 2 m ( i ) , x 2 n ( i ) ) = lim i + d ( x 2 m ( i ) + 1 , x 2 n ( i ) 1 ) = lim i + d ( x 2 m ( i ) + 1 , x 2 n ( i ) ) = lim i + d ( x 2 m ( i ) , x 2 n ( i ) 1 ) = ϵ .

Since x 2 m ( i ) and x 2 n ( i ) 1 are comparable with x 2 m ( i ) A and x 2 n ( i ) 1 B, we have

ψ ( d ( x 2 m ( i ) + 1 , x 2 n ( i ) ) ) = ψ ( d ( f x 2 m ( i ) , T x 2 n ( i ) 1 ) ) δ ψ ( max { d ( x 2 m ( i ) , x 2 n ( i ) 1 ) , d ( x 2 m ( i ) , f x 2 m ( i ) ) , d ( x 2 n ( i ) 1 , T x 2 n ( i ) 1 ) , 1 2 ( d ( x 2 m ( i ) , T x 2 n ( i ) 1 ) + d ( f x 2 m ( i ) , x 2 n ( i ) 1 ) ) } ) = δ ψ ( max { d ( x 2 m ( i ) , x 2 n ( i ) 1 ) , d ( x 2 m ( i ) , x 2 m ( i ) + 1 ) , d ( x 2 n ( i ) 1 , x 2 n ( i ) ) , 1 2 ( d ( x 2 m ( i ) , x 2 n ( i ) ) + d ( x 2 m ( i ) + 1 , x 2 n ( i ) 1 ) ) } ) .

Letting i+ and using the continuity of ψ, we get that

ψ(ϵ)δψ(ϵ).

Since δ<1, we have ψ(ϵ)=0 and hence ϵ=0, a contradiction. Thus { x n } is a Cauchy sequence in (X,d).

Step 2: Existence of a common fixed point.

Since (X,d) is complete and { x n } is a Cauchy sequence in X, we have { x n } converges to some uX, that is, lim n d( x n ,u)=0. Therefore

lim n + x n = lim n + x 2 n 1 = lim n + x 2 n =u.
(2.11)

Since x 2 n is a sequence in A, A is closed and x 2 n u, we have uA. Also, since x 2 n + 1 is a sequence in B, B is closed and x 2 n + 1 u, we have uB. Now, we show that u is a fixed point of f and T. Without loss of generality, we may assume that f is continuous, since x 2 n u, we get x 2 n + 1 =f x 2 n fu. By the uniqueness of limit, we have u=fu. Now, we show that u=Tu. Since uu with uA and uB, we have

ψ ( d ( u , T u ) ) = ψ ( d ( f u , T u ) ) δ ψ ( max { d ( f u , T u ) , d ( u , f u ) , d ( u , T u ) , 1 2 ( d ( u , T u ) + d ( f u , u ) ) } ) = δ ψ ( d ( u , T u ) ) .

Since δ<1, we get that d(u,Tu)=0 and hence u=Tu. □

Theorem 2.1 can be proved without assuming the continuity of f or the continuity of T. For this instance, we assume that X satisfies the following property:

  1. (P)

    If ( x n ) is a nondecreasing sequence in X with x n x, then x n x.

Now, we state and prove the following result.

Theorem 2.2 Let (X,d,) be an ordered complete metric space and A, B be nonempty closed subsets of X. Let f,T:XX be two mappings such that the pair (f,T) is (A,B)-weakly increasing. Assume the following:

  1. (1)

    The pair (f,T) is a cyclic (ψ,A,B)-contraction;

  2. (2)

    X satisfies property (P).

Then f and T have a common fixed point.

Proof We follow the proof of Theorem 2.1 step by step to construct a nondecreasing sequence ( x n ) in X with x 2 n A, x 2 n + 1 B and x 2 n u for some uX. Since x 2 n u, x 2 n + 1 u, A and B are closed subsets of X, we get uAB. Using property (P), we get x n u for all nN. Since x 2 n A and uB, we have

Letting n+ in the above inequality, we get ψ(d(u,Tu))δψ(d(u,Tu)). Since δ<1, we get d(u,Tu)=0, hence u=Tu. Similarly, we may show that u=fu. Thus u is a common fixed point of f and T. □

Taking ψ= I [ 0 , + ) (the identity function) in Theorem 2.1, we have the following result.

Corollary 2.1 Let (X,d,) be an ordered complete metric space and A, B be nonempty closed subsets of X. Let f,T:XX be two mappings such that the pair (f,T) is (A,B)-weakly increasing and AB has a cyclic representation with respect to the pair (f,T). Suppose that there exists 0<δ<1 such that for any two comparable elements x,yX with xA and yB, we have

d(fx,Ty)δmax { d ( x , y ) , d ( x , f x ) , d ( y , T y ) , 1 2 ( d ( x , T y ) + d ( f x , y ) ) } .

If f or T is continuous, then f and T have a common fixed point.

The continuity of f or T in Corollary 2.1 can be dropped.

Corollary 2.2 Let (X,d,) be an ordered complete metric space and A, B be nonempty closed subsets of X. Let f,T:XX be two mappings such that the pair (f,T) is (A,B)-weakly increasing and such that AB has a cyclic representation with respect to the pair (f,T). Suppose that there exists 0<δ<1 such that for any two comparable elements x,yX with xA and yB, we have

d(fx,Ty)δmax { d ( x , y ) , d ( x , f x ) , d ( y , T y ) , 1 2 ( d ( x , T y ) + d ( f x , y ) ) } .

If X satisfies property (P), then f and T have a common fixed point.

By taking f=T in Theorem 2.1, we have the following result.

Corollary 2.3 Let (X,d,) be an ordered complete metric space and A, B be nonempty closed subsets of X with X=AB. Let f:XX be a mapping such that fxf(fx) for all xX. Suppose that there exists 0<δ<1 such that for all xA and yB, we have

ψ ( d ( f x , f y ) ) δψ ( max { d ( x , y ) , d ( x , f x ) , d ( y , f y ) , 1 2 ( d ( x , f y ) + d ( f x , y ) ) } ) .

Assume the following:

  1. (1)

    f is a cyclic map;

  2. (2)

    f is continuous.

Then f has a fixed point.

The continuity of f in Corollary 2.3 can be dropped.

Corollary 2.4 Let (X,d,) be an ordered complete metric space and A, B be nonempty closed subsets of X with X=AB. Let f:XX be a mapping such that fxf(fx) for all xX. Suppose that there exists 0<δ<1 such that for all xA and yB, we have

ψ ( d ( f x , f y ) ) δψ ( max { d ( x , y ) , d ( x , f x ) , d ( y , f y ) , 1 2 ( d ( x , f y ) + d ( f x , y ) ) } ) .

Assume the following:

  1. (1)

    f is a cyclic map;

  2. (2)

    X satisfies property (P).

Then f has a fixed point.

Taking A=B=X in Theorem 2.1, we have the following result.

Corollary 2.5 Let (X,d,) be an ordered complete metric space. Let f,T:XX be two weakly increasing mappings. Suppose that there exists 0<δ<1 such that for any two comparable elements x,yX, we have

ψ ( d ( f x , T y ) ) δψ ( max { d ( x , y ) , d ( x , f x ) , d ( y , T y ) , 1 2 ( d ( x , T y ) + d ( f x , y ) ) } ) .

If f or T is continuous, then f and T have a common fixed point.

The continuity of f or T in Corollary 2.5 can be dropped.

Corollary 2.6 Let (X,d,) be an ordered complete metric space. Let f,T:XX be two weakly increasing mappings. suppose that there exists 0<δ<1 such that for any two comparable elements x,yX, we have

ψ ( d ( f x , T y ) ) δψ ( max { d ( x , y ) , d ( x , f x ) , d ( y , T y ) , 1 2 ( d ( x , T y ) + d ( f x , y ) ) } ) .

If X satisfies property (P), then f and T have a common fixed point.

To support the validity of our results, we introduce the following nontrivial example.

Example 2.1 On X={0,1,2,3,}, consider

d:X×XX,d(x,y)={ 0 if  x = y ; max { x , y } if  x y .

We introduce a relation on X by xy if and only if yx. Define f,T:XX by the formulae

fx={ 0 if  x = 0 ; x 1 if  x 1 ,

and

Tx={ 0 if  x = 0 , 1 , 2 ; x 3 if  x 3 .

Also, define ψ:[0,+)[0,+) by ψ(t)=t e t . Let A={0,2,4,6,} and B={0,1,3,5,}. Then

  1. (1)

    (X,d,) is a complete ordered metric space;

  2. (2)

    AB has a cyclic representation with respect to the pair (f,T);

  3. (3)

    The pair (f,T) is weakly (A,B)-increasing;

  4. (4)

    X satisfies property (P);

  5. (5)

    For every two comparable elements x,yX with xA and yB, we have

    ψ ( d ( f x , T y ) ) e 1 ψ ( max { d ( x , y ) , d ( x , f x ) , d ( y , T y ) , 1 2 ( d ( x , T y ) + d ( f x , y ) ) } ) .

Proof The proof of part (1) is clear. Since fA={0,1,3,5}B and TB={0,2,4,}A, we conclude that AB has a cyclic representation with respect to the pair (f,T). To prove part (3), given xA. If x{0,1,2,3,4}, then T(fx)=0. Thus Tfxfx and hence fxT(fx). If x5, then fx=x1 and T(fx)=T(x1)=x4. Thus T(fx)fx and hence fxT(fx). Therefore fxT(fx) for all xA. Similarly, we may show that Txf(Tx) for all xB. So, the pair (f,T) is weakly (A,B)-increasing. To prove part (4), let { x n } be a nondecreasing sequence such that x n xX. Then d( x n ,x)d(x,x)=0. So, x n =x for all n except for finitely many. Since ( x n ) is a nondecreasing with respect to ⪯, we have x 1 x 2 x 3  . Since x n =x for all but finitely many, then there exists kN such that x 1 x k 1 x n =x for all nk. So, x n x for all nN and hence x n x for all nN. Thus X satisfies property (P). To prove part (5), given two comparable elements x,yX with xA and yB. We divide the proof into the following cases:

  • Case one: x=0 and y{0,1,3}. Here, we have fx=Ty=0 and hence ψ(d(fx,Ty))=0. Thus

    ψ ( d ( f x , T y ) ) e 1 ψ ( max { d ( x , y ) , d ( x , f x ) , d ( y , T y ) , 1 2 ( d ( x , T y ) + d ( f x , y ) ) } ) .
  • Case two: x2 and y5. Here fx=x1 and Ty=y3. Since xA and yB, then x=2t and y=2n+1 for some t,nN.

If fx=Ty, then x1=y3 and hence 2t1=2n2. Thus 2t=2n1, which is impossible.

If x1>y3, then d(fx,Ty)=x1. Thus

ψ ( d ( f x , T y ) ) = ( x 1 ) e x 1 e 1 x e x = e 1 ψ ( x ) = e 1 ψ ( d ( x , f x ) ) e 1 ψ ( max { d ( x , y ) , d ( x , f x ) , d ( y , T y ) , 1 2 ( d ( x , T y ) + d ( f x , y ) ) } ) .

If y3>x1, then d(fx,Ty)=y3. Thus

ψ ( d ( f x , T y ) ) = ( y 3 ) e y 3 e 3 y e y e 1 y e y = e 1 ψ ( y ) = e 1 ψ ( d ( y , T y ) ) e 1 ψ ( max { d ( x , y ) , d ( x , f x ) , d ( y , T y ) , 1 2 ( d ( x , T y ) + d ( f x , y ) ) } ) .
  • Case three: x=0 and y5. Here fx=0 and Ty=y3. Thus

    ψ ( d ( f x , T y ) ) = ψ ( y 3 ) = ( y 3 ) e y 3 e 1 y e y = e 1 ψ ( y ) = e 1 ψ ( d ( y , T y ) ) e 1 ψ ( max { d ( x , y ) , d ( x , f x ) , d ( y , T y ) , 1 2 ( d ( x , T y ) + d ( f x , y ) ) } ) .
  • Case four: x2 and y{0,1,3}. Here fx=x1 and Ty=0.

    ψ ( d ( f x , T y ) ) = ψ ( d ( x 1 , 0 ) ) = ψ ( x 1 ) = ( x 1 ) e x 1 e 1 x e x = e 1 ψ ( x ) = e 1 ψ ( d ( x , f x ) ) e 1 ψ ( max { d ( x , y ) , d ( x , f x ) , d ( y , T y ) , 1 2 ( d ( x , T y ) + d ( f x , y ) ) } ) .

Note that f and T satisfy all the hypotheses of Theorem 2.1. Hence f and T have a fixed point. Here 0 is the fixed point of f and T. □

3 Applications

Denote by Λ the set of functions μ:[0,+)[0,+) satisfying the following hypotheses:

  1. (h1)

    μ is a Lebesgue-integrable mapping on each compact of [0,+);

  2. (h2)

    For every ϵ>0, we have

    0 ϵ μ(t)dt>0.

Theorem 3.1 Let (X,d,) be an ordered complete metric space and A, B be nonempty closed subsets of X. Let f,T:XX be two mappings such that the pair (f,T) is (A,B)-weakly increasing and AB has a cyclic representation w.r.t. the pair (f,T). Suppose that there exist δ[0,1) and μΛ such that for any two comparable elements x,yX with xA and yB, we have

0 d ( f x , T y ) μ(s)dsδ 0 max { d ( x , y ) , d ( x , f x ) , d ( y , T y ) , 1 2 ( d ( x , T y ) + d ( f x , y ) ) } μ(s)ds.

If f or T is continuous, then f and T have a common fixed point.

Proof Follows from Theorem 2.1 by defining ψ:[0,+)[0,+) via ψ(t)= 0 t μ(s)ds and noting that ψ is an altering distance function. □

The continuity of f or T in Theorem 3.1 can be dropped.

Theorem 3.2 Let (X,d,) be an ordered complete metric space and A, B be nonempty closed subsets of X. Let f,T:XX be two mappings such that (f,T) is (A,B)-weakly increasing and AB has a cyclic representation w.r.t. the pair (f,T). Suppose that there exist δ[0,1) and μΛ such that for any two comparable elements x,yX with xA and yB, we have

0 d ( f x , T y ) μ(s)dsδ 0 max { d ( x , y ) , d ( x , f x ) , d ( y , T y ) , 1 2 ( d ( x , T y ) + d ( f x , y ) ) } μ(s)ds.

If X satisfies property (P), then f and T have a common fixed point.

By taking A=B=X in Theorems 3.1 and 3.2, we have the following results.

Corollary 3.1 Let (X,d,) be an ordered complete metric space. Let f,T:XX be two weakly increasing mappings. Suppose that there exist δ[0,1) and μΛ such that for any two comparable elements x,yX, we have

0 d ( f x , T y ) μ(s)dsδ 0 max { d ( x , y ) , d ( x , f x ) , d ( y , T y ) , 1 2 ( d ( x , T y ) + d ( f x , y ) ) } μ(s)ds.

If f or T is continuous, then f and T have a common fixed point.

Corollary 3.2 Let (X,d,) be an ordered complete metric space. Let f,T:XX be two weakly increasing mappings. Suppose that there exist δ[0,1) and μΛ such that for any two comparable elements x,yX, we have

0 d ( f x , T y ) μ(s)dsδ 0 max { d ( x , y ) , d ( x , f x ) , d ( y , T y ) , 1 2 ( d ( x , T y ) + d ( f x , y ) ) } μ(s)ds.

If X satisfies property (P), then f and T have a common fixed point.