Search arXivSearch

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

Explore connections, maps & timelines

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

Natural Term Logic

In this paper we develop a formal system called Natural Term Logic (NTL). NTL aims to represent key aspects of the logical and grammatical mechanisms of natural language as well as grammatical transformations which preserve core logical meaning. NTL can be seen as a refinement of the ideas of Quine's paper `Variables Explained Away' and the technical concepts introduced by Bealer and Zalta. NTL is more fine-grained than Bealer's first-order intensional logic (BL): there is a many-to-one correspondence $ν$ between NTL terms and closed BL terms as well as a canonical map $β$ which assigns to each closed BL term a corresponding NTL term. The map $ν$ can be seen as assigning a core logical content of the NTL term. We define a series of reductions on NTL terms which intuitivelyy speaking capture meaning-preserving syntactic transformations ( transformations which preserved the basic logical meaning of a term) and our main result is that each NTL term $T$ reduces to a unique normal term $N$. The reductions fall into the structural, predicative and pushing-in categories. Predicative reductions decompose NTL terms so that predication is only applied to a primitive term (such terms are called prenormal). A key ingredient in the proof is the fact that $βνN = N$ when $N$ is normal. This suggests that within NTL the normal form of a term expresses the core logical content of the term.

math.LO

Hyper-hyperfiniteness and complexity

We show that if there exists a countable Borel equivalence relation which is hyper-hyperfinite but not hyperfinite, then the complexity of hyperfinite countable Borel equivalence relationsis as high as possible, namely, $Σ^1_2$-complete. We also establish an implication between the question of the effectivity of hyperfiniteness and its complexity.

math.LO

Coordinate recognition: General theory, Groups, and other surprises

A class of structures \emph{recognizes coordinates} if any reduced product of structures from said class witnesses a certain kind of rigidity phenomenon. We provide several equivalent characterizations of this property. This property has (at least) two remarkable consequences, one set-theoretic and one model-theoretic, for reduced products of structures of the said class. First, under appropriate set-theoretic assumptions every isomorphism between such reduced products associated with the Fréchet ideal lifts (modulo a finite change) to an isomorphism between products of the original structures. Second, with an additional mild assumption, it implies a strong quantifier elimination result. Of note, we show that a class recognizes coordinates if and only if an individual formula witnesses a certain syntactic property. We also consider many concrete classes of structures and determine whether or not they recognize coordinates. We place heavy emphasis on well-known classes of groups, such as permutation groups, acylindircally hyperbolic groups, quasisimple groups, free products, and graph products, but we also discuss other classes of structures.

math.LO