SearcharxivSearch

arXiv · 1303.0955

Topological representations

Abstract

This paper studies the combinatorics of ideals which recently appeared in ergodicity results for analytic equivalence relations. The ideals have the following topological representation. There is a separable metrizable space $X$, a $\sigma$-ideal $I$ on $X$ and a dense countable subset $D$ of $X$ such that the ideal consists of those subsets of $D$ whose closure belongs to $I$. It turns out that this definition is indepedent of the choice of $D$. We show that an ideal is of this form if and only if it is dense and countably separated. The latter is a variation of a notion introduced by Todor\vcevi\'c for gaps. As a corollary, we get that this class is invariant under the Rudin--Blass equivalence. This also implies that the space $X$ can be always chosen to be compact so that $I$ is a $\sigma$-ideal of compact sets. We compute the possible descriptive complexities of such ideals and conclude that all analytic equivalence relations induced by such ideals are $\mathbf{\Pi}^0_3$. We also prove that a coanalytic ideal is an intersection of ideals of this form if and only if it is weakly selective.

Explore related subjects

Keep this discovery

BibTeXRIS

Adam Kwela, Marcin Sabok. 2013-03-05. Topological representations. https://arxiv.org/abs/1303.0955

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