1 Introduction

Let X be an arbitrary nonempty set. A fixed point for a self mapping f:XX is a point xX such that fx=x. The applications of fixed point theorems are very important in diverse disciplines of mathematics, statistics, chemistry, biology, computer science, engineering and economics in dealing with problems arising in approximation theory, potential theory, game theory, mathematical economics, theory of differential equations, theory of integral equations, theory of matrix equations etc. (see, e.g., [16]). For example, fixed point theorems are incredibly useful when it comes to prove the existence of various types of Nash equilibria (see, e.g., [1]) in economics. Fixed point theorems are also helpful for proving the existence of weak periodic solutions for a model describing the electrical heating of a conductor taking into account the Joule-Thomson effect (see, e.g., [7]).

One of the very popular tools of a fixed point theory is the Banach contraction principle which first appeared in 1922. It states that if (X,d) is a complete metric space and T:XX is a contraction mapping (i.e., d(Tx,Ty)kd(x,y) for all x,yX, where k is a non-negative number such that k<1), then T has a unique fixed point. Several mathematicians have been dedicated to improvement and generalization of this principle (see [814]).

Especially, in 2004, Ran and Reurings [15] showed the existence of fixed points of nonlinear contraction mappings in metric spaces endowed with a partial ordering and presented applications of their results to matrix equations. Since 2004 some authors have studied fixed point theorems in partially ordered metric spaces (see [1619] and references therein). Subsequently, Nieto and Rodríguez-López [18] extended the results in [15] for non-decreasing mappings and obtained a unique solution for a first-order ordinary differential equation with periodic boundary conditions (see also [19]).

One of the interesting and crucial concepts, a coupled fixed point theorem, was introduced by Guo and Lakshmikantham [20]. In 2006 Bhaskar and Lakshmikantham [21] introduced the notion of the mixed monotone property of a given mapping. Furthermore, they proved some coupled fixed point theorems for mappings which satisfy the mixed monotone property and gave some applications in the existence and uniqueness of a solution for a periodic boundary value problem. They also established the classical coupled fixed point theorems and gave some of their applications. The main results of Bhaskar and Lakshmikantham are as follows.

Theorem 1.1 (Bhaskar and Lakshmikantham [21])

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×XX be a continuous mapping having the mixed monotone property on X. Assume that there exists a k[0,1) with

d ( F ( x , y ) , F ( u , v ) ) k ( d ( x , u ) + d ( y , v ) 2 )
(1.1)

for all x,y,u,vX for which xu and yv. If there exists x 0 , y 0 X such that

x 0 F( x 0 , y 0 ), y 0 F( y 0 , x 0 ),

then there exists x,yX such that x=F(x,y) and y=F(y,x).

Theorem 1.2 (Bhaskar and Lakshmikantham [21])

Let (X,) be a partially ordered set and suppose there is a metric d on X such that (X,d) is a complete metric space. Suppose that X has the following property:

  1. (i)

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

  2. (ii)

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

Let F:X×XX be a mapping having the mixed monotone property on X. Assume that there exists k[0,1) with

d ( F ( x , y ) , F ( u , v ) ) k ( d ( x , u ) + d ( y , v ) 2 )
(1.2)

for all x,y,u,vX for which xu and yv. If there exists x 0 , y 0 X such that

x 0 F( x 0 , y 0 ), y 0 F( y 0 , x 0 ),

then there exists x,yX such that x=F(x,y) and y=F(y,x).

Because of the important role of Theorems 1.1 and 1.2 in nonlinear differential equations, nonlinear integral equations and differential inclusions, many authors have studied the existence of coupled fixed points of the given mappings in several spaces and applications (see [2231] and references therein).

In this paper, we establish the existence of a coupled fixed point of the given mapping in complete metric spaces without the mixed monotone property. We also give some illustrative examples to illustrate our main theorems. Furthermore, we find the necessary condition to guarantee the uniqueness of the coupled fixed point. Our results improve and extend some coupled fixed point theorems of Bhaskar and Lakshmikantham [21] and others. As an application, we apply the main results to the setting of partially ordered metric spaces and also present some applications to integral equations.

2 Preliminaries

In this section, we give some definitions, examples and remarks which are useful for main results in this paper.

Throughout this paper, P(X) denotes a collection of subsets of X, and (X,) denotes a partially ordered set with the partial order ⪯. By xy, we mean yx. A mapping f:XX is said to be non-decreasing (resp., non-increasing) if for all x,yX, xy implies f(x)f(y) (resp., f(y)f(x)).

Definition 2.1 (Bhaskar and Lakshmikantham [21])

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

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

and

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

Definition 2.2 (Bhaskar and Lakshmikantham [21])

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

Example 2.3 Let X=[0,) and F:X×XX be defined by

F(x,y)=x+y

for all x,yX. It is easy to see that F has a unique coupled fixed point (0,0).

Example 2.4 Let X=P([0,)) and F:X×XX be defined by

F(A,B)=AB

for all A,BX. We can see that a coupled fixed point of F is ( A ˜ , B ˜ ), where A ˜ and B ˜ are disjoint sets.

Next, we give the notion of an F-invariant set which is due to Samet and Vetro [32].

Definition 2.5 (Samet and Vetro [32])

Let (X,d) be a metric space and F:X×XX be a given mapping. Let M be a nonempty subset of X 4 . We say that M is an F-invariant subset of X 4 if and only if, for all x,y,z,wX,

  1. (i)

    (x,y,z,w)M(w,z,y,x)M;

  2. (ii)

    (x,y,z,w)M(F(x,y),F(y,x),F(z,w),F(w,z))M.

Here, we introduce the new property which is useful for our main results.

Definition 2.6 Let (X,d) be a metric space and M be a subset of X 4 . We say that M satisfies the transitive property if and only if, for all x,y,z,w,a,bX,

(x,y,z,w)Mand(z,w,a,b)M(x,y,a,b)M.

Remark 2.7 We can easily check that the set M= X 4 is trivially F-invariant, which satisfies the transitive property.

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

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

It easy to see that M= { 1 , 2 } 4 X 4 is F-invariant, which satisfies the transitive property.

Example 2.9 Let X=R endowed with the usual metric and F:X×XX be defined by

F(x,y)={ x , x , y ( , 1 ) ( 1 , ) , cos ( x + y ) sin ( x y ) , otherwise .

It easy to see that M= [ ( , 1 ) ( 1 , ) ] 4 X 4 is F-invariant, which satisfies the transitive property.

The following example plays a key role in the proof of our main results in a partially ordered set.

Example 2.10 Let (X,d) be a metric space endowed with a partial order ⪯. Let F:X×XX be a mapping satisfying the mixed monotone property, that is, for all x,yX, we have

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

and

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

Define a subset M X 4 by

M= { ( a , b , c , d ) X 4 : a c , b d } .

Then M is an F-invariant subset of X 4 , which satisfies the transitive property.

3 Coupled fixed point theorems without the mixed monotone property

Theorem 3.1 Let (X,d) be a complete metric space and M be a nonempty subset of X 4 . Assume that there is a function φ:[0,)[0,) with 0=φ(0)<φ(t)<t and lim r t + φ(r)<t for each t>0, and also suppose that F:X×XX is a mapping such that

d ( F ( x , y ) , F ( u , v ) ) φ ( d ( x , u ) + d ( y , v ) 2 )
(3.1)

for all (x,y,u,v)M. Suppose that either

  1. (a)

    F is continuous or

  2. (b)

    if for any two sequences { x n }, { y n } with ( x n + 1 , y n + 1 , x n , y n )M,

    { x n }x,{ y n }y

for all n1, then (x,y, x n , y n )M for all n1.

If there exists ( x 0 , y 0 )X×X such that (F( x 0 , y 0 ),F( y 0 , x 0 ), x 0 , y 0 )M and M is an F-invariant set which satisfies the transitive property, then there exists x,yX such that x=F(x,y) and y=F(y,x), that is, F has a coupled fixed point.

Proof From F(X×X)X, we can construct two sequences { x n } and { y n } in X such that

x n =F( x n 1 , y n 1 ), y n =F( y n 1 , x n 1 )
(3.2)

for all nN. If there exists n N such that x n 1 = x n and y n 1 = y n , then

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

Thus, ( x n 1 , y n 1 ) is a coupled fixed point of F. This finishes the proof. Therefore, we may assume that x n 1 x n or y n 1 y n for all nN.

Since (F( x 0 , y 0 ),F( y 0 , x 0 ), x 0 , y 0 )=( x 1 , y 1 , x 0 , y 0 )M and M is an F-invariant set, we get

( F ( x 1 , y 1 ) , F ( y 1 , x 1 ) , F ( x 0 , y 0 ) , F ( y 0 , x 0 ) ) =( x 2 , y 2 , x 1 , y 1 )M.

Again, using the fact that M is an F-invariant set, we have

( F ( x 2 , y 2 ) , F ( y 2 , x 2 ) , F ( x 1 , y 1 ) , F ( y 1 , x 1 ) ) =( x 3 , y 3 , x 2 , y 2 )M.

By repeating this argument, we get

( F ( x n 1 , y n 1 ) , F ( y n 1 , x n 1 ) , x n 1 , y n 1 ) =( x n , y n , x n 1 , y n 1 )M

for all nN. Denote δ n 1 :=d( x n , x n 1 )+d( y n , y n 1 )>0 for all nN.

Now, we show that

δ n 2φ ( δ n 1 2 )

for all nN. Since ( x n , y n , x n 1 , y n 1 )M for all nN, from (3.1), it follows that

d ( x n + 1 , x n ) = d ( F ( x n , y n ) , F ( x n 1 , y n 1 ) ) φ ( d ( x n , x n 1 ) + d ( y n , y n 1 ) 2 ) = φ ( δ n 1 2 ) .
(3.3)

Since M is an F-invariant set and ( x n , y n , x n 1 , y n 1 )M for all nN, we get ( y n 1 , x n 1 , y n , x n )M for all nN. From (3.1) and ( y n 1 , x n 1 , y n , x n )M for all nN, we get

d ( y n + 1 , y n ) = d ( F ( y n , x n ) , F ( y n 1 , x n 1 ) ) = d ( F ( y n 1 , x n 1 ) , F ( y n , x n ) ) φ ( d ( y n 1 , y n ) + d ( x n 1 , x n ) 2 ) = φ ( δ n 1 2 ) .
(3.4)

Adding (3.3) and (3.4), we get

δ n 2φ ( δ n 1 2 )
(3.5)

for all nN. From (3.5) and φ(t)<t for all t>0, we have

δ n 2φ ( δ n 1 2 ) < δ n 1

for all nN, that is, { δ n } is a monotone decreasing sequence. Therefore, lim n δ n =δ for some δ0.

Now, we show that δ=0. Suppose that δ>0. Taking n of both sides of (3.5), from lim r t + φ(r)<t for all r>0, it follows that

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

which is a contradiction. Thus, δ=0 and

lim n δ n = lim n [ d ( x n + 1 , x n ) + d ( y n + 1 , y n ) ] =0.
(3.6)

Next, we prove that { x n } and { y n } are Cauchy sequences. Suppose that at least one, { x n } or { y n }, is not a Cauchy sequence. Then there exists ϵ>0 and two subsequences of integers n k and m k with n k > m k k such that

r k :=d( x m k , x n k )+d( y m k , y n k )ϵ
(3.7)

for all k{1,2,}. Further, corresponding to m k , we can choose n k in such a way that it is the smallest integer with n k > m k k satisfying (3.7). Then we have

d( x m k , x n k 1 )+d( y m k , y n k 1 )<ϵ.
(3.8)

Using (3.7), (3.8) and the triangle inequality, we have

ϵ r k = d ( x m k , x n k ) + d ( y m k , y n k ) d ( x m k , x n k 1 ) + d ( x n k 1 , x n k ) + d ( y m k , y n k 1 ) + d ( y n k 1 , y n k ) = [ d ( x m k , x n k 1 ) + d ( y m k , y n k 1 ) ] + [ d ( x n k , x n k 1 ) + d ( y n k , y n k 1 ) ] < ϵ + δ n k 1 .
(3.9)

Letting k and using (3.6), we have lim k r k =ϵ>0.

Since n k > m k and M satisfies the transitive property, we get

( x n k , y n k , x m k , y m k )Mand( y m k , x m k , y n k , x n k )M.
(3.10)

From (3.1) and (3.10), we get

d ( x m k + 1 , x n k + 1 ) = d ( F ( x m k , y m k ) , F ( x n k , y n k ) ) = d ( F ( x n k , y n k ) , F ( x m k , y m k ) ) φ ( d ( x n k , x m k ) + d ( y n k , y m k ) 2 ) = φ ( r k 2 )
(3.11)

and

d ( y m k + 1 , y n k + 1 ) = d ( F ( y m k , x m k ) , F ( y n k , x n k ) ) φ ( d ( y m k , y n k ) + d ( x m k , x n k ) 2 ) = φ ( r k 2 ) .
(3.12)

Adding (3.11) and (3.12), we get

r k + 1 2φ ( r k 2 )
(3.13)

for all k{1,2,}. Taking k of both sides of (3.13), from lim r t + φ(r)<t for all r>0, it follows that

ϵ= lim k r k + 1 2 lim k φ ( r k 2 ) =2 lim r k ϵ + φ ( r k 2 ) <2 ( ϵ 2 ) =ϵ,

which is a contradiction. Therefore, { x n } and { y n } are Cauchy sequences. Since X is complete, there exists x,yX such that

lim n x n =x, lim n y n =y.
(3.14)

Finally, we show that x=F(x,y) and y=F(y,x). If the assumption (a) holds, then we have

x= lim n x n + 1 = lim n F( x n , y n )=F ( lim n x n , lim n y n ) =F(x,y)
(3.15)

and

y= lim n y n + 1 = lim n F( y n , x n )=F ( lim n y n , lim n x n ) =F(y,x).
(3.16)

Therefore, x=F(x,y) and y=F(y,x), that is, F has a coupled fixed point.

Suppose that (b) holds. We obtain that a sequence { x n } converges to x and a sequence { y n } converges to y for some x,yX. By the assumption, we have (x,y, x n , y n )M for all nN. Since (x,y, x n , y n )M for all nN, by the triangle inequality and (3.1), we get

d ( F ( x , y ) , x ) d ( F ( x , y ) , x n + 1 ) + d ( x n + 1 , x ) = d ( F ( x , y ) , F ( x n , y n ) ) + d ( x n + 1 , x ) φ ( d ( x , x n ) + d ( y , y n ) 2 ) + d ( x n + 1 , x ) .
(3.17)

Taking n, we have d(F(x,y),x)=0, and so x=F(x,y). Similarly, we can conclude that y=F(x,y). Therefore, F has a coupled fixed point. This completes the proof. □

Now, we give an example to validate Theorem 3.1.

Example 3.2 Let X=R endowed with the usual metric d(x,y)=|xy| for all x,yX and endowed with the usual partial order defined by xyyx[0,). Define a continuous mapping F:X×XX by

F(x,y)= x + y + 2 3

for all (x,y)X×X. Let y 1 =2 and y 2 =3. Then we have y 1 y 2 , but F(x, y 1 )F(x, y 2 ), and so the mapping F does not satisfy the mixed monotone property.

Now, let φ:[0,)[0,) be a function defined by φ(t)= 2 3 t for all t[0,). Then we obtain 0=φ(0)<φ(t)<t and lim r t + φ(r)<t for any t>0. By simple calculation, we see that for all x,y,u,vX,

d ( F ( x , y ) , F ( u , v ) ) = | x + y + 2 3 u + v + 2 3 | 1 3 ( d ( x , u ) + d ( y , v ) ) = 2 3 ( d ( x , u ) + d ( y , v ) 2 ) = φ ( d ( x , u ) + d ( y , v ) 2 ) .

Therefore, if we apply Theorem 3.1 with M= X 4 , we know that F has a unique coupled fixed point, that is, a point (2,2) is a unique coupled fixed point.

Remark 3.3 Although the mixed monotone property is an essential tool in the partially ordered metric spaces to show the existence of coupled fixed points, the mappings do not have the mixed monotone property in a general case as in the above example. Therefore, Theorem 3.1 is interesting, as a new auxiliary tool, in showing the existence of a coupled fixed point.

If we take the mapping φ(t)=kt for some k[0,1) in Theorem 3.1, then we get the following:

Corollary 3.4 Let (X,d) be a complete metric space and M be a nonempty subset of X 4 . Suppose that F:X×XX is a mapping such that there exists k[0,1) such that

d ( F ( x , y ) , F ( u , v ) ) k ( d ( x , u ) + d ( y , v ) 2 )
(3.18)

for all (x,y,u,v)M. Suppose that either

  1. (a)

    F is continuous or

  2. (b)

    for any two sequences { x n }, { y n } with ( x n + 1 , y n + 1 , x n , y n )M, if

    { x n }x,{ y n }y

for all nN, then (x,y, x n , y n )M for all nN.

If there exists ( x 0 , y 0 )X×X such that (F( x 0 , y 0 ),F( y 0 , x 0 ), x 0 , y 0 )M and M is an F-invariant set which satisfies the transitive property, then there exists x,yX such that x=F(x,y) and y=F(y,x), that is, F has a coupled fixed point.

Now, from Theorem 3.1, we have the following question:

(Q1) Is it possible to guarantee the uniqueness of the coupled fixed point of F?

Now, we give positive answers to this question.

Theorem 3.5 In addition to the hypotheses of Theorem  3.1, suppose that for all (x,y),(z,t)X×X, there exists (u,v)X×X such that (x,y,u,v)M and (z,t,u,v)M. Then F has a unique coupled fixed point.

Proof From Theorem 3.1, we know that F has a coupled fixed point. Suppose that (x,y) and (z,t) are coupled fixed points of F, that is, x=F(x,y), y=F(y,x), z=F(z,t) and t=F(t,z).

Now, we show that x=z and y=t. By the hypothesis, there exists (u,v)X×X such that (x,y,u,v)M and (z,t,u,v)M. We put u 0 =u and v 0 =v and construct two sequences { u n } and { v n } by

u n =F( u n 1 , v n 1 ), v n =F( v n 1 , u n 1 )

for all nN.

Since M is F-invariant and (x,y, u 0 , v 0 )=(x,y,u,v)M, we have

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

that is,

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

From (x,y, u 1 , v 1 )M, if we use again the property of F-invariant, then it follows that

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

and so

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

By repeating this process, we get

(x,y, u n , v n )M
(3.19)

for all nN. From (3.1) and (3.19), we have

d(x, u n + 1 )=d ( F ( x , y ) , F ( u n , v n ) ) φ ( d ( x , u n ) + d ( y , v n ) 2 ) .
(3.20)

Since M is F-invariant and (x,y, u n , v n )M for all nN, we have

( v n , u n ,y,x)M
(3.21)

for all nN. From (3.1) and (3.21), we get

d( v n + 1 ,y)=d ( F ( v n , u n ) , F ( y , x ) ) φ ( d ( v n , y ) + d ( u n , x ) 2 ) .
(3.22)

Thus, from (3.20) and (3.22), we have

d ( x , u n + 1 ) + d ( y , v n + 1 ) 2 φ ( d ( x , u n ) + d ( y , v n ) 2 )
(3.23)

for all nN. By repeating this process, we get

d ( x , u n + 1 ) + d ( y , v n + 1 ) 2 φ n ( d ( x , u 1 ) + d ( y , v 1 ) 2 )
(3.24)

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

lim n [ d ( x , u n + 1 ) + d ( y , v n + 1 ) ] =0.
(3.25)

Similarly, we can prove that

lim n [ d ( z , u n + 1 ) + d ( t , v n + 1 ) ] =0.
(3.26)

By the triangle inequality, for all nN, we have

d ( x , z ) + d ( y , t ) [ d ( x , u n + 1 ) + d ( u n + 1 , z ) ] + [ d ( y , v n + 1 ) + d ( v n + 1 , t ) ] = [ d ( x , u n + 1 ) + d ( y , v n + 1 ) ] + [ d ( z , u n + 1 ) + d ( t , v n + 1 ) ] .
(3.27)

Taking n in (3.27) and using (3.25) and (3.26), we have d(x,z)+d(y,t)=0, and so x=z and y=t. Therefore, F has a unique coupled fixed point. This completes the proof. □

Next, we give a simple application of our results to coupled fixed point theorems in partially ordered metric spaces.

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. Assume that there is a function φ:[0,)[0,) with 0=φ(0)<φ(t)<t and lim r t + φ(r)<t for each t>0 and also suppose that F:X×XX is a mapping such that F has the mixed monotone property and

d ( F ( x , y ) , F ( u , v ) ) φ ( d ( x , u ) + d ( y , v ) 2 )
(3.28)

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

  1. (a)

    F is continuous or

  2. (b)

    X has the following property:

  3. (i)

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

  4. (ii)

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

If there exists x 0 , y 0 X such that

x 0 F( x 0 , y 0 ), y 0 F( y 0 , x 0 ),

then there exists x,yX such that x=F(x,y) and y=F(y,x), that is, F has a coupled fixed point.

Proof First, we define a subset M X 4 by

M= { ( a , b , c , d ) X 4 : a c , b d } .

From Example 2.10, we can conclude that M is an F-invariant set which satisfies the transitive property. By (3.28), we have

d ( F ( x , y ) , F ( u , v ) ) φ ( d ( x , u ) + d ( y , v ) 2 )
(3.29)

for all x,y,u,vX with (x,y,u,v)M. Since x 0 , y 0 X such that

x 0 F( x 0 , y 0 ), y 0 F( y 0 , x 0 ),

we get

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

For the assumption (b), for any two sequences { x n }, { y n } such that { x n } is a non-decreasing sequence in X with x n x and { y n } is a non-increasing sequence in X with y n y, we have

x 1 x 2 x n x

and

y 1 y 2 y n y

for all nN. Therefore, we have (x,y, x n , y n )M for all nN, and so the assumption (b) of Theorem 3.1 holds.

Now, since all the hypotheses of Theorem 3.1 hold, F has a coupled fixed point. This completes the proof. □

Corollary 3.7 In addition to the hypotheses of Corollary  3.6, suppose that for all (x,y),(z,t)X×X, there exists (u,v)X×X such that xu, yv and zu, tv. Then F has a unique coupled fixed point.

Proof First, we define a subset M X 4 by

M= { ( a , b , c , d ) X 4 : a c , b d } .

From Example 2.10, we can conclude that M is an F-invariant set which satisfies the transitive property. Thus, the proof of the existence of a coupled fixed point is straightforward by following the same lines as in the proof of Corollary 3.6.

Next, we show the uniqueness of a coupled fixed point of F. Since for all (x,y),(z,t)X×X, there exists (u,v)X×X such that xu, yv and zu, tv, we can conclude that (x,y,u,v)M and (z,t,u,v)M. Therefore, since all the hypotheses of Theorem 3.5 hold, F has a unique coupled fixed point. This completes the proof. □

Corollary 3.8 (Bhaskar and Lakshmikantham [21])

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×XX be a continuous mapping having the mixed monotone property on X. Assume that there exists k[0,1) with

d ( F ( x , y ) , F ( u , v ) ) k ( d ( x , u ) + d ( y , v ) 2 )
(3.30)

for all x,y,u,vX for which xu and yv. If there exists x 0 , y 0 X such that

x 0 F( x 0 , y 0 ), y 0 F( y 0 , x 0 ),

then there exists x,yX such that x=F(x,y) and y=F(y,x).

Proof Taking φ(t)=kt for some k[0,1) in Corollary 3.6(a), we can get the conclusion. □

Corollary 3.9 (Bhaskar and Lakshmikantham [21])

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. Suppose that X has the following property:

  1. (i)

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

  2. (ii)

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

Let F:X×XX be a continuous mapping having the mixed monotone property on X. Assume that there exists k[0,1) with

d ( F ( x , y ) , F ( u , v ) ) k ( d ( x , u ) + d ( y , v ) 2 )
(3.31)

for all x,y,u,vX for which xu and yv. If there exists x 0 , y 0 X such that

x 0 F( x 0 , y 0 ), y 0 F( y 0 , x 0 ),

then there exists x,yX such that x=F(x,y) and y=F(y,x).

Proof Taking φ(t)=kt for some k[0,1) in Corollary 3.6(b), we can get the conclusion. □

4 Applications

In this section, we apply our theorem to the existence theorem for a solution of the following nonlinear integral equations:

x ( t ) = 0 T f ( t , x ( s ) , y ( s ) ) d s , t [ 0 , T ] ; y ( t ) = 0 T f ( t , y ( s ) , x ( s ) ) d s , t [ 0 , T ] ,
(4.1)

where T is a real number such that T>0 and f:[0,T]×R×RR.

Let X=C([0,T],R) denote the space of R-valued continuous functions on the interval [0,T]. We endowed X with the metric d:X×XR defined by

d(x,y)= sup t [ 0 , T ] |x(t)y(t)|,x,yX.

It is clear that (X,d) is a complete metric space.

Now, we consider the following assumptions:

Definition 4.1 An element α,βC([0,T],R)×C([0,T],R) is called a coupled lower and upper solution of the integral equation (4.1) if α(t)β(t) and

α(t) 0 T f(t,α(s),β(s))ds

and

β(t) 0 T f(t,β(s),α(s))ds

for all t[0,T].

(⋆1) f:[0,T]×R×RR is continuous;

(⋆2) for all t[0,T] and for all x,y,u,vR for which xu and yv, we have

0f(t,x,y)f(t,u,v) 1 T φ ( x u + v y 2 ) ,

where φ:[0,)[0,) is continuous, non-decreasing and satisfies 0=φ(0)<φ(t)<t and lim r t + φ(r)<t for each t>0.

Next, we give the existence theorem for a unique solution of the integral equations (4.1).

Theorem 4.2 Suppose that ( 1 ) and ( 2 ) hold. Then the integral equations (4.1) have the unique solution ( x ˜ , y ˜ )C([0,T],R)×C([0,T],R) if there exists a coupled lower and upper solution for (4.1).

Proof Define the mapping F:C([0,T],R)×C([0,T],R)C([0,T],R) by

F(x,y)(t)= 0 T f ( t , x ( s ) , y ( s ) ) ds,x,yC ( [ 0 , T ] , R ) ,t[0,T].

Let M={(x,y,u,v) X 4 :x(t)u(t) and y(t)v(t) for all t[0,T]}. It is obvious that M is an F-invariant subset of X 4 which satisfies the transitive property. It is easy to see that (b) given in Theorem 3.1 is satisfied.

Next, we prove that F has a coupled fixed point ( x ˜ , y ˜ )C([0,T],R)×C([0,T],R).

Now, let (x,y,u,v)M. Using ( 2 ), for all t[0,T], we have

| F ( x , y ) ( t ) F ( u , v ) ( t ) | = 0 T [ f ( t , x ( s ) , y ( s ) ) f ( t , u ( s ) , v ( s ) ) ] d s 1 T 0 T φ ( x ( s ) u ( s ) + v ( s ) y ( s ) 2 ) d s 1 T 0 T φ ( sup z [ 0 , T ] | x ( z ) u ( z ) | + sup z [ 0 , T ] | y ( z ) v ( z ) | 2 ) d s = φ ( sup z [ 0 , T ] | x ( z ) u ( z ) | + sup z [ 0 , T ] | y ( z ) v ( z ) | 2 ) ,

which implies that

(4.2)

Therefore, we get

d ( F ( x , y ) , F ( u , v ) ) φ ( d ( x , u ) + d ( y , v ) 2 )

for all (x,y,u,v)M. This implies that the condition (3.1) of Theorem 3.1 is satisfied. Moreover, it is easy to see that there exists ( x 0 , y 0 )C([0,T],R)×C([0,T],R) such that (F( x 0 , y 0 ),F( y 0 , x 0 ), x 0 , y 0 )M and all conditions in Theorem 3.1 are satisfied. Therefore, we apply Theorem 3.1 and then we get the solution ( x ˜ , y ˜ )C([0,T],R)×C([0,T],R). □