Skip to main content

Generalized contractions in metric spaces endowed with a graph

Abstract

A very interesting approach in the theory of fixed points in some general structures was recently given by Jachymski (Proc. Amer. Math. Soc. 136:1359-1373, 2008) and Gwóźdź-Lukawska and Jachymski (J. Math. Anal. Appl. 356:453-463, 2009) by using the context of metric spaces endowed with a graph. The purpose of this article is to present some new fixed point results for graphic contractions and for Ćirić-Reich-Rus G-contractions on complete metric spaces endowed with a graph. The particular case of almost contractions is also considered.

MSC:47H10, 54H25.

1 Introduction

A very interesting approach in the theory of fixed points in some general structures was recently given by Jachymski [1] and Gwóźdź-Lukawska and Jachymski [2] by using the context of metric spaces endowed with a graph. More precisely, let (X,d) be a metric space and Δ be the diagonal of X×X. Let G be a directed graph such that the set V(G) of its vertices coincides with X and ΔE(G), where E(G) is the set of edges of the graph. Assume also that G has no parallel edges, and thus, one can identify G with the pair (V(G),E(G)).

By definition, an operator f:XX is called a Banach G-contraction (see Definition 2.1 in Jachymski [1]) if and only if:

  1. (a)

    for each x,yX with (x,y)E(G), we have (f(x),f(y))E(G);

  2. (b)

    there exists α]0,1[ such that for each x,yX, the following implication holds: ((x,y)E(G) implies d(f(x),f(y))αd(x,y)).

If x and y are vertices of G, then a path in G from x to y of length kN is a finite sequence ( x n ) n { 0 , 1 , 2 , , k } of vertices such that x 0 =x, x k =y and ( x i 1 , x i )E(G) for i{1,2,,k}. Notice that a graph G is connected if there is a path between any two vertices, and it is weakly connected if G ˜ is connected, where G ˜ denotes the undirected graph obtained from G by ignoring the direction of edges.

Denote by G 1 the graph obtained from G by reversing the direction of edges. Thus,

Since it is more convenient to treat G ˜ as a directed graph for which the set of its edges is symmetric, under this convention, we have that

If G is such that E(G) is symmetric, then for xV(G), the symbol [ x ] G denotes the equivalence class of the relation defined on V(G) by the rule

yz if there is a path in G from y to z.

Recall that if f:XX is an operator, then by

F f := { x X : x = f ( x ) }

we denote the set of all fixed points of f. Denote also

X f := { x X : ( x , f ( x ) ) E ( G ) } .

The operator f:XX is called orbitally continuous if for all x,aX, for any sequence ( n ( i ) ) i N of positive integers,

lim i f n ( i ) (x)=aimplies lim i f ( f n ( i ) ( x ) ) =f(a).

One of the main results in Jachymski [1] is Theorem 3.2. We present here (partially) this result. In this theorem, as well as in other results of this type, one uses the following property:

(P)

Theorem 1.3 (Jachymski [1])

Let (X,d) be a complete metric space, and let G be a directed graph such that V(G)=X, ΔE(G) and the triple (X,d,G) has the property (P). Let f:XX be a G-contraction. Then the following statements hold:

  1. (1)

    F f if and only if X f ;

  2. (2)

    if X f and G is weakly connected, then f is a Picard operator, i.e., F f ={ x } and ( f n ( x ) ) n N x as n for all xX;

  3. (3)

    for any x X f , we have that f | [ x ] G ˜ is a Picard operator;

  4. (4)

    if fE(G), then f is a weakly Picard operator, i.e., F f and, for each xX, we have ( f n ( x ) ) n N x (x) F f as n.

The purpose of this paper is to extend the above result to the case of some generalized contractions. More precisely, the cases of Ćirić-Reich-Rus G-contractions, G-graphic contractions and of G-almost contractions in the sense of Berinde will be considered. As one can see from the recent literature (see [36]), these classes of operators are important extensions of the classical contraction mapping.

Our results also generalize and extend some fixed point theorems in partially ordered complete metric spaces given in Harjani and Sadarangani [7], Nicolae, O’Regan and Petruşel [8], Nieto and Rodríguez-López [9] and [10], Agarwal, El-Gebeily and O’Regan [16], Nieto, Pouso and Rodríguez-López [11], O’Regan and Petruşel [12], Petruşel and Rus [13], and Ran and Reurings [14].

2 Main results

Let G be a directed graph. Throughout this section, we will suppose that the graph G satisfies the following standard conditions: the set V(G) of its vertices coincides with X, E(G) is the set of edges of the graph, and Δ (the diagonal of X×X) is a subset of E(G). We also denote

X f := { x X : ( x , f ( x ) ) E ( G )  or  ( f ( x ) , x ) E ( G ) } .

Definition 2.1 The mapping f:XX is a G-graphic contraction if:

  1. (1)

    f is edge preserving, i.e., (x,y)E(G) implies (f(x),f(y))E(G);

  2. (2)

    there exists a[0,1[ such that

    d ( f ( x ) , f 2 ( x ) ) ad ( x , f ( x ) ) for all x X f .

Lemma 2.1 Let (X,d) be a metric space endowed with a graph G satisfying the above standard conditions. Let f:XX be a G-graphic contraction. Then f is a G 1 -graphic contraction too.

Proof Suppose that f:XX is a G-graphic contraction. We have to prove that f:XX is a G 1 -graphic contraction, i.e.,

  1. (1)

    (x,y)E( G 1 ) implies (f(x),f(y))E( G 1 );

(indeed, (x,y)E( G 1 ) implies (y,x)E(G). Thus, (f(y),f(x))E(G) and hence (f(x),f(y))E( G 1 ).

  1. (2)

    there exists a[0,1[ such that d(f(x), f 2 (x))ad(x,f(x)) for all xX with (x,f(x))E( G 1 ) or (f(x),x)E( G 1 ).

(indeed, let xX such that (x,f(x))E( G 1 ) or (f(x),x)E( G 1 ). Then (f(x),x)E(G) or (x,f(x))E(G). In both cases, we get, by the G-graphic contraction condition, that there exists a[0,1[ such that d(f(x), f 2 (x))ad(x,f(x)). □

Notice now the fact that a G-graphic contraction is also a G ˜ -graphic contraction. This follows by (), (), the symmetry of the metric d and the above lemma.

Definition 2.2 The operator f:XX is called a Ćirić-Reich-Rus G-contraction if and only if:

  1. (a)

    f is edge preserving, i.e. for each x,yX with (x,y)E(G) we have that (f(x),f(y))E(G);

  2. (b)

    there exists α,β,γ R + with α+β+γ]0,1[ such that for each x,yX, we have ((x,y)E(G) implies d(f(x),f(y))αd(x,y)+βd(x,f(x))+γd(y,f(y))).

In particular, if β=γ=0, then we get the concept of Banach G-contraction presented in the first section.

A similar result to the above one (see Lemma 2.1) is the following.

Lemma 2.2 Let (X,d) be a metric space endowed with a graph G satisfying the standard conditions mentioned at the beginning of this section. Let f:XX be a Ćirić-Reich-Rus G-contraction. Then f is a Ćirić-Reich-Rus G 1 -contraction too.

Notice also that a Ćirić-Reich-Rus G-contraction is a Ćirić-Reich-Rus G ˜ -contraction.

Now, we can prove the main results of this paper. We first present some auxiliary results.

Lemma 2.3 Let (X,d) be a metric space endowed with a graph G satisfying the above standard conditions. Let f:XX be a G-graphic contraction with the constant a. Then, given x X f , there exists r(x)0 such that

d ( f n ( x ) , f n + 1 ( x ) ) a n r(x), for all nN.

Proof Let x X f , i.e., (x,f(x))E(G) or (f(x),x)E(G). If (x,f(x))E(G), then by induction, we have that ( f n (x), f n + 1 (x))E(G) for each nN. Thus

d ( f n ( x ) , f n + 1 ( x ) ) ad ( f n 1 ( x ) , f n ( x ) ) a n d ( x , f ( x ) ) := a n r(x).

If (f(x),x)E(G), again by induction, we have that ( f n + 1 (x), f n (x))E(G) for each nN. Thus

d ( f n ( x ) , f n + 1 ( x ) ) ad ( f n 1 ( x ) , f n ( x ) ) a n d ( x , f ( x ) ) := a n r(x).

 □

Lemma 2.4 Let (X,d) be a complete metric space endowed with a graph G satisfying the above standard conditions. Suppose that f:XX is a G-graphic contraction. Then for each x X f , there exists x (x)X such that the sequence ( f n ( x ) ) n N converges to x (x) as n+.

Proof Let x X f . By Lemma 2.3, we get that

d ( f n ( x ) , f n + 1 ( x ) ) a n r(x),for all nN,

where r(x):=d(x,f(x)). Hence n 0 d( f n (x), f n + 1 (x))<, proving by a standard argument that the sequence ( f n ( x ) ) n N is Cauchy. Since the space X is complete with respect to d, we get that there exists x (x)X such that the sequence ( f n ( x ) ) n N converges to x (x) as n+. □

The next result is also important.

Lemma 2.5 Let (X,d) be a metric space endowed with a graph G satisfying the above standard conditions. Let f:XX be a G-graphic contraction for which there exists x 0 X such that f( x 0 ) [ x 0 ] G ˜ . Then the set [ x 0 ] G ˜ is invariant with respect to f and f | [ x 0 ] G ˜ is a G ˜ x 0 -graphic contraction, where G ˜ x 0 is the component of G ˜ containing x 0 .

Proof Let x [ x 0 ] G ˜ . Then there exist ( x 0 , x 1 ,, x k 1 , x k =x) which form a path between x 0 and x in G ˜ , i.e., ( x i , x i + 1 )E( G ˜ ) for i{0,,k1}. Since f is a G ˜ -graphic contraction (thus edge preserving), we get that (f( x i ),f( x i + 1 ))E( G ˜ ) for i{0,,k1}, i.e., we have a path from f( x 0 ) to f(x). Hence f(x) [ f ( x 0 ) ] G ˜ = [ x 0 ] G ˜ since f( x 0 ) [ x 0 ] G ˜ . Thus, the set [ x 0 ] G ˜ is invariant with respect to f.

Let (x,y)E( G ˜ x 0 ). Then there is a path from x 0 to y passing through x, i.e., ( x 0 , x 1 ,, x k 1 =x, x k =y) and ( x i , x i + 1 )E( G ˜ ) for i{0,,k1}. As before, by the edge preserving condition, we get that (f( x i ),f( x i + 1 ))E( G ˜ ) for i{0,,k1}. Let ( y 0 , y 1 ,, y l 1 , y l ) be a path between x 0 and f x 0 . Thus

( x 0 = y 0 , y 1 , , y l = f ( x 0 ) , f ( x 1 ) , , f ( x k 1 ) = f ( x ) , f ( x k ) = f ( y ) )

is a path in G ˜ from x 0 to f(y) such that (f(x),f(y))E( G x 0 ˜ ). Moreover, f is a G ˜ x 0 -graphic contraction since E( G ˜ x 0 )E( G ˜ ), and f is a G ˜ -graphic contraction. □

For our next result, we need the following definition.

Definition 2.3 Let (X,d) be a metric space endowed with a graph G satisfying the above standard conditions. The operator f:XX is called orbitally G-continuous if, for all x,aX and for any sequence ( n ( i ) ) i N of positive integers,

lim i f n ( i ) (x)=a, ( f n ( i ) ( x ) , f n ( i ) + 1 ( x ) ) E(G),iN lim i f ( f n ( i ) ( x ) ) =f(a).

We can now give the main result for G-graphic contractions. We will make use of the property (P) introduced in Section 1.

Theorem 2.1 Let (X,d) be a complete metric space and G be a directed graph satisfying the above standard conditions such that the triple (X,d,G) satisfies the property (P). Let f:XX be a G-graphic contraction which is G-orbitally continuous. Then the following statements hold:

  1. (1)

    F f if and only if X f ;

  2. (2)

    if X f and G is weakly connected, then f is a weakly Picard operator;

  3. (3)

    for any x X f , we have that f | [ x ] G ˜ is a weakly Picard operator.

Proof We start by proving statement (3). Let x X f . Applying Lemma 2.3, we have that there exists r(x)0 such that

d ( f n ( x ) , f n + 1 ( x ) ) a n r(x),for all nN.

This yields, as in the proof of Lemma 2.4, that there exists x (x)X such that lim n f n (x)= x (x). Because x X f , condition (1) in Definition 2.1 implies that f n (x) X f for every nN. Suppose now, for example, that (x,f(x))E(G). (A similar deduction can be made if (f(x),x)E(G).) Using the property (P), we can find a subsequence ( f k n ( x ) ) n N of ( f n ( x ) ) n N such that ( f k n (x), x (x))E(G) for each nN. Then the points x,f(x),, f k 1 (x), x (x) form a path in G, and thus x (x) [ x ] G ˜ . Since f is G-orbitally continuous, we obtain that x (x) is a fixed point for f | [ x ] G ˜ .

For (1), notice that from (3) it follows that F f if X f . Suppose F f . Since we work under the assumption that ΔE(G), we immediately get that X f . Hence, (1) also holds.

To prove (2), let x X f . Because G is weakly connected, we have that X= [ x ] G ˜ and we only need to apply (3). □

Remark 2.1 In the above result, we can remove the condition that the triple (X,d,G) satisfies the property (P) and f is G-orbitally continuous if we assume that the mapping f is orbitally continuous.

Remark 2.2 If we relax the definition of the G-graphic contraction, by replacing the condition

  1. (1)

    f is edge preserving, i.e., (x,y)E(G) implies (f(x),f(y))E(G)

with

(1) (x,f(x))E(G) implies (f(x), f 2 (x))E(G),

then part of the above results take place. More precisely, we do not know if a similar result to Lemma 2.5 takes place.

The following example shows that our result is a non-trivial extension of the above mentioned papers.

Example 2.1 Let X=[0,1] be endowed with the usual distance. Consider

E(G)= { ( 0 , 0 ) } { ( 0 , x ) : x 1 / 2 } { ( x , y ) : x , y ( 0 , 1 ] } ,

and f:XX,

f(x)={ x / 2 , if  x ( 0 , 1 ) , 3 / 4 , if  x = 0 , 1 , if  x = 1 .

Then G is weakly connected, X f is nonempty and f is a G-graphic contraction which fails to be a G-contraction. Moreover, Fix(f)={1}.

Proof It can be easily checked that G is weakly connected and f is edge preserving. To see that f is not a G-contraction, notice that |f(0)f(1/2)|=1/2=|01/2|. A simple case-by-case calculation shows that f is a G-graphic contraction. Moreover, Fix(f)={1}. □

We will consider next the case of almost contractions; see Berinde [3]. See also Păcurar [15] for a detailed and comprehensive study of almost contractions.

Definition 2.4 The mapping f:XX is a G-almost contraction if:

  1. (1)

    f is edge preserving, i.e., (x,y)E(G) implies (f(x),f(y))E(G);

  2. (2)

    there exists α]0,1[ and L0 such that for each x,yX the following implication holds:

    (x,y)E(G)impliesd ( f ( x ) , f ( y ) ) ad(x,y)+Ld ( y , f ( x ) ) .

Notice that if f is a G-almost contraction, then f is a G-graphic contraction with the constant a[0,1[. Thus all the above results take place.

We will consider now the case of Ćirić-Reich-Rus G-contractions.

Lemma 2.6 Let (X,d) be a metric space endowed with a graph G satisfying the above standard conditions. Let f:XX be a Ćirić-Reich-Rus G-contraction with constants α, β, γ. Then, given x X f , there exists r(x)0 such that

d ( f n ( x ) , f n + 1 ( x ) ) a n r(x), for all nN,

where a:= α + β 1 γ .

Proof Let x X f , i.e., (x,f(x))E(G) or (f(x),x)E(G). If (x,f(x))E(G), then by induction, we have that ( f n (x), f n + 1 (x))E(G) for each nN. Hence

d ( f n ( x ) , f n + 1 ( x ) ) αd ( f n 1 ( x ) , f n ( x ) ) +βd ( f n 1 ( x ) , f n ( x ) ) +γd ( f n ( x ) , f n + 1 ( x ) ) .

Thus, we get that

d ( f n ( x ) , f n + 1 ( x ) ) α + β 1 γ d ( f n 1 ( x ) , f n ( x ) ) a n d ( x , f ( x ) ) := a n r(x).

If (f(x),x)E(G), again by induction, we have that ( f n + 1 (x), f n (x))E(G) for each nN. Thus we get the same relation as before. This completes the proof. □

Lemma 2.7 Let (X,d) be a complete metric space endowed with a graph G satisfying the above standard conditions. Suppose that f:XX is a Ćirić-Reich-Rus G-contraction with constants α, β, γ. Then for each x X f , there exists x (x)X such that the sequence ( f n ( x ) ) n N converges to x (x) as n+.

Proof Let x X f . By Lemma 2.6, we get that

d ( f n ( x ) , f n + 1 ( x ) ) a n r(x),for all nN,

where r(x):=d(x,f(x)). Hence n 0 d( f n (x), f n + 1 (x))<, proving by a standard argument that the sequence ( f n ( x ) ) n N is Cauchy. Since the space X is complete with respect to d, we get that there exists x (x)X such that the sequence ( f n ( x ) ) n N converges to x (x) as n+. □

We can now give the main result for Ćirić-Reich-Rus G-contractions. We will make use again of the property (P) introduced in Section 1.

Theorem 2.2 Let (X,d) be a complete metric space and G be a directed graph satisfying the above standard conditions such that the triple (X,d,G) satisfies the property (P). Let f:XX be Ćirić-Reich-Rus G-contraction with constants α, β, γ such that it is G-orbitally continuous. Then the following statements hold:

  1. (1)

    F f if and only if X f ;

  2. (2)

    if X f and G is weakly connected, then f is a weakly Picard operator;

  3. (3)

    for any x X f , we have that f | [ x ] G ˜ is a weakly Picard operator.

Proof We start by proving statement (3). Let x X f . Applying Lemma 2.6, we have that there exists r(x)0 such that

d ( f n ( x ) , f n + 1 ( x ) ) a n r(x),for all nN.

This yields, as in the proof of Lemma 2.7, that there exists x (x)X such that lim n f n (x)= x (x). Because x X f , condition (1) in Definition 2.2 implies that f n (x) X f for every nN. Suppose now, for example, that (x,f(x))E(G). (A similar deduction can be made if (f(x),x)E(G).) Using the property (P), we can find a subsequence ( f k n ( x ) ) n N of ( f n ( x ) ) n N such that ( f k n (x), x (x))E(G) for each nN. Then the points x,f(x),, f k 1 (x), x (x) form a path in G, and thus x (x) [ x ] G ˜ . Since f is G-orbitally continuous, we obtain that x (x) is a fixed point for f | [ x ] G ˜ .

For (1), notice that from (3) it follows that F f if X f . Suppose F f . Since we work under the assumption that ΔE(G), we immediately get that X f . Hence, (1) also holds.

To prove (2), let x X f . Because G is weakly connected, we have that X= [ x ] G ˜ , and we only need to apply (3). □

Remark 2.3 If in the above result we put β=γ=0, then we get the results given in Jachymski [1].

Remark 2.4 It is an open problem if in some appropriate assumptions, one can prove that a Ćirić-Reich-Rus G-contraction is a Picard operator.

References

  1. Jachymski J: The contraction principle for mappings on a metric space with a graph. Proc. Am. Math. Soc. 2008, 136: 1359–1373.

    Article  MathSciNet  Google Scholar 

  2. Gwóźdź-Lukawska G, Jachymski J: IFS on a metric space with a graph structure and extensions of the Kelisky-Rivlin theorem. J. Math. Anal. Appl. 2009, 356: 453–463. 10.1016/j.jmaa.2009.03.023

    Article  MathSciNet  Google Scholar 

  3. Berinde V: Approximating fixed points of weak contractions using the Picard iteration. Nonlinear Anal. Forum 2004, 9: 43–53.

    MathSciNet  Google Scholar 

  4. Berinde V: Some remarks on a fixed point theorem for Ćirić-type almost contractions. Carpath. J. Math. 2009, 25(2):157–162.

    MathSciNet  Google Scholar 

  5. Rus IA: Picard operators and applications. Sci. Math. Jpn. 2003, 58: 191–219.

    MathSciNet  Google Scholar 

  6. Rus IA, Petruşel A, Petruşel G: Fixed Point Theory. Cluj University Press, Cluj-Napoca; 2008.

    Google Scholar 

  7. 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.240

    Article  MathSciNet  Google Scholar 

  8. Nicolae A, O’Regan D, Petruşel A: Fixed point theorems for singlevalued and multivalued generalized contractions in metric spaces endowed with a graph. Georgian Math. J. 2011, 18: 307–327.

    MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  10. Nieto JJ, Rodríguez-López R: Existence and uniqueness of fixed points in partially ordered sets and applications to ordinary differential equations. Acta Math. Sin. Engl. Ser. 2007, 23: 2205–2212. 10.1007/s10114-005-0769-0

    Article  MathSciNet  Google Scholar 

  11. Nieto JJ, Pouso RL, Rodríguez-López R: Fixed point theorems in ordered abstract spaces. Proc. Am. Math. Soc. 2007, 135: 2505–2517. 10.1090/S0002-9939-07-08729-1

    Article  Google Scholar 

  12. O’Regan D, Petruşel A: Fixed point theorems in ordered metric spaces. J. Math. Anal. Appl. 2008, 341: 1241–1252. 10.1016/j.jmaa.2007.11.026

    Article  MathSciNet  Google Scholar 

  13. Petruşel A, Rus IA: Fixed point theorems in ordered L -spaces. Proc. Am. Math. Soc. 2006, 134: 411–418.

    Article  Google Scholar 

  14. Ran ACM, Reurings MC: 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  Google Scholar 

  15. Păcurar M: Iterative Methods for Fixed Point Approximations. Risoprint, Cluj-Napoca; 2010.

    Google Scholar 

  16. Agarwal RP, El-Gebeily MA, O’Regan D: Generalized contractions in partially ordered metric spaces. Appl. Anal. 2008, 87: 109–116. 10.1080/00036810701556151

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Cristian Chifu.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

Both authors had have equal contribution to this article regarding results, conception and drafting the manuscript. The authors read and approved the final manuscript.

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

Chifu, C., Petruşel, G. Generalized contractions in metric spaces endowed with a graph. Fixed Point Theory Appl 2012, 161 (2012). https://doi.org/10.1186/1687-1812-2012-161

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1186/1687-1812-2012-161

Keywords