SearcharxivSearch

arXiv · 1901.00517

On $\mathbb R$-embeddability of almost disjoint families and Akemann-Doner C*-algebras

Abstract

An almost disjoint family $\mathcal A$ of subsets of $\mathbb N$ is said to be $\mathbb R$-embeddable if there is a function $f:\mathbb N\rightarrow \mathbb R$ such that the sets $f[A]$ are ranges of real sequences converging to distinct reals for distinct $A\in \mathcal A$. It is well known that almost disjoint families which have few separations, such as Luzin families, are not $\mathbb R$-embeddable. We study extraction principles related to $\mathbb R$-embeddability and separation properties of almost disjoint families of $\mathbb N$ as well as their limitations. An extraction principle whose consistency is our main result is: every almost disjoint family of size continuum contains an $\mathbb R$-embeddable subfamily of size continuum. It is true in the Sacks model. The Cohen model serves to show that the above principle does not follow from the fact that every almost disjoint family of size continuum has two separated subfamilies of size continuum. We also construct in ZFC an almost disjoint family, where no two uncountable subfamilies can be separated but always a countable subfamily can be separated from any disjoint subfamily. Using a refinement of the $\mathbb R$-embeddability property called a controlled $\mathbb R$-embedding property we obtain the following results concerning Akemann-Doner C*-algebras which are induced by uncountable almost disjoint families: a) In ZFC there are Akemann-Doner C*-algebras of density $\mathfrak c$ with no commutative subalgebras of density $\mathfrak c$, b) It is independent from ZFC whether there is an Akemann-Doner algebra of density $\mathfrak c$ with no nonseparable commutative subalgebra. This completes an earlier result that there is in ZFC an Akemann-Doner algebra of density $\omega_1$ with no nonseparable commutative subalgebra.

Explore related subjects

Keep this discovery

BibTeXRIS

Osvaldo Guzmán, Michael Hrušák, Piotr Koszmider. 2019-01-02. On $\mathbb R$-embeddability of almost disjoint families and Akemann-Doner C*-algebras. https://arxiv.org/abs/1901.00517

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