1 Introduction and preliminaries

Let T:XX be a mapping. A point xX is called a fixed point of T if x=Tx. Let x 0 be an arbitrarily chosen point in X. Define a sequence { x n } in X by a simple iterative method given by

x n + 1 =T x n ,where n{0,1,2,}.

Such a sequence is called a Picard iterative sequence, and its convergence plays a very important role in proving the existence of a fixed point of a mapping T. A self-mapping T on a metric space X is said to be a Banach contraction mapping if

d(Tx,Ty)kd(x,y)

holds for all x,yX, where 0k<1.

Fixed points results of mappings satisfying a certain contractive condition on the entire domain have been at the center of rigorous research activity (for example, see [112]) and they have a wide range of applications in different areas such as nonlinear and adaptive control systems, parameter estimation problems, computing magnetostatic fields in a nonlinear medium and convergence of recurrent networks (see [1315]).

From the application point of view, the situation is not yet completely satisfactory because it frequently happens that a mapping T is a contraction not on the entire space X but merely on a subset Y of X. However, if Y is closed and a Picard iterative sequence { x n } in X converges to some x in X, then by imposing a subtle restriction on the choice of x 0 , one may force the Picard iterative sequence to stay eventually in Y. In this case, the closedness of Y coupled with some suitable contractive condition establishes the existence of a fixed point of T. Azam et al. [16] proved a significant result concerning the existence of fixed points of a mapping satisfying contractive conditions on a closed ball of a complete metric space. Recently, many results related to the fixed point theorem in complete metric spaces endowed with a partial ordering ⪯ appeared in literature. Ran and Reurings [17] proved an analogue of Banach’s fixed point theorem in a metric space endowed with a partial order and gave applications to matrix equations. In this way, they weakened the usual contractive condition. Subsequently, Nieto et al. [18] extended this result in [17] for non-decreasing mappings and applied it to obtain a unique solution for a first-order ordinary differential equation with periodic boundary conditions. Thereafter, many works related to fixed point problems have also been considered in partially ordered metric spaces (see [1723]). Indeed, they all deal with monotone mappings (either order-preserving or order-reversing) such that for some x 0 X, either x 0 f x 0 or f x 0 x 0 , where f is a self-map on a metric space. To obtain a unique solution, they used an additional restriction that each pair of elements has a lower bound and an upper bound. We have not used these conditions in our results. In this paper we introduce a new condition of partial order.

On the other hand, the notion of a partial metric space was introduced by Matthews in [24]. In partial metric spaces, the distance of a point from itself may not be zero. He also proved a partial metric version of the Banach fixed point theorem. Karapınar et al. [25] have proved a common fixed point in partial metric spaces. Partial metric spaces have applications in theoretical computer science (see [26]). Altun et al. [20], Aydi [27], Samet et al. [28] and Paesano et al. [29] used the idea of a partial metric space and partial order and gave some fixed point theorems for the contractive condition on ordered partial metric spaces. Further useful results can be seen in [28]. To generalize a partial metric, Hitzler and Seda [30] introduced the concept of dislocated topologies and its corresponding generalized metric, named a dislocated metric, and established a fixed point theorem in complete dislocated metric spaces to generalize the celebrated Banach contraction principle. The notion of dislocated topologies has useful applications in the context of logic programming semantics (see [31]). Further useful results can be seen in [3235]. The dominated mapping, which satisfies the condition fxx, occurs very naturally in several practical problems. For example, if x denotes the total quantity of food produced over a certain period of time and f(x) gives the quantity of food consumed over the same period in a certain town, then we must have fxx. In this paper, we exploit this concept for contractive mappings [36] to generalize, extend and improve some classical fixed point results for two, three and four mappings in the framework of an ordered complete dislocated metric space X. Our results not only extend some primary theorems to ordered dislocated metric spaces, but also restrict the contractive conditions on a closed ball only. The concept of a dominated mapping has been applied to approximate the unique solution of nonlinear functional equations.

Consistent with [30, 32, 34] and [35], the following definitions and results will be needed in the sequel.

Definition 1.1 Let X be a nonempty set and let d l :X×X[0,) be a function, called a dislocated metric (or simply d l -metric), if the following conditions hold for any x,y,zX:

  1. (i)

    if d l (x,y)=0, then x=y,

  2. (ii)

    d l (x,y)= d l (y,x),

  3. (iii)

    d l (x,y) d l (x,z)+ d l (z,y).

The pair (X, d l ) is then called a dislocated metric space. It is clear that if d l (x,y)=0, then from (i), x=y. But if x=y, d l (x,y) may not be 0.

Recently Sarma and Kumari [34] proved the results that establish the existence of a topology induced by a dislocated metric and the fact that this topology is metrizable. This topology has as a base the family of sets {B(x,ε){x}:xX,ε>0}, where B(x,ε) is an open ball and B(x,ε)={yX: d l (x,y)<ε} for some xX and ε>0. Also, B ( x , ε ) ¯ ={yX: d l (x,y)ε} is a closed ball.

Also, Harandi [37] defined the concept of a metric-like space which is similar to a dislocated metric space. Each metric-like σ on X generates a topology τ σ on X whose base is the family of open σ-balls

B σ (x,ε)= { y X : | σ ( x , y ) σ ( x , x ) | < ε } .

Definition 1.2 Let p:X×X R + , where X is a nonempty set. p is said to be a partial metric on X if for any x,y,zX:

(P1) p(x,x)=p(y,y)=p(x,y) if and only if x=y,

(P2) p(x,x)p(x,y),

(P3) p(x,y)=p(y,x),

(P4) p(x,z)p(x,y)+p(y,z)p(y,y).

The pair (X,p) is then called a partial metric space.

Each partial metric p on X induces a T 0 topology p on X which has as a base the family of open balls { B p (x,ε):xX,ε>0}, where B p (x,ε)={yX:p(x,y)<p(x,x)+ε} for all xX and ε>0.

It is clear that any partial metric is a d l -metric. A basic example of a partial metric space is the pair ( R + ,p), where p(x,y)=max{x,y} for all x,y R + . It is also a d l -metric. An example of a d l -metric space which is not a partial metric is given below.

Example 1.3 If X= R + {0}, then d l (x,y)=x+y defines a dislocated metric d l on X. Note that this metric is not a partial metric as (P2) is not satisfied.

From the examples and definitions, it is clear that any partial metric is a d l -metric, whereas a d l -metric may not be a partial metric. We also remark that for those d l -metrics which are also partial metrics, we have B d l (x,ε) B p (x,ε). Also, for any d l -metric, B d l (x,ε) B σ (x,ε). Thus it is better to find a fixed point on a closed ball defined by Hitzler in a d l -metric because we restrict ourselves to applying the contractive condition on the smallest closed ball. In this way, we also weaken the contractive condition.

Definition 1.4 [30]

A sequence { x n } in a d l -metric space (X, d l ) is called a Cauchy sequence if given ε>0, there corresponds n 0 N such that for all n,m n 0 , we have d l ( x m , x n )<ε or lim n , m d l ( x n , x m )=0.

Definition 1.5 [30]

A sequence { x n } in a d l -metric space converges with respect to d l if there exists xX such that d l ( x n ,x)0 as n. In this case, x is called the limit of { x n }, and we write x n x.

Definition 1.6 [30]

A d l -metric space (X, d l ) is called complete if every Cauchy sequence in X converges to a point in X.

In Harandi’s sense, a sequence { x n } in the metric-like space (X,σ) converges to a point xX if and only if lim n σ( x n ,x)=σ(x,x). The sequence { x n } n = 0 of elements of X is called σ-Cauchy if the limit lim n , m σ( x n , x m ) exists and is finite. The metric-like space (X,σ) is called complete if for each σ-Cauchy sequence { x n } n = 0 , there is some xX such that

lim n σ( x n ,x)=σ(x,x)= lim n , m σ( x n , x m ).

Romaguera [38] has given the idea of a 0-Cauchy sequence and a 0-complete partial metric space. Using his idea, we can observe the following:

  1. (a)

    Every Cauchy sequence with respect to Hitzler is a Cauchy sequence with respect to Harandi.

  2. (b)

    Every complete metric space with respect to Harandi is complete with respect to Hitzler. The following example shows that the converse assertions of (a) and (b) do not hold.

Example 1.7 Let X= Q + {0} and let d l :X×XX be defined by d l (x,y)=x+y. Note that { x n }= ( 1 + 1 n ) n is a Cauchy sequence with respect to Harandi, but it is not a Cauchy sequence with respect to Hitzler. Also, every Cauchy sequence (with respect to Hitzler) in X converges to a point ‘0’ in X. Hence X is complete with respect to Hitzler, but X is not complete with respect to Harandi as lim n ( 1 + 1 n ) n =eX.

Definition 1.8 Let X be a nonempty set. Then (X,, d l ) is called an ordered dislocated metric space if (i) d l is a dislocated metric on X and (ii) ⪯ is a partial order on X.

Definition 1.9 Let (X,) be a partial ordered set. Then x,yX are called comparable if xy or yx holds.

Definition 1.10 [39]

Let (X,) be a partially ordered set. A self-mapping f on X is called dominated if fxx for each x in X.

Example 1.11 [39]

Let X=[0,1] be endowed with the usual ordering and f:XX be defined by fx= x n for some nN. Since fx= x n x for all xX, therefore f is a dominated map.

Definition 1.12 Let X be a nonempty set and T,f:XX. A point yX is called a point of coincidence of T and f if there exists a point xX such that y=Tx=fx. The mappings T, f are said to be weakly compatible if they commute at their coincidence point (i.e., Tfx=fTx whenever Tx=fx).

For AX, we denote by D(A) the set of all limit points of A and A ¯ closure of A in X. We state without proof the following simple facts due to [34].

Lemma 1.13 A subset of A of a dislocated metric space is closed if and only if A ¯ =A.

Lemma 1.14 The topology induced by a dislocated metric is a Hausdorff topology.

Lemma 1.15 Every closed ball in a complete dislocated metric space is complete.

We also need the following results for subsequent use.

Lemma 1.16 [40]

Let X be a nonempty set and let f:XX be a function. Then there exists a subset EX such that fE=fX and f:EX is one-to-one.

Lemma 1.17 [1]

Let X be a nonempty set and let the mappings S,T,f:XX have a unique point of coincidence v in X. If (S,f) and (T,f) are weakly compatible, then S, T, f have a unique common fixed point.

Theorem 1.18 [[36], p.303]

Let (X,d) be a complete metric space, let S:XX be a mapping, let r>0 and x 0 be an arbitrary point in X. Suppose that there exists k[0,1) with

d(Sx,Sy)kd(x,y) for all x,yY= B ( x 0 , r ) ¯

and d( x 0 ,S x 0 )<(1k)r. Then there exists a unique point x in B ( x 0 , r ) ¯ such that x =S x .

2 Fixed points of contractive mappings

Theorem 2.1 Let (X,, d l ) be an ordered complete dislocated metric space, let S,T:XX be dominated maps and let x 0 be an arbitrary point in X. Suppose that for k[0,1) and for ST, we have

d l (Sx,Ty)k d l (x,y) for all comparable elements x,y in B ( x 0 , r ) ¯
(2.1)

and

d l ( x 0 ,S x 0 )(1k)r.
(2.2)

If for a non-increasing sequence { x n } in B ( x 0 , r ) ¯ , { x n }u implies that u x n , then there exists x B ( x 0 , r ) ¯ such that d l ( x , x )=0 and x =S x =T x . Also if, for any two points x, y in B ( x 0 , r ) ¯ , there exists a point z B ( x 0 , r ) ¯ such that zx and zy, that is, every pair of elements has a lower bound, then x is a unique common fixed point in B ( x 0 , r ) ¯ .

Proof Choose a point x 1 in X such that x 1 =S x 0 . As S x 0 x 0 , so x 1 x 0 and let x 2 =T x 1 . Now T x 1 x 1 gives x 2 x 1 . Continuing this process, we construct a sequence x n of points in X such that

x 2 i + 1 =S x 2 i , x 2 i + 2 =T x 2 i + 1 and x 2 i + 1 =S x 2 i x 2 i ,where i=0,1,2,.

First we show that x n B ( x 0 , r ) ¯ for all nN. Using inequality (2.2), we have

d l ( x 0 , x 1 )(1k)rr.

It follows that

x 1 B ( x 0 , r ) ¯ .

Let x 2 ,, x j B ( x 0 , r ) ¯ for some jN. If j=2i+1, then x 2 i + 1 x 2 i , where i=0,1,2,, j 1 2 . So, using inequality (2.1), we obtain

d l ( x 2 i + 1 , x 2 i + 2 ) = d l ( S x 2 i , T x 2 i + 1 ) k [ d l ( x 2 i , x 2 i + 1 ) ] k 2 [ d l ( x 2 i 1 , x 2 i ) ] k 2 i + 1 d l ( x 0 , x 1 ) .
(2.3)

If j=2i+2, then as x 1 , x 2 ,, x j B ( x 0 , r ) ¯ and x 2 i + 2 x 2 i + 1 (i=0,1,2,, j 2 2 ). We obtain

d l ( x 2 i + 2 , x 2 i + 3 ) k 2 ( i + 1 ) d l ( x 0 , x 1 ).
(2.4)

Thus from inequalities (2.3) and (2.4), we have

d l ( x j , x j + 1 ) k j d l ( x 0 , x 1 ).
(2.5)

Now

d l ( x 0 , x j + 1 ) d l ( x 0 , x 1 ) + + d l ( x j , x j + 1 ) d l ( x 0 , x 1 ) + + k j d l ( x 0 , x 1 ) (by (2.5)) d l ( x 0 , x 1 ) [ 1 + + k j 1 + k j ] ( 1 k j + 1 ) 1 k d l ( x 0 , x 1 ) ( 1 k j + 1 ) 1 k ( 1 k ) r (by (2.2)) ( 1 k j + 1 ) r r .

Thus x j + 1 B ( x 0 , r ) ¯ . Hence x n B ( x 0 , r ) ¯ for all nN. It implies that

d l ( x n , x n + 1 ) k n d l ( x 0 , x 1 )for all nN.
(2.6)

It implies that

d l ( x n , x n + i ) d l ( x n , x n + 1 ) + + d l ( x n + i 1 , x n + i ) k n d l ( x 0 , x 1 ) + + k n + i 1 d l ( x 0 , x 1 ) (by (2.6)) k n d l ( x 0 , x 1 ) [ 1 + + k i 2 + k i 1 ] k n ( 1 k i ) 1 k d l ( x 0 , x 1 ) 0 as  n .

Notice that the sequence { x n } is a Cauchy sequence in ( B ( x 0 , r ) ¯ , d l ). Therefore there exists a point x B ( x 0 , r ) ¯ with lim n x n = x . Also,

lim n d l ( x n , x ) =0.
(2.7)

Now,

d l ( x , S x ) d l ( x , x 2 n + 2 ) + d l ( x 2 n + 2 , S x ) .

On taking limit as n and using the fact that x x n when x n x , we have

d l ( x , S x ) lim n [ d l ( x , x 2 n + 2 ) + k d l ( x 2 n + 1 , x ) ] .

By equation (2.7), we obtain

d l ( x , S x ) 0,

and hence x =S x . Similarly, by using

d l ( x , T x ) d l ( x , x 2 n + 1 ) + d l ( x 2 n + 1 , T x ) ,

we can show that x =T x . Hence S and T have a common fixed point in B ( x 0 , r ) ¯ . Now,

d l ( x , x ) = d l ( S x , T x ) k d l ( x , x ) .

This implies that

d l ( x , x ) =0.

For uniqueness, assume that y is another fixed point of T and S in B ( x 0 , r ) ¯ . If x and y are comparable, then

d l ( x , y ) = d l ( S x , T y ) k d l ( x , y ) .

This shows that x =y. Now if x and y are not comparable, then there exists a point z 0 B ( x 0 , r ) ¯ such that z 0 x and z 0 y. Choose a point z 1 in X such that z 1 =T z 0 . As T z 0 z 0 , so z 1 z 0 and let z 2 =S z 1 . Now S z 1 z 1 gives z 2 z 1 . Continuing this process and having chosen z n in X such that

z 2 i + 1 =T z 2 i , z 2 i + 2 =S z 2 i + 1 and z 2 i + 1 =T z 2 i z 2 i ,where i=0,1,2,,

we obtain that z n + 1 z n z 0 x . As z 0 x and z 0 y, it follows that z n T x and z n Ty for all nN. We will prove that z n B ( x 0 , r ) ¯ for all nN by using mathematical induction. For n=1,

d l ( x 0 , z 1 ) d l ( x 0 , x 1 ) + d l ( x 1 , z 1 ) ( 1 k ) r + k d l ( x 0 , z 0 ) ( 1 k ) r + k r = r .

It follows that z 1 B ( x 0 , r ) ¯ . Let z 2 , z 3 ,, z j B ( x 0 , r ) ¯ for some jN. Note that if j is odd, then

d l ( x j + 1 , z j + 1 )= d l (T x j ,S z j )k d l ( x j , z j ) k j + 1 d l ( x 0 , z 0 ),

and if j is even, then

d l ( x j + 1 , z j + 1 )= d l (S x j ,T z j )k d l ( x j , z j ) k j + 1 d l ( x 0 , z 0 ).

Now

d l ( x 0 , z j + 1 ) d l ( x 0 , x 1 ) + d l ( x 1 , x 2 ) + + d l ( x j + 1 , z j + 1 ) d l ( x 0 , x 1 ) + k d l ( x 0 , x 1 ) + + k j + 1 d l ( x 0 , z 0 ) d l ( x 0 , x 1 ) [ 1 + k + + k j ] + k j + 1 r ( 1 k ) r ( 1 k j + 1 ) 1 k + k j + 1 r , d l ( x 0 , z j + 1 ) r ,

which implies that

d l ( x j + 1 , z j + 1 )= d l (S x j ,T z j )k d l ( x j , z j ) k j + 1 d l ( x 0 , z 0 ).

Thus z j + 1 B ( x 0 , r ) ¯ . Hence z n B ( x 0 , r ) ¯ for all nN. As z 0 x and z 0 y, it follows that z n T n x , z n S n x , z n S n y and z n T n y for all nN as S n x = T n x = x and S n y= T n y=y for all nN. If n is odd, then

d l ( x , y ) = d l ( T n x , T n y ) d l ( T n x , S z n ) + d l ( S z n , T n y ) k d l ( T n 1 x , z n ) + k d l ( z n , T n 1 y ) = k d l ( S n 1 x , T z n 1 ) + k d l ( T z n 1 , S n 1 y ) k 2 d l ( S n 2 x , z n 1 ) + k 2 d l ( z n 1 , S n 2 y ) k n + 1 d l ( x , z 0 ) + k n + 1 d l ( z 0 , y ) 0 as  n .

So, x =y. Similarly, we can show that x =y if n is even. Hence x is a unique common fixed point of T and S in B ( x 0 , r ) ¯ . □

Theorem 2.1 extends Theorem 1.18 to ordered complete dislocated metric spaces.

Example 2.2 Let X= Q + {0} be endowed with the order ( x 1 , y 1 )( x 2 , y 2 ) if x 1 x 2 , y 1 y 2 . Let S,T: X 2 X 2 be defined by

S(x,y)= { ( x 7 , 3 y 11 ) if  x + y 1 , ( x 1 3 , y 3 8 ) if  x + y > 1

and

T(x,y)= { ( 4 x 15 , 2 y 7 ) if  x + y 1 , ( x 1 4 , y 1 5 ) if  x + y > 1 .

Clearly, S and T are dominated mappings. Let d l : X 2 × X 2 X be defined by d l (( x 1 , y 1 ),( x 2 , y 2 ))= x 1 + y 1 + x 2 + y 2 . Then it is easy to prove that ( X 2 , d l ) is a complete dislocated metric space. Let ( x 0 , y 0 )=( 3 7 , 4 7 ), r=2, then

B ( ( x 0 , y 0 ) , r ) ¯ = { ( x , y ) X : x + y 1 }

with k= 3 10 [0,1),

( 1 k ) r = ( 1 3 10 ) 2 = 7 5 , d l ( ( x 0 , y 0 ) , S ( x 0 , y 0 ) ) = 656 539 < 7 5 .

Also, for all comparable elements ( x 1 , y 1 ),( x 2 , y 2 ) X 2 such that x 1 + y 1 >1 and x 2 + y 2 >1, we have

d l ( S ( x 1 , y 1 ) , T ( x 2 , y 2 ) ) = x 1 1 3 + y 1 3 8 + x 2 1 4 + y 2 1 5 d l ( S ( x 1 , y 1 ) , T ( x 2 , y 2 ) ) 3 10 { x 1 + y 1 + x 2 + y 2 } , d l ( S x , T y ) k d l [ ( x 1 , y 1 ) , ( x 2 , y 2 ) ] .

So, the contractive condition does not hold on X 2 . Now if ( x 1 , y 1 ),( x 2 , y 2 ) B ( ( x 0 , y 0 ) , r ) ¯ , then

d l ( S ( x 1 , y 1 ) , T ( x 2 , y 2 ) ) = x 1 7 + 3 y 1 11 + 4 x 2 15 + 2 y 2 7 3 10 { x 1 + y 1 + x 2 + y 2 } = k d l [ ( x 1 , y 1 ) , ( x 2 , y 2 ) ] .

Therefore, all the conditions of Theorem 2.1 are satisfied. Moreover, (0,0) is the common fixed point of S and T. Also, note that for any metric d on X 2 , the respective condition does not hold on B ( ( x 0 , y 0 ) , r ) ¯ since

d ( S ( 2 5 , 3 5 ) , T ( 2 5 , 3 5 ) ) = d ( ( 2 35 , 9 55 ) , ( 8 75 , 6 35 ) ) > k d ( ( 2 5 , 3 5 ) , ( 2 5 , 3 5 ) ) = 0 for any  k [ 0 , 1 ) .

Moreover, X 2 is not complete for any metric d on X 2 .

Remark 2.3 If we impose a Banach-type contractive condition for a pair of mappings S,T:XX on a metric space (X,d), that is,

d(Sx,Ty)kd(x,y)for all x,yX,

then it follows that Sx=Tx for all xX (that is, S and T are equal). Therefore the above condition fails to find common fixed points of S and T. However, the same condition in a dislocated metric space does not assert that S=T, which is seen in Example 2.2. Hence Theorem 2.1 cannot be obtained from a metric fixed point theorem.

Theorem 2.4 Let (X,, d l ) be an ordered complete dislocated metric space, let S:XX be a dominated map and let x 0 be an arbitrary point in X. Suppose that there exists k[0,1) with

d l (Sx,Sy)k d l (x,y) for all comparable elements x,y in B ( x 0 , r ) ¯

and

d l ( x 0 ,S x 0 )(1k)r.

If, for a non-increasing sequence { x n } in B ( x 0 , r ) ¯ , { x n }u implies that u x n , and also, for any two points x, y in B ( x 0 , r ) ¯ , there exists a point z B ( x 0 , r ) ¯ such that every pair of elements has a lower bound, then there exists a unique fixed point x of S in B ( x 0 , r ) ¯ . Further, d l ( x , x )=0.

Proof By following similar arguments to those we have used to prove Theorem 2.1, one can easily prove the existence of a unique fixed point x of S in B ( x 0 , r ) ¯ . □

In Theorem 2.1, condition (2.2) is imposed to restrict condition (2.1) only for x, y in B ( x 0 , r ) ¯ and Example 2.2 explains the utility of this restriction. However, the following result relaxes condition (2.2) but imposes condition (2.1) for all comparable elements in the whole space X.

Theorem 2.5 Let (X,, d l ) be an ordered complete dislocated metric space, let S,T:XX be the dominated map and let x 0 be an arbitrary point in X. Suppose that for k[0,1) and for ST, we have

d l (Sx,Ty)k d l (x,y) for all comparable elements x,y in X.

Also, if for a non-increasing sequence { x n } in X, { x n }u implies that u x n , and for any two points x, y in X, there exists a point zX such that zx and zy, then there exists a unique point x in X such that x =S x =T x . Further, d l ( x , x )=0.

In Theorem 2.1, the condition ‘for a non-increasing sequence, { x n }u implies that u x n ’ and the existence of z or a lower bound is imposed to restrict condition (2.1) only for comparable elements. However, the following result relaxes these restrictions but imposes condition (2.1) for all elements in B ( x 0 , r ) ¯ . In Theorem 2.1, it may happen that S has more fixed points, but these fixed points of S are not the fixed points of T, because a common fixed point of S and T is unique, whereas without order we can obtain a unique fixed point of S and T separately, which is proved in the following theorem.

Theorem 2.6 Let (X, d l ) be a complete dislocated metric space, let S,T:XX be self-maps and let x 0 be an arbitrary point in X. Suppose that for k[0,1) and for ST, we have

d l (Sx,Ty)k d l (x,y) for all elements x,y in B ( x 0 , r ) ¯

and

d l ( x 0 ,S x 0 )(1k)r.

Then there exists a unique x B ( x 0 , r ) ¯ such that d l ( x , x )=0 and x =S x =T x . Further, S and T have no fixed point other than x .

Proof By Theorem 2.1, x =S x =T x . Let y be another point such that y=Ty. Then

d l ( x , y ) = d l ( S x , T y ) k d l ( x , y ) .

This shows that x =y. Thus T has no fixed point other than x . Similarly, S has no fixed point other than x . □

Now we apply our Theorem 2.1 to obtain a unique common fixed point of three mappings on a closed ball in an ordered complete dislocated metric space.

Theorem 2.7 Let (X,, d l ) be an ordered dislocated metric space, let S, T be self-mappings and let f be a dominated mapping on X such that SXTXfX, Txfx, Sxfx, and let x 0 be an arbitrary point in X. Suppose that for k[0,1) and for ST, we have

d l (Sx,Ty)k d l (fx,fy)
(2.8)

for all comparable elements fx,fy B ( f x 0 , r ) ¯ fX; and

d l (f x 0 ,T x 0 )(1k)r.
(2.9)

If for a non-increasing sequence, { x n }u implies that u x n , and for any two points z and x in B ( f x 0 , r ) ¯ , there exists a point y B ( f x 0 , r ) ¯ such that yz and yx, that is, every pair of elements in B ( f x 0 , r ) ¯ has a lower bound in B ( f x 0 , r ) ¯ ; if fX is a complete subspace of X and (S,f) and (T,f) are weakly compatible, then S, T and f have a unique common fixed point fz in B ( f x 0 , r ) ¯ . Also, d l (fz,fz)=0.

Proof By Lemma 1.16, there exists EX such that fE=fX and f:EX is one-to-one. Now, since SXTXfX, we define two mappings g,h:fEfE by g(fx)=Sx and h(fx)=Tx, respectively. Since f is one-to-one on E, then g, h are well defined. As Sxfx implies that g(fx)fx and Txfx implies that h(fx)fx, therefore g and h are dominated maps. Now f x 0 B ( f x 0 , r ) ¯ fX. Then f x 0 fX. Let y 0 =f x 0 , choose a point y 1 in fX such that y 1 =h( y 0 ). As h( y 0 ) y 0 , so y 1 y 0 and let y 2 =g( y 1 ). Now g( y 1 ) y 1 gives y 2 y 1 . Continuing this process and having chosen y n in fX such that

y 2 i + 1 =h( y 2 i )and y 2 i + 2 =g( y 2 i + 1 ),where i=0,1,2,,

then y n + 1 y n for all nN. Following similar arguments of Theorem 2.1, y n B ( f x 0 , r ) ¯ . Also, by inequality (2.9),

d l ( f x 0 , h ( f x 0 ) ) (1k)r.

Note that for fx,fy B ( f x 0 , r ) ¯ , where fx, fy are comparable. Then by using inequality (2.8), we have

d l ( g ( f x ) , h ( f y ) ) k d l (fx,fy).

As fX is a complete space, all the conditions of Theorem 2.1 are satisfied, we deduce that there exists a unique common fixed point fz B ( f x 0 , r ) ¯ of g and h. Also, d l (fz,fz)=0. Now fz=g(fz)=h(fz) or fz=Sz=Tz=fz. Thus fz is the point of coincidence of S, T and f. Let v B ( f x 0 , r ) ¯ be another point of coincidence of f, S and T, then there exists u B ( f x 0 , r ) ¯ such that v=fu=Su=Tu, which implies that fu=g(fu)=h(fu), a contradiction as fz B ( f x 0 , r ) ¯ is a unique common fixed point of g and h. Hence v=fz. Thus S, T and f have a unique point of coincidence fz B ( f x 0 , r ) ¯ . Now, since (S,f) and (T,f) are weakly compatible, by Lemma 1.17 fz is a unique common fixed point of S, T and f. □

In a similar way, we can apply our Theorems 2.5 and 2.6 to obtain a unique common fixed point of three mappings in an ordered complete dislocated metric space and a unique common fixed point of three mappings on a closed ball in a complete dislocated metric space, respectively.

In the following theorem, we use Theorem 2.6 to establish the existence of a unique common fixed point of four mappings on a closed ball in a complete dislocated metric space. One cannot prove the following theorem for an ordered dislocated metric space in a way similar to that of Theorem 2.7. In order to prove the unique common fixed point of four mappings on a closed ball in an ordered dislocated metric space, we should prove that S and T have no fixed point other than x in Theorem 2.1.

Theorem 2.8 Let (X, d l ) be a dislocated metric space and let S, T, g and f be self-mappings on X such that SX,TXfX=gX. Assume that for x 0 , an arbitrary point in X, and for k[0,1) and for ST, the following conditions hold:

d l (Sx,Ty)k d l (fx,gy)
(2.10)

for all elements fx,gy B ( f x 0 , r ) ¯ fX; and

d l (f x 0 ,S x 0 )(1k)r.
(2.11)

If fX is a complete subspace of X, then there exists fzX such that d l (fz,fz)=0. Also, if (S,f) and (T,g) are weakly compatible, then S, T, f and g have a unique common fixed point fz in B ( f x 0 , r ) ¯ .

Proof By Lemma 1.16, there exist E 1 , E 2 X such that f E 1 =fX=gX=g E 2 , f: E 1 X, g: E 2 X are one-to-one. Now define the mappings A,B:f E 1 f E 1 by A(fx)=Sx and B(gx)=Tx, respectively. Since f, g are one-to-one on E 1 and E 2 , respectively, then the mappings A, B are well defined. As fX is a complete space, all the conditions of Theorem 2.6 are satisfied, we deduce that there exists a unique common fixed point fz B ( f x 0 , r ) ¯ of A and B. Further, A and B have no fixed point other than fz. Also, d l (fz,fz)=0. Now fz=A(fz)=B(fz) or fz=Sz=fz. Thus fz is a point of coincidence of f and S. Let w B ( f x 0 , r ) ¯ be another point of coincidence of S and f, then there exists u B ( f x 0 , r ) ¯ such that w=fu=Su, which implies that fu=A(fu), a contradiction as fz B ( f x 0 , r ) ¯ is a unique fixed point of A. Hence w=fz. Thus S and f have a unique point of coincidence fz B ( f x 0 , r ) ¯ . Since (S,f) are weakly compatible, by Lemma 1.17 fz is a unique common fixed point of S and f. As fX=gX, then there exists vX such that fz=gv. Now, as A(fz)=B(fz)=fzA(gv)=B(gv)=gvTv=gv, thus gv is the point of coincidence of T and g. Now, if Tx=gxB(gx)=gx, a contradiction. This implies that gv=gx. As (T,g) are weakly compatible, we obtain gv, a unique common fixed point for T and g. But gv=fz. Thus S, T, g and f have a unique common fixed point fz B ( f x 0 , r ) ¯ . □

Corollary 2.9 Let (X,, d l ) be an ordered dislocated metric space, let S, T be self-mappings and let f be a dominated mapping on X such that SXTXfX, Txfx, Sxfx, and let x 0 be an arbitrary point in X. Suppose that for k[0,1) and for ST, we have

d l (Sx,Ty)k d l (fx,fy)

for all comparable elements fx,fy B ( f x 0 , r ) ¯ fX; and

d l (f x 0 ,T x 0 )(1k)r.

If for a non-increasing sequence, { x n }u implies that u x n , and for any two points z and x in B ( f x 0 , r ) ¯ , there exists a point y B ( f x 0 , r ) ¯ such that yz and yx; if fX is a complete subspace of X, then S, T and f have a unique point of coincidence fz B ( f x 0 , r ) ¯ . Also, d l (fz,fz)=0.

In a similar way, we can obtain a coincidence point result of four mappings as a corollary of Theorem 2.8.

A partial metric version of Theorem 2.1 is given below.

Theorem 2.10 Let (X,,p) be an ordered complete partial metric space, let S,T:XX be dominated maps and let x 0 be an arbitrary point in X. Suppose that for k[0,1) and for ST,

p(Sx,Ty)kp(x,y) for all comparable elements x,y in B ( x 0 , r ) ¯

and

p( x 0 ,S x 0 )(1k) [ r + p ( x 0 , x 0 ) ] .

Then there exists x B ( x 0 , r ) ¯ such that p( x , x )=0. Also, if for a non-increasing sequence { x n } in B ( x 0 , r ) ¯ , { x n }u implies that u x n , and for any two points x, y in B ( x 0 , r ) ¯ , there exists a point z B ( x 0 , r ) ¯ such that zx and zy, then there exists a unique point x in B ( x 0 , r ) ¯ such that x =S x =T x .

A partial metric version of Theorem 2.7 is given below.

Theorem 2.11 Let (X,,p) be an ordered partial metric space, let S, T be self-mappings and let f be a dominated mapping on X such that SXTXfX and Tx,Sxfx. Assume that for x 0 , an arbitrary point in X, and for k[0,1) and for ST, the following conditions hold:

p(Sx,Ty)kp(fx,fy)

for all comparable elements fx,fy B ( f x 0 , r ) ¯ fX; and

p(f x 0 ,T x 0 )(1k) [ r + p ( f x 0 , f x 0 ) ] .

If for a non-increasing sequence, { x n }u implies that u x n , also for any two points z and x in B ( f x 0 , r ) ¯ , there exists a point y B ( f x 0 , r ) ¯ such that yz and yx; if fX is complete subspace of X and (S,f) and (T,f) are weakly compatible, then S, T and f have a unique common fixed point fz in B ( f x 0 , r ) ¯ . Also, p(fz,fz)=0.

Remark 2.12 We can obtain a partial metric version as well as a metric version of other theorems in a similar way.