1 Introduction

The Banach contraction principle is the most celebrated fixed point theorem. Afterward many authors obtained various important extensions of this principle (see [1]). The concept of partial metric spaces was introduced by Matthews [2] in 1994. A partial metric space is a generalized metric space in which each object does not necessarily have to have a zero distance from itself. A motivation behind introducing the concept of a partial metric was to obtain appropriate mathematical models in the theory of computation and, in particular, to give a modified version of the Banach contraction principle [3, 4]. Subsequently, several authors studied the problem of existence and uniqueness of a fixed point for mappings satisfying different contractive conditions on partial metric spaces (e.g., [57]).

Recently, Bhaskar and Lakshmikantham [8] presented coupled fixed point theorems for contractions in partially ordered metric spaces. Luong and Thuan [9] presented nice generalizations of these results. Alotaibi and Alsulami [10] further extended the work of Luong and Thuan to coupled coincidences. For more related work on coupled coincidences we refer the readers to recent work in [1116]. Our main aim in this paper is to extend Luong and Thuan [9] results to ordered partial metric spaces. We shall also establish coupled coincidence results and show that main results in [10] hold in ordered partial metric spaces without the compatibility of maps.

2 Basic concepts

We start by recalling some definitions and properties of partial metric spaces.

Definition 2.1 A partial metric on a nonempty set X is a function p:X×X R + such that for all x,y,zX,

p1. x=yp(x,x)=p(x,y)=p(y,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).

A partial metric space is a pair (X,p) such that X is a nonempty set and p is a partial metric on X.

From the above definition, if p(x,y)=0 , then x=y. But if x=y, p(x,y) may not be 0 in general. A trivial example of a partial metric space is the pair ( R + ,p) , where p: R + × R + R + is defined as p(x,y)=max{x,y}. For some more examples of partial metric spaces, we refer to [4, 6].

Each partial metric p on X generates a T 0 topology τ p on X which has as a base 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. A sequence { x n } in X converges to a point xX, with respect to τ p if and only if p(x,x)= lim n p(x, x n ). A sequence { x n } in X is called a Cauchy sequence if lim n , m p( x n , x m ) exists and is finite.

If p is a partial metric on X, then the function p s :X×X R + given by

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

is a metric on X.

Lemma 2.1 [2, 7]

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

  1. (a)

    { x n } is a Cauchy sequence in (X,p) if and only if it is a Cauchy sequence in the metric space (X, p s ).

  2. (b)

    (X,p) is complete if and only if the metric space (X, p s ) is complete. Furthermore, lim n p s ( x n ,x)=0 if and only if

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

Let (X,p) be a partial metric. We endow the product space X×X with the partial metric q defined as follows:

for (x,y),(u,v)X×X,q ( ( x , y ) , ( u , v ) ) =p(x,u)+p(y,v).

A mapping F:X×XX is said to be continuous at (x,y)X×X if for each ϵ>0, there exists δ>0 such that F( B q ((x,y),δ)) B p (F(x,y),ϵ).

Definition 2.2 (Mixed monotone property)

Let (X,) be a partially ordered set and F:X×XX. We say that the mapping F has the mixed monotone property if F is monotone non-decreasing in its first argument and is monotone non-increasing in its second argument. That is, for any x,yX,

x 1 , x 2 X, x 1 x 2 F( x 1 ,y)F( x 2 ,y)
(1)

and

y 1 , y 2 X, y 1 y 2 F(x, y 1 )F(x, y 2 ).
(2)

Definition 2.3 [11]

Let F:X×XX. We say that (x,y)X×X is a coupled fixed point of F if F(x,y)=x and F(y,x)=y.

Definition 2.4 (Mixed g-monotone property [11])

Let (X,) be a partially ordered set and F:X×XX. We say that the mapping F has the mixed g-monotone property if F is monotone g-non-decreasing in its first argument and is monotone g-non-increasing in its second argument. That is, for any x,yX,

x 1 , x 2 X,g x 1 g x 2 F( x 1 ,y)F( x 2 ,y)

and

y 1 , y 2 X,g y 1 g y 2 F(x, y 1 )F(x, y 2 ).

Definition 2.5 [11]

Let F:X×XX and g:XX. We say that (x,y)X×X is a coupled coincidence point of F and g if F(x,y)=gx and F(y,x)=gy.

3 Coupled fixed point results

Let Φ denote all functions ϕ:[0,)[0,) which satisfy

(ϕ 1) ϕ is continuous and non-decreasing,

(ϕ 2) ϕ(t)=0 if and only if t=0,

(ϕ 3) ϕ(t+s)ϕ(t)+ϕ(s), t,s[0,),

(ϕ 4) ϕ(αx)αϕ(x) for α(0,),

and let Ψ denote all functions ψ:[0,)(0,) which satisfy lim t r ψ(t)>0 for all r>0 and lim t 0 + ψ(t)=0.

Now, we state and prove our main result.

Theorem 3.1 Let (X,) be a partially ordered set and suppose there is a partial metric p on X such that (X,d) is a complete partial metric space. Let F:X×XX be a mapping having the mixed monotone property on X. Assume that there exist two elements x 0 , y 0 X with

x 0 F( x 0 , y 0 )and y 0 F( y 0 , x 0 ).

Suppose there exist ϕΦ and ψΨ such that

ϕ ( p ( F ( x , y ) , F ( u , v ) ) ) 1 2 ϕ ( p ( x , u ) + p ( y , v ) ) ψ ( p ( x , u ) + p ( y , v ) 2 )
(3)

for all x,y,u,vX with xu and yv. Suppose either

  1. (a)

    F is continuous or

  2. (b)

    X has the following property:

  3. (i)

    if a non-decreasing sequence { x n }x, then x n x, for all n,

  4. (ii)

    if a non-increasing sequence { y n }y, then y y n , for all n.

Then there exist x,yX such that

x=F(x,y)andy=F(y,x),

that is, F has a coupled fixed point in X.

Proof Let x 0 , y 0 X be such that x 0 F( x 0 , y 0 ) and y 0 F( y 0 , x 0 ). We construct sequences { x n } and { y n } in X as

x n + 1 =F( x n , y n )and y n + 1 =F( y n , x n )for all n0.
(4)

We are to prove that

x n x n + 1 for all n0
(5)

and

y n y n + 1 for all n0.
(6)

For this we shall use mathematical induction.

Let n=0. Since x 0 F( x 0 , y 0 ) and y 0 F( y 0 , x 0 ) and as x 1 =F( x 0 , y 0 ) and y 1 =F( y 0 , x 0 ), we have x 0 x 1 and y 0 y 1 . Thus (5) and (6) hold for n=0.

Suppose now that (5) and (6) hold for some fixed n0, then, since x n x n + 1 and y n y n + 1 , we have

x n + 2 =F( x n + 1 , y n + 1 )F( x n , y n + 1 )F( x n , y n )= x n + 1
(7)

and

y n + 2 =F( y n + 1 , x n + 1 )F( y n , x n + 1 )F( y n , x n )= y n + 1 .
(8)

Using (7) and (8), we get

x n + 1 x n + 2 and y n + 1 y n + 2 .

Hence, by the induction method we conclude that (5) and (6) hold for all n0. Therefore,

x 0 x 1 x 2 x n x n + 1
(9)

and

y 0 y 1 y 2 y n y n + 1 .
(10)

Since x n x n 1 and y n y n 1 , using (3) and (4), we have

ϕ ( p ( x n + 1 , x n ) ) = ϕ ( p ( F ( x n , y n ) , F ( x n 1 , y n 1 ) ) ) 1 2 ϕ ( p ( x n , x n 1 ) + p ( y n , y n 1 ) ) ψ ( p ( x n , x n 1 ) + p ( y n , y n 1 ) 2 ) .
(11)

Similarly, since y n 1 y n and x n 1 x n , using (3) and (4), we also have

ϕ ( p ( y n , y n + 1 ) ) = ϕ ( p ( F ( y n 1 , x n 1 ) , F ( y n , x n ) ) ) 1 2 ϕ ( p ( y n 1 , y n ) + p ( x n 1 , x n ) ) ψ ( p ( y n 1 , y n ) + p ( x n 1 , x n ) 2 ) .
(12)

Using (11) and (12), we have

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

By property (ϕ 3), we have

ϕ ( p ( x n + 1 , x n ) + p ( y n + 1 , y n ) ) ϕ ( p ( x n + 1 , x n ) ) +ϕ ( p ( y n + 1 , y n ) ) .
(14)

Using (13) and (14), we have

ϕ ( p ( x n + 1 , x n ) + p ( y n + 1 , y n ) ) ϕ ( p ( x n , x n 1 ) + p ( y n , y n 1 ) ) 2 ψ ( p ( x n , x n 1 ) + p ( y n , y n 1 ) 2 ) ,
(15)

which implies, since ψ is a non-negative function,

ϕ ( p ( x n + 1 , x n ) + p ( y n + 1 , y n ) ) ϕ ( p ( x n , x n 1 ) + p ( y n , y n 1 ) ) .

Using the fact that ϕ is non-decreasing, we get

p( x n + 1 , x n )+p( y n + 1 , y n )p( x n , x n 1 )+p( y n , y n 1 ).

Set

δ n =p( x n + 1 , x n )+p( y n + 1 , y n ).

Now, we show that δ n 0 as n. It is clear that the sequence { δ n } is decreasing. Therefore, there is some δ0 such that

lim n δ n = lim n [ p ( x n + 1 , x n ) + p ( y n + 1 , y n ) ] =δ.
(16)

We shall prove that δ=0. Suppose, to the contrary, that δ>0. Then taking the limit as n (equivalently, δ n δ) of both sides of (15) and remembering lim t r ψ(t)>0 for all r>0 and ϕ is continuous, we have

ϕ ( δ ) = lim n ϕ ( δ n ) lim n [ ϕ ( δ n 1 ) 2 ψ ( δ n 1 2 ) ] = ϕ ( δ ) 2 lim δ n 1 δ ψ ( δ n 1 2 ) < ϕ ( δ ) ,

a contradiction. Thus δ=0, that is,

lim n δ n = lim n [ p ( x n + 1 , x n ) + p ( y n + 1 , y n ) ] =0.
(17)

Let

δ n s = p s ( x n , x n + 1 )+ p s ( y n , y n + 1 )

for all nN. From the definition of p s , it is clear that δ n s 2 δ n for all nN. Using (17), we get

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

Now, we prove that { x n } and { y n } are Cauchy sequences in the partial metric space (X,p). From Lemma 2.1, it is sufficient to prove that { x n } and { y n } are Cauchy sequences in the metric space (X, p s ). Suppose, to the contrary, that at least one of { x n } or { y n } is not a Cauchy sequence. Then there exists an ϵ>0 for which we can find subsequences { x n ( k ) }, { x m ( k ) } of { x n } and { y n ( k ) }, { y m ( k ) } of { y n } with n(k)>m(k)k such that

p s ( x n ( k ) , x m ( k ) )+ p s ( y n ( k ) , y m ( k ) )ϵ.
(18)

Further, corresponding to m(k), we can choose n(k) in such a way that it is the smallest integer with n(k)>m(k) and satisfying (18). Then

p s ( x n ( k ) 1 , x m ( k ) )+ p s ( y n ( k ) 1 , y m ( k ) )<ϵ.
(19)

Using (18), (19) and the triangle inequality, we have

ϵ r k s : = p s ( x n ( k ) , x m ( k ) ) + p s ( y n ( k ) , y m ( k ) ) p s ( x n ( k ) , x n ( k ) 1 ) + p s ( x n ( k ) 1 , x m ( k ) ) + p s ( y n ( k ) , y n ( k ) 1 ) + p s ( y n ( k ) 1 , y m ( k ) ) p s ( x n ( k ) , x n ( k ) 1 ) + p s ( y n ( k ) , y n ( k ) 1 ) + ϵ .

Letting k and using (17), we get

lim k r k s = lim k [ p s ( x n ( k ) , x m ( k ) ) + p s ( y n ( k ) , y m ( k ) ) ] =ϵ.
(20)

By the triangle inequality,

r k s = p s ( x n ( k ) , x m ( k ) ) + p s ( y n ( k ) , y m ( k ) ) p s ( x n ( k ) , x n ( k ) + 1 ) + p s ( x n ( k ) + 1 , x m ( k ) + 1 ) + p s ( x m ( k ) + 1 , x m ( k ) ) + p s ( y n ( k ) , y n ( k ) + 1 ) + p s ( y n ( k ) + 1 , y m ( k ) + 1 ) + p s ( y m ( k ) + 1 , y m ( k ) ) = δ n ( k ) s + δ m ( k ) s + p s ( x n ( k ) + 1 , x m ( k ) + 1 ) + p s ( y n ( k ) + 1 , y m ( k ) + 1 ) .

Using the properties of ϕ, we have

ϕ ( r k s ) ϕ ( δ n ( k ) s + δ m ( k ) s + p s ( x n ( k ) + 1 , x m ( k ) + 1 ) + p s ( y n ( k ) + 1 , y m ( k ) + 1 ) ) ϕ ( δ n ( k ) s + δ m ( k ) s ) + ϕ ( p s ( x n ( k ) + 1 , x m ( k ) + 1 ) ) + ϕ ( p s ( y n ( k ) + 1 , y m ( k ) + 1 ) ) .
(21)

Now, let

r k =p( x n ( k ) , x m ( k ) )+p( y n ( k ) , y m ( k ) ).

By the definition of r k s , we have

r k s = p s ( x n ( k ) , x m ( k ) ) + p s ( y n ( k ) , y m ( k ) ) = 2 p ( x n ( k ) , x m ( k ) ) p ( x n ( k ) , x n ( k ) ) p ( x m ( k ) , x m ( k ) ) + 2 p ( y n ( k ) , y m ( k ) ) p ( y n ( k ) , y n ( k ) ) p ( y m ( k ) , y m ( k ) ) = 2 r k p ( x n ( k ) , x n ( k ) ) p ( x m ( k ) , x m ( k ) ) p ( y n ( k ) , y n ( k ) ) p ( y m ( k ) , y m ( k ) ) .
(22)

In view of property (p2) and (17), we have

lim k + p ( x n ( k ) , x n ( k ) ) = lim k + p ( x m ( k ) , x m ( k ) ) = lim k + p ( y n ( k ) , y n ( k ) ) = lim k + p ( y m ( k ) , y m ( k ) ) = 0 .

Therefore, letting k+ in (22) and using (20), we get

lim k + r k = ϵ 2 .

Since x n ( k ) x m ( k ) and y n ( k ) y m ( k ) , we have

ϕ ( p s ( x n ( k ) + 1 , x m ( k ) + 1 ) ) ϕ ( 2 p ( x n ( k ) + 1 , x m ( k ) + 1 ) ) 2 ϕ ( p ( x n ( k ) + 1 , x m ( k ) + 1 ) ) = 2 ϕ ( p ( F ( x n ( k ) , y n ( k ) ) ) , p ( F ( x m ( k ) , y m ( k ) ) ) ) ϕ ( p ( x n ( k ) , x m ( k ) ) + p ( y n ( k ) , y m ( k ) ) ) 2 ψ ( p ( x n ( k ) , x m ( k ) ) + p ( y n ( k ) , y m ( k ) ) 2 ) = ϕ ( r k ) 2 ψ ( r k 2 ) .
(23)

Similarly,

ϕ ( p s ( y n ( k ) + 1 , y m ( k ) + 1 ) ) ϕ ( 2 p ( y n ( k ) + 1 , y m ( k ) + 1 ) ) 2 ϕ ( p ( y n ( k ) + 1 , y m ( k ) + 1 ) ) = 2 ϕ ( p ( F ( y n ( k ) , x n ( k ) ) ) , p ( F ( y m ( k ) , x m ( k ) ) ) ) ϕ ( p ( y n ( k ) , y m ( k ) ) + p ( x n ( k ) , x m ( k ) ) ) 2 ψ ( p ( y n ( k ) , y m ( k ) ) + p ( x n ( k ) , x m ( k ) ) 2 ) = ϕ ( r k ) 2 ψ ( r k 2 ) .
(24)

Adding (23) and (24), we get

ϕ ( p s ( x n ( k ) + 1 , x m ( k ) + 1 ) ) +ϕ ( p s ( y n ( k ) + 1 , y m ( k ) + 1 ) ) 2ϕ( r k )4ψ ( r k 2 ) .

Thus, from (21), we have

ϕ ( r k s ) ϕ ( δ n ( k ) s + δ m ( k ) s ) +2ϕ( r k )4ψ ( r k 2 ) .

Letting k+, and using the properties of ϕ and ψ together with the inequalities established above, we have

ϕ ( ϵ ) ϕ ( 0 ) + 2 ϕ ( ϵ 2 ) 4 lim k + ψ ( r k 2 ) ϕ ( ϵ ) 4 lim r k 2 ϵ 4 ψ ( r k 2 ) ϕ ( ϵ ) 4 lim t ϵ 4 ψ ( t ) < ϕ ( ϵ ) ,
(25)

which is a contradiction. Therefore, { x n } and { y n } are Cauchy sequences in the complete metric space (X, p s ). Thus, there are x,yX such that

lim n + p s ( x n ,x)= lim n + p s ( y n ,y)=0,
(26)

which implies that

lim n + F ( x n , y n ) = lim n + x n = x , lim n + F ( y n , x n ) = lim n + y n = y .
(27)

Therefore, from Lemma 2.1, using (17) and the property (p2), we have

(28)
(29)

We now show that x=F(x,y) and y=F(y,x). Suppose that the assumption (a) holds.

As F is continuous at (x,y), so for any ϵ>0 , there exists δ>0 such that if (u,v)X×X with ν((x,y),(u,v))<ν((x,y),(x,y))+δ=δ, meaning that

p(x,u)+p(y,v)<p(x,x)+p(y,y)+δ=δ,

because p(x,x)=p(y,y)=0. Then we have

p ( F ( x , y ) , F ( u , v ) ) <p ( F ( x , y ) , F ( x , y ) ) + ϵ 2 .

Since lim n + p( x n ,x)= lim n + p( y n ,y)=0 , for η=min( δ 2 , ϵ 2 )>0, there exist n 0 , m 0 N such that, for n n 0 , m m 0 ,

p( x n ,x)<ηandp( y m ,y)<η.

Then for nN, nmax( n 0 , m 0 ), we have p( x n ,x)+p( y n ,y)<2η<δ, so we get

p ( F ( x , y ) , F ( x n , y n ) ) <p ( F ( x , y ) , F ( x , y ) ) + ϵ 2 .
(30)

Further, for any nmax( n 0 , m 0 ), by using (30), we have

p ( F ( x , y ) , x ) p ( F ( x , y ) , x n + 1 ) + p ( x n + 1 , x ) = p ( F ( x , y ) , F ( x n , y n ) ) + p ( x n + 1 , x ) p ( F ( x , y ) , F ( x , y ) ) + ϵ 2 + η p ( F ( x , y ) , F ( x , y ) ) + ϵ .
(31)

On utilizing p(x,x)=p(y,y)=0 in (3), we get

ϕ ( p ( F ( x , y ) , F ( x , y ) ) ) 1 2 ϕ ( p ( x , x ) + p ( y , y ) ) ψ ( p ( x , x ) + p ( y , y ) 2 ) = 1 2 ϕ ( 0 ) ψ ( 0 ) = ψ ( 0 ) 0 ,

which implies p(F(x,y),F(x,y))=0. Hence, for any ϵ>0, (31) implies that

p ( F ( x , y ) , x ) <ϵ.

Thus, we have F(x,y)=x. Similarly, we can show that F(y,x)=y.

Finally, suppose that (b) holds. By (5), (26) and (27), we have { x n } is a non-decreasing sequence, x n x and { y n } is a non-increasing sequence, y n y as n. Hence, by the assumption (b), we have for all n0,

x n xand y n y.
(32)

By property (p4), we have

p ( x , F ( x , y ) ) p(x, x n + 1 )+p ( x n + 1 , F ( x , y ) ) =p(x, x n + 1 )+p ( F ( x n , y n ) , F ( x , y ) ) .

Therefore,

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

Taking limit as n in the above inequality, using (31) and (29) and the properties of ϕ and ψ, we get ϕ(p(x,F(x,y)))=0, which implies p(x,F(x,y))=0. Hence, x=F(x,y). Similarly, we can show that y=F(y,x). Thus F has a coupled fixed point. □

Remark 3.1 Note that the property (ϕ 4) is utilized only to get the inequality (25). Thus the conclusion of Theorem 3.1 holds if we drop property (ϕ 4) and assume the additivity in (ϕ 3), i.e., ϕ(t+s)=ϕ(t)+ϕ(s), t,s[0,).

As an immediate consequence of the above theorem, by taking ϕ(t)=t, we have:

Corollary 3.1 Let (X,) be a partially ordered set and suppose there is a partial metric p on X such that (X,d) is a complete partial metric space. Let F:X×XX be a mapping having the mixed monotone property on X. Assume that there exist two elements x 0 , y 0 X with

x 0 F( x 0 , y 0 )and y 0 F( y 0 , x 0 ).

Suppose there exist ϕΦ and ψΨ such that

p ( F ( x , y ) , F ( u , v ) ) 1 2 ( p ( x , u ) + p ( y , v ) ) ψ ( p ( x , u ) + p ( y , v ) 2 )

for all x,y,u,vX with xu and yv. Suppose either

  1. (a)

    F is continuous or

  2. (b)

    X has the following property:

  3. (i)

    if a non-decreasing sequence { x n }x, then x n x for all n,

  4. (ii)

    if a non-increasing sequence { y n }y, then y y n for all n.

Then there exist x,yX such that

x=F(x,y)andy=F(y,x),

that is, F has a coupled fixed point in X.

Moreover, if we take ψ(t)= 1 k 2 t where k[0,1) in Corollary 3.1, we get:

Corollary 3.2 Let (X,) be a partially ordered set and suppose there is a partial metric p on X such that (X,d) is a complete partial metric space. Let F:X×XX be a mapping having the mixed monotone property on X. Assume that there exist two elements x 0 , y 0 X with

x 0 F( x 0 , y 0 )and y 0 F( y 0 , x 0 ).

Suppose there exist ϕΦ and ψΨ such that

p ( F ( x , y ) , F ( u , v ) ) k 2 ( p ( x , u ) + p ( y , v ) )

for all x,y,u,vX with xu and yv. Suppose either

  1. (a)

    F is continuous or

  2. (b)

    X has the following property:

  3. (i)

    if a non-decreasing sequence { x n }x, then x n x for all n,

  4. (ii)

    if a non-increasing sequence { y n }y, then y y n for all n.

Then there exist x,yX such that

x=F(x,y)andy=F(y,x),

that is, F has a coupled fixed point in X.

Recently, Alotaibi and Alsulami [10] extended Luong and Thuan’s [9] main result to coupled coincidences using the notion of compatible maps. Here we extend these results to partial metric spaces without the condition of compatible maps. We shall need the following lemma.

Lemma 3.1 (see [1618])

Let X be a nonempty set and g:XX be a mapping. Then there exists a subset EX such that g(E)=g(X) and g:EX is one-to-one.

Theorem 3.2 Let (X,) be a partially ordered set and suppose there is a partial metric p on X such that (X,d) is a partial metric space. Let g:XX and F:X×XX be a mapping having the mixed g-monotone property on X such that there exist two elements x 0 , y 0 X with

g x 0 F( x 0 , y 0 )andg y 0 F( y 0 , x 0 ).

Suppose there exist ϕΦ and ψΨ such that

ϕ ( p ( F ( x , y ) , F ( u , v ) ) ) 1 2 ϕ ( p ( g x , g u ) + p ( g y , g v ) ) ψ ( p ( g x , g u ) + p ( g y , g v ) 2 )
(33)

for all x,y,u,vX with gxgu and gygv. Suppose F(X×X)g(X), g is continuous and g(X) is complete and also suppose either

  1. (a)

    F is continuous or

  2. (b)

    X has the following property:

  3. (i)

    if a non-decreasing sequence { x n }x, then x n x for all n,

  4. (ii)

    if a non-increasing sequence { y n }y, then y y n for all n.

Then there exist x,yX such that

gx=F(x,y)andgy=F(y,x),

that is, F and g have a coupled coincidence point in X.

Proof Using Lemma 3.1, there exists EX such that g(E)=g(X) and g:EX is one-to-one. We define a mapping G:g(E)×g(E)X by

G(gx,gy)=F(x,y),
(34)

for all gx,gyg(E). As g is one-to-one on g(E), so G is well defined. Thus, it follows from (33) and (34) that

(35)

for all gx,gy,gu,gvg(X) for which g(x)g(u) and g(y)g(v). Since F has the mixed g-monotone property, for all gx,gyg(X),

g x 1 ,g x 2 g(X),g( x 1 )g( x 2 )implies G(g x 1 ,gy)G(g x 2 ,gy)
(36)

and

g y 1 ,g y 2 g(X),g( y 1 )g( y 2 )implies G(gx,g y 1 )G(gx,g y 2 ),
(37)

which implies that G has the mixed monotone property. Also, there exist x 0 , y 0 X such that

g( x 0 )F( x 0 , y 0 )andg( y 0 )F( y 0 , x 0 ).

This implies there exist g x 0 ,g y 0 g(X) such that

g( x 0 )G(g x 0 ,g y 0 )andg( y 0 )G(g y 0 ,g x 0 ).

Suppose that the assumption (a) holds. Since F is continuous, G is also continuous. Using Theorem 3.1 with the mapping G, it follows that G has a coupled fixed point (u,v)g(X)×g(X).

Suppose that the assumption (b) holds. We conclude similarly that the mapping G has a coupled fixed point (u,v)g(X)×g(X). Finally, we prove that F and g have a coupled coincidence point. Since (u,v) is a coupled fixed point of G, we get

u=G(u,v)andv=G(v,u).
(38)

Since (u,v)g(X)×g(X), there exists a point ( u 0 , v 0 )X×X such that

u=g u 0 andv=g v 0 .
(39)

It follows from (38) and (39) that

g u 0 =G(g u 0 ,g v 0 )andg v 0 =G(g v 0 ,g u 0 ).
(40)

Combining (34) and (40), we get

g u 0 =F( u 0 , v 0 )andg v 0 =F( v 0 , u 0 ).
(41)

Thus, ( u 0 , v 0 ) is a required coupled coincidence point of F and g. This completes the proof. □

The following coupled coincidence point theorems are obtained respectively from Corollaries 3.1 and 3.2 in a similar way as Theorem 3.2 from Theorem 3.1.

Theorem 3.3 Let (X,) be a partially ordered set, and suppose there is a partial metric p on X such that (X,p) is a partial metric space. Let g:XX and F:X×XX be a mapping having the mixed g-monotone property on X such that there exist two elements x 0 , y 0 X with

g x 0 F( x 0 , y 0 )andg y 0 F( y 0 , x 0 ).

Suppose there exist ϕΦ and ψΨ such that

ϕ ( p ( F ( x , y ) , F ( u , v ) ) ) 1 2 ( p ( g x , g u ) + p ( g y , g v ) ) ψ ( p ( g x , g u ) + p ( g y , g v ) 2 )
(42)

for all x,y,u,vX with gxgu and gygv. Suppose F(X×X)g(X), g is continuous and g(X) is complete and also suppose either

  1. (a)

    F is continuous or

  2. (b)

    X has the following property:

  3. (i)

    if a non-decreasing sequence { x n }x, then x n x for all n,

  4. (ii)

    if a non-increasing sequence { y n }y, then y y n for all n.

Then there exist x,yX such that

gx=F(x,y)andgy=F(y,x),

that is, F and g have a coupled coincidence point in X.

Theorem 3.4 Let (X,) be a partially ordered set and suppose there is a partial metric p on X such that (X,d) is a complete partial metric space. Let g:XX and F:X×XX be a mapping having the mixed g-monotone property on X such that there exist two elements x 0 , y 0 X with

g x 0 F( x 0 , y 0 )andg y 0 F( y 0 , x 0 ).

Suppose there exist ϕΦ and ψΨ such that

ϕ ( p ( F ( x , y ) , F ( u , v ) ) ) k 2 ( p ( g x , g u ) + p ( g y , g v ) )
(43)

for all x,y,u,vX with gxgu and gygv. Suppose F(X×X)g(X), g is continuous and g(X) is complete and also suppose either

  1. (a)

    F is continuous or

  2. (b)

    X has the following property:

  3. (i)

    if a non-decreasing sequence { x n }x, then x n x for all n,

  4. (ii)

    if a non-increasing sequence { y n }y, then y y n for all n.

Then there exist x,yX such that

gx=F(x,y)andgy=F(y,x),

that is, F and g have a coupled coincidence point in X.

Remark 3.2 From the proof of Theorem 3.2 we conclude that Theorems 3.3, 4.4 and 5.4 in [6] hold without the compatibility of the maps (F,g).