1 Introduction and preliminaries

The well-known Banach contraction mapping principle states that if (X,d) is a complete metric space and f:XX is a self-mapping such that

d(fx,fy)λd(x,y)
(1)

for all x,yX, where 0λ<1, then there exists a unique xX such that fx=x. This point x is called the fixed point of the mapping f. On the other hand, for mappings f:XX, Kannan [1] introduced the contractive condition

d(fx,fy)λ [ d ( x , f x ) + d ( y , f y ) ]
(2)

for all x,yX, where λ[0, 1 2 ) is a constant and proved a fixed point theorem using (2) instead of (1). Conditions (1) and (2) are independent, as it was shown by two examples in [2].

Reich [3], for mappings f:XX, generalized Banach and Kannan fixed point theorems using the contractive condition

d(fx,fy)αd(x,y)+βd(x,fx)+γd(y,fy)
(3)

for all x,yX, where α, β, γ are nonnegative constants with α+β+γ<1. An example in [3] shows that condition (3) is a proper generalization of (1) and (2).

In 1965, Prešić [4, 5] extended the Banach contraction mapping principle to mappings defined on product spaces and proved the following theorem.

Theorem 1.1 Let (X,d) be a complete metric space, k be a positive integer and f: X k X be a mapping satisfying the following contractive type condition:

d ( f ( x 1 , x 2 , , x k ) , f ( x 2 , x 3 , , x k + 1 ) ) i = 1 k q i d( x i , x i + 1 )
(4)

for every x 1 , x 2 ,, x k + 1 X, where q 1 , q 2 ,, q k are nonnegative constants such that q 1 + q 2 ++ q k <1. Then there exists a unique point xX such that f(x,x,,x)=x. Moreover, if x 1 , x 2 ,, x k are arbitrary points in X and for nN, x n + k =f( x n , x n + 1 ,, x n + k 1 ), then the sequence { x n } is convergent and lim x n =f(lim x n ,lim x n ,,lim x n ).

Note that condition (4) in the case k=1 reduces to the well-known Banach contraction mapping principle. So, Theorem 1.1 is a generalization of the Banach fixed point theorem. Some generalizations and applications of the Prešić theorem can be seen in [419].

The existence of a fixed point in partially ordered sets was investigated by Ran and Reurings [20] and then by Nieto and Lopez [21, 22]. Fixed point results in ordered metric spaces were obtained by several authors (see, e.g., [6, 18, 2332]). The following version of the fixed point theorem was proved, among others, in these papers.

Theorem 1.2 (see [22] and references therein)

Let (X,) be a partially ordered set, and let d be a metric on X such that (X,d) is a complete metric space. Let f:XX be a nondecreasing map with respect to ⪯. Suppose that the following conditions hold:

  1. (i)

    there exists k(0,1) such that d(fx,fy)kd(x,y) for all x,yX with yx;

  2. (ii)

    there exists x 0 X such that x 0 f x 0 ;

  3. (iii)

    f is continuous.

Then f has a fixed point x X.

Pǎcurar [10] introduced the Prešić-Kannan type contraction and proved some common fixed point theorems for such contractions. Very recently, in [18] (see also [33]) authors introduced the ordered Prešić type contraction and generalized the result of Prešić and proved some fixed point theorems for such mappings. In this paper, we introduce the ordered Prešić-Reich type contraction and prove some common fixed point theorems for such type of mappings in ordered metric spaces. Our results generalize and extend the results of Prešić [4, 5], Pǎcurar [10], Malhotra et al. [18], Luong and Thuan [33], Nieto and López [21] and several known results of metric spaces. An example, which illustrates the case when new results can be applied while old ones cannot, is included.

The following definitions will be needed in the sequel.

Definition 1.3 Let X be a nonempty set, k be a positive integer and f: X k X be a mapping. If f(x,x,,x)=x, then xX is called a fixed point of f.

Definition 1.4 (see [13])

Let X be a nonempty set, k be a positive integer, f: X k X and g:XX be mappings.

  1. (a)

    An element xX is said to be a coincidence point of f and g if gx=f(x,,x).

  2. (b)

    If w=gx=f(x,,x), then w is called a point of coincidence of f and g.

  3. (c)

    If x=gx=f(x,,x), then x is called a common fixed point of f and g.

  4. (d)

    Mappings f and g are said to be commuting if g(f(x,,x))=f(gx,,gx) for all xX.

  5. (e)

    Mappings f and g are said to be weakly compatible if they commute at their coincidence points.

Remark that the above definition in the case k=1 reduces to the usual definitions of commuting and weakly compatible mappings in the sense of [34] (for details, see the Introduction from [34]).

Definition 1.5 (see [18])

Let a nonempty set X be equipped with a partial order ‘⪯’ such that (X,d) is a metric space, then (X,,d) is called an ordered metric space. A sequence { x n } in X is said to be nondecreasing with respect to ‘⪯’ if x 1 x 2 x n  . Let k be a positive integer and f: X k X be a mapping, then f is said to be nondecreasing with respect to ‘⪯’ if for any finite nondecreasing sequence { x n } n = 1 k + 1 we have f( x 1 , x 2 ,, x k )f( x 2 , x 3 ,, x k + 1 ). Let g:XX be a mapping. f is said to be g-nondecreasing with respect to ‘⪯’ if for any finite nondecreasing sequence { g x n } n = 1 k + 1 we have f( x 1 , x 2 ,, x k )f( x 2 , x 3 ,, x k + 1 ).

Remark 1.6 For k=1, the above definitions reduce to usual definitions of fixed point and nondecreasing mapping in a metric space.

Definition 1.7 Let X be a nonempty set equipped with partial order ‘⪯,’ and let g:XX be a mapping. A nonempty subset A of X is said to be well ordered if every two elements of A are comparable. Elements a,bA are called g-comparable if ga and gb are comparable. A is called g-well ordered if for all a,bA, a and b are g-comparable, i.e., ga and gb are comparable.

Example 1.8 Let X={0,1,2,3}, ‘⪯’ be a partial order relation on X defined by ={(0,0),(1,1),(2,2),(3,3),(1,2),(2,3),(1,3)}. Let A={0,1,3} and g:XX be defined by g0=1, g1=2, g2=3, g3=3. Then it is clear that A is not well ordered but it is g-well ordered.

Let (X,,d) be an ordered metric space. Let k be a positive integer and f: X k X be a mapping. f is said to be an ordered Prešić type contraction if

d ( f ( x 1 , x 2 , , x k ) , f ( x 2 , x 3 , , x k + 1 ) ) i = 1 k α i d( x i , x i + 1 )
(5)

for all x 1 , x 2 ,, x k + 1 X with x 1 x 2 x k + 1 , where α i are nonnegative constants such that i = 1 k α i <1. If (5) is satisfied for all x 1 , x 2 ,, x k + 1 X, then f is called a Prešić type contraction.

f is said to be an ordered Prešić-Kannan type contraction (see [10] for details) if f satisfies following condition:

d ( f ( x 1 , x 2 , , x k ) , f ( x 2 , x 3 , , x k + 1 ) ) β i = 1 k + 1 d ( x i , f ( x i , x i , , x i ) )
(6)

for all x 1 , x 2 ,, x k + 1 X with x 1 x 2 x k + 1 , where 0βk(k+1)<1. If (6) is satisfied for all x 1 , x 2 ,, x k + 1 X, then f is called a Prešić-Kannan type contraction.

f is said to be an ordered Prešić-Reich type contraction (see also [16]) if f satisfies the following condition:

d ( f ( x 1 , x 2 , , x k ) , f ( x 2 , x 3 , , x k + 1 ) ) i = 1 k α i d ( x i , x i + 1 ) + i = 1 k + 1 β i d ( x i , f ( x i , x i , , x i ) )
(7)

for all x 1 , x 2 ,, x k + 1 X with x 1 x 2 x k + 1 , where α i , β i are nonnegative constants such that i = 1 k α i +k i = 1 k + 1 β i <1. If (7) is satisfied for all x 1 , x 2 ,, x k + 1 X, then f is called a Prešić-Reich type contraction.

Note that the Prešić-Reich type contraction is a generalization of Prešić type and Prešić-Kannan type contractions. Indeed, for β i =0, 1ik+1, a Prešić-Reich type contraction reduces into a Prešić type contraction and for α i =0, 1ik, and β i =β, 1ik+1, a Prešić-Reich type contraction reduces into a Prešić-Kannan type contraction. Also, for k=1, a Prešić-Reich type contraction reduces into a Reich contraction, so it generalizes the Banach and Kannan contractions.

Now we can state our main results.

2 Main results

Theorem 2.1 Let (X,,d) be an ordered complete metric space. Let k be a positive integer, f: X k X and g:XX be two mappings such that f( X k )g(X), g(X) is a closed subset of X and

d ( f ( x 1 , x 2 , , x k ) , f ( x 2 , x 3 , , x k + 1 ) ) i = 1 k α i d ( g x i , g x i + 1 ) + i = 1 k + 1 β i d ( g x i , f ( x i , x i , , x i ) )
(8)

for all x 1 , x 2 ,, x k + 1 X with g x 1 g x 2 g x k + 1 , where α i , β i are nonnegative constants such that

i = 1 k α i +k i = 1 k + 1 β i <1.
(9)

Suppose that the following conditions hold:

  1. (I)

    there exists x 0 X such that g x 0 f( x 0 , x 0 ,, x 0 );

  2. (II)

    f is g-nondecreasing;

  3. (III)

    if a nondecreasing sequence {g x n } converges to guX, then g x n gu for all nN and guggu.

Then f and g have a point of coincidence. If, in addition, f and g are weakly compatible, then f and g have a common fixed point vX. Moreover, the set of common fixed points of f and g is g-well ordered if and only if f and g have a unique common fixed point.

Proof Starting with given x 0 X, we define a sequence { y n } as follows: let y 0 =g x 0 , y 1 =f( x 0 , x 0 ,, x 0 ). As f( X k )g(X), there exists x 1 X such that f( x 0 , x 0 ,, x 0 )=g x 1 . Therefore y 1 =g x 1 =f( x 0 , x 0 ,, x 0 ) as g x 0 f( x 0 , x 0 ,, x 0 ), we have g x 0 g x 1 , that is, y 0 y 1 . Again, as f is g-nondecreasing and g x 0 g x 1 , we have f( x 0 , x 0 ,, x 0 )f( x 0 ,, x 0 , x 1 )f( x 0 ,, x 0 , x 1 , x 1 )f( x 1 , x 1 ,, x 1 ). Choose x 2 X such that y 2 =g x 2 =f( x 1 , x 1 ,, x 1 ) (which is possible since f( X k )g(X)). So, g x 0 g x 1 g x 2 , that is, y 0 y 1 y 2 . Continuing this process, we obtain

g x 0 g x 1 g x n g x n + 1 ,

that is,

y 0 y 1 y 2 y n y n + 1

and y n =g x n =f( x n 1 , x n 1 ,, x n 1 ) for n=1,2, . Thus, { y n }={g x n } is nondecreasing with respect to ‘⪯,’ that is, { x n } is g-nondecreasing with respect to ‘⪯.’ We shall show that { y n }={g x n } is a Cauchy sequence in g(X). If y n = y n + 1 for any n, then

d ( y n + 1 , y n + 2 ) = d ( f ( x n , , x n ) , f ( x n + 1 , , x n + 1 ) ) d ( f ( x n , , x n ) , f ( x n , , x n , x n + 1 ) ) + d ( f ( x n , , x n , x n + 1 ) , f ( x n , , x n , x n + 1 , x n + 1 ) ) + + d ( f ( x n , x n + 1 , , x n + 1 ) , f ( x n + 1 , , x n + 1 ) ) .

As g x n g x n + 1 , using (8), the above inequality implies that

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

that is,

d ( y n + 1 , y n + 2 ) [ i = 1 k α i ] d ( y n , y n + 1 ) + β 1 d ( y n , y n + 1 ) + + β k d ( y n , y n + 1 ) + β k + 1 d ( y n + 1 , y n + 2 ) + β 1 d ( y n , y n + 1 ) + + β k 1 d ( y n , y n + 1 ) + β k d ( y n + 1 , y n + 2 ) + β k + 1 d ( y n + 1 , y n + 2 ) + + β 1 d ( y n , y n + 1 ) + β 2 d ( y n + 1 , y n + 2 ) + + β k + 1 d ( y n + 1 , y n + 2 ) [ k β k + 1 + ( k 1 ) β k + + β 2 ] d ( y n + 1 , y n + 2 )

since y n = y n + 1 . In view of (9), we have k β k + 1 +(k1) β k ++ β 2 = i = 2 k + 1 (i1) β i k i = 2 k + 1 β i <1, therefore it follows from the above inequality that d( y n + 1 , y n + 2 )=0, that is, y n + 1 = y n + 2 . Similarly, it can be shown that

y n = y n + 1 = y n + 2 = y n + 3 =.

Therefore { y n } is a Cauchy sequence. If y n y n + 1 for all n, then for any n0, we have

d ( y n , y n + 1 ) = d ( g x n , g x n + 1 ) = d ( f ( x n 1 , , x n 1 ) , f ( x n , , x n ) ) d ( f ( x n 1 , , x n 1 ) , f ( x n 1 , , x n 1 , x n ) ) + d ( f ( x n 1 , , x n 1 , x n ) , f ( x n 1 , , x n 1 , x n , x n ) ) + + d ( f ( x n 1 , x n , , x n ) , f ( x n , , x n ) ) .

As { x n } is g-nondecreasing, using (8), the above inequality implies that

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

that is,

d ( y n , y n + 1 ) [ i = 1 k α i ] d ( y n 1 , y n ) + β 1 d ( y n 1 , y n ) + + β k d ( y n 1 , y n ) + β k + 1 d ( y n , y n + 1 ) + β 1 d ( y n 1 , y n ) + + β k 1 d ( y n 1 , y n ) + β k d ( y n , y n + 1 ) + β k + 1 d ( y n , y n + 1 ) + + β 1 d ( y n 1 , y n ) + β 2 d ( y n , y n + 1 ) + + β k + 1 d ( y n , y n + 1 ) .

Setting d n =d( y n , y n + 1 ), we obtain

d n [ i = 1 k α i ] d n 1 + [ k β 1 + ( k 1 ) β 2 + + 2 β k 1 + β k ] d n 1 d n + [ k β k + 1 + ( k 1 ) β k + + 2 β 3 + β 2 ] d n , d n [ i = 1 k α i + i = 1 k ( k + 1 i ) β i ] d n 1 + [ i = 2 k + 1 ( i 1 ) β i ] d n , d n i = 1 k α i + i = 1 k + 1 ( k + 1 i ) β i 1 i = 1 k + 1 ( i 1 ) β i d n 1 , d n λ d n 1 ( say ) .

Let A= i = 1 k α i , B=k i = 1 k + 1 β i , C= i = 1 k + 1 (i1) β i , then in view of (9) we have A+B<1. Therefore

λ= i = 1 k α i + i = 1 k + 1 ( k + 1 i ) β i 1 i = 1 k + 1 ( i 1 ) β i = A + B C 1 C <1.

By repeating this process, we obtain

d n λ n d 0 .
(10)

Let m,nN and m>n, then it follows from (10) that

d ( y n , y m ) d ( y n , y n + 1 ) + d ( y n + 1 , y n + 2 ) + d ( y n + 2 , y n + 3 ) + + d ( y m 1 , y m ) d ( y n , y m ) d n + d n + 1 + d n + 2 + d ( y n , y m ) λ n d 0 + λ n + 1 d 0 + λ n + 2 d 0 + d ( y n , y m ) = [ 1 + λ + λ 2 + ] λ n d 0 , d ( y n , y m ) λ n 1 λ d 0 .

As λ<1, we have λ n 1 λ d 0 0 as n. Therefore, it follows from the above inequality that lim n , m d( y n , y m )=0. Therefore { y n }={g x n } is a Cauchy sequence. As g(X) is closed, there exist vg(X), uX such that

lim n y n = lim n g x n =gu=v.

We shall show that v is a point of coincidence of f and g. For any nN, we obtain

d ( g u , f ( u , , u ) ) d ( g u , y n + 1 ) + d ( y n + 1 , f ( u , , u ) ) d ( g u , y n + 1 ) + d ( f ( x n , , x n ) , f ( u , , u ) ) d ( g u , y n + 1 ) + d ( f ( x n , , x n ) , f ( x n , , x n , u ) ) + d ( f ( x n , , x n , u ) , f ( x n , , x n , u , u ) ) + + d ( f ( x n , u , , u ) , f ( u , , u ) ) .

By (III) we have g x n gu for all nN, also, as y n =g x n =f( x n ,, x n ), d n =d(g x n ,g x n + 1 ) and gu=v. Therefore, using (8) in the above inequality, we obtain

d ( v , f ( u , , u ) ) α k d ( y n , v ) + β 1 d n + β 2 d n + + β k d n + β k + 1 d ( v , f ( u , , u ) ) + α k 1 d ( y n , v ) + β 1 d n + β 2 d n + + β k 1 d n + β k d ( v , f ( u , , u ) ) + β k + 1 d ( v , f ( u , , u ) ) + + α 1 d ( y n , v ) + β 1 d n + β 2 d ( v , f ( u , , u ) ) + + β k + 1 d ( v , f ( u , , u ) ) + d ( v , y n + 1 ) = [ i = 1 k α i ] d ( y n , v ) + [ i = 1 k ( k + 1 i ) β i ] d n + [ i = 2 k + 1 ( i 1 ) β i ] d ( v , f ( u , , u ) ) + d ( v , y n + 1 ) ,

that is,

( 1 C ) d ( v , f ( u , , u ) ) A d ( y n , v ) + ( B C ) d ( y n , y n + 1 ) + d ( v , y n + 1 ) , ( 1 C ) d ( v , f ( u , , u ) ) ( A + B C ) d ( y n , v ) + ( 1 + B C ) d ( y n + 1 , v ) .

As lim n d( y n ,v)=0 and 1C=1 i = 1 k + 1 (i1) β i >0, therefore it follows from the above inequality that

d ( v , f ( u , , u ) ) =0,that is,f(u,,u)=v=gu.
(11)

Thus, u is a coincidence point and v is a corresponding point of coincidence of f and g. Suppose, f and g are weakly compatible, then by (11) we have

f(v,,v)=f(gu,,gu)=g ( f ( u , , u ) ) =gv.

Again, by (III), guggu=gv; therefore using (8) and a similar process as several times before, we obtain

d ( v , f ( v , , v ) ) = d ( f ( u , , u ) , f ( v , , v ) ) d ( f ( u , , u ) , f ( u , , u , v ) ) + d ( f ( u , , u , v ) , f ( u , , u , v , v ) ) + + d ( f ( u , v , , v ) , f ( v , , v ) ) A d ( g u , g v ) + ( B C ) d ( g u , f ( u , , u ) ) + C d ( g v , f ( v , , v ) ) = A d ( v , f ( v , , v ) ) .

As A= i = 1 k α i <1, we obtain

d ( v , f ( v , , v ) ) =0,that is,f(v,,v)=v=gv.

Thus v is a common fixed point of f and g. Suppose that the set of common fixed points is g-well ordered. We shall show that the common fixed point is unique. Assume on the contrary that v 0 is another common fixed point of f and g, that is, v 0 =f( v 0 ,, v 0 )=g v 0 and v v 0 . As v and v 0 are g-comparable, let for example gvg v 0 . From (8), it follows that

d ( v , v 0 ) = d ( f ( v , , v ) , f ( v 0 , , v 0 ) ) d ( f ( v , , v ) , f ( v , , v , v 0 ) ) + d ( f ( v , , v , v 0 ) , f ( v , , v , v 0 , v 0 ) ) + + d ( f ( v , v 0 , , v 0 ) , f ( v 0 , , v 0 ) ) A d ( g v , g v 0 ) + ( B C ) d ( g v , f ( v , , v ) ) + C d ( g v 0 , f ( v 0 , , v 0 ) ) = A d ( v , v 0 ) .

As A= i = 1 k α i <1, we obtain d(v, v 0 )=0, that is, v= v 0 , a contradiction. Therefore the common fixed point is unique. For converse, if a common fixed point of f and g is unique, then the set of common fixed points of f and g is singleton, and thus g-well ordered. □

Remark 2.2 Let (X,,d) be an ordered metric space, and let f,g:XX be two mappings. Then f is called an ordered g-weak contraction if

d(fx,fy) α 1 d(gx,gy)+ α 2 d(fx,gx)+ α 3 d(fy,gy)

for all x,yX with xy, where α 1 , α 2 , α 3 are nonnegative constants such that α 1 + α 2 + α 3 <1. If the above inequality is satisfied for all x,yX, then f is called a g-weak contraction (see [35]). For k=1 in Theorem 2.1, we get a fixed point result for an ordered g-weak contraction in metric spaces.

The following is a fixed point result for ordered Prešić-Reich type mappings in metric spaces and can be obtained by taking g= I X (that is, the identity mapping of X) in Theorem 2.1.

Corollary 2.3 Let (X,,d) be an ordered complete metric space. Let k be a positive integer, f: X k X be a mapping such that the following conditions hold:

  1. (I)

    f is an ordered Prešić-Reich type contraction;

  2. (II)

    there exists x 0 X such that x 0 f( x 0 , x 0 ,, x 0 );

  3. (III)

    f is nondecreasing (with respect to ‘);

  4. (IV)

    if a nondecreasing sequence { x n } converges to uX, then x n u for all nN.

Then f has a fixed point. Moreover, the set of fixed points of f is well ordered if and only if f has a unique fixed point.

The following corollary is a generalization of the result of Prešić in an ordered metric space and can be obtained by taking β i =0 for 1ik+1 in Theorem 2.1.

Corollary 2.4 Let (X,,d) be an ordered complete metric space. Let k be a positive integer, f: X k X and g:XX be two mappings such that f( X k )g(x), g(X) is a closed subset of X and

d ( f ( x 1 , x 2 , , x k ) , f ( x 2 , x 3 , , x k + 1 ) ) i = 1 k α i d(g x i ,g x i + 1 )
(12)

for all x 1 , x 2 ,, x k + 1 X with g x 1 g x 2 g x k + 1 , where α i are nonnegative constants such that i = 1 k α i <1. Suppose that the following conditions hold:

  1. (I)

    there exists x 0 X such that g x 0 f( x 0 , x 0 ,, x 0 );

  2. (II)

    f is g-nondecreasing;

  3. (III)

    if a nondecreasing sequence {g x n } converges to guX, then g x n gu for all nN and guggu.

Then f and g have a point of coincidence. If, in addition, f and g are weakly compatible, then f and g have a common fixed point vX. Moreover, the set of common fixed points of f and g is g-well ordered if and only if f and g have a unique common fixed point.

The following corollary generalizes the result of Pǎcurar [10] in ordered metric spaces and can be obtained by taking α i =0 for 1ik in Theorem 2.1.

Corollary 2.5 Let (X,,d) be an ordered complete metric space. Let k be a positive integer, f: X k X and g:XX be two mappings such that f( X k )g(X), g(X) is a closed subset of X and

d ( f ( x 1 , x 2 , , x k ) , f ( x 2 , x 3 , , x k + 1 ) ) i = 1 k + 1 β i d ( g x i , f ( x i , x i , , x i ) )
(13)

for all x 1 , x 2 ,, x k + 1 X with g x 1 g x 2 g x k + 1 , where β i are nonnegative constants such that k i = 1 k + 1 β i <1. Suppose that the following conditions hold:

  1. (I)

    there exists x 0 X such that g x 0 f( x 0 , x 0 ,, x 0 );

  2. (II)

    f is g-nondecreasing;

  3. (III)

    if a nondecreasing sequence {g x n } converges to guX, then g x n gu for all nN and guggu.

Then f and g have a point of coincidence. If, in addition, f and g are weakly compatible, then f and g have a common fixed point vX. Moreover, the set of common fixed points of f and g is g-well ordered if and only if f and g have a unique common fixed point.

The following example illustrates that an ordered Prešić-Reich type contraction may not be an ordered Prešić type or ordered Prešić-Kannan type or Prešić-Reich type contraction; moreover, that the fixed point of an ordered Prešić-Reich type contraction may not be unique (when the set of fixed points of f is not well-ordered).

Example 2.6 Let X=[0,2] and order relation ‘⪯’ be defined by

= { ( x , y ) : x , y [ 0 , 1 ]  with  y x } { ( x , y ) : x , y ( 1 , 2 )  with  y x } { ( 2 , 2 ) }

and let d be the usual metric on X. Then (X,,d) is an ordered complete metric space. For k=2, define f: X 2 X by

f(x,y)={ 1 12 if  x = y = 1 , 2 if  x = y = 2 , x + y 2 1 if  ( x , y ) [ 0 , 1 ) × { 2 } { 2 } × [ 0 , 1 ) , x + y 6 otherwise .

Then:

  1. (a)

    f is not an ordered Prešić type contraction;

  2. (b)

    f is not an ordered Prešić-Kannan type contraction;

  3. (c)

    f is not a Prešić-Reich type contraction;

  4. (d)

    f is an ordered Prešić-Reich type contraction with α 1 = α 2 = 1 6 , β 1 = β 2 = β 3 = 1 10 .

Proof (a) For k=2, (5) becomes

d ( f ( x 1 , x 2 ) , f ( x 2 , x 3 ) ) α 1 d( x 1 , x 2 )+ α 2 d( x 2 , x 3 )
(14)

for all x 1 , x 2 , x 3 X with x 1 x 2 x 3 , where α 1 , α 2 are nonnegative constants such that α 1 + α 2 <1. Note that 11 9 10 , therefore for x 1 = x 2 =1, x 3 = 9 10 , (14) becomes

d ( f ( 1 , 1 ) , f ( 1 , 9 10 ) ) α 1 d ( 1 , 1 ) + α 2 d ( 1 , 9 10 ) , d ( 1 12 , 19 60 ) α 2 1 10 , 7 3 α 2 .

But α 1 + α 2 <1 and therefore the above inequality will never hold. Thus f is not an ordered Prešić type contraction.

(b) For k=2, (6) becomes

d ( f ( x 1 , x 2 ) , f ( x 2 , x 3 ) ) β [ d ( x 1 , f ( x 1 , x 1 ) ) + d ( x 2 , f ( x 2 , x 2 ) ) + d ( x 3 , f ( x 3 , x 3 ) ) ]
(15)

for all x 1 , x 2 , x 3 X with x 1 x 2 x 3 , where β is a nonnegative constant such that β< 1 6 . Note that x00 for all x(0,1) and therefore for x 2 = x 3 =0, x 1 =x(0,1), (15) becomes

d ( f ( x , 0 ) , f ( 0 , 0 ) ) β 1 d ( x , f ( x , x ) ) + β 2 d ( 0 , f ( 0 , 0 ) ) + β 3 d ( 0 , f ( 0 , 0 ) ) , d ( x 6 , 0 ) β 1 d ( x , x 3 ) + β 2 d ( 0 , 0 ) + β 3 d ( 0 , 0 ) , x 6 β 1 2 x 3 .

But β< 1 6 , and therefore the above inequality will never hold. Thus f is not an ordered Prešić-Kannan type contraction.

  1. (c)

    For k=2, (7) becomes

    d ( f ( x 1 , x 2 ) , f ( x 2 , x 3 ) ) α 1 d ( x 1 , x 2 ) + α 2 d ( x 2 , x 3 ) + β 1 d ( x 1 , f ( x 1 , x 1 ) ) + β 2 d ( x 2 , f ( x 2 , x 2 ) ) + β 3 d ( x 3 , f ( x 3 , x 3 ) ) ,
    (16)

where α 1 , α 2 , β 1 , β 2 , β 3 are nonnegative constants such that i = 1 2 α i +2 i = 1 3 β i <1. If f is a Prešić-Reich type contraction, then inequality (16) must be satisfied for all x 1 , x 2 , x 3 X. Note that for x 1 = x 2 =2, x 3 =0, (16) becomes

d ( f ( 2 , 2 ) , f ( 2 , 0 ) ) α 1 d ( 2 , 2 ) + α 2 d ( 2 , 0 ) d ( f ( 2 , 2 ) , f ( 2 , 0 ) ) + β 1 d ( 2 , f ( 2 , 2 ) ) + β 2 d ( 2 , f ( 2 , 2 ) ) + β 3 d ( 0 , f ( 0 , 0 ) ) , d ( 2 , 0 ) α 2 d ( 2 , 0 ) + β 1 d ( 2 , 2 ) + β 2 d ( 2 , 2 ) + β 3 d ( 0 , 0 ) , 2 2 α 2 .

But i = 1 2 α i +2 i = 1 3 β i <1, and therefore the above inequality will never hold. Thus f is not a Prešić-Reich type contraction.

(d) If f is an ordered Prešić-Reich type contraction, then inequality (16) must be satisfied for all x 1 , x 2 , x 3 X with x 1 x 2 x 3 . Indeed, we have to check the validity of (16) only for x 1 , x 2 , x 3 [0,1], x 1 , x 2 , x 3 (1,2) and x 1 = x 2 = x 3 =2. If x 1 = x 2 = x 3 =1 or x 1 = x 2 = x 3 =2, then (16) is satisfied trivially. If x 1 , x 2 , x 3 [0,1) or x 1 , x 2 , x 3 (1,2) with x 1 x 2 x 3 , that is, x 3 x 2 x 1 , then (16) becomes

d ( x 1 + x 2 6 , x 2 + x 3 6 ) α 1 d ( x 1 , x 2 ) + α 2 d ( x 2 , x 3 ) d ( x 1 + x 2 6 , x 2 + x 3 6 ) + β 1 d ( x 1 , x 1 3 ) + β 2 d ( x 2 , x 2 3 ) + β 3 d ( x 3 , x 3 3 ) , x 1 x 3 6 α 1 ( x 1 x 2 ) + α 2 ( x 2 x 3 ) + 2 x 1 3 β 1 + 2 x 2 3 β 2 + 2 x 3 3 β 3 ,

which is valid for α 1 = α 2 = 1 6 , β 1 = β 2 = β 3 = 1 10 . If any one of x 1 , x 2 , x 3 is equal to 1, then with a similar process one can verify the same result. If any two of x 1 , x 2 , x 3 are equal to 1, for example, let x 1 = x 2 =1, x 3 [0,1), then (16) becomes

d ( 1 12 , 1 + x 3 6 ) α 1 d ( 1 , 1 ) + α 2 d ( 1 , x 3 ) d ( 1 12 , 1 + x 3 6 ) + β 1 d ( 1 , 1 12 ) + β 2 d ( 1 , 1 12 ) + β 3 d ( x 3 , x 3 3 ) , 1 + 2 x 3 12 α 2 ( 1 x 3 ) + 11 12 β 1 + 11 12 β 2 + 2 x 3 3 β 3 ,

which is valid for α 1 = α 2 = 1 6 , β 1 = β 2 = β 3 = 1 10 . Similarly, in all possible cases, (16) is satisfied for α 1 = α 2 = 1 6 , β 1 = β 2 = β 3 = 1 10 . Thus, f is an ordered Prešić-Reich type contraction. All the conditions of Corollary 2.3 (except the set of fixed points of f is well ordered) are satisfied and the set of fixed points of f is F={0,2}. Note that the set of fixed points of f, that is ℱ, is not well ordered (as (0,2),(2,0)) and fixed point f is not unique. □