2000 character limit reached
Nearest point problem in countably normed spaces
Published 12 Dec 2022 in math.FA | (2212.06236v1)
Abstract: In a countably normed space which is a linear space equipped with a countable number of pair-wise compatible norms, we prove the existence of a common nearest point (in all norms) from a point outside a nonempty subset if this subset is compact with respect to all norms. We also prove the uniqueness of that common nearest point if the completion of the space equipped with only one of its norms is uniformly convex.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.