Three Convergence Results for Iterates of Nonlinear Mappings in Metric Spaces with Graphs

: In 2007, in our joint work with D. Butnariu and S. Reich, we proved that if for a self-mapping of a complete metric that is uniformly continuous on bounded sets all its iterates converge uniformly on bounded sets, then this convergence is stable under the presence of small errors. In the present paper, we obtain an extension of this result for self-mappings of a metric space with a graph


Introduction
During the last sixty years, many results have been obtained in the fixed-point theory of nonlinear operators in complete metric spaces [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15].The first result in this area of research is Banach's celebrated theorem [16], which shows the existence of a unique fixed point of a strict contraction.This area of research includes the analysis of the asymptotic behavior of (inexact) iterates of a nonexpansive operator and their convergence to its fixed points.This research is also devoted to feasibility, common fixed points, iterative methods and variational inequalities with numerous applications in engineering and the medical and natural sciences [17][18][19][20][21][22][23][24].
In our joint paper with D. Butnariu and S. Reich [5], we proved that if for a selfmapping of a complete metric that is uniformly continuous on bounded sets all its iterates converge uniformly on bounded sets, then this convergence is stable under the presence of a small errors.In our present work, we obtain an extension of this result for self-mappings of a metric space with a graph.We also obtain a convergence result for a contractive-type mapping in a metric space with a graph.

The First and the Second Main Results
Assume that (X, ρ) is a metric space.For every point u ∈ X and each nonempty set For every point u ∈ X and each number r > 0, put For every operator S : X → X, set S 0 (u) = u for all u ∈ X, S 1 = S and S i+1 = S • S i for every nonnegative integer i.We denote the set of all fixed points of S by F(S).
Assume that G is a graph such that V(G) ⊂ X is the set of all its vertices and the set E(G) ⊂ X × X is the set of all its edges.We also assume that The graph G is identified with the pair (V(G), E(G)).Fix θ ∈ X. Assume that A : X → X is a mapping and that the following assumptions hold: (A1) There exists a unique point x A ∈ X satisfying A(x A ) = x A .(A2) A n (x) → x A as n → ∞ uniformly over all bounded subsets of X. (A3) A is bounded on bounded subsets of X. (A4) For each , M > 0 there exists δ > 0 such that for each x, y ∈ B(θ, M) satisfying (x, y) ∈ E(G) and ρ(x, y) ≤ δ the relations (A(x), A(y)) ∈ E(G) and ρ(A(x), A(y)) ≤ are valid.The next result is proved in Section 3.
Theorem 1. Assume that K is a nonempty bounded subset of X and that > 0.Then, there exist δ > 0 and a natural number N such that for each integer n ≥ N and each sequence {x i } n i=0 ⊂ X, which satisfies for each integer i ∈ {0, . . ., n − 1}, the inequalities hold.
Since Theorem 1 holds for any positive , it easily implies the following result.
Corollary 1. Assume that {x i } ∞ i=0 is a bounded sequence such that The next result is also proved in Section 3.
Theorem 2. Assume that > 0.Then, there exist δ > 0 such that for each sequence for each integer i ≥ 0, the inequality ρ(x i , x A ) ≤ holds for each integer i ≥ 0.
It should be mentioned that our results are obtained for a large class of operators.They cover the case when E(G) = X × X, which was considered in [5], the class of nonexpansive mappings A : X → X on a metric space X with graphs satisfying for each (x, y) ∈ E(G).It also contains the class of monotone nonexpansive mappings [35,36] and the class of uniformly locally nonexpansive mappings [37].
Let us complete the proof of Theorem 1. Assume that n ≥ N is an integer and that the sequence {x i } n i=0 ⊂ X satisfies and for every i ∈ {0, . . ., n − 1}, In n ≤ 2N, then the assertion of Theorem 1 follows from Lemma 1.Therefore, we may assume without loss of generality that We prove that ρ(x j , x A ) ≤ , j = N, . . ., n.
Assume the contrary.Then, there exists an integer q ∈ (2N, n] such that By ( 21) and ( 22), we may assume without loss of generality that Define We show that {z i } 2N i=0 satisfies the assumptions of Lemma 1.By ( 20) and ( 24), we need only to show that z 0 ∈ K.In view of ( 21), ( 23) and ( 24), Lemma 1 and ( 24) imply that This contradicts (22).The contradiction we have reached completes the proof of Theorem 1.

Proof of Theorem 2
Proof.We may assume that < 1. Set K = B(x A , 4).Theorem 1 and the continuity of A at x A imply that there exist δ ∈ (0, /2) and a natural number N such that the following property holds: (a) For each integer n ≥ N and each sequence {x i } n i=0 ⊂ X that satisfies for each integer i ∈ {0, . . ., n − 1}, the inequalities and hold.

The Third Main Result
Assume that (X, ρ) is a complete metric space and G is a graph such that V(G) ⊂ X is the set of all its vertices and the set E(G) ⊂ X × X is the set of all its edges.We also assume that the space X is bounded: Assume that Q is a natural number Q such that the following assumption holds: (A5) For each x, y ∈ X there exist x 0 , . . ., x q ∈ X such that q ≤ Q, and that the following assumption holds: (A6) For all x, y ∈ X, if (x, y) ∈ E(G), then (A(x), A(y)) ∈ E(G) and ρ(A(x), A(y)) ≤ φ(ρ(x, y))ρ(x, y).
We prove the following result.
Theorem 3.There exists x A ∈ X such that A n (x) → x A as n → ∞ uniformly for x ∈ X.Moreover, if A is continuous at x A , then A(x A ) = x A .
Proof.Let ∈ (0, 1).In order to prove our theorem, it is sufficient to show that there exists a natural number p such that for each x, y ∈ X, ρ(A p (x), A p (y)) ≤ .

Conclusions
In this paper, we study the behaviour of inexact iterates of a self-mapping A of a metric space with a graph.Assuming that A is bounded on bounded sets and that it uniformly converges on bounded sets to a unique fixed point, we show that this convergense is stable under the presence of computational errors.A prototype of our results for self-mappings of a metric space without graphs was obtained in our joint paper with D. Butnariu and S. Reich [5].It should be mentioned that our results are obtained for a large class of operators.They cover the case when E(G) = X × X, which was considered in [5], the class of nonexpansive mappings A :→ X on a metric space X with graphs satisfying ρ(A(x), A(y)) ≤ ρ(x, y) for each (x, y) ∈ E(G).This also contains the class of monotone nonexpansive mappings [35,36] and the class of uniformly locally nonexpansive mappings [37].