Next Article in Journal
Memory-Accelerating Methods for One-Step Iterative Schemes with Lie Symmetry Method Solving Nonlinear Boundary-Value Problem
Previous Article in Journal
An Accurate Prediction Method of Human Assembly Motion for Human–Robot Collaboration
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Fixed Point and Convergence Results for Contractive-Type Self-Mappings of Metric Spaces with Graphs

by
Alexander J. Zaslavski
Department of Mathematics, The Technion—Israel Institute of Technology, Haifa 32000, Israel
Symmetry 2024, 16(1), 119; https://doi.org/10.3390/sym16010119
Submission received: 4 December 2023 / Revised: 4 January 2024 / Accepted: 17 January 2024 / Published: 18 January 2024
(This article belongs to the Section Mathematics)

Abstract

:
It is known that a strict contraction on a complete metric space with a graph possesses a fixed point. In the present paper, we show that this property holds for single valued and set-valued self-mappings of metric spaces with graphs that are of the contractive type. We also show the convergence of iterates of these mappings to fixed points. In particular, our results are true for metric spaces with symmetric graphs.
MSC:
47H09; 47H10; 54E50

1. Introduction

For more than sixty years, the fixed point theory of nonlinear operators has been an important area of nonlinear analysis. One of its main topics is the study of the existence of fixed points of nonexpansive and contractive maps [1,2,3,4,5,6,7,8,9,10,11,12]. It should be mentioned that the analysis of nonexpansive operators acting on complete metric spaces with graphs is of great interest [13,14,15,16,17,18,19,20,21]. It is a well-known fact that a strict contraction on a complete metric space with a graph possesses a fixed point [22,23]. In the present paper, we show that this property holds for single valued and set-valued self-mappings of metric spaces with graphs that are of the contractive type. We also show the convergence of iterates of these mappings to fixed points. In particular, our results are true for metric spaces with symmetric graphs.
Assume that ( X , d ) is a complete metric space equipped with a graph G. We denote by V ( G ) the set of its vertices, and by E ( G ) the set of its edges. We assume that ( x , x ) E ( G ) for any point x X .
Denote by M n e the set of all maps T : X X such that for every pair of points x , y X satisfying ( x , y ) E ( G ) ,
( T ( x ) , T ( y ) ) E ( G ) and d ( T ( x ) , T ( y ) ) d ( x , y ) .
In the sequel, we assume that the sum over an empty set is zero, and that the infimum of an empty set is . For each point x X and each number r > 0 , set
B ( x , r ) : = { y X : d ( x , y ) r } .
For every point x X and every set D X , put
d ( x , D ) = inf { d ( x , y ) : y D } .
Note that d ( x , ) = , x X . For every pair of nonempty sets A , B X , put
H ( A , B ) = max { sup { d ( x , B ) : x A } , sup { d ( y , A ) : y B } } .
Given a mapping P : X X , we define P 0 = I , the identity self-mapping of X, P 1 = P , and P i + 1 = P P i for all nonnegative integers i.
A mapping T M n e is called G-nonexpansive. If T M n e , α ( 0 , 1 ) and for every pair of points x , y X satisfying ( x , y ) E ( G ) the inequality
d ( T ( x ) , T ( y ) ) α d ( x , y )
holds, then T is called a G-strict contraction.
A mapping T M n e is called G-contractive (or G-Rakotch contraction [11]) if there exists a decreasing function ϕ : [ 0 , ) [ 0 , 1 ] such that
ϕ ( t ) < 1 , t [ 0 , ) ,
and for every pair of points x , y X satisfying ( x , y ) E ( G ) the inequality
d ( T ( x ) , T ( y ) ) ϕ ( d ( x , y ) ) d ( x , y )
holds.
Let T M n e be a G-strict contraction. It is a well-known fact [22] that under certain mild assumptions, T possesses a unique fixed point. In [23], a very simple proof of this fact was presented by using a certain metric on X. In [24] an extension of the existence results of [22,23] to G-contractive mappings under certain assumptions was obtained. In the case where E ( G ) = X × X , this result for Rakotch contractions is well known in the literature. It was first established in [11]. Many of its extensions and generalizations are collected in [12]. In this connection, we recall that the authors of [25] constructed an example of a so-called ϕ -contraction, to which the result of [22] cannot be extended. The results of [24] were obtained under the assumption that there exists a number Δ ¯ > 0 such that if ( x 0 , x 1 ) , ( x 1 , x 2 ) E ( G ) satisfy ρ ( x 0 , x 1 ) Δ ¯ , ρ ( x 1 , x 2 ) Δ ¯ , then ( x 0 , x 2 ) E ( G ) .
In this paper, we obtain the existence of fixed points without this assumption.
Throughout the paper, we assume that ϕ : [ 0 , ) ( 0 , 1 ] is a decreasing function, such that
ϕ ( t ) < 1 , t ( 0 , )
and
ϕ ( 0 ) = 1 .

2. The First Main Result

Assume that T : X X , and that the following assumption holds.
(A1) For each ( x , y ) E ( G ) ,
( T ( x ) , T ( y ) ) E ( G )
and
d ( T ( x ) , T ( y ) ) ϕ ( d ( x , y ) ) d ( x , y ) .
Theorem 1.
Assume that x ¯ X , and that there exist a natural number q and M > 1 such that for each integer n 1 , there exist x i ( n ) X , i = 0 , , q , such that
x 0 ( n ) = x ¯ , x q ( n ) = T n ( x ¯ )
and that for each i { 0 , , n 1 } ,
d ( x i ( n ) , x i + 1 ( n ) ) M
and at least one of the following relations hold:
( x i ( n ) , x i + 1 ( n ) ) E ( G ) ; ( x i + 1 ( n ) , x i ( n ) ) E ( G ) .
Then there exists
x * = lim i T i ( x )
and if T is continuous at x * , then T ( x * ) = x * .
Proof. 
Let ϵ ( 0 , 1 ) . Choose a natural number p such that
p > q 2 M ϵ 1 ( 1 ϕ ( ϵ q 1 ) ) 1 .
Assume that n 1 is an integer. We show that
d ( T p ( x ¯ ) , T n + p ( x ¯ ) ) i = 0 q 1 d ( T p ( x i ( n ) ) , T p ( x i + 1 ( n ) ) ) ϵ .
Assume the contrary. Then,
i = 0 q 1 d ( T p ( x i ( n ) ) , T p ( x i + 1 ( n ) ) ) > ϵ .
It follows from (A1), (5) and (8) that for each integer l { 0 , , p } ,
i = 0 q 1 d ( T l ( x i ( n ) ) , T l ( x i + 1 ( n ) ) ) > ϵ .
Let l { 0 , , p } . Then, in view of (A1), for each i { 0 , , q 1 } ,
d ( T l + 1 ( x i ( n ) ) , T l + 1 ( x i + 1 ( n ) ) ) d ( T l ( x i ( n ) ) , T l ( x i + 1 ( n ) ) ) .
By (9), there exists j { 0 , , q 1 } such that
d ( T l ( x j ( n ) ) , T l ( x j + 1 ( n ) ) ) > ϵ / q .
Assumption (A1) and Equations (5) and (11) imply that
d ( T l + 1 ( x j ( n ) ) , T l + 1 ( x j + 1 ( n ) ) ) ϕ ( d ( T l ( x j ( n ) ) , T l ( x j + 1 ( n ) ) ) ) d ( T l ( x j ( n ) ) , T l ( x j + 1 ( n ) ) )
ϕ ( ϵ q 1 ) d ( T l ( x j ( n ) ) , T l ( x j + 1 ( n ) ) ) .
Together with (11), this implies that
d ( T l ( x j ( n ) ) , T l ( x j + 1 ( n ) ) ) d ( T l + 1 ( x j ( n ) ) , T l + 1 ( x j + 1 ( n ) ) )
( 1 ϕ ( ϵ / 4 ) ) d ( T l ( x j ( n ) ) , T l ( x j + 1 ( n ) ) )
( 1 ϕ ( ϵ q 1 ) ) ϵ q 1 .
Equations (10) and (12) imply that
i = 0 q 1 d ( T l ( x i ( n ) ) , T l ( x i + 1 ( n ) ) ) i = 0 q 1 d ( T l + 1 ( x i ( n ) ) , T l + 1 ( x i + 1 ( n ) ) )
( 1 ϕ ( ϵ q 1 ) ) ϵ q 1 .
It follows from (4) and (13) that
q M i = 0 q 1 d ( x i ( n ) , x i + 1 ( n ) )
i = 0 q 1 d ( x i ( n ) ) , x i + 1 ( n ) ) i = 0 q 1 d ( T p + 1 ( x i ( n ) ) , T p + 1 ( x i + 1 ( n ) ) )
= l = 0 p ( i = 0 q 1 d ( T l ( x i ( n ) ) , T l ( x i + 1 ( n ) ) ) i = 0 q 1 d ( T l + 1 ( x i ( n ) ) , T l + 1 ( x i + 1 ( n ) ) )
p ( 1 ϕ ( ϵ q 1 ) ) ϵ q 1
and
p M q 2 ( 1 ϕ ( ϵ q 1 ) ) 1 ϵ 1 .
This contradicts (6), and proves that (7) holds. Since ϵ is any number from ( 0 , 1 ) , { T n ( x ¯ ) } n = 0 is a Cauchy sequence. Therefore, there exists
x * = lim n T n ( x ¯ ) .
Combined with Equation (7), this implies that
d ( T p ( x ¯ ) , x * ) ϵ
and
d ( T n + p ( x ¯ ) , x * ) 2 ϵ
for each integer n 0 . Therefore,
x * = lim i T i ( x ¯ ) .
Evidently, if T is continuous at x * , then T ( x * ) = x * . Theorem 1 is proved. □

3. The Second Main Result

Assume that T : X X satisfies (A1).
We prove the following convergence result.
Theorem 2.
Assume that x * X satisfies
T ( x * ) = x * ,
q is a natural number, M > 0 and that
X M , q = { x X : t h e r e   e x i s t   x i X , i = 0 , , q
s u c h   t h a t   x 0 = x , x q = x *   a n d   f o r   e a c h   i { 0 , , n 1 } ,
d ( x i , x i + 1 ) M   a n d   a t   l e a s t   o n e   o f   t h e   f o l l o w i n g   r e l a t i o n s   h o l d s :
( x i , x i + 1 ) E ( G ) ; ( x i + 1 , x i ) E ( G ) } .
Then, d ( T n ( x ) , x * ) 0 as n uniformly on X q , M .
Proof. 
Let ϵ ( 0 , 1 ) . Choose an integer p such that
p > q 2 ( M + 1 ) ϵ 1 ( 1 ϕ ( ϵ q 1 ) ) 1 .
Assume that
x X ( M , q ) .
In view of (15) and (17), there exist x i X , i = 0 , , q such that
x 0 = x , x q = x *
for each i { 0 , , n 1 } ,
d ( x i , x i + 1 ) M
and at least one of the following relations holds:
( x i , x i + 1 ) E ( G ) ; ( x i + 1 , x i ) E ( G ) .
By (A1) and (19), (20), for each integer i { 0 , , q 1 } and each integer n 0 ,
d ( T n + 1 ( x i ) , T n + 1 ( x i + 1 ) ) ϕ ( d ( T n ( x i ) , T n ( x i + 1 ) ) d ( T n ( x i ) , T n ( x i + 1 ) )
and at least one of the following relations holds:
( T n ( x i ) , T n ( x i + 1 ) ) E ( G ) ; ( T n ( x i + 1 ) , T n ( x i ) ) E ( G ) .
Assume that an integer n 0 and
i = 0 q 1 d ( T n ( x i ) , T n ( x i + 1 ) ) > ϵ .
In view of (23), there exists an integer j { 0 , , q 1 } such that
d ( T n ( x j ) , T n ( x j + 1 ) ) > ϵ / q .
By (A1), (22) and (24),
d ( T n + 1 ( x j ) , T n + 1 ( x j + 1 ) ) ϕ ( d ( T n ( x j ) , T n ( x j + 1 ) ) ) d ( T n ( x j ) , T n ( x j + 1 ) )
ϕ ( q 1 ϵ ) d ( T n ( x j ) , T n ( x j + 1 ) )
and
d ( T n ( x j ) , T n ( x j + 1 ) ) d ( T n + 1 ( x j ) , T n + 1 ( x j + 1 ) )
( 1 ϕ ( q 1 ϵ ) ) d ( T n ( x j ) , T n ( x j + 1 ) ) ( 1 ϕ ( q 1 ϵ ) ) ϵ / q .
Equations (21) and (25) imply that
i = 0 q 1 d ( T n ( x i ) , T n ( x i + 1 ) ) i = 0 q 1 d ( T n + 1 ( x i ) , T n + 1 ( x i + 1 ) )
d ( T n ( x j ) , T n ( x j + 1 ) ) d ( T n + 1 ( x j ) , T n + 1 ( x j + 1 ) ) ( 1 ϕ ( ϵ / q ) ) ϵ / q .
Thus we have shown that the following property holds:
(i) if n 0 is an integer and (23) holds, then
i = 0 q 1 d ( T n ( x i ) , T n ( x i + 1 ) ) i = 0 q 1 d ( T n + 1 ( x i ) , T n + 1 ( x i + 1 ) ) ( 1 ϕ ( ϵ / q ) ) ϵ / q .
We show that there exists an integer n { 0 , , p } such that
i = 0 q 1 d ( T n ( x i ) , T n ( x i + 1 ) ) ϵ .
Assume the contrary. Then, for each n { 0 , , p } ,
i = 0 q 1 d ( T n ( x i ) , T n ( x i + 1 ) ) > ϵ
and in view of property (i),
i = 0 q 1 d ( T n ( x i ) , T n ( x i + 1 ) ) i = 0 q 1 d ( T n + 1 ( x i ) , T n + 1 ( x i + 1 ) ) ( 1 ϕ ( ϵ / q ) ) ϵ / q .
It follows from (19) and (26) that
q M i = 0 q 1 d ( x i , x i + 1 )
i = 0 q 1 d ( x i , x i + 1 ) i = 0 q 1 d ( T p ( x i ) , T p ( x i + 1 ) )
= n = 0 p i = 0 q 1 ( d ( T n ( x i ) , T n ( x i + 1 ) ) d ( T n + 1 ( x i ) , T n + 1 ( x i + 1 ) ) )
p ( 1 ϕ ( ϵ q 1 ) ) ϵ q 1
and
p M q 2 ( 1 ϕ ( ϵ q 1 ) ) 1 ϵ 1 .
This contradicts (16). The contradiction we have reached proves that there exists an integer n { 0 , , p } such that
d ( T n ( x ) , T n ( x * ) ) i = 0 q 1 d ( T n ( x i ) , T n ( x i + 1 ) ) ϵ .
By (18), (21) and the relation above, for each integer s > n ,
d ( T s ( x ) , x * ) d ( T s ( x ) , T s ( x * ) ) i = 0 q 1 d ( T s ( x i ) , T s ( x i + 1 ) )
i = 0 q 1 d ( T n ( x i ) , T n ( x i + 1 ) ) ϵ .
Theorem 2 is proved. □

4. Set-Valued Rakotch Contractions

We prove the following convergence result.
Theorem 3.
Let T : X 2 X { } , x * X satisfy
x * T ( x * )
q 2 be natural number, M > 0 and let
X M , q = { x X : t h e r e   e x i s t   y i X , i = 1 , , q   s u c h   t h a t
y 1 = x * , y q = x , d ( y i , y i + 1 ) M   a n d ( y i , y i + 1 ) E ( G ) , i { 1 , , q 1 } } .
Assume that the following assumption holds
(A2) For each ( x , y ) E ( G ) and each z T ( x ) , the set
{ ξ T ( y ) : ( z , ξ ) E ( G ) }
is nonempty and
d ( z , { ξ T ( y ) : ( z , ξ ) E ( G ) } ) ϕ ( d ( x , y ) ) d ( x , y ) .
Then, for each x X ( M , q ) , there exists a sequence { x i } i = 1 such that
x 1 = x , x i + 1 T ( x i ) , i = 1 , 2 , , lim i x i = x *
and for each ϵ > 0 , there exists a natural number p ( ϵ ) depending only on ϵ, such that d ( x i , x * ) ϵ for each integer i p ( ϵ ) .
Proof. 
Let
x X M , q .
There exist y i X , i = 1 , , q such that (28) holds. Assume that s 1 is an integer and we defined a sequence { y i } i = 1 s q X such that
y ( s 1 ) q + 1 = x * ,
( y i , y i + 1 ) E ( G ) , i = ( s 1 ) q + 1 , , s q 1 .
(Clearly, for s = 1 our assumption holds.) By induction, using (27), (29) and (30), we define y i X , i = s q + 1 , , s ( q + 1 ) such that
y s q + 1 = x *
and that for each i { ( s 1 ) q + 1 , , s q 1 } ,
y i + q T ( y i ) ,
( y i + q , y i + q + 1 ) E ( G )
and
d ( y i + q , y i + q + 1 )
d ( y i + q , { ξ T ( y i + 1 ) : ( y i + q , ξ ) E ( G ) } ) ( 1 + ϕ ( d ( y i , y i + 1 ) ) 1 ) / 2 .
(Note that if y i = y i + 1 , then y i + q = y i + q + 1 .) Thus, by induction we defined the sequence { y i } i = 0 X such that for each integer s 1 , relations (29), (30) hold and that for each i { ( s 1 ) q + 1 , , s q 1 } , Equations (32)–(34) are true. For each natural number s set
x s = y s q .
Assumption (A2) and Equations (30), (32) and (35) imply that
x s + 1 T ( x s )
and that for each integer s 1 and each i { ( s 1 ) q + 1 , , s q 1 } ,
d ( y i + q , y i + q + 1 ) ϕ ( d ( y i , y i + 1 ) ) d ( y i , y i + 1 ) ( 1 + ϕ ( d ( y i , y i + 1 ) ) 1 ) / 2
2 1 ( 1 + ϕ ( d ( y i , y i + 1 ) ) ) d ( y i , y i + 1 ) .
Let s be a natural number. By (37),
i = s q + 1 ( s + 1 ) q 1 d ( y i , y i + 1 ) = i = ( s 1 ) q + 1 s q 1 d ( y i + q , y i + q + 1 )
i = ( s 1 ) q + 1 s q 1 d ( y i , y i + 1 ) ( 1 + ϕ ( d ( y i , y i + 1 ) ) ) / 2
and
i = s q + 1 ( s + 1 ) q 1 d ( y i , y i + 1 ) i = ( s 1 ) q + 1 s q 1 d ( y i , y i + 1 ) .
Let ϵ ( 0 , 1 ) and
p > 2 q 2 M ϵ 1 ( 1 ϕ ( ϵ q 1 ) ) 1
be an integer. Assume that s is a natural number and
i = ( s 1 ) q + 1 s q 1 d ( y i , y i + 1 ) > ϵ .
By (41), there exists j { ( s 1 ) q + 1 , , s q 1 } such that
d ( y i , y i + 1 ) > ϵ / q .
By (37) and (42),
d ( y j + q , y j + q + 1 ) 2 1 ( 1 + ϕ ( d ( y j , y j + 1 ) ) ) d ( y j , y j + 1 )
2 1 ( 1 + ϕ ( ϵ / q ) ) d ( y j , y j + 1 )
and
d ( y j , y j + 1 ) d ( y j + q , y j + q + 1 )
2 1 d ( y j , y j + 1 ) ( 1 ϕ ( ϵ / q ) ) 2 1 ϵ q 1 ( 1 ϕ ( ϵ / q ) ) .
Together with (37), this implies that
i = ( s 1 ) q + 1 s q 1 d ( y i , y i + 1 ) i = s q + 1 ( s + 1 ) q 1 d ( y i , y i + 1 ) )
2 1 ϵ q 1 ( 1 ϕ ( ϵ / q ) .
Thus, we have shown that the following property holds:
(i) if s is a natural number, then (41) implies (43).
We show that there exists s { 0 , , p ( ϵ ) } such that
i = ( s 1 ) q + 1 s q 1 d ( y i , y i + 1 ) ϵ .
Assume the contrary.
Then, for each s { 0 , , p ( ϵ ) } ,
i = ( s 1 ) q + 1 s q 1 d ( y i , y i + 1 ) ϵ .
Property (i) and (45) imply that for each s { 0 , , p ( ϵ ) } ,
i = ( s 1 ) q + 1 s q 1 d ( y i , y i + 1 ) i = s q + 1 ( s + 1 ) q 1 d ( y i , y i + 1 )
2 1 ϵ q 1 ( 1 ϕ ( ϵ / q ) ) .
In view of (28) and (46),
M q i = 1 q 1 d ( y i , y i + 1 ) i = 1 q 1 d ( y i , y i + 1 ) i = p ( ϵ ) q + 1 ( p ( ϵ ) + 1 ) q 1 d ( y i , y i + 1 )
= s = 0 p ( ϵ ) ( i = ( s 1 ) q + 1 s q 1 d ( y i , y i + 1 ) i = s q + 1 ( s + 1 ) q 1 d ( y i , y i + 1 ) )
2 1 p ( ϵ ) ϵ q 1 ( 1 ϕ ( ϵ / q ) )
and
p ( ϵ ) 2 M q 2 ϵ 1 ( 1 ϕ ( ϵ / q ) ) 1 .
This contradicts (40). The contradiction we have reached proves that there exists s { 0 , , p ( ϵ ) } such that (44) holds. By (29), (35), (39) and (44), for each integer m s ,
d ( x * , x m ) = d ( y ( m 1 ) q + 1 , y m q ) i = ( m 1 ) q + 1 m q 1 d ( y i , y i + 1 ) ϵ .
Theorem 3 is proved. □

5. Set-Valued Strict Contractions

Assume that E ( G ) is a closed set in X × X , c ( 0 , 1 ) , T : X 2 X { } , T ( x ) is closed for each x X , and that the following assumption holds.
(A3) For each ( x , y ) E ( G ) and each ξ T ( x ) ,
d ( ξ , { u T ( y ) : ( ξ , u ) E ( G ) } ) c d ( x , y ) .
We prove the following result.
Theorem 4.
Assume that x 0 X ,
{ u T ( x 0 ) : ( x 0 , u ) E ( G ) }
and that { ϵ i } i = 0 ( 0 , 1 ) satisfies
i = 1 ϵ i < .
Then, there exists a sequence { x i } i = 1 such that for each integer i 0 ,
( x i , x i + 1 ) E ( G ) , x i + 1 T ( x i )
and
d ( x i , x i + 1 ) d ( x i , { u T ( x i ) : ( x i , u ) E ( G ) } ) + ϵ i .
Moreover, if a sequence { x i } i = 1 satisfies (49) and (50) for each integer i 0 , then it converges to a point x * X and if, in addition, the graph of T is closed, then x * T ( x * ) .
Proof. 
By (47), there exists
x 1 T ( x 0 ) ,
such that
( x 0 , x 1 ) E ( G ) ,
d ( x 0 , x 1 ) d ( x 0 , { u T ( x 0 ) : ( x 0 , x 1 ) E ( G ) } ) + ϵ 0 .
Assume that n 1 is an integer and that a finite sequence { x i } i = 1 n was defined such that (49) and (50) are valid for each integer i { 0 , , n 1 } (Note that for n = 1 our assumption holds). By (49),
( x n 1 , x n ) E ( G ) , x n T ( x n 1 ) .
In view of (54), there exists
x n + 1 T ( x n )
such that
( x n , x n + 1 ) E ( G )
and
d ( x n , x n + 1 ) d ( x n , { u T ( x n ) : ( x n , u ) E ( G ) } ) + ϵ n .
Thus, by induction, we constructed the sequence { x i } i = 1 which satisfies (49) and (50) for each integer i 0 .
Assume that a sequence { x i } i = 0 X satisfies (49) and (50) for each integer i 0 . We show that it is a Cauchy sequence.
Let i 1 be an integer. Assumption (A3), (49) and (50) imply that
d ( x i + 1 , x i + 2 ) d ( x i + 1 , { u T ( x i + 1 ) : ( x i + 1 , u ) E ( G ) } ) + ϵ i + 1
c d ( x i , x i + 1 ) + ϵ i + 1 .
In view of (55),
d ( x 1 , x 2 ) c d ( x 0 , x 1 ) + ϵ 1 ,
d ( x 2 , x 3 ) c d ( x 1 , x 2 ) + ϵ 2 c 2 d ( x 0 , x 1 ) + c ϵ 1 + ϵ 2 .
Now, we show by induction that for every integer n 1 ,
d ( x n , x n + 1 ) c n d ( x 0 , x 1 ) + i = 0 n 1 c i ϵ n i .
(Note that by the relations above (56) holds for n = 1 , 2 ).
Assume that k 1 is an integer and that (56) holds for n = k . When combined with (55), this implies that
d ( x k + 1 , x k + 2 ) c d ( x k , x k + 1 ) + ϵ k + 1
c k + 1 d ( x 0 , x 1 ) + i = 0 k 1 c i + 1 ϵ k i + ϵ k + 1
= c k + 1 d ( x 0 , x 1 ) + i = 0 k c i ϵ k + 1 i .
Thus, (56) holds with n = k + 1 too. Thus, we have showed by induction that (56) holds for all integers n 1 . By (48) and (56),
n = 1 d ( x n , x n + 1 ) n = 1 ( c n d ( x 0 , x 1 ) + i = 1 n c n i ϵ i )
d ( x 0 , x 1 ) n = 1 c n + i = 1 ( j = 0 c j ) ϵ i
( n = 0 c n ) [ d ( x 0 , x 1 ) + n = 1 ϵ n ] < .
Thus { x n } n = 0 is indeed a Cauchy sequence and there exists
x * = lim n x n .
Clearly, if the graph of T is closed, then x * T ( x * ) .
Theorem 5.
Assume that the graph of T is closed and that ϵ > 0 . Then, there exists δ > 0 such that if x X and
d ( x , { u T ( x ) : ( x , u ) E ( G ) } ) < δ ,
then there is x ¯ X such that x ¯ T ( x ¯ ) and d ( x , x ¯ ) ϵ .
Proof. 
Choose
δ ( 0 , 4 1 ( 1 c ) ϵ )
Let x X and (57) hold. Set
x 0 = x .
By (57) and (59), there is
x 1 T ( x 0 )
such that
( x 0 , x 1 ) E ( G ) , d ( x 0 , x 1 ) < δ ,
d ( x 0 , x 1 ) d ( x 0 , { u T ( x 0 ) : ( x 0 , u ) E ( G ) } ) ( 1 + c ) ( 2 c ) 1 .
By induction, we construct a sequence { x n } n = 2 X such that for each integer n 0 ,
x n + 1 T ( x n ) , ( x n , x n + 1 ) E ( G ) ,
d ( x n + 1 , x n ) d ( x n , { u T ( x n ) : ( x n , u ) E ( G ) } ) ( 1 + c ) ( 2 c ) 1 .
(Note that by (61), (62) the relations above hold for n = 0 ).
Assume that k is a natural number number and (63) and (64) hold for all integers n = 0 , , k 1 . Then,
( x k 1 , x k ) E ( G ) , x k T ( x k 1 ) .
By (A3),
{ u T ( x k ) : ( x k , u ) E ( G ) }
and there is
x k + 1 { u T ( x k ) : ( x k , u ) E ( G ) }
such that
d ( x k , x k + 1 ) d ( x k , { u T ( x k ) : ( x k , u ) E ( G ) } ) ( 1 + c ) ( 2 c ) 1 .
Thus, by induction we constructed the sequence { x n } n = 0 X , such that, for each integer n 0 , relations (63) and (64) hold. Assumption (A3), (63) and (64) imply that for each integer n 1 ,
d ( x n , x n + 1 ) ( ( 1 + c ) / 2 ) d ( x n , x n 1 )
and
d ( x n , x n + 1 ) [ ( 1 + c ) / 2 ] n d ( x 0 , x 1 ) [ ( 1 + c ) / 2 ] n δ .
Therefore,
n = 0 d ( x n , x n + 1 ) < ,
{ x n } n = 0 is a Cauchy sequence and there exists x ¯ X such that
x ¯ = lim n x n .
Since the graph of T is closed, we have
x ¯ T ( x ¯ ) .
By (58) and (65),
d ( x 0 , x ¯ ) = lim n d ( x 0 , x n ) n = 0 d ( x n , x n + 1 )
i = 0 [ ( 1 + c ) / 2 ] i δ = 2 δ / ( 1 c ) < ϵ .
This completes the proof of Theorem 5. □
Theorem 6.
Let ϵ ( 0 , 1 ) , M > 0 ,
δ ( 0 , 2 1 ( 1 c ) ϵ )
and a natural number n 0 satisfy
c n 0 ( 2 M + 1 ) < ϵ / 2 .
Then, for each sequence { x i } i = 0 X , such that
{ u T ( x 0 ) : ( x 0 , u ) E ( G ) } ,
d ( x 0 , { u T ( x 0 ) : ( x 0 , u ) E ( G ) } ) M
and that for each integer n 0 ,
x n + 1 T ( x n ) , ( x n , x n + 1 ) E ( G ) ,
d ( x n , x n + 1 ) d ( x n , { u T ( x n ) : ( x n , u ) E ( G ) } ) + δ
the inequality
d ( x n + 1 , x n ) ϵ f o r a l l i n t e g e r s n n 0 .
Proof. 
Let { x n } n = 0 X satisfy (68), (69) and (70) for each integer i 0 . By (68) and (69),
d ( x 0 , x 1 ) δ + d ( x 0 , { u T ( x 0 ) : ( x 0 , u ) E ( G ) } ) M + 1 .
Assumption (A3), (69) and (70) imply that for each integer n 1 ,
d ( x n + 1 , x n + 2 )
d ( x n + 1 , { u T ( x n + 1 ) : ( x n + 1 , u ) E ( G ) } ) + δ c d ( x n , x n + 1 ) + δ .
By induction, we show that for each integer n 1 ,
d ( x n + 1 , x n ) δ i = 0 n 1 c i + c n d ( x 0 , x 1 ) .
Clearly, for n = 1 , (73) holds. Assume that k 1 is an integer and that (73) holds with n = k . Together with (72), this implies that
d ( x k + 2 , x k + 1 ) c d ( x k , x k + 1 ) + δ δ i = 0 k c i + c k + 1 d ( x 0 , x 1 )
and (73) holds for n = k + 1 . Thus, (73) holds for each integer n 0 . By (66), (67) and (71), for each integer n n 0 ,
d ( x n , x n + 1 ) δ ( 1 c ) 1 + c n ( 2 M + 1 ) ϵ .
Theorem 6 is proved. □
Theorems 5 and 6 imply the following additional result.
Theorem 7.
Assume that the graph of T is closed and let positive numbers ϵ and M be given. Then, there exist δ > 0 and an integer n 0 1 such that if a sequence { x i } i = 0 X satisfies
d ( x 0 , { u T ( x 0 ) : ( x 0 , u ) E ( G ) } ) M
and that for each integer n 0 ,
( x n , x n + 1 ) E ( G ) , x n + 1 T ( x n ) ,
d ( x n , x n + 1 ) d ( x n , { u T ( x n ) : ( x n , u ) E ( G ) } ) + δ
for each integer n n 0 there is a point y X such that y T ( y ) and d ( y , x n ) ϵ .

6. Conclusions

In out work, we show the existence of a fixed point for single valued and set-valued self-mappings of metric spaces with graphs which are of the contractive type. We also show the convergence of iterates of these mappings to fixed points. In particular, our results are true for metric spaces with symmetric graphs. They are extensions of the results of [24], which were obtained under some additional restrictive assumption on a graph which is not used here. Our results can be helpful if one needs to find an approximate solution of a set-valued inclusion. The further development of our research is in generalizing our results under the presence of computational errors when the next iterate x t + 1 does not belong to T ( x t ) , but to its small neighborhood.

Funding

This research received no external funding.

Data Availability Statement

No new data were created.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Bargetz, C.; Medjic, E. On the rate of convergence of iterated Bregman projections and of the alternating algorithm. J. Math. Anal. Appl. 2020, 481, 23. [Google Scholar] [CrossRef]
  2. Djafari-Rouhani, B.; Kazmi, K.R.; Moradi, S.; Ali, R.; Khan, S.A. Solving the split equality hierarchical fixed point problem. Fixed Point Theory 2022, 23, 351–369. [Google Scholar] [CrossRef]
  3. Du, W.-S. Some generalizations of fixed point theorems of Caristi type and Mizoguchi–Takahashi type under relaxed conditions. Bull. Braz. Math. Soc. New Ser. 2019, 50, 603–624. [Google Scholar] [CrossRef]
  4. Goebel, K.; Reich, S. Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings; Marcel Dekker: New York, NY, USA; Basel, Switzerland, 1984. [Google Scholar]
  5. Karapinar, E.; Agarwal, R.P.; Yesilkaya, S.S. Perov type mappings with a contractive iterate. J. Nonlinear Convex Anal. 2021, 22, 2531–2541. [Google Scholar]
  6. Karapinar, E.; Mitrovic, Z.; Ozturk, A.; Radenovic, S. On a theorem of Ciric in b-metric spaces. Rend. Circ. Mat. Palermo 2021, 70, 217–225. [Google Scholar] [CrossRef]
  7. Khan, A.A.; Li, J.; Reich, S. Generalized projections on general Banach spaces. J. Nonlinear Convex Anal. 2023, 24, 1079–1112. [Google Scholar]
  8. Kozlowski, W.M. An Introduction to Fixed Point Theory in Modular Function Spaces; Springer: Cham, Switzerland, 2014; pp. 159–222. [Google Scholar]
  9. Petruşel, A.; Petruşel, G.; Yao, J.-C. Multi-valued graph contraction principle with applications. Optimization 2020, 69, 1541–1556. [Google Scholar] [CrossRef]
  10. Petrusel, A.; Petruşel, G.; Yao, J.-C. Graph contractions in vector-valued metric spaces and applications. Optimization 2021, 70, 763–775. [Google Scholar] [CrossRef]
  11. Rakotch, E. A note on contractive mappings. Proc. Am. Math. Soc. 1962, 13, 459–465. [Google Scholar] [CrossRef]
  12. Reich, S.; Zaslavski, A.J. Genericity in Nonlinear Analysis; Developments in Mathematics; Springer: New York, NY, USA, 2014; Volume 34. [Google Scholar]
  13. Suparatulatorn, R.; Cholamjiak, W.; Suantai, S. A modified S-iteration process for G-nonexpansive mappings in Banach spaces with graphs. Numer. Algorithms 2018, 77, 479–490. [Google Scholar] [CrossRef]
  14. Aleomraninejad, S.M.A.; Rezapour, S.; Shahzad, N. Some fixed point results on a metric space with a graph. Topol. Appl. 2012, 159, 659–663. [Google Scholar] [CrossRef]
  15. Bojor, F. Fixed point of ϕ-contraction in metric spaces endowed with a graph. Ann. Univ. Craiova Ser. Mat. Inform. 2010, 37, 85–92. [Google Scholar]
  16. Bojor, F. Fixed point theorems for Reich type contractions on metric spaces with a graph. Nonlinear Anal. 2012, 75, 3895–3901. [Google Scholar] [CrossRef]
  17. 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. [Google Scholar] [CrossRef]
  18. Samei, M.E. Some fixed point results on intuitionistic fuzzy metric spaces with a graph. Sahand Commun. Math. Anal. 2019, 13, 141–152. [Google Scholar] [CrossRef]
  19. Suantai, S.; Donganont, M.; Cholamjiak, W. Hybrid methods for a countable family of G-nonexpansive mappings in Hilbert spaces endowed with graphs. Mathematics 2019, 7, 936. [Google Scholar] [CrossRef]
  20. Suantai, S.; Kankam, K.; Cholamjiak, P.; Cholamjiak, W. A parallel monotone hybrid algorithm for a finite family of G-nonexpansive mappings in Hilbert spaces endowed with a graph applicable in signal recovery. Comp. Appl. Math. 2021, 40, 145. [Google Scholar] [CrossRef]
  21. Suparatulatorn, R.; Suantai, S.; Cholamjiak, W. Hybrid methods for a finite family of G-nonexpansive mappings in Hilbert spaces endowed with graphs. AKCE Int. J. Graphs Comb. 2017, 14, 101–111. [Google Scholar] [CrossRef]
  22. Jachymski, J. The contraction principle for mappings on a metric space with a graph. Proc. Am. Math. Soc. 2008, 136, 1359–1373. [Google Scholar] [CrossRef]
  23. Reich, S.; Zaslavski, A.J. Contractive mappings on metric spaces with graphs. Mathematics 2021, 9, 2774. [Google Scholar] [CrossRef]
  24. Reich, S.; Zaslavski, A.J. Existence of a fixed point and stability results for contractive mappings on metric spaces with graphs. 2023; submitted. [Google Scholar]
  25. Gwóźdxzx-ukawska, 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. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Zaslavski, A.J. Fixed Point and Convergence Results for Contractive-Type Self-Mappings of Metric Spaces with Graphs. Symmetry 2024, 16, 119. https://doi.org/10.3390/sym16010119

AMA Style

Zaslavski AJ. Fixed Point and Convergence Results for Contractive-Type Self-Mappings of Metric Spaces with Graphs. Symmetry. 2024; 16(1):119. https://doi.org/10.3390/sym16010119

Chicago/Turabian Style

Zaslavski, Alexander J. 2024. "Fixed Point and Convergence Results for Contractive-Type Self-Mappings of Metric Spaces with Graphs" Symmetry 16, no. 1: 119. https://doi.org/10.3390/sym16010119

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop