On Approximative Sets

For a non-empty subset G of a metric space (X, d) and x ∈ X, an element g0 ∈ G is called a best approximation to x in G if d(x, g0) = d(x, G), and a sequence in G is called a minimizing sequence for x in G if limn→∞d(x, gn) = d(x, G) . There are certain sets known in the literature which are connnected with the concept of minimizing sequences. The approximative sets have played an important role in giving some affirmative answers to two outstanding open problems in the theory of best approximation viz proving the convexity of Chebyshev sets in Hilbert spaces, and characterizing those Banach spaces in which every Chebyshev set is convex. These sets have helped in proving many results on best approximation. This paper deals with such sets, their inter-relationships and their applications. The underlying spaces are metric spaces.

View article page

Download PDF