1 Introduction and preliminaries

Fixed point theory has fascinated many mathematicians since 1922 with the celebrated Banach’s fixed point theorem. Fixed point theory plays a major role within as well as outside mathematics, so the attraction of fixed point theory to large numbers of researchers is understandable, and the problem of fixed point has been studied in several directions; see for example, [14]. The study of metric fixed point theory has been researched extensively in the past decades. Recently, some generalizations of the notion of a metric space have been proposed by some authors. In 1992, Matthews introduced a new notion of generalized metric space called partial metric space (for short PMS) [5, 6], in which the distance of a point from itself may not be zero. After the appearance of partial metric spaces, some authors started to generalize Banach contraction mapping theorem to partial metric spaces and focus on fixed point theory on partial metric spaces (see, e.g., [724]). A new category of fixed point problems was addressed by Khan et al. [25]. In this study, they introduced the concept of altering distance function. In [26], Choudhury introduced the concept of weakly C-contractive mapping as follows.

Definition 1.1 [26]

Let (X,d) be a metric space and T:XX be a mapping. Then T is said to be weakly C-contractive (or a weakly C-contraction) if for all x,yX, the following inequality holds:

d(Tx,Ty) 1 2 ( d ( x , T y ) + d ( T x , y ) ) ϕ ( d ( x , T y ) , d ( T x , y ) ) ,

where ϕ:[0,+)×[0,+)[0,+) is a continuous function such that ϕ(x,y)=0 if and only if x=y=0.

Shatanawi [27] investigated some fixed point theorems and coupled fixed point theorems for weakly C-contractive mapping by using an altering distance function in metric and partially ordered metric spaces.

Recently, Haghi et al. [28] pointed that many fixed point generalizations to partial metric spaces can be obtained from the corresponding results in metric spaces and considered some cases to demonstrate this fact. The aim of this paper is to research fixed point and common fixed point theorems for weakly C-contractive type mappings in partial metric spaces. Our results extend and generalize some results of [27] to partial metric spaces; all of our results cannot be obtained from the corresponding results in metric spaces. Moreover, even in metric spaces, our results are the generalizations of some results of [27]. Also, we give an example to illustrate our results.

Throughout this paper, the letters N and N + denote the set of all nonnegative integer numbers and the set of all positive integer numbers, respectively. Let us recall some definitions and properties of partial metric spaces.

Definition 1.2 [6]

Let X be a nonempty set. The mapping p:X×X[0,+) is said to be a partial metric on X if the following conditions hold:

(P1) x=yp(x,y)=p(x,x)=p(y,y),

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

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

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

for any x,y,zX. The pair (X,p) is then called a partial metric space.

It is clear that, if p(x,y)=0, then from (P1) and (P2), x=y. But if x=y, p(x,y) may not be 0.

For a partial metric p on X, the function d p :X×X[0,+) given by

d p (x,y)=2p(x,y)p(x,x)p(y,y)

is a (usual) metric on X. Each partial metric p on X generates a T 0 -topology τ p on X with a base of the family of open p-balls { B p (x,ε):xX,ε>0}, where B p (x,ε)={yX:p(x,y)<p(x,x)+ε} for all xX and ε>0.

Let (X,p) be a partial metric space. Then:

A sequence { x n } in a partial metric space (X,p) converges to a point xX if and only if p(x,x)= lim n + p(x, x n ).

A sequence { x n } in a partial metric space (X,p) is called a Cauchy sequence if there exists (and is finite) lim n , m + p( x m , x n ).

A partial metric space (X,p) is said to be complete if every Cauchy sequence { x n } in X converges, with respect to τ p , to a point xX such that p(x,x)= lim n , m + p( x m , x n ).

The following lemmas play a major role in proving our main results.

Lemma 1.1 [29]

Let (X,p) be a partial metric space.

  1. (A)

    A sequence { x n } is a Cauchy sequence in (X,p) if and only if { x n } is a Cauchy sequence in (X, d p ).

  2. (B)

    (X,p) is complete if and only if (X, d p ) is complete. Moreover,

    lim n + d p ( x n ,x)=0p(x,x)= lim n + p( x n ,x)= lim n , m + p( x n , x m ).
    (1.1)

Lemma 1.2 [29, 30]

Assume that x n z as n+ in a PMS (X,p) such that p(z,z)=0. Then lim n + p( x n ,y)=p(z,y) for every yX.

Lemma 1.3 [31]

Let (X,p) be a partial metric space and let { x n } be a sequence in X such that

lim n + p( x n + 1 , x n )=0.

If { x 2 n } is not a Cauchy sequence in (X,p), then there exist ε>0 and two sequences {m(k)} and {n(k)} of positive integers such that n(k)>m(k)>k and the following four sequences tend to ε when k+:

p ( x 2 m ( k ) , x 2 n ( k ) ) , p ( x 2 m ( k ) , x 2 n ( k ) + 1 ) , p ( x 2 m ( k ) 1 , x 2 n ( k ) ) , p ( x 2 m ( k ) 1 , x 2 n ( k ) + 1 ) .
(1.2)

2 Main results

We start this section with the following definition, which can be seen in [9, 16, 17, 30].

Definition 2.1 Let (x,P) be a partial metric space. A mapping T:XX is said to be continuous at x 0 X if for every ε>0, there exists δ>0 such that T( B p ( x 0 ,δ)) B p (T x 0 ,ε).

Definition 2.2 [25]

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.

Lemma 2.1 [31]

Let (X,p) be a partial metric space, T:XX be a given mapping. Suppose that T is continuous at x 0 X. Then, for each sequence { x n } in X, x n x 0 in τ p T x n T x 0 in τ p holds.

Theorem 2.1 Let (X,) be a partially ordered set and suppose that there exists a partial metric p on X such that (X,p) is complete. Let f:XX be a continuous nondecreasing mapping. Suppose that for comparable x,yX, we have

ψ ( p ( f x , f y ) ) φ ( p ( x , f y ) + p ( f x , y ) 2 ) ϕ ( p ( x , f y ) , p ( f x , y ) ) ,
(2.1)

where ψ and φ are altering distance functions with

ψ(t)φ(t)0
(2.2)

for all t0, and ϕ:[0,+)×[0,+)[0,+) is a continuous function with ϕ(x,y)=0 if and only if x=y=0. If there exists x 0 X such that x 0 f x 0 , then f has a fixed point.

Proof If x 0 =f x 0 , then x 0 is a fixed point of f. Suppose that x 0 f x 0 , we can choose x 1 X such that f x 0 = x 1 . Since f is a nondecreasing function, we have

x 0 x 1 =f x 0 x 2 =f x 1 x 3 =f x 2 .

Continuing this process, we can construct a sequence { x n } in X such that x n + 1 =f x n with

x 0 x 1 x 2 x n x n + 1 .

It is clear that if p( x n , x n + 1 )=0 for some n 0 N, then f has a fixed point. Taking p( x n , x n + 1 )>0 for all nN, now let us prove the following inequality:

p( x n , x n + 1 )p( x n 1 , x n ),n N + .
(2.3)

Suppose this is not true, then p( x n , x n + 1 )>p( x n 1 , x n ) for some n 0 , that is,

p( x n 0 , x n 0 + 1 )>p( x n 0 1 , x n 0 ).
(2.4)

From (2.1) and (2.4), we obtain that

this together with (2.2) shows that

ϕ ( p ( x n 0 1 , x n 0 + 1 ) , p ( x n 0 , x n 0 ) ) =0.

Using the property of ϕ, we have

p( x n 0 1 , x n 0 + 1 )=0,p( x n 0 , x n 0 )=0.
(2.5)

Since

applying (2.5), we get

ψ ( p ( x n 0 , x n 0 + 1 ) ) =0.
(2.6)

From the property of ψ, we have p( x n 0 , x n 0 + 1 )=0, which contradicts with p( x n , x n + 1 )>0 for all nN; hence (2.3) holds. Therefore, {p( x n , x n + 1 )} is a nonincreasing sequence, and thus there exists r0 such that

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

Using (2.1), we obtain

(2.7)

it means that

ϕ ( p ( x n , x n + 2 ) , p ( x n + 1 , x n + 1 ) ) φ ( p ( x n , x n + 1 ) + p ( x n + 1 , x n + 2 ) 2 ) ψ ( p ( x n + 1 , x n + 2 ) ) .

Letting n+ in the above inequality, we get

lim inf n + ϕ ( p ( x n , x n + 2 ) , p ( x n + 1 , x n + 1 ) ) =0,

the continuity of ϕ guarantees that

ϕ ( lim inf n + p ( x n , x n + 2 ) , lim inf n + p ( x n + 1 , x n + 1 ) ) =0,

and the property of ϕ gives that

lim inf n + p( x n , x n + 2 )=0, lim inf n + p( x n + 1 , x n + 1 )=0.
(2.8)

Since

on taking inferior limit in the above inequalities and using (2.8), we obtain that ψ(r)=0 and so r=0, therefore,

lim n + p( x n , x n + 1 )=0,

moreover, we have

lim n + p( x n , x n )=0.

Now, we claim that { x n } is a Cauchy sequence in the metric space (X, d p ) (and so also in the space (X,p) by Lemma 1.1). For this, it is sufficient to show that { x 2 n } is a Cauchy sequence in (X, d p ). Suppose that this is not the case, then using Lemma 1.1 we have that { x 2 n } is not a Cauchy sequence in (X,p). By Lemma 1.3, we obtain that there exist ε>0 and two sequences {m(k)} and {n(k)} of positive integers such that n(k)>m(k)>k and sequences in (1.2) tend to ε when k+. For two comparable elements y= x 2 n ( k ) + 1 and x= x 2 m ( k ) , we can obtain, from (2.1), that

(2.9)

Taking k+ in (2.9), we get

ψ(ε)φ(ε)ϕ(ε,ε),

which implies that ϕ(ε,ε)=0, hence ε=0, a contradiction. Thus, { x 2 n } is a Cauchy sequence in (X, d p ) and so { x n } is a Cauchy sequence both in (X, d p ) and in (X,p). Since (X,p) is complete then the sequence { x n } converges to some zX, that is

p(z,z)= lim n + p( x n ,z)= lim n , m + p( x n , x m ).
(2.10)

Moreover, since { x n } is a Cauchy sequence in (X, d p ), we have lim n + d p ( x n , x m )=0. By d p ( x n , x m )=2p( x n , x m )p( x n , x n )p( x m , x m ) and lim n + p( x n , x n )=0, we have lim n + p( x n , x m )=0. Then (2.10) yields that

p(z,z)= lim n + p( x n ,z)=0.
(2.11)

Applying the triangular inequality, we have

p(z,fz)p(z, x n )+p( x n ,fz)p( x n , x n )p(z, x n )+p( x n ,fz)=p(z, x n )+p(f x n 1 ,fz),

taking n+ in the above inequalities, then the continuity of f and Lemma 2.1 give that

p(z,fz)p(fz,fz),

hence

p(z,fz)=p(fz,fz).
(2.12)

By combining (2.1) and (2.12), we have

ψ ( p ( z , f z ) ) = ψ ( p ( f z , f z ) ) φ ( p ( z , f z ) + p ( f z , z ) 2 ) ϕ ( p ( z , f z ) , p ( f z , z ) ) = φ ( p ( z , f z ) ) ϕ ( p ( z , f z ) , p ( f z , z ) ) ,

which yields that ϕ(p(z,fz),p(fz,z))=0, and thus p(z,fz)=0, that is z=fz. Therefore, z is a fixed point of f. □

Theorem 2.2 Suppose that X, f, ψ, φ, and ϕ are the same as in Theorem 2.1 except the continuity of f. Suppose that for a nondecreasing sequence { x n } in X with x n xX, we have x n x for all nN. If there exists x 0 X such that x 0 f x 0 , then f has a fixed point.

Proof As in the proof of Theorem 2.1, we have a Cauchy sequence { x n } in X. Since (X,p) is complete, there exists zX such that x n z, that is,

p(z,z)= lim n + p( x n ,z)= lim n , m + p( x n , x m ),

due to the hypothesis, we get x n z. Similar to the proof of Theorem 2.1, we have that

p(z,z)= lim n + p( x n ,z)=0.

From (2.1), we obtain that

ψ ( p ( x n , f z ) ) = ψ ( p ( f x n 1 , f z ) ) φ ( p ( x n 1 , f z ) + p ( f x n 1 , z ) 2 ) ϕ ( p ( x n 1 , f z ) , p ( x n , z ) ) = φ ( p ( x n 1 , f z ) + p ( x n , z ) 2 ) ϕ ( p ( x n 1 , f z ) , p ( x n , z ) ) .

Letting n+ in the above inequalities, and by Lemma 1.2, we have

ψ ( p ( z , f z ) ) φ ( p ( z , f z ) ) ϕ ( p ( z , f z ) , 0 ) ,

which implies, from (2.2), that ϕ(p(z,fz),0)=0, hence p(z,fz)=0, and thus z=fz. Therefore, f has a fixed point. □

Theorem 2.3 Let (X,p) be a complete partial metric space, f and g be self-mappings on X. Suppose that for all x,yX

ψ ( p ( f x , g y ) ) φ ( p ( x , g y ) + p ( f x , y ) 2 ) ϕ ( p ( x , g y ) , p ( f x , y ) ) ,
(2.13)

where ψ and φ are altering distance functions with

ψ(t)φ(t)0
(2.14)

for all t0, and ϕ:[0,+)×[0,+)[0,+) is a continuous function with ϕ(x,y)=0 if and only if x=y=0.

Then f and g have a unique common fixed point.

Proof Let x 0 be an arbitrary point in X. One can choose x 1 X such that f x 0 = x 1 . Also, one can choose x 2 X such that g x 1 = x 2 . Continuing this process, one can construct a sequence { x n } in X such that

x 2 n + 1 =f x 2 n , x 2 n + 2 =g x 2 n + 1 ,nN.
(2.15)

Now, we discuss the following two cases.

Case 1. If p( x n , x n + 1 )=0 for some n 0 N, then f and g have at least one common fixed point. In fact, if p( x n , x n + 1 )=0 for some n 0 N, that is p( x n 0 , x n 0 + 1 )=0, which implies that x n 0 = x n 0 + 1 . If n 0 =2k (kN), then x 2 k = x 2 k + 1 . Using (2.13), we have

ψ ( p ( x 2 k + 1 , x 2 k + 2 ) ) = ψ ( p ( f x 2 k , g x 2 k + 1 ) ) φ ( p ( x 2 k , g x 2 k + 1 ) + p ( f x 2 k , x 2 k + 1 ) 2 ) ϕ ( p ( x 2 k , g x 2 k + 1 ) , p ( f x 2 k , x 2 k + 1 ) ) = φ ( p ( x 2 k , x 2 k + 2 ) + p ( x 2 k + 1 , x 2 k + 1 ) 2 ) ϕ ( p ( x 2 k , x 2 k + 2 ) , p ( x 2 k + 1 , x 2 k + 1 ) ) φ ( p ( x 2 k , x 2 k + 1 ) + p ( x 2 k + 1 , x 2 k + 2 ) 2 ) ϕ ( p ( x 2 k , x 2 k + 2 ) , p ( x 2 k + 1 , x 2 k + 1 ) ) φ ( max { p ( x 2 k , x 2 k + 1 ) , p ( x 2 k + 1 , x 2 k + 2 ) } ) ϕ ( p ( x 2 k , x 2 k + 2 ) , p ( x 2 k + 1 , x 2 k + 1 ) ) = φ ( max { p ( x 2 k + 1 , x 2 k + 1 ) , p ( x 2 k + 1 , x 2 k + 2 ) } ) ϕ ( p ( x 2 k + 1 , x 2 k + 2 ) , p ( x 2 k + 1 , x 2 k + 1 ) ) = φ ( p ( x 2 k + 1 , x 2 k + 2 ) ) ϕ ( p ( x 2 k + 1 , x 2 k + 2 ) , p ( x 2 k + 1 , x 2 k + 1 ) ) .
(2.16)

With the help of (2.14) and (2.16), we conclude that ϕ(p( x 2 k + 1 , x 2 k + 2 ),p( x 2 k + 1 , x 2 k + 1 ))=0, hence, using the property of ϕ, we get p( x 2 k + 1 , x 2 k + 2 )=0, that is x 2 k + 1 = x 2 k + 2 . By similar arguments, we obtain x 2 k + 2 = x 2 k + 3 , x 2 k + 3 = x 2 k + 4 and so on. Thus, { x n } becomes a constant from n=2k, that is,

x 2 k = x 2 k + 1 = x 2 k + 2 =.
(2.17)

Equations (2.15) and (2.17) yield that

x 2 k =g x 2 k =f x 2 k ,
(2.18)

which implies that x 2 k is the common fixed point of f and g. Similarly, one can show that if n 0 =2k+1 (kN), then f and g have at least one common fixed point. Therefore, we have proved that if p( x n , x n + 1 )=0 for some n 0 N, then f and g have at least one common fixed point.

Case 2. If p( x n , x n + 2 )=0 for some n 0 N, then f and g have at least one common fixed point. Indeed, if n 0 =2k (kN), then p( x 2 k , x 2 k + 2 )=0. Hence, x 2 k = x 2 k + 2 , due to (2.13), we have

ψ ( p ( x 2 k + 1 , x 2 k + 2 ) ) = ψ ( p ( f x 2 k , g x 2 k + 1 ) ) φ ( p ( x 2 k , g x 2 k + 1 ) + p ( f x 2 k , x 2 k + 1 ) 2 ) ϕ ( p ( x 2 k , g x 2 k + 1 ) , p ( f x 2 k , x 2 k + 1 ) ) = φ ( p ( x 2 k , x 2 k + 2 ) + p ( x 2 k + 1 , x 2 k + 1 ) 2 ) ϕ ( p ( x 2 k , x 2 k + 2 ) , p ( x 2 k + 1 , x 2 k + 1 ) ) φ ( p ( x 2 k , x 2 k + 1 ) + p ( x 2 k + 1 , x 2 k + 2 ) 2 ) ϕ ( p ( x 2 k , x 2 k + 2 ) , p ( x 2 k + 1 , x 2 k + 1 ) ) = φ ( p ( x 2 k + 2 , x 2 k + 1 ) + p ( x 2 k + 1 , x 2 k + 2 ) 2 ) ϕ ( p ( x 2 k , x 2 k + 2 ) , p ( x 2 k + 1 , x 2 k + 1 ) ) = φ ( p ( x 2 k + 2 , x 2 k + 1 ) ) ϕ ( p ( x 2 k , x 2 k + 2 ) , p ( x 2 k + 1 , x 2 k + 1 ) ) .
(2.19)

Applying (2.14) and (2.19), we obtain ϕ(p( x 2 k , x 2 k + 2 ),p( x 2 k + 1 , x 2 k + 1 ))=0. Using the property of ϕ, we have

p( x 2 k + 1 , x 2 k + 1 )=0.
(2.20)

From (2.20) and using p( x 2 k , x 2 k + 2 )=0, we get that

ψ ( p ( x 2 k + 1 , x 2 k + 2 ) ) = ψ ( p ( f x 2 k , g x 2 k + 1 ) ) φ ( p ( x 2 k , g x 2 k + 1 ) + p ( f x 2 k , x 2 k + 1 ) 2 ) ϕ ( p ( x 2 k , g x 2 k + 1 ) , p ( f x 2 k , x 2 k + 1 ) ) = φ ( p ( x 2 k , x 2 k + 2 ) + p ( x 2 k + 1 , x 2 k + 1 ) 2 ) ϕ ( p ( x 2 k , x 2 k + 2 ) , p ( x 2 k + 1 , x 2 k + 1 ) ) = φ ( 0 ) ϕ ( 0 , 0 ) = 0 ,
(2.21)

which implies that ψ(p( x 2 k + 1 , x 2 k + 2 ))=0, and thus p( x 2 k + 1 , x 2 k + 2 )=0. Hence we obtain that f and g have at least one common fixed point from case 1. Similarly, it is easy to show that if p( x n , x n + 2 )=0 for some n=2k+1 (kN), then f and g have at least one common fixed point, this completes the proof of case 2.

Taking p( x n , x n + 1 )>0 and p( x n , x n + 2 )>0 for all nN. Now we prove that for every kN, we have

p( x 2 k + 2 , x 2 k + 1 )p( x 2 k + 1 , x 2 k ).
(2.22)

Suppose this is not true, then p( x 2 k + 2 , x 2 k + 1 )>p( x 2 k + 1 , x 2 k ) for some k= k 0 , that is,

p( x 2 k 0 + 2 , x 2 k 0 + 1 )>p( x 2 k 0 + 1 , x 2 k 0 ).

Using (2.13) and (2.15), we obtain that

ψ ( p ( x 2 k 0 + 1 , x 2 k 0 + 2 ) ) = ψ ( p ( f x 2 k 0 , g x 2 k 0 + 1 ) ) φ ( p ( x 2 k 0 , g x 2 k 0 + 1 ) + p ( f x 2 k 0 , x 2 k 0 + 1 ) 2 ) ϕ ( p ( x 2 k 0 , g x 2 k 0 + 1 ) , p ( f x 2 k 0 , x 2 k 0 + 1 ) ) = φ ( p ( x 2 k 0 , x 2 k 0 + 2 ) + p ( x 2 k 0 + 1 , x 2 k 0 + 1 ) 2 ) ϕ ( p ( x 2 k 0 , x 2 k 0 + 2 ) , p ( x 2 k 0 + 1 , x 2 k 0 + 1 ) ) φ ( p ( x 2 k 0 , x 2 k 0 + 1 ) + p ( x 2 k 0 + 1 , x 2 k 0 + 2 ) 2 ) ϕ ( p ( x 2 k 0 , x 2 k 0 + 2 ) , p ( x 2 k 0 + 1 , x 2 k 0 + 1 ) ) φ ( max { p ( x 2 k 0 , x 2 k 0 + 1 ) , p ( x 2 k 0 + 1 , x 2 k 0 + 2 ) } ) ϕ ( p ( x 2 k 0 , x 2 k 0 + 2 ) , p ( x 2 k 0 + 1 , x 2 k 0 + 1 ) ) = φ ( p ( x 2 k 0 + 1 , x 2 k 0 + 2 ) ) ϕ ( p ( x 2 k 0 , x 2 k 0 + 2 ) , p ( x 2 k 0 + 1 , x 2 k 0 + 1 ) ) .
(2.23)

Equations (2.14) and (2.23) give that ϕ(p( x 2 k 0 , x 2 k 0 + 2 ),p( x 2 k 0 + 1 , x 2 k 0 + 1 ))=0. Using the property of ϕ, we get p( x 2 k 0 , x 2 k 0 + 2 )=0, which contradicts with p( x n , x n + 2 )>0 for nN, hence (2.22) holds.

Similarly, one can show that for every k N + , the following inequality holds.

p( x 2 k + 1 , x 2 k )p( x 2 k , x 2 k 1 ).
(2.24)

Equations (2.22) and (2.24) imply that the sequence {p( x n , x n + 1 )} is nonincreasing, and consequently there exists some r0 such that

lim n + p( x n , x n + 1 )=r.
(2.25)

By (2.25) and the following inequalities,

p ( x 2 n , x 2 n + 2 ) p ( x 2 n , x 2 n + 1 ) + p ( x 2 n + 1 , x 2 n + 2 ) p ( x 2 n + 1 , x 2 n + 1 ) p ( x 2 n , x 2 n + 1 ) + p ( x 2 n + 1 , x 2 n + 2 ) ,

we get that {p( x 2 n , x 2 n + 2 )} is bounded, and hence it has some subsequence {p( x 2 n ( k ) , x 2 n ( k ) + 2 )} converging to some r 0 , that is,

lim k + p( x 2 n ( k ) , x 2 n ( k ) + 2 )= r 0 .
(2.26)

Taking (P2) into account, we have

p( x 2 n ( k ) + 1 , x 2 n ( k ) + 1 )p( x 2 n ( k ) + 1 , x 2 n ( k ) ),

which combining with (2.25) shows that p( x 2 n ( k ) + 1 , x 2 n ( k ) + 1 ) is bounded, and hence there exists subsequence p( x 2 n ( k i ) + 1 , x 2 n ( k i ) + 1 ) of p( x 2 n ( k ) + 1 , x 2 n ( k ) + 1 ) such that p( x 2 n ( k i ) + 1 , x 2 n ( k i ) + 1 ) converges to some r 1 , that is,

lim i + p( x 2 n ( k i ) + 1 , x 2 n ( k i ) + 1 )= r 1 .
(2.27)

By (2.13), we have

ψ ( p ( x 2 n ( k i ) + 1 , x 2 n ( k i ) + 2 ) ) = ψ ( p ( f x 2 n ( k i ) , g x 2 n ( k i ) + 1 ) ) φ ( p ( x 2 n ( k i ) , g x 2 n ( k i ) + 1 ) + p ( f x 2 n ( k i ) , x 2 n ( k i ) + 1 ) 2 ) ϕ ( p ( x 2 n ( k i ) , g x 2 n ( k i ) + 1 ) , p ( f x 2 n ( k i ) , x 2 n ( k i ) + 1 ) ) = φ ( p ( x 2 n ( k i ) , x 2 n ( k i ) + 2 ) + p ( x 2 n ( k i ) + 1 , x 2 n ( k i ) + 1 ) 2 ) ϕ ( p ( x 2 n ( k i ) , x 2 n ( k i ) + 2 ) , p ( x 2 n ( k i ) + 1 , x 2 n ( k i ) + 1 ) ) φ ( p ( x 2 n ( k i ) , x 2 n ( k i ) + 1 ) + p ( x 2 n ( k i ) + 1 , x 2 n ( k i ) + 2 ) 2 ) ϕ ( p ( x 2 n ( k i ) , x 2 n ( k i ) + 2 ) , p ( x 2 n ( k i ) + 1 , x 2 n ( k i ) + 1 ) ) .
(2.28)

Letting i+ in (2.28), and using (2.25)-(2.27), we obtain that

ψ(r)φ(r)ϕ( r 0 , r 1 ),
(2.29)

which means that ϕ( r 0 , r 1 )=0, hence r 0 =0 and r 1 =0.

Since

ψ ( p ( x 2 n ( k i ) + 1 , x 2 n ( k i ) + 2 ) ) = ψ ( p ( f x 2 n ( k i ) , g x 2 n ( k i ) + 1 ) ) φ ( p ( x 2 n ( k i ) , g x 2 n ( k i ) + 1 ) + p ( f x 2 n ( k i ) , x 2 n ( k i ) + 1 ) 2 ) ϕ ( p ( x 2 n ( k i ) , g x 2 n ( k i ) + 1 ) , p ( f x 2 n ( k i ) , x 2 n ( k i ) + 1 ) ) = φ ( p ( x 2 n ( k i ) , x 2 n ( k i ) + 2 ) + p ( x 2 n ( k i ) + 1 , x 2 n ( k i ) + 1 ) 2 ) ϕ ( p ( x 2 n ( k i ) , x 2 n ( k i ) + 2 ) , p ( x 2 n ( k i ) + 1 , x 2 n ( k i ) + 1 ) ) ,

taking the limit as i+, we have ψ(r)=0, which implies that r=0, that is,

lim n + p( x n , x n + 1 )=0.
(2.30)

Now, we claim that { x n } is a Cauchy sequence in the metric space (X, d p ) (and so also in the space (X,p) by Lemma 1.1). For this, it is sufficient to show that { x 2 n } is a Cauchy sequence in (X, d p ). Suppose that this is not the case, then using Lemma 1.1, we have that { x 2 n } is not a Cauchy sequence in (X,p). By Lemma 1.3, we obtain that there exist ε>0 and two sequences {m(k)} and {n(k)} of positive integers such that n(k)>m(k)>k and sequences in (1.2) tend to ε when k+.

From (2.13), we get that

ψ ( p ( x 2 n ( k ) + 1 , x 2 m ( k ) ) ) = ψ ( p ( f x 2 n ( k ) , g x 2 m ( k ) 1 ) ) φ ( p ( x 2 n ( k ) , g x 2 m ( k ) 1 ) + p ( f x 2 n ( k ) , x 2 m ( k ) 1 ) 2 ) ϕ ( p ( x 2 n ( k ) , g x 2 m ( k ) 1 ) , p ( f x 2 n ( k ) , x 2 m ( k ) 1 ) ) = φ ( p ( x 2 n ( k ) , x 2 m ( k ) ) + p ( x 2 n ( k ) + 1 , x 2 m ( k ) 1 ) 2 ) ϕ ( p ( x 2 n ( k ) , x 2 m ( k ) ) , p ( x 2 n ( k ) + 1 , x 2 m ( k ) 1 ) ) .

Letting k+ in the above inequalities and using the continuity of ψ, φ and ϕ, we get that

ψ(ε)φ(ε)ϕ(ε,ε),

therefore, we get that ϕ(ε,ε)=0. Hence, ε=0 which is a contradiction. Thus, { x n } is a Cauchy sequence in (X, d p ), and { x n } is also a Cauchy sequence in (X,p). Since (X,p) is complete, then the sequence { x n } converges to some zX, that is,

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

Moreover, the sequence { x 2 n } and { x 2 n + 1 } converge to zX, that is,

p(z,z)= lim n + p( x 2 n ,z)= lim n , m + p( x 2 n , x 2 m )

and

p(z,z)= lim n + p( x 2 n + 1 ,z)= lim n , m + p( x 2 n + 1 , x 2 m + 1 ).

Using the fact that { x n } is a Cauchy sequence in (X, d p ), we have lim n + d p ( x n , x m )=0, which together with d p ( x n , x m )=2p( x n , x m )p( x n , x n )p( x m , x m ) yields that lim n + p( x n , x m )=0. Hence, we have

p(z,z)= lim n + p( x n ,z)= lim n + p( x 2 n ,z)= lim n + p( x 2 n + 1 ,z)=0.

By substituting x= x 2 n ( k ) + 1 , y=z in (2.13), we get that

ψ ( p ( x 2 n ( k ) + 1 , g z ) ) = ψ ( p ( f x 2 n ( k ) , g z ) ) φ ( p ( x 2 n ( k ) , g z ) + p ( f x 2 n ( k ) , z ) 2 ) ϕ ( p ( x 2 n ( k ) , g z ) , p ( f x 2 n ( k ) , z ) ) = φ ( p ( x 2 n ( k ) , g z ) + p ( x 2 n ( k ) + 1 , z ) 2 ) ϕ ( p ( x 2 n ( k ) , g z ) , p ( x 2 n ( k ) + 1 , z ) ) ,

letting k+ and applying Lemma 1.2, we conclude that

ψ ( p ( z , g z ) ) φ ( p ( z , g z ) + p ( z , z ) 2 ) ϕ ( p ( z , g z ) , p ( z , z ) ) φ ( p ( z , g z ) ) ϕ ( p ( z , g z ) , 0 ) ,

which yields that ϕ(p(z,gz),0)=0; hence, p(z,gz)=0, and thus z=gz. Similarly, one can easily show that z=fz, therefore, z is the common fixed point of f and g.

Now we prove the uniqueness of common fixed point. Let us suppose that u is also the common fixed point of f and g. Since

ψ ( p ( u , z ) ) = ψ ( p ( f u , g z ) ) φ ( p ( u , g z ) + p ( f u , z ) 2 ) ϕ ( p ( u , g z ) , p ( f u , z ) ) = φ ( p ( u , z ) ) ϕ ( p ( u , z ) , p ( u , z ) ) ,

which means that ϕ(p(u,z),p(u,z))=0; hence, p(u,z)=0, and so u=z. Thus, the uniqueness of the common fixed point is proved. □

By taking φ=ψ in Theorems 2.1-2.3, respectively, we have the following results.

Corollary 2.1 Let (X,) be a partially ordered set and suppose that there exists a partial metric p on X such that (X,p) is complete. Let f:XX be a continuous nondecreasing mapping. Suppose that for comparable x,yX, we have

ψ ( p ( f x , f y ) ) ψ ( p ( x , f y ) + p ( f x , y ) 2 ) ϕ ( p ( x , f y ) , p ( f x , y ) ) ,

where ψ is an altering distance function and ϕ:[0,+)×[0,+)[0,+) is a continuous function with ϕ(x,y)=0 if and only if x=y=0. If there exists x 0 X such that x 0 f x 0 , then f has a fixed point.

Corollary 2.2 Suppose that X, f, ψ, and ϕ are the same as in Corollary 2.1 except the continuity of f. Suppose that for a nondecreasing sequence { x n } in X with x n xX, we have x n x for all nN. If there exists x 0 X such that x 0 f x 0 , then f has a fixed point.

Corollary 2.3 Let (X,p) be a complete partial metric space, f and g be self-mappings on X. Suppose that there exist functions ψ and ϕ such that for all x,yX

ψ ( p ( f x , g y ) ) ψ ( p ( x , g y ) + p ( f x , y ) 2 ) ϕ ( p ( x , g y ) , p ( f x , y ) ) ,

where ψ is an altering distance function and ϕ:[0,+)×[0,+)[0,+) is a continuous function with ϕ(x,y)=0 if and only if x=y=0.

Then f and g have a unique common fixed point.

Remark 2.1 If we replace the partial metric p by (usual) metric d in Corollaries 2.1-2.3, then we get Theorems 2.1-2.3 of [27].

Now, we introduce an example to support the usability of our results.

Example 2.1 Let X=[0,1] be endowed with the usual partial metric p:X×X[0,+) defined by p(x,y)=max{x,y}. It is easy to show that the partial metric space (X,p) is complete. Also, define the mappings f,g:XX by fx= x 2 4 and gx= x 2 5 , respectively. Let us take ψ,φ:[0,+)[0,+) such that ψ(t)= t 2 and φ(t)= t 2 2 , respectively, and take ϕ:[0,+)×[0,+)[0,+) such that ϕ(t,s)= ( t + s ) 2 16 . If xy, then

p(fx,gy)=max { x 2 4 , y 2 5 } = x 2 4 ,

and

p(x,gy)+p(fx,y)=p ( x , y 2 5 ) +p ( x 2 4 , y ) =max { x , y 2 5 } +p ( x 2 4 , y ) =x+p ( x 2 4 , y ) .

So, we have

ψ ( p ( f x , g y ) ) = x 4 16 x 2 16 ( x + p ( x 2 4 , y ) ) 2 16 = ( x + p ( x 2 4 , y ) ) 2 8 ( x + p ( x 2 4 , y ) ) 2 16 = φ ( p ( x , g y ) + p ( f x , y ) 2 ) ϕ ( p ( x , g y ) , p ( f x , y ) ) .

If xy, then

p(fx,gy)=max { x 2 4 , y 2 5 } y 2 4

and

p(x,gy)+p(fx,y)=p ( x , y 2 5 ) +p ( x 2 4 , y ) =p ( x , y 2 5 ) +max { x 2 4 , y } =p ( x , y 2 5 ) +y.

So, we have

ψ ( p ( f x , g y ) ) = y 4 16 y 2 16 ( y + p ( x , y 2 5 ) ) 2 16 = ( y + p ( x , y 2 5 ) ) 2 8 ( y + p ( x , y 2 5 ) ) 2 16 = φ ( p ( x , g y ) + p ( f x , y ) 2 ) ϕ ( p ( x , g y ) , p ( f x , y ) ) .

From the above arguments, we conclude that (2.13) holds; hence, all the required hypotheses of Theorem 2.3 are satisfied. Thus, we deduce the existence and uniqueness of a common fixed point of f and g. Here, 0 is the unique common fixed point.