Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/60987
Title: Best approximation in ℝ-trees
Authors: W. A. Kirk
B. Panyanak
Authors: W. A. Kirk
B. Panyanak
Keywords: Computer Science;Mathematics
Issue Date: 1-May-2007
Abstract: An ℝ-tree is a geodesic space for which there is a unique arc joining any two of its points, and this arc is a metric segment. We give a constructive proof of the following "best approximation" theorem in such spaces. Suppose X is a closed convex and geodesically bounded subset of an ℝ-tree H, and suppose T:X2H is a multivalued upper semicontinuous mapping whose values are nonempty closed convex subsets of X. Then there exists a point x0X such that [image omitted] We also give a topological version of the above theorem in a more abstract setting, and we prove a KKM theorem for geodesically bounded ℝ-trees.
URI: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=34249098113&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/60987
ISSN: 15322467
01630563
Appears in Collections:CMUL: Journal Articles

Files in This Item:
There are no files associated with this item.


Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.