Countable Borel treeable equivalence relations are classifiable by $\ell_1$

Shaun Allison

Home/Archive/arXiv

arXiv · 2305.01049

Countable Borel treeable equivalence relations are classifiable by $\ell_1$

Shaun Allison

View original source ↗Read source document ↗Export metadata ↓

Abstract

Gao and Jackson showed that any countable Borel equivalence relation (CBER) induced by a countable abelian Polish group is hyperfinite. This prompted Hjorth to ask if this is in fact true for all CBERs classifiable by (uncountable) abelian Polish groups. We describe reductions involving free Banach spaces to show that every treeable CBER is classifiable by an abelian Polish group. As there exist treeable CBERs that are not hyperfinite, this answers Hjorth's question in the negative. On the other hand, we show that any CBER classifiable by a countable product of locally compact abelian Polish groups (such as $\mathbb{R}^\omega$) is indeed hyperfinite. We use a small fragment of the Hjorth analysis of Polish group actions, which is Hjorth's generalization of the Scott analysis of countable structures to Polish group actions.

Explore related subjects

math.LO

Keep this discovery

BibTeX RIS

Shaun Allison. 2023-05-01. Countable Borel treeable equivalence relations are classifiable by $\ell_1$. https://arxiv.org/abs/2305.01049

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

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗