SearcharxivSearch

arXiv · 1612.03106

Automorphism groups of countable structures and groups of measurable functions

Abstract

Let $G$ be a topological group and let $μ$ be the Lebesgue measure on the interval $[0,1]$. We let $L_0(G)$ to be the topological group of all $μ$-equivalence classes of $μ$-measurable functions defined on [0,1] with values in $G$, taken with the pointwise multiplication and the topology of convergence in measure. We show that for a Polish group $G$, if $L_0(G)$ has ample generics, then $G$ has ample generics, thus the converse to a result of Kaïchouh and Le Maître. We further study topological similarity classes and conjugacy classes for many groups ${\rm{Aut}}(M)$ and $L_0({\rm{Aut}}(M))$, where $M$ is a countable structure. We make a connection between the structure of groups generated by tuples, the Hrushovski property, and the structure of their topological similarity classes. In particular, we prove the trichotomy that for every tuple $ \bar{f}$ of ${\rm{Aut}}(M)$, where $M$ is a countable structure such that algebraic closures of finite sets are finite, either the countable group $\langle \bar{f} \rangle$ is precompact, or it is discrete, or the similarity class of $\bar{f}$ is meager, in particular the conjugacy class of $\bar{f}$ is meager. We prove an analogous trichotomy for groups $L_0({\rm{Aut}}(M))$.

Explore related subjects

Keep this discovery

BibTeXRIS

Aleksandra Kwiatkowska, Maciej Malicki. 2018-08-24. Automorphism groups of countable structures and groups of measurable functions. https://arxiv.org/abs/1612.03106

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