SearcharxivSearch

arXiv · 2308.07668

On Ramsey-type properties of the distance in nonseparable spheres

Abstract

Given an uncountable subset $\mathcal Y$ of a nonseparable Banach space, is there an uncountable $\mathcal Z\subseteq \mathcal Y$ such that the distances between any two distinct points of $\mathcal Z$ are more or less the same? If an uncountable subset $\mathcal Y$ of a nonseparable Banach space does not admit an uncountable $\mathcal Z\subseteq \mathcal Y$, where any two points are distant by more than $r>0$, is it because $\mathcal Y$ is the countable union of sets of diameters not bigger than $r$? We investigate connections between the set-theoretic phenomena involved and the geometric properties of uncountable subsets of nonseparable Banach spaces of densities up to $2^\omega$ related to uncountable $(1+)$-separated sets, equilateral sets or Auerbach systems. The results include geometric dichotomies for a wide range of classes of Banach spaces, some in ZFC, some under the assumption of OCA+MA and some under a hypothesis on the descriptive complexity of the space as well as constructions (in ZFC or under CH) of Banach spaces where the geometry of the unit sphere displays anti-Ramsey properties. This complements classical theorems for separable spheres and the recent results of H\'ajek, Kania, Russo for densities above $2^\omega$ as well as offers a synthesis of possible phenomena and categorization of examples for uncountable densities up to $2^\omega$ obtained previously by the author and Guzm\'an, Hru\v{s}\'ak, Ryduchowski and Wark. It remains open if the dichotomies may consistently hold for all Banach spaces of the first uncountable density or if the strong anti-Ramsey properties of the distance on the unit sphere of a Banach space can be obtained in ZFC.

Explore related subjects

Keep this discovery

BibTeXRIS

Piotr Koszmider. 2023-08-15. On Ramsey-type properties of the distance in nonseparable spheres. https://arxiv.org/abs/2308.07668

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO