A convergence result on random products of mappings in metric trees

Let X be a metric space and {T1, ..., TN} be a finite family of mappings defined on D ⊂ X. Let r : ℕ → {1,..., N} be a map that assumes every value infinitely often. The purpose of this article is to establish the convergence of the sequence (xn) defined by x0∈D;andxn+1=Tr(n)(xn),foralln≥0. In particular we prove Amemiya and Ando's theorem in metric trees without compactness assumption. This is the first attempt done in metric spaces. These type of methods have been used in areas like computerized tomography and signal processing. Mathematics Subject Classification 2000: Primary: 06F30; 46B20; 47E10.


Introduction
Many problems in mathematics [1] and physical sciences [2][3][4] uses a techniques known as search for a common fixed point. Indeed, let X be a metric space and suppose T 1 ,..., T N are pairwise distinct self-mappings of some nonempty and closed subset D of X. Suppose further that the fixed point set, Fix(T i ) = {x D; T i (x) = x}, of each mapping T i is nonempty and that C = Fix(T 1 ) ∩ · · · ∩ Fix(T N ) = ∅. The aim is to find a common fixed point of these mappings. One frequently employed approach is the following.
Let r be a random mapping for {1,..., N}, i.e., a surjective mapping from N onto {1,..., N} that takes each value in {1,...,N} infinitely often. Then generate a random sequence (x n ) by x 0 D arbitrary, and x n+1 = T r(n) (x n ), for all n > 0, and hope that this sequence converges to a point in C. We call it a random or unrestricted product (resp. iteration). For products generated by using control sequence, there are many results: for instance, cyclic control arises when r(n) = n + 1 mod N (see, for example, [5]).
In general, this random product fails to have well convergence behavior. The first positive results were done in the case when D = X is a Hilbert space and each mapping T i , is the projection onto some nonempty, closed and convex subset C i of X ; hence Fix (T i ) = C i , i = 1, ..., N. The problem of finding a common fixed point is then the wellknown convex feasibility problem (see, for example, [5]). Combettes article [6] proposed several interesting applications of this problem. Some of the early known results in this case are.
(1) Amemiya and Ando [7]: If each set C i , is a closed subspace, then the random product converges weakly to the projection onto C.
(2) Bruck [8]: If some set C i , is compact, then the random product converges in norm to a point in C. If N = 3 and each set C i , is symmetric, then the random product converges weakly to a point in C (see also [[9], Theorem 2]).
The authors in [14] were successful in their extension of Amemiya and Ando's [7] results from Hilbert spaces to Banach spaces. In this study, we investigate Amemiya and Ando's result and [14]'s results in metric spaces. Such extension is the first attempt so far.
The main difficulty faced in such extensions is the heavy use of the linearity structure of either the Hilbert space in [7] or Banach spaces in [14]. Indeed when one tries to extend concepts from linear functional analysis, one has to pay attention to look deep into the supporting basic ideas and what intrinsic interrelations exist between them. Most of the main theorems in nonlinear functional analysis were done in the framework of linear Banach spaces. So it was interesting to investigate the extension of these fundamental results in nonlinear structures like metric spaces. As an example of this research is Kirk's fixed point theorem [15]. Many researchers have tried to do it but the best approach is the one given by Penot [16]. The impact of this approach went beyond what it intended to do initially. This research follows the same motivations. In particular we investigate the concept of weak convergence in metric spaces which is central, for instance, in [14]. We consider the case of metric trees to illustrate some of these ideas.

Basic definitions and results
Metric trees were first introduced by Tits [17] in 1977. A metric tree is a metric space (M, d) such that for every x, y in M there is a unique arc between x and y and this arc is isometric to an interval in ℝ. For example, a connected graph without loop is a metric tree. One basic property of metric trees is their one dimensionality. Again in the late seventies, while studying t-RNA molecules of the E. Coli bacterium Eigen raised several questions which led Dress [18,19] to construct metric trees, (named as T-theory). Metric trees also arise naturally in the study of group isometries of hyperbolic spaces. For metric properties of trees we refer to [20].
Since a metric tree is a space in which there is only one path between two points x and y, this would imply that if z is a point between x and y, by which we mean if d(x, z) + d(z, y) = d(x, y) then we know that z is actually on the path between x and y. This will motivate the next concept of a metric interval.  Metric trees are very special. They enjoy properties which are shared by l ∞ and Hilbert space. In particular, Kirk [21] showed that complete metric trees are hyperconvex. Since the weak topology has an intimate relationship with convexity, let us define convex subset in this setting. Definition 2.3. Let M be a metric tree and C ⊂ M. We say that C is convex if for all Clearly a metric tree M and the empty set ∅ are convex. Also any closed ball B(a, r) = {z M: d(a, z) ≤ r} in a metric tree is also convex. Let C(M) denotes the collection of all closed and convex subsets of M, we set: Note that C(M) is invariant by intersection, i.e. the intersection of any family of convex subsets of M is convex. We need the following result of Baillon [22] in order to prove our first fact about C(M).
Theorem 2.1. Since convex subsets of a metric tree are metric trees, then they are hyperconvex by [21]. This combined with Baillon's result we get the following theorem.
Theorem 2.2. Let M be a bounded complete metric tree and let {C b } b Γ be a family of nonempty, closed and convex subsets of M such that This is known as compactness of C(M) according to Penot's formulation [16]. Note the slight difference between the statements of the two theorems. Indeed the intersection of two convex sets is convex while the intersection of two hyperconvex sets may not be hyperconvex.
Next we discuss the nearest point projections in metric trees. Let C be a nonempty, closed and convex subset of a complete metric tree M. For any x M, denote In a Hilbert space, the metric projections on closed and convex subsets are nonexpansive. In uniformly convex spaces, the metric projections are uniformly Lipschitzian. In fact, they are nonexpansive if and only if the space is Hilbert. In what follows we will show that the metric projections in metric trees are nonexpansive. This result is not true in hyperconvex metric spaces.
Lemma 2.1. [23,24]If C is a nonempty, closed and convex subset of a complete metric tree M, then for any x M there exists a unique c x C such that dist(x,C) = d(x,c x ), which means that P C is single valued. Moreover if c C we have or P C (x) = P C (y), for any x, y M. In particular, P C is nonexpansive. Next we prove another property of the mapping P C . Proposition 2.1. If C is a nonempty, closed and convex subset of a complete metric tree M, then for any x M we have In other words, P C is a sunny nonexpansive mapping [25,26].
Since C is convex, we get that w C. Also the definition of w implies d(y, w) + d(w, P C (y)) = d(y, P C (y)).
The properties of P C will force P C (y) = w which will imply P C (y) [y, In particular we get d(x, P C (y)) ≤ d(x, P C (x)) which implies P C (y) = P C (x).

Amemiya and Ando's theorem in metric trees
In 1965 Amemiya and Ando [7] proved the astonishing result. converges weakly in H. Today, 46 years later, it is still not known whether (x n ) converges strongly, even for N = 3. There is doubt expressed in the literature as to whether this sequence does converge strongly (cf. [ [27], Example 4]) for an interesting example of possible relevance. In general, strong convergence may be obtained when some kind of compactness is assumed. Next, we show that in the case of metric trees, we have strong convergence without any compactness assumption. The Amemiya and Ando's theorem was preceded by von Neumann [28] for alternating products of two projections (with strong convergence as the conclusion). x 0 ∈ X, and x n+1 = P C r(n+1) (x n ), for all n ≥ 0.
converges strongly in M. Moreover we have

Fix
Proof. c C. Using Lemma 2.1 we have for any n ≥ 0. In particular we have for any n ≥ 0 and h ≥ 0. Since P C r(n) (c) = c, we get d(x n+1 ,c) ≤ d(x n , c), for any n ≥ 0.
In other words, the sequence (d(x n ,c)) is decreasing. Hence lim If we let n ∞, we get The definition of c 0 implies which implies d(c, c 0 ) = 0, or c = c 0 . Remark 3.1. In [14]the authors made heavy use of the property that in smooth reflexive Banach spaces X, if E is a closed subspace of X, then there is at most one nonexpansive retraction of X onto E [26]. In the case of metric trees, we have a similar result. Indeed, let C be a nonempty, closed and convex subset of a metric tree M. Then P C is a sunny nonexpansive retract of M onto C. Let Q : M C be another sunny mapping. Let x M. There exists w M such that [x, P C (x)] ∩ [x, Q(x)] = [x, w]. Since C is convex, then w C. Also since d(x,w) + d(w, P C (x)) = d(x, P C (x)), the definition of P C (x) will force P C (x) = w. Hence P C (x) [x, Q(x)]. Since Q is sunny, we must have Q(P C (x)) = Q(x), which implies P C (x) = Q(x). In other words, P C is the only sunny retract from M onto C.
In the next section we investigate the behavior of the random product of mappings other than the nearest point projections.

Random product of mappings in metric trees
As the authors did in [14], one inspires itself from the Amemiya and Ando's work in Hilbert spaces to extend it to other underlying spaces. In particular the authors in [14] introduced the concepts of (W) and (S) properties. Since the (W) property is strongly linked to the weak-topology, we are not able to extend such property to metric trees.
Indeed let c 0 M be a common fixed point of T 1 , ...,T N . Let us only prove that Since each mapping is nonexpansive, we get Since T N satisfies the property (S), we get T N (c) = c. Similarly one will show that T i (c) = c, for i = 1,...,N.
Another property discovered by Caristi [29] (see also [30]) and extensively used to obtain some beautiful results extending Banach contraction principle is the following definition.
Note that T is a nonexpansive retraction and Fix(T) = [0,1]. In particular (T n (x)) is convergent and its limit is T(x). But the nearest point projection on [0,1] is the map which is different from T. Moreover one can easily show that for any x [0,2], where l(t) = t. Therefore T satisfies the (C)-l property.
In the next result, we show how Theorem 3.2 extends to the family of mappings satisfying the (C)-l property.
Theorem 4.1. Let M be a complete metric space. Let T 1 ,...,T N be a finite family of pairwise distinct self-mappings of some nonempty and closed subset D of M. Suppose further that each map T i , i = 1,..., N, is continuous and satisfies the (C)-l property, with the same function l. Let r be a random mapping for {1,...,N}, i.e., a surjective mapping from N onto {1,...,N} that takes each value in{1,...,N} infinitely often. Then the random sequence (x n ) defined by x 0 D arbitrary, and x n+1 = T r(n) (x n ), for all n > 0, is convergent. Its limit is a common fixed point of the mappings T 1 ,...,T N . Proof. Let x D. Our assumptions on the mappings T i imply for any n ≥ 0. In particular we have for any n ≥ 0 and h ≥ 0. On the other hand, we have l(x n+1 ) ≤ l(x n ), for any n ≥ 0. Therefore the positive sequence (l(x n )) is convergent. Clearly this will imply that the sequence (x n ) is Cauchy. Since M is complete, there exists c M such that lim n→∞ x n = c ∈ D since D is closed. For any i {1,..., N}, there exists a subsequence of (x j(n) ) such that x j(n)+1 = T i (x j(n) ). Hence T i (c) = c, for any i = 1,..., N.
Note that the limit defines a retraction on the common fixed point set of the mappings T 1 ,...,T N . But this retraction may not be equal to the nearest point projection even in the case of a metric tree as the Example 4.1 shows.
The next result investigates the extension of some of the results discovered in [14]. Before we do this, we need to discuss the weak-topology in the nonlinear setting of metric spaces. Indeed, let (x n ) be a bounded sequence in the metric tree M. Define the real-valued function where U is a nontrivial ultrafilter [31]. We have the following theorem which will play a central role in our work. For any ε > 0, consider the set Using the properties of metric trees, we know that C ε is a nonempty, bounded and convex subset of M. Since ϕ U is continuous, then it is also closed. Using the compactness of C(M), then Now, we will show that this intersection is reduced to one point. Indeed, let us Fix z U ∈ M such that ϕ U (z U ) = r. Let x be any point in M. Using the properties of metric trees, for any n ≥ 1, there exists . Obviously this will imply d(w, z U ) = 0 or lim U d(w n , z U ) = 0 . Also since d(x n , w n ) + d(w n ,x) = d(x n ,x) for any n ≥ 1, then we have . This latest identity, also known as Uniform Opial condition, will easily show that z U is unique. Definition 4.3. Let M be a metric tree and (x n ) be a bounded sequence in M. For any nontrivial ultrafilter U, the unique point z Ufound in Theorem 4.2 is called the weaklimit of (x n ) along U. We will say that (x n ) is weakly convergent if and only if z U = z V, for any nontrivial ultrafilters Uand V.
It is because of the absence of a dual space that we used Opial behavior to try to catch the weak-limit of a bounded sequence. In the next result we show some close similarities between the classical weak-limit point in Banach spaces and the one introduced above.

Fix
Proof. i ≥ 1. Set P n the nearest point projection on conv(x i ) i≥n . Since U is nontrivial then where we used the nonexpansiveness of P n . This obviously implies which implies P n (z U ) = z U or z U ∈ con(x i ) i≥n for any n ≥ 1. So z U ∈ (x n ). Next we discuss the behavior of mapping which satisfies the property (S). Theorem 4.3. Let M be a complete metric tree. Let T : C C be a nonexpansive mapping which satisfies the property (S), where C is a nonempty, bounded, closed, and convex subset of M. Then the sequence (T n (x)) converges weakly to a fixed point of T.
Proof. Let U and V be any nontrivial ultrafilters. Let z U and z V be the minimum point of ϕ U (z) = lim U d(T n (x), z) and ϕ V (z) = lim V d(T n (x), z) , respectively. Proposition 4.1 implies that z U and z V are in Ω(T n (x)) ⊂ C. Next we will prove that z U and z V are fixed point of T. It is enough to prove that T(z U ) = z U . Since C is hyperconvex and bounded, we know that T has a nonempty fixed point set (see [32,33]). Let c Fix(T). The sequence (d(T n (x),c)) is a decreasing sequence of positive numbers. Since T satisfies the property (S), we deduce that lim n→∞ d(T n (x), T n+1 (x)) = 0 . Hence which implies ϕ U (T(z)) ≤ ϕ U (z), for any z C. The properties of z U will force the identity T(z U ) = z U , i.e., z U ∈ Fix(T). Note that the sequence (d(T n (x), z U )) is decreasing which implies