SearcharxivSearch

arXiv · 1901.02859

Amenability, connected components, and definable actions

Abstract

We study amenability of definable and topological groups. Among our main technical tools is an elaboration on and strengthening of the Massicot-Wagner version of the stabilizer theorem, and some results around measures. As an application we show that if $G$ is an amenable topological group, then the Bohr compactification of $G$ coincides with a certain "weak Bohr compactification" introduced in [24]. Formally, $G^{00}_{topo} = G^{000}_{topo}$. We also prove wide generalizations of this result, implying in particular its extension to a "definable-topological" context, confirming the main conjectures from [24]. We introduce $\bigvee$-definable group topologies on a given $\emptyset$-definable group $G$ (including group topologies induced by type-definable subgroups as well as uniformly definable group topologies), and prove that the existence of a mean on the lattice of closed, type-definable subsets of $G$ implies (under some assumption) that $cl(G^{00}_M) = cl(G^{000}_M)$ for any model $M$. We study the relationship between definability of an action of a definable group on a compact space, weakly almost periodic actions, and stability. We conclude that for any group $G$ definable in a sufficiently saturated structure, every definable action of $G$ on a compact space supports a $G$-invariant probability measure. This gives negative solutions to some questions and conjectures from [22] and [24]. We give an example of a $\emptyset$-definable approximate subgroup $X$ in a saturated extension of the group $\mathbb{F}_2 \times \mathbb{Z}$ in a suitable language for which the $\bigvee$-definable group $H:=\langle X \rangle$ contains no type-definable subgroup of bounded index. This refutes a conjecture by Wagner and shows that the Massicot-Wagner approach to prove that a locally compact "model" exists for each approximate subgroup does not work in general.

Explore related subjects

Keep this discovery

BibTeXRIS

Ehud Hrushovski, Krzysztof Krupiński, Anand Pillay. 2019-01-09. Amenability, connected components, and definable actions. https://arxiv.org/abs/1901.02859

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