Search arXivSearch

arXiv · 2601.20565

On groups definable in $p$-adically closed fields

Abstract

This paper is about the $dfg$/$fsg$ decomposition for groups $G$ definable in $p$-adically closed fields. It is proved that for $G$ definably amenable, $G$ has a definable normal $dfg$ subgroup $H$ such that the quotient $G/H$ is a definable $fsg$ group. The result was known for groups definable in $o$-minimal expansions of real closed fields (see \cite{C-P-o-mini}). We also give a version for arbitrary (not necessarily definably amenable) groups $G$ definable in $p$-adically closed fields: there is a definable $dfg$ subgroup $H$ of $G$ such that the homogeneous space $G/H$ is definable and definably compact. (In the $o$-minimal case this is Fact 3.25 of \cite{Peterzil-Starchenko-mutypes}). Finally, we also isolate the definably amenable part of $G$, which we call the definably amenable component. Note that $dfg$ stands for ``has a definable $f$-generic type", and $fsg$ for ``has finitely satisfiable generics", which will be discussed together with various equivalences. We will need to understand something about groups of the form $G(k)$ where $k$ is a $p$-adically closed field and $G$ a semisimple algebraic group over $k$, and as part of the analysis we will prove the Kneser-Tits conjecture over $p$-adically closed fields.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anand Pillay, Ningyuan Yao, Zhentao Zhang. 2026-08-19. On groups definable in $p$-adically closed fields. https://arxiv.org/abs/2601.20565

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO