1 Introduction and preliminaries

There are many generalized metric spaces such as 2-metric spaces [1], G-metric spaces [2], D -metric spaces [3], partial metric spaces [4] and cone metric spaces [5]. These notions have been investigated by many authors and various versions of fixed point theorems have been stated in [623] recently. In [24], Sedghi, Shobe and Aliouche have introduced the notion of an S-metric space and proved that this notion is a generalization of a G-metric space and a D -metric space. Also, they have proved some properties of S-metric spaces and some fixed point theorems for a self-map on an S-metric space. An interesting work that naturally rises is to transport certain results in metric spaces and known generalized metric spaces to S-metric spaces. In this way, some results have been obtained in [2426].

In [27], Gordji et al. have introduced the concept of a mixed weakly monotone pair of maps and proved some coupled common fixed point theorems for a contractive-type maps with the mixed weakly monotone property in partially ordered metric spaces. These results give rise to stating coupled common fixed point theorems for maps with the mixed weakly monotone property in partially ordered S-metric spaces.

In this paper, we use the notion of a mixed weakly monotone pair of maps to state a coupled common fixed point theorem for maps on partially ordered S-metric spaces. This result generalizes the main results of [6, 27, 28] into the structure of S-metric spaces.

First we recall some notions, lemmas and examples which will be useful later.

Definition 1.1 [[24], Definition 2.1]

Let X be a nonempty set. An S-metric on X is a function S: X 3 [0,) that satisfies the following conditions for all x,y,z,aX:

  1. 1.

    S(x,y,z)=0 if and only if x=y=z.

  2. 2.

    S(x,y,z)S(x,x,a)+S(y,y,a)+S(z,z,a).

The pair (X,S) is called an S-metric space.

The following is an intuitive geometric example for S-metric spaces.

Example 1.2 [[24], Example 2.4]

Let X= R 2 and d be an ordinary metric on X. Put

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

for all x,y,z R 2 , that is, S is the perimeter of the triangle given by x, y, z. Then S is an S-metric on X.

Lemma 1.3 [[24], Lemma 2.5]

Let (X,S) be an S-metric space. Then S(x,x,y)=S(y,y,x) for all x,yX.

The following lemma is a direct consequence of Definition 1.1 and Lemma 1.3.

Lemma 1.4 [[25], Lemma 1.6]

Let (X,S) be an S-metric space. Then

S(x,x,z)2S(x,x,y)+S(y,y,z)

and

S(x,x,z)2S(x,x,y)+S(z,z,y)

for all x,y,zX.

Definition 1.5 [[24], Definition 2.8]

Let (X,S) be an S-metric space.

  1. 1.

    A sequence { x n }X is said to converge to xX if S( x n , x n ,x)0 as n. That is, for each ε>0, there exists n 0 N such that for all n n 0 we have S( x n , x n ,x)<ε. We write x n x for brevity.

  2. 2.

    A sequence { x n }X is called a Cauchy sequence if S( x n , x n , x m )0 as n,m. That is, for each ε>0, there exists n 0 N such that for all n,m n 0 we have S( x n , x n , x m )<ε.

  3. 3.

    The S-metric space (X,S) is said to be complete if every Cauchy sequence is a convergent sequence.

From [[24], Examples on p.260] we have the following.Example 1.6

  1. 1.

    Let ℝ be a real line. Then

    S(x,y,z)=|xz|+|yz|

    for all x,y,zR is an S-metric on ℝ. This S-metric is called the usual S-metric on ℝ. Furthermore, the usual S-metric space ℝ is complete.

  2. 2.

    Let Y be a nonempty subset of ℝ. Then

    S(x,y,z)=|xz|+|yz|

    for all x,y,zY is an S-metric on Y. Furthermore, if Y is a closed subset of the usual metric space ℝ, then the S-metric space Y is complete.

Lemma 1.7 [[24], Lemma 2.12]

Let (X,S) be an S-metric space. If x n x and y n y, then S( x n , x n , y n )S(x,x,y).

Definition 1.8 [24]

Let (X,S) be an S-metric space. For r>0 and xX, we define the open ball B S (x,r) and the closed ball B S [x,r] with center x and radius r as follows:

The topology induced by the S-metric or the S-metric topology is the topology generated by the base of all open balls in X.

Lemma 1.9 Let { x n } be a sequence in X. Then x n x in the S-metric space (X,S) if and only if x n x in the S-metric topological space X.

Proof It is a direct consequence of Definition 1.5(1) and Definition 1.8. □

The following lemma shows that every metric space is an S-metric space.

Lemma 1.10 Let (X,d) be a metric space. Then we have

  1. 1.

    S d (x,y,z)=d(x,z)+d(y,z) for all x,y,zX is an S-metric on X.

  2. 2.

    x n x in (X,d) if and only if x n x in (X, S d ).

  3. 3.

    { x n } is Cauchy in (X,d) if and only if { x n } is Cauchy in (X, S d ).

  4. 4.

    (X,d) is complete if and only if (X, S d ) is complete.

Proof

  1. 1.

    See [[24], Example (3), p.260].

  2. 2.

    x n x in (X,d) if and only if d( x n ,x)0, if and only if

    S d ( x n , x n ,x)=2d( x n ,x)0,

that is, x n x in (X, S d ).

  1. 3.

    { x n } is Cauchy in (X,d) if and only if d( x n , x m )0 as n,m, if and only if

    S d ( x n , x n , x m )=2d( x n , x m )0

as n,m, that is, { x n } is Cauchy in (X, S d ).

  1. 4.

    It is a direct consequence of (2) and (3).

 □

The following example proves that the inverse implication of Lemma 1.10 does not hold.

Example 1.11 Let X=R and S(x,y,z)=|y+z2x|+|yz| for all x,y,zX. By [[24], Example (1), p.260], (X,S) is an S-metric space. We will prove that there does not exist any metric d such that S(x,y,z)=d(x,z)+d(y,z) for all x,y,zX. Indeed, suppose to the contrary that there exists a metric d with S(x,y,z)=d(x,z)+d(y,z) for all x,y,zX. Then d(x,z)= 1 2 S(x,x,z)=|xz| and d(x,y)=S(x,y,y)=2|xy| for all x,y,zX. It is a contradiction.

Lemma 1.12 [[27], p.7]

Let (X,d) be a metric space. Then X×X is a metric space with the metric D d given by

D d ( ( x , y ) , ( u , v ) ) =d(x,u)+d(y,v)

for all x,y,u,vX.

Lemma 1.13 Let (X,S) be an S-metric space. Then X×X is an S-metric space with the S-metric D given by

D ( ( x , y ) , ( u , v ) , ( z , w ) ) =S(x,u,z)+S(y,v,w)

for all x,y,u,v,z,wX.

Proof For all x,y,u,v,z,wX, we have D((x,y),(u,v),(z,w))[0,) and

D ( ( x , y ) , ( u , v ) , ( z , w ) ) =0if and only ifS(x,u,z)+S(y,v,w)=0

if and only if x=u=z, y=v=w, that is, (x,y)=(u,v)=(z,w); and

By the above, D is an S-metric on X×X. □

Remark 1.14 Let (X,d) be a metric space. By using Lemma 1.13 with S= S d , we get

D ( ( x , y ) , ( x , y ) , ( u , v ) ) = S d (x,x,u)+ S d (y,y,v)=2 ( d ( x , u ) + d ( y , v ) ) =2 D d ( ( x , y ) , ( u , v ) )

for all x,y,u,vX.

Lemma 1.15 [[17], p.4]

Let (X,) be a partially ordered set. Then X×X is a partially ordered set with the partial orderdefined by

(x,y)(u,v)if and only ifxu,vy.

Remark 1.16 Let X be a subset of ℝ with the usual order. For each ( x 1 , x 2 ),( y 1 , y 2 )X×X, put z 1 =max{ x 1 , y 1 } and z 2 =min{ x 2 , y 2 }, then ( x 1 , x 2 )( z 1 , z 2 ) and ( y 1 , y 2 )( z 1 , z 2 ). Therefore, for each ( x 1 , x 2 ),( y 1 , y 2 )X×X, there exists ( z 1 , z 2 )X×X that is comparable to ( x 1 , x 2 ) and ( y 1 , y 2 ).

Definition 1.17 [[27], Definition 1.5]

Let (X,) be a partially ordered set and f,g:X×XX be two maps. We say that a pair (f,g) has the mixed weakly monotone property on X if, for all x,yX, we have

xf(x,y),f(y,x)yimpliesf(x,y)g ( f ( x , y ) , f ( y , x ) ) ,g ( f ( y , x ) , f ( x , y ) ) f(y,x)

and

xg(x,y),g(y,x)yimpliesg(x,y)f ( g ( x , y ) , g ( y , x ) ) ,f ( g ( y , x ) , g ( x , y ) ) g(y,x).

Example 1.18 [[27], Example 1.6]

Let f,g:R×RR be two functions given by

f(x,y)=x2y,g(x,y)=xy.

Then the pair (f,g) has the mixed weakly monotone property.

Example 1.19 [[27], Example 1.7]

Let f,g:R×RR be two functions given by

f(x,y)=xy+1,g(x,y)=2x3y.

Then f and g have the mixed monotone property but the pair (f,g) does not have the mixed weakly monotone property.

Remark 1.20 [[27], Remark 2.5]

Let (X,) be a partially ordered set; f:X×XX be a map with the mixed monotone property on X. Then for all nN, the pair ( f n , f n ) has the mixed weakly monotone property on X.

2 Main results

Theorem 2.1 Let (X,,S) be a partially ordered S-metric space; f,g:X×XX be two maps such that

  1. 1.

    X is complete;

  2. 2.

    The pair (f,g) has the mixed weakly monotone property on X; x 0 f( x 0 , y 0 ),f( y 0 , x 0 ) y 0 or x 0 g( x 0 , y 0 ),g( y 0 , x 0 ) y 0 for some x 0 , y 0 X;

  3. 3.

    There exist p,q,r,s0 satisfying p+q+r+2s<1 and

    (2.1)

for all x,y,u,vX with xu and yv where D is defined as in Lemma 1.13;

  1. 4.

    f or g is continuous or X has the following property:

  2. (a)

    If { x n } is an increasing sequence with x n x, then x n x for all nN;

  3. (b)

    If { x n } is an decreasing sequence with x n x, then x x n for all nN.

Then f and g have a coupled common fixed point in X.

Proof First we note that the roles of f and g can be interchanged in the assumptions. We need only prove the case x 0 f( x 0 , y 0 ) and f( y 0 , x 0 ) y 0 , the case x 0 g( x 0 , y 0 ) and g( y 0 , x 0 ) y 0 is proved similarly by interchanging the roles of f and g.

Step 1. We construct two Cauchy sequences in X.

Put x 1 =f( x 0 , y 0 ), y 1 =f( y 0 , x 0 ). Since (f,g) has the mixed weakly monotone property, we have

x 1 =f( x 0 , y 0 )g ( f ( x 0 , y 0 ) , f ( y 0 , x 0 ) ) =g( x 1 , y 1 )

and

y 1 =f( y 0 , x 0 )g ( f ( y 0 , x 0 ) , f ( x 0 , y 0 ) ) =g( y 1 , x 1 ).

Put x 2 =g( x 1 , y 1 ), y 2 =g( y 1 , x 1 ). Then we have

x 2 =g( x 1 , y 1 )f ( g ( x 1 , y 1 ) , g ( y 1 , x 1 ) ) =f( x 2 , y 2 )

and

y 2 =g( y 1 , x 1 )f ( g ( y 1 , x 1 ) , g ( x 1 , y 1 ) ) =f( y 2 , x 2 ).

Continuously, for all nN, we put

x 2 n + 1 = f ( x 2 n , y 2 n ) , y 2 n + 1 = f ( y 2 n , x 2 n ) , x 2 n + 2 = g ( x 2 n + 1 , y 2 n + 1 ) , y 2 n + 2 = g ( y 2 n + 1 , x 2 n + 1 )
(2.2)

that satisfy

x 0 x 1 x n and y 0 y 1 y n .
(2.3)

We will prove that { x n } and { y n } are two Cauchy sequences. For all nN, it follows from (2.1) that

By using (2.2) we get

S ( x 2 n + 1 , x 2 n + 1 , x 2 n + 2 ) p 2 D ( ( x 2 n , y 2 n ) , ( x 2 n , y 2 n ) , ( x 2 n + 1 , y 2 n + 1 ) ) + q 2 D ( ( x 2 n , y 2 n ) , ( x 2 n , y 2 n ) , ( x 2 n + 1 , y 2 n + 1 ) ) + r 2 D ( ( x 2 n + 1 , y 2 n + 1 ) , ( x 2 n + 1 , y 2 n + 1 ) , ( x 2 n + 2 , y 2 n + 2 ) ) + s 2 D ( ( x 2 n , y 2 n ) , ( x 2 n , y 2 n ) , ( x 2 n + 2 , y 2 n + 2 ) ) + s 2 D ( ( x 2 n + 1 , y 2 n + 1 ) , ( x 2 n + 1 , y 2 n + 1 ) , ( x 2 n + 1 , y 2 n + 1 ) ) = p + q 2 D ( ( x 2 n , y 2 n ) , ( x 2 n , y 2 n ) , ( x 2 n + 1 , y 2 n + 1 ) ) + r 2 D ( ( x 2 n + 1 , y 2 n + 1 ) , ( x 2 n + 1 , y 2 n + 1 ) , ( x 2 n + 2 , y 2 n + 2 ) ) + s 2 D ( ( x 2 n , y 2 n ) , ( x 2 n , y 2 n ) , ( x 2 n + 2 , y 2 n + 2 ) ) p + q + s 2 D ( ( x 2 n , y 2 n ) , ( x 2 n , y 2 n ) , ( x 2 n + 1 , y 2 n + 1 ) ) + r + s 2 D ( ( x 2 n + 1 , y 2 n + 1 ) , ( x 2 n + 1 , y 2 n + 1 ) , ( x 2 n + 2 , y 2 n + 2 ) ) .

That is,

(2.4)

Analogously to (2.4), we have

(2.5)

It follows from (2.4) and (2.5) that

(2.6)

For all nN, by interchanging the roles of f and g and using (2.1) again, we have

By using (2.2) we get

S ( x 2 n + 2 , x 2 n + 2 , x 2 n + 3 ) p 2 D ( ( x 2 n + 1 , y 2 n + 1 ) , ( x 2 n + 1 , y 2 n + 1 ) , ( x 2 n + 2 , y 2 n + 2 ) ) + q 2 D ( ( x 2 n + 1 , y 2 n + 1 ) , ( x 2 n + 1 , y 2 n + 1 ) , ( x 2 n + 2 , y 2 n + 2 ) ) + r 2 D ( ( x 2 n + 2 , y 2 n + 2 ) , ( x 2 n + 2 , y 2 n + 2 ) , ( x 2 n + 3 , y 2 n + 3 ) ) + s 2 D ( ( x 2 n + 1 , y 2 n + 1 ) , ( x 2 n + 1 , y 2 n + 1 ) , ( x 2 n + 3 , y 2 n + 3 ) ) + s 2 D ( ( x 2 n + 2 , y 2 n + 2 ) , ( x 2 n + 2 , y 2 n + 2 ) , ( x 2 n + 2 , y 2 n + 2 ) ) = p + q 2 D ( ( x 2 n + 1 , y 2 n + 1 ) , ( x 2 n + 1 , y 2 n + 1 ) , ( x 2 n + 2 , y 2 n + 2 ) ) + r 2 D ( ( x 2 n + 2 , y 2 n + 2 ) , ( x 2 n + 2 , y 2 n + 2 ) , ( x 2 n + 3 , y 2 n + 3 ) ) + s 2 D ( ( x 2 n + 1 , y 2 n + 1 ) , ( x 2 n + 1 , y 2 n + 1 ) , ( x 2 n + 3 , y 2 n + 3 ) ) p + q + s 2 D ( ( x 2 n + 1 , y 2 n + 1 ) , ( x 2 n + 1 , y 2 n + 1 ) , ( x 2 n + 2 , y 2 n + 2 ) ) + r + s 2 D ( ( x 2 n + 2 , y 2 n + 2 ) , ( x 2 n + 2 , y 2 n + 2 ) , ( x 2 n + 3 , y 2 n + 3 ) ) .

That is,

(2.7)

Analogously to (2.7), we have

(2.8)

It follows from (2.7) and (2.8) that

(2.9)

For all nN, (2.6) and (2.9) combine to give

(2.10)

Now we have

(2.11)

and

(2.12)

For all n,mN with nm, by using Lemma 1.4 and (2.11), (2.12), we have

Similarly, we have

and

and

Hence, for all n,mN with nm, it follows that

S( x n , x n , x m )+S( y n , y n , y m ) ( p + q + s 1 ( r + s ) ) 2 n 1 p + q + s 1 ( r + s ) ( S ( x 0 , x 0 , x 1 ) + S ( y 0 , y 0 , y 1 ) ) .

Since 0 p + q + s 1 ( r + s ) <1, taking the limit as n,m, we get

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

It implies that

lim n , m S( x n , x n , x m )= lim n , m S( y n , y n , y m )=0.

Therefore, { x n } and { y n } are two Cauchy sequences in X. Since X is complete, there exist x,yX such that x n x and y n y in X as n.

Step 2. We prove that (x,y) is a coupled common fixed point of f and g. We consider the following two cases.

Case 2.1. f is continuous. We have

x= lim n x 2 n + 1 = lim n f( x 2 n , y 2 n )=f ( lim n x 2 n , lim n y 2 n ) =f(x,y)

and

y= lim n y 2 n + 1 = lim n f( y 2 n , x 2 n )=f ( lim n y 2 n , lim n x 2 n ) =f(y,x).

Now using (2.1) we have

Therefore,

That is,

S ( x , x , g ( x , y ) ) +S ( y , y , g ( y , x ) ) (r+s) ( S ( x , x , g ( x , y ) ) + S ( y , y , g ( y , x ) ) ) .

Since 0r+s<1, we get S(x,x,g(x,y))=S(y,y,g(y,x))=0. That is, g(x,y)=x and g(y,x)=y. Therefore, (x,y) is a coupled common fixed point of f and g.

Case 2.2. g is continuous. We can also prove that (x,y) is a coupled common fixed point of f and g similarly as in Case 2.1.

Case 2.3. X satisfies two assumptions (a) and (b). Then by (2.3) we get x n x and y y n for all nN. By using Lemma 1.4 and Lemma 1.13, we have

(2.13)

By interchanging the roles of f and g and using (2.1), we have

(2.14)

Again, by using (2.1), we have

(2.15)

It follows from (2.13), (2.14) and (2.15) that

(2.16)

By using Lemma 1.7 and taking the limit as n in (2.16), we have

(2.17)

It implies that

(2.18)

Since r + q + 2 s 2 <1, we have S(x,x,f(x,y))+S(y,y,f(y,x))=0, that is, f(x,y)=x and f(y,x)=y. Similarly, one can show that g(x,y)=x and g(y,x)=y. This proves that (x,y) is a coupled common fixed point of f and g. □

From Theorem 2.1, we have following corollaries.

Corollary 2.2 [[27], Theorems 2.1 and 2.2]

Let (X,,d) be a partially ordered metric space; f,g:X×XX be two maps such that

  1. 1.

    X is complete;

  2. 2.

    The pair (f,g) has the mixed weakly monotone property on X; x 0 f( x 0 , y 0 ), f( y 0 , x 0 ) y 0 or x 0 g( x 0 , y 0 ), g( y 0 , x 0 ) y 0 for some x 0 , y 0 X;

  3. 3.

    There exist p,q,r,s0 satisfying p+q+r+2s<1 and

    (2.19)

for all x,y,u,vX with xu and yv, where D d is defined as in Lemma 1.12;

  1. 4.

    f or g is continuous or X has the following property:

  2. (a)

    If { x n } is an increasing sequence with x n x, then x n x for all nN;

  3. (b)

    If { x n } is an decreasing sequence with x n x, then x x n for all nN.

Then f and g have a coupled common fixed point in X.

Proof It is a direct consequence of Lemma 1.10, Remark 1.14 and Theorem 2.1. □

For similar results of the following for maps on metric spaces and cone metric spaces, the readers may refer to [[6], Theorems 2.1, 2.2, 2.4 and 2.6] and [[28], Theorem 3.1].

Corollary 2.3 Let (X,,S) be a partially ordered S-metric space and f:X×XX be a map such that

  1. 1.

    X is complete;

  2. 2.

    f has the mixed monotone property on X; x 0 f( x 0 , y 0 ) and f( y 0 , x 0 ) y 0 for some x 0 , y 0 X;

  3. 3.

    There exist p,q,r,s0 satisfying p+q+r+2s<1 and

    (2.20)

for all x,y,u,vX with xu and yv;

  1. 4.

    f is continuous or X has the following property:

  2. (a)

    If { x n } is an increasing sequence with x n x, then x n x for all nN;

  3. (b)

    If { x n } is an decreasing sequence with x n x, then x x n for all nN.

Then f has a coupled fixed point in X.

Proof By choosing g=f in Theorem 2.1 and using Remark 1.20, we get the conclusion. □

Corollary 2.4 Let (X,,S) be a partially ordered S-metric space and f:X×XX be a map such that

  1. 1.

    X is complete;

  2. 2.

    f has the mixed monotone property on X; x 0 f( x 0 , y 0 ) and f( y 0 , x 0 ) y 0 for some x 0 , y 0 X;

  3. 3.

    There exists k[0,1) satisfying

    S ( f ( x , y ) , f ( x , y ) , f ( u , v ) ) k 2 ( S ( x , x , u ) + S ( y , y , v ) )
    (2.21)

for all x,y,u,vX with xu and yv;

  1. 4.

    f is continuous or X has the following property:

  2. (a)

    If { x n } is an increasing sequence with x n x, then x n x for all nN;

  3. (b)

    If { x n } is an decreasing sequence with x n x, then x x n for all nN.

Then f has a coupled fixed point in X.

Proof By choosing g=f and p=k, q=r=s=0 in Theorem 2.1 and using Remark 1.20, we get the conclusion. □

Corollary 2.5 Assume that X is a totally ordered set in addition to the hypotheses of Theorem 2.1; in particular, Corollary 2.3, Corollary 2.4. Then f and g have a unique coupled common fixed point (x,y) and x=y.

Proof By Theorem 2.1, f and g have a coupled common fixed point (x,y). Let (z,t) be another coupled common fixed point of f and g. Without loss of generality, we may assume that (x,y)(z,t). Then by (2.1) and Lemma 1.3, we have

Since p+2s<1, we have S(x,x,z)+S(y,y,t)=0. Then x=z and y=t. This proves that the coupled common fixed point of f and g is unique.

Moreover, by using (2.1) and Lemma 1.3 again, we get

S ( x , x , y ) = S ( f ( x , y ) , f ( x , y ) , g ( y , x ) ) p 2 D ( ( x , y ) , ( x , y ) , ( y , x ) ) + q 2 D ( ( x , y ) , ( x , y ) , ( f ( x , y ) , f ( y , x ) ) ) + r 2 D ( ( y , x ) , ( y , x ) , ( g ( y , x ) , g ( x , y ) ) ) + s 2 D ( ( x , y ) , ( x , y ) , ( g ( y , x ) , g ( x , y ) ) ) + s 2 D ( ( y , x ) , ( y , x ) , ( f ( x , y ) , f ( y , x ) ) ) = p 2 D ( ( x , y ) , ( x , y ) , ( y , x ) ) + s 2 D ( ( x , y ) , ( x , y ) , ( y , x ) ) + s 2 D ( ( y , x ) , ( y , x ) , ( x , y ) ) = p + 2 s 2 D ( ( x , y ) , ( x , y ) , ( y , x ) ) = ( p + 2 s ) S ( x , x , y ) .

Since p+2s<1, we get S(x,x,y)=0, that is, x=y. □

Finally, we give an example to demonstrate the validity of the above results.

Example 2.6 Let X=R with the S-metric as in Example 1.6 and the usual order ≤. Then X is a totally ordered, complete S-metric space. For all x,yX, put

f(x,y)=g(x,y)= 2 x y + 11 12 .

Then the pair (f,g) has the mixed weakly monotone property and

S ( f ( x , y ) , f ( x , y ) , g ( u , v ) ) = 2 | f ( x , y ) g ( u , v ) | = 2 | 2 x y + 11 12 2 u v + 11 12 | 1 6 | x u | + 1 12 | y v | 1 6 ( | x u | + | y v | ) .

Then the contraction (2.1) is satisfied with p= 1 6 and q=r=s=0. Note that other assumptions of Corollary 2.5 are also satisfied and (1,1) is the unique common fixed point of f and g.