SearcharxivSearch

arXiv · 1709.08801

Valued fields, Metastable groups

Abstract

We introduce a class of theories called metastable, including the theory of algebraically closed valued fields (ACVF) as a motivating example. The key local notion is that of definable types dominated by their stable part. A theory is metastable (over a sort $\Gamma$) if every type over a sufficiently rich base structure can be viewed as part of a $\Gamma$-parametrized family of stably dominated types. We initiate a study of definable groups in metastable theories of finite rank. Groups with a stably dominated generic type are shown to have a canonical stable quotient. Abelian groups are shown to be decomposable into a part coming from $\Gamma$, and a definable direct limit system of groups with stably dominated generic. In the case of ACVF, among definable subgroups of affine algebraic groups, we characterize the groups with stably dominated generics in terms of group schemes over the valuation ring. Finally, we classify all fields definable in ACVF.

Explore related subjects

Keep this discovery

BibTeXRIS

Ehud Hrushovski, Silvain Rideau-Kikuchi. 2017-09-26. Valued fields, Metastable groups. https://arxiv.org/abs/1709.08801

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