1 Introduction and preliminaries

Let (X,ρ) be a complete metric space. A map T:XX, such that for some constant λ(0,1) and for every x,yX, there is the inequality

ρ(Tx,Ty)λmax { ρ ( x , y ) , ρ ( x , T x ) , ρ ( y , T y ) , ρ ( x , T y ) , ρ ( y , T x ) } ,
(1.1)

is called a quasicontraction. Let us remark that Ćirić [1] (see also [2, 3]) introduced and studied quasicontractions as one of the most general types of contractive maps. The well-known Ćirić result is that every quasicontraction T possesses a unique fixed point.

There exist many generalizations of the concept of metric spaces in the literature. In particular, Matthews [4] introduced the notion of partial metric space as a part of the study of denotational semantics of dataflow networks, showing that the Banach contraction mapping theorem can be generalized to the partial metric context for applications in program verification. After that, fixed point results in partial metric spaces have been studied by many other authors.

References [531] are some works in this line of research. The existence of several connections between partial metrics and topological aspects of domain theory were pointed out in, e.g., [11, 24, 3234].

In this paper we study fixed point results about certain extensions of the notion of Ćirić quasicontraction to the setting of partial metric spaces, and we give some generalized versions of the fixed point theorem of Matthews as well as the main result of Ilić et al. [35]. The theory is illustrated by some examples.

Throughout this paper, the letters ℝ, R + , ℚ, ℕ denote the sets of real numbers, nonnegative real numbers, rational numbers and positive integers, respectively.

Let us recall [4] that a mapping p:X×X R + , where X is a nonempty set, is said to be a partial metric on X if for any x,y,zX, the following four conditions hold true:

  1. (P1)

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

  2. (P2)

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

  3. (P3)

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

  4. (P4)

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

The pair (X,p) is then called a partial metric space. A sequence { x m } m = 0 of elements of X is called p-Cauchy if the limit lim m , n p( x n , x m ) exists and is finite. The partial metric space (X,p) is called complete if for each p-Cauchy sequence { x m } m = 0 , there is some zX such that

p(z,z)= lim n p(z, x n )= lim n , m p( x n , x m ).
(1.2)

If (X,p) is a partial metric space, then p s (x,y)=2p(x,y)p(x,x)p(y,y), x,yX, is a metric on X, { x n } n 1 converges to zX with respect to p s if and only if (1.2) holds, and (X,p) is a complete partial metric space if and only if (X, p s ) is a complete metric space (see [4, 21]).

A sequence x n in a partial metric space (X,p) is called 0-Cauchy [27] if lim m , n p( x n , x m )=0. We say that (X,p) is 0-complete if every 0-Cauchy sequence in X converges, with respect to p, to a point xX such that p(x,x)=0. Note that every 0-Cauchy sequence in (X,p) is Cauchy in (X, p s ), and that every complete partial metric space is 0-complete. A paradigm for partial metric spaces is the pair (X,p) where X=Q[0,+) and p(x,y)=max{x,y} for x,y0, which provides an example of a 0-complete partial metric space which is not complete.

2 Auxiliary results

In this section we define three extensions of the notion of Ćirić quasicontraction to the context partial metric spaces and establish a few auxiliary results that will be used in the next, main section.

Definition 2.1 Let (X,p) be a partial metric space and T:XX be a mapping. If for some α[0,1) and all x,yX, there holds

p(Tx,Ty)max { α M ( x , y ) , p ( x , x ) , p ( y , y ) } ,
(2.1)

where M(x,y):=max{p(x,Tx),p(x,Ty),p(x,y),p(Tx,y),p(y,Ty)}, then we shall say that T is a p 1 -quasicontraction. If for all x,yX, the stronger condition

p(Tx,Ty)max { α M ( x , y ) , p ( x , x ) + p ( y , y ) 2 }
(2.2)

is satisfied, we shall call T a p 2 -quasicontraction. If the even stronger condition

p(Tx,Ty)αM(x,y)
(2.3)

holds for all x,yX, then we shall say that T is a p-quasicontraction.

Lemma 2.1 Let (X,p) be a partial metric space, T:XX be a p 1 -quasicontraction, xX and n, m and k be integers such that mnk1.

If p( T n x, T m x)>p( T i x, T i x) for all i{nk,,n1}{mk,,m1}, then for some i 0 , j 0 {nk,,m}, there must hold

p ( T n x , T m x ) α k p ( T i 0 x , T j 0 x ) .

Proof This is an easy induction on k. For k=1 this follows from (2.1) and the assumptions made. Now suppose that the assertion holds for some k1 and all mnk, and let m,nk+1 be such that we have p( T n x, T m x)>p( T i x, T i x) for all i{n(k+1),,n1}{m(k+1),,m1}.

From p( T n x, T m x)>max{p( T n 1 x, T n 1 x),p( T m 1 x, T m 1 x)} and (2.1) we see that there must hold p( T n x, T m x)αp( T n 1 x, T m 1 x) for some ( n 1 , m 1 ){(n1,n),(m1,m),(n1,m1),(n1,m),(n,m1)} if n<m, or for some ( n 1 , m 1 ){(n1,n),(n1,n1)} if n=m; in either case, we have m 1 n 1 n1k.

There cannot be any i{ n 1 k,, n 1 1}{ m 1 k,, m 1 1}{n(k+1),,n1}{m(k+1),,m1} such that p( T n 1 x, T m 1 x)p( T i x, T i x) because this would imply p( T n x, T m x)p( T i x, T i x). Thus, by the induction hypothesis, there are i 0 , j 0 { n 1 k,, m 1 }{n(k+1),,m} such that p( T n 1 x, T m 1 x) α k p( T i 0 x, T j 0 x), whence p( T n x, T m x) α k + 1 p( T i 0 x, T j 0 x). □

Lemma 2.2 Let (X,p) be a partial metric space, T:XX be a p 1 -quasicontraction, xX and N x := 1 ( 1 α ) p(x,Tx)+p(x,x). Then

  1. (1)

    for all i,j0, there holds

    p ( T i x , T j x ) N x ,
    (2.4)
  2. (2)

    if we put S x := sup i 0 p( T i x, T i x), then for some i0 we have

    p ( T i x , T i x ) = S x .
    (2.5)

Proof (1) Fix m1 and put d:=max{p( T i x, T j x):0i,jm}.

It is easy to see that there must be some i{0,1,,m} with d=p(x, T i x). Indeed, take any i,j{0,1,,m} such that d=p( T i x, T j x). If 0{i,j}, we are done. Otherwise i,j1, so p( T i x, T j x)max{αp( T i 1 x, T j 1 x),p( T i 1 x, T i 1 x),p( T j 1 x, T j 1 x)} for some i 1 , j 1 {0,1,,m}. Therefore either dαp( T i 1 x, T j 1 x)αd, i.e., d=0=p(x, T k x) for any 0km, or dmax{p( T i 1 x, T i 1 x),p( T j 1 x, T j 1 x)}d, thus d{p(x, T i 1 x),p(x, T j 1 x)}.

Now take any i 0 {0,1,,m} such that d=p(x, T i 0 x). If i 0 =0, then d N x follows trivially. If i 0 1, then for some i 1 , i 2 {0,1,,m},

d = p ( x , T i 0 x ) p ( x , T x ) + p ( T x , T i 0 x ) p ( x , T x ) + max { α p ( T i 1 x , T i 2 x ) , p ( x , x ) , p ( T i 0 1 x , T i 0 1 x ) } ,

so dp(x,Tx)+max{αd,p( T l x, T l x)}, where l is the least integer such that 0lm and p( T l x, T l x)=max{p( T i x, T i x):0im}. So it must either be d d ( x , T x ) 1 α N x or dp(x,Tx)+p( T l x, T l x). The latter possibility in the case l=0 gives d N x directly, and if l1, then, since the minimality of l implies p( T l x, T l x)>p( T l 1 x, T l 1 x), we must have for some j 1 , j 2 {l1,l} that dp(x,Tx)+αp( T j 1 x, T j 2 x)p(x,Tx)+αd and again d N x .

(2) By part (1) we have S x <. If S x =0, then there is nothing to prove. Thus let S x >0. Suppose to the contrary that for all i0,

p ( T i x , T i x ) < S x .
(2.6)

Take kN such that α k N x < S x 2 and i 0 N such that p( T i 0 x, T i 0 x)> S x 2 . By (2.6) we may assume that i 0 k. Also by (2.6) there must be some nN such that n> i 0 and p( T n x, T n x)>p( T i x, T i x) for all 0i i 0 . Denote by n 0 the least such integer.

Since p( T n 0 x, T n 0 x)>p( T i x, T i x) for all 0i< n 0 and since n 0 k, Lemma 2.1 implies that for some j 1 , j 2 n 0 k, we have p( T n 0 x, T n 0 x) α k p( T j 1 x, T j 2 x) α k N x < S x 2 . But S x 2 <p( T i 0 x, T i 0 x)<p( T n 0 x, T n 0 x), a contradiction. □

Lemma 2.3 Let (X,p) be a partial metric space, T:XX be a p 1 -quasicontraction, xX and r x := lim sup i p( T i x, T i x). Then

lim n , m p ( T n x , T m x ) = r x .
(2.7)

Proof Notice first that r x < by Lemma 2.2. The lemma easily follows from the following two claims:

  1. (1)

    for each ϵ>0, there is some kN such that for all n,mk, we have p( T n x, T m x)< r x +ϵ;

and

  1. (2)

    if r x >0, then

    p ( T i x , T i x ) p ( T i + 1 x , T i + 1 x )  holds for all but finitely many i0.
    (2.8)

To prove (1), fix any ϵ>0. From r x = lim sup i p( T i x, T i x)< r x +ϵ, we see that there is some k 0 N such that α k 0 N x < r x +ϵ and such that for all i k 0 we have p( T i x, T i x)< r x +ϵ.

Let mn2 k 0 . If p( T n x, T m x)p( T i x, T i x) for some i k 0 , then p( T n x, T m x)< r x +ϵ. Otherwise, as n k 0 k 0 , by Lemma 2.1 there are i 0 , j 0 n k 0 such that p( T n x, T m x) α k 0 p( T i 0 x, T j 0 x) α k 0 N x < r x +ϵ.

To prove (2) suppose r x >0. Take any positive ϵ< r x ( 1 α ) α and let kN be as claimed to exist in (1). We will show that for any nk, it must be that p( T n x, T n x)=max{p( T i x, T i x)in}. Indeed, suppose that for some nk this were not true. By (2) of Lemma 2.2, there is an integer l such that ln and p( T l x, T l x)=max{p( T i x, T i x)in}. Let m be the least such integer. Then by our assumption m1n, so, by the choice of m, we must have p( T m x, T m x)>p( T m 1 x, T m 1 x). Hence p( T m x, T m x)αp( T m 1 x, T m x)α( r x +ϵ). Since by definition of r x and m it must be r x p( T m x, T m x), the last inequality now yields r x α( r x +ϵ), i.e., r x ( 1 α ) α ϵ, a contradiction. □

Lemma 2.4 Let (X,p) be a partial metric space, T:XX be a p 1 -quasicontraction and x,yX be such that

lim n , m p ( T n x , T m x ) = lim n p ( y , T n x ) =p(y,y).

Then p(y,y)=p(y,Ty).

Proof Denote δ n :=p(y, T n x)p( T n x, T n x) and θ n :=p(y, T n 1 x)p(y,y) and notice that

p ( y , T y ) δ n + p ( T n x , T y ) δ n + max { α p ( T n 1 x , T y ) , α p ( T n x , y ) , α p ( T n 1 x , y ) , α p ( T n 1 x , T n x ) , α p ( y , T y ) , p ( T n 1 x , T n 1 x ) , p ( y , y ) }

implies, using p( T n 1 x,Ty) θ n +p(y,Ty), that

p ( y , T y ) δ n ( 1 α ) + max { α ( 1 α ) θ n , α p ( T n x , y ) , α p ( T n 1 x , y ) , α p ( T n 1 x , T n x ) , p ( T n 1 x , T n 1 x ) , p ( y , y ) } .

Now simply take the limit as n in the above inequality. □

3 Main results

In this paper we study three extensions of Ćirić quasicontraction to a partial metric space. For such mappings, we prove fixed point theorems. Among other things, we generalize a recent result of Altun, Sola and Simsek, and we give some generalized versions of the fixed point theorem of Matthews, and the main result of Ćirić is also recovered. The theory is illustrated by some examples.

Theorem 3.1 Let (X,p) be a complete partial metric space and T:XX be a p 1 -quasicontraction. Then

  1. (1)

    for each xX, the sequence { T n x } n 1 converges with respect to p s to some point x ˙ such that p( x ˙ , x ˙ )=p( x ˙ ,T x ˙ );

  2. (2)

    there is some uX such that u=Tu and p(u,u)= inf x X p( x ˙ , x ˙ ).

Proof By Lemmas 2.3 and 2.4 and completeness of (X,p), for each xX, there must be some x ˙ X with p( x ˙ , x ˙ )=p( x ˙ ,T x ˙ ) such that

p( x ˙ , x ˙ )= lim n p ( x ˙ , T n x ) = lim n , m p ( T n x , T m x ) = r x .

Also notice that we must have

p ( T n x , T n x ) r x for all but finitely many n.
(3.1)

Denote I:= inf x X r x = inf x X p( x ˙ , x ˙ ). Using the construction described bellow, we will find a specific uX such that p(u,u)=p(u,Tu)=I and later on we prove that we must actually have Tu=u for that particular point u. This will complete the proof.

Use (2.7) and (3.1) to find for each nN some x n X and i n N such that

{ p ( T i n 1 x n , T i n 1 x n ) , p ( T i n 1 x n , T i n x n ) , p ( T i n x n , T i n x n ) , p ( T i n x n , T i n + 1 x n ) } [ I , I + 1 n ) .
(3.2)

Set δ n , m :=[p( T i n x n , T i n + 1 x n )p( T i n + 1 x n , T i n + 1 x n )]+[p( T i m x m , T i m + 1 x m )p( T i m + 1 x m , T i m + 1 x m )] and θ n :=p( T i n x n , T i n + 1 x n )p( T i n x n , T i n x n ).

Now

p ( T i n x n , T i m x m ) δ n , m + p ( T i n + 1 x n , T i m + 1 x m ) δ n , m + max { α p ( T i n x n , T i m + 1 x m ) , α p ( T i n + 1 x n , T i m x m ) , α p ( T i n x n , T i m x m ) , α p ( T i n x n , T i n + 1 x n ) , α p ( T i m x m , T i m + 1 x m ) , p ( T i n x n , T i n x n ) , p ( T i m x m , T i m x m ) }

gives, using p( T i n x n , T i m + 1 x m )p( T i n x n , T i m x m )+ θ m and similarly p( T i m x m , T i n + 1 x n )p( T i m x m , T i n x n + θ n ),

I p ( T i n x n , T i n x n ) p ( T i n x n , T i m x m ) δ n , m 1 α + max { α θ m 1 α , α θ n 1 α , I + 1 min { n , m } } .

So lim n , m p( T i n x n , T i m x m )=I, and thus there is some uX such that

p(u,u)= lim n , m p ( T i n x n , T i m x m ) = lim n p ( u , T i n x n ) =I= inf x X r x .
(3.3)

Let us show that

p(u,u)=p(u,Tu).
(3.4)

Set λ n :=p(u, T i n x n )p( T i n x n , T i n x n ) and μ n :=p(u, T i n 1 x n )p(u,u). From

p ( u , T u ) λ n + p ( T i n x n , T u ) λ n + max { α p ( T i n 1 x n , T u ) , α p ( T i n x n , u ) , α p ( T i n 1 x n , u ) , α p ( T i n 1 x n , T i n x n ) , α p ( u , T u ) , p ( T i n 1 x n , T i n 1 x n ) , p ( u , u ) }

it follows, using p( T i n 1 x n ,Tu)p(u,Tu)+ μ n , that

p ( u , T u ) λ n 1 α + max { α μ n 1 α , α p ( T i n x n , u ) , α p ( T i n 1 x n , u ) , α p ( T i n 1 x n , T i n x n ) , p ( T i n 1 x n , T i n 1 x n ) , p ( u , u ) } ,

so we must have p(u,Tu)p(u,u).

We now prove by induction on nN{0} that

lim k p ( T i k x k , T n u ) =p(u,u)=I.
(3.5)

For n=0, this is just (3.3).

Now suppose that (3.5) holds for some n0. We have

I p ( T i m x m , T n + 1 u ) max { α p ( T i m 1 x m , T n + 1 u ) , α p ( T i m x m , T n u ) , α p ( T i m 1 x m , T n u ) , α p ( T i m 1 x m , T i m x m ) , α p ( T n u , T n + 1 u ) , p ( T i m 1 x m , T i m 1 x m ) , p ( T n u , T n u ) } .

From this, using

p ( T i m 1 x m , T n + 1 u ) p ( T i m x m , T n + 1 u ) + [ p ( T i m x m , T i m 1 x m ) p ( T i m x m , T i m x m ) ] p ( T i m x m , T n + 1 u ) + 1 m (here we recall (3.2))

and

p ( T i m 1 x m , T n u ) p ( T i m x m , T n u ) + [ p ( T i m x m , T i m 1 x m ) p ( T i m x m , T i m x m ) ] p ( T i m x m , T n u ) + 1 m

and

p ( T n u , T n + 1 u ) p ( T i m x m , T n + 1 u ) + [ p ( T n u , T i m x m ) p ( T i m x m , T i m x m ) ]

and

p ( T n u , T n u ) p ( u , u ) , which follows after taking the limit as  k  in p ( T n u , T n u ) 2 p ( T n u , T i k x k ) p ( T i k x k , T i k x k ) ,

we deduce that

I p ( T i m x m , T n + 1 u ) max { α ( 1 α ) m , α [ p ( T i m x m , T n u ) + 1 m ] , α ( 1 α ) [ p ( T i m x m , T n u ) p ( T i m x m , T i m x m ) ] , I + 1 m , p ( u , u ) } .

The last inequality, in view of the induction hypothesis and (3.3), immediately gives

lim m p ( T i m x m , T n + 1 u ) =p(u,u)=I.

We finally prove Tu=u. By (3.4) we only need to show p(Tu,Tu)=p(u,u). For a proof by contradiction, assume this is not the case. Then p(Tu,Tu)<p(u,u)=I.

Set y:=Tu. By (3.1) and r y I, there must be some j0 such that p( T j y, T j y)I. Let m be the least such j. By our assumption, we must have m1. Then p( T j y, T j y)<p( T m y, T m y) for all 0j<m. Thus by Lemma 2.1 there must be some i,j{0,1,,m} such that p( T m y, T m y) α m p( T i y, T j y). So

Ip ( T m y , T m y ) α m p ( T i + 1 u , T j + 1 u ) .

We have p( T i + 1 u, T j + 1 u)I, which follows by (3.3) and (3.5) after taking the limit as n in p( T i + 1 u, T j + 1 u)p( T i + 1 u, T i n x n )+p( T i n x n , T j + 1 u)p( T i n x n , T i n x n ). But m1 now yields IαI, i.e., 0=I>p(Tu,Tu), a contradiction. □

Theorem 3.2 Let (X,p) be a complete partial metric space and T:XX be a p 2 -quasicontraction. Then there is a unique fixed point uX of T. For each xX, the sequence { T n x } n 1 converges with respect to p s to some point x ˙ such that p( x ˙ , x ˙ )=p( x ˙ ,T x ˙ ), and there is the equality p(u,u)= inf x X p( x ˙ , x ˙ ).

Proof By Theorem 3.1 it remains to verify the uniqueness of the fixed point, so let u,vX be such that Tu=u and Tv=v. By (2.2) we have

p(u,v)=p(Tu,Tv)max { α p ( u , v ) , p ( u , u ) + p ( v , v ) 2 } .

Hence either p(u,v)=0 or 02p(u,v)p(u,u)p(v,v)= p s (u,v) and the assertion follows. □

Theorem 3.3 Let (X,p) be a 0-complete partial metric space and T:XX be a p-quasicontraction. Then there is a unique fixed point uX of T. Furthermore, we have p(u,u)=0 and for each xX the sequence { T n x } n 1 converges to u with respect to p s .

Proof By Lemma 2.3 we have lim n , m p( T n x, T m x)= r x . Also r x < by Lemma 2.2.

If we had r x >0, then there would be some positive ϵ< r x ( 1 α ) 1 + α and nN such that p( T i x, T j x)( r x ϵ, r x +ϵ) for all i,j{n1,n}. Thus by (2.3) there would be some i,j{n1,n} such that

r x ϵ<p ( T n x , T n x ) αp ( T i x , T j x ) α( r x +ϵ),

i.e., r x ( 1 α ) 1 + α <ϵ, a contradiction.

So r x =0 and thus by 0-completeness of (X,p) there is some uX such that lim n , m p( T n x, T m x)= lim n p(u, T n x)=p(u,u)=0. But by Lemma 2.4 we have p(u,Tu)=p(u,u)=0 so Tu=u. The argument for uniqueness of the fixed point is standard. □

Remark 3.1 Recently a very interesting paper by Haghi, Rezapour and Shahzad [36] showed up in which the authors associated to each partial metric space (X,p) a metric space (X,d) by setting d(x,x)=0 and d(x,y)=p(x,y) if xy and proved that (X,p) is 0-complete if and only if (X,d) is complete. They then proceeded to demonstrate how using the associated metric d some of the fixed point results in partial metric spaces can easily be deduced from the corresponding known results in metric spaces.

Let us point out that these considerations can apply neither to p 1 -quasicontractions nor to p 2 -quasicontractions, since the terms p(x,x) and p(y,y) on the right-hand side of (2.1) and 1 2 (p(x,x)+p(y,y)) on the right-hand side of (2.2) do not get multiplied by α. Thus Theorems 3.1 and 3.2 cannot follow from the result of Ćirić they generalize.

On the other hand, using the approach of Haghi, Rezapour and Shahzad, we now show how Theorem 3.3 can be directly deduced from Ćirić’s result [1].

Given the assumptions of Theorem 3.3, let d be defined as said above. So (X,d) is a complete metric space (see Proposition 2.1 of [36]). Observe that we have d(x,y)p(x,y) for all x,yX. For x,yX, set

S(x,y)= { ( x , y ) , ( x , T x ) , ( x , T y ) , ( y , T y ) , ( y , T x ) }

and also M p (x,y)=max{p(a,b)(a,b)S(x,y)} and M d (x,y)=max{d(a,b)(a,b)S(x,y)}. We thus have that

p(Tx,Ty)α M p (x,y)

for all x,yX. We check that for all x,yX it holds d(Tx,Ty)α M d (x,y), so that the main result from [1] can immediately be applied. Since in the case x=y the inequality trivially holds, suppose xy. So p(x,y)=d(x,y).

Since d(Tx,Ty)p(Tx,Ty)α M p (x,y), it suffices to show that M p (x,y) M d (x,y). Let (c,e)S(x,y) be such that M p (x,y)=p(c,e). If ce, then M p (x,y)=p(c,e)=d(c,e) M d (x,y). If c=e, then, since c{x,y}, it follows that M p (x,y)=p(c,c)max{p(x,x),p(y,y)}p(x,y)=d(x,y) M d (x,y).

Remark 3.2 Even though the results of Haghi et al. can deduce the same fixed point as the corresponding partial metric fixed point result, using the partial metric version computers evaluate faster since many nonsense terms are omitted. This is very important in computer science due to its cost and explains the vast body of partial metric fixed point results found in literature.

Now we give corollaries of the above theorems.

Corollary 3.1 ([35])

Let (X,p) be a complete partial metric space, α[0,1) and T:XX be a given mapping. Suppose that for each x,yX, the following condition holds:

p(Tx,Ty)max { α p ( x , y ) , p ( x , x ) , p ( y , y ) } .
(3.6)

Then

  1. (1)

    the set X p :={xXp(x,x)= inf y X p(y,y)} is nonempty;

  2. (2)

    there is a unique u X p such that Tu=u;

  3. (3)

    for each x X p , the sequence { T n x } n 1 converges with respect to the metric p s to u.

Proof Put ρ p := inf x X p(x,x) and I:= inf x X p( x ˙ , x ˙ ). Note that (3.6) implies p(Tx,Tx)p(x,x) for all xX. So, from p( x ˙ , x ˙ )= lim n p( T n x, T n x) and p( T n + 1 x, T n + 1 x)p( T n x, T n x), n0, we see that p( x ˙ , x ˙ )p( T 0 x, T 0 x)=p(x,x). Thus ρ p =I. By Theorem 3.1, there is some uX with Tu=u and p(u,u)= ρ p . This means that u X p . Now let x X p be arbitrary. Since ρ p p( x ˙ , x ˙ )p( T n x, T n x)p(x,x)= ρ p , for all nN, we have p( x ˙ , x ˙ )=p( T n x, T n x)= ρ p =p(u,u), and so lim n , m p( T n x, T m x)=p(u,u). Also, from p(u, T n + 1 x){αp(u, T n x), ρ p } using p(u, T n x)p(u, T n + 1 x)+p( T n + 1 x, T n x)p( T n + 1 x, T n + 1 x), it follows

ρ p p ( u , T n + 1 x ) { α 1 α [ p ( T n + 1 x , T n x ) p ( T n + 1 x , T n + 1 x ) ] , ρ p } .

Hence lim n p(u, T n x)= ρ p =p(u,u).

Finally, if v X p is a fixed point, then by the preceding discussion p(u,u)= lim n p( T n v, T n v)= lim n p(u, T n v), i.e., p(u,u)=p(v,v)=p(u,v) so u=v. □

Corollary 3.2 Let (X,p) be a complete partial metric space, α[0,1) and T:XX be a given mapping. Suppose that for each x,yX, the following condition holds:

p(Tx,Ty)max { α p ( x , y ) , p ( x , x ) + p ( y , y ) 2 } .
(3.7)

Then there is a unique zX such that Tz=z. Furthermore, z X p and for each x X p , the sequence { T n x } n 1 converges with respect to the metric p s to z.

As a corollary we obtain the already mentioned result of Matthews (see also Corollary 2 of [8] and [21]). Let us remark that the result of Matthews is for a complete partial metric space, but it is true for a 0-complete partial metric space.

Corollary 3.3 (Matthews [4])

Let (X,p) be a 0-complete partial metric space, α[0,1) and T:XX be a given mapping. Suppose that for each x,yX, the following condition holds:

p(Tx,Ty)αp(x,y).
(3.8)

Then there is a unique zX such that Tz=z. Also p(z,z)=0 and for each xX the sequence { T n x } n 1 converges with respect to the metric p s to z.

Remark 3.3 In the case p=ρ is a metric, by Theorem 3.3, the main result of Ćirić [1] is recovered. Theorem 3.3 also implies Corollaries 1-4 of [8], and the next Hardy and Rogers type [37] fixed point result. This result, under some extra conditions, was proved as one of the main results, Theorem 2 of [8].

Corollary 3.4 Let (X,p) be a 0-complete partial metric space, a,b,c,d,e0, 0a+b+c+d+e<1, and T:XX be a given mapping. Suppose that for each x,yX, the following condition holds:

p(Tx,Ty)ap(x,y)+bp(x,Tx)+cp(x,Ty)+dp(Tx,y)+ep(y,Ty).
(3.9)

Then there is a unique zX such that Tz=z. Also p(z,z)=0 and for each xX the sequence { T n x } n 1 converges with respect to the metric p s to z.

Example 3.1 Let X:=[0,1][2,3] and define p: X 2 R by

p(x,y)= { max { x , y } , { x , y } [ 2 , 3 ] , | x y | , { x , y } [ 0 , 1 ] .

Then (X,p) is a complete partial metric space. Define T:XX by

Tx= { x + 1 2 , 0 x 1 , 1 , x = 2 , 2 + x 2 , 2 < x 3 .

If 2<xy3, then it is easy to see that p(Tx,Ty)= 2 + y 2 and M(x,y)=y. Given any λ[0,1), we have that p(Tx,Ty)>λM(x,y) holds for all 2<xy3 if λ 1 2 , i.e., for all 2<xy< 2 2 λ 1 if λ> 1 2 . On the other hand, we have that

p(Tx,Ty) 1 2 p(x,y),{x,y}[0,1]

and

p(Tx,Ty) p ( x , x ) + p ( y , y ) 2 ,{x,y}[2,3].

Thus T is a p 2 -quasicontraction on X which is not a p-quasicontraction. By Theorem 3.2, there is a unique fixed point z=1. Also we have p(1,1)=0=min{p(x,x)xX}.

Example 3.2 Denote by X the set of all sequences x:NN and for nN by X n the set of all n-tuples x:{1,,n}N of positive integers. Put X:= X n N X n . For x,yX, set

I(x,y)= { i N { 0 } [ j dom ( x ) dom ( y ) j i ] x ( j ) = y ( j ) }

and define p(x,y):=inf{ 1 2 i iI(x,y)} (thus if x(1)y(1), then I(x,y)={0} and p(x,y)=1). Here ‘dom(x)’ stands for the domain of the function x. Then (X,p) is a partial metric space (see [4]) and a complete one as can easily be verified.

Define T:XX by Tx=y, where:

  • x X y X and x X n y X n + 1 ;

  • y(1)=1, idom(x){1}y(i)=min{x(i),x(i1)} (this condition is vacuous if x X 1 ) and if in addition x X n , then y(n+1)=1.

Note that taking, e.g., x=(3,3,1) and y=(3,3,2), we have Tx=(1,3,1,1) and Ty=(1,3,2,1) so p(Tx,Ty)= 1 4 =p(x,y)> 1 8 =p(x,x)=p(y,y). Thus the contractive condition of Corollary 3.1 is not satisfied. Nevertheless, there is a unique fixed point of T - the sequence s :NN defined by s (i)=1 for all iN. We will show that T is a p-quasicontraction. Consider arbitrary x,yX.

Case 1. There is a nonnegative integer i with i+1dom(x)dom(y) such that x(i+1)1y(i+1)1. Denote by k the least such nonnegative integer. Thus k=0 simply means that x(1)1y(1)1 and if k1, then for all iN with ik, we must have x(i)=y(i)=1.

If x(k+1)y(k+1), then p(x,y)= 1 2 k so p(Tx,Ty) 1 2 k + 1 = 1 2 p(x,y).

If x(k+1)=y(k+1), then p(x,Tx)= 1 2 k (because in this case we must have x(k+1)=y(k+1)1 but (Tx)(k+1)=1). Hence p(Tx,Ty) 1 2 k + 1 = 1 2 p(x,Tx).

Case 2. x(i)=1 for all idom(x) and xy (meaning dom(x)dom(y) and x is the restriction of y to the set dom(x)).

If x X n , then p(Tx,Ty)= 1 2 n + 1 = 1 2 p(x,y).

If x X , then x=y= s =Tx, and so p(Tx,Ty)=0.

Case 3. y(i)=1 for all idom(y) and yx. This reduces to the previous case.

To illustrate the role condition (2.3) plays in ensuring the uniqueness of the fixed point, we modify a bit the definition of the operator T to obtain the operator T 1 :XX determined by T 1 x=y if and only if

  • dom(y)=dom(x);

  • y(1)=1 and idom(x){1}y(i)=min{x(i),x(i1)}.

T 1 has infinitely many fixed points - these are exactly the sequence s and the restrictions s n =(1,,n) of s to the sets {1,,n}. Due to the existence of infinitely many fixed points, T 1 cannot be a p 2 -quasicontraction. We verify that T 1 is a p 1 -quasicontraction.

Given arbitrary x,yX, we distinguish three cases exactly as we did with the operator T.

Case 1. There is a nonnegative integer i with i+1dom(x)dom(y) such that x(i+1)1y(i+1)1. This is handled exactly as in the corresponding case with the operator T: if k is the least such nonnegative integer, then p(Tx,Ty) 1 2 p(x,y) or p(Tx,Ty) 1 2 p(x,Tx) according to whether x(k+1)y(k+1) or x(k+1)=y(k+1), respectively.

Case 2. x(i)=1 for all idom(x) and xy. If x X n , then T 1 x=x, and so p( T 1 x, T 1 y)= 1 2 n =p(x,x). If x X , then x=y= s = T 1 x, so p( T 1 x, T 1 y)=0.

Case 3. y(i)=1 for all idom(y) and yx. This reduces to the previous case.