Search arXivSearch

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

Explore connections, maps & timelines

BibTeXRIS

Ehud Hrushovski, Krzysztof Krupiński, Anand Pillay. 2021-11-21. 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

On n-dependent groups and fields III. Multilinear forms and invariant connected components

We develop some model theory of multilinear forms, generalizing Granger's work in the bilinear case. In particular, after proving a quantifier elimination result, we show that for an NIP field $K$, the theory of infinite-dimensional non-degenerate alternating $n$-linear spaces over $K$ is strictly $n$-dependent, and is NSOP$_1$ if $K$ is. These results rely on a new Composition Lemma for functions of arbitrary arity and NIP relations (which in turn relies on certain higher-arity generalizations of the Sauer--Shelah lemma). We also study the invariant connected components $G^{\infty}$ in $n$-dependent groups, demonstrating their relative absoluteness.

math.LO

Loops, Inverse Limits and Non-Determinism

We introduce an operator on problems in Weihrauch complexity, which we call the infinite loop or inverse limit, and which corresponds to an infinite compositional product. This operation arises naturally whenever one implements algorithms that produce a sequence of results in an infinite loop, using some fixed subroutine. We prove that the corresponding operator is monotone with respect to (strong) Weihrauch reducibility but that it is not a closure operator. One of our findings is that weak Kőnig's lemma is closed under infinite loops, which implies that the class of non-deterministically computable problems is also closed under this operation. Consequently, this class allows for a high degree of flexibility in programming. As our main technical tools, we present an injective version of the recursion theorem and an infinitary version of the so-called independent choice theorem. We also show that, in general, the infinite loop operator is more powerful than the composition of the diamond operator followed by the parallelization operator. However, in many practical scenarios, these compositions yield a result, which coincides with the application of the infinite loop operator. Finally, we discuss the special situation of loops for single-valued problems and for problems on Turing degrees.

math.LO

A vector logic for intensional formal semantics

Formal semantics and distributional semantics are distinct approaches to linguistic meaning: the former models meaning as reference via model-theoretic structures; the latter as vectors in high-dimensional spaces shaped by usage. This paper establishes which part of intensional formal semantics admits a linear vector-space encoding. Kripke-style intensional models, with any finite collection of index sorts collected in a compound index space, embed injectively into vector spaces: primitive domains go to free carriers; intensions and other functions go to linear operators. Semantic functions lift to unique multilinear maps on the free carriers, and composition is preserved. The operator encoding of a function domain compresses its free carrier, and we characterize the functionals: a Boolean-valued functional of a power set acts linearly on operator encodings exactly when it is constant, an ultrafilter indicator, or the complement of one, so that on finite domains the nonconstant ones are Montague's individuals and their negations. Determiners over a restrictor of two or more elements, modal operators over two or more accessible indices, and attitude operators over two or more alternatives are outside the linear regime, and take, instead, the form of a linear accumulation followed by a decision. Modality is defined uniformly over measure frames, in which counting measure recovers Kripke semantics at every cardinality, and continuous measures make necessity truth almost everywhere; we give the correspondence conditions for the axioms D, T, B, 4, and 5 under measures, the Kronecker factorization of accessibility over compound indices, and the reading of measure-based modality as graded modality.

math.LO