On the farthest point problem in Banach spaces

Abstract

If every point in a normed space X admits a unique farthest point in a given bounded subset E, then must E be a singleton?. This is known as the farthest point problem. In an attempt to solve this problem, we give our contribution toward solving it, in the positive direction, by proving that every such subset E in the sequence space `1 is a singleton.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…