Search arXivSearch

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ński and Basso-Zucker that the $τ$-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 $ϕ(x,y)$, the group $G/G^{00}_ϕ$ has finite Archimedean rank. More precisely, if the VC-codensity of $ϕ(x,y)$ is at most $δ$, then $G/G^{00}_ϕ$ is an inverse limit of compact Lie groups of dimension at most $(4δ)^2$. This connects to, though is different than, a question of Hrushovski.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Atticus Stonestrom. 2026-09-09. 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

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

Scott topologies on meet-continuous domains

We study Scott products and sobriety of countable meet-continuous domains, meaning meet-continuous dcpos without any additional continuity or least-element assumption. Using the complete-lattice test-family theorem of Xu and Ji, we prove finite-product equality for those domains that are $L$-dcpos, and for the weaker class whose principal ideals have suprema of all nonempty subsets. For an arbitrary family of nonempty countable meet-continuous $L$-dcpos, we prove that the Scott topology on the order product equals the product of the factor Scott topologies if and only if only finitely many factors lack a least element. We also establish sobriety under bounded completeness and under additional common-upper-bound conditions. Assuming square-product equality, sobriety is characterized by Scott closedness of common-upper-bound sections associated with irreducible Scott-closed sets, with an equivalent sequential formulation in the countable case. Two extraction lemmas extend to meet-semilattice dcpos. The finite-product and sobriety questions for general countable meet-continuous domains remain unresolved here.

math.LO

Randomized Borel $(2d+1)$-coloring of digraphs

Let $G$ be a Borel digraph with maximum out-degree $d \in \mathbb{N}$. We show that $G$ admits a random Borel $(2d+1)$-coloring for which every edge is almost surely not monochromatic. This gives a simpler proof of a recent result of Pelayo-Gómez: such a graph $G$ admits a measurable proper $(2d+1)$-coloring with respect to any Borel probability measure on $V(G)$. Our proof is an adaptation of Pelayo-Gómez's proof to the randomized Borel setting.

math.LO