Open Access

Ciric-type δ-contractions in metric spaces endowed with a graph

Journal of Inequalities and Applications20142014:77

https://doi.org/10.1186/1029-242X-2014-77

Received: 15 October 2013

Accepted: 13 January 2014

Published: 17 February 2014

Abstract

The purpose of this paper is to present some fixed-point and strict fixed-point results in a metric space endowed with a graph, using a contractive condition of Ćirić type with respect to the functional δ. The data dependence of the fixed-point set, the well-posedness of the fixed-point problem, and the limit shadowing property are also studied.

MSC:47H10, 54H25.

Keywords

fixed pointstrict fixed pointmetric spaceconnected graphwell-posed problemlimit shadowing property

1 Preliminaries

A recent research direction in fixed-point theory is the study of the fixed-point problem for single-valued and multivalued operators in the context of a metric space endowed with a graph. This approach was recently considered by Jachymski in [1], Gwóźdź-Lukawska and Jachymski in [2], and then it was developed in many other papers ([35], etc.).

On the other hand, fixed points and strict fixed points (also called end-points) are important elements in mathematical economics and game theory. It represents optimal preferences in some Arrow-Debreu type models or Nash type equilibrium points for some abstract noncooperative games, see, for example, [6] and [7]. From this perspective, it is important to give fixed and strict fixed-point theorems for multivalued operators.

We shall begin by presenting some notions and notations that will be used throughout the paper.

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 ) , E ( G ) being the set of the edges of the graph. Assuming that G has no parallel edges, we will suppose that G can be identified with the pair ( V ( G ) , E ( G ) ) .

If x and y are vertices of G, then a path in G from x to y of length k N 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 } .

Let us denote by G ˜ the undirected graph obtained from G by ignoring the direction of edges. 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.

Let us consider the following families of subsets of a metric space ( X , d ) :
P ( X ) : = { Y P ( X ) | Y } , P b ( X ) : = { Y P ( X ) | Y  is bounded } , P c l ( X ) : = { Y P ( X ) | Y  is closed } , P c p ( X ) : = { Y P ( X ) | Y  is compact } .
Let us define the gap functional between the sets A and B in the metric space ( X , d ) as:
D : P ( X ) × P ( X ) R + { + } , D ( A , B ) = inf { d ( a , b ) | a A , b B }
and the (generalized) Pompeiu-Hausdorff functional as
H : P ( X ) × P ( X ) R + { + } , H ( A , B ) = max { sup a A D ( a , B ) , sup b B D ( A , b ) } .
The generalized diameter functional is denoted by δ : P ( X ) × P ( X ) R + { } , and defined by
δ ( A , B ) = sup { d ( a , b ) | a A , b B } .

Denote by diam ( A ) : = δ ( A , A ) the diameter of the set A.

Let T : X P ( X ) be a multivalued operator and Graphic ( T ) : = { ( x , y ) | y T ( x ) } the graphic of T. x X is called fixed point for T if and only if x T ( x ) , and it is called strict fixed point if and only if { x } = T ( x ) .

The set Fix ( T ) : = { x X | x T ( x ) } is called the fixed-point set of T, while S Fix ( T ) = { x X | { x } = T ( x ) } is called the strict fixed-point set of T. Notice that S Fix ( T ) Fix ( T ) .

We will write E ( G ) I ( T × T ) if and only if for every x , y X with ( x , y ) E ( G ) we have T ( x ) × T ( y ) E ( G ) .

For the particular case of a single-valued operator t : X X the above notations should be considered accordingly. In particular, the condition E ( G ) I ( t × t ) means that the operator t is edge preserving (in the sense of the Jachymski’s definition of a Banach contraction), i.e. for each x , y X with ( x , y ) E ( G ) we have ( t ( x ) , t ( y ) ) E ( G ) (see [1]). We will also denote by O ( x 0 , n ) : = { x 0 , t ( x 0 ) , t 2 ( x 0 ) , , t n ( x 0 ) } the orbit of order n of the operator t corresponding to x 0 X .

In this paper we prove some fixed-point and strict fixed-point theorems for single-valued and multivalued operators satisfying a contractive condition of Ćirić type with respect to the functional δ. Our results also generalize and extend some fixed-point theorems in partially ordered complete metric spaces given in Harjani, Sadarangani [8], Nieto, Rodríguez-López [9] and [10], Nieto et al. [11], O’Regan, Petruşel [12], Petruşel, Rus [13] and Ran, Reurings [14]. For other general results concerning Ćirić type fixed-point theorems see Rus [15].

In the main section of the paper we give results concerning the existence and uniqueness of the fixed point and of the strict fixed point of a Ćirić type (single-valued and multivalued) contraction. Then the well-posedness of the fixed-point problem, the data dependence of the fixed-point set, and the limit shadowing property are also studied. Our results complement and extend some recent theorems given in [16] for multivalued Reich-type operators.

2 Main results

In this section we present the main results of the paper concerning the fixed-point problem and, respectively, the strict fixed-point problem for a single-valued, respectively, of a multivalued Ćirić type contraction.

Definition 2.1 Let ( X , d ) be a metric space and T : X P c l ( X ) be a multivalued operator. By definition, the fixed-point problem is well-posed for T with respect to H if:
  1. (i)

    S Fix T = { x } ;

     
  2. (ii)

    If ( x n ) n N is a sequence in X such that H ( x n , T ( x n ) ) 0 , as n , then x n d x , as n .

     

Definition 2.2 Let ( X , d ) be a metric space and T : X P ( X ) be a multivalued operator. By definition T has the limit shadowing property if for any sequence ( y n ) n N from X such that D ( y n + 1 , T ( y n ) ) 0 , as n , there exists ( x n ) n N , a sequence of successive approximation of T, such that d ( x n , y n ) 0 , as n .

In order to prove the limit shadowing property we shall need Cauchy’s lemma.

Lemma 2.1 (Cauchy’s lemma)

Let ( a n ) n N and ( b n ) n N be two sequences of non-negative real numbers, such that k = 0 + a k < + and b n 0 , as n . Then
k = 0 n a n k b k 0 , as n .

The first main result of this paper is the following result for the case of single-valued operators. The proof of this result is inspired by the proof of Ćirić’s fixed-point theorem in [17] and the approach introduced for metric spaces endowed with a graph by Jachymski in [1].

Theorem 2.1 Let ( X , d ) be a complete metric space and G be a directed graph such that the triple ( X , d , G ) satisfies the following property:
( P ) for any sequence ( x n ) n N X with x n x as n , there exists a subsequence ( x k n ) n N of ( x n ) n N such that ( x k n , x ) E ( G ) .
Let t : X X be a single-valued operator. Suppose the following assertions hold:
  1. (i)
    there exists a [ 0 , 1 [ such that
    d ( t ( x ) , t ( y ) ) a max { d ( x , y ) , d ( x , t ( x ) ) , d ( y , t ( y ) ) , d ( x , t ( y ) ) , d ( y , t ( x ) ) } ,

    for all ( x , y ) E ( G ) ;

     
  2. (ii)

    there exists x 0 X such that ( x 0 , t ( x 0 ) ) E ( G ) ;

     
  3. (iii)

    E ( G ) I ( t × t ) ;

     
  4. (iv)

    if ( x , y ) E ( G ) and ( y , z ) E ( G ) , then ( x , z ) E ( G ) .

     
In these conditions we have:
  1. (a)

    (existence) Fix ( t ) ;

     
  2. (b)
    (uniqueness) If, in addition, the following implication holds
    x , y Fix ( t ) ( x , y ) E ( G ) ,
     

then Fix ( t ) = { x } .

Proof (a) Let x 0 X such that ( x 0 , t ( x 0 ) ) E ( G ) . By (iii) we obtain ( t i ( x 0 ) , t i + 1 ( x 0 ) ) E ( G ) , for all i N . Then, by (iv), we get
( t i ( x 0 ) , t j ( x 0 ) ) E ( G ) , for all  i , j N  with  i < j .
Since Δ E ( G ) we get
( t i ( x 0 ) , t j ( x 0 ) ) E ( G ) , for all  i , j N  with  i j .
(2.1)
For n N , let i , j N with 1 i < j n . Then
d ( t i ( x 0 ) , t j ( x 0 ) ) a diam ( O ( x 0 ; n ) ) .
Notice now that, from the above relation, it follows that there exists k N with k n such that
d ( x 0 , t k ( x 0 ) ) = diam ( O ( x 0 ; n ) ) .
(2.2)
In order to show that the sequence ( t n ( x 0 ) ) n N is Cauchy, let us consider n , m N with n < m . Then we have
d ( t n ( x 0 ) , t m ( x 0 ) ) a diam ( O ( t n 1 ( x 0 ) ; m n + 1 ) ) .
By (2.2) there exists p N with p m n + 1 such that
diam ( O ( t n 1 ( x 0 ) ; m n + 1 ) ) = d ( t n 1 ( x 0 ) , t p ( t n 1 ( x 0 ) ) ) .
Then
d ( t n 1 ( x 0 ) , t p ( t n 1 ( x 0 ) ) ) = d ( t n 1 ( x 0 ) , t p + n 1 ( x 0 ) ) = d ( t ( t n 2 ( x 0 ) ) , t p + 1 ( t n 2 ( x 0 ) ) ) a diam ( O ( t n 2 ( x 0 ) ; p + 1 ) ) a diam ( O ( t n 2 ( x 0 ) ; m n + 2 ) ) .
Thus, we get
diam ( O ( t n 1 ( x 0 ) ; m n + 1 ) ) a diam ( O ( t n 2 ( x 0 ) ; m n + 2 ) ) a n diam ( O ( x 0 ; m ) ) .
Hence
d ( t n ( x 0 ) , t m ( x 0 ) ) a n diam ( O ( x 0 ; m ) ) .
Notice now that
diam ( O ( x 0 ; m ) ) 1 1 a d ( x 0 , t ( x 0 ) ) , for all  m N .
(2.3)
Indeed, if we take m N arbitrary, then by (2.2), there exists r N such that 1 r m and d ( x 0 , t r ( x 0 ) ) = diam ( O ( x 0 ; m ) ) . Then, using (2.1), we get
d ( x 0 , t r ( x 0 ) ) d ( x 0 , t ( x 0 ) ) + d ( t ( x 0 ) , t r ( x 0 ) ) d ( x 0 , t ( x 0 ) ) + a diam ( O ( x 0 ; m ) ) = d ( x 0 , t ( x 0 ) ) + a d ( x 0 , t r ( x 0 ) ) .
Hence we have
diam ( O ( x 0 ; m ) ) = d ( x 0 , t r ( x 0 ) ) 1 1 a d ( x 0 , t ( x 0 ) ) ,
proving (2.3). Now, we can conclude that
d ( t n ( x 0 ) , t m ( x 0 ) ) a n 1 a d ( x 0 , t ( x 0 ) ) , for all  n , m N  with  n < m .
(2.4)

Thus, (2.4) shows that the sequence ( t n ( x 0 ) ) n N is Cauchy and, as a consequence of the completeness of the space, it converges to an element x X .

We will show now that x Fix ( t ) .

Notice first that, by the property (P), there exists a subsequence ( x k n ) n N of ( x n ) n N such that ( x k n , x ) E ( G ) for each n N . Now, we can write
d ( x , t ( x ) ) d ( x , x k n + 1 ) + d ( t ( x k n ) , t ( x ) ) d ( x , x k n + 1 ) + a max { d ( x k n , x ) , d ( x k n , t ( x k n ) ) , d ( x , t ( x ) ) , d ( x k n , t ( x ) ) , d ( x , t ( x k n ) ) } d ( x , x k n + 1 ) + a ( d ( x k n , x ) + d ( x k n , t ( x k n ) ) + d ( x , t ( x ) ) + d ( x , t ( x k n ) ) ) .
Hence
d ( x , t ( x ) ) 1 1 a [ ( 1 + a ) d ( x , x k n + 1 ) + a d ( x k n , x ) + a d ( x k n , x k n + 1 ) ] .

Letting n + we get x Fix ( t ) .

(b) Suppose that there exist x , y Fix ( t ) with x y .

Using (i) and the additional hypothesis of (b), we obtain
d ( x , y ) = d ( t ( x ) , t ( y ) ) a max { d ( x , y ) , d ( x , t ( x ) ) , d ( t ( y ) , y ) , d ( x , t ( y ) ) , d ( y , t ( x ) ) } = a d ( x , y ) ,

which is a contradiction. □

Remark 2.1 Notice that, from the proof of the above theorem, it follows that the sequence ( t n ( x 0 ) ) n N converges to x in ( X , d ) .

Remark 2.2 If in the above theorem, instead of property (P) we suppose that t has closed graphic, then we can reach the same conclusion. Moreover if we suppose that
x , y Fix ( t ) ( x , y ) E ( G ) ,

then we get again Fix ( t ) = { x } .

Based on the above theorem, we can prove now our second main result.

Theorem 2.2 Let ( X , d ) be a complete metric space and G be a directed graph such that the triple ( X , d , G ) satisfies the following property:
( P ) for any sequence ( x n ) n N X with x n x as n , there exists a subsequence ( x k n ) n N of ( x n ) n N such that ( x k n , x ) E ( G ) .
Let T : X P b ( X ) be a multivalued operator. Suppose the following assertions hold:
  1. (i)
    there exists a [ 0 , 1 [ such that
    δ ( T ( x ) , T ( y ) ) a max { d ( x , y ) , δ ( x , T ( x ) ) , δ ( y , T ( y ) ) , D ( x , T ( y ) ) , D ( y , T ( x ) ) } ,

    for all ( x , y ) E ( G ) ;

     
  2. (ii)

    there exists x 0 X such that, for all y T ( x 0 ) , we have ( x 0 , y ) E ( G ) ;

     
  3. (iii)

    E ( G ) I ( T × T ) ;

     
  4. (iv)

    if ( x , y ) E ( G ) and ( y , z ) E ( G ) , then ( x , z ) E ( G ) .

     
In these conditions we have:
  1. (a)

    (existence) Fix ( T ) = S Fix ( T ) ;

     
  2. (b)
    (uniqueness) If, in addition, the following implication holds:
    x , y Fix ( T ) ( x , y ) E ( G ) ,
     
then Fix ( T ) = S Fix ( T ) = { x } ;
  1. (c)

    (well-posedness of the fixed-point problem) If T has closed graphic and for any sequence ( x n ) n N , x n X with H ( x n , T ( x n ) ) 0 , as n , we have ( x n , x ) E ( G ) , then the fixed-point problem is well-posed for T with respect to H;

     
  2. (d)
    (limit shadowing property of T) If a < 1 3 and ( y n ) n N is a sequence in X such that the following implication holds:
    D ( y n + 1 , T ( y n ) ) 0 , as n ( y n , x ) E ( G ) , n N ,
     

then T has the limit shadowing property.

Proof (a) Let 0 < q < 1 be an arbitrary real number. Notice first that, for any x X , there exists u T ( x ) such that a q δ ( x , T ( x ) ) d ( x , u ) . In this way, we get an operator t : X X which assigns to each x X the element t ( x ) T ( x ) with
a q δ ( x , T ( x ) ) d ( x , t ( x ) ) .
Then, for ( x , y ) E ( G ) , we have
d ( t ( x ) , t ( y ) ) δ ( T ( x ) , T ( y ) ) a a q max { a q d ( x , y ) , a q δ ( x , T ( x ) ) , a q δ ( y , T ( y ) ) , a q D ( x , T ( y ) ) , a q D ( y , T ( x ) ) } a 1 q max { d ( x , y ) , d ( x , t ( x ) ) , d ( y , t ( y ) ) , d ( x , t ( y ) ) , d ( y , t ( x ) ) } .

Thus, the operator t satisfies all the hypotheses of Theorem 2.1 and, as a consequence, it has a fixed point x X . Then x Fix ( T ) . If we suppose now that there exists x Fix ( T ) S Fix ( T ) , then, since ( x , x ) Δ , from the condition (i) (with y = x ), we get δ ( T ( x ) ) a δ ( T ( x ) ) , which implies (since a < 1 ) that δ ( T ( x ) ) = 0 . Thus T ( x ) = { x } . This is a contradiction with x Fix ( T ) S Fix ( T ) , proving that Fix ( T ) = S Fix ( T ) .

(b) Suppose that there exist x , y Fix ( T ) = S Fix ( T ) .

Using (i) we obtain
d ( x , y ) = δ ( T ( x ) , T ( y ) ) a max { d ( x , y ) , δ ( x , T ( x ) ) , δ ( y , T ( y ) ) , D ( x , T ( y ) ) , D ( y , T ( x ) ) } = a d ( x , y ) ,

which implies that d ( x , y ) = 0 . Hence Fix ( T ) = S Fix ( T ) = { x } .

(c) Let ( x n ) n N , x n X , be a sequence with the property that H ( x n , T ( x n ) ) 0 , as n . It is obvious that H ( x n , T ( x n ) ) = δ ( x n , T ( x n ) ) .

Let x Fix ( T ) = S Fix ( T ) . Then
d ( x n , x ) = δ ( x n , T ( x ) ) δ ( x n , T ( x n ) ) + δ ( T ( x n ) , T ( x ) ) δ ( x n , T ( x n ) ) + a max { d ( x n , x ) , δ ( x n , T ( x n ) ) , d ( x n , x ) , D ( x , T ( x n ) ) } δ ( x n , T ( x n ) ) + a δ ( x n , T ( x n ) ) + a d ( x n , x ) .
Hence
d ( x n , x ) 1 + a 1 a δ ( x n , T ( x n ) ) 0 , as  n + ,

and, as a consequence, the fixed-point problem is well-posed for T with respect to H.

(d) Let ( y n ) n N be a sequence in X such that D ( y n + 1 , T ( y n ) ) 0 , as n and let ( x n ) n N be a sequence of successive approximation of T starting from x 0 X , constructed as in the proof of Theorem 2.1. We shall prove that d ( x n , y n ) 0 , as n .

Let x Fix ( T ) = S Fix ( T ) . Then
d ( x n , y n ) d ( x n , x ) + d ( x , y n ) .
In what follows we shall prove that d ( x , y n ) 0 , as n . Then we have
d ( x , y n + 1 ) δ ( x , T ( y n ) ) + D ( y n + 1 , T ( y n ) ) = δ ( T ( x ) , T ( y n ) ) + D ( y n + 1 , T ( y n ) ) a max { d ( x , y n ) , δ ( y n , T ( y n ) ) , D ( x , T ( y n ) ) , d ( y n , x ) } + D ( y n + 1 , T ( y n ) ) a δ ( y n , T ( y n ) ) + a d ( x , y n ) + D ( y n + 1 , T ( y n ) ) .
Now, we can write
δ ( y n , T ( y n ) ) d ( x , y n ) + δ ( x , T ( y n ) ) = d ( x , y n ) + δ ( T ( x ) , T ( y n ) ) d ( x , y n ) + a δ ( y n , T ( y n ) ) + a d ( x , y n ) .
Thus
δ ( y n , T ( y n ) ) 1 + a 1 a d ( x , y n ) .
If we replace this in the above relation, we get
d ( x , y n + 1 ) 2 a 1 a d ( x , y n ) + D ( y n + 1 , T ( y n ) ) .
Hence
d ( y n + 1 , x ) 2 a 1 a d ( y n , x ) + D ( y n + 1 , T ( y n ) ) ( 2 a 1 a ) 2 d ( y n 1 , x ) + 2 a 1 a D ( y n , T ( y n 1 ) ) + D ( y n + 1 , T ( y n ) ) .
Continuing this process we shall obtain
d ( y n + 1 , x ) ( 2 a 1 a ) n + 1 d ( y 0 , x ) + k = 0 n ( 2 a 1 a ) n k D ( y k + 1 , T ( y k ) ) .

If we consider a n = ( 2 a 1 a ) n and b n = D ( y n + 1 , T ( y n ) ) and using the fact that a < 1 3 , we obtain, via Cauchy’s lemma, d ( x , y n ) 0 , as n . Thus d ( x , y n ) 0 , as n , and hence, the operator T has the limit shadowing property. □

Remark 2.3 If in Theorem 2.1, instead of property (P), we suppose that every selection t of T has closed graphic, then we obtain Fix ( T ) = S Fix ( T ) . Moreover if we suppose that the following implication holds:
x , y Fix ( T ) ( x , y ) E ( G ) ,

then Fix ( T ) = S Fix ( T ) = { x } .

Proof Since every selection t of T has closed graphic, the conclusion follows by Theorem 2.1, via Remark 2.2. □

Definition 2.3 Let ( X , d ) be a metric space and T : X P c l ( X ) be a multivalued operator. By definition the fixed-point problem is well-posed in the generalized sense for T with respect to H if
  1. (i)

    S Fix T ;

     
  2. (ii)

    If ( x n ) n N is a sequence in X such that H ( x n , T ( x n ) ) 0 , as n , then there exists a subsequence ( x k n ) n N of ( x n ) n N such that x k n d x , as n .

     

Remark 2.4 If in Theorem 2.1 instead of (c) we suppose the following assumption, (c′):

(c′) If every selection t of T has closed graphic and, in addition, we suppose that for any sequence ( x n ) n N X with H ( x n , T ( x n ) ) 0 , as n , there exists a subsequence ( x k n ) n N such that ( x k n , x ) E ( G ) and H ( x k n , T ( x k n ) ) 0 , then the fixed-point problem is well-posed in the generalized sense for T with respect to H.

In what follows we shall present some examples of operators satisfying the hypotheses of our main results.

Example 2.1 Let X = { 0 , 1 } { 1 2 k : k N } and f : X X given by
f ( x ) = { x / 2 , if  x { 1 2 k : k N } , 0 , if  x { 0 , 1 } .

Let V ( G ) : = X and E ( G ) : = { ( 0 , 1 ) , ( 1 , 0 ) } { ( 0 , 1 2 k ) , ( 1 2 k , 0 ) , ( 1 , 1 2 k ) , ( 1 2 k , 1 ) : k N } Δ .

Then all the hypotheses of Theorem 2.1 are satisfied, Fix ( t ) = { 0 } and, if we take x 0 = 1 2 , then ( t n ( x 0 ) ) n N converges to x = 0 .

Example 2.2 Let X = { ( 0 , 0 ) , ( 0 , 1 ) , ( 1 , 0 ) } and T : X P b ( X ) given by
T ( x ) = { { ( 0 , 0 ) } , x = ( 0 , 0 ) , { ( 0 , 0 ) , ( 1 , 0 ) } , x = ( 0 , 1 ) , { ( 0 , 0 ) } , x = ( 1 , 0 ) .

Let E ( G ) : = { ( ( 0 , 1 ) ; ( 1 , 0 ) ) , ( ( 1 , 0 ) ; ( 0 , 0 ) ) } Δ .

Notice that Fix ( T ) = S Fix ( T ) = { ( 0 , 0 ) } and all the hypotheses in Theorem 2.2 are satisfied (the condition (i) is verified for a 0 , 71 ).

Remark 2.5 It is also important to notice that, if we suppose that there exists x Fix ( T ) S Fix ( T ) , then, since ( x , x ) Δ , from the condition (i) in the above theorem (with y = x ), we get δ ( T ( x ) ) a δ ( T ( x ) ) , which implies δ ( T ( x ) ) = 0 (since a < 1 ). This is a contradiction with x Fix ( T ) S Fix ( T ) , showing that we cannot get fixed points which are not strict fixed points in the presence of the condition (i) of the above theorem. It is an open problem to prove a similar theorem to the above one for a more general class of multivalued operators T.

The next result presents the data dependence of the fixed-point set of a multivalued operator which satisfies a contractive condition of Ćirić type.

Theorem 2.3 Let ( X , d ) be a complete metric space and G be a directed graph such that the triple ( X , d , G ) satisfies property (P). Let T 1 , T 2 : X P b ( X ) be two multivalued operators. Suppose the following assertions hold:
  1. (i)
    for i { 1 , 2 } , there exist a i [ 0 , 1 ) such that
    δ ( T i ( x ) , T i ( y ) ) a max { d ( x , y ) , δ ( x , T i ( x ) ) , δ ( y , T i ( y ) ) , D ( x , T i ( y ) ) , D ( y , T i ( x ) ) } ,

    for all ( x , y ) E ( G ) ;

     
  2. (ii)

    for each x X and each y T ( x ) we have ( x , y ) E ( G ) , for i { 1 , 2 } ;

     
  3. (iii)

    E ( G ) I ( T × T ) ;

     
  4. (iv)

    if ( x , y ) E ( G ) and ( y , z ) E ( G ) , then ( x , z ) E ( G ) ;

     
  5. (v)

    there exists η > 0 such that H ( T 1 ( x ) , T 2 ( x ) ) η for all x X .

    Under these conditions we have:

     
  6. (a)

    Fix ( T i ) = S Fix ( T i ) , i { 1 , 2 } ;

     
  7. (b)
    If, in addition, for i { 1 , 2 } , the following implication holds:
    x i , y i Fix ( T i ) ( x i , y i ) E ( G ) ,

    then Fix ( T i ) = S Fix ( T i ) = { x i } , for each i { 1 , 2 } ;

     
  8. (c)

    H ( S Fix ( T 1 ) , S Fix ( T 2 ) ) η 1 max { a 1 , a 2 } .

     

Proof Conclusions (a) and (b) are immediate if we apply Theorem 2.2.

For (c) notice that we can prove that for every x 1 S Fix ( T 1 ) , there exists x 2 S Fix ( T 2 ) , such that
d ( x 1 , x 2 ) η 1 a 2 .

A second relation of this type will be obtained by interchanging the role of T 1 and T 2 . Hence, the conclusion follows by the properties of the functional H. □

Declarations

Acknowledgements

The work of the second author is supported by financial support of a grant of the Romanian National Authority for Scientific Research, CNCS-UEFISCDI, project number PN-II-ID-PCE-2011-3-0094.

Authors’ Affiliations

(1)
Department of Business, Babeş-Bolyai University Cluj-Napoca
(2)
Department of Mathematics, Babeş-Bolyai University Cluj-Napoca

References

  1. Jachymski J: The contraction principle for mappings on a metric space with a graph. Proc. Am. Math. Soc. 2008, 136: 1359–1373.MathSciNetView ArticleGoogle 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.023MathSciNetView ArticleGoogle Scholar
  3. Nicolae A, O’Regan D, Petruşel A: Fixed point theorems for single-valued and multivalued generalized contractions in metric spaces endowed with a graph. Georgian Math. J. 2011, 18: 307–327.MathSciNetGoogle Scholar
  4. Beg I, Butt AR, Radojevic S: The contraction principles for set-valued mappings on a metric space with a graph. Comput. Math. Appl. 2010, 60: 1214–1219. 10.1016/j.camwa.2010.06.003MathSciNetView ArticleGoogle Scholar
  5. Dinevari T, Frigon M: Fixed point results for multivalued contractions on a metric space with a graph. J. Math. Anal. Appl. 2013, 405: 507–517. 10.1016/j.jmaa.2013.04.014MathSciNetView ArticleGoogle Scholar
  6. Border K: Fixed Point Theorems with Applications to Economic and Game Theory. Cambridge University Press, London; 1985.View ArticleGoogle Scholar
  7. Yuan GX-Z: KKM Theory and Applications in Nonlinear Analysis. Dekker, New York; 1999.Google Scholar
  8. 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 ArticleGoogle 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-5MathSciNetView ArticleGoogle 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-0MathSciNetView ArticleGoogle 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-1View ArticleGoogle 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.026MathSciNetView ArticleGoogle Scholar
  13. Petruşel A, Rus IA: Fixed point theorems in ordered L -spaces. Proc. Am. Math. Soc. 2006, 134: 411–418.View ArticleGoogle 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-4MathSciNetView ArticleGoogle Scholar
  15. Rus IA: Generalized Contractions and Applications. Transilvania Press, Cluj-Napoca; 2001.Google Scholar
  16. Chifu C, Petruşel G, Bota M: Fixed points and strict fixed points for multivalued contractions of Reich type on metric spaces endowed with a graph. Fixed Point Theory Appl. 2013., 2013: Article ID 203 10.1186/1687-1812-2013-203Google Scholar
  17. Ćirić LB: A generalization of Banach’s contraction principle. Proc. Am. Math. Soc. 1974, 45: 267–273.Google Scholar
  18. Petruşel A, Rus IA: Well-posedness of the fixed point problem for multivalued operators. In Applied Analysis and Differential Equations. Edited by: Carja O, Vrabie II. World Scientific, Hackensack; 2007:295–306.View ArticleGoogle Scholar
  19. Petruşel A, Rus IA, Yao J-C: Well-posedness in the generalized sense of the fixed point problems for multivalued operators. Taiwan. J. Math. 2007, 11: 903–914.Google Scholar

Copyright

© Chifu and Petruşel; licensee Springer. 2014

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.