SearcharxivSearch

arXiv · 1911.01833

On groups with definable $f$-generics definable in $p$-adically closed fields

Abstract

The aim of this paper is to develop the theory of groups definable in the $p$-adic field ${\mathbb Q}_p$, with ``definable $f$-generics" in the sense of an ambient saturated elementary extension of ${\mathbb Q}_p$. We call such groups definable $f$-generic groups. So, by a ``definable f-generic'' or dfg group we mean a definable group in a saturated model with a global f-generic type which is definable over a small model. In the present context the group is definable over ${\mathbb Q}_p$, and the small model will be ${\mathbb Q}_p$ itself. The notion of a dfg group is dual, or rather opposite to that of an fsg group (group with ``finitely satisfiable generics") and is a useful tool to describe the analogue of torsion free o-minimal groups in the $p$-adic context. In the current paper our group will be definable over ${\mathbb Q}_p$ in an ambient saturated elementary extension $\mathbb K$ of ${\mathbb Q}_p$, so as to make sense of the notions of $f$-generic etc. In this paper we will show that every definable $f$-generic group definable in ${\mathbb Q}_p$ is virtually isomorphic to a finite index subgroup of a trigonalizable algebraic group over ${\mathbb Q}_p$. This is analogous to the $o$-minimal context, where every connected torsion free group definable in $\mathbb R$ is isomorphic to a trigonalizable algebraic group (Lemma 3.4, \cite{COS}). We will also show that every open definable $f$-generic subgroup of a definable $f$-generic group has finite index, and every $f$-generic type of a definable $f$-generic group is almost periodic, which gives a positive answer to the problem raised in \cite{P-Y} of whether $f$-generic types coincide with almost periodic types in the $p$-adic case.

Explore related subjects

Keep this discovery

BibTeXRIS

Anand Pillay, Ningyuan Yao. 2019-11-04. On groups with definable $f$-generics definable in $p$-adically closed fields. https://arxiv.org/abs/1911.01833

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