1 Introduction

In 2004, the study of a fixed point in partially ordered metric spaces was initiated by Ran and Reurings [1], and continued by Nieto and Lopez [2, 3]. Agarwal et al.[4] and many other authors presented some new results for contractions in partially ordered metric spaces.

In 1987, Guo and Lakshmikantham [5] introduced the concept of coupled fixed point. Afterwards, Bhaskar and Lakshmikantham [6] introduced the concept of mixed monotone property for contractive operators in partially ordered metric spaces and proved coupled fixed point theorems for mappings which satisfy the mixed monotone property. They also gave some applications on the existence and uniqueness of the coupled fixed point theorems for such mappings. As a continuation of this trend, Lakshimikantham and Ćirić [7] extended the results in [6] by defining the mixed g-monotonicity and studied the existence and uniqueness of a coupled coincidence point for such mappings which satisfy the mixed monotone property in partially ordered metric spaces. For more work on the coupled fixed point theory and coupled coincidence point theory in partially ordered metric spaces and different spaces, we refer to the reviews (see, e.g., [848]).

One of the interesting ways to develop coupled fixed point theory in partially ordered metric spaces is to consider the mapping F:X×XX without the mixed monotone property. In 2012, Sintunavarat et al. [44, 45] proved some coupled fixed point theorems for nonlinear contractions without the mixed monotone property and extended some coupled fixed point theorems of Bhaskar and Lakshmikantham [6] by using the concept of F-invariant set due to Samet and Vetro [49]. Later, Charoensawan and Klanarong [22] proved the existence and uniqueness of a coupled coincidence point in partially ordered metric spaces without the mixed g-monotone property of F:X×XX and g:XX. Recently, Kutbi et al. [48] introduced the concept of F-closed set which is weaker than the concept of F-invariant set and proved some coupled fixed point theorems without the condition of mixed monotone property. Following this trend, many authors have studied fixed point theorems for nonlinear contractions without the monotone property in several spaces (see, e.g., [14, 5056]).

Very recently, Hussain et al. [47] presented the new concept of generalized compatibility of a pair {F,G} of mappings F,G:X×XX and proved some coupled coincidence point results of such mappings without the mixed G-monotone property of F, which generalized some recent comparable results in the literature. They also gave some examples and an application to integral equations to support the result.

In this work, we give the notion of coupled g-coincidence point and the H g -increasing property of F for mappings F,H:X×XX and g:XX. We apply our results to the existence and uniqueness of a coupled g-coincidence point of the given mapping with the H g -increasing property of F and the mixed monotone property of H in partially ordered metric spaces which generalize and extend the coupled coincidence point theorem in [47].

2 Preliminaries

In this section, we give some definitions, propositions, examples, and remarks which are useful for the main results in this paper. Throughout this paper, (X,) denotes a partially ordered set with the partial order ⪯. By xy, we mean yx. Let (x,) be a partially ordered set, the partial order ⪯2 for the product set X×X defined in the following way: for all (x,y),(u,v)X×X,

(x,y) 2 (u,v)H(x,y)H(u,v)andH(v,u)H(y,x),

where H:X×XX is one-one.

We say that (x,y) is comparable to (u,v) if either (x,y) 2 (u,v) or (u,v) 2 (x,y).

Guo and Lakshmikantham [5] introduced the concept of coupled fixed point as follows.

Definition 2.1 [5]

An element (x,y)X×X is called a coupled fixed point of a mapping F:X×XX if F(x,y)=x and F(y,x)=y.

The concept of mixed monotone property was introduced by Bhaskar and Lakshmikantham in [6].

Definition 2.2 [6]

Let (X,) be a partially ordered set and F:X×XX. We say that F has the mixed monotone property if for any x,yX,

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

and

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

Lakshmikantham and Ćirić in [7] introduced the concepts of mixed g-monotone mapping and coupled coincidence point.

Definition 2.3 [7]

Let (X,) be a partially ordered set and F:X×XX and g:XX. We say that F has the mixed g-monotone property if for any x,yX,

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

and

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

Definition 2.4 [7]

An element (x,y)X×X is called a coupled coincidence point of mappings F:X×XX and g:XX if F(x,y)=gx and F(y,x)=gy.

Definition 2.5 [7]

Let X be a non-empty set and F:X×XX and g:XX. We say that F and g are commutative if gF(x,y)=F(gx,gy) for all x,yX.

Hussain et al. [47] introduced the concept of G-increasing and {F,G} generalized compatibility as follows.

Definition 2.6 [47]

Suppose that F,G:X×XX are two mappings. F is said to be G-increasing with respect to ⪯ if for all x,y,u,vX, with G(x,y)G(u,v), we have F(x,y)F(u,v).

Definition 2.7 [47]

An element (x,y)X×X is called a coupled coincidence point of mappings F,G:X×XX if F(x,y)=G(x,y) and F(y,x)=G(y,x).

Definition 2.8 [47]

Let F,G:X×XX. We say that the pair {F,G} is generalized compatible if

{ d ( F ( G ( x n , y n ) , G ( y n , x n ) ) , G ( F ( x n , y n ) , F ( y n , x n ) ) ) 0 as  n + , d ( F ( G ( y n , x n ) , G ( x n , y n ) ) , G ( F ( y n , x n ) , F ( x n , y n ) ) ) 0 as  n + ,

whenever ( x n ) and ( y n ) are sequences in X such that

{ lim n F ( x n , y n ) = lim n G ( x n , y n ) = t 1 , lim n F ( y n , x n ) = lim n G ( y n , x n ) = t 2 .

Definition 2.9 [47]

Let F,G:X×XX be two maps. We say that the pair {F,G} is commuting if

F ( G ( x , y ) , G ( y , x ) ) =G ( F ( x , y ) , F ( y , x ) ) for all x,yX.

Let Θ denote the set of all functions ϕ:[0,)[0,) such that:

  1. (i)

    ϕ is continuous and increasing,

  2. (ii)

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

  3. (iii)

    ϕ(t+s)ϕ(t)+ϕ(s) for all t,s[0,).

Let Ψ be the set of all functions ψ:[0,)[0,) such that lim t r ψ(t)>0 for all r>0 and lim t 0 + ψ(t)=0.

Hussain et al. [47] proved the coupled coincidence point for such mappings involving the (ψ,ϕ)-contractive condition as follows.

Theorem 2.10 [47]

Let (X,) be a partially ordered set and M be a non-empty subset of X 4 , and let d be a metric on X such that (X,d) is a complete metric space. Assume that F,G:X×XX are two generalized compatible mappings such that F is G-increasing with respect to ⪯, G is continuous and has the mixed monotone property. Suppose that for any x,yX, there exist u,vX such that F(x,y)=G(u,v) and F(y,x)=G(v,u). Suppose that there exist ϕΘ and ψΨ such that the following holds:

ϕ ( d ( F ( x , y ) , F ( u , v ) ) ) 1 2 ϕ ( d ( G ( x , y ) , G ( u , v ) ) + d ( G ( y , x ) , G ( v , u ) ) ) ψ ( d ( G ( x , y ) , G ( u , v ) ) + d ( G ( y , x ) , G ( v , u ) ) 2 )

for all x,y,u,vX with G(x,y)G(u,v) and G(y,x)G(v,u).

Also suppose that either

  1. (a)

    F is continuous, or

  2. (b)

    X has the following properties: for any two sequences { x n } and { y n }

    1. (i)

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

    2. (ii)

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

If there exists ( x 0 , y 0 )X×X with

G( x 0 , y 0 )F( x 0 , y 0 )andG( y 0 , x 0 )F( y 0 , x 0 ),

then there exists (x,y)X×X such that G(x,y)=F(x,y) and G(y,x)=F(y,x), that is, F and G have a coupled coincidence point.

Kutbi et al. [48] introduced the notion of F-closed set which extended the notion of F-invariant set as follows.

Definition 2.11 [48]

Let F:X×XX be a mapping, and let M be a subset of X 4 . We say that M is an F-closed subset of X 4 if, for all x,y,u,vX,

(x,y,u,v)M ( F ( x , y ) , F ( y , x ) , F ( u , v ) , F ( v , u ) ) M.

Now, we give the notion of a coupled g-coincidence point and a ( H g ,F)-closed set which is useful for our main results.

Definition 2.12 Suppose that F,H:X×XX are two mappings and g:XX. F is said to be H g -increasing with respect to ⪯ if for all x,y,u,vX, with H(gx,gy)H(gu,gv), we have F(x,y)F(u,v).

Example 2.13 Let X=N endowed with the natural ordering of real number ≤. Define the mappings F,H:X×XX and g:XX by F(x,y)= ( x + y ) 2 , H(x,y)=x+y and gx=x/2 for all x,yX. Note that F is H g -increasing with respect to ≤.

Example 2.14 Let X=R endowed with the natural ordering of real number ≤. Define the mappings F,H:X×XX and g:XX by F(x,y)=2+yx, H(x,y)=xy and gx=1x for all x,yX. Note that F is H g -increasing with respect to ≤ but not H-increasing. If H(x,y)=xyH(u,v)=uv, then F(x,y)=2+yxF(u,v)=2+vu, but if H(gx,gy)=yxH(gu,gv)=vu, then F(x,y)=2+yxF(u,v)=2+vu.

Definition 2.15 An element (x,y)X×X is called a coupled g-coincidence point of mappings F,H:X×XX and g:XX if F(x,y)=H(gx,gy) and F(y,x)=H(gy,gx).

Example 2.16 Let X=R endowed with the natural ordering of real number ≤. Define the mappings F,H:X×XX and g:XX by F(x,y)= x 2 + 3 y 2 2 , H(x,y)=x+y and gx= x 2 for all x,yX. Note that (0,0) is a coupled g-coincidence point.

Definition 2.17 Let (X,d) be a metric space and F,H:X×XX be two mappings and g:XX. Let M be a subset of X 4 . We say that M is an ( H g ,F)-closed subset of X 4 if for all x,y,u,vX,

( H ( g x , g y ) , H ( g y , g x ) , H ( g u , g v ) , H ( g v , g u ) ) M ( F ( x , y ) , F ( y , x ) , F ( u , v ) , F ( v , u ) ) M .

Definition 2.18 Let (X,d) be a metric space and H:X×XX be a given mapping. Let M be a subset of X 4 . We say that M satisfies the transitive property if and only if, for all x,y,u,v,a,bX,

( H ( x , y ) , H ( y , x ) , H ( u , v ) , H ( v , u ) ) M and ( H ( u , v ) , H ( v , u ) , H ( a , b ) , H ( b , a ) ) M ( H ( x , y ) , H ( y , x ) , H ( a , b ) , H ( b , a ) ) M .

Remark The set M= X 4 is a trivially ( H g ,F)-closed set, which satisfies the transitive property.

Example 2.19 Let X={0,1,2,3} endowed with the usual metric and F,H:X×XX be defined by

F(x,y)={ 1 , x , y { 1 , 2 } , 3 , otherwise ,

and

H(x,y)={ 1 , x , y { 0 , 1 } , 3 , otherwise .

Let g:XX be defined by

g(x)={ 1 , x { 1 , 2 } , 3 , otherwise .

It is easy to see that M= { 0 , 1 } 4 X 4 is an ( H g ,F)-closed set but not an F-closed set.

Definition 2.20 Let F,H:X×XX and g:XX. We say that the pair {F,H} is g-generalized compatible if

{ d ( F ( H ( g x n , g y n ) , H ( g y n , g x n ) ) , H ( g F ( x n , y n ) , g F ( y n , x n ) ) ) 0 as  n + , d ( F ( H ( g y n , g x n ) , H ( g x n , g y n ) ) , H ( g F ( y n , x n ) , g F ( x n , y n ) ) ) 0 as  n + ,

whenever ( x n ),(g x n ),( y n ), and (g y n ) are sequences in X such that

{ lim n F ( x n , y n ) = lim n H ( g x n , g y n ) = t 1 , lim n F ( y n , x n ) = lim n H ( g y n , g x n ) = t 2 .

Example 2.21 Let (X,d) be a metric space endowed with a partial order ⪯. Let g:XX and F,H:X×XX be two mappings such that F is H g -increasing with respect to ⪯. Define a subset M X 4 by

M= { ( x , y , u , v ) X 4 : x u , y v } .

Let (H(gx,gy),H(gy,gx),H(gu,gv),H(gv,gu))M. Since F is H g -increasing with respect to ⪯, we have F(x,y)F(u,v) and F(y,x)F(v,u), and this implies that (F(x,y),F(y,x),F(u,v),F(v,u))M. Then M is an ( H g ,F)-closed subset of X 4 which satisfies the transitive property.

3 Main results

Let Φ denote the set of functions φ:[0,)[0,) satisfying

  1. 1.

    φ(t)<t for all t>0,

  2. 2.

    lim r t + φ(r)<t for all t>0.

Now, we state our first main theorem which guarantees a coupled g-coincidence point.

Theorem 3.1 Let (X,d) be a complete metric space and M be a non-empty subset of X 4 . Assume that g:XX is continuous and F,H:X×XX are two generalized compatible mappings such that H is continuous, and for any x,yX, there exist u,vX such that F(x,y)=H(gu,gv) and F(y,x)=H(gv,gu). Suppose that there exists φΦ such that the following holds:

d ( F ( x , y ) , F ( u , v ) ) + d ( F ( y , x ) , F ( v , u ) ) φ ( d ( H ( g x , g y ) , H ( g u , g v ) ) + d ( H ( g y , g x ) , H ( g v , g u ) ) )
(1)

for all x,y,u,vX with (H(gx,gy),H(gy,gx),H(gu,gv),H(gv,gu))M.

Also suppose that F is continuous. If there exists ( x 0 , y 0 )X such that

( H ( g x 0 , g y 0 ) , H ( g y 0 , g x 0 ) , F ( x 0 , y 0 ) , F ( y 0 , x 0 ) ) M

and M is ( H g ,F)-closed, then there exists (x,y)X×X such that H(gx,gy)=F(x,y) and H(gy,gx)=F(y,x), that is, F and H have a coupled g-coincidence point.

Proof Let x 0 , y 0 X be such that

( H ( g x 0 , g y 0 ) , H ( g y 0 , g x 0 ) , F ( x 0 , y 0 ) , F ( y 0 , x 0 ) ) M.

From the assumption, there exist ( x 1 , y 1 )X×X such that

F( x 0 , y 0 )=H(g x 1 ,g y 1 )andF( y 0 , x 0 )=H(g y 1 ,g x 1 ).

Again from assumption, we can choose x 2 , y 2 X such that

F( x 1 , y 1 )=H(g x 2 ,g y 2 )andF( y 1 , x 1 )=H(g y 2 ,g x 2 ).

By repeating this argument, we can construct sequences such that for all n1,

F( x n , y n )=H(g x n + 1 ,g y n + 1 )andF( y n , x n )=H(g y n + 1 ,g x n + 1 ).
(2)

Since (H(g x 0 ,g y 0 ),H(g y 0 ,g x 0 ),F( x 0 , y 0 ),F( y 0 , x 0 ))M and M is ( H g ,F)-closed, we get

Again, using the fact that M is ( H g ,F)-closed, we have

Continuing this process, for all n0, we get

( H ( g x n , g y n ) , H ( g y n , g x n ) , H ( g x n + 1 , g y n + 1 ) , H ( g y n + 1 , g x n + 1 ) ) M.
(3)

For all n0, denote

δ n :=d ( H ( g x n , g y n ) , H ( g x n + 1 , g y n + 1 ) ) +d ( H ( g y n , g x n ) , H ( g y n + 1 , g x n + 1 ) ) .
(4)

We can suppose that δ n >0 for all n0. If not, ( x n , y n ) will be a coupled g-coincidence point and the proof is finished. From (1), (2) and (3), we have

d ( H ( g x n + 1 , g y n + 1 ) , H ( g x n + 2 , g y n + 2 ) ) + d ( H ( g y n + 1 , g x n + 1 ) , H ( g y n + 2 , g x n + 2 ) ) = d ( F ( x n , y n ) , F ( x n + 1 , y n + 1 ) ) + d ( F ( y n , x n ) , F ( y n + 1 , x n + 1 ) ) φ ( d ( H ( g x n , g y n ) , H ( g x n + 1 , g y n + 1 ) ) + d ( H ( g y n , g x n ) , H ( g y n + 1 , g x n + 1 ) ) ) = φ ( δ n ) .
(5)

Therefore, the sequence { δ n } n = 1 satisfies

δ n + 1 φ( δ n )for all n0.
(6)

Using the property of φ, it follows that the sequence { δ n } n = 1 is decreasing. Therefore, there exists some δ0 such that

lim n δ n =δ.
(7)

We shall prove that δ=0. Assume, to the contrary, that δ>0. Then by letting n in (6) and using the property of φ, we have

δ= lim n δ n + 1 lim n φ( δ n )= lim δ n δ + φ( δ n )<δ,

a contradiction. Thus δ=0 and hence

lim n δ n =0.
(8)

We now prove that { H ( g x n , g y n ) } n = 1 and { H ( g y n , g x n ) } n = 1 are Cauchy sequences in (X,d). Suppose, to the contrary, that at least one of the sequences { H ( g x n , g y n ) } n = 1 or { H ( g y n , g x n ) } n = 1 is not a Cauchy sequence. Then there exists ϵ>0 for which we can find subsequences {H(g x m ( k ) ,g y m ( k ) )}, {H(g x n ( k ) ,g y n ( k ) )} of { H ( g x n , g y n ) } n = 1 and {H(g y m ( k ) ,g x m ( k ) )}, {H(g y n ( k ) ,g x n ( k ) )} of { H ( g y n , g x n ) } n = 1 , respectively, with n(k)>m(k)k such that

D k : = d ( H ( g x m ( k ) , g y m ( k ) ) , H ( g x n ( k ) , g y n ( k ) ) ) + d ( H ( g y m ( k ) , g x m ( k ) ) , H ( g y n ( k ) , g x n ( k ) ) ) > ϵ .
(9)

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)k satisfying (9). Then

d ( H ( g x m ( k ) , g y m ( k ) ) , H ( g x n ( k ) 1 , g y n ( k ) 1 ) ) + d ( H ( y m ( k ) , x m ( k ) ) , H ( g y n ( k ) 1 , g x n ( k ) 1 ) ) ϵ .
(10)

Using (9), (10), and the triangle inequality, we have

ϵ < D k d ( H ( g x m ( k ) , g y m ( k ) ) , H ( g x n ( k ) 1 , g y n ( k ) 1 ) ) + d ( H ( g x n ( k ) 1 , g y n ( k ) 1 ) , H ( g x n ( k ) , g y n ( k ) ) ) + d ( H ( g y m ( k ) , g x m ( k ) ) , H ( g y n ( k ) 1 , g x n ( k ) 1 ) ) + d ( H ( g y n ( k ) 1 , g x n ( k ) 1 ) , H ( g y n ( k ) , g x n ( k ) ) ) ϵ + δ n ( k ) 1 .
(11)

Letting k in (11) and using (8), we get

lim n D k =ϵ.
(12)

Again, for all k0, we have

D k d ( H ( g x m ( k ) , g y m ( k ) ) , H ( g x m ( k ) + 1 , g y m ( k ) + 1 ) ) + d ( H ( g x m ( k ) + 1 , g y m ( k ) + 1 ) , H ( g x n ( k ) + 1 , g y n ( k ) + 1 ) ) + d ( H ( g x n ( k ) + 1 , g y n ( k ) + 1 ) , H ( g x n ( k ) , g y n ( k ) ) ) + d ( H ( g y m ( k ) , g x m ( k ) ) , H ( g y m ( k ) + 1 , g x m ( k ) + 1 ) ) + d ( H ( g y m ( k ) + 1 , g x m ( k ) + 1 ) , H ( g y n ( k ) + 1 , g x n ( k ) + 1 ) ) + d ( H ( g y n ( k ) + 1 , g x n ( k ) + 1 ) , H ( g y n ( k ) , g x n ( k ) ) ) δ m ( k ) + δ n ( k ) + d ( H ( g x m ( k ) + 1 , g y m ( k ) + 1 ) , H ( g x n ( k ) + 1 , g y n ( k ) + 1 ) ) + d ( H ( g y m ( k ) + 1 , g x m ( k ) + 1 ) , H ( g y n ( k ) + 1 , g x n ( k ) + 1 ) ) .
(13)

From (3) and n(k)>m(k), we have

( H ( g x m ( k ) , g y m ( k ) ) , H ( g y m ( k ) , g x m ( k ) ) , H ( g x m ( k ) + 1 , g y m ( k ) + 1 ) , H ( g y m ( k ) + 1 , g x m ( k ) + 1 ) ) M

and

( H ( g x m ( k ) + 1 , g y m ( k ) + 1 ) , H ( g y m ( k ) + 1 , g x m ( k ) + 1 ) , H ( g x m ( k ) + 2 , g y m ( k ) + 2 ) , H ( g y m ( k ) + 2 , g x m ( k ) + 2 ) ) M .

Using M has the transitive property, we get

( H ( g x m ( k ) , g y m ( k ) ) , H ( g y m ( k ) , g x m ( k ) ) , H ( g x m ( k ) + 2 , g y m ( k ) + 2 ) , H ( g y m ( k ) + 2 , g x m ( k ) + 2 ) ) M .

Continuing this process, we have

( H ( g x m ( k ) , g y m ( k ) ) , H ( g y m ( k ) , g x m ( k ) ) , H ( g x n ( k ) , g y n ( k ) ) , H ( g y n ( k ) , g x n ( k ) ) ) M .
(14)

From (1),(2) and (14), we have

d ( H ( g x m ( k ) + 1 , g y m ( k ) + 1 ) , H ( g y n ( k ) + 1 , g x n ( k ) + 1 ) ) + d ( H ( g x m ( k ) + 1 , g y m ( k ) + 1 ) , H ( g y n ( k ) + 1 , g x n ( k ) + 1 ) ) = d ( F ( x m ( k ) , y m ( k ) ) , F ( x n ( k ) , y n ( k ) ) ) + d ( F ( y m ( k ) , x m ( k ) ) , F ( y n ( k ) , x n ( k ) ) ) φ ( d ( H ( g x m ( k ) , g y m ( k ) ) , H ( g x n ( k ) , g y n ( k ) ) ) + d ( H ( g y m ( k ) , g x m ( k ) ) , H ( g y n ( k ) , g x n ( k ) ) ) ) = φ ( D k ) ,
(15)

which, by (13), yields

D k δ m ( k ) + δ n ( k ) +φ( D k ).
(16)

Letting k in the above inequality and using (8) and (12), we get

ϵ= lim k D k lim k ( δ m ( k ) + δ n ( k ) + φ ( D k ) ) = lim D k ϵ + φ( D k )<ϵ,

which is a contradiction. Hence, { H ( g x n , g y n ) } n = 1 and { H ( g y n , g x n ) } n = 1 are Cauchy sequences in (X,d). Since (X,d) is complete and (2), there exist x,yX such that

lim n H ( g x n , g y n ) = lim n F ( x n , y n ) = x and lim n H ( g y n , g x n ) = lim n F ( y n , x n ) = y .
(17)

Since the pair {F,H} satisfies the generalized compatibility, from (17) we have

lim n d ( F ( H ( g x n , g y n ) , H ( g y n , g x n ) ) , H ( g F ( x n , y n ) , g F ( y n , x n ) ) ) = 0 and lim n d ( F ( H ( g y n , g x n ) , H ( g x n , g y n ) ) , H ( g F ( y n , x n ) , g F ( x n , y n ) ) ) = 0 .
(18)

Since F is continuous, for all n0, by the triangle inequality, we have

d ( H ( g x , g y ) , F ( H ( g x n , g y n ) , H ( g y n , g x n ) ) ) d ( H ( g x , g y ) , H ( g F ( x n , y n ) , g F ( y n , x n ) ) ) + d ( H ( g F ( x n , y n ) , g F ( y n , x n ) ) , F ( H ( g x n , g y n ) , H ( g y n , g x n ) ) )
(19)

and

d ( H ( g y , g x ) , F ( H ( g y n , g x n ) , H ( g x n , g y n ) ) ) d ( H ( g y , g x ) , H ( g F ( y n , x n ) , g F ( x n , y n ) ) ) + d ( H ( g F ( y n , x n ) , g F ( x n , y n ) ) , F ( H ( g y n , g x n ) , H ( g x n , g y n ) ) ) .
(20)

Taking the limit as n in (19) and (20), using (17),(18), and the fact that H, F and g are continuous, we have

H(gx,gy)=F(x,y)andH(gy,gx)=F(y,x).
(21)

Therefore, (x,y) is a coupled g-coincidence point of F and H. □

In our next theorem, we drop the continuity of F.

Theorem 3.2 Let (X,d) be a complete metric space and M be a non-empty subset of X 4 . Assume that g:XX is continuous and F,H:X×XX are two generalized compatible mappings such that H is continuous and for any x,yX, there exist u,vX such that F(x,y)=H(gu,gv) and F(y,x)=H(gv,gu). Suppose that there exists φΦ such that the following holds:

d ( F ( x , y ) , F ( u , v ) ) + d ( F ( y , x ) , F ( v , u ) ) φ ( d ( H ( g x , g y ) , H ( g u , g v ) ) + d ( H ( g y , g x ) , H ( g v , g u ) ) )

for all x,y,u,vX with (H(gx,gy),H(gy,gx),H(gu,gv),H(gv,gu))M.

Also suppose that (g(X),d) is a complete metric space, H(X×X)g(X) and any two sequences { x n } and { y n } with ( x n , y n , x n + 1 , y n + 1 )M and {H( x n , y n )}H(x,y), {H( y n , x n )}H(y,x) for all n1 implies

( H ( x n , y n ) , H ( y n , x n ) , H ( x , y ) , H ( y , x ) ) M

for all n1. If there exist x 0 , y 0 X such that

( H ( g x 0 , g y 0 ) , H ( g y 0 , g x 0 ) , F ( x 0 , y 0 ) , F ( y 0 , x 0 ) ) M

and M is ( H g ,F)-closed, then there exists (x,y)X×X such that H(gx,gy)=F(x,y) and H(gy,gx)=F(y,x), that is, F and H have a coupled g-coincidence point.

Proof As in the proof of Theorem 3.1. Since (g(X),d) is complete, there exist x,yX such that gx,gyg(X), and we have

lim n H ( g x n , g y n ) = lim n F ( x n , y n ) = g x and lim n H ( g y n , g x n ) = lim n F ( y n , x n ) = g y .
(22)

Since the pair {F,H} satisfies the generalized compatibility, H is continuous and by (3), we have

lim n H ( H ( g x n , g y n ) , H ( g y n , g x n ) ) = H ( g x , g y ) = lim n H ( F ( x n , y n ) , F ( y n , x n ) ) = lim n F ( H ( g x n , g y n ) , H ( g y n , g x n ) )
(23)

and

lim n H ( H ( g y n , g x n ) , H ( g x n , g y n ) ) = H ( g y , g x ) = lim n H ( F ( y n , x n ) , F ( x n , y n ) ) = lim n F ( H ( g y n , g x n ) , H ( g x n , g y n ) ) .
(24)

From (3), (23), (24), by assumption, for all n1, we have

( H ( H ( g x n , g y n ) , H ( g y n , g x n ) ) , H ( H ( g y n , g x n ) , H ( g x n , g y n ) ) , H ( g x , g y ) , H ( g y , g x ) ) M .
(25)

Then, by (1), (2), (25), and the triangle inequality, we have

d ( H ( g x , g y ) , F ( x , y ) ) + d ( H ( g y , g x ) , F ( y , x ) ) d ( H ( g x , g y ) , F ( H ( g x n , g y n ) , H ( g y n , g x n ) ) ) + d ( F ( H ( g x n , g y n ) , H ( g y n , g x n ) ) , F ( x , y ) ) + d ( H ( g y , g x ) , F ( H ( g y n , g x n ) , H ( g x n , g y n ) ) ) + d ( F ( H ( g y n , g x n ) , H ( g x n , g y n ) ) , F ( y , x ) ) φ ( d ( H ( H ( g x n , g y n ) , H ( g y n , g x n ) ) , H ( g x , g y ) ) + d ( H ( H ( g y n , g x n ) , H ( g x n , g y n ) ) , H ( g y , g x ) ) ) + d ( H ( g x , g y ) , F ( H ( g x n , g y n ) , H ( g y n , g x n ) ) ) + d ( H ( g y , g x ) , F ( H ( g y n , g x n ) , H ( g x n , g y n ) ) ) .

Letting now n in the above inequality and using the property of φ that lim r 0 + φ(r)=0, we have

d ( H ( g x , g y ) , F ( x , y ) ) +d ( H ( g y , g x ) , F ( y , x ) ) =0,

which implies that H(gx,gy)=F(x,y) and H(gy,gx)=F(y,x). □

Next, we give an example to validate Theorem 3.1.

Example 3.3 Let X=[0,1], d(x,y)=|xy| and F,H:X×XX be defined by

F(x,y)= x 2 + y 2 16 andH(x,y)=x+y.

Let g:XX be defined by gx= x 2 . Clearly, H does not satisfy the mixed monotone property. Now, we prove that for any x,yX, there exist u,vX such that F(x,y)=H(gu,gv) and F(y,x)=H(gv,gu). It is easy to see that there exist u= x 2 8 , v= y 2 8 X such that

F(x,y)=H ( x 2 16 , y 2 16 ) =H(gu,gv),F(y,x)=H ( y 2 16 , x 2 16 ) =H(gv,gu).

Now, we prove that the pair {F,H} satisfies the generalized compatibility hypothesis. Let { x n } n = 1 and { y n } n = 1 be two sequences in X such that

t 1 = lim n F ( x n , y n ) = lim n H ( g x n , g y n ) and t 2 = lim n F ( y n , x n ) = lim n H ( g y n , g x n ) .

Then we must have t 1 =0= t 2 , and it is easy to prove that

{ lim n d ( F ( H ( x n , y n ) , H ( y n , x n ) ) , H ( g F ( x n , y n ) , g F ( y n , x n ) ) ) = 0 lim n d ( F ( H ( y n , x n ) , H ( x n , y n ) ) , H ( g F ( y n , x n ) , g F ( x n , y n ) ) ) = 0 .

Now, for all x,y,u,vX with (H(gx,gy),H(gy,gx),H(gu,gv),H(gv,gu))M= X 4 , and let φ:[0,+)[0,+) be a function defined by φ(t)= t 4 , then we have

d ( F ( x , y ) , F ( u , v ) ) + d ( F ( y , x ) , F ( v , u ) ) = | x 2 + y 2 16 u 2 + v 2 16 | + | y 2 + x 2 16 v 2 + u 2 16 | = 2 | ( x 2 u 2 ) + ( y 2 v 2 ) 16 | = 2 | ( x u ) ( x + u ) 16 + ( y v ) ( y + v ) 16 | 1 4 | ( x + y ) ( u + v ) | = φ ( | ( x + y ) ( u + v ) | ) = φ ( | ( x + y ) 2 ( u + v ) 2 | + | ( y + x ) 2 ( v + u ) 2 | ) = φ ( d ( H ( g x , g y ) , H ( g u , g v ) ) + d ( H ( g y , g x ) , H ( g v , g u ) ) ) .

Therefore, condition (1) is satisfied. Thus, all the requirements of Theorem 3.1 are satisfied and (0,0) is a coupled g-coincidence point of F and H.

Example 3.4 Let X=[0,1], d(x,y)=|xy| and F,H:X×XX be defined by

F(x,y)={ x 2 y 2 8 if  x y , 0 if  x < y .

and

H(x,y)={ x + y if  x y , 0 if  x < y .

Let g:XX by gx= x 2 . Clearly, H does not satisfy the mixed monotone property and if x>y, u=v0, consider

H ( g x , g y ) H ( g u , g v ) x + y 2 u + v 2 but  F ( x , y ) = x 2 y 2 8 = ( x y ) ( x + y ) 8 > 0 = F ( u , v ) .

Then F is not H g -increasing.

Now, we prove that for any x,yX, there exist u,vX such that F(x,y)=H(gu,gv) and F(y,x)=H(gv,gu). It is easy to see the following cases.

Case 1: If x=y, then we have F(y,x)=F(x,y)=0=H(g0,g0)=H(0,0).

Case 2: If x>y, then (xy)x>(xy)y, and we have

F(x,y)= x 2 y 2 8 = ( x y ) x + ( x y ) y 8 =H ( g ( x y ) x 4 , g ( x y ) y 4 )

and

F(y,x)=0=H ( g ( x y ) y 4 , g ( x y ) x 4 ) .

Case 3: If y>x, then (yx)y>(yx)x, and we have

F(y,x)= y 2 x 2 8 = ( y x ) y + ( y x ) x 8 =H ( g ( y x ) y 4 , g ( y x ) x 4 )

and

F(x,y)=0=H ( g ( y x ) x 4 , g ( y x ) y 4 ) .

Now, we prove that the pair {F,G} satisfies the generalized compatibility hypothesis. Let { x n } n = 1 and { y n } n = 1 be two sequences in X such that

t 1 = lim n F ( x n , y n ) = lim n G ( g x n , g y n ) and t 2 = lim n F ( y n , x n ) = lim n G ( g y n , g x n ) .

Then we must have t 1 =0= t 2 , and it is easy to prove that

{ lim n d ( F ( H ( x n , y n ) , H ( y n , x n ) ) , H ( g F ( x n , y n ) , g F ( y n , x n ) ) ) = 0 , lim n d ( F ( H ( y n , x n ) , H ( x n , y n ) ) , H ( g F ( y n , x n ) , g F ( x n , y n ) ) ) = 0 .

Now, for all x,y,u,vX with (H(gx,gy),H(gy,gx),H(gu,gv),H(gv,gu))M= X 4 , and let φ:[0,+)[0,+) be a function defined by φ(t)= t 4 , then we have

d ( F ( x , y ) , F ( u , v ) ) + d ( F ( y , x ) , F ( v , u ) ) = | x 2 y 2 8 u 2 v 2 8 | + | y 2 x 2 8 v 2 u 2 8 | = 2 | x 2 y 2 8 u 2 v 2 8 | = 2 | ( x y ) ( x + y ) 8 ( u v ) ( u + v ) 8 | 1 4 | ( x + y ) ( u + v ) | = φ ( | ( x + y ) ( u + v ) | ) = φ ( | ( x + y ) 2 ( u + v ) 2 | + | ( y + x ) 2 ( v + u ) 2 | ) = φ ( d ( H ( g x , g y ) , H ( g u , g v ) ) + d ( H ( g y , g x ) , H ( g v , g u ) ) ) .

Therefore, condition (1) is satisfied. Thus, all the requirements of Theorem 3.1 are satisfied and (0,0) is a coupled g-coincidence point of F and H.

Next, we show the uniqueness of the coupled coincidence point and the coupled fixed point of F and H.

Theorem 3.5 In addition to the hypotheses of Theorem 3.1, suppose that for every (x,y),(z,t)X×X, there exists (u,v)X×X such that

( H ( g x , g y ) , H ( g y , g x ) , H ( g u , g v ) , H ( g v , g u ) ) M and ( H ( g z , g t ) , H ( g t , g z ) , H ( g u , g v ) , H ( g v , g u ) ) M .

Then F and G have a unique coupled g-coincidence point.

Proof From Theorem 3.1, we know that F and H have a coupled g-coincidence point. Suppose that (x,y),(z,t) are coupled g-coincidence points of F and H, that is,

F ( x , y ) = H ( g x , g y ) , F ( y , x ) = H ( g y , g x ) and F ( z , t ) = H ( g z , g t ) , F ( t , z ) = H ( g t , g z ) .
(26)

Now, we show that H(gx,gy)=H(gz,gt) and H(gy,gx)=H(gt,gz). By the hypothesis, there exists (u,v)X×X such that

( H ( g x , g y ) , H ( g y , g x ) , H ( g u , g v ) , H ( g v , g u ) ) M and ( H ( g z , g t ) , H ( g t , g z ) , H ( g u , g v ) , H ( g v , g u ) ) M .

We put g u 0 =gu and g v 0 =gv and define two sequences { H ( g u n , g v n ) } n = 1 and { H ( g v n , g u n ) } n = 1 as follows:

F ( u n , v n ) = H ( g u n + 1 , g v n + 1 ) and F ( v n , u n ) = H ( g v n + 1 , g u n + 1 ) for all  n 0 .

Since M is ( H g ,F)-closed and (H(gx,gy),H(gy,gx),H(gu,gv),H(gv,gu))M, we have

From (H(gx,gy),H(gy,gx),H(g u 1 ,g v 1 ),H(g v 1 ,g u 1 ))M, if we use again the property of ( H g ,F)-closed, then

By repeating this process, we get

( H ( g x , g y ) , H ( g y , g x ) , H ( g u n , g v n ) , H ( g v n , g u n ) ) Mfor all n0.
(27)

Using (1), (26) and (27), we have

d ( H ( g x , g y ) , H ( g u n + 1 , g v n + 1 ) ) + d ( H ( g y , g x ) , H ( g v n + 1 , g u n + 1 ) ) = d ( F ( x , y ) , F ( u n , v n ) ) + d ( F ( y , x ) , F ( v n , u n ) ) φ ( d ( H ( g x , g y ) , H ( g u n , g v n ) ) + d ( H ( g y , g x ) , H ( g v n , g u n ) ) ) for all  n .
(28)

Using the property that φ(t)<t and repeating this process, we get

d ( H ( g x , g y ) , H ( g u n + 1 , g v n + 1 ) ) + d ( H ( g y , g x ) , H ( g v n + 1 , g u n + 1 ) ) φ n ( d ( H ( g x , g y ) , H ( g u 1 , g v 1 ) ) + d ( H ( g y , g x ) , H ( g v 1 , g u 1 ) ) ) for all  n .
(29)

From φ(t)<t and lim r t + φ(r)<t, it follows that lim n φ n (t)=0 for each t>0. Therefore, from (29) we have

lim n ( d ( H ( g x , g y ) , H ( g u n + 1 , g v n + 1 ) ) + d ( H ( g y , g x ) , H ( g v n + 1 , g u n + 1 ) ) ) =0.
(30)

This implies that

lim n d ( H ( g x , g y ) , H ( g u n + 1 , g v n + 1 ) ) = 0 and lim n d ( H ( g y , g x ) , H ( g v n + 1 , g u n + 1 ) ) = 0 .
(31)

Similarly, we show that

lim n d ( H ( g z , g t ) , H ( g u n + 1 , g v n + 1 ) ) = 0 and lim n d ( H ( g t , g z ) , H ( g v n + 1 , g u n + 1 ) ) = 0 .
(32)

From (31) and (32), we have

H(gx,gy)=H(gz,gt)andH(gy,gx)=H(gt,gz).
(33)

 □

Next, we give some application of our results to coupled coincidence point theorems in partially metric spaces with F is H g -increasing with respect to ⪯ and H has the mixed monotone property.

Corollary 3.6 Let (X,) be a partially ordered set and M be a non-empty subset of X 4 , and let d be a metric on X such that (X,d) is a complete metric space. Assume that g:XX is continuous and F,H:X×XX are two generalized compatible mappings such that F is H g -increasing with respect to ⪯, H is continuous and has the mixed monotone property. Suppose that for any x,yX, there exist u,vX such that F(x,y)=H(gu,gv) and F(y,x)=H(gv,gu). Suppose that there exists φΦ such that the following holds:

d ( F ( x , y ) , F ( u , v ) ) + d ( F ( y , x ) , F ( v , u ) ) φ ( d ( H ( g x , g y ) , H ( g u , g v ) ) + d ( H ( g y , g x ) , H ( g v , g u ) ) )

for all x,y,u,vX with H(gx,gy)H(gu,gv) and H(gy,gx)H(gv,gu).

Also suppose that F is continuous. If there exist x 0 , y 0 X such that

H(g x 0 ,g y 0 )F( x 0 , y 0 )andH(g y 0 ,g x 0 )F( y 0 , x 0 ),

and M is ( H g ,F)-closed, then there exists (x,y)X×X such that H(gx,gy)=F(x,y) and H(gy,gx)=F(y,x), that is, F and H have a coupled g-coincidence point.

Proof We define the subset M X 4 by

M= { ( x , y , u , v ) X 4 : x u  and  y v } .

From Example 2.21, M is an ( H g ,F)-closed set which satisfies the transitive property. For all x,y,u,vX with (H(gx,gy)H(gu,gv) and H(gy,gx)H(gv,gu)), we have (H(gx,gy),H(gy,gx),H(gu,gv),H(gv,gu))M. By (1),we get

d ( F ( x , y ) , F ( u , v ) ) + d ( F ( y , x ) , F ( v , u ) ) φ ( d ( H ( g x , g y ) , H ( g u , g v ) ) + d ( H ( g y , g x ) , H ( g v , g u ) ) ) .

Since ( x 0 , y 0 )X×X with

H(g x 0 ,g y 0 )F( x 0 , y 0 )andH(g y 0 ,g x 0 )F( y 0 , x 0 ),
(34)

we have

( H ( g x 0 , g y 0 ) , H ( g y 0 , g x 0 ) , F ( x 0 , y 0 ) , F ( y 0 , x 0 ) ) M.

For the assumption holds, F is continuous. By the assumption of Theorem 3.1, we have H(gx,gy)=F(x,y) and H(gy,gx)=F(y,x). □

Corollary 3.7 Let (X,) be a partially ordered set and M be a non-empty subset of X 4 , and let d be a metric on X such that (X,d) is a complete metric space. Assume that g:XX is continuous and F,H:X×XX are two generalized compatible mappings such that F is H g -increasing with respect to ⪯, H is continuous and has the mixed monotone property. Suppose that for any x,yX, there exist u,vX such that F(x,y)=H(gu,gv) and F(y,x)=H(gv,gu). Suppose that there exists φΦ such that the following holds:

d ( F ( x , y ) , F ( u , v ) ) + d ( F ( y , x ) , F ( v , u ) ) φ ( d ( H ( g x , g y ) , H ( g u , g v ) ) + d ( H ( g y , g x ) , H ( g v , g u ) ) )

for all x,y,u,vX with H(gx,gy)H(gu,gv) and H(gy,gx)H(gv,gu).

Also suppose that (g(X),d) is a complete metric space and X has the following properties: for any two sequences { x n } and { y n },

  1. (i)

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

  2. (ii)

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

If there exist x 0 , y 0 X such that

H(g x 0 ,g y 0 )F( x 0 , y 0 )andH(g y 0 ,g x 0 )F( y 0 , x 0 )

and M is ( H g ,F)-closed, then there exists (x,y)X×X such that H(gx,gy)=F(x,y) and H(gy,gx)=F(y,x), that is, F and H have a coupled g-coincidence point.

Proof We define the subset M X 4 by

M= { ( x , y , u , v ) X 4 : x u  and  y v } .

From Example 2.21, M is an ( H g ,F)-closed set which satisfies the transitive property. For all x,y,u,vX with H(gx,gy)H(gu,gv) and H(gy,gx)H(gv,gu), we have (H(gx,gy),H(gy,gx),H(gu,gv),H(gv,gu))M. Let ( x 0 , y 0 )X×X with

H(g x 0 ,g y 0 )F( x 0 , y 0 )andH(g y 0 ,g x 0 )F( y 0 , x 0 ).
(35)

Using (2) and F is H g -increasing with respect to ⪯, we have

H(g x n ,g y n )H(g x n + 1 ,g y n + 1 )andH(g y n ,g x n )H(g y n + 1 ,g x n + 1 )for all n.

Therefore, (H(g x n ,g y n ),H(g y n ,g x n ),H(g x n + 1 ,g y n + 1 ),H(g y n + 1 ,g x n + 1 ))M.

From (g(X),d) is complete, as in Theorem 3.1, we have two Cauchy sequences { H ( g x n , g y n ) } n = 1 and { H ( g y n , g x n ) } n = 1 such that { H ( g x n , g y n ) } n = 1 is a non-decreasing sequence in X with H(g x n ,g y n )gx and { H ( g y n , g x n ) } n = 1 is a non-increasing sequence in X with H(g y n ,g x n )gy. Using assumption, we have

H(g x n ,g y n )gxandH(g y n ,g x n )gyfor all n.

Since H has the mixed monotone property, we have

H ( H ( g x n , g y n ) , H ( g y n , g x n ) ) H ( g x , g y ) , H ( H ( g y n , g x n ) , H ( g x n , g y n ) ) H ( g y , g x ) .

Therefore, we have

( H ( H ( g x n , g y n ) , H ( g y n , g x n ) ) , H ( H ( g y n , g x n ) , H ( g x n , g y n ) ) , H ( g x , g y ) , H ( g y , g x ) ) M

for all n1. Now, since all the hypotheses of Theorem 3.2 hold, then F and H have a coupled g-coincidence point. The proof is completed. □

Corollary 3.8 In addition to the hypotheses of Corollary 3.6, suppose that for every (x,y),(z,t)X×X, there exists (u,v)X×X such that (gu,gv) is comparable to (gx,gy) and (gz,gt). Then F and H have a unique coupled g-coincidence point.

Proof We define the subset M X 4 by

M= { ( x , y , u , v ) X 4 : x u  and  y v } .

From Example 2.21, M is an ( H g ,F)-closed set which satisfies the transitive property. Thus, the proof of the existence of a coupled coincidence point is straightforward by following the same lines as in the proof of Corollary 3.6.

Next, we show the uniqueness of a coupled g-coincidence point of F and H.

Since for all (x,y),(z,t)X×X, there exists (u,v)X×X such that

H(gx,gy)H(gu,gv),H(gy,gx)H(gv,gu),

and

H(gz,gt)H(gu,gv),H(gt,gz)H(gv,gu),

we can conclude that

( H ( g x , g y ) , H ( g y , g x ) , H ( g u , g v ) , H ( g v , g u ) ) M and ( H ( g z , g t ) , H ( g t , g z ) , H ( g u , g v ) , H ( g v , g u ) ) M .

Therefore, since all the hypotheses of Theorem 3.5 hold, F and H have a unique g-coupled coincidence point. The proof is completed. □