Open Access

A generalized weak contraction principle with applications to coupled coincidence point problems

  • Binayak S Choudhury1,
  • Nikhilesh Metiya2 and
  • Mihai Postolache3Email author
Fixed Point Theory and Applications20132013:152

DOI: 10.1186/1687-1812-2013-152

Received: 12 March 2013

Accepted: 24 May 2013

Published: 11 June 2013

Abstract

In this paper we establish some coincidence point results for generalized weak contractions with discontinuous control functions. The theorems are proved in metric spaces with a partial order. Our theorems extend several existing results in the current literature. We also discuss several corollaries and give illustrative examples. We apply our result to obtain some coupled coincidence point results which effectively generalize a number of established results.

MSC:54H10, 54H25.

Keywords

partially ordered set control function coincidence point coupled coincidence point

1 Introduction

In this paper we prove certain coincidence point results in partially ordered metric spaces for functions which satisfy a certain inequality involving three control functions. Two of the control functions are discontinuous. Fixed point theory in partially ordered metric spaces is of relatively recent origin. An early result in this direction is due to Turinici [1], in which fixed point problems were studied in partially ordered uniform spaces. Later, this branch of fixed point theory has developed through a number of works, some of which are in [26].

Weak contraction was studied in partially ordered metric spaces by Harjani et al. [3]. In a recent result by Choudhury et al. [2], a generalization of the above result to a coincidence point theorem has been done using three control functions. Here we prove coincidence point results by assuming a weak contraction inequality with three control functions, two of which are not continuous. The results are obtained under two sets of additional conditions. A fixed point theorem is also established. There are several corollaries and two examples. One of the examples shows that the corollaries are properly contained in their respective theorem. The corollaries are generalizations of several existing works.

We apply our result to obtain some coupled coincidence point results. Coupled fixed theorems and coupled coincidence point theorems have appeared prominently in recent literature. Although the concept of coupled fixed points was introduced by Guo et al. [7], starting with the work of Gnana Bhaskar and Lakshmikantham [8], where they established a coupled contraction principle, this line of research has developed rapidly in partially ordered metric spaces. References [920] are some examples of these works. There is a viewpoint from which coupled fixed and coincidence point theorems can be considered as problems in product spaces [21]. We adopt this approach here. Specifically, we apply our theorem to a product of two metric spaces on which a metric is defined from the metric of the original spaces. We establish a generalization of several results. We also discuss an example which shows that our result is an actual improvement over the results it generalizes.

2 Mathematical preliminaries

Let ( X , ) be a partially ordered set and T : X X . The mapping T is said to be nondecreasing if for all x 1 , x 2 X , x 1 x 2 implies T x 1 T x 2 and nonincreasing if for all x 1 , x 2 X , x 1 x 2 implies T x 1 T x 2 .

Definition 2.1 ([22])

Let ( X , ) be a partially ordered set and T : X X and G : X X . The mapping T is said to be G-nondecreasing if for all x , y X , G x G y implies T x T y and G-nonincreasing if for all x , y X , G x G y implies T x T y .

Definition 2.2 Two self-mappings G and T of a nonempty set X are said to be commutative if G T x = T G x for all x X .

Definition 2.3 ([23])

Two self-mappings G and T of a metric space ( X , d ) are said to be compatible if the following relation holds:
lim n d ( G T x n , T G x n ) = 0 ,

whenever { x n } is a sequence in X such that lim n G x n = lim n T x n = x for some x X is satisfied.

Definition 2.4 ([24])

Two self-mappings G and T of a nonempty set X are said to be weakly compatible if they commute at their coincidence points; that is, if G x = T x for some x X , then G T x = T G x .

Definition 2.5 ([8])

Let ( X , ) be a partially ordered set and F : X × X X . The mapping F is said to have the mixed monotone property if F is monotone nondecreasing in its first argument and is monotone nonincreasing in its second argument; that is, if
x 1 , x 2 X , x 1 x 2 F ( x 1 , y ) F ( x 2 , y ) for all  y X ;
and
y 1 , y 2 X , y 1 y 2 F ( x , y 1 ) F ( x , y 2 ) for all  x X .

Definition 2.6 ([17])

Let ( X , ) be a partially ordered set, F : X × X X and g : X X . We say that F has the mixed g-monotone property if
x 1 , x 2 X , g x 1 g x 2 F ( x 1 , y ) F ( x 2 , y ) for all  y X ;
and
y 1 , y 2 X , g y 1 g y 2 F ( x , y 1 ) F ( x , y 2 ) for all  x X .

Definition 2.7 ([8])

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

Definition 2.8 ([17])

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

Definition 2.9 ([17])

Let X be a nonempty set. The mappings g and F, where g : X X and F : X × X X , are said to be commutative if g F ( x , y ) = F ( g x , g y ) for all x , y X .

Definition 2.10 ([12])

Let ( X , d ) be a metric space. The mappings g and F, where g : X X and F : X × X X , are said to be compatible if the following relations hold:
lim n d ( g F ( x n , y n ) , F ( g x n , g y n ) ) = 0 , lim n d ( g F ( y n , x n ) , F ( g y n , g x n ) ) = 0 ,

whenever { x n } and { y n } are sequences in X such that lim n g x n = lim n F ( x n , y n ) = x and lim n g y n = lim n F ( y n , x n ) = y for some x , y X are satisfied.

Definition 2.11 Let X be a nonempty set. The mappings g and F, where g : X X and F : X × X X , are said to be weakly compatible if they commute at their coupled coincidence points, that is, if F ( x , y ) = g x and F ( y , x ) = g y for some ( x , y ) X × X , then g F ( x , y ) = F ( g x , g y ) and g F ( y , x ) = F ( g y , g x ) .

Definition 2.12 ([25])

A function ψ : [ 0 , ) [ 0 , ) is called an altering distance function if the following properties are satisfied:
  1. (i)

    ψ is monotone increasing and continuous;

     
  2. (ii)

    ψ ( t ) = 0 if and only if t = 0 .

     

In our results in the following sections, we use the following classes of functions.

We denote by Ψ the set of all functions ψ : [ 0 , ) [ 0 , ) satisfying

(i ψ ) ψ is continuous and monotone non-decreasing,

(ii ψ ) ψ ( t ) = 0 if and only if t = 0 ;

and by Θ we denote the set of all functions α : [ 0 , ) [ 0 , ) such that

(i α ) α is bounded on any bounded interval in [ 0 , ) ,

(ii α ) α is continuous at 0 and α ( 0 ) = 0 .

3 Main results

Let ( X , , d ) be an ordered metric space. X is called regular if it has the following properties:
  1. (i)

    if a nondecreasing sequence { x n } x in ( X , d ) , then x n x for all n 0 ;

     
  2. (ii)

    if a nonincreasing sequence { y n } y in ( X , d ) , then y y n for all n 0 .

     
Theorem 3.1 Let ( X , ) be a partially ordered set and suppose that there is a metric d on X such that ( X , d ) is a complete metric space. Let T , G : X X be two mappings such that G is continuous and nondecreasing, T ( X ) G ( X ) , T is G-nondecreasing with respect to and the pair ( G , T ) is compatible. Suppose that there exist ψ Ψ and φ , θ Θ such that
ψ ( x ) φ ( y ) x y ,
(3.1)
for any sequence { x n } in [ 0 , ) with x n t > 0 ,
https://static-content.springer.com/image/art%3A10.1186%2F1687-1812-2013-152/MediaObjects/13663_2013_Article_474_Equ2_HTML.gif
(3.2)
and for all x , y X with G x G y
ψ ( d ( T x , T y ) ) φ ( d ( G x , G y ) ) θ ( d ( G x , G y ) ) .
(3.3)
Also, suppose that
  1. (a)

    T is continuous, or

     
  2. (b)

    X is regular.

     

If there exists x 0 X such that G x 0 T x 0 , then G and T have a coincidence point in X.

Proof Let x 0 X be such that G x 0 T x 0 . Since T ( X ) G ( X ) , we can choose x 1 X such that G x 1 = T x 0 . Again, we can choose x 2 X such that G x 2 = T x 1 . Continuing this process, we construct a sequence { x n } in X such that
G x n + 1 = T x n for all  n 0 .
(3.4)
Since G x 0 T x 0 and G x 1 = T x 0 , we have G x 0 G x 1 , which implies that T x 0 T x 1 . Now, T x 0 T x 1 , that is, G x 1 G x 2 implies that T x 1 T x 2 . Again, T x 1 T x 2 , that is, G x 2 G x 3 implies that T x 2 T x 3 . Continuing this process, we have
G x 0 G x 1 G x 2 G x 3 G x n G x n + 1 ,
(3.5)
and
T x 0 T x 1 T x 2 T x 3 T x n T x n + 1 .
(3.6)

Let R n = d ( G x n + 1 , G x n ) for all n 0 .

Since G x n + 1 G x n , from (3.3) and (3.4), we have
ψ ( d ( G x n + 2 , G x n + 1 ) ) = ψ ( d ( T x n + 1 , T x n ) ) φ ( d ( G x n + 1 , G x n ) ) θ ( d ( G x n + 1 , G x n ) ) ,
that is,
ψ ( R n + 1 ) φ ( R n ) θ ( R n ) ,
(3.7)
which, in view of the fact that θ 0 , yields ψ ( R n + 1 ) φ ( R n ) , which by (3.1) implies that R n + 1 R n for all positive integer n, that is, { R n } is a monotone decreasing sequence. Hence there exists an r 0 such that
R n = d ( G x n + 1 , G x n ) r as  n .
(3.8)
Taking limit supremum on both sides of (3.7), using (3.8), the property (i α ) of φ and θ, and the continuity of ψ, we obtain
https://static-content.springer.com/image/art%3A10.1186%2F1687-1812-2013-152/MediaObjects/13663_2013_Article_474_Equh_HTML.gif
Since https://static-content.springer.com/image/art%3A10.1186%2F1687-1812-2013-152/MediaObjects/13663_2013_Article_474_IEq78_HTML.gif , it follows that
https://static-content.springer.com/image/art%3A10.1186%2F1687-1812-2013-152/MediaObjects/13663_2013_Article_474_Equi_HTML.gif
that is,
https://static-content.springer.com/image/art%3A10.1186%2F1687-1812-2013-152/MediaObjects/13663_2013_Article_474_Equj_HTML.gif
which by (3.2) is a contradiction unless r = 0 . Therefore,
R n = d ( G x n + 1 , G x n ) 0 as  n .
(3.9)

Next we show that { G x n } is a Cauchy sequence.

Suppose that { G x n } is not a Cauchy sequence. Then there exists an ϵ > 0 for which we can find two sequences of positive integers { m ( k ) } and { n ( k ) } such that for all positive integers k, n ( k ) > m ( k ) > k and d ( G x m ( k ) , G x n ( k ) ) ϵ . Assuming that n ( k ) is the smallest such positive integer, we get
n ( k ) > m ( k ) > k , d ( G x m ( k ) , G x n ( k ) ) ϵ and d ( G x m ( k ) , G x n ( k ) 1 ) < ϵ .
Now,
ϵ d ( G x m ( k ) , G x n ( k ) ) d ( G x m ( k ) , G x n ( k ) 1 ) + d ( G x n ( k ) 1 , G x n ( k ) ) ,
that is,
ϵ d ( G x m ( k ) , G x n ( k ) ) ϵ + d ( G x n ( k ) 1 , G x n ( k ) ) .
Letting k in the above inequality and using (3.9), we have
lim k d ( G x m ( k ) , G x n ( k ) ) = ϵ .
(3.10)
Again,
d ( G x m ( k ) + 1 , G x n ( k ) + 1 ) d ( G x m ( k ) + 1 , G x m ( k ) ) + d ( G x m ( k ) , G x n ( k ) ) + d ( G x n ( k ) + 1 , G x n ( k ) )
and
d ( G x m ( k ) , G x n ( k ) ) d ( G x m ( k ) + 1 , G x m ( k ) ) + d ( G x m ( k ) + 1 , G x n ( k ) + 1 ) + d ( G x n ( k ) + 1 , G x n ( k ) ) .
Letting k in the above inequalities, using (3.9) and (3.10), we have
lim k d ( G x m ( k ) + 1 , G x n ( k ) + 1 ) = ϵ .
(3.11)
As n ( k ) > m ( k ) , G x n ( k ) G x m ( k ) , from (3.3) and (3.4), we have
ψ ( d ( G x n ( k ) + 1 , G x m ( k ) + 1 ) ) = ψ ( d ( T x n ( k ) , T x m ( k ) ) ) φ ( d ( G x n ( k ) , G x m ( k ) ) ) θ ( d ( G x n ( k ) , G x m ( k ) ) ) .
Taking limit supremum on both sides of the above inequality, using (3.10), (3.11), the property (i α ) of φ and θ, and the continuity of ψ, we obtain
https://static-content.springer.com/image/art%3A10.1186%2F1687-1812-2013-152/MediaObjects/13663_2013_Article_474_Equq_HTML.gif
Since https://static-content.springer.com/image/art%3A10.1186%2F1687-1812-2013-152/MediaObjects/13663_2013_Article_474_IEq90_HTML.gif , it follows that
https://static-content.springer.com/image/art%3A10.1186%2F1687-1812-2013-152/MediaObjects/13663_2013_Article_474_Equr_HTML.gif
that is,
https://static-content.springer.com/image/art%3A10.1186%2F1687-1812-2013-152/MediaObjects/13663_2013_Article_474_Equs_HTML.gif
which is a contradiction by (3.2). Therefore, { G x n } is a Cauchy sequence in X. From the completeness of X, there exists x X such that
lim n T x n = lim n G x n = x .
(3.12)
Since the pair ( G , T ) is compatible, from (3.12), we have
lim n d ( G T x n , T G x n ) = 0 .
(3.13)

Let the condition (a) hold.

By the triangular inequality, we have
d ( G x , T G x n ) d ( G x , G T x n ) + d ( G T x n , T G x n ) .

Taking n in the above inequality, using (3.12), (3.13) and the continuities of T and G, we have d ( G x , T x ) = 0 , that is, G x = T x , that is, x is a coincidence point of the mappings G and T.

Next we suppose that the condition (b) holds.

By (3.5) and (3.12), we have G x n x for all n 0 . Using the monotone property of G, we obtain
G G x n G x .
(3.14)
As G is continuous and the pair ( G , T ) is compatible, by (3.12) and (3.13), we have
lim n G G x n = G x = lim n G T x n = lim n T G x n .
(3.15)
Then
d ( T x , G x ) = lim n d ( T x , T G x n ) .
Since ψ is continuous, from the above inequality, we obtain
ψ ( d ( T x , G x ) ) = ψ ( lim n d ( T x , T G x n ) ) = lim n ψ ( d ( T x , T G x n ) ) ,
which, by (3.3) and (3.14), implies that
ψ ( d ( T x , G x ) ) lim n [ φ ( d ( G x , G G x n ) ) θ ( d ( G x , G G x n ) ) ] .
Using (3.15) and the property (ii α ) of φ and θ, we have
ψ ( d ( T x , G x ) ) = 0 ,

which, by the property of ψ, implies that d ( T x , G x ) = 0 , that is, G x = T x , that is, x is a coincidence point of the mappings G and T. □

Next we discuss some corollaries of Theorem 3.1. By an example, we show that Theorem 3.1 properly contains all its corollaries.

Every commuting pair ( G , T ) is also a compatible pair. Then considering ( G , T ) to be the commuting pair in Theorem 3.1, we have the following corollary.

Corollary 3.1 Let ( X , ) be a partially ordered set and suppose that there is a metric d on X such that ( X , d ) is a complete metric space. Let T , G : X X be two mappings such that G is continuous and nondecreasing, T ( X ) G ( X ) , T is G-nondecreasing with respect to and the pair ( G , T ) is commutative. Suppose that there exist ψ Ψ and φ , θ Θ such that (3.1), (3.2) and (3.3) are satisfied. Also, suppose that
  1. (a)

    T is continuous, or

     
  2. (b)

    X is regular.

     

If there exists x 0 X such that G x 0 T x 0 , then G and T have a coincidence point in X.

Considering ψ to be the identity mapping and θ ( t ) = 0 for all t [ 0 , ) in Theorem 3.1, we have the following corollary.

Corollary 3.2 Let ( X , ) be a partially ordered set and suppose that there is a metric d on X such that ( X , d ) is a complete metric space. Let T , G : X X be two mappings such that G is continuous and nondecreasing, T ( X ) G ( X ) , T is G-nondecreasing with respect to and the pair ( G , T ) is compatible. Suppose that there exists φ Θ such that for any sequence { x n } in [ 0 , ) with x n t > 0 ,
https://static-content.springer.com/image/art%3A10.1186%2F1687-1812-2013-152/MediaObjects/13663_2013_Article_474_Equ16_HTML.gif
(3.16)
and for all x , y X with G x G y ,
d ( T x , T y ) φ ( d ( G x , G y ) ) .
(3.17)
Also, suppose that
  1. (a)

    T is continuous, or

     
  2. (b)

    X is regular.

     

If there exists x 0 X such that G x 0 T x 0 , then G and T have a coincidence point in X.

Considering θ ( t ) = 0 for all t [ 0 , ) and φ ( t ) = k ψ ( t ) with k [ 0 , 1 ) in Theorem 3.1, we have the following corollary.

Corollary 3.3 Let ( X , ) be a partially ordered set and suppose that there is a metric d on X such that ( X , d ) is a complete metric space. Let T , G : X X be two mappings such that G is continuous and nondecreasing, T ( X ) G ( X ) , T is G-nondecreasing with respect to and the pair ( G , T ) is compatible. Suppose that there exists ψ Ψ and k [ 0 , 1 ) such that for all x , y X with G x G y ,
ψ ( d ( T x , T y ) ) k ψ ( d ( G x , G y ) ) .
(3.18)
Also, suppose that
  1. (a)

    T is continuous, or

     
  2. (b)

    X is regular.

     

If there exists x 0 X such that G x 0 T x 0 , then G and T have a coincidence point in X.

Considering φ to be the function ψ in Theorem 3.1, we have the following corollary.

Corollary 3.4 Let ( X , ) be a partially ordered set and suppose that there is a metric d on X such that ( X , d ) is a complete metric space. Let T , G : X X be two mappings such that G is continuous and nondecreasing, T ( X ) G ( X ) , T is G-nondecreasing with respect to and the pair ( G , T ) is compatible. Suppose that there exist ψ Ψ and θ Θ such that for any sequence { x n } in [ 0 , ) with x n t > 0 ,
https://static-content.springer.com/image/art%3A10.1186%2F1687-1812-2013-152/MediaObjects/13663_2013_Article_474_Equ19_HTML.gif
(3.19)
and for all x , y X with G x G y ,
ψ ( d ( T x , T y ) ) ψ ( d ( G x , G y ) ) θ ( d ( G x , G y ) ) .
(3.20)
Also, suppose that
  1. (a)

    T is continuous or

     
  2. (b)

    X is regular.

     

If there exists x 0 X such that G x 0 T x 0 , then G and T have a coincidence point in X.

If ψ and φ are the identity mappings in Theorem 3.1, we have the following corollary.

Corollary 3.5 Let ( X , ) be a partially ordered set and suppose that there is a metric d on X such that ( X , d ) is a complete metric space. Let T , G : X X be two mappings such that G is continuous and nondecreasing, T ( X ) G ( X ) , T is G-nondecreasing with respect to and the pair ( G , T ) is compatible. Suppose that there exists θ Θ such that for any sequence { x n } in [ 0 , ) with x n t > 0 , https://static-content.springer.com/image/art%3A10.1186%2F1687-1812-2013-152/MediaObjects/13663_2013_Article_474_IEq106_HTML.gif and for all x , y X with G x G y ,
d ( T x , T y ) d ( G x , G y ) θ ( d ( G x , G y ) ) .
(3.21)
Also, suppose that
  1. (a)

    T is continuous, or

     
  2. (b)

    X is regular.

     

If there exists x 0 X such that G x 0 T x 0 , then G and T have a coincidence point in X.

Considering ψ and φ to be the identity mappings and θ ( t ) = ( 1 k ) t , where 0 k < 1 in Theorem 3.1, we have the following corollary.

Corollary 3.6 Let ( X , ) be a partially ordered set and suppose that there is a metric d on X such that ( X , d ) is a complete metric space. Let T , G : X X be two mappings such that G is continuous and nondecreasing, T ( X ) G ( X ) , T is G-nondecreasing with respect to and the pair ( G , T ) is compatible. Assume that there exists k [ 0 , 1 ) such that for all x , y X with G x G y ,
d ( T x , T y ) k d ( G x , G y ) .
(3.22)
Also, suppose that
  1. (a)

    T is continuous, or

     
  2. (b)

    X is regular.

     

If there exists x 0 X such that G x 0 T x 0 , then G and T have a coincidence point in X.

The condition (i), the continuity and the monotone property of the function G, and (ii), the compatibility condition of the pairs ( G , T ) , which were considered in Theorem 3.1, are relaxed in our next theorem by taking G ( X ) to be closed in ( X , d ) .

Theorem 3.2 Let ( X , ) be a partially ordered set and suppose that there is a metric d on X such that ( X , d ) is a complete metric space. Let T , G : X X be two mappings such that T ( X ) G ( X ) and T is G-nondecreasing with respect to and G ( X ) is closed in X. Suppose that there exist ψ Ψ and φ , θ Θ such that (3.1), (3.2) and (3.3) are satisfied. Also, suppose that X is regular.

If there exists x 0 X such that G x 0 T x 0 , then G and T have a coincidence point in X.

Proof We take the same sequence { x n } as in the proof of Theorem 3.1. Then we have (3.12), that is,
lim n T x n = lim n G x n = x .
Since { G x n } is a sequence in G ( X ) and G ( X ) is closed in X, x G ( X ) . As x G ( X ) , there exists z X such that x = G z . Then
lim n T x n = lim n G x n = G z .
(3.23)
Now, { G x n } is nondecreasing and converges to Gz. So, by the order condition of the metric space X, we have
G x n G z .
(3.24)
Putting x = z and y = x n in (3.3), by the virtue of (3.24), we get
ψ ( d ( T z , T x n ) ) φ ( d ( G z , G x n ) ) θ ( d ( G z , G x n ) ) .
Taking n in the above inequality, using (3.23), the property (ii α ) of φ and θ and the continuity of ψ, we have
ψ ( d ( T z , G z ) ) = 0 ,

which, by the property of ψ, implies that d ( T z , G z ) = 0 , that is, T z = G z , that is, z is a coincidence point of the mappings G and T. □

In the following, our aim is to prove the existence and uniqueness of the common fixed point in Theorems 3.1 and 3.2.

Theorem 3.3 In addition to the hypotheses of Theorems  3.1 and 3.2, in both of the theorems, suppose that for every x , y X there exists u X such that Tu is comparable to Tx and Ty, and also the pair ( G , T ) is weakly compatible. Then G and T have a unique common fixed point.

Proof From Theorem 3.1 or Theorem 3.2, the set of coincidence points of G and T is non-empty. Suppose x and y are coincidence points of G and T, that is, G x = T x and G y = T y . Now, we show
G x = G y .
(3.25)

By the assumption, there exists u X such that Tu is comparable with Tx and Ty.

Put u 0 = u and choose u 1 X so that G u 1 = T u 0 . Then, similarly to the proof of Theorem 3.1, we can inductively define sequences { G u n } where G u n + 1 = T u n for all n 0 . Hence T x = G x and T u = T u 0 = G u 1 are comparable.

Suppose that G u 1 G x (the proof is similar to that in the other case).

We claim that G u n G x for each n N .

In fact, we will use mathematical induction. Since G u 1 G x , our claim is true for n = 1 . We presume that G u n G x holds for some n > 1 . Since T is G-nondecreasing with respect to , we get
G u n + 1 = T u n T x = G x ;

and this proves our claim.

Let R n = d ( G x , G u n ) . Since G u n G x , using the contractive condition (3.3), for all n 1 , we have
ψ ( d ( G x , G u n + 1 ) ) = ψ ( d ( T x , T u n ) ) φ ( d ( G x , G u n ) ) θ ( d ( G x , G u n ) ) ,

that is, ψ ( R n + 1 ) φ ( R n ) θ ( R n ) , which, in view of the fact that θ 0 , yields ψ ( R n + 1 ) φ ( R n ) , which by (3.1) implies that R n + 1 R n for all positive integer n, that is, { R n } is a monotone decreasing sequence.

Then, as in the proof of Theorem 3.1, we have
lim n R n = lim n d ( G x , G u n ) = 0 .
(3.26)
Similarly, we show that
lim n d ( G y , G u n ) = 0 .
(3.27)
By the triangle inequality, using (3.26) and (3.27), we have
d ( G x , G y ) [ d ( G x , G u n ) + d ( G u n , G y ) ] 0 as  n .

Hence G x = G y . Thus (3.25) is proved.

Since G x = T x , by weak compatibility of G and T, we have
G G x = G T x = T G x .
(3.28)
Denote
G x = z .
(3.29)
Then from (3.28) we have
G z = T z .
Thus z is a coincidence point of G and T. Then from (3.25) with y = z it follows that
G x = G z .
By (3.29) it follows that
z = G z .
(3.30)

From (3.29) and (3.30), we get z = G z = T z .

Therefore, z is a common fixed point of G and T.

To prove the uniqueness, assume that r is another common fixed point of G and T. Then by (3.25) we have r = G r = G z = z . Hence the common fixed point of G and T is unique. □

Example 3.1 Let X = [ 0 , ) . Then ( X , ) is a partially ordered set with the natural ordering of real numbers. Let d ( x , y ) = | x y | for x , y X . Then ( X , d ) is a complete metric space.

Let T , G : X X be given respectively by the formulas T x = 1 3 x 2 and G x = x 2 for all x X . Then T and G satisfy all the properties mentioned in Theorem 3.1.

Let ψ , φ , θ : [ 0 , ) [ 0 , ) be given respectively by the formulas
ψ ( t ) = t 2 , φ ( t ) = { 1 2 [ t ] 2 if  3 < t < 4 , 4 9 t 2 otherwise , θ ( t ) = { 1 9 [ t ] 2 if  3 < t < 4 , 0 otherwise .

Then ψ, φ and θ have the properties mentioned in Theorem 3.1.

It can be verified that (3.3) is satisfied for all x , y X with G x G y . Hence the required conditions of Theorem 3.1 are satisfied and it is seen that 0 is a coincidence point of G and T. Also, the conditions of Theorem 3.3 are satisfied and it is seen that 0 is the unique common fixed point of G and T.

Remark 3.1 In the above example, the pair ( G , T ) is compatible but not commuting so that Corollary 3.1 is not applicable to this example and hence Theorem 3.1 properly contains its Corollary 3.1.

Remark 3.2 In the above example, ψ is not the identity mapping and θ ( t ) 0 for all t in [ 0 , ) . Let us consider the sequence { x n } in [ 0 , ) , where x n = 3 for all n. Then φ ( x n ) = 4 for all n. Now x n t = 3 > 0 , but https://static-content.springer.com/image/art%3A10.1186%2F1687-1812-2013-152/MediaObjects/13663_2013_Article_474_IEq155_HTML.gif . Therefore, Corollary 3.2 is not applicable to this example, and hence Theorem 3.1 properly contains its Corollary 3.2.

Remark 3.3 The above example θ ( t ) 0 for all t [ 0 , ) , and hence Corollary 3.3 is not applicable to the example, and so Theorem 3.1 properly contains its Corollary 3.3.

Remark 3.4 In the above example, φ is not identical to the function ψ, and also https://static-content.springer.com/image/art%3A10.1186%2F1687-1812-2013-152/MediaObjects/13663_2013_Article_474_IEq157_HTML.gif for any sequence { x n } in [ 0 , ) with x n t > 0 . Therefore, Corollaries 3.4 and 3.5 are not applicable to this example, and hence Theorem 3.1 properly contains its Corollaries 3.4 and 3.5.

Remark 3.5 In the above example, ψ and φ are not the identity functions and θ ( t ) ( 1 k ) t with 0 k < 1 . Therefore, Corollary 3.6 is not applicable to the above example. Hence Theorem 3.1 properly contains its Corollary 3.6.

Remark 3.6 Theorem 3.1 generalizes the results in [24, 6, 2529].

Example 3.2 Let X = [ 0 , 1 ] . Then ( X , ) is a partially ordered set with the natural ordering of real numbers. Let d ( x , y ) = | x y | for x , y X . Then ( X , d ) is a metric space with the required properties of Theorem 3.2.

Let T , G : X X be given respectively by the formulas
T x = 1 for all  x X , G x = { 1 if  x  is rational , 1 2 if  x  is irrational .

Then T and G have the properties mentioned in Theorem 3.2.

Let ψ , φ , θ : [ 0 , ) [ 0 , ) be given respectively by the formulas
ψ ( t ) = t 2 , φ ( t ) = { 1 2 [ t ] 2 if  3 < t < 4 , 4 9 t 2 otherwise , θ ( t ) = { 1 9 [ t ] 2 if  3 < t < 4 , 0 otherwise .

Then ψ, φ and θ have the properties mentioned in Theorem 3.2.

All the required conditions of Theorem 3.2 are satisfied. It is seen that every rational number x X is a coincidence point of G and T. Also, the conditions of Theorem 3.3 are satisfied and it is seen that 1 is the unique common fixed point of G and T.

Remark 3.7 In the above example, the function g is not continuous. Therefore, Theorem 3.1 is not applicable to the above example.

4 Applications to coupled coincidence point results

In this section, we use the results of the previous section to establish new coupled coincidence point results in partially ordered metric spaces. Our results are extensions of some existing results.

Let ( X , ) be a partially ordered set. Now, we endow the product space X × X with the following partial order:
for  ( x , y ) , ( u , v ) X × X , ( u , v ) ( x , y ) x u , y v .
Let ( X , d ) be a metric space. Then d 1 given by the law
d 1 ( ( x , y ) , ( u , v ) ) = d ( x , u ) + d ( y , v ) for  ( x , y ) , ( u , v ) X × X

is a metric on X × X .

Let g : X X and F : X × X X be two mappings. Then we define two functions G : X × X X × X and T : X × X X × X respectively as follows:
G ( x , y ) = ( g x , g y ) for  x , y X , T ( x , y ) = ( F ( x , y ) , F ( y , x ) ) for  x , y X .

Lemma 4.1 Let ( X , ) be a partially ordered set, F : X × X X and g : X X . If F has the mixed g-monotone property, then T is G-nondecreasing.

Proof Let ( x 1 , y 1 ) , ( x 2 , y 2 ) X × X such that G ( x 1 , y 1 ) G ( x 2 , y 2 ) . Then, by the definition of G, it follows that ( g x 1 , g y 1 ) ( g x 2 , g y 2 ) , that is, g x 1 g x 2 and g y 1 g y 2 . Since F has the mixed g-monotone property, we have
F ( x 1 , y 1 ) F ( x 2 , y 1 ) F ( x 2 , y 2 ) ,
and
F ( y 1 , x 1 ) F ( y 2 , x 1 ) F ( y 2 , x 2 ) .

It follows that ( F ( x 1 , y 1 ) , F ( y 1 , x 1 ) ) ( F ( x 2 , y 2 ) , F ( y 2 , x 2 ) ) , that is, T ( x 1 , y 1 ) T ( x 2 , y 2 ) . Therefore, T is G-nondecreasing. □

Lemma 4.2 Let X be a nonempty set, g : X X and F : X × X X . If g and F are commutative, then the mappings G and T are also commutative.

Proof Let ( x , y ) X × X . Since g and F are commutative, by the definition of G and T, we have
G T ( x , y ) = G ( F ( x , y ) , F ( y , x ) ) = ( g F ( x , y ) , g F ( y , x ) ) = ( F ( g x , g y ) , F ( g y , g x ) ) = T ( g x , g y ) = T G ( x , y ) ,

which shows that G and T are commutative. □

Lemma 4.3 Let ( X , d ) be metric space and g : X X , F : X × X X . If g and F are compatible, then the mappings G and T are also compatible.

Proof Let { ( x n , y n ) } be a sequence in X × X such that lim n G ( x n , y n ) = lim n T ( x n , y n ) = ( x , y ) for some ( x , y ) X × X . By the definition of G and T, we have lim n ( g x n , g y n ) = lim n ( F ( x n , y n ) , F ( y n , y n ) ) = ( x , y ) , which implies that
lim n F ( x n , y n ) = lim n g x n = x , lim n F ( y n , x n ) = lim n g y n = y .
Now
d 1 ( G T ( x n , y n ) , T G ( x n , y n ) ) = d 1 ( G ( F ( x n , y n ) , F ( y n , x n ) ) , T ( g x n , g y n ) ) = d 1 ( ( g F ( x n , y n ) , g F ( y n , x n ) ) , ( F ( g x n , g y n ) , F ( g y n , g x n ) ) ) = d ( g F ( x n , y n ) , F ( g x n , g y n ) ) + d ( g F ( y n , x n ) , F ( g y n , g x n ) ) .
Since g and F are compatible, we have
lim n d 1 ( G T ( x n , y n ) , T G ( x n , y n ) ) = 0 .

It follows that G and T are compatible. □

Lemma 4.4 Let X be a nonempty set, g : X X and F : X × X X . If g and F are weak compatible, then the mappings G and T are also weak compatible.

Proof Let ( x , y ) X × X be a coincidence point G and T. Then G ( x , y ) = T ( x , y ) , that is, ( g x , g y ) = ( F ( x , y ) , F ( y , x ) ) , that is, g x = F ( x , y ) and g y = F ( y , x ) . Since g and F are weak compatible, by the definition of G and T, we have
G T ( x , y ) = G ( F ( x , y ) , F ( y , x ) ) = ( g F ( x , y ) , g F ( y , x ) ) = ( F ( g x , g y ) , F ( g y , g x ) ) = T ( g x , g y ) = T G ( x , y ) ,

which shows that G and T commute at their coincidence point, that is, G and T are weak compatible. □

Theorem 4.1 Let ( X , ) be a partially ordered set and suppose that there is a metric d on X such that ( X , d ) is a complete metric space. Let F : X × X X and g : X X be two mappings such that g is continuous and nondecreasing, F ( X × X ) g ( X ) , F has the mixed g-monotone property on X and the pair ( g , F ) is compatible. Suppose that there exist ψ Ψ and φ , θ Θ such that (3.1) and (3.2) are satisfied and for all x , y , u , v X with g x g u and g y g v ,
ψ ( d ( F ( x , y ) , F ( u , v ) ) + d ( F ( y , x ) , F ( v , u ) ) ) φ ( d ( g x , g u ) + d ( g y , g v ) ) θ ( d ( g x , g u ) + d ( g y , g v ) ) .
(4.1)
Also, suppose that
  1. (a)

    F is continuous, or

     
  2. (b)

    X is regular.

     

If there exist x 0 , y 0 X such that g x 0 F ( x 0 , y 0 ) and g y 0 F ( y 0 , x 0 ) , then there exist x , y X such that g x = F ( x , y ) and g y = F ( y , x ) ; that is, g and F have a coupled coincidence point in X.

Proof We consider the product space ( X × X , ) , the metric d 1 on X × X and the functions G : X × X X × X and T : X × X X × X as mentioned above. Denote S = X × X . Then ( S , d 1 ) is a complete metric space. By the definition of G and T, we have that
  1. (i)

    G is continuous and nondecreasing; and T is continuous,

     
  2. (ii)

    T ( S ) G ( S ) ,

     
  3. (iii)

    T is G-nondecreasing with respect to ,

     
  4. (iv)

    the pair ( G , T ) is compatible.

     
Let p = ( x , y ) , q = ( u , v ) S = X × X such that g x g u and g y g v , that is, ( g x , g y ) ( g u , g v ) , that is, G p G q . Then (4.1) reduces to
ψ ( d 1 ( T p , T q ) ) φ ( d 1 ( G p , G q ) ) θ ( d 1 ( G p , G q ) ) .

Now, the existence of x 0 , y 0 X such that g x 0 F ( x 0 , y 0 ) and g y 0 F ( y 0 , x 0 ) implies the existence of a point p 0 = ( x 0 , y 0 ) S such that ( g x 0 , g y 0 ) ( F ( x 0 , y 0 ) , F ( y 0 , x 0 ) ) , that is, G p 0 T p 0 . Therefore, the theorem reduces to Theorem 3.1, and hence there exists w = ( x , y ) S = X × X such that G w = T w , that is, G ( x , y ) = T ( x , y ) , that is, ( g x , g y ) = ( F ( x , y ) , F ( y , x ) ) , that is, g x = F ( x , y ) and g y = F ( y , x ) , that is, ( x , y ) is a coupled coincidence point of g and F. □

The following corollary is a consequence of Corollary 3.1.

Corollary 4.1 Let ( X , ) be a partially ordered set and suppose that there is a metric d on X such that ( X , d ) is a complete metric space. Let F : X × X X and g : X X be two mappings such that g is continuous and nondecreasing, F ( X × X ) g ( X ) , F has the mixed g-monotone property on X and the pair ( g , F ) is commutative. Suppose that there exist ψ Ψ , φ , θ Θ such that (3.1), (3.2) and (4.1) are satisfied. Also, suppose that
  1. (a)

    F is continuous, or

     
  2. (b)

    X is regular.

     

If there exist x 0 , y 0 X such that g x 0 F ( x 0 , y 0 ) and g y 0 F ( y 0 , x 0 ) , then there exist x , y X such that g x = F ( x , y ) and g y = F ( y , x ) ; that is, g and F have a coupled coincidence point in X.

The following corollary is a consequence of Corollary 3.2.

Corollary 4.2 Let ( X , ) be a partially ordered set and suppose that there is a metric d on X such that ( X , d ) is a complete metric space. Let F : X × X X and g : X X be two mappings such that g is continuous and nondecreasing, F ( X × X ) g ( X ) , F has the mixed g-monotone property on X and the pair ( g , F ) is compatible. Suppose that there exists φ Θ such that for any sequence { x n } in [ 0 , ) with x n t > 0 ,
https://static-content.springer.com/image/art%3A10.1186%2F1687-1812-2013-152/MediaObjects/13663_2013_Article_474_Equau_HTML.gif
and for all x , y , u , v X with g x g u and g y g v ,
d ( F ( x , y ) , F ( u , v ) ) + d ( F ( y , x ) , F ( v , u ) ) φ ( d ( g x , g u ) + d ( g y , g v ) ) .
Also, suppose that
  1. (a)

    F is continuous, or

     
  2. (b)

    X is regular.

     

If there exist x 0 , y 0 X such that g x 0 F ( x 0 , y 0 ) and g y 0 F ( y 0 , x 0 ) , then there exist x , y X such that g x = F ( x , y ) and g y = F ( y , x ) ; that is, g and F have a coupled coincidence point in X.

The following corollary is a consequence of Corollary 3.3.

Corollary 4.3 Let ( X , ) be a partially ordered set and suppose that there is a metric d on X such that ( X , d ) is a complete metric space. Let F : X × X X and g : X X be two mappings such that g is continuous and nondecreasing, F ( X × X ) g ( X ) , F has the mixed g-monotone property on X and the pair ( g , F ) is compatible. Suppose that there exist ψ Ψ and k [ 0 , 1 ) such that for all x , y , u , v X with g x g u and g y g v ,
ψ ( d ( F ( x , y ) , F ( u , v ) ) + d ( F ( y , x ) , F ( v , u ) ) ) k ψ ( d ( g x , g u ) + d ( g y , g v ) ) .
Also, suppose that
  1. (a)

    F is continuous, or

     
  2. (b)

    X is regular.

     

If there exist x 0 , y 0 X such that g x 0 F ( x 0 , y 0 ) and g y 0 F ( y 0 , x 0 ) , then there exist x , y X such that g x = F ( x , y ) and g y = F ( y , x ) ; that is, g and F have a coupled coincidence point in X.

The following corollary is a consequence of Corollary 3.4.

Corollary 4.4 Let ( X , ) be a partially ordered set and suppose that there is a metric d on X such that ( X , d ) is a complete metric space. Let F : X × X X and g : X X be two mappings such that g is continuous and nondecreasing, F ( X × X ) g ( X ) , F has the mixed g-monotone property on X and the pair ( g , F ) is compatible. Suppose that there exist ψ Ψ and θ Θ such that for any sequence { x n } in [ 0 , ) with x n t > 0 , https://static-content.springer.com/image/art%3A10.1186%2F1687-1812-2013-152/MediaObjects/13663_2013_Article_474_IEq214_HTML.gif and for all x , y , u , v X with g x g u and g y g v ,
ψ ( d ( F ( x , y ) , F ( u , v ) ) + d ( F ( y , x ) , F ( v , u ) ) ) ψ ( d ( g x , g u ) + d ( g y , g v ) ) θ ( d ( g x , g u ) + d ( g y , g v ) ) .
(4.2)
Also, suppose that
  1. (a)

    F is continuous, or

     
  2. (b)

    X is regular.

     

If there exist x 0 , y 0 X such that g x 0 F ( x 0 , y 0 ) and g y 0 F ( y 0 , x 0 ) , then there exist x , y X such that g x = F ( x , y ) and g y = F ( y , x ) ; that is, g and F have a coupled coincidence point in X.

Remark 4.1 The above result is also true if the arguments of ψ and θ in (4.2) are replaced by their half values, that is, when (4.2) is replaced by
ψ ( d ( F ( x , y ) , F ( u , v ) ) + d ( F ( y , x ) , F ( v , u ) ) 2 ) ψ ( d ( g x , g u ) + d ( g y , g v ) 2 ) θ ( d ( g x , g u ) + d ( g y , g v ) 2 ) .

In this case, we can write ψ 1 ( t ) = ψ ( t 2 ) and θ 1 ( t ) = θ ( t 2 ) and proceed with the same proof by replacing ψ, θ by ψ 1 , θ 1 respectively. Then we obtain a generalization of Theorem 2 of Berinde in [10].

The following corollary is a consequence of Corollary 3.5.

Corollary 4.5 Let ( X , ) be a partially ordered set and suppose that there is a metric d on X such that ( X , d ) is a complete metric space. Let F : X × X X and g : X X be two mappings such that g is continuous and nondecreasing, F ( X × X ) g ( X ) , F has the mixed g-monotone property on X and the pair ( g , F ) is compatible. Suppose that there exists θ Θ such that for any sequence { x n } in [ 0 , ) with x n t > 0 , https://static-content.springer.com/image/art%3A10.1186%2F1687-1812-2013-152/MediaObjects/13663_2013_Article_474_IEq106_HTML.gif and for all x , y , u , v X with g x g u and g y g v ,
d ( F ( x , y ) , F ( u , v ) ) + d ( F ( y , x ) , F ( v , u ) ) d ( g x , g u ) + d ( g y , g v ) θ ( d ( g x , g u ) + d ( g y , g v ) ) .
Also, suppose that
  1. (a)

    F is continuous, or

     
  2. (b)

    X is regular.

     

If there exist x 0 , y 0 X such that g x 0 F ( x 0 , y 0 ) and g y 0 F ( y 0 , x 0 ) , then there exist x , y X such that g x = F ( x , y ) and g y = F ( y , x ) ; that is, g and F have a coupled coincidence point in X.

The following corollary is a consequence of Corollary 3.6.

Corollary 4.6 Let ( X , ) be a partially ordered set and suppose that there is a metric d on X such that ( X , d ) is a complete metric space. Let F : X × X X and g : X X be two mappings such that g is continuous and nondecreasing, F ( X × X ) g ( X ) , F has the mixed g-monotone property on X and the pair ( g , F ) is compatible. Assume that there exists k [ 0 , 1 ) such that for all x , y , u , v X with g x g u , g y g v ,
d ( F ( x , y ) , F ( u , v ) ) + d ( F ( y , x ) , F ( v , u ) ) k [ d ( g x , g u ) + d ( g y , g v ) ] .
Also, suppose that
  1. (a)

    F is continuous, or

     
  2. (b)

    X is regular.

     

If there exist x 0 , y 0 X such that g x 0 F ( x 0 , y 0 ) and g y 0 F ( y 0 , x 0 ) , then there exist x , y X such that g x = F ( x , y ) and g y = F ( y , x ) ; that is, g and F have a coupled coincidence point in X.

The following theorem is a consequence of Theorem 3.2.

Theorem 4.2 Let ( X , ) be a partially ordered set and suppose that there is a metric d on X such that ( X , d ) is a complete metric space. Consider the mappings F : X × X X and g : X X such that F ( X × X ) g ( X ) , F has the mixed g-monotone property on X and G ( X ) is closed in X. Suppose that there exist ψ Ψ and φ , θ Θ such that (3.1), (3.2) and (4.1) are satisfied. Also, suppose that X is regular.

If there exist x 0 , y 0 X such that g x 0 F ( x 0 , y 0 ) and g y 0 F ( y 0 , x 0 ) , then there exist x , y X such that g x = F ( x , y ) and g y = F ( y , x ) ; that is, g and F have a coupled coincidence point in X.

The following theorem is a consequence of Theorem 3.3.

Theorem 4.3 In addition to the hypotheses of Theorems  4.1 and 4.2, in both of the theorems, suppose that for every ( x , y ) , ( x , y ) X × X , there exists a ( u , v ) X × X such that ( F ( u , v ) , F ( v , u ) ) is comparable to ( F ( x , y ) , F ( y , x ) ) and ( F ( x , y ) , F ( y , x ) ) , and also the pair ( g , F ) is weakly compatible. Then g and F have a unique coupled common fixed point; that is, there exists a unique ( x , y ) X × X such that x = g x = F ( x , y ) and y = g y = F ( y , x ) .

Example 4.1 Let X = [ 0 , ) . Then ( X , ) is a partially ordered set with the natural ordering of real numbers. Let d ( x , y ) = | x y | for x , y X . Then ( X , d ) is a complete metric space.

Let g : X X be given by g x = x 2 for all x X . Also, consider
F : X × X X , F ( x , y ) = { 1 3 ( x 2 y 2 ) if  x , y X , x y , 0 if  x y ,

which obeys the mixed g-monotone property.

Let { x n } and { y n } be two sequences in X such that
lim n F ( x n , y n ) = lim n g x n = a , lim n F ( y n , x n ) = lim n g y n = b .

Then, obviously, a = 0 and b = 0 .

Now, for all n 0 , g x n = x n 2 , g y n = y n 2 , while
F ( x n , y n ) = { 1 3 ( x n 2 y n 2 ) if  x n y n , 0 if  x n y n , F ( y n , x n ) = { 1 3 ( y n 2 x n 2 ) if  y n x n , 0 if  y n x n .
Then it follows that
lim n d ( g F ( x n , y n ) , F ( g x n , g y n ) ) = 0 , lim n d ( g F ( y n , x n ) , F ( g y n , g x n ) ) = 0 .

Hence, the pair ( g , F ) is compatible in X.

Let x 0 = 0 and y 0 = c ( > 0 ) be two points in X. Then
g ( x 0 ) = g ( 0 ) = 0 = F ( 0 , c ) = F ( x 0 , y 0 ) , g ( y 0 ) = g ( c ) = c 2 c 2 3 = F ( c , 0 ) = F ( y 0 , x 0 ) .
Let ψ , φ , θ : [ 0 , ) [ 0 , ) be given respectively by the formulas
ψ ( t ) = t 2 , φ ( t ) = { 1 2 [ t ] 2 if  3 < t < 4 , 4 9 t 2 otherwise , θ ( t ) = { 1 9 [ t ] 2 if  3 < t < 4 , 0 otherwise .

Then ψ, φ and θ have the properties mentioned in Theorem 4.1.

We now verify inequality (4.1) of Theorem 4.1.

We take x , y , u , v X such that g x g u and g y g v , that is, x 2 u 2 and y 2 v 2 .

Let M = d ( g x , g u ) + d ( g y , g v ) = | x 2 u 2 | + | y 2 v 2 | = ( x 2 u 2 ) + ( v 2 y 2 ) .

The following are the four possible cases.

Case-1: x y and u v . Then
d ( F ( x , y ) , F ( u , v ) ) + d ( F ( y , x ) , F ( v , u ) ) = d ( x 2 y 2 3 , u 2 v 2 3 ) + d ( 0 , 0 ) = | ( x 2 y 2 ) ( u 2 v 2 ) 3 | = | ( x 2 u 2 ) + ( v 2 y 2 ) 3 | = ( x 2 u 2 ) + ( v 2 y 2 ) 3 = 1 3 M .
Case-2: x < y and u < v . Then
d ( F ( x , y ) , F ( u , v ) ) + d ( F ( y , x ) , F ( v , u ) ) = d ( 0 , 0 ) + d ( y 2 x 2 3 , v 2 u 2 3 ) = | ( y 2 x 2 ) ( v 2 u 2 ) 3 | = | ( x 2 u 2 ) + ( v 2 y 2 ) 3 | = ( x 2 u 2 ) + ( v 2 y 2 ) 3 = 1 3 M .
Case-3: x y and u v . Then
d ( F ( x , y ) , F ( u , v ) ) + d ( F ( y , x ) , F ( v , u ) ) = d ( x 2 y 2 3 , 0 ) + d ( 0 , v 2 u 2 3 ) = x 2 y 2 3 + v 2 u 2 3 = ( x 2 u 2 ) + ( v 2 y 2 ) 3 = 1 3 M .

Case-4: The case ‘ x < y and u > v ’ is not possible. Under this condition, x 2 < y 2 and u 2 > v 2 . Then by the condition y 2 v 2 , we have x 2 < y 2 v 2 < u 2 , which contradicts that x 2 u 2 .

In all the above cases, it can be verified that (4.1) is satisfied. Hence the required conditions of Theorem 4.1 are satisfied, and it is seen that ( 0 , 0 ) is a coupled coincidence point of g and F in X. Also, the conditions of Theorem 4.3 are satisfied, and it is seen that ( 0 , 0 ) is the unique coupled common fixed point of g and F in X.

Remark 4.2 In the above example, the pair ( g , F ) is compatible but not commuting so that Corollary 4.1 is not applicable to this example, and hence Theorem 4.1 properly contains its Corollary 4.1.

Remark 4.3 As discussed in Remarks 3.2-3.5, Theorem 4.1 properly contains its Corollaries 4.2-4.6.

Remark 4.4 Theorem 4.1 properly contains its Corollary 4.6, which is an extension of Theorem 3 of Berinde [9], and Theorems 2.1 and 2.2 of Bhaskar and Lakshmikantham [8]. Therefore, Theorem 4.1 is an actual extension over Theorem 3 of Berinde [9] and Theorems 2.1 and 2.2 of Bhaskar and Lakshmikantham [8].

Example 4.2 Let X = [ 0 , 1 ] . Then ( X , ) is a partially ordered set with the natural ordering of real numbers. Let d ( x , y ) = | x y | for x , y X . Then ( X , d ) is a metric space with the required properties of Theorem 4.2.

Let F : X × X X , F ( x , y ) = 1 for ( x , y ) X × X . Let g : X X be given by the formula
g x = { 1 if  x  is rational , 1 2 if  x  is irrational .

Then F and g have the properties mentioned in Theorems 4.2.

Let ψ , φ , θ : [ 0 , ) [ 0 , ) be given respectively by the formulas
ψ ( t ) = t 2 , φ ( t ) = { 1 2 [ t ] 2 if  3 < t < 4 , 4 9 t 2 otherwise , θ ( t ) = { 1 9 [ t ] 2 if  3 < t < 4 , 0 otherwise .

Then ψ, φ and θ have the properties mentioned in Theorem 4.2.

All the required conditions of Theorem 4.2 are satisfied. It is seen that every ( x , y ) X × X , where both x and y are rational, is a coupled coincidence point of g and F in X. Also, the conditions of Theorem 4.3 are satisfied and it is seen that ( 1 , 1 ) is the unique coupled common fixed point of g and F in X.

Remark 4.5 In the above example, the function g is not continuous. Therefore, Theorem 4.1 is not applicable to the above example.

Remark 4.6 In some recent papers [30, 31] it has been proved that some of the contractive conditions involving continuous control functions are equivalent. Here two of our control functions are discontinuous. Therefore, the contraction we use here is not included in the class of contractions addressed by Aydi et al. [30] and Jachymski [31].

Declarations

Acknowledgements

The work is partially supported by the Council of Scientific and Industrial Research, India (No. 25(0168)/09/EMR-II). Professor BS Choudhury gratefully acknowledges the support.

Authors’ Affiliations

(1)
Department of Mathematics, Bengal Engineering and Science University
(2)
Department of Mathematics, Bengal Institute of Technology
(3)
Faculty of Applied Sciences, University Politehnica of Bucharest

References

  1. Turinici M: Abstract comparison principles and multivariable Gronwall-Bellman inequalities. J. Math. Anal. Appl. 1986, 117: 100–127. 10.1016/0022-247X(86)90251-9MathSciNetView ArticleMATHGoogle Scholar
  2. Choudhury BS, Kundu A: ( ψ , α , β ) -weak contractions in partially ordered metric spaces. Appl. Math. Lett. 2012, 25(1):6–10. 10.1016/j.aml.2011.06.028MathSciNetView ArticleGoogle Scholar
  3. Harjani J, Sadarangani K: Fixed point theorems for weakly contractive mappings in partially ordered sets. Nonlinear Anal. 2009, 71: 3403–3410. 10.1016/j.na.2009.01.240MathSciNetView ArticleMATHGoogle Scholar
  4. Harjani J, Sadarangani K: Generalized contractions in partially ordered metric spaces and applications to ordinary differential equations. Nonlinear Anal. 2010, 72: 1188–1197. 10.1016/j.na.2009.08.003MathSciNetView ArticleMATHGoogle Scholar
  5. Nieto JJ, Lopez R: Contractive mapping theorems in partially ordered sets and applications to ordinary differential equations. Order 2005, 22: 223–239. 10.1007/s11083-005-9018-5MathSciNetView ArticleMATHGoogle Scholar
  6. Ran ACM, Reurings MCB: A fixed point theorem in partially ordered sets and some applications to matrix equations. Proc. Am. Math. Soc. 2004, 132: 1435–1443. 10.1090/S0002-9939-03-07220-4MathSciNetView ArticleMATHGoogle Scholar
  7. Guo D, Lakshmikantham V: Coupled fixed points of nonlinear operators with applications. Nonlinear Anal. 1987, 11(5):623–632. 10.1016/0362-546X(87)90077-0MathSciNetView ArticleMATHGoogle Scholar
  8. Gnana Bhaskar T, Lakshmikantham V: Fixed point theorems in partially ordered metric spaces and applications. Nonlinear Anal. 2006, 65: 1379–1393. 10.1016/j.na.2005.10.017MathSciNetView ArticleMATHGoogle Scholar
  9. Berinde V: Generalized coupled fixed point theorems for mixed monotone mappings in partially ordered metric spaces. Nonlinear Anal. 2011, 74(18):7347–7355. 10.1016/j.na.2011.07.053MathSciNetView ArticleMATHGoogle Scholar
  10. Berinde V: Coupled fixed point theorems for ϕ -contractive mixed monotone mappings in partially ordered metric spaces. Nonlinear Anal. 2011, 75: 3218–3228.MathSciNetView ArticleMATHGoogle Scholar
  11. Berinde V: Coupled coincidence point theorems for mixed monotone nonlinear operators. Comput. Math. Appl. 2012, 64: 1770–1777. 10.1016/j.camwa.2012.02.012MathSciNetView ArticleMATHGoogle Scholar
  12. Choudhury BS, Kundu A: A coupled coincidence point result in partially ordered metric spaces for compatible mappings. Nonlinear Anal. 2010, 73: 2524–2531. 10.1016/j.na.2010.06.025MathSciNetView ArticleMATHGoogle Scholar
  13. Choudhury BS, Maity P: Coupled fixed point results in generalized metric spaces. Math. Comput. Model. 2011, 54: 73–79. 10.1016/j.mcm.2011.01.036MathSciNetView ArticleMATHGoogle Scholar
  14. Choudhury BS, Metiya N, Kundu A: Coupled coincidence point theorems in ordered metric spaces. Ann. Univ. Ferrara 2011, 57: 1–16. 10.1007/s11565-011-0117-5MathSciNetView ArticleMATHGoogle Scholar
  15. Harjani J, López B, Sadarangani K: Fixed point theorems for mixed monotone operators and applications to integral equations. Nonlinear Anal. 2011, 74: 1749–1760. 10.1016/j.na.2010.10.047MathSciNetView ArticleMATHGoogle Scholar
  16. Karapınar E, Luong NV, Thuan NX: Coupled coincidence points for mixed monotone operators in partially ordered metric spaces. Arab. J. Math. 2012, 1: 329–339. 10.1007/s40065-012-0027-0View ArticleMathSciNetMATHGoogle Scholar
  17. Lakshmikantham V, Ćirić Lj: Coupled fixed point theorems for nonlinear contractions in partially ordered metric spaces. Nonlinear Anal. 2009, 70: 4341–4349. 10.1016/j.na.2008.09.020MathSciNetView ArticleMATHGoogle Scholar
  18. Luong NV, Thuan NX: Coupled fixed points in partially ordered metric spaces and application. Nonlinear Anal. 2011, 74: 983–992. 10.1016/j.na.2010.09.055MathSciNetView ArticleMATHGoogle Scholar
  19. Samet B: Coupled fixed point theorems for generalized Meir-Keeler contraction in partially ordered metric spaces. Nonlinear Anal. 2010, 72: 4508–4517. 10.1016/j.na.2010.02.026MathSciNetView ArticleMATHGoogle Scholar
  20. Shatanawi W, Samet B, Abbas M: Coupled fixed point theorems for mixed monotone mappings in ordered partial metric spaces. Math. Comput. Model. 2012, 55(3–4):680–687. 10.1016/j.mcm.2011.08.042MathSciNetView ArticleMATHGoogle Scholar
  21. Chen YZ: Existence theorems of coupled fixed points. J. Math. Anal. Appl. 1991, 154: 142–150. 10.1016/0022-247X(91)90076-CMathSciNetView ArticleMATHGoogle Scholar
  22. Kadelburg Z, Pavlović M, Radenović S: Common fixed point theorems for ordered contractions and quasicontractions in ordered cone metric spaces. Comput. Math. Appl. 2010, 59: 3148–3159. 10.1016/j.camwa.2010.02.039MathSciNetView ArticleMATHGoogle Scholar
  23. Jungck G: Compatible mappings and common fixed points. Int. J. Math. Math. Sci. 1986, 9: 771–779. 10.1155/S0161171286000935MathSciNetView ArticleMATHGoogle Scholar
  24. Jungck G, Rhoades BE: Fixed point for set-valued functions without continuity. Indian J. Pure Appl. Math. 1998, 29(3):227–238.MathSciNetMATHGoogle Scholar
  25. Khan MS, Swaleh M, Sessa S: Fixed points theorems by altering distances between the points. Bull. Aust. Math. Soc. 1984, 30: 1–9. 10.1017/S0004972700001659MathSciNetView ArticleMATHGoogle Scholar
  26. Banach S: Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales. Fundam. Math. 1922, 3: 133–181.MATHGoogle Scholar
  27. Dutta PN, Choudhury BS: A generalisation of contraction principle in metric spaces. Fixed Point Theory Appl. 2008., 2008: Article ID 406368Google Scholar
  28. Jungck G: Commuting maps and fixed points. Am. Math. Mon. 1976, 83: 261–263. 10.2307/2318216MathSciNetView ArticleMATHGoogle Scholar
  29. Rhoades BE: Some theorems on weakly contractive maps. Nonlinear Anal. 2001, 47(4):2683–2693. 10.1016/S0362-546X(01)00388-1MathSciNetView ArticleMATHGoogle Scholar
  30. Aydi H, Karapınar E, Samet B: Remarks on some recent fixed point theorems. Fixed Point Theory Appl. 2012., 76: Article ID 2012Google Scholar
  31. Jachymski J: Equivalent conditions for generalized contractions on (ordered) metric spaces. Nonlinear Anal. 2011, 74: 768–774. 10.1016/j.na.2010.09.025MathSciNetView ArticleMATHGoogle Scholar

Copyright

© Choudhury et al.; licensee Springer. 2013

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.