- WA Kirk
^{1}Email author

**2010**:393470

https://doi.org/10.1155/2010/393470

© W. A. Kirk. 2010

**Received: **4 March 2010

**Accepted: **10 May 2010

**Published: **8 June 2010

## Abstract

It is proved that a complete geodesically bounded -tree is the closed convex hull of the set of its extreme points. It is also noted that if is a closed convex geodesically bounded subset of a complete -tree and if a nonexpansive mapping satisfies then has a fixed point. The latter result fails if is only continuous.

## 1. Introduction

Recall that for a metric space a geodesic path (or metric segment) joining and in is a mapping of a closed interval into such that and for each Thus is an isometry and An -tree (or metric tree) is a metric space such that:

(i)there is a unique geodesic path (denoted by ) joining each pair of points

From (i) and (ii), it is easy to deduce that

(Here denotes the usual Euclidean distance and denotes the origin.) For the river metric on , if two points , and are on the same vertical line, define Otherwise define where and More subtle examples of -trees also exist, for example, the real tree of Dress and Terhalle [2].

It is shown in [3] that -trees are hyperconvex metric spaces (a fact that also follows from Theorem B of [4] and the characterization of [5]). They are also CAT spaces in the sense of Gromov (see, e.g., [6, page 167]). Moreover, complete and geodesically bounded -trees have the fixed point property for continuous maps. This fact is a consequences of a result of Young [7] (see also [8]), and it suggests that complete geodesically bounded -trees have properties that one often associates with compactness. The two observations below serve to affirm this.

## 2. A Krein-Milman Theorem

In [9] Niculescu proved that a nonempty compact convex subset of a complete CAT space (called a global NPC space in [9]) is the convex hull of the set of all its extreme points. Subsequently, in [10], Borkowski et al. proved (among other things) that compactness is not needed in the special case when is a complete and bounded -tree. Here we show that in complete -trees even the boundedness assumption may be relaxed.

Theorem 2.1.

Let be a complete and geodesically bounded -tree. Then is the convex hull of its set of extreme points.

Proof.

Let and let We will show that lies on a segment joining to some other element of We proceed by transfinite induction. Let denote the set of all countable ordinals, let let and assume that for all with has been defined so that the following condition holds:

There are two cases.

(1) If there is nothing to prove because . Otherwise, there are elements such that lies on the segment and At least one of these points say does not lie on the segment . Set and observe that lies on the segment

(2) is a limit ordinal. Since is geodesically bounded, it must be the case that This implies that is a Cauchy net. Since is complete, it must converge to some

Therefore, is defined for all Since is geodesically bounded, But since is uncountable, it is not possible that for each Hence this transfinite process must terminate, and for some It now follows from (i) that and lies on the segment

Remark 2.2.

The above proof shows that in fact each point of is on a segment joining any given extreme point to some other extreme point.

## 3. A Fixed Point Theorem

then has a fixed point (see [11, Theorem ] also [12, Corollary ]). This fact carries over to -trees since -trees are also CAT spaces. However, we note here that if is an -tree, then again boundedness of can be replaced by the assumption that is merely geodesically bounded. In fact, we prove the following. (In the following theorem, we assume is nonexpansive relative to the Hausdorff metric on the bounded nonempty closed subsets of

Theorem 3.1.

Suppose is a closed convex and geodesically bounded subset of a complete -tree and suppose is a nonexpansive mapping taking values in the family of nonempty bounded closed convex subsets of Suppose also that Then there is a point for which

We will need the following result in the proof of Theorem 3.1. (See [13, 14] for more general set-valued versions of this theorem.)

Theorem 3.2.

Proof of Theorem 3.1.

Thus – a contradiction. Therefore, there exists such that

Corollary 3.3.

Suppose is a closed convex and geodesically bounded subset of a complete -tree and suppose is a nonexpansive mapping for which Then has a fixed point.

Example 3.4.

In view of the fact that continuous self-maps of have fixed points, it is natural to ask whether Corollary 3.3 holds for continuous mappings. The answer is no, even when is bounded. Let be the Euclidean plane with the radial metric. Let be a sequence of distinct points on the unit circle, and let We now define a continuous fixed-point free map for which . First move each point of the segment to the right onto a segment where and is on the ray which extends (Thus For each let denote the point on the segment which has distance from . It is now clearly possible to construct a continuous (even lipschitzian) fixed point-free map (a shift) of the segment onto the segment for which Thus for all

Remark 3.5.

Corollary 3.3 for bounded is also a consequence of Theorem of [15].

## Authors’ Affiliations

## References

- Tits J:
**A "theorem of Lie-Kolchin" for trees.**In*Contributions to Algebra*. Academic Press, New York, NY, USA; 1977:377–388.Google Scholar - Dress AWM, Terhalle WF:
**The real tree.***Advances in Mathematics*1996,**120**(2):283–301. 10.1006/aima.1996.0040MathSciNetView ArticleMATHGoogle Scholar - Kirk WA:
**Hyperconvexity of -trees.***Fundamenta Mathematicae*1998,**156**(1):67–72.MathSciNetMATHGoogle Scholar - Lang U, Schroeder V:
**Kirszbraun's theorem and metric spaces of bounded curvature.***Geometric and Functional Analysis*1997,**7:**535–560. 10.1007/s000390050018MathSciNetView ArticleMATHGoogle Scholar - Aronszajn N, Panitchpakdi P:
**Extensions of uniformly continuous transformations and hyperconvex metric spaces.***Pacific Journal of Mathematics*1956,**6:**405–439.MathSciNetView ArticleMATHGoogle Scholar - Bridson MR, Haefliger A:
*Metric Spaces of Non-Positive Curvature, Grundlehren der Mathematischen Wissenschaften*.*Volume 319*. Springer, Berlin, Germany; 1999:xxii+643.View ArticleMATHGoogle Scholar - Young GS Jr.:
**The introduction of local connectivity by change of topology.***American Journal of Mathematics*1946,**68:**479–494. 10.2307/2371828MathSciNetView ArticleMATHGoogle Scholar - Kirk WA:
**Fixed point theorems in CAT(0) spaces and -trees.***Fixed Point Theory and Applications*2004,**2004**(4):309–316.MathSciNetView ArticleMATHGoogle Scholar - Niculescu CP:
**The Krein-Milman theorem in global NPC spaces.***Bulletin Mathématique de la Société des Sciences Mathématiques de Roumanie*2007,**50:**343–346.MathSciNetMATHGoogle Scholar - Borkowski M, Bugajewski D, Phulara D:
**On some properties of hyperconvex spaces.***Fixed Point Theory and Applications*2010, Article ID 213812**2010:**-19 Pages.Google Scholar - Kirk WA:
**Geodesic geometry and fixed point theory.**In*Seminar of Mathematical Analysis (Malaga/Seville, 2002/2003), Coleccion Abierta*.*Volume 64*. Seville University Publications, Seville, Spain; 2003:195–225.Google Scholar - Kirk WA, Panyanak B:
**A concept of convergence in geodesic spaces.***Nonlinear Analysis: Theory, Methods & Applications*2008,**68**(12):3689–3696. 10.1016/j.na.2007.04.011MathSciNetView ArticleMATHGoogle Scholar - Piątek B:
**Best approximation of coincidence points in metric trees.***Annales Universitatis Mariae Curie-Skłodowska. Sectio A*2008,**62:**113–121.MathSciNetMATHGoogle Scholar - Kirk WA, Panyanak B:
**Remarks on best approximation in -trees.***Annales Universitatis Mariae Curie-Skłodowska. Sectio A*2009,**63:**133–138.MathSciNetMATHGoogle Scholar - Khamsi MA, Kirk WA, Martinez Yañez C:
**Fixed point and selection theorems in hyperconvex spaces.***Proceedings of the American Mathematical Society*2000,**128**(11):3275–3283. 10.1090/S0002-9939-00-05777-4MathSciNetView ArticleMATHGoogle Scholar

## Copyright

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.