Elementary equivalence versus Isomorphism
نویسنده
چکیده
1) The isomorphy type of a finite field K is given by its cardinality |K|, i.e., if K and L are such fields, then K ∼= L iff |K| = |L|. 1) The isomorphy type of an algebraically closed field K is determined by two invariants: (i) Absolute transcendence degree td(K), (ii) The characteristic p = char(K) ≥ 0. In other words, if K and L are algebraically closed fields, then K ∼= L iff td(K) = td(L) and char(K) = char(L). Nevertheless, if we want to classify fields K up to isomorphism even in an “only a little bit” more general context, then we run into very serious difficulties... A typical example here is the attempt to give the isomorphy types of real closed fields (it seems first tried by Artin and Schreier). A real closed field K is “as close as possible” to its algebraic closure K, as [K : K] = 2, and K = K[ √ −1]. These fields were introduced by Artin in his famous proof of Hilbert’s 17th Problem. Roughly speaking, the real closed fields are the fields having exactly the same algebraic properties as the reals ' . One knows quite a lot about real closed fields, see e.g. Prestel–Roquette [P–R], but for specialists it is clear that the problem of describing the isomorphism types of all such fields is hopeless... And to move into more modern times, the same is true for the p-adically closed fields (which roughly speaking, are the fields having exactly the same algebraic properties as the p-adics
منابع مشابه
On Elementary Equivalence, Isomorphism and Isogeny of Arithmetic Function Fields
Motivated by recent work of Florian Pop, we study the connections between three notions of equivalence of function fields: isomorphism, elementary equivalence, and the condition that each of a pair of fields can be embedded in the other, which we call isogeny. Some of our results are purely geometric: we give an isogeny classification of Severi-Brauer varieties and quadric surfaces. These resul...
متن کاملNotes from Hausdorff Institute Talk Oct 10, 2013
(a) isomorphism ∼=, elementary equivalence ≡, elementary equivalence ≡α for Lω1,ω sentences of rank < α. (b) Isomorphism of countable graphs, linear orders, countable Boolean algebras is ≤B complete for orbit equivalence relations of continuous S∞ actions (≤B is Borel reducibility, S∞ is the Polish group of permutations of ω). (c) for ∼= is partially answered in computable model theory, with no...
متن کاملOn elementary equivalence, isomorphism and isogeny
Motivated by recent work of Florian Pop, we study the connections between three notions of equivalence of function fields: isomorphism, elementary equivalence, and the condition that each of a pair of fields can be embedded in the other, which we call isogeny. Some of our results are purely geometric: we give an isogeny classification of Severi-Brauer varieties and quadric surfaces. These resul...
متن کاملPartial automorphism semigroups
We study the relationship between algebraic structures and their inverse semigroups of partial automorphisms. We consider a variety of classes of natural structures including equivalence structures, orderings, Boolean algebras, and relatively complemented distributive lattices. For certain subsemigroups of these inverse semigroups, isomorphism (elementary equivalence) of the subsemigroups yield...
متن کاملCriteria of Motivic Equivalence for Quadratic Forms and Central Simple Algebras
We give a short, elementary, and characteristic independent proof of the criterion for motivic isomorphism of two projective quadrics discovered by A. Vishik [24]. We also give a criterion for motivic isomorphism of two Severi-Brauer varieties.
متن کاملIsomorphism of finitely generated solvable groups is weakly universal
We show that the isomorphism relation for finitely generated solvable groups of class 3 is a weakly universal countable Borel equivalence relation. This improves on previous results. The proof uses a modification of a construction of Neumann and Neumann. Elementary arguments show that isomorphism of finitely generated metabelian or nilpotent groups can not achieve this Borel complexity. In this...
متن کامل