1 Introduction

Investigation of the existence and uniqueness of fixed points of certain mappings in the framework of metric spaces is one of the centers of interests in nonlinear functional analysis. The Banach contraction mapping principle [1] is the limelight result in this direction: A self mapping T on a complete metric space (X,d) has a unique fixed point if there exists 0k<1 such that d(Tx,Ty)=kd(x,y) for all x,yX. Fixed point theory has a wide application in almost all fields of quantitative sciences such as economics, biology, physics, chemistry, computer science and many branches of engineering. It is quite natural to consider various generalizations of metric spaces in order to address the needs of these quantitative sciences. In this respect quasi-metric spaces, ultra-metric spaces, uniform spaces, fuzzy metric spaces, partial metric spaces, cone metric spaces and b-metric spaces can be listed as well-known examples (see e.g. [26]). Consequently, the concept of a G-metric space was introduced by Mustafa and Sims [7] in 2004. The authors discussed the topological properties of this space and proved the analog of the Banach contraction mapping principle in the context of G-metric spaces (see e.g. [815]).

On the other hand, Ran and Reuring [16] proved the existence and uniqueness of a fixed point of a contraction mapping in partially ordered complete metric spaces. Following this initial work, a number of authors have investigated fixed points of various mappings and their applications in the theory of differential equations (see, e.g., [1735]). Afterwords, Gnana-Bhaskar and Lakshmikantham [22] proved the existence and uniqueness of a coupled fixed point (defined by Guo and Laksmikantham [36]) in the context of partially ordered metric spaces by introducing the notion of mixed monotone property. In this remarkable paper, Gnana-Bhaskar and Lakshmikantham [22] also gave some applications related to the existence and uniqueness of a solution of periodic boundary value problems. Following this trend, many authors have studied the (common) coupled fixed points (see, e.g., [1728, 31, 3747]).

In this paper, we show that, unexpectedly, most of the coupled fixed point theorems in the context of (ordered) G-metric spaces are in fact immediate consequences of well-known fixed point theorems in the literature.

2 Preliminaries

We start with basic definitions and a detailed overview of the essential results developed in the interesting works mentioned above. Throughout this paper, ℕ is the set of nonnegative integers, and N is the set of positive integers.

Definition 2.1 (See [7])

Let X be a nonempty set and G:X×X×X R + be a function satisfying the following properties:

  1. (G1)

    G(x,y,z)=0 if x=y=z,

  2. (G2)

    0<G(x,x,y) for all x,yX with xy,

  3. (G3)

    G(x,x,y)G(x,y,z) for all x,y,zX with yz,

  4. (G4)

    G(x,y,z)=G(x,z,y)=G(y,z,x)= (symmetry in all three variables),

  5. (G5)

    G(x,y,z)G(x,a,a)+G(a,y,z) for all x,y,z,aX (rectangle inequality).

Then the function G is called a generalized metric or, more specially, a G-metric on X, and the pair (X,G) is called a G-metric space.

Every G-metric on X defines a metric d G on X by

d G (x,y)=G(x,y,y)+G(y,x,x),for all x,yX.
(1)

Example 2.1 Let (X,d) be a metric space. The function G:X×X×X[0,+), defined as

G(x,y,z)=max { d ( x , y ) , d ( y , z ) , d ( z , x ) }

or

G(x,y,z)=d(x,y)+d(y,z)+d(z,x)

for all x,y,zX, is a G-metric on X.

Definition 2.2 (See [7])

Let (X,G) be a G-metric space, and let { x n } be a sequence of points of X. We say that { x n } is G-convergent to xX if

lim n , m + G(x, x n , x m )=0,

that is, for any ε>0, there exists NN such that G(x, x n , x m )<ε for all n,mN. We call x the limit of the sequence and write x n x or lim n + x n =x.

Proposition 2.1 (See [7])

Let (X,G) be a G-metric space. The following are equivalent:

  1. (1)

    { x n } is G-convergent to x,

  2. (2)

    G( x n , x n ,x)0 as n+,

  3. (3)

    G( x n ,x,x)0 as n+,

  4. (4)

    G( x n , x m ,x)0 as n,m+.

Definition 2.3 (See [7])

Let (X,G) be a G-metric space. A sequence { x n } is called a G-Cauchy sequence if, for any ε>0, there is NN such that G( x n , x m , x l )<ε for all m,n,lN, that is, G( x n , x m , x l )0 as n,m,l+.

Proposition 2.2 (See [7])

Let (X,G) be a G-metric space. Then the following are equivalent:

  1. (1)

    the sequence { x n } is G-Cauchy,

  2. (2)

    for any ε>0, there exists NN such that G( x n , x m , x m )<ε for all m,nN.

Definition 2.4 (See [7])

A G-metric space (X,G) is called G-complete if every G-Cauchy sequence is G-convergent in (X,G).

We will use the following result which can be easily derived from the definition of G-metric space (see, e.g., [7]).

Lemma 2.1 Let (X,G) be a G-metric space. Then

G(x,x,y)2G(x,y,y) for all x,yX.

Definition 2.5 (See [7])

Let (X,G) be a G-metric space. A mapping T:XX is said to be G-continuous if {T( x n )} is G-convergent to T(x) where { x n } is any G-convergent sequence converging to x.

We characterize this definition for a mapping F:X×XX. A mapping F:X×XX is said to be continuous if {F( x n , y n )} is G-convergent to F(x,y) where { x n } and { y n } are any two G-convergent sequences converging to x and y, respectively.

Definition 2.6 Let (X,) be a partially ordered set, (X,G) be a G-metric space and g:XX be a mapping. A partially ordered G-metric space, (X,G,), is called g-ordered complete if for each convergent sequence { x n } n = 0 X, the following conditions hold:

  • (OC1) if { x n } is a nonincreasing sequence in X such that x n x , then g x g x n nN,

  • (OC2) if { y n } is a nondecreasing sequence in X such that y n y , then g y g y n nN.

In particular, a partially ordered G-metric space, (X,G,), is called ordered complete when g is equal to an identity mapping in (OC1) and (OC2).

In [48], Mustafa characterized the well-known Banach contraction principle mapping in the context of G-metric spaces in the following ways.

Theorem 2.1 (See [48])

Let (X,G) be a complete G-metric space and T:XX be a mapping satisfying the following condition for all x,y,zX:

G(Tx,Ty,Tz)kG(x,y,z),
(2)

where k[0,1). Then T has a unique fixed point.

Theorem 2.2 (See [48])

Let (X,G) be a complete G-metric space and T:XX be a mapping satisfying the following condition for all x,yX:

G(Tx,Ty,Ty)kG(x,y,y),
(3)

where k[0,1). Then T has a unique fixed point.

Remark 2.1 The condition (2) implies the condition (3). The converse is true only if k[0, 1 2 ). For details, see [48].

In 1987, Guo and Lakshmikantham [36] introduced the notion of coupled fixed point. The concept of coupled fixed point was reconsidered by Gnana-Bhaskar and Lakshmikantham [22] in 2006. In this paper, they proved the existence and uniqueness of a coupled fixed point of an operator F:X×XX on a partially ordered metric space under a condition called the mixed monotone property.

Definition 2.7 ([22])

Let (X,) be a partially ordered set and F:X×XX. The mapping F is said to have the mixed monotone property if F(x,y) is monotone nondecreasing in x and monotone nonincreasing in y; that is, for any x,yX,

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

and

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

Definition 2.8 ([22])

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

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

The results in [22] were extended by Ćirić and Lakshmikantham in [23] by defining the mixed g-monotone property.

Definition 2.9 Let (X,) be a partially ordered set, F:X×XX and g:XX. The function F is said to have the mixed g-monotone property if F(x,y) is monotone g-nondecreasing in x and is monotone g-nonincreasing in y; that is, for any x,yX,

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

and

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

It is clear that Definition 2.9 reduces to Definition 2.7 when g is the identity.

Definition 2.10 An element (x,y)X×X is called a coupled coincidence point of mappings F:X×XX and g:XX if

F(x,y)=g(x),F(y,x)=g(y),

and is called a coupled common fixed point of F and g if

F(x,y)=g(x)=x,F(y,x)=g(y)=y.

The mappings F and g are said to commute if

g ( F ( x , y ) ) =F ( g ( x ) , g ( y ) )

for all x,yX.

3 Auxiliary results

We first state the following theorem about the existence and uniqueness of a common fixed point which can be considered as a generalization of Theorem 2.1.

Theorem 3.1 Let (X,G) be a G-metric space. Let T:XX and g:XX be two mappings such that

G(Tx,Ty,Tz)kG(gx,gy,gz)
(6)

for all x, y, z. Assume that T and g satisfy the following conditions:

  1. (A1)

    T(X)g(X),

  2. (A2)

    g(X) is G-complete,

  3. (A3)

    g is G-continuous and commutes with T.

If k[0,1), then there is a unique xX such that gx=Tx=x.

Proof Let x 0 X. By assumption (A1), there exists x 1 X such that T x 0 =g x 1 . By the same arguments, there exists x 2 X such that T x 1 =g x 2 . Inductively, we define a sequence { x n } in the following way:

g x n + 1 =T x n ,nN.
(7)

Due to (6), we have

G ( g x n + 2 , g x n + 2 , g x n + 1 ) = G ( T x n + 1 , T x n + 1 , T x n ) k G ( g x n + 1 , g x n + 1 , g x n )

by taking x=y= x n + 1 and z= x n . Thus, for each natural number n, we have

G(g x n + 2 ,g x n + 2 ,g x n + 1 ) k n + 1 G(g x 1 ,g x 1 ,g x 0 ).
(8)

We will show that {g x n } is a Cauchy sequence. By the rectangle inequality, we have for m>n

G ( g x m , g x m , g x n ) G ( g x n + 1 , g x n + 1 , g x n ) + G ( g x n + 2 , g x n + 2 , g x n + 1 ) + + G ( g x m 1 , g x m 1 , g x m 2 ) + G ( g x m , g x m , g x m 1 ) k n G ( g x 1 , g x 1 , g x 0 ) + k n + 1 G ( g x 1 , g x 1 , g x 0 ) + + k m 2 G ( g x 1 , g x 1 , g x 0 ) + k m 1 G ( g x 1 , g x 1 , g x 0 ) ( i = n m 1 k i ) G ( g x 1 , g x 1 , g x 0 ) .
(9)

Letting n,m in (9), we get that G(g x m ,g x m ,g x n )0. Hence, {g x n } is a G-Cauchy sequence in g(X). Since (g(X),G) is G-complete, then there exists zX such that {g x n }z. Since g is G-continuous, we have {gg x n } is G-convergent to gz. On the other hand, we have gg x n + 1 =gT x n =Tg x n since g and T commute. Thus,

G ( g x n + 1 , T z , T z ) = G ( T g x n , T z , T z ) k G ( g g x n , g z , g z ) .

Letting n and using the fact that the metric G is continuous, we get that

G(gz,Tz,Tz)kG(gz,gz,gz).

Hence gz=Tz. The sequence {g x n + 1 } is G-convergent to z since {g x n + 1 } is a subsequence of {g x n }. So, we have

G ( g x n + 1 , g z , g z ) = G ( g x n + 1 , T z , T z ) = G ( T x n , T z , T z ) k G ( g x n , z , z ) .

Letting n and using the fact that G is continuous, we obtain that

G(z,gz,gz)kG(z,z,z)=0.

Hence we have z=gz=Tz. We will show that z is the unique common fixed point of T and g. Suppose that, contrary to our claim, there exists another common fixed point wX with wz. From (6) we have

G(w,w,z)=G(Tw,Tw,Tz)kG(w,w,z),

which is a contradiction since k<1. Hence, the common fixed point of T and g is unique. □

Theorem 3.2 Let (X,G) be a G-metric space. Let T:XX and g:XX be two mappings such that

G(Tx,Ty,Ty)kG(gx,gy,gy)
(10)

for all x, y. Assume that T and g satisfy the following conditions:

  1. (A1)

    T(X)g(X),

  2. (A2)

    g(X) is G-complete,

  3. (A3)

    g is G-continuous and commutes with T.

If k[0,1), then there is a unique xX such that gx=Tx=x.

Proof Following the lines of the proof of Theorem 3.1 by taking y=z, one can easily get the result. □

In [16], Ran and Reurings established the following fixed point theorem that extends the Banach contraction principle to the setting of ordered metric spaces.

Theorem 3.3 (Ran and Reurings [16])

Let (X,) be an ordered set endowed with a metric d and T:XX be a given mapping. Suppose that the following conditions hold:

  1. (i)

    (X,d) is complete;

  2. (ii)

    T is continuous and nondecreasing (with respect to ⪯);

  3. (iii)

    there exists x 0 X such that x 0 T x 0 ;

  4. (iv)

    there exists a constant k(0,1) such that for all x,yX with xy,

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

Then T has a fixed point. Moreover, if for all (x,y)X×X there exists zX such that xz and yz, we obtain uniqueness of the fixed point.

The result of Ran and Reurings [16] can be also proved in the framework of a G-metric space.

Theorem 3.4 Let (X,) be an ordered set endowed with a G-metric and T:XX be a given mapping. Suppose that the following conditions hold:

  1. (i)

    (X,G) is G-complete;

  2. (ii)

    T is G-continuous and nondecreasing (with respect to ⪯);

  3. (iii)

    there exists x 0 X such that x 0 T x 0 ;

  4. (iv)

    there exists a constant k(0,1) such that for all x,y,zX with xyz,

    G(Tx,Ty,Tz)kG(x,y,z).
    (11)

Then T has a fixed point. Moreover, if for all (x,y)X×X there exists wX such that xw and yw, we obtain uniqueness of the fixed point.

Proof Let x 0 X be a point satisfying (iii), that is, x 0 T x 0 . We define a sequence { x n } in X as follows:

x n =T x n 1 for n1.
(12)

Regarding that T is a nondecreasing mapping together with (12), we have x 0 T x 0 = x 1 implies x 1 =T x 0 T x 1 = x 2 . Inductively, we obtain

x 0 x 1 x 2 x n 1 x n x n + 1 .
(13)

Assume that there exists n 0 such that x n 0 = x n 0 + 1 . Since x n 0 = x n 0 + 1 =T x n 0 , then x n 0 is the fixed point of T, which completes the existence part of the proof. Suppose that x n x n + 1 for all nN. Thus, by (13) we have

x 0 x 1 x 2 x n 1 x n x n + 1 .
(14)

Put x=y= x n and z= x n 1 in (11). Then

0 G ( T x n , T x n , T x n 1 ) = G ( x n + 1 , x n + 1 , x n ) k G ( x n , x n , x n 1 ) k 2 G ( x n 1 , x n 1 , x n 2 ) k n G ( x 1 , x 1 , x 0 ) .
(15)

Then we have

0G( x n + 1 , x n + 1 , x n ) k n G( x 1 , x 1 , x 0 ),

which, upon letting n, implies

lim n G( x n + 1 , x n + 1 , x n )=0.
(16)

On the other hand, by Lemma 2.1 we have

G(y,y,x)G(y,x,x)+G(x,y,x)=2G(y,x,x).
(17)

The inequality (17) with x= x n and y= x n 1 becomes

G( x n 1 , x n 1 , x n )=G( x n , x n 1 , x n 1 )2G( x n 1 , x n , x n ).
(18)

Letting n in (18), we get

lim n G( x n , x n 1 , x n 1 )=0.
(19)

We will show that the sequence { x n } is a Cauchy sequence in the metric space (X, d G ) where d G is given in (1). For nl we have

d G ( x n , x l ) d G ( x n , x n 1 ) + d G ( x n 1 , x n 2 ) + + d G ( x l + 1 , x l ) = G ( x n , x n 1 , x n 1 ) + G ( x n 1 , x n , x n ) + G ( x n 1 , x n 2 , x n 2 ) + G ( x n 2 , x n 1 , x n 1 ) + + G ( x l + 1 , x l , x l ) + G ( x l , x l + 1 , x l + 1 ) = i = l + 1 n [ G ( x i , x i 1 , x i 1 ) + G ( x i 1 , x i , x i ) ] ,
(20)

and making use of (15) and (18), we obtain

0 d G ( x n , x l ) i = l + 1 n 3 k i 1 G ( x 1 , x 1 , x 0 ) 3 G ( x 1 , x 1 , x 0 ) [ i = 0 n k i 1 i = 0 l k i 1 ] .
(21)

Hence,

d G ( x n , x l )0as n,l,
(22)

that is, the sequence { x n } is Cauchy in (X, d G ) and hence { x n } is G-Cauchy in (X,G) (see Proposition 9 in [7]). Since the space (X,G) is G-complete, then (X, d G ) is complete (see Proposition 10 in [7]). Thus, { x n } is G-convergent to a number, say uX, that is,

lim n G( x n , x n ,u)= lim n G( x n ,u,u)=0.
(23)

We show now that uX is a fixed point of T, that is, u=Tu. By the G-continuity of T, the sequence {T x n }={ x n + 1 } converges to Tu, that is,

lim n G(T x n ,T x n ,Tu)= lim n G(T x n ,Tu,Tu)=0.
(24)

The rectangle inequality on the other hand gives

G ( u , T u , T u ) G ( u , x n + 1 , x n + 1 ) + G ( x n + 1 , T u , T u ) G ( u , x n + 1 , x n + 1 ) + G ( T x n , T u , T u ) .
(25)

Passing to limit as n in (25), we conclude that G(u,Tu,Tu)=0. Hence, u=Tu, that is, u∈ is a fixed point of T.

To prove the uniqueness, we assume that vX is another fixed point of T such that vu. We examine two cases. For the first case, assume that either vu or uv. Then we substitute x=u and y=z=v in (11) which yields G(Tv,Tu,Tu)kG(u,v,v). This is true only for k=1, but k(0,1) by definition. Thus, the fixed point of T is unique.

For the second case, we suppose that neither vu nor uv holds. Then by assumption (iv), there exists wX such that uw and vw. Substituting x=y=w and z=u in (11), we get that G(Tw,Tw,Tu)=G(Tw,Tw,u)kG(w,w,u). Since T is nondecreasing, TuTw. Substitute now x=y=Tw and z=Tu, which implies G( T 2 w, T 2 w, T 2 u)kG(Tw,Tw,Tu) k 2 G(w,w,u). Continuing in this way, we conclude G( T n w, T n w,u) k n G(w,w,u). Passing to limit as n, we get

lim n G ( T n w , T n w , u ) =0.
(26)

Similarly, if we take x=y=w and z=v in (11), then we obtain

lim n G ( T n w , T n w , v ) =0.
(27)

From (26) and (27), we deduce { T n w}u and { T n w}v. The uniqueness of the limit implies that u=v. Hence, the fixed point of T is unique. □

Corollary 3.1 Let (X,) be an ordered set endowed with a G-metric and T:XX be a given mapping. Suppose that the following conditions hold:

  1. (i)

    (X,G) is G-complete;

  2. (ii)

    T is G-continuous and nondecreasing (with respect to ⪯);

  3. (iii)

    there exists x 0 X such that x 0 T x 0 ;

  4. (iv)

    there exists a constant k(0,1) such that for all x,yX with xy,

    G(Tx,Ty,Ty)kG(x,y,y).
    (28)

Then T has a fixed point. Moreover, if for all (x,y)X×X there exists wX such that xw and yw, we obtain uniqueness of the fixed point.

Proof It is sufficient to take z=y in the proof of Theorem 3.4. □

Nieto and López [49] extended the result of Ran and Reurings [16] for a mapping T not necessarily continuous by assuming an additional hypothesis on (X,,d).

Theorem 3.5 (Nieto and López [49])

Let (X,) be an ordered set endowed with a metric d and T:XX be a given mapping. Suppose that the following conditions hold:

  1. (i)

    (X,d) is complete;

  2. (ii)

    X is ordered complete;

  3. (iii)

    T is nondecreasing;

  4. (iv)

    there exists x 0 X such that x 0 T x 0 ;

  5. (v)

    there exists a constant k(0,1) such that for all x,yX with xy,

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

Then T has a fixed point. Moreover, if for all (x,y)X×X there exists wX such that xw and yw, we obtain uniqueness of the fixed point.

The result of Nieto and López [49] can also be proved in the framework of G-metric space.

Theorem 3.6 Let (X,) be an ordered set endowed with a G-metric and T:XX be a given mapping. Suppose that the following conditions hold:

  1. (i)

    (X,G) is G-complete;

  2. (ii)

    X is ordered complete;

  3. (iii)

    T is nondecreasing;

  4. (iv)

    there exists x 0 X such that x 0 T x 0 ;

  5. (v)

    there exists a constant k(0,1) such that for all x,y,zX with xyz,

    G(Tx,Ty,Tz)kG(x,y,z).
    (29)

Then T has a fixed point. Moreover, if for all (x,y)X×X there exists wX such that xw and yw, we obtain uniqueness of the fixed point.

Proof Following the lines in the proof of Theorem 3.4, we have a sequence { x n } which is G-convergent to uX. Due to (ii), we have x n u for all n. We will show that u is a fixed point of T. Suppose on the contrary that uTu, that is, d G (u,Tu)>0. Regarding (1) and (29) with x= x n , y=z=Tu, we have

0 d G ( x n , T u ) = G ( x n , T u , T u ) + G ( T u , x n , x n ) = G ( T x n 1 , T u , T u ) + G ( T u , T x n 1 , T x n 1 ) k [ G ( x n 1 , u , u ) + G ( u , x n 1 , x n 1 ) ] .
(30)

Passing to limit as n, we get d G (u,Tu)=0, which is a contradiction. Hence, Tu=u. Uniqueness of u can be observed as in the proof of Theorem 3.4. □

Corollary 3.2 Let (X,) be an ordered set endowed with a G-metric and T:XX be a given mapping. Suppose that the following conditions hold:

  1. (i)

    (X,G) is G-complete;

  2. (ii)

    X is ordered complete;

  3. (iii)

    T is nondecreasing;

  4. (iv)

    there exists x 0 X such that x 0 T x 0 ;

  5. (v)

    there exists a constant k(0,1) such that for all x,yX with xy,

    G(Tx,Ty,Ty)kG(x,y,y).
    (31)

Then T has a fixed point. Moreover, if for all (x,y)X×X there exists wX such that xw and yw, we obtain uniqueness of the fixed point.

Proof It is sufficient to take z=y in the proof of Theorem 3.6. □

Denote by Ψ the set of functions ψ:[0,)[0,) satisfying the following conditions:

( Ψ 0 ) ψ 1 ({0})=0,

( Ψ 1 ) ψ(t)<t for all t>0;

( Ψ 2 ) lim r t + ψ(r)<t.

Following the work of Ćirić et al. [50], we generalize the above-mentioned results by means of introducing a function g. More specifically, we modify the definitions and theorems according to the presence of the function g.

Definition 3.1 (See [50])

Let (X,) be an ordered set and T:XX and g:XX be given mappings. The mapping T is called g-nondecreasing if for every x,yX,

gxgyimpliesTxTy.

Theorem 3.7 Let (X,) be an ordered set endowed with a G-metric and T:XX and g:XX be given mappings. Suppose that the following conditions hold:

  1. (i)

    (X,G) is G-complete;

  2. (ii)

    T is G-continuous;

  3. (iii)

    T is g-nondecreasing;

  4. (iv)

    there exists x 0 X such that g x 0 T x 0 ;

  5. (v)

    T(X)g(X) and g is G-continuous and commutes with T;

  6. (vi)

    there exists a function φΨ such that for all x,y,zX with gxgygz,

    G(Tx,Ty,Tz)φ ( G ( g x , g y , g z ) ) .
    (32)

Then T and g have a coincidence point, that is, there exists wX such that gw=Tw.

Proof Let x 0 X such that g x 0 T x 0 . Since T(X)g(X), we can choose x 1 such that g x 1 =T x 0 . Again, by T(X)g(X), we can choose x 2 such that g x 2 =T x 1 . By repeating the same argument, we construct the sequence {g x n } in the following way:

g x n + 1 =T x n ,for all n=0,1,2,.
(33)

Regarding that T is a g-nondecreasing mapping together with (33), we observe that

g x 0 T x 0 =g x 1 impliesg x 1 =T x 0 T x 1 =g x 2 .

Inductively, we obtain

g x 0 g x 1 g x 2 g x n 1 g x n g x n + 1 .
(34)

If there exists n 0 such that g x n 0 =g x n 0 + 1 , then g x n 0 =g x n 0 + 1 =T x n 0 , that is, T and g have a coincidence point which completes the proof. Assume that g x n g x n + 1 for all nN.

Regarding (34), we set x=y= x n + 1 and z= x n in (32). Then we get

G(T x n + 1 ,T x n + 1 ,T x n )φ ( G ( g x n + 1 , g x n + 1 , g x n ) ) ,

which is equivalent to

G(g x n + 2 ,g x n + 2 ,g x n + 1 )φ ( G ( g x n + 1 , g x n + 1 , g x n ) ) <G(g x n + 1 ,g x n + 1 ,g x n )
(35)

since φ(t)<t for all t>0. Let t n =G(g x n + 1 ,g x n + 1 ,g x n ). Then { t n } is a positive nonincreasing sequence. Thus, there exists L0 such that

lim n t n = L + .
(36)

We will show that L=0. Suppose that contrary to our claim, L>0. Letting n in (35), we get

L= lim n t n + 1 lim n φ( t n )= lim t L + φ(t)<L,

which is a contradiction. Hence, we have

lim n G(g x n + 1 ,g x n + 1 ,g x n )= lim n t n =0.
(37)

We will show that {g x n } is a G-Cauchy sequence. Suppose on the contrary that the sequence {g x n } is not G-Cauchy. Then there exists ε>0 and sequences of natural numbers {m(k)}, {l(k)} such that for each natural number k,

m(k)>l(k)k,

and we have

c k =G(g x m ( k ) ,g x m ( k ) ,g x l ( k ) )ε.
(38)

Corresponding to l(k), the number m(k) is chosen to be the smallest number for which (38) holds. Hence, we have

G(g x m ( k ) 1 ,g x m ( k ) 1 ,g x l ( k ) )<ε.
(39)

By using (G5), we obtain that

ε G ( g x m ( k ) , g x m ( k ) , g x l ( k ) ) G ( g x m ( k ) , g x m ( k ) , g x m ( k ) 1 ) + G ( g x m ( k ) 1 , g x m ( k ) 1 , g x l ( k ) ) = t m ( k ) 1 + G ( g x m ( k ) 1 , g x m ( k ) 1 , g x l ( k ) ) < t m ( k ) 1 + ε .

Regarding (37) and letting n in the previous inequality, we deduce

lim k c k = ε + .
(40)

Again by the rectangle inequality (G5), together with (G4) and Lemma 2.1, we get that

c k = G ( g x m ( k ) , g x m ( k ) , g x l ( k ) ) G ( g x m ( k ) , g x m ( k ) , g x m ( k ) + 1 ) + G ( g x m ( k ) + 1 , g x m ( k ) + 1 , g x l ( k ) + 1 ) + G ( g x l ( k ) + 1 , g x l ( k ) + 1 , g x l ( k ) ) = t l ( k ) + G ( g x m ( k ) , g x m ( k ) , g x m ( k ) + 1 ) + G ( g x m ( k ) + 1 , g x m ( k ) + 1 , g x l ( k ) + 1 ) t l ( k ) + 2 G ( g x m ( k + 1 ) , g x m ( k ) + 1 , g x m ( k ) ) + G ( g x m ( k ) + 1 , g x m ( k ) + 1 , g x l ( k ) + 1 ) t l ( k ) + 2 t m ( k ) + G ( g x m ( k ) + 1 , g x m ( k ) + 1 , g x l ( k ) + 1 ) .
(41)

Setting x=y= x m ( k ) and z= x l ( k ) , the inequality (32) implies

G ( g x m ( k ) + 1 , g x m ( k ) + 1 , g x l ( k ) + 1 ) = G ( T x m ( k ) , T x m ( k ) , T x l ( k ) ) φ ( G ( g x m ( k ) , g x m ( k ) , g x l ( k ) ) ) = φ ( c k ) .
(42)

Combining the inequalities (41) and (42), we find

c k t l ( k ) +2 t m ( k ) +φ( c k ).
(43)

Taking (37) and (40) into account and letting k in (43), we obtain that

ε lim k φ( c k )= lim t ε + φ(t)<ε,

which is a contradiction. Hence, {g x n } is a G-Cauchy sequence in the G-metric space (X,G). Since (X,G) is G-complete, there exists wX such that {g x n } is G-convergent to w. By Proposition 2.1, we have

lim n G(g x n ,g x n ,w)= lim n G(g x n ,w,w)=0.
(44)

The G-continuity of g implies that the sequence {gg x n } is G-convergent to gw, that is,

lim n G(gg x n ,gg x n ,gw)= lim n G(gg x n ,gw,gw)=0.
(45)

On the other hand, due to the commutativity of T and g, we can write

gg x n + 1 =gT x n =Tg x n ,
(46)

and the G-continuity of T implies that the sequence {Tg x n }={gg x n + 1 } G-converges to Tw so that

lim n G(Tg x n ,Tg x n ,Tw)= lim n G(Tg x n ,Tw,Tw)=0.
(47)

By the uniqueness of the limit, the expressions (45) and (47) yield that gw=Tw. Indeed, from the rectangle inequality, we get

G ( g w , T w , T w ) G ( g z , g g x n + 1 , g g x n + 1 ) + G ( g g x n + 1 , T w , T w ) G ( g w , g g x n + 1 , g g x n + 1 ) + G ( T g x n , T w , T w ) ,
(48)

which implies G(gw,Tw,Tw)=0 upon letting n. Hence, gw=Tw. □

In the next theorem, G-continuity of T is no longer required. However, we require the g-ordered completeness of X.

Theorem 3.8 Let (X,) be an ordered set endowed with a G-metric and T:XX and g:XX be given mappings. Suppose that the following conditions hold:

  1. (i)

    (X,G) is G-complete;

  2. (ii)

    X is g-ordered complete;

  3. (iii)

    T is g-nondecreasing (with respect to ⪯);

  4. (iv)

    there exists x 0 X such that g x 0 T x 0 ;

  5. (v)

    T(X)g(X) and g is G-continuous and commutes with T;

  6. (vi)

    there exists a function φΨ such that for all x,y,zX with gxgygz,

    G(Tx,Ty,Tz)φ ( G ( g x , g y , g z ) ) .
    (49)

Then T and g have a coincidence point, that is, there exists wX such that gw=Tw.

Proof Following the lines of the proof of Theorem 3.7, we define a sequence {g x n } and conclude that it is a G-Cauchy sequence in the G-complete, G-metric space (X,G). Thus, there exists wX such that g x n is G-convergent to gw. Since {g x n } is nondecreasing and X is g-ordered complete, we have g x n gw. If gw=g x n for some natural number n, then T and g have a coincidence point. Indeed, gw=g x n g x n + 1 =T x n gw and hence g x n =T x n . Suppose that gwg x n . By the rectangle inequality together with the inequality (49) and the property ( Ψ 1 ), we have

G ( T w , g w , g w ) G ( T w , g x n + 1 , g x n + 1 ) + G ( g x n + 1 , g w , g w ) G ( T w , T x n , T x n ) + G ( g x n + 1 , g w , g w ) φ ( G ( g w , g x n , g x n ) ) + G ( g x n + 1 , g w , g w ) < G ( g w , g x n , g x n ) + G ( g x n + 1 , g w , g w ) .

Letting n in the inequality above, we get that G(Tw,gw,gw)=0. Hence, Tw=gw. □

If we take φ(t)=kt, where k[0,1) in Theorem 3.7 and Theorem 3.8, we deduce the following corollaries, respectively.

Corollary 3.3 Let (X,) be an ordered set endowed with a G-metric and T:XX and g:XX be given mappings. Suppose that the following conditions hold:

  1. (i)

    (X,G) is G-complete;

  2. (ii)

    T is G-continuous;

  3. (iii)

    T is g-nondecreasing (with respect to ⪯);

  4. (iv)

    there exists x 0 X such that g x 0 T x 0 ;

  5. (v)

    T(X)g(X) and g is G-continuous and commutes with T;

  6. (vi)

    there exists k[0,1) such that for all x,y,zX with gxgygz,

    G(Tx,Ty,Tz)kG(gx,gy,gz).
    (50)

Then T and g have a coincidence point, that is, there exists wX such that gw=Tw.

Corollary 3.4 Let (X,) be an ordered set endowed with a G-metric and T:XX and g:XX be given mappings. Suppose that the following conditions hold:

  1. (i)

    (X,G) is G-complete;

  2. (ii)

    X is g-ordered complete;

  3. (iii)

    T is g-nondecreasing (with respect to ⪯);

  4. (iv)

    there exists x 0 X such that g x 0 T x 0 ;

  5. (v)

    T(X)g(X) and g is G-continuous and commutes with T;

  6. (vi)

    there exists k[0,1) such that for all x,y,zX with gxgygz,

    G(Tx,Ty,Tz)kG(gx,gy,gz).
    (51)

Then T and g have a coincidence point, that is, there exists wX such that gw=Tw.

If we take z=y in Theorem 3.7 and Theorem 3.8, we obtain the following particular cases.

Corollary 3.5 Let (X,) be an ordered set endowed with a G-metric and T:XX and g:XX be given mappings. Suppose that the following conditions hold:

  1. (i)

    (X,G) is G-complete;

  2. (ii)

    T is G-continuous;

  3. (iii)

    T is g-nondecreasing;

  4. (iv)

    there exists x 0 X such that g x 0 T x 0 ;

  5. (v)

    T(X)g(X) and g is G-continuous and commutes with T;

  6. (vi)

    there exists a function φΨ such that for all x,yX with gxgy,

    G(Tx,Ty,Ty)φ ( G ( g x , g y , g y ) ) .
    (52)

Then T and g have a coincidence point, that is, there exists wX such that gw=Tw.

Corollary 3.6 Let (X,) be an ordered set endowed with a G-metric and T:XX and g:XX be given mappings. Suppose that the following conditions hold:

  1. (i)

    (X,G) is G-complete;

  2. (ii)

    X is g-ordered complete;

  3. (iii)

    T is g-nondecreasing;

  4. (iv)

    there exists x 0 X such that g x 0 T x 0 ;

  5. (v)

    T(X)g(X) and g is G-continuous and commutes with T;

  6. (vi)

    there exists a function φΨ such that for all x,yX with gxgy,

    G(Tx,Ty,Ty)φ ( G ( g x , g y , g y ) ) .
    (53)

Then T and g have a coincidence point, that is, there exists wX such that gw=Tw.

Finally, we let g=i d X in the Theorem 3.7 and Theorem 3.8 and conclude the following theorems.

Theorem 3.9 Let (X,) be an ordered set endowed with a G-metric and T:XX be a given mapping. Suppose that the following conditions hold:

  1. (i)

    (X,G) is G-complete;

  2. (ii)

    T is G-continuous;

  3. (iii)

    T is nondecreasing (with respect to ⪯);

  4. (iv)

    there exists x 0 X such that x 0 T x 0 ;

  5. (v)

    there exists a function φΨ such that for all x,y,zX with xyz,

    G(Tx,Ty,Tz)φ ( G ( x , y , z ) ) .
    (54)

Then T has a fixed point.

Theorem 3.10 Let (X,) be an ordered set endowed with a G-metric and T:XX be a given mapping. Suppose that the following conditions hold:

  1. (i)

    (X,G) is G-complete;

  2. (ii)

    X is ordered complete;

  3. (iii)

    T is nondecreasing;

  4. (iv)

    there exists x 0 X such that x 0 T x 0 ;

  5. (v)

    there exists a function φΨ such that for all x,y,zX with xyz,

    G(Tx,Ty,Tz)φ ( G ( x , y , z ) ) .
    (55)

Then T has a fixed point.

We next consider some equivalence conditions and their implementation on G-metric spaces. Let S denote the set of functions β:[0,)[0,1) satisfying the condition

β( t n )1implies t n 0.

In 2007, Jachymski and Jóźwik [51] proved that the classes S and Ψ are equivalent. Regarding this result, we state the following fixed point theorems on G-metric spaces.

Theorem 3.11 Let (X,) be an ordered set endowed with a G-metric and T:XX be a given mapping. Suppose that the following conditions hold:

  1. (i)

    (X,G) is G-complete;

  2. (ii)

    T is G-continuous;

  3. (iii)

    T is nondecreasing (with respect to ⪯);

  4. (iv)

    there exists x 0 X such that x 0 T x 0 ;

  5. (v)

    there exists a function βS such that for all x,y,zX with xyz,

    G(Tx,Ty,Tz)β ( G ( x , y , z ) ) G(x,y,z).
    (56)

Then T has a fixed point.

Theorem 3.12 Let (X,) be an ordered set endowed with a G-metric and T:XX be a given mapping. Suppose that the following conditions hold:

  1. (i)

    (X,G) is G-complete;

  2. (ii)

    X is ordered complete;

  3. (iii)

    T is nondecreasing (with respect to ⪯);

  4. (iv)

    there exists x 0 X such that x 0 T x 0 ;

  5. (v)

    there exists a function βS such that for all x,y,zX with xyz,

    G(Tx,Ty,Tz)β ( G ( x , y , z ) ) G(x,y,z).
    (57)

Then T has a fixed point.

The two corollaries below are immediate consequences of Theorem 3.11 and Theorem 3.12.

Corollary 3.7 Let (X,) be an ordered set endowed with a G-metric and T:XX be a given mapping. Suppose that the following conditions hold:

  1. (i)

    (X,G) is G-complete;

  2. (ii)

    T is G-continuous;

  3. (iii)

    T is nondecreasing (with respect to ⪯);

  4. (iv)

    there exists x 0 X such that x 0 T x 0 ;

  5. (v)

    there exists a function βS such that for all x,yX with xy,

    G(Tx,Ty,Ty)β ( G ( x , y , y ) ) G(x,y,y).
    (58)

Then T has a fixed point.

Corollary 3.8 Let (X,) be an ordered set endowed with a G-metric and T:XX be a given mapping. Suppose that the following conditions hold:

  1. (i)

    (X,G) is G-complete;

  2. (ii)

    X is ordered complete;

  3. (iii)

    T is nondecreasing (with respect to ⪯);

  4. (iv)

    there exists x 0 X such that x 0 T x 0 ;

  5. (v)

    there exists a function βS such that for all x,yX with xy,

    G(Tx,Ty,Ty)β ( G ( x , y , y ) ) G(x,y,y).
    (59)

Then T has a fixed point.

Denote by Φ the set of functions φ:[0,)[0,) satisfying the conditions ( Ψ 1 ) and ( Ψ 2 ). Jachymski [52] proved the equivalence of the so-called distance functions (see Lemma 1 in [52]). Inspired by this result, we can state the following theorem.

Theorem 3.13 Let (X,) be an ordered set endowed with a G-metric and T be a self-map on a G-complete partially ordered G-metric space (X,G). The following statements are equivalent:

  1. (i)

    there exist functions ψ,ηΦ such that

    ψ ( G ( T x , T y , T z ) ) ψ ( G ( x , y , z ) ) η ( G ( x , y , z ) ) ,
    (60)
  2. (ii)

    there exist α[0,1) and a function ψΦ such that

    ψ ( G ( T x , T y , T z ) ) αψ ( G ( x , y , z ) ) ,
    (61)
  3. (iii)

    there exists a continuous and nondecreasing function α:[0,)[0,) such that α(t)<t for all t>0 such that

    G(Tx,Ty,Tz)α ( G ( x , y , z ) ) ,
    (62)
  4. (iv)

    there exist a function ψΦ and a nondecreasing function η:[0,)[0,) with η 1 (0)=0 such that

    ψ ( G ( T x , T y , T z ) ) ψ ( G ( x , y , z ) ) η ( G ( x , y , z ) ) ,
    (63)
  5. (iv)

    there exist a function ψΦ and a lower semi-continuous function η:[0,)[0,) with η 1 (0)=0 and lim inf t η(t)>0 such that

    ψ ( G ( T x , T y , T z ) ) ψ ( G ( x , y , z ) ) η ( G ( x , y , z ) ) ,
    (64)

for any x,y,zX with xyz.

As a consequence of Theorem 3.13, we state the next corollary.

Corollary 3.9 Let (X,) be an ordered set endowed with a G-metric and T be a self-map on a G-complete partially ordered G-metric space (X,G). The following statements are equivalent:

  1. (i)

    there exist functions ψ,ηΦ such that

    ψ ( G ( T x , T y , T y ) ) ψ ( G ( x , y , y ) ) η ( G ( x , y , y ) ) ,
    (65)
  2. (ii)

    there exist α[0,1) and a function ψΦ such that

    ψ ( G ( T x , T y , T y ) ) αψ ( G ( x , y , y ) ) ,
    (66)
  3. (iii)

    there exists a continuous and nondecreasing function α:[0,)[0,) such that α(t)<t for all t>0 such that

    G(Tx,Ty,Ty)α ( G ( x , y , y ) ) ,
    (67)
  4. (iv)

    there exist a function ψΦ and a nondecreasing function η:[0,)[0,) with η 1 (0)=0 such that

    ψ ( G ( T x , T y , T y ) ) ψ ( G ( x , y , y ) ) η ( G ( x , y , y ) ) ,
    (68)
  5. (iv)

    there exist a function ψΦ and a lower semi-continuous function η:[0,)[0,) with η 1 (0)=0 and lim inf t η(t)>0 such that

    ψ ( G ( T x , T y , T y ) ) ψ ( G ( x , y , y ) ) η ( G ( x , y , y ) ) ,
    (69)

for any x,yX with xy.

4 Remarks on coupled fixed point theorems in G-metric spaces

In this section, we prove that most of the coupled fixed point theorems on a G-metric space X can be derived from the well-known fixed point theorems on G-metric spaces in the literature provided that (X,G) is a symmetric G-metric space. In the rest this paper, we shall assume that (X,G) represents a symmetric G-metric space.

Let (X,) be a partially ordered set endowed with a metric G and F:X×XX and g:XX be given mappings. We define a partial order ⪯2 on the product set X×X as follows:

(x,y),(u,v)X×X,(x,y) 2 (u,v)xu,yv.

Definition 4.1 F is said to have the mixed g-monotone property if F(x,y) is monotone nondecreasing in x and is monotone nonincreasing in y; that is, for any x,yX,

If g is an identity mapping, then F is said to have the mixed monotone property, that is,

Let Y=X×X. It is easy to show that the mappings Λ,Δ:Y×Y×Y[0,) defined by

(70)
(71)

for all (x,y),(u,v),(z,w)Y, are G-metrics on Y.

Now, define the mapping T:YY by

T(x,y)= ( F ( x , y ) , F ( y , x ) ) ,for all (x,y)Y.
(72)

The following lemma is obvious.

Lemma 4.1 The following properties hold:

  1. (a)

    If (X,G) is G-complete, then (Y,Λ) and (Y,Δ) are Λ-complete and Δ-complete, respectively;

  2. (b)

    F has the mixed (g-mixed) monotone property if and only if T is monotone nondecreasing (g-nondecreasing) with respect to2;

  3. (c)

    (x,y)X×X is a coupled fixed point of F if and only if (x,y) is a fixed point of T;

  4. (d)

    (x,y)X×X is a coupled coincidence point of F and g if and only if (x,y) is a coupled coincidence point of T and g.

4.1 Shatanawi’s coupled fixed point results in a G-metric space

In [31], Shatanawi proved the following theorems.

Theorem 4.1 (cf. [31])

Let (X,G) be a G-complete G-metric space. Let F:X×XX be a mapping such that

G ( F ( x , y ) , F ( u , v ) , F ( w , z ) ) k 2 ( G ( x , u , w ) + G ( y , v , z ) )
(73)

for all x,y,u,v,z,wX. If k[0,1), then there exists a unique xX such that F(x,x)=x.

In what follows, we prove the following theorem.

Theorem 4.2 Theorem  4.1 follows from Theorem  2.1.

Proof From (73), for all (x,y),(u,v),(z,w)Y with xuz and yvw, we have

G ( F ( x , y ) , F ( u , v ) , F ( z , w ) ) k 2 [ G ( x , u , z ) + G ( y , v , w ) ]

and

G ( F ( y , x ) , F ( v , u ) , F ( w , z ) ) k 2 [ G ( x , u , z ) + G ( y , v , w ) ] ,

which implies that

G ( F ( x , y ) , F ( u , v ) , F ( z , w ) ) +G ( F ( y , x ) , F ( v , u ) , F ( w , z ) ) k [ G ( x , u , z ) + G ( y , v , w ) ] ,

that is,

Λ ( T ( x , y ) , T ( u , v ) , T ( z , w ) ) kΛ ( ( x , y ) , ( u , v ) , ( z , w ) )

for all (x,y),(u,v),(z,w)Y, where Λ is defined in (70). From Lemma 4.1, since (X,G) is G-complete, (Y,Λ) is Λ-complete. In this case, regarding Theorem 2.1, we conclude that T has a fixed point, which due to Lemma 4.1 implies that F has a coupled fixed point.

Analogously, Theorem 4.3 is obtained from Theorem 2.2. □

The following theorem can be derived easily from Theorem 4.1.

Theorem 4.3 Let (X,G) be a G-complete G-metric space. Let F:X×XX be a mapping such that

G ( F ( x , y ) , F ( u , v ) , F ( u , v ) ) k 2 ( G ( x , u , u ) + G ( y , v , v ) ) for all x,y,u,vX.
(74)

If k[0,1), then there is a unique xX such that F(x,x)=x.

We note that Theorem 4.3 above is not stated in [31].

Theorem 4.4 Theorem  4.3 follows from Theorem  2.2.

Example 4.1 Let X=R. Define G:X×X×X[0,+) by

G(x,y,z)=|xy|+|xz|+|yz|

for all x,y,zX. Then (X,G) is a G-metric space. Define a map F:X×XX by F(x,y)= 3 5 x 1 5 y for all x,yX. Then, for all x,y,u,v,w,zX with y=v=z, we have

G ( F ( x , y ) , F ( u , v ) , F ( w , z ) ) = G ( 3 5 x 1 5 y , 3 5 u 1 5 v , 3 5 w 1 5 z ) = 3 5 [ | x u | + | x w | + | u w | ]

and

G(x,u,w)+G(y,v,z)=|xu|+|xw|+|uw|.

Then it is easy to see that there is no k[0,1) such that

G ( F ( x , y ) , F ( u , v ) , F ( w , z ) ) k 2 [ G ( x , u , w ) + G ( y , v , z ) ]

for all x,y,u,v,z,wX. Indeed, the inequality above holds for k 6 5 . Thus, Theorem 4.1 does not apply to this example. However, it is easy to see that 0 is the unique point such that F(0,0)=0.

On the other hand, Theorem 2.1 yields the existence of the fixed point. Indeed,

where k[ 4 5 ,1). Thus, all conditions of Theorem 3.1 are satisfied, which guarantees the existence of the fixed point F(0,0)=0.

4.2 Choudhury and Maity’s coupled fixed point results in a G-metric space

Choudhury and Maity [53] proved the following coupled fixed point theorems on ordered G-metric spaces.

Theorem 4.5 Let (X,) be a partially ordered set and G be a G-metric on X such that (X,G) is a complete G-metric space. Let F:X×XX be a G-continuous mapping having the mixed monotone property on X. Suppose that there exists a k[0,1) such that

G ( F ( x , y ) , F ( u , v ) , F ( w , z ) ) k 2 [ G ( x , u , w ) + G ( y , v , z ) ]
(75)

for all x,y,u,v,w,zX with xuw and yvz, where either uw or vz. If there exist x 0 , y 0 X such that x 0 F( x 0 , y 0 ) and F( y 0 , x 0 ) y 0 , then F has a coupled fixed point, that is, there exists (x,y)X×X such that x=F(x,y) and y=F(y,x).

Theorem 4.6 If in the above theorem, instead of G-continuity of F, we assume that X is ordered complete, then F has a coupled fixed point.

We will prove the following result.

Theorem 4.7 Theorem  4.5 and Theorem  4.6 follow from Theorems 3.4 and 3.6, respectively.

Proof From (75), for all (x,y),(u,v),(w,z)X×X with xuw and yvz, we have

G ( F ( x , y ) , F ( u , v ) , F ( w , z ) ) k 2 [ G ( x , u , w ) + G ( y , v , z ) ]

and

G ( F ( y , x ) , F ( v , u ) , F ( z , w ) ) k 2 [ G ( x , u , w ) + G ( y , v , z ) ] .

This implies that for all (x,y),(u,v),(w,z)X×X with xuw and yvz,

G ( F ( x , y ) , F ( u , v ) , F ( w , z ) ) +G ( F ( y , x ) , F ( v , u ) , F ( z , w ) ) k [ G ( x , u , w ) + G ( y , v , z ) ] ,

that is,

Λ ( T ( x , y ) , T ( u , v ) , T ( w , z ) ) kΛ ( ( x , y ) , ( u , v ) , ( w , z ) )

for all (x,y),(u,v),(w,z)Y with (x,y) 2 (u,v) 2 (w,z), where Λ is defined in (70).

It follows from Lemma 4.1 that since (X,G) is G-complete, then (Y,Λ) is Λ-complete. Since F has the mixed monotone property, T is a nondecreasing mapping with respect to ⪯2. The assumption that there exist x 0 , y 0 X such that x 0 F( x 0 , y 0 ) and F( y 0 , x 0 ) y 0 becomes ( x 0 , y 0 ) 2 T( x 0 , y 0 ) in terms of the order ⪯2. Now, if F is G-continuous, then T is Λ-continuous. In this case, applying Theorem 3.4, we get that T has a fixed point, which due to Lemma 4.1 implies that F has a coupled fixed point. If X is ordered complete, then Y satisfies the following property: if a nondecreasing (with respect to ⪯2) sequence { u n } in Y converges to some point uY, then u n 2 u for all n. Applying Theorem 3.6, we get that T has a fixed point, that is, F has a coupled fixed point. □

Remark 4.1 (Uniqueness)

If, in addition, we suppose that for all (x,y),(u,v)X×X, there exists ( z 1 , z 2 )X×X such that (x,y) 2 ( z 1 , z 2 ) and (u,v) 2 ( z 1 , z 2 ), from the last part of Theorems 3.4 and 3.6, we obtain the uniqueness of the fixed point of T, which implies the uniqueness of the coupled fixed point of F. Now, let ( x , y )X×X be the unique coupled fixed point of F. Since ( y , x ) is also a coupled fixed point of F, we get x = y .

4.3 Coupled fixed point results of Aydi et al. in a G-metric space

We consider the following fixed point theorems established by Aydi et al. [23]. The following lemma is trivial.

Lemma 4.2 (See [23]) Let ϕΨ. For all t>0, we have lim n ϕ n (t)=0.

Aydi et al. [17] proved the following fixed point theorems.

Theorem 4.8 Let (X,) be a partially ordered set and G be a G-metric on X such that (X,G) is a G-complete G-metric space. Suppose that there exist ϕΨ and F:X×XX such that

G ( F ( x , y ) , F ( u , v ) , F ( w , z ) ) ϕ ( G ( x , u , w ) + G ( y , v , z ) 2 )
(76)

for all x,y,u,v,w,zX with xuw and yvz. Suppose also that F is G-continuous and has the mixed monotone property. If there exist x 0 , y 0 X such that x 0 F( x 0 , y 0 ) and F( y 0 , x 0 ) y 0 , then F has a coupled fixed point, that is, there exists (x,y)X×X such that x=F(x,y) and y=F(y,x).

Replacing the G-continuity of F by ordered completeness of X yields the next theorem.

Theorem 4.9 Let (X,) be a partially ordered set and G be a G-metric on X such that (X,G,) is G-complete. Suppose that there exist ϕΨ and F:X×XX such that

G ( F ( x , y ) , F ( u , v ) , F ( w , z ) ) ϕ ( G ( x , u , w ) + G ( y , v , z ) 2 )
(77)

for all x,y,u,v,w,zX with xuw and yvz. Suppose also that F has the mixed monotone property and X is ordered complete. If there exist x 0 , y 0 X such that x 0 F( x 0 , y 0 ) and F( y 0 , x 0 ) y 0 , then F has a coupled fixed point, that is, there exists (x,y)X×X such that x=F(x,y) and y=F(y,x).

We will prove the following result.

Theorem 4.10 Theorem  4.8 and Theorem  4.9 follow from Theorems 3.9 and 3.10, respectively.

Proof From (76), for all (x,y),(u,v),(w,z)X×X with xuw and yvz, we have

G ( F ( x , y ) , F ( u , v ) , F ( w , z ) ) ϕ ( G ( x , u , w ) + G ( y , v , z ) 2 )

and

G ( F ( y , x ) , F ( v , u ) , F ( z , w ) ) ϕ ( G ( x , u , w ) + G ( y , u , z ) 2 ) .

This implies that for all (x,y),(u,v),(w,z)X×X with xuw and yvz,

G ( F ( x , y ) , F ( u , v ) , F ( w , z ) ) + G ( F ( y , x ) , F ( v , u ) , F ( z , w ) ) 2 ϕ ( G ( x , u , w ) + G ( y , v , z ) 2 )

holds. Rewrite the above inequality as

Λ ( T ( x , y ) , T ( u , v ) , T ( w , z ) ) φ ( Λ ( ( x , y ) , ( u , v ) , ( w , z ) ) )

for all (x,y),(u,v),(w,z)Y with (x,y) 2 (u,v) 2 (w,z). Here, Λ :Y×Y×Y[0,) is the G-metric on Y defined by

Λ ( ( x , y ) , ( u , v ) , ( w , z ) ) = Λ ( ( x , y ) , ( u , v ) , ( w , z ) ) 2 ,for all (x,y),(u,v),(w,z)Y,

where Λ is given in (70). Thus, the mapping T satisfies the conditions of Theorem 3.9 (resp. Theorem 3.10). Therefore, T has a fixed point, which implies that F has a coupled fixed point. □

4.4 On coupled fixed point results of Abbas et al. in a G-metric space

Let Θ be the set of functions θ: [ 0 , ) 2 [0,1) which satisfy the condition

θ( s n , t n )1implies t n , s n 0.

The following theorems have been given by Abbas et al. [37].

Theorem 4.11 Let (X,) be a partially ordered set and G be a G-metric on X. Assume that there is an altering distance function θΘ and a map F:X×XX such that

(78)

for all x,y,u,v,w,zX with xuw and yvz. Suppose that F is G-continuous and has the mixed monotone property. If there exist x 0 , y 0 X such that x 0 F( x 0 , y 0 ) and F( y 0 , x 0 ) y 0 , then F has a coupled fixed point, that is, there exists (x,y)X×X such that x=F(x,y) and y=F(y,x).

Theorem 4.12 Let (X,) be a partially ordered set and G be a G-metric on X. Assume that there is an altering distance function θΘ and a mapping F:X×XX such that

(79)

for all x,y,u,v,w,zX with xuw and yvz. Suppose that F has the mixed monotone property and X is ordered complete. If there exist x 0 , y 0 X such that x 0 F( x 0 , y 0 ) and F( y 0 , x 0 ) y 0 , then F has a coupled fixed point, that is, there exists (x,y)X×X such that x=F(x,y) and y=F(y,x).

We will prove the following result.

Theorem 4.13 Theorem  4.11 and Theorem  4.12 follow from Theorem  3.11 and Theorem  3.12.

Proof From (78), for all (x,y),(u,v),(w,z)X×X with xuw and yvz, we have

(80)

This is equivalent to

Λ ( T ( x , y ) , T ( u , v ) , T ( w , z ) ) β ( Λ ( ( x , y ) , ( u , v ) , ( w , z ) ) ) Λ ( ( x , y ) , ( u , v ) , ( w , z ) )

for all (x,y),(u,v),(z,w)Y with (x,y) 2 (u,v) 2 (w,z), where θ(t,s)=β(t+s), which clearly implies that βS.

From Lemma 4.1, since (X,G) is G-complete, (Y,Λ) is Λ-complete. Since F has the mixed monotone property, T is a nondecreasing mapping with respect to ⪯2. According to the assumption of Theorem 4.11, we have ( x 0 , y 0 ) 2 T( x 0 , y 0 ). Now, if F is G-continuous, then T is Λ-continuous. In this case, applying Theorem 3.11, we get that T has a fixed point, which implies from Lemma 4.1 that F has a coupled fixed point. If X is ordered complete, then Y satisfies the following property: if a nondecreasing (with respect to ⪯2) then the sequence { u n } in Y converges to some point uY, then u n 2 u for all n. Applying Theorem 3.12, we get that T has a fixed point, which implies that F has a coupled fixed point. □

5 Remarks on common coupled fixed point theorems in G-metric spaces

In this last section, we investigate the similarity between most of the common coupled fixed point theorems and ordinary fixed point theorems in the context of G-metric spaces and we show that the former are immediate consequences of the latter.

5.1 Shatanawi’s common coupled fixed point results in a G-metric space

We start with two theorems by Shatanawi [31].

Theorem 5.1 (cf. [31])

Let (X,G) be a G-metric space. Let F:X×XX and g:XX be two mappings such that

G ( F ( x , y ) , F ( u , v ) , F ( w , z ) ) k 2 ( G ( g x , g u , g w ) + G ( g y , g v , g z ) )
(81)

for all x,y,u,v,z,wX. Assume that F and g satisfy the following conditions:

  1. (1)

    F(X×X)g(X),

  2. (2)

    g(X) is G-complete,

  3. (3)

    g is G-continuous and commutes with F.

If k[0,1), then there is a unique xX such that gx=F(x,x)=x.

Theorem 5.2 (cf. [31])

Let (X,G) be a G-metric space. Let F:X×XX and g:XX be two mappings such that

G ( F ( x , y ) , F ( u , v ) , F ( u , v ) ) k 2 ( G ( g x , g u , g u ) + G ( g y , g v , g v ) )
(82)

for all x,y,u,vX. Assume that F and g satisfy the following conditions:

  1. (1)

    F(X×X)g(X),

  2. (2)

    g(X) is G-complete,

  3. (3)

    g is G-continuous and commutes with F.

If k[0,1), then there is a unique xX such that gx=F(x,x)=x.

Theorem 5.3 Theorem  5.1 and Theorem  5.2 follow from Theorem  3.1 and Theorem  3.2, respectively.

Proof From (81), for all (x,y),(u,v),(w,z)X×X, we have

G ( F ( x , y ) , F ( u , v ) , F ( w , z ) ) k 2 [ G ( g x , g u , g w ) + G ( g y , g v , g z ) ] ,

and

G ( F ( y , x ) , F ( v , u ) , F ( z , w ) ) k 2 [ G ( g x , g u , g w ) + G ( g y , g v , g z ) ] .

Therefore, for all (x,y),(u,v),(w,z)X×X, we obtain

that is,

Λ ( T F ( x , y ) , T F ( u , v ) , T F ( w , z ) ) kΛ ( T g ( x , y ) , T g ( u , v ) , T g ( w , z ) )

for all (x,y),(u,v),(w,z)Y, where T F , T g : X 2 X 2 are mappings such that T F (a,b)=(F(a,b),F(b,a)) and T g (a,b)=(ga,gb) and Λ is defined in (70). From Lemma 4.1, since (X,G) is G-complete, (Y,Λ) is Λ-complete. In this case, applying Theorem 3.1, we get that T F and T g have a common fixed point, which implies from Lemma 4.1 that F and g have a common coupled fixed point.

Analogously, Theorem 5.2 is obtained from Theorem 3.2. □

Example 5.1 Let X=R. Define G:X×X×X[0,+) by

G(x,y,z)=|xy|+|xz|+|yz|

for all x,y,zX. Then (X,G) is a G-metric space. Define a map F:X×XX by F(x,y)= 4 8 x 1 8 y and g:XX by g(x)= 7 x 8 for all x,yX. Then, for all x,y,u,v,z,wX with y=v=z, we have

G ( F ( x , y ) , F ( u , v ) , F ( w , z ) ) = G ( 4 8 x 1 8 y , 4 8 u 1 8 v , 4 8 w 1 8 z ) = 4 8 [ | x u | + | x w | + | u w | ]

and

G ( g x , g u , g z ) + G ( g y , g v , g w ) = G ( 7 x 8 , 7 u 8 , 7 w 8 ) + G ( 7 y 8 , 7 v 8 , 7 z 8 ) = 7 8 [ | x u | + | x w | + | u w | ] .

Then it is easy to see that there is no k[0,1) such that

G ( F ( x , y ) , F ( u , v ) , F ( w , z ) ) k 2 [ G ( g x , g u , g w ) + G ( g y , g v , g z ) ]

for all x,y,u,v,z,wX. Thus, Theorem 5.1 does not provide the existence of the common fixed point for the maps on this example. However, it is easy to see that 0 is the unique point xX such that x=gx=F(x,x).

On the other hand, notice that Theorem 3.1 yields the fixed point. Indeed,

and also

G ( g x , g u , g w ) + G ( g y , g v , g z ) = G ( 7 x 8 , 7 u 8 , 7 w 8 ) + G ( 7 y 8 , 7 v 8 , 7 z 8 ) = 7 8 [ | x u | + | x w | + | u w | ] .

Then the condition (6) of Theorem 3.1 holds for k[ 5 7 ,1). Thus, all conditions of Theorem 3.1 are satisfied, which provides the common coupled fixed point of F and g.

5.2 Nashine’s common coupled fixed point results in a G-metric space

Nashine [54] studied common coupled fixed points on ordered G-metric spaces and proved the following theorems.

Theorem 5.4 Let (X,G,) be a partially ordered G-metric space. Let F:X×XX and g:XX be mappings such that F has the mixed g-monotone property. Suppose that there exist x 0 , y 0 X such that g x 0 F( x 0 , y 0 ) and F( y 0 , x 0 )g y 0 . Suppose also that there exists k[0, 1 2 ) such that

G ( F ( x , y ) , F ( u , v ) , F ( w , z ) ) k [ G ( g x , g u , g w ) + G ( g y , g v , g z ) ]
(83)

holds for all x,y,u,v,w,zX satisfying gxgugw and gygvgz, where either gugz or gvgw. We assume the following hypotheses:

  1. (i)

    F(X×X)g(X),

  2. (ii)

    F is G-continuous,

  3. (iii)

    g(X) is G-complete,

  4. (iv)

    g is G-continuous and commutes with F.

Then F and g have a coupled coincidence point, that is, there exists (x,y)X×X such that gx=F(x,y) and gy=F(y,x). If gu=gz and gv=gw, then F and g have a common fixed point, that is, there exists xX such that gx=F(x,x)=x.

Theorem 5.5 If in the above theorem we replace the G-continuity of F by the assumption that X is g-ordered complete, then F and g have a coupled coincidence point.

Theorem 5.6 Theorem  5.4 and Theorem  5.5 follow from Corollary  3.3 and Corollary  3.4, respectively.

Proof From (83), for all (x,y),(u,v),(w,z)X×X with gxgugw and gygvgz, we have

G ( F ( x , y ) , F ( u , v ) , F ( w , z ) ) k 2 [ G ( g x , g u , g w ) + G ( g y , g v , g z ) ]

and

G ( F ( y , x ) , F ( v , u ) , F ( z , w ) ) k 2 [ G ( g x , g u , g w ) + G ( g y , g v , g z ) ] .

This implies that for all (x,y),(u,v),(z,w)X×X with gxgugw and gygvgz,

G ( F ( x , y ) , F ( u , v ) , F ( w , z ) ) +G ( F ( y , x ) , F ( v , u ) , F ( z , w ) ) k [ G ( g x , g u , g w ) + G ( g y , g v , g z ) ] ,

that is,

Λ ( T ( x , y ) , T ( u , v ) , T ( w , z ) ) kΛ ( ( g x , g y ) , ( g u , g v ) , ( g z , g w ) )

for all (x,y),(u,v),(z,w)Y with (gx,gy) 2 (gu,gv) 2 (gw,gz).

From Lemma 4.1, since (X,G) is G-complete, (Y,Λ) is Λ-complete. Also, since F has the mixed g-monotone property, T is a g-nondecreasing mapping with respect to ⪯2. From the assumption of Theorem 5.4, we have (g x 0 ,g y 0 ) 2 T( x 0 , y 0 ). Now, if F is G-continuous, then T is Λ-continuous. In this case, due to Corollary 3.3, we deduce that T and g have a coincidence point, which from Lemma 4.1 implies that F and g have a coupled coincidence point. If, on the other hand, X is g-ordered complete, then Y satisfies the following property: if a nondecreasing (with respect to ⪯2) sequence { u n } in Y converges to a point uY, then u n 2 u for all n. According to Corollary 3.4, T and g have a coincidence point, which from Lemma 4.1 implies that F and g have a coupled coincidence point. □

5.3 Common coupled fixed point results of Aydi et al. in a G-metric space

Recently, Aydi et al. [17] proved the following theorems on G-metric spaces.

Theorem 5.7 Let (X,) be a partially ordered set and G be a G-metric on X such that (X,G) is a G-complete G-metric space. Suppose that there exist maps ϕΨ and F:X×XX and g:XX such that

G ( F ( x , y ) , F ( u , v ) , F ( w , z ) ) ϕ ( G ( g x , g u , g w ) + G ( g y , g v , g z ) 2 )
(84)

for all x,y,u,v,w,zX with gxgugw and gygvgz. Suppose also that F is G-continuous and has the mixed g-monotone property, F(X×X)g(X), and g is G-continuous and commutes with F. If there exist x 0 , y 0 X such that g x 0 F( x 0 , y 0 ) and F( y 0 , x 0 )g y 0 , then F and g have a coupled coincidence point, that is, there exists (x,y)X×X such that gx=F(x,y) and gy=F(y,x).

Theorem 5.8 Let (X,) be a partially ordered set and G be a G-metric on X such that (X,G,) is G-complete. Suppose that there exist ϕΨ and F:X×XX and g:XX such that

G ( F ( x , y ) , F ( u , v ) , F ( w , z ) ) ϕ ( G ( g x , g u , g w ) + G ( g y , g v , g z ) 2 )
(85)

for all x,y,u,v,w,zX with gxgugw and gygvgz. Suppose also that X is g-ordered complete and F has the mixed g-monotone property, F(X×X)g(X), and g is G-continuous and commutes with F. If there exist x 0 , y 0 X such that g x 0 F( x 0 , y 0 ) and F( y 0 , x 0 )g y 0 , then F and g have a coupled coincidence point, that is, there exists (x,y)X×X such that gx=F(x,y) and gy=F(y,x).

The following result can be also proved easily.

Theorem 5.9 Theorem  4.8 and Theorem  4.9 follow from Theorems 3.7 and 3.8.

Proof We observe from (84) that for all (x,y),(u,v),(w,z)X×X with gxgugw and gygvgz, we have

G ( F ( x , y ) , F ( u , v ) , F ( w , z ) ) ϕ ( G ( g x , g u , g w ) + G ( g y , g v , g z ) 2 ) ,

and also

G ( F ( y , x ) , F ( v , u ) , F ( z , w ) ) ϕ ( G ( g x , g u , g w ) + G ( g y , g v , g z ) 2 ) .

Therefore, for all (x,y),(u,v),(w,z)X×X with gxgugw and gygvgz, the following inequality holds:

that is,

Λ ( T F ( x , y ) , T F ( u , v ) , T F ( w , z ) ) φ ( Λ ( T g ( x , y ) , T g ( u , v ) , T g ( w , z ) ) )

for all (x,y),(u,v),(w,z)Y with (x,y) 2 (u,v) 2 (w,z), where T F , T g : X 2 X 2 are mappings such that T F (a,b)=(F(a,b),F(b,a)) and T g (a,b)=(ga,gb). Note that here, Λ :Y×Y×Y[0,) is a G-metric on Y defined by

Λ ( ( x , y ) , ( u , v ) , ( w , z ) ) = Λ ( ( x , y ) , ( u , v ) , ( w , z ) ) 2 for all (x,y),(u,v),(w,z)Y.

Thus, we proved that the mappings T F and T g satisfy the conditions of Theorem 3.7 (resp. Theorem 3.8). Hence, T F and T g have a coincidence point, which implies that F and g have a coupled coincidence point. □

5.4 Common coupled fixed point results of Cho et al. in a G-metric space

Finally, we consider the results of Cho et al. [55]. We state their fixed point theorems below.

Theorem 5.10 Let (X,) be a partially ordered set and G be a G-metric on X such that (X,G) is a G-complete G-metric space. Let F:X×XX and g:XX be G-continuous mappings such that F has the mixed g-monotone property and g commutes with F. Assume that there exist altering distance functions ϕ and ψ such that

ψ ( G ( F ( x , y ) , F ( u , v ) , F ( w , z ) ) ) ψ ( max { G ( g x , g u , g w ) , G ( g y , g v , g z ) } ) ϕ ( max { G ( g x , g u , g w ) , G ( g y , g v , g z ) } )
(86)

for all x,y,u,v,w,zX with gxgugw and gygvgz. Suppose also that F(X×X)g(X). If there exist x 0 , y 0 X such that g x 0 F( x 0 , y 0 ) and F( y 0 , x 0 )g y 0 , then F and g have a coupled coincidence point, that is, there exists (x,y)X×X such that gx=F(x,y) and gy=F(y,x).

Theorem 5.11 Let (X,) be a partially ordered set and G be a G-metric on X and let F:X×XX and g:XX be mappings. Assume that there exist altering distance functions ϕ and ψ such that

ψ ( G ( F ( x , y ) , F ( u , v ) , F ( w , z ) ) ) ψ ( max { G ( g x , g u , g w ) , G ( g y , g v , g z ) } ) ϕ ( max { G ( g x , g u , g w ) , G ( g y , g v , g z ) } )
(87)

for all x,y,u,v,w,zX with gxgugw and gygvgz. Suppose that g(X) is G-complete, the mapping F has the mixed g-monotone property and F(X×X)g(X). If there exist x 0 , y 0 X such that g x 0 F( x 0 , y 0 ) and F( y 0 , x 0 )g y 0 , then F and g have a coupled coincidence point, that is, there exists (x,y)X×X such that gx=F(x,y) and gy=F(y,x).

Theorem 5.12 Theorem  5.10 and Theorem  5.11 follow from Theorems 3.7 and 3.8.

Proof From the assumption, for all (x,y),(u,v),(z,w)X×X with gxgugw and gygvgz, we have

ψ ( G ( F ( x , y ) , F ( u , v ) , F ( w , z ) ) ) ψ ( max { G ( g x , g u , g w ) , G ( g y , g v , g z ) } ) ϕ ( max { G ( g x , g u , g w ) , G ( g y , g v , g z ) } )
(88)

and

ψ ( G ( F ( y , x ) , F ( v , u ) , F ( z , w ) ) ) ψ ( max { G ( g x , g u , g w ) , G ( g y , g v , g z ) } ) ϕ ( max { G ( g x , g u , g w ) , G ( g y , g v , g z ) } ) .
(89)

This implies (since ψ is nondecreasing) that for all (x,y),(u,v),(z,w)X×X with gxgugw and gygvgw, we have

that is,

ψ ( Δ ( T F ( x , y ) , T F ( u , v ) , T F ( z , w ) ) ) ψ ( Δ ( T g ( x , y ) , T g ( u , v ) , T g ( z , w ) ) ) φ ( Δ ( T g ( x , y ) , T g ( u , v ) , T g ( z , w ) ) )
(90)

for all (x,y),(u,v),(z,w)Y with (gx,gy) 2 (gu,gv) 2 (gz,gw), where T F , T g : X 2 X 2 such that T F (a,b)=(F(a,b),F(b,a)) and T g (a,b)=(ga,gb) and Δ is a G-metric defined in (71). Regarding Theorem 3.13, the conditions (90) and (32) of Theorem 3.7 are equivalent. Therefore, the mappings T F and T g satisfy the conditions of Theorem 3.7 (resp. Theorem 3.8) and have a coincidence point. Hence, the maps F and g have a coupled coincidence point. □