Skip to main content

On almost contractions in partially ordered metric spaces via implicit relations

Abstract

In this paper, we prove general fixed point theorems for self-maps of a partially ordered complete metric space which satisfy an implicit type relation. Our method relies on constructive arguments involving Picard type iteration processes and our uniqueness result uses comparability arguments. Our results generalize a multitude of fixed point theorems in the literature to the context of partially ordered metric spaces.

1 Introduction

Fixed point theorems in nonlinear analysis have become indispensable tools in a vast area of the analysis ranging from proving the existence of solutions of certain partial differential equations to nonlinear optimization and related fields (see, for instance, [1]). Having their origin in the classical paper of Stefan Banach [2] as the ‘Banach Contraction Mapping Theorem’ (which is by now so classical that it appears in almost every book on Functional Analysis), fixed point theorems have attracted a lot of attention during the past five decades. This is mainly due to the fact that they have found many applications to the problems in applied mathematics such as boundary value problems in differential equations. The ‘Banach Contraction Mapping Theorem’ was generalized by many authors to mappings that satisfy much weaker conditions (see, for instance, [310]). Banach’s theorem was also extended to mappings which have an invariant subset that is finite, namely that have ‘periodic points’ [11, 12]. Another direction where the theorem was extended is for more than one mapping which have common fixed points [1315]. In recent years, Banach’s theorem was extended in part to partially ordered metric spaces by Ran and Reuring [16] in order to obtain a solution of a matrix equation. Nieto and López [17] generalized the result of Ran and Reuring by removing the continuity condition of the mapping. They applied their result to get a solution of a boundary value problem. The efficiency of these kind of extensions of fixed point theorems in such kind of problems, as it is well known, is due to the fact that most real valued function spaces are partially ordered metric spaces.

Alber and Guerre-Delabriere [18] introduced the notion of weak ϕ-contraction: A self-mapping T on a metric space X is called weak ϕ-contraction if ϕ:[0,)[0,) is a strictly increasing map with ϕ(0)=0 and

d(Tx,Ty)d(x,y)ϕ ( d ( x , y ) ) for all x,yX.

In fact, it is a generalization of Φ-contraction, introduced by Boyd and Wong [19]: A self-mapping T on a metric space X is called Φ-contraction if there exists an upper semi-continuous function Φ:[0,)[0,) such that

d(Tx,Ty)Φ ( d ( x , y ) ) for all x,yX.

We underline that for a lower semi-continuous mapping ϕ, the function Φ(u)=uϕ(u) coincides with Boyd and Wong types. These two notions, Φ-contraction and weak ϕ-contraction, have been studied heavily by many authors in fixed point theory (see, e.g., [2030]).

Our aim in this paper is to obtain fixed point theorems for mappings acting on partially ordered complete metric spaces which satisfy certain implicit relations. There are indeed fixed point theorems for mappings satisfying such kind of relation in the literature; however, all of these fixed point theorems are on complete metric spaces that are not partially ordered spaces. The novelty of this work lies in generalizing these fixed point theorems to partially ordered spaces.

Throughout this paper, (X,d,) denotes a partially ordered metric space where (X,) is a partially ordered set and (X,d) is a metric space for a given metric d on X. A partially ordered metric space (X,d,) is called regular, if for each convergent sequence { x n } n = 0 X, the following condition holds: either

  • if { x n } is a non-increasing sequence in X such that x n x implies x x n nN,

or

  • if { x n } is a non-decreasing sequence in X such that x n x implies x n x nN.

Let Φ be the class of all strictly increasing lower semi-continuous functions ϕ:[0,)[0,) with ϕ(0)=0. Let F denote the class of all implicit continuous functions F: ( R + ) 6 R. We shall consider the following subclasses of F:

( F 1 ) FF is non-increasing in the fifth variable, and F(u,v,v,u,u+v,0)0 for u,v>0 implies that there exists a function ϕΦ such that uvϕ(v).

( F 2 ) FF is non-increasing in the fifth variable, and F(u,v,v,u,u+v,0)0 for u,v>0k[0,1) such that ukv.

( F 3 ) FF is non-increasing in the fourth variable, and F(u,v,0,u+v,u,v)0 for u,v>0k[0,1) such that ukv.

( F 4 ) FF is non-increasing in the third variable, and F(u,v,u+v,0,v,u)0 for u,v>0k[0,1) such that ukv.

( F 5 ) FF such that F(u,u,0,0,u,u)>0 for all u>0.

See [31, 32] for examples of functions FF satisfying the above conditions F 1 - F 5 .

2 Main results

We start this section with the first main result.

Theorem 1 Let(X,d,)be a partially ordered metric space which is complete. Assume thatT:XXis a continuous map satisfyingxTxxX, and let T satisfy

F ( d ( T x , T y ) , d ( x , y ) , d ( x , T x ) , d ( y , T y ) , d ( x , T y ) , d ( y , T x ) ) 0for all xy,
(2.1)

whereF F 1 F 5 . Then T has a fixed point.

Proof Let x 0 X be arbitrary. Since T is non-decreasing, we have x 0 T x 0 . We define a sequence { x n } in X as follows:

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

Considering that T is a non-decreasing mapping together with (2.2), we have x 2 =T x 1 x 1 . Inductively, we obtain

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

Assume that there exists n 0 such that x n 0 = x n 0 + 1 . Since x n 0 = x n 0 + 1 =T x n 0 , then T has a fixed point which ends the proof. Suppose that x n x n + 1 for all nN. Thus, by (2.3), we have

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

Taking (2.1) into account, we derive that

F ( d ( x n , T x n ) , d ( x n 1 , x n ) , d ( x n 1 , x n ) , d ( x n , x n + 1 ) , d ( x n 1 , x n + 1 ) , 0 ) 0.
(2.5)

By the triangle inequality, we have

d( x n 1 , x n + 1 )d( x n , x n + 1 )+d( x n 1 , x n ).

Since F is non-increasing in the fifth variable, the inequality (2.5) turns into

F ( d ( x n , T x n ) , d ( x n 1 , x n ) , d ( x n 1 , x n ) , d ( x n , x n + 1 ) , d ( x n , x n + 1 ) + d ( x n 1 , x n ) , 0 ) 0,

and by using the property of F 1 , there exists a function ϕΦ such that

d ( x n , x n + 1 ) d ( x n , x n 1 ) ϕ ( d ( x n , x n 1 ) ) d ( x n , x n 1 ) ,
(2.6)

which implies that { d ( x n , x n + 1 ) } n = 0 is a non-increasing sequence of positive numbers. Hence, there exists L0 such that

lim n d( x n , x n + 1 )=L.
(2.7)

We shall show that L=0. Suppose, on the contrary, that L>0. Since ϕ is a lower semi-continuous function, we have

ϕ(L) lim inf n ϕ ( d ( x n , x n + 1 ) ) .

Letting n in (2.6), we derive that

LL lim inf n d( x n , x n + 1 )Lϕ(L),
(2.8)

which is possible only if ϕ(L)=0. It is a contradiction. Hence L=0, that is,

lim n d( x n , x n + 1 )=0.
(2.9)

We shall show that { x n } is a Cauchy sequence. Suppose, to the contrary, that { x n } is not a Cauchy sequence. This means that there also exists ε>0 for which we can find subsequence { x n ( k ) }, { x m ( k ) } of { x n } with n(k)>m(k)>k such that

d( x n ( k ) , x m ( k ) )ε.
(2.10)

We can choose n(k) corresponding to m(k) in a way that it is the smallest integer with n(k)>m(k)>k such that

d( x n ( k ) 1 , x m ( k ) )<ε.
(2.11)

By using the triangle inequality together with (2.11),

d ( x n ( k ) , x m ( k ) ) d ( x n ( k ) , x n ( k ) 1 ) + d ( x n ( k ) 1 , x m ( k ) ) d ( x n ( k ) , x n ( k ) 1 ) + ε .
(2.12)

Combining (2.12) and (2.10),

εd( x n ( k ) , x n ( k ) 1 )+ε.

Letting k in the inequality above together with (2.9), we derive that

(2.13)
(2.14)
(2.15)

Combining (2.14) and (2.15), we get

ε d ( x n ( k ) , x n ( k ) 1 ) d ( x m ( k ) 1 , x m ( k ) ) d ( x n ( k ) 1 , x m ( k ) 1 ) d ( x n ( k ) , x n ( k ) 1 ) + d ( x n ( k ) , x m ( k ) ) + d ( x m ( k ) 1 , x m ( k ) ) .
(2.16)

Letting k in (2.16) together with (2.9) and (2.13), we find that

lim k d( x n ( k ) 1 , x m ( k ) 1 )=ε.
(2.17)

On the other hand, by using the triangle inequality,

d( x n ( k ) 1 , x m ( k ) 1 )d( x n ( k ) , x n ( k ) 1 )+d( x n ( k ) , x m ( k ) 1 ),
(2.18)

which yields that

d( x n ( k ) 1 , x m ( k ) 1 )d( x n ( k ) , x n ( k ) 1 )d( x n ( k ) , x m ( k ) 1 )<ε.
(2.19)

Letting k in (2.19) together with (2.9) and (2.17), we obtain that

lim k d( x n ( k ) 1 , x m ( k ) )=ε.
(2.20)

Analogously, we have

lim k d( x n ( k ) , x m ( k ) 1 )=ε.
(2.21)

Since (2.3), we get

F ( d ( T x n ( k ) 1 , T x m ( k ) 1 ) , d ( x n ( k ) 1 , x m ( k ) 1 ) , d ( x n ( k ) 1 , T x n ( k ) 1 ) , d ( x m ( k ) 1 , T x m ( k ) 1 ) , d ( x n ( k ) 1 , T x m ( k ) 1 ) , d ( x m ( k ) 1 , T x n ( k ) 1 ) ) 0,

which is equivalent to

F ( d ( x n ( k ) , x m ( k ) ) , d ( x n ( k ) 1 , x m ( k ) 1 ) , d ( x n ( k ) 1 , x n ( k ) ) , d ( x m ( k ) 1 , x m ( k ) ) , d ( x n ( k ) 1 , x m ( k ) ) , d ( x m ( k ) 1 , x n ( k ) ) ) 0.
(2.22)

By continuity of F, letting k in (2.22), we get

F(ε,ε,0,0,ε,ε)0,
(2.23)

which contradicts F 5 . Hence, { x n } is a Cauchy sequence. Since X is a complete metric space, we have lim x n = x X. Since T is continuous,

x = lim n x n + 1 = lim n T x n =T ( lim n x n ) =T x .

 □

We remove the continuity condition of the mapping T in Theorem 1 by replacing the condition that X is regular.

Theorem 2 Let(X,d,)be a partially ordered metric space which is complete and regular. Assume thatT:XXis a non-decreasing map, and let T satisfy

F ( d ( T x , T y ) , d ( x , y ) , d ( x , T x ) , d ( y , T y ) , d ( x , T y ) , d ( y , T x ) ) 0for all xy,
(2.24)

whereF F 1 F 5 . Then T has a fixed point.

Proof Following the line in the proof of Theorem 1, we get a Cauchy sequence { x n } as it is defined above. Since X is a complete metric space, we have lim x n = x X. Since (X,d) is regular, we have x x n nN.

Hence, taking x:= x n and y:= x in equation (2.24), we have

F ( d ( T x n , T x ) , d ( x n , x ) , d ( x n , T x n ) , d ( x , T x ) , d ( x n , T x ) , d ( x , T x n ) ) 0

for all nN. Since F is continuous, letting n, we have

F ( d ( x , T x ) , 0 , 0 , d ( x , T x ) , d ( x , T x ) , 0 ) 0.

Hence, by F 5 , we have d( x ,T x )0, which implies that x =T x . □

We generalize the main result of Berinde [32] in the framework of partially ordered metric spaces.

Theorem 3 Let(X,d,)be a partially ordered metric space which is complete. Assume thatT:XXis a continuous map satisfyingxTxxX, and let T satisfy

F ( d ( T x , T y ) , d ( x , y ) , d ( x , T x ) , d ( y , T y ) , d ( x , T y ) , d ( y , T x ) ) 0for all xy,
(2.25)

whereF F 2 . Then

(p1) Fix(T);

(p2) for any x 0 X, the Picard iteration { x n } n = 0 converges to a fixed point x Xof T;

(p3) the following estimate holds:

d ( x n + i 1 , x ) k i 1 h d( x n , x n 1 ),n=0,1,2,,i=1,2,;

(p4) if additionallyF F 4 , then the rate of convergence of the Picard iteration is given by

d ( x n + 1 , x ) kd ( x n , x ) .

Proof Let x 0 X be arbitrary. Since T is non-decreasing, we have x 0 T x 0 . We define a sequence { x n } in X as follows:

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

Considering that T is a non-decreasing mapping together with (2.26), we have x 2 =T x 1 x 1 . Inductively, we obtain

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

Assume that there exists n 0 such that x n 0 = x n 0 + 1 . Since x n 0 = x n 0 + 1 =T x n 0 , then T has a fixed point which ends the proof. Suppose that x n x n + 1 for all nN. Thus, by (2.27), we have

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

Taking (2.25) into account, we derive that

F ( d ( x n , T x n ) , d ( x n 1 , x n ) , d ( x n 1 , x n ) , d ( x n , x n + 1 ) , d ( x n 1 , x n + 1 ) , 0 ) 0.
(2.29)

By the triangle inequality, we have

d( x n 1 , x n + 1 )d( x n , x n + 1 )+d( x n 1 , x n ).

Since F is non-increasing in the fifth variable, the inequality (2.29) turns into

F ( d ( x n , T x n ) , d ( x n 1 , x n ) , d ( x n 1 , x n ) , d ( x n , x n + 1 ) , d ( x n , x n + 1 ) + d ( x n 1 , x n ) , 0 ) 0,

and by F 2 , we have k[0,1) such that

d( x n , x n + 1 )kd( x n , x n 1 ),
(2.30)

which implies that { x n } n = 0 is a Cauchy sequence. Since X is a complete metric space, we have lim x n = x X. Since T is continuous,

x = lim n x n + 1 = lim n T x n =T ( lim n x n ) =T x

and this proves (p1).

(p2): follows by the proof of (p1).

(p3): follows by equation (2.30).

(p4): Taking x:= x n and y:= x in equation (2.25), we have

F ( d ( x n + 1 , T x ) , d ( x n , x ) , d ( x n , x n + 1 ) , 0 , d ( x n , T x ) , d ( x , x n + 1 ) ) 0.

By the triangle inequality, we have d( x n , x n + 1 )d( x n , x )+d( x , x n + 1 ), and hence by assumption F 3 , we have

F ( d ( x n + 1 , x ) , d ( x n , x ) , d ( x n , x ) + d ( x , x n + 1 ) , 0 , d ( x n , T x ) , d ( x , x n + 1 ) ) 0.

Again, by assumption F 3 , this implies that k[0,1) such that d( x n + 1 , x )kd( x n , x ). □

Remark 4 Let F 1 F such that F 1 ( t 1 , t 2 , t 3 , t 4 , t 5 , t 6 )= t 1 k t 2 where k[0,1). If we take F= F 1 in Theorem 3, then we get the main result of Ran and Reurings (Theorem 2.1 of [16]).

We get the same results by removing the continuity condition of the mapping T in Theorem 3 and by adding the condition that X is regular.

Theorem 5 Let(X,d,)be a partially ordered metric space which is complete and regular. Assume thatT:XXsatisfiesxTxxXand

F ( d ( T x , T y ) , d ( x , y ) , d ( x , T x ) , d ( y , T y ) , d ( x , T y ) , d ( y , T x ) ) 0for all xy,
(2.31)

whereF F 2 . Then

(p1) Fix(T);

(p2) for any x 0 X, the Picard iteration { x n } n = 0 converges to a fixed point x Xof T;

(p3) the following estimate holds:

d ( x n + i 1 , x ) k i 1 h d( x n , x n 1 ),n=0,1,2,,i=1,2,;

(p4) if additionallyF F 4 , then the rate of convergence of the Picard iteration is given by

d ( x n + 1 , x ) kd ( x n , x ) .

Proof Following the line in the proof of Theorem 3, we get a Cauchy sequence { x n } as it is defined above. Since X is a complete metric space, we have lim x n = x X. Since (X,d) is regular, we have x x n nN. Hence, taking x:= x n and y:= x in equation (2.31), we have

F ( d ( T x n , T x ) , d ( x n , x ) , d ( x n , T x n ) , d ( x , T x ) , d ( x n , T x ) , d ( x , T x n ) ) 0

for all nN. Since F is continuous, letting n, we have

F ( d ( x , T x ) , 0 , 0 , d ( x , T x ) , d ( x , T x ) , 0 ) 0.

Hence, by F 2 , we have d( x ,T x )0, which implies that x =T x and this proves (p1).

The rest of the proof is the same as the proof of Theorem 3. □

Remark 6 Let F 1 F such that F 1 ( t 1 , t 2 , t 3 , t 4 , t 5 , t 6 )= t 1 k t 2 where k[0,1). If we take F= F 1 in Theorem 5, then we get the main result of Nieto and Rodríguez-López (Theorem 2.2 of [17]).

Remark 7 If we take ϕ(t)=kt in Theorem 1 (respectively, Theorem 2) where k[0,1) we get (p1) of Theorem 3 (respectively, Theorem 5).

3 Uniqueness of a fixed point

In this section, we investigate the uniqueness of fixed points in the theorems above. In order to assure the uniqueness of fixed points, we need the following notion on the partially ordered metric space (X,) which is called the comparability condition:

(C) For every x,yX, there exists zX such that either xz and yz or zx and zy.

We also require the following condition:

( F 6 ) FF is non-increasing in the fourth variable and such that F(u,v,0,u+v,u,v)0 for all u,v>0.

Adding condition (C) and F 6 to the hypotheses of Theorem 1, we obtain the uniqueness of the fixed point:

Theorem 8 Let(X,d,)be a partially ordered metric space which is complete and which satisfies (C). Assume thatT:XXis a continuous map satisfyingxTxxX, and let T satisfy

F ( d ( T x , T y ) , d ( x , y ) , d ( x , T x ) , d ( y , T y ) , d ( x , T y ) , d ( y , T x ) ) 0for all xy,
(3.1)

whereF F 1 F 5 F 6 . Then T has a unique fixed point.

Proof Due to Theorem 1, we guarantee that T has a fixed point. Suppose x and y are fixed points of T with xy.

We need to examine two cases:

Case (i): If x and y are comparable, then

F ( d ( T x , T y ) , d ( x , y ) , d ( x , T x ) , d ( y , T y ) , d ( x , T y ) , d ( y , T x ) ) 0for all xy,
(3.2)

which is equivalent to

F ( d ( x , y ) , d ( x , y ) , 0 , 0 , d ( x , y ) , d ( x , y ) ) 0,
(3.3)

which contradicts F 5 . Hence x=y.

Case (ii): If x and y are not comparable, then by (C) there exists z such that xz and yz. Then

F ( d ( T x , T z ) , d ( x , z ) , d ( x , T x ) , d ( z , T z ) , d ( z , T x ) , d ( x , T z ) ) 0for all zx,
(3.4)

which is equivalent to

F ( d ( x , T z ) , d ( x , z ) , 0 , d ( z , T z ) , d ( x , z ) , d ( x , T z ) ) 0.
(3.5)

By F 6 , F is non-increasing in the fourth variable, and hence we have

F ( d ( x , T z ) , d ( x , z ) , 0 , d ( z , x ) + d ( x , T z ) , d ( x , T z ) , d ( z , x ) ) 0,
(3.6)

which contradicts F 6 . Hence, we have x=y. □

Adding condition (C) and F 6 to the hypotheses of Theorem 2, we obtain the uniqueness of the fixed point.

Theorem 9 Let(X,d,)be a partially ordered metric space which is complete and regular. Let(X,d,)also satisfy condition (C). Assume thatT:XXsatisfiesxTxxXand

F ( d ( T x , T y ) , d ( x , y ) , d ( x , T x ) , d ( y , T y ) , d ( x , T y ) , d ( y , T x ) ) 0for all xy,
(3.7)

whereF F 1 F 5 F 6 . Then T has a unique fixed point.

Proof The proof is the same as the proof of Theorem 8. □

Adding condition (C) to the hypotheses of Theorem 3, we obtain the uniqueness of the fixed point:

Theorem 10 Let(X,d,)be a partially ordered metric space which is complete. Let(X,d,)also satisfy condition (C). Assume thatT:XXis a continuous non-decreasing map, i.e., xTxxX, and let T satisfy

F ( d ( T x , T y ) , d ( x , y ) , d ( x , T x ) , d ( y , T y ) , d ( x , T y ) , d ( y , T x ) ) 0for all xy,
(3.8)

whereF F 2 F 6 . Then

(p1) T has a unique fixed point;

(p2) for any x 0 X, the Picard iteration { x n } n = 0 converges to a fixed point x Xof T;

(p3) the following estimate holds:

d ( x n + i 1 , x ) k i 1 h d( x n , x n 1 ),n=0,1,2,,i=1,2,;

(p4) if additionallyF F 4 , then the rate of convergence of the Picard iteration is given by

d ( x n + 1 , x ) kd ( x n , x ) .

Proof The proof is the same as the proof of Theorem 8. □

Adding condition (C) and F 6 to the hypotheses of Theorem 5, we obtain the uniqueness of a fixed point:

Theorem 11 Let(X,d,)be a partially ordered metric space which is complete and regular. Let(X,d,)also satisfy condition (C). Assume thatT:XXsatisfiesxTxxXand

F ( d ( T x , T y ) , d ( x , y ) , d ( x , T x ) , d ( y , T y ) , d ( x , T y ) , d ( y , T x ) ) 0for all xy,
(3.9)

whereF F 2 F 6 . Then

(p1) T has a unique fixed point;

(p2) for any x 0 X, the Picard iteration { x n } n = 0 converges to a fixed point x Xof T;

(p3) the following estimate holds:

d ( x n + i 1 , x ) k i 1 h d( x n , x n 1 ),n=0,1,2,,i=1,2,;

(p4) if additionallyF F 4 then the rate of convergence of the Picard iteration is given by

d ( x n + 1 , x ) kd ( x n , x ) .

Proof The proof is the same as the proof of Theorem 8. □

References

  1. Cherichi M, Samet B: Fixed point theorems on ordered gauge spaces with applications to nonlinear integral equations. Fixed Point Theory Appl. 2012., 2012: Article ID 13

    Google Scholar 

  2. Banach S: Sur les operations dans les ensembles abstraits et leur application aux equations integrales. Fundam. Math. 1922, 3: 133–181.

    MATH  Google Scholar 

  3. Hardy GC, Rogers T: A generalization of fixed point theorem of Reich. Can. Math. Bull. 1973, 16: 201–206. 10.4153/CMB-1973-036-0

    Article  MathSciNet  MATH  Google Scholar 

  4. Kannan R: Some results on fixed points - II. Am. Math. Mon. 1969, 76: 71–76.

    Article  MathSciNet  MATH  Google Scholar 

  5. Reich S: Some remarks concerning contraction mappings. Can. Math. Bull. 1971, 14: 121–124. 10.4153/CMB-1971-024-9

    Article  MathSciNet  MATH  Google Scholar 

  6. Chu SC, Diaz JB: Remarks on a generalization of Banach’s mappings. J. Math. Anal. Appl. 1965, 11: 440–446.

    Article  MathSciNet  MATH  Google Scholar 

  7. Bonsall FF: Lectures on Some Fixed Point Theorems of Functional Analysis. Tata Institute of Fundamental Research, Bombay; 1962.

    Google Scholar 

  8. Smart DR: Fixed Point Theorems. Cambridge University Press, Cambridge; 1974.

    MATH  Google Scholar 

  9. Sehgal VM: A fixed point theorem for mappings with a contractive iterate. Proc. Am. Math. Soc. 1969, 23: 631–634. 10.1090/S0002-9939-1969-0250292-X

    Article  MathSciNet  MATH  Google Scholar 

  10. Reich S: Kannan’s fixed point theorem. Boll. Unione Mat. Ital. 1971, 4: 1–11.

    MATH  Google Scholar 

  11. Edelstein M: On fixed points and periodic points under contraction mappings. J. Lond. Math. Soc. 1962, 37: 74–79. 10.1112/jlms/s1-37.1.74

    Article  MathSciNet  MATH  Google Scholar 

  12. Holmes RD: On fixed and periodic points under sets of mappings. Can. Math. Bull. 1969, 12: 813–822. 10.4153/CMB-1969-106-1

    Article  MathSciNet  MATH  Google Scholar 

  13. Nadler SB Jr.: Sequences of contractions and fixed points. Pac. J. Math. 1968, 27: 579–585. 10.2140/pjm.1968.27.579

    Article  MathSciNet  MATH  Google Scholar 

  14. Wong CS: Common fixed points of two mappings. Pac. J. Math. 1973, 48: 299–312. 10.2140/pjm.1973.48.299

    Article  MathSciNet  MATH  Google Scholar 

  15. Samet B: Coupled fixed point theorems for a generalized Meir-Keeler contraction in partially ordered metric spaces. Nonlinear Anal. 2010, 72: 4508–4517. 10.1016/j.na.2010.02.026

    Article  MathSciNet  MATH  Google Scholar 

  16. 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-4

    Article  MathSciNet  MATH  Google Scholar 

  17. Nieto JJ, Rodríguez-López R: Contractive mapping theorems in partially ordered sets and applications to ordinary differential equations. Order 2005, 22(3):223–239. 10.1007/s11083-005-9018-5

    Article  MathSciNet  MATH  Google Scholar 

  18. Alber YI, Guerre-Delabriere S: Principle of weakly contractive maps in Hilbert space. 98. In New Results in Operator Theory, Advances and Its Applications. Edited by: Gohberg I, Lyubich Y. Birkhäuser, Basel; 1997:7–22.

    Chapter  Google Scholar 

  19. Boyd DW, Wong SW: On nonlinear contractions. Proc. Am. Math. Soc. 1969, 20: 458–464. 10.1090/S0002-9939-1969-0239559-9

    Article  MathSciNet  MATH  Google Scholar 

  20. Karapınar E: Fixed point theory for cyclic weak ϕ -contraction. Appl. Math. Lett. 2011, 24: 822–825. 10.1016/j.aml.2010.12.016

    Article  MathSciNet  MATH  Google Scholar 

  21. Kirk WA, Srinavasan PS, Veeramani P: Fixed points for mapping satisfying cyclical contractive conditions. Fixed Point Theory 2003, 4: 79–89.

    MathSciNet  MATH  Google Scholar 

  22. Petruşel G: Cyclic representations and periodic points. Stud. Univ. Babeş-Bolyai, Math. 2005, L(3):107–112.

    MathSciNet  MATH  Google Scholar 

  23. Rus IA: Cyclic representations and fixed points. Ann. T. Popoviciu Semin. Funct. Equ. Approx. Convexity 2005, 3: 171–178.

    Google Scholar 

  24. Rhoades BE: Some theorems on weakly contractive maps. Nonlinear Anal. 2001, 47(4):2683–2693. 10.1016/S0362-546X(01)00388-1

    Article  MathSciNet  MATH  Google Scholar 

  25. Păcurar M, Rus IA: Fixed point theory for cyclic φ -contractions. Nonlinear Anal. 2010, 72(3–4):1181–1187. 10.1016/j.na.2009.08.002

    Article  MathSciNet  MATH  Google Scholar 

  26. Hussain N, Jungck G:Common fixed point and invariant approximation results for noncommuting generalized (f,g)-nonexpansive maps. J. Math. Anal. Appl. 2006, 321: 851–861. 10.1016/j.jmaa.2005.08.045

    Article  MathSciNet  MATH  Google Scholar 

  27. Song Y: Coincidence points for noncommuting f -weakly contractive mappings. Int. J. Comput. Appl. Math. 2007, 2(1):51–57.

    MathSciNet  MATH  Google Scholar 

  28. Song Y, Xu S: A note on common fixed-points for Banach operator pairs. Int. J. Contemp. Math. Sci. 2007, 2: 1163–1166.

    MathSciNet  MATH  Google Scholar 

  29. Zhang Q, Song Y: Fixed point theory for generalized φ -weak contractions. Appl. Math. Lett. 2009, 22(1):75–78. 10.1016/j.aml.2008.02.007

    Article  MathSciNet  MATH  Google Scholar 

  30. Abdeljawad T, Karapınar E: Quasi-cone metric spaces and generalizations of Caristi Kirk’s theorem. Fixed Point Theory Appl. 2009. doi:10.1155/2009/574387

    Google Scholar 

  31. Berinde V 22. In Contractii generalizate si aplicatii. Editura Cub Press, Baia Mare; 2007.

    Google Scholar 

  32. Berinde V: Approximating fixed point of almost contractions. Hacet. J. Math. Stat. 2012, 41(1):93–102.

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors would like to thank the referees for their valuable suggestions on improving the text.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Uğur Gül.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

Both authors contributed equally to the paper.

Rights and permissions

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

Reprints and permissions

About this article

Cite this article

Gül, U., Karapınar, E. On almost contractions in partially ordered metric spaces via implicit relations. J Inequal Appl 2012, 217 (2012). https://doi.org/10.1186/1029-242X-2012-217

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1186/1029-242X-2012-217

Keywords