SearcharxivSearch

arXiv · 2607.26265

Some results on NIP groups and their Ellis groups

Abstract

This paper has several parts. We begin by developing a theory of `piecewise (strong) f-genericity' in NIP groups, where we call a definable set piecewise (strong) f-generic if some union of finitely many translates of it is (strong) f-generic. We show that, in an NIP group, the definable sets that are not piecewise (strong) f-generic form an ideal. Our hope is that the corresponding piecewise (strong) f-generic types can provide a substitute in arbitrary NIP groups for the (strong) f-generic types of definably amenable NIP groups, and in the rest of the paper we give several applications. Two of the applications deal with the Ellis group of an NIP group. Let $T$ be an NIP theory, $G$ a definable group, and $M$ a model. In our first result we show that the size of the Ellis group of $G(M)$ is bounded above by $2^{|T|}$, independent of the choice of $M$, giving a substantial step towards the question of whether the isomorphism type is independent of $M$. In our second result, inspired by a theorem of Hrushovski, we show that, if $T$ and $M$ are countable and the formulas of $T$ have uniformly bounded VC-codensity, then the Ellis group of $G(M)$ has `finite Archimedean rank', ie its connected component is profinite-by-Lie. A crucial tool for us in both results is the recent result of Chernikov-Gannon-Krupi\'nski and Basso-Zucker that the $\tau$-topology on the Ellis group is Hausdorff. Finally, we use our techniques to obtain a `local' result valid in arbitrary NIP theories, without the assumption of uniformly bounded VC-codensity: for any `bi-invariant' formula $\phi(x,y)$, the group $G/G^{00}_\phi$ has finite Archimedean rank. More precisely, if the VC-codensity of $\phi(x,y)$ is at most $\delta$, then $G/G^{00}_\phi$ is an inverse limit of compact Lie groups of dimension at most $(4\delta)^2$. This connects to, though is different than, a question of Hrushovski.

Explore related subjects

Keep this discovery

BibTeXRIS

Atticus Stonestrom. 2026-07-28. Some results on NIP groups and their Ellis groups. https://arxiv.org/abs/2607.26265

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