SearcharxivSearch

arXiv · 2303.13470

On f-generic types in NIP groups

Abstract

`Definable amenability' of a definable group is the model-theoretic analogue of amenability of a discrete group; precisely, a definable group is said to be definably amenable if it admits a translation-invariant finitely additive probability measure on its definable subsets. We prove a combinatorial characterization of definable amenability for groups definable in NIP theories. More specifically, given a group $G$, a subset $D\subseteq G$ is said to (left) `$G$-divide' if there is some natural number $k$ and an infinite sequence of elements $g_i\in G$ such that $g_{i_1}D\cap\dots\cap g_{i_k}D=\varnothing$ for all $i_1<\dots<i_k$. Our main result is that, if $G$ is a group definable in an NIP theory, and the union of two definable $G$-dividing subsets of $G$ still $G$-divides, then $G$ is definably amenable. It follows that $G$ is definably amenable if and only if $G$ admits a global non-$G$-dividing (or, equivalently, `f-generic') type. This answers a question of Chernikov and Simon and generalizes a theorem of Hrushovski and Pillay. As a quick application of the main result, we show that every dp-minimal group is definably amenable, which answers a question of Chernikov, Pillay, and Simon. Finally, we show that the appropriate analogue of the main result holds also for type-definable groups, so that, in an NIP theory, a type-definable group with a global f-generic type is definably amenable; this additionally gives the first correct proof of the analogous result, claimed by Hrushovski and Pillay, for type-definable groups with a global \textit{strongly} f-generic type.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Atticus Stonestrom. 2023-03-23. On f-generic types in NIP groups. https://arxiv.org/abs/2303.13470

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