SearcharxivSearch

arXiv · 1612.07560

Amenability, definable groups, and automorphism groups

Abstract

We prove several theorems relating amenability of groups in various categories (discrete, definable, topological, automorphism group) to model-theoretic invariants (quotients by connected components, Lascar Galois group, G-compactness, ...). For example, if $M$ is a countable, $\omega$-categorical structure and $Aut(M)$ is amenable, as a topological group, then the Lascar Galois group $Gal_{L}(T)$ of the theory $T$ of $M$ is compact, Hausdorff (also over any finite set of parameters), that is $T$ is G-compact. An essentially special case is that if $Aut(M)$ is extremely amenable, then $Gal_{L}(T)$ is trivial, so, by a theorem of Lascar, the theory $T$ can be recovered from its category $Mod(T)$ of models. On the side of definable groups, we prove for example that if $G$ is definable in a model $M$, and $G$ is definably amenable, then the connected components ${G^{*}}^{00}_{M}$ and ${G^{*}}^{000}_{M}$ coincide, answering positively a question from an earlier paper of the authors. We also take the opportunity to further develop the model-theoretic approach to topological dynamics, obtaining for example some new invariants for topological groups, as well as allowing a uniform approach to the theorems above and the various categories.

Explore related subjects

Keep this discovery

BibTeXRIS

Krzysztof Krupinski, Anand Pillay. 2016-12-22. Amenability, definable groups, and automorphism groups. https://arxiv.org/abs/1612.07560

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