SearcharxivSearch

arXiv · 2409.16393

Forking in valued fields and related structures

Abstract

This thesis is a contribution to the model theory of valued fields. We study forking in valued fields and some of their reducts. We focus particularly on pseudo-local fields, the ultraproducts of residue characteristic zero of the p-adic valued fields. First, we look at the value groups of the valued fields we are interested in, the regular ordered Abelian groups. We establish for these ordered groups a geometric description of forking, as well as a full classification of the global extensions of a given type which are non-forking or invariant. Then, we prove an Ax-Kochen-Ershov principle for forking and dividing in expansions of pure short exact sequences of Abelian structures, as studied by Aschenbrenner-Chernikov-Gehret-Ziegler in their article about distality. This setting applies in particular to the leading-term structure of (expansions of) valued fields. Lastly, we give various sufficient conditions for a parameter set in a Henselian valued field of residue characteristic zero to be an extension base. In particular, we show that forking equals dividing in pseudo-local fields of residue characteristic zero. Additionally, we discuss results by Ealy-Haskell-Simon on forking in separated extensions of Henselian valued fields of residue characteristic zero. We contribute to the question in the setting of Abhyankar extensions, where we show that, with some additional conditions, if a type in a pseudo-local field does not fork, then there exists some global invariant Keisler measure whose support contains that type. This behavior is well-known in pseudo-finite fields.

Explore related subjects

Keep this discovery

BibTeXRIS

Akash Hossain. 2024-09-24. Forking in valued fields and related structures. https://arxiv.org/abs/2409.16393

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