SearcharxivSearch

arXiv · 0910.0279

Cofinitary Groups and Other Almost Disjoint Families of Reals

Abstract

We study two different types of (maximal) almost disjoint families: very mad families and (maximal) cofinitary groups. For the very mad families we prove the basic existence results. We prove that MA implies there exist many pairwise orthogonal families, and that CH implies that for any very mad family there is one orthogonal to it. Finally we prove that the axiom of constructibility implies that there exists a coanalytic very mad family. Cofinitary groups have a natural action on the natural numbers. We prove that a maximal cofinitary group cannot have infinitely many orbits under this action, but can have any combination of any finite number of finite orbits and any finite (but nonzero) number of infinite orbits. We also prove that there exists a maximal cofinitary group into which each countable group embeds. This gives an example of a maximal cofinitary group that is not a free group. We start the investigation into which groups have cofinitary actions. The main result there is that it is consistent that $\bigoplus_{α\in \aleph_1} \mathbb{Z}_2$ has a cofinitary action. Concerning the complexity of maximal cofinitary groups we prove that they cannot be $K_σ$, but that the axiom of constructibility implies that there exists a coanalytic maximal cofinitary group. We prove that the least cardinality $\mathfrak{a}_g$ of a maximal cofinitary group can consistently be less than the cofinality of the symmetric group. Finally we prove that $\mathfrak{a}_g$ can consistently be bigger than all cardinals in Cichoń's diagram.

Explore related subjects

Keep this discovery

BibTeXRIS

Bart Kastermans. 2009-10-01. Cofinitary Groups and Other Almost Disjoint Families of Reals. https://arxiv.org/abs/0910.0279

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