Search arXivSearch

arXiv · 2309.14469

The Ax-Kochen-Ershov Theorem

Abstract

These are the notes of a course for the summer school Model Theory in Bilbao hosted by the Basque Center for Applied Mathematics (BCAM) and the Universidad del País Vasco/Euskal Herriko Unibertsitatea in September 2023. The goal of this course is to prove the Ax-Kochen-Ershov (AKE) theorem. This classical result in model theory was proven by Ax and Kochen and independently by Ershov in 1965-1966. The AKE theorem is considered as the starting point of the model theory of valued fields and witnessed numerous refinements and extensions. To a certain measure, motivic integration can be considered as such. The AKE theorem is not only an important result in model theory, it yields a striking application to $p$-adic arithmetics. Artin conjectured that all $p$-adic fields are $C_2$ (every homogeneous polynomial of degree $d$ and in $>d^2$ variable has a non trivial zero). A consequence of the AKE theorem is that the $p$-adics are asymptotically $C_2$. The conjecture of Artin has been disproved by Terjanian in 1966, yielding that the solution given by the AKE theorem is in a sense optimal. The proof presented here is due to Pas but the general strategy stays faithful to the original paper of Ax and Kochen, which consist in the study of the asymptotic first-order theory of the $p$-adics.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christian d'Elbée. 2023-09-25. The Ax-Kochen-Ershov Theorem. https://arxiv.org/abs/2309.14469

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