Skip to main content

Common fixed point results for mappings under nonlinear contraction of cyclic form in ordered metric spaces

Abstract

In this paper, we introduce the notion of a cyclic (ψ,A,B)-contraction for the pair (f,T) of self-mappings on the set X. We utilize our definition to introduce some common fixed point theorems for the two mappings f and T under a set of conditions. Also, we introduce an example to support the validity of our results. As application of our results, we derive some common fixed point theorems of integral type.

MSC:54H25, 47H10.

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 [1–12]).

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:A∪B→A∪B. 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:A∪B→A∪B is a cyclic map such that

d(Tx,Ty)≤kd(x,y)∀x∈A,∀y∈B.

If k∈[0,1), then T has a unique fixed point in A∩B.

Recently, several authors proved many results in fixed point theory for cyclic mappings, satisfying various (nonlinear) contractive conditions (see [1–12]). 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 [14–20].

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,y∈X are called comparable if x⪯y or y⪯x.

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:X→X are said to be weakly increasing if Fx⪯GFx and Gx⪯FGx for all x∈X.

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:X→X be two mappings. The pair (f,T) is called a cyclic (ψ,A,B)-contraction if

  1. (1)

    ψ is an altering distance function;

  2. (2)

    A∪B has a cyclic representation w.r.t. the pair (f,T); that is, fA⊆B, TB⊆A and X=A∪B;

  3. (3)

    There exists 0<δ<1 such that for any comparable elements x,y∈X with x∈A and y∈B, we have

    (2.1)

Definition 2.2 Let (X,⪯) be a partially ordered set and A, B be closed subsets of X with X=A∪B. Let f,T:X→X be two mappings. The pair (f,T) is said to be (A,B)-weakly increasing if fx⪯Tfx for all x∈A and Tx⪯fTx for all x∈B.

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:X→X 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 fA⊆B, we have x 1 ∈B. Also, let x 2 =T x 1 . Since TB⊆A, 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 n∈N. 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 n∈N. Given n∈N. If n is even, then n=2t for some t∈N. 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 t∈N. 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 ):n∈N∪{0}} is a bounded nonincreasing sequence. Thus there exists r≥0 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 u∈X, 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 u∈A. Also, since x 2 n + 1 is a sequence in B, B is closed and x 2 n + 1 →u, we have u∈B. 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 u⪯u with u∈A and u∈B, 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:X→X 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 u∈X. Since x 2 n →u, x 2 n + 1 →u, A and B are closed subsets of X, we get u∈A∩B. Using property (P), we get x n ⪯u for all n∈N. Since x 2 n ∈A and u∈B, 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:X→X be two mappings such that the pair (f,T) is (A,B)-weakly increasing and A∪B 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,y∈X with x∈A and y∈B, 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:X→X be two mappings such that the pair (f,T) is (A,B)-weakly increasing and such that A∪B 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,y∈X with x∈A and y∈B, 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=A∪B. Let f:X→X be a mapping such that fx⪯f(fx) for all x∈X. Suppose that there exists 0<δ<1 such that for all x∈A and y∈B, 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=A∪B. Let f:X→X be a mapping such that fx⪯f(fx) for all x∈X. Suppose that there exists 0<δ<1 such that for all x∈A and y∈B, 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:X→X be two weakly increasing mappings. Suppose that there exists 0<δ<1 such that for any two comparable elements x,y∈X, 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:X→X be two weakly increasing mappings. suppose that there exists 0<δ<1 such that for any two comparable elements x,y∈X, 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×X→X,d(x,y)={ 0 if  x = y ; max { x , y } if  x ≠ y .

We introduce a relation on X by x⪯y if and only if y≤x. Define f,T:X→X 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)

    A∪B 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,y∈X with x∈A and y∈B, 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 A∪B has a cyclic representation with respect to the pair (f,T). To prove part (3), given x∈A. If x∈{0,1,2,3,4}, then T(fx)=0. Thus Tfx≤fx and hence fx⪯T(fx). If x≥5, then fx=x−1 and T(fx)=T(x−1)=x−4. Thus T(fx)≤fx and hence fx⪯T(fx). Therefore fx⪯T(fx) for all x∈A. Similarly, we may show that Tx⪯f(Tx) for all x∈B. 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 →x∈X. 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 k∈N such that x 1 ≥⋯≥ x k − 1 ≥ x n =x for all n≥k. So, x n ≥x for all n∈N and hence x n ⪯x for all n∈N. Thus X satisfies property (P). To prove part (5), given two comparable elements x,y∈X with x∈A and y∈B. 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: x≥2 and y≥5. Here fx=x−1 and Ty=y−3. Since x∈A and y∈B, then x=2t and y=2n+1 for some t,n∈N.

If fx=Ty, then x−1=y−3 and hence 2t−1=2n−2. Thus 2t=2n−1, which is impossible.

If x−1>y−3, then d(fx,Ty)=x−1. 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 y−3>x−1, then d(fx,Ty)=y−3. 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 y≥5. Here fx=0 and Ty=y−3. 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: x≥2 and y∈{0,1,3}. Here fx=x−1 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:X→X be two mappings such that the pair (f,T) is (A,B)-weakly increasing and A∪B 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,y∈X with x∈A and y∈B, 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:X→X be two mappings such that (f,T) is (A,B)-weakly increasing and A∪B 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,y∈X with x∈A and y∈B, 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:X→X be two weakly increasing mappings. Suppose that there exist δ∈[0,1) and μ∈Λ such that for any two comparable elements x,y∈X, 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:X→X be two weakly increasing mappings. Suppose that there exist δ∈[0,1) and μ∈Λ such that for any two comparable elements x,y∈X, 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.

References

  1. Kirk WA, Srinavasan PS, Veeramani P: Fixed points for mapping satisfying cyclical contractive conditions. Fixed Point Theory Appl. 2003, 4: 79–89.

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  3. Eldered AA, Veeramani P: Proximal pointwise contraction. Topol. Appl. 2009, 156: 2942–2948. 10.1016/j.topol.2009.01.017

    Article  Google Scholar 

  4. Eldered AA, Veeramani P: Convergence and existence for best proximity points. J. Math. Anal. Appl. 2006, 323: 1001–1006. 10.1016/j.jmaa.2005.10.081

    Article  MathSciNet  Google Scholar 

  5. Agarwal RP, Alghamdi MA, Shahzad N: Fixed point theory for cyclic generalized contractions in partial metric spaces. Fixed Point Theory Appl. 2012., 2012: Article ID 40

    Google Scholar 

  6. Karapinar E, Erhan IM: Best proximity point on different type contractions. Appl. Math. Inf. Sci. 2011, 5: 342–353.

    MathSciNet  Google Scholar 

  7. Karpagam S, Agrawal S: Best proximity points for cyclic Meir-Keeler contraction maps. Nonlinear Anal. 2011, 74: 1040–1046. 10.1016/j.na.2010.07.026

    Article  MathSciNet  Google Scholar 

  8. Khan MS, Swaleh M, Sessa S: Fixed point theorems by altering distances between the points. Bull. Aust. Math. Soc. 1984, 30: 1–9. 10.1017/S0004972700001659

    Article  MathSciNet  Google Scholar 

  9. Petruşel G: Cyclic representations and periodic points. Stud. Univ. Babeş-Bolyai, Math. 2005, 50: 107–112.

    Google Scholar 

  10. Păcurar M, Rus IA: Fixed point theory for cyclic ϕ -contractions. Nonlinear Anal. 2010, 72: 1181–1187. 10.1016/j.na.2009.08.002

    Article  MathSciNet  Google Scholar 

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

    MathSciNet  Google Scholar 

  12. Shatanawi W, Manro S: Fixed point results for cyclic (ψ,ϕ,A,B)-contraction in partial metric spaces. Fixed Point Theory Appl. 2012., 2012: Article ID 165

    Google Scholar 

  13. Khan MS, Swaleh M, Sessa S: Fixed point theorems by altering distances between the points. Bull. Aust. Math. Soc. 1984, 30: 1–9. 10.1017/S0004972700001659

    Article  MathSciNet  Google Scholar 

  14. Aydi H, Postolache M, Shatanawi W: Coupled fixed point results for (ψ,ϕ) -weakly contractive mappings in ordered G -metric spaces. Comput. Math. Appl. 2012, 63: 298–309. 10.1016/j.camwa.2011.11.022

    Article  MathSciNet  Google Scholar 

  15. Aydi H, Karapinar E, Shatanawi W: Coupled fixed point results for (ψ,φ)-weakly contractive condition in ordered partial metric spaces. Comput. Math. Appl. 2011, 62: 4449–4460. 10.1016/j.camwa.2011.10.021

    Article  MathSciNet  Google Scholar 

  16. Cho YJ, Rhoades BE, Saadati R, Samet B, Shatanawi W: Nonlinear coupled fixed point theorems in ordered generalized metric spaces with integral type. Fixed Point Theory Appl. 2012., 2012: Article ID 8

    Google Scholar 

  17. Lakzian H, Samet B: Fixed points for (ψ,ϕ)-weakly contractive mappings in generalized metric spaces. Appl. Math. Lett. 2012, 25: 902–906. 10.1016/j.aml.2011.10.047

    Article  MathSciNet  Google Scholar 

  18. Shatanawi W, Al-Rawashdeh A: Common fixed points of almost generalized (ψ,ϕ)-contractive mappings in ordered metric spaces. Fixed Point Theory Appl. 2012., 2012: Article ID 80

    Google Scholar 

  19. Shatanawi W: Some fixed point results for a generalized ψ -weak contraction mappings in orbitally metric spaces. Chaos Solitons Fractals 2012, 45: 520–526. 10.1016/j.chaos.2012.01.015

    Article  MathSciNet  Google Scholar 

  20. Shatanawi W, Samet B: On (ψ,ϕ)-weakly contractive condition in partially ordered metric spaces. Comput. Math. Appl. 2011, 62: 3204–3214. 10.1016/j.camwa.2011.08.033

    Article  MathSciNet  Google Scholar 

  21. Altun I, Damjanović B, Djorić D: Fixed point and common fixed point theorems on ordered cone metric spaces. Appl. Math. Lett. 2010, 23: 310–316. 10.1016/j.aml.2009.09.016

    Article  MathSciNet  Google Scholar 

  22. Altun I, Simsek H: Some fixed point theorems on ordered metric spaces and application. Fixed Point Theory Appl. 2010., 2010: Article ID 6214469

    Google Scholar 

  23. Shatanawi W: Some coincidence point results in cone metric spaces. Math. Comput. Model. 2012, 55: 2023–2028. 10.1016/j.mcm.2011.11.061

    Article  MathSciNet  Google Scholar 

  24. Shatanawi W: Some fixed point theorems in ordered G -metric spaces and applications. Abstr. Appl. Anal. 2011., 2011: Article ID 126205

    Google Scholar 

Download references

Acknowledgements

The authors thank the editor and the referees for their valuable comments and suggestions regarding the initial version of our article.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mihai Postolache.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

Both authors contributed equally and significantly in writing this article. Both authors read and approved the final manuscript.

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

Shatanawi, W., Postolache, M. Common fixed point results for mappings under nonlinear contraction of cyclic form in ordered metric spaces. Fixed Point Theory Appl 2013, 60 (2013). https://doi.org/10.1186/1687-1812-2013-60

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1186/1687-1812-2013-60

Keywords