2000 character limit reached
Large separated sets of unit vectors in Banach spaces of continuous functions
Published 1 Dec 2017 in math.FA | (1712.00478v2)
Abstract: The paper concerns the problem whether a nonseparable $\C(K)$ space must contain a set of unit vectors whose cardinality equals to the density of $\C(K)$ such that the distances between every two distinct vectors are always greater than one. We prove that this is the case if the density is at most continuum and we prove that for several classes of $\C(K)$ spaces (of arbitrary density) it is even possible to find such a set which is $2$-equilateral; that is, the distance between every two distinct vectors is exactly 2.
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.