Search arXivSearch

arXiv · 2207.14600

Embeddings of metric Boolean algebras in $\mathbb{R}^{N}$

Abstract

A Boolean algebra $\A$ equipped with a (finitely-additive) positive probability measure $m$ can be turned into a metric space $(\A , d_{m})$, where $d_{m}(a,b)= m ((a\wedge\neg b)\vee(\neg a\wedge b))$, for any $a,b\in A$, sometimes referred to as \emph{metric Boolean algebra}. In this paper, we study under which conditions the space of atoms of a finite metric Boolean algebra can be isometrically embedded in $\mathbb{R}^{N}$ (for a certain $N$) equipped with the Euclidean metric. In particular, we characterize the topology of the positive measures over a finite algebra $\A$ such that the metric space $(\mathsf{At}(\A), d_m)$ embeds isometrically in $\mathbb{R}^{N}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stefano Bonzio, Andrea Loi. 2022-07-29. Embeddings of metric Boolean algebras in $\mathbb{R}^{N}$. https://arxiv.org/abs/2207.14600

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

KEEP EXPLORING

Related papers

Failure of the $G_0$-dichotomy for generalized Cantor spaces

Kechris, Solecki and Todorčević's $G_0$-dichotomy characterizes Borel graphs that admit a Borel measurable coloring with countably many colors. We show that the analogue to the $G_0$-dichotomy for generalized Cantor spaces fails at the lowest possible complexity, namely for closed graphs.

math.LO

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 $λ$-terraced cube relation fails whenever $λ$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $λ$. If $λ$ 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