1 Introduction and preliminaries

The well-known Banach contraction principle, which guarantees the existence of a unique fixed point for a mapping defined on a complete metric space satisfying the contraction condition, was introduced in 1922 by Banach [1]. After this a great deal of effort has gone into the theory and application of the Banach contraction theorem. Some authors generalized this theorem from the single-valued case to the multivalued [24]. Some extensions are to fixed point theorems for contraction mappings in generalized form of metric spaces, especially a metric space endowed with a partial order. Single, coupled, tripled and other types of fixed point theorems are investigated in many works, for instance, [59] and references cited therein. Such fixed point theorems are applied to establishing the existence of a unique solution to periodic boundary value problems, matrix equations, ordinary differential equations, and integral equations [1013]. Recently Pata in [14] introduced a fixed point theorem with weaker hypotheses than those of the Banach contraction principle with an explicit estimate of the convergence rate (see also [15]). Motivated by [16], we establish a new coupled fixed point theorem related to the Pata contraction for mappings having the mixed monotone property in partially ordered metric spaces. We prove that the coupled fixed point can be unique under some suitable conditions. Also the corresponding convergence rate is estimated when the iterates of our function converge to its coupled fixed point.

Definition 1.1 [16]

Let (X,) be a partially ordered set. The product space X×X can be endowed with a partial order such that for (x,y),(u,v)X×X we can define (u,v)(x,y)xu,yv.

Definition 1.2 [16]

Let (X,) be a partially ordered set and F:X×XX. We say that F has the mixed monotone property on X if F(x,y) is monotone non-decreasing in x and is monotone non-increasing in y, that is, for any x,yX,

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

Definition 1.3 [16]

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

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

2 Main results

In this section we prove a coupled type fixed point theorem with the convergence rate estimation. Also an example is given as an application of the main theorem.

Definition 2.1 Let (X,d) be a metric space. The mapping d ¯ : X 2 × X 2 [0,) given by

d ¯ [ ( x , y ) , ( u , v ) ] =d(x,u)+d(y,v),

for each pair ((x,y),(u,v)) X 2 × X 2 , defines a metric on X 2 × X 2 , which will be denoted for convenience by d, too.

For a metric space (X,d), selecting an arbitrary ( x 0 , y 0 )X×X, we denote

x,y=d [ ( x , y ) , ( x 0 , y 0 ) ] for all (x,y)X×X.

Let ψ:[0,1][0,) be an increasing function vanishing with continuity at zero. Also consider the vanishing sequence depending on α1, w n (α)= ( α n ) α k = 1 n ψ( α k ).

Theorem 2.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×XX be a continuous mapping having the mixed monotone property on X and let Λ0, α1, and β[0,α] be fixed constants. Suppose that there exist x 0 , y 0 X such that

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

If the inequality

d ( F ( x , y ) , F ( u , v ) ) ( 1 ε ) 2 d [ ( x , y ) , ( u , v ) ] +Λ ε α ψ(ε) [ 1 + x , y + u , v ] β
(2.1)

is satisfied for every ε[0,1] and (x,y),(u,v)X×X with ux, yv, then F has a coupled fixed point ( x , y ).

Furthermore, we denote F n =FF (n times),

d [ ( x , y ) , ( F n ( x 0 , y 0 ) , F n ( y 0 , x 0 ) ) ] K w n (α)
(2.2)

for some positive constant K2Λ ( 1 + 4 x , y + 4 d ( x 0 , y 0 ) ) β .

Proof Set F( x 0 , y 0 )= x 1 and F( y 0 , x 0 )= y 1 . So

x 1 x 0 , y 1 y 0 .

Now from letting x 2 =F( x 1 , y 1 ), y 2 =F( y 1 , x 1 ) and choosing the notations

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

with the mixed monotone property of F we have

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

So by continuing this argument we obtain two sequences { x n } n = 0 and { y n } n = 0 such that x 0 x 1 x n and y 0 y 1 y n  .

Furthermore for n=1,2, we set

x n = F ( x n 1 , y n 1 ) = F n ( x 0 , y 0 ) , y n = F ( y n 1 , x n 1 ) = F n ( y 0 , x 0 ) and C n = F n ( x 0 , y 0 ) , F n ( y 0 , x 0 ) .

Since (2.1) is true for every ε[0,1], setting ε=0 we have the following relations:

d [ ( F n + 1 ( x 0 , y 0 ) , F n + 1 ( y 0 , x 0 ) ) , ( F n ( x 0 , y 0 ) , F n ( y 0 , x 0 ) ) ] C 1 ,
(2.3)
d [ ( F n + 1 ( x 0 , y 0 ) , F n + 1 ( y 0 , x 0 ) ) , ( x 0 , y 0 ) ] d [ ( F n + 1 ( x 0 , y 0 ) , F n + 1 ( y 0 , x 0 ) ) , ( F ( x 0 , y 0 ) , F ( y 0 , x 0 ) ) ] + d [ ( F ( x 0 , y 0 ) , F ( y 0 , x 0 ) ) , ( x 0 , y 0 ) ] ,
(2.4)
d [ ( F n ( x 0 , y 0 ) , F n ( y 0 , x 0 ) ) , ( x 0 , y 0 ) ] d [ ( F n ( x 0 , y 0 ) , F n ( y 0 , x 0 ) ) , ( F n + 1 ( x 0 , y 0 ) , F n + 1 ( y 0 , x 0 ) ) ] + d [ ( F n + 1 ( x 0 , y 0 ) , F n + 1 ( y 0 , x 0 ) ) , ( x 0 , y 0 ) ] .
(2.5)

Using (2.5), (2.3), (2.4), and (2.1) we have

C n d [ ( F n + 1 ( x 0 , y 0 ) , F n + 1 ( y 0 , x 0 ) ) , ( F ( x 0 , y 0 ) , F ( y 0 , x 0 ) ) ] + 2 C 1 = d ( F n + 1 ( x 0 , y 0 ) , F ( x 0 , y 0 ) ) + d ( F n + 1 ( y 0 , x 0 ) , F ( y 0 , x 0 ) ) + 2 C 1 = d [ F ( F n ( x 0 , y 0 ) , F n ( y 0 , x 0 ) ) , F ( x 0 , y 0 ) ] + d [ F ( F n ( y 0 , x 0 ) , F n ( x 0 , y 0 ) ) , F ( y 0 , x 0 ) ] + 2 C 1 ( 1 ε ) 2 d [ ( F n ( x 0 , y 0 ) , F n ( y 0 , x 0 ) ) , ( x 0 , y 0 ) ] + Λ ε α ψ ( ε ) [ 1 + F n ( x 0 , y 0 ) , F n ( y 0 , x 0 ) + x 0 , y 0 ] β + ( 1 ε ) 2 d [ ( F n ( y 0 , x 0 ) , F n ( x 0 , y 0 ) ) , ( y 0 , x 0 ) ] + Λ ε α ψ ( ε ) [ 1 + F n ( y 0 , x 0 ) , F n ( x 0 , y 0 ) + y 0 , x 0 ] β + 2 C 1 .

But from the definition of we have

[ 1 + F n ( x 0 , y 0 ) , F n ( y 0 , x 0 ) + x 0 , y 0 ] 1 + C n 1 + C n + 4 d ( x 0 , y 0 ) , [ 1 + F n ( y 0 , x 0 ) , F n ( x 0 , y 0 ) + y 0 , x 0 ] 1 + C n + 4 d ( x 0 , y 0 ) ,

so for αβ there are some E,D>0 such that

C n ( 1 ε ) 2 C n + Λ ε α ψ ( ε ) [ 1 + C n + 4 d ( x 0 , y 0 ) ] β + ( 1 ε ) 2 C n + Λ ε α ψ ( ε ) [ 1 + C n + 4 d ( x 0 , y 0 ) ] β + 2 C 1 = ( 1 ε ) C n + 2 Λ ε α ψ ( ε ) [ 1 + C n + 4 d ( x 0 , y 0 ) ] β + 2 C 1 ( 1 ε ) C n + E ε α ψ ( ε ) C n α + D .

Accordingly,

ε C n E ε α ψ(ε) C n α +D,

which holds by hypothesis for any ε[0,1] taken for each nN. If there is a subsequence C n k , then the choice ε n k =min(1, 1 + D C n k ) leads to the following contradiction:

1E ( 1 + D ) α ψ( ε n k )0as  n k .

Then the sequence { C n } n = 1 is bounded. Also the sequences { F n ( x 0 , y 0 )} and { F n ( y 0 , x 0 )} are Cauchy sequences:

d ( F n + m + 1 ( x 0 , y 0 ) , F n + 1 ( x 0 , y 0 ) ) + d ( F n + m + 1 ( y 0 , x 0 ) , F n + 1 ( y 0 , x 0 ) ) = d ( F ( F n + m ( x 0 , y 0 ) , F n + m ( y 0 , x 0 ) ) , F ( F n ( x 0 , y 0 ) , F n ( y 0 , x 0 ) ) ) + d ( F ( F n + m ( y 0 , x 0 ) , F n + m ( x 0 , y 0 ) ) , F ( F n ( y 0 , x 0 ) , F n ( x 0 , y 0 ) ) ) ( 1 ε ) 2 d [ ( F n + m ( x 0 , y 0 ) , F n + m ( y 0 , x 0 ) ) , ( F n ( x 0 , y 0 ) , F n ( y 0 , x 0 ) ) ] + Λ ε α ψ ( ε ) [ 1 + F n + m ( x 0 , y 0 ) , F n + m ( y 0 , x 0 ) + F n ( x 0 , y 0 ) , F n ( y 0 , x 0 ) ] β + ( 1 ε ) 2 d [ ( F n + m ( y 0 , x 0 ) , F n + m ( x 0 , y 0 ) ) , ( F n ( y 0 , x 0 ) , F n ( x 0 , y 0 ) ) ] + Λ ε α ψ ( ε ) [ 1 + F n + m ( y 0 , x 0 ) , F n + m ( x 0 , y 0 ) + F n ( y 0 , x 0 ) , F n ( x 0 , y 0 ) ] β .

But since

F n + m ( x 0 , y 0 ) , F n + m ( y 0 , x 0 ) + F n ( x 0 , y 0 ) , F n ( y 0 , x 0 ) c n + m + c n c n + m + c n + 4 d ( x 0 , y 0 ) , F n + m ( y 0 , x 0 ) , F n + m ( x 0 , y 0 ) + F n ( y 0 , x 0 ) , F n ( x 0 , y 0 ) c n + m + c n + 4 d ( x 0 , y 0 ) ,

we have

d ( F n + m + 1 ( x 0 , y 0 ) , F n + 1 ( x 0 , y 0 ) ) + d ( F n + m + 1 ( y 0 , x 0 ) , F n + 1 ( y 0 , x 0 ) ) ( 1 ε ) ( d ( F n + m ( x 0 , y 0 ) , F n ( x 0 , y 0 ) ) + d ( F n + m ( y 0 , x 0 ) , F n ( y 0 , x 0 ) ) ) + 2 Λ ε α ψ ( ε ) [ 1 + c n + m + c n + 4 d ( x 0 , y 0 ) ] β .

For fixed m, set

K= sup n N 2Λ [ 1 + 2 c n + 4 d ( x 0 , y 0 ) ] β ,
(2.6)

and ε=1 ( n n + 1 ) α α n + 1 . So

( n + 1 ) α ( d ( F n + m + 1 ( x 0 , y 0 ) , F n + 1 ( x 0 , y 0 ) ) + d ( F n + m + 1 ( y 0 , x 0 ) , F n + 1 ( y 0 , x 0 ) ) ) n α ( d ( F n + m ( x 0 , y 0 ) , F n ( x 0 , y 0 ) ) + d ( F n + m ( y 0 , x 0 ) , F n ( y 0 , x 0 ) ) ) + K α α ψ ( α n + 1 ) .

Setting r n := n α [d( F n + m ( x 0 , y 0 ), F n ( x 0 , y 0 ))+d( F n + m ( y 0 , x 0 ), F n ( y 0 , x 0 ))] we have

r n + 1 r n + K α α ψ ( α n + 1 ) r n 1 + K α α ψ ( α n ) + K α α ψ ( α n + 1 ) r 0 + K α α k = 1 n + 1 ψ ( α k ) = K α α k = 1 n + 1 ψ ( α k ) .

Therefore

d ( F n + m ( x 0 , y 0 ) , F n ( x 0 , y 0 ) ) + d ( F n + m ( y 0 , x 0 ) , F n ( y 0 , x 0 ) ) K ( α n ) α k = 1 n ψ ( α k ) = K w n ( α ) .
(2.7)

Taking limits as n, we get d( F n + m ( x 0 , y 0 ), F n ( x 0 , y 0 ))+d( F n + m ( y 0 , x 0 ), F n ( y 0 , x 0 ))0. This implies that { F n ( x 0 , y 0 )} and { F n ( y 0 , x 0 )} are Cauchy sequences in X. Since X is a complete metric space, there are x , y X such that

lim n F n ( x 0 , y 0 )= lim n x n = x and lim m F m ( y 0 , x 0 )= lim m y m = y .

Using (2.7) and Definition 2.1 we have

lim n d [ ( x , y ) , ( F ( x n 1 , y n 1 ) , F ( y n 1 , x n 1 ) ) ] = lim n d [ ( x , y ) , ( F n ( x 0 , y 0 ) , F n ( y 0 , x 0 ) ) ] = lim n , m d [ ( F n + m ( x 0 , y 0 ) , F n + m ( y 0 , x 0 ) ) , ( F n ( x 0 , y 0 ) , F n ( y 0 , x 0 ) ) ] K w n ( α )

and from the continuity of F we have F( x , y )= x and F( y , x )= y . Also, the convergence rate estimate stated in (2.2) is obtained from the following relations:

d [ ( x , y ) , ( F n ( x 0 , y 0 ) , F n ( y 0 , x 0 ) ) ] = d [ ( F ( x , y ) , F ( y , x ) ) , ( F n ( x 0 , y 0 ) , F n ( y 0 , x 0 ) ) ] = d ( F ( x , y ) , F n ( x 0 , y 0 ) ) + d ( F ( y , x ) , F n ( y 0 , x 0 ) ) 1 / 2 d [ ( x , y ) , ( F n 1 ( x 0 , y 0 ) , F n 1 ( y 0 , x 0 ) ) ] + 1 / 2 d [ ( y , x ) , ( F n 1 ( y 0 , x 0 ) , F n 1 ( x 0 , y 0 ) ) ] = d [ ( x , y ) , ( F n 1 ( x 0 , y 0 ) , F n 1 ( y 0 , x 0 ) ) ] d [ ( x , y ) , ( x 0 , y 0 ) ] = x , y ,

which implies that

c n = d [ ( F n ( x 0 , y 0 ) , F n ( y 0 , x 0 ) ) , ( x 0 , y 0 ) ] d [ ( F n ( x 0 , y 0 ) , F n ( y 0 , x 0 ) ) , ( x , y ) ] + d [ ( x , y ) , ( x 0 , y 0 ) ] 2 x , y .

From the last inequality and (2.6) we have K2Λ [ 1 + 4 x , y + 4 d ( x 0 , y 0 ) ] β . □

Example 2.3 Let X=[2,2] and d:X×X[0,) be a metric on X defined as d(x,y)=|xy| for all x,yX which (X,d) is a complete metric space. Now consider X×X with the partial order defined in Definition 1.1. The metric on the product metric space X×X is defined by

d ( ( x 1 , y 1 ) , ( x 2 , y 2 ) ) =| x 1 x 2 |+| y 1 y 2 |,for all  x i , y i X(i=1,2).

Consider the mapping F defined as

F(x,y)=1,

for all fixed constants Λ0, α1, and β[0,α], and by using (2.1) we have

0 ( 1 ε ) 2 d [ ( x , y ) , ( u , v ) ] +Λ ε α ψ(ε) [ 1 + x , y + u , v ] β .

Since d[(x,y),(u,v)] and Λ ε α ψ(ε) [ 1 + x , y + u , v ] β are positive, we have ( 1 ε ) 2 0, which forces ε[0,1]. Also there exists (0,2)X×X such that 0F(0,2) and 2F(2,0). Thus F satisfies all conditions of Theorem 2.2. The pair (1,1) is the coupled fixed point for the mapping F.

3 Supplementary results

In this section we prove some supplementary results. The first theorem is about replacing the continuity condition of the function F in Theorem 2.2 with a new one. The second is about the uniqueness of the coupled fixed point. At last we show that the hypothesis of Theorem 2.2 is weaker than those of Theorem 2.1 in [16].

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 F:X×XX be a mapping having the mixed monotone property on X such that there are two elements x 0 , y 0 X with

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

Let Λ0, α1, and β[0,α] be fixed constants. Suppose that the inequality

d ( F ( x , y ) , F ( u , v ) ) ( 1 ε ) 2 d [ ( x , y ) , ( u , v ) ] +Λ ε α ψ(ε) [ 1 + x , y + u , v ] β
(3.1)

is satisfied for every ε[0,1] and (x,y),(u,v)X×X with ux, yv. Furthermore, suppose that X has the following properties:

  1. (i)

    for a non-decreasing sequence x n x, then x n x for all nN,

  2. (ii)

    for a non-increasing sequence y n y, then y n y for all nN.

Then F has a coupled fixed point ( x , y ).

Furthermore, calling F n =FF (n times), we have

d [ ( x , y ) , ( F n ( x 0 , y 0 ) , F n ( y 0 , x 0 ) ) ] K w n (α)
(3.2)

for some positive constant K2Λ ( 1 + 4 x , y + 4 d ( x 0 , y 0 ) ) β .

Proof We only need to prove that x =F( x , y ) and y =F( y , x ). Consider the following relations:

d [ ( x , y ) , ( F ( x , y ) , F ( y , x ) ) ] d [ ( x , y ) , ( F n + 1 ( x 0 , y 0 ) , F n + 1 ( y 0 , x 0 ) ) ] + d [ ( F n + 1 ( x 0 , y 0 ) , F n + 1 ( y 0 , x 0 ) ) , ( F ( x , y ) , F ( y , x ) ) ] = d [ ( x , y ) , ( F n + 1 ( x 0 , y 0 ) , F n + 1 ( y 0 , x 0 ) ) ] + d ( F ( F n ( x 0 , y 0 ) , F n ( y 0 , x 0 ) ) , F ( x , y ) ) + d ( F ( F n ( y 0 , x 0 ) , F n ( x 0 , y 0 ) ) , F ( y , x ) ) d [ ( x , y ) , ( F n + 1 ( x 0 , y 0 ) , F n + 1 ( y 0 , x 0 ) ) ] + ( 1 ε ) 2 d [ ( F n ( x 0 , y 0 ) , F n ( y 0 , x 0 ) ) , ( x , y ) ] + Λ ε α ψ ( ε ) [ 1 + F n ( x 0 , y 0 ) , F n ( y 0 , x 0 ) + x , y ] β + ( 1 ε ) 2 d [ ( F n ( y 0 , x 0 ) , F n ( x 0 , y 0 ) ) , ( y , x ) ] + Λ ε α ψ ( ε ) [ 1 + F n ( y 0 , x 0 ) , F n ( x 0 , y 0 ) + y , x ] β .

Now since

lim n F n ( x 0 , y 0 )= lim n x n = x and lim m F m ( y 0 , x 0 )= lim m y m = y ,

and since the contractive condition (3.1) holds for any real constant ε[0,1], we can replace ε, for each nN, by a sequence [0,1] ε n 0 as n. Then by letting ε= ε n 0 as n, we have d[( x , y ),(F( x , y ),F( y , x ))]=0. □

Definition 3.2 Suppose that X is a partially ordered metric space with a metric d. A pair of (x,y),( x , y )X×X has either a mid point lower bound or a mid point upper bound if there are ( z 1 , z 2 )X×X comparable to (x,y) and (u,v) such that d[(x,y),( z 1 , z 2 )]+d[( z 1 , z 2 ),( x , y )]=d[(x,y),( x , y )]. The space (X,d) has the mid point lower bound or the mid point upper bound property if any pair in X×X has a mid point lower bound or a mid point upper bound.

Theorem 3.3 Adding the condition of the above definition to the space (X,d) in the hypothesis of Theorem 3.1, we obtain the uniqueness of the coupled fixed point of F.

Proof If (x,y)X×X is another coupled fixed point of F where x=F(x,y), y=F(y,x), then we have two cases.

Case (1): If ( x , y ) is comparable to (x,y) then

d [ ( x , y ) , ( x , y ) ] = d [ ( F ( x , y ) , F ( y , x ) ) , ( F ( x , y ) , F ( y , x ) ) ] = d ( F ( x , y ) , F ( x , y ) ) + d ( F ( y , x ) , F ( y , x ) ) ( 1 ε ) 2 d [ ( x , y ) , ( x , y ) ] + t 1 ε ψ ( ε ) + ( 1 ε ) 2 d [ ( y , x ) , ( y , x ) ] + t 2 ε ψ ( ε ) ,

for some t 1 , t 2 >0. Putting t= t 1 + t 2 , we have

εd [ ( x , y ) , ( x , y ) ] εtψ(ε),

which is valid for every ε[0,1]. We can replace ε, for each nN, by a sequence [0,1] ε n 0 as n which forces d[(x,y),( x , y )]=0.

Case (2): If ( x , y ) is not comparable to (x,y) then there exists a mid upper bound or mid lower bound (u,v)X×X for ( x , y ) and (x,y). So (F(u,v),F(v,u)) is comparable to ( x , y )=(F( x , y ),F( y , x )) and (x,y)=(F(x,y),F(y,x)). It follows that

d [ ( x , y ) , ( x , y ) ] = d [ ( F ( x , y ) , F ( y , x ) ) , ( F ( x , y ) , F ( y , x ) ) ] d [ ( F ( x , y ) , F ( y , x ) ) , ( F ( u , v ) , F ( v , u ) ) ] + d [ ( F ( u , v ) , F ( v , u ) ) , ( F ( x , y ) , F ( y , x ) ) ] = d ( F ( x , y ) , F ( u , v ) ) + d ( F ( y , x ) , F ( v , u ) ) + d ( F ( u , v ) , F ( x , y ) ) + d ( F ( v , u ) , F ( y , x ) ) ( 1 ε ) 2 d [ ( x , y ) , ( u , v ) ] + t 1 ε ψ ( ε ) + ( 1 ε ) 2 d [ ( y , x ) , ( v , u ) ] + t 2 ε ψ ( ε ) + ( 1 ε ) 2 d [ ( u , v ) , ( x , y ) ] + t 3 ε ψ ( ε ) + ( 1 ε ) 2 d [ ( v , u ) , ( y , x ) ] + t 4 ε ψ ( ε ) ,

for some t 1 , t 2 , t 3 , t 4 >0. Set t= t 1 + t 2 + t 3 + t 4 . Hence,

d [ ( x , y ) , ( x , y ) ] (1ε) [ d ( x , u ) + d ( y , v ) + d ( u , x ) + d ( v , y ) ] +tεψ(ε).
(3.3)

Now by Definition 3.2 we have

εd [ ( x , y ) , ( x , y ) ] εtψ(ε)

for every ε[0,1]. We can replace ε, for each nN, by the sequence [0,1] ε n 0 as n, which forces d[(x,y),( x , y )]=0. □

Remark 3.4 Note that Theorem 2.2 is stronger than Theorem 2.1 in [16]. Indeed with the hypothesis of Theorem 2.1 in [16], for each (x,y),(u,v)X×X, we have

d ( F ( x , y ) , F ( u , v ) ) λ 2 d [ ( x , y ) , ( u , v ) ] for all xu,yv,0λ<1.

Thus for α=β=1, ψ(ε)=ε, and Λ=Λ(ν,λ)= ν ν ( 1 + ν ) 1 + ν ( 1 λ ) ν , for arbitrary ν>0, we get

d ( F ( x , y ) , F ( u , v ) ) ( 1 ε ) 2 d [ ( x , y ) , ( u , v ) ] +Λ ε 1 + ν [ 1 + x , y + u , v ] ,

for every ε[0,1].