SearcharxivSearch

arXiv · 2602.01810

Newelski's Conjecture for $o$-Minimal and $p$-Adic Groups

Abstract

Let $ M_0 $ denote either the field structure $ \mathbb{Q}_p $ of $ p $-adic numbers, or an $o$-minimal expansion of the field structure $ \mathbb{R} $ of real numbers. We investigate the minimal flows and Ellis groups of definable groups over $ M_0 $ from the perspective of definable topological dynamics. This paper builds on the research initiated in \cite{BY-APAL} and generalizes the main results thereof in two key ways: First, we extend the scope of these results from reductive algebraic groups to arbitrary definable groups. Second, we generalize the approach from $ p $-adically closed fields to $o$-minimal expansions of real closed fields. Let $G$ be a definable group over $M_0$, and let $B$ be a definably amenable component (see Definition \ref{def-DAC}) of $G$. In a certain sense, $B$ can be regarded as a ``maximal definably amenable subgroup'' of $G$ (see Fact \ref{fact-max-DA-subgroup}). The main conclusion of this paper is as follows: For any $M \succ M_0$, the Ellis group of the universal definable flow of $G$ over $M$ is isomorphic to that of $B$ over $M$. In particular, the Ellis groups of the universal definable flow of $G$ are model-independent, as is the case for $B$ (see \cite{CS-Definably-Amenable-NIP-Groups}). As a consequence, we conclude that Newelski's Conjecture holds if and only if $G$ is definably amenable when $M_0 = \mathbb{Q}_p$.

Explore related subjects

Keep this discovery

BibTeXRIS

Ningyuan Yao, Zhentao Zhang. 2026-02-02. Newelski's Conjecture for $o$-Minimal and $p$-Adic Groups. https://arxiv.org/abs/2602.01810

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