SearcharxivSearch

arXiv · 2010.08049

Anti-classification results for groups acting freely on the line

Abstract

We explore countable ordered Archimedean groups from the point of view of descriptive set theory. We introduce the space of Archimedean left-orderings $\mathrm{Ar}(G)$ for a given countable group $G$, and prove that the equivalence relation induced by the natural action of $\mathrm{GL}_2(\mathbb{Q})$ on $\mathrm{Ar}(\mathbb{Q}^2)$ is not concretely classifiable. Then we analyze the isomorphism relation for countable ordered Archimedean groups, and pin its complexity in terms of the hierarchy of Hjorth, Kechris and Louveau. In particular, we show that its potential class is not $\boldsymbol{\Pi}^0_3$. This topological constraint prevents classifying Archimedean groups using countable subsets of reals. We obtain analogous results for the bi-embeddability relation, and we consider similar problems for circularly ordered groups, and o-minimal structures such as ordered divisible Abelian groups, and real closed fields. Our proofs combine classical results on Archimedean groups, the theory of Borel equivalence relations, and analyzing definable sets in the basic Cohen model and other models of Zermelo-Fraenkel set theory without choice.

Explore related subjects

Keep this discovery

BibTeXRIS

Filippo Calderoni, David Marker, Luca Motto Ros, Assaf Shani. 2020-10-15. Anti-classification results for groups acting freely on the line. https://arxiv.org/abs/2010.08049

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