Uniqueness of best proximity pairs and rigidity of semimetric spaces

preprint2022arXivOpen access

Abstract

For arbitrary semimetric space (X,d)(X, d) and disjoint proximinal subsets AA, BB of XX we define the proximinal graph as a bipartite graph with parts AA and BB whose edges {a,b}\{a, b\} satisfy the equality d(a,b)=dist⁡(A,B)d(a, b) = \operatorname{dist}(A, B). We characterize the semimetric spaces whose proximinal graphs have at most one edge and the semimetric spaces whose proximinal graphs have the vertices with degree at most 11 only. This allows us to describe the necessary and sufficient conditions for uniqueness of the best proximity pairs and best approximations.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.