A note on valuation definable expansions of fields

1998 ◽  
Vol 63 (2) ◽  
pp. 739-743 ◽  
Author(s):  
Deirdre Haskell ◽  
Dugald Macpherson
Keyword(s):  
Valuation Ring ◽  
Quantifier Elimination ◽  
Real Closed Field ◽  
Closed Field ◽  
Real Closed Fields ◽  
Ordered Field ◽  
Valued Field ◽  
Closed Fields ◽  
Binary Predicate ◽  
Algebraically Closed Fields

In this note, we consider models of the theories of valued algebraically closed fields and convexly valued real closed fields, their reducts to the pure field or ordered field language respectively, and expansions of these by predicates which are definable in the valued field. We show that, in terms of definability, there is no structure properly between the pure (ordered) field and the valued field. Our results are analogous to several other definability results for reducts of algebraically closed and real closed fields; see [9], [10], [11] and [12]. Throughout this paper, definable will mean definable with parameters.Theorem A. Let ℱ = (F, +, ×, V) be a valued, algebraically closed field, where V denotes the valuation ring. Let A be a subset ofFndefinable in ℱv. Then either A is definable in ℱ = (F, +, ×) or V is definable in.Theorem B. Let ℛv = (R, <, +, ×, V) be a convexly valued real closed field, where V denotes the valuation ring. Let Abe a subset ofRndefinable in ℛv. Then either A is definable in ℛ = (R, <, +, ×) or V is definable in.The proofs of Theorems A and B are quite similar. Both ℱv and ℛv admit quantifier elimination if we adjoin a definable binary predicate Div (interpreted by Div(x, y) if and only if v(x) ≤ v(y)). This is proved in [14] (extending [13]) in the algebraically closed case, and in [4] in the real closed case. We show by direct combinatorial arguments that if the valuation is not definable then the expanded structure is strongly minimal or o-minimal respectively. Then we call on known results about strongly minimal and o-minimal fields to show that the expansion is not proper.

ON THE CLASSIFICATION OF CENTRALLY FINITE ALTERNATIVE DIVISION RINGS SATISFYING ALGEBRAIC CLOSURE CONDITIONS

2012 ◽  
Vol 11 (05) ◽  
pp. 1250088
Author(s):  
RICCARDO GHILONI
Keyword(s):  
Algebraic Closure ◽  
Real Closed Field ◽  
Closed Field ◽  
Real Closed Fields ◽  
Division Rings ◽  
Closed Fields ◽  
Closure Conditions ◽  
The One ◽  
Algebraically Closed Fields

In this paper, we prove that the rings of quaternions and of octonions over an arbitrary real closed field are algebraically closed in the sense of Eilenberg and Niven. As a consequence, we infer that some reasonable algebraic closure conditions, including the one of Eilenberg and Niven, are equivalent on the class of centrally finite alternative division rings. Furthermore, we classify centrally finite alternative division rings satisfying such equivalent algebraic closure conditions: up to isomorphism, they are either the algebraically closed fields or the rings of quaternions over real closed fields or the rings of octonions over real closed fields.

Relative randomness and real closed fields

2005 ◽  
Vol 70 (1) ◽  
pp. 319-330 ◽  
Author(s):  
Alexander Raichev
Keyword(s):  
Real Number ◽  
Real Closed Field ◽  
Closed Field ◽  
Real Numbers ◽  
The Real ◽  
Real Closed Fields ◽  
Ordered Field ◽  
Closed Fields ◽  
Master's Thesis ◽  
National University

AbstractWe show that for any real number, the class of real numbers less random than it, in the sense of rK-reducibility, forms a countable real closed subfield of the real ordered field. This generalizes the well-known fact that the computable reals form a real closed field.With the same technique we show that the class of differences of computably enumerable reals (d.c.e. reals) and the class of computably approximable reals (c.a. reals) form real closed fields. The d.c.e. result was also proved nearly simultaneously and independently by Ng (Keng Meng Ng, Master's Thesis, National University of Singapore, in preparation).Lastly, we show that the class of d.c.e. reals is properly contained in the class or reals less random than Ω (the halting probability), which in turn is properly contained in the class of c.a. reals, and that neither the first nor last class is a randomness class (as captured by rK-reducibility).

Differentially algebraic group chunks

1990 ◽  
Vol 55 (3) ◽  
pp. 1138-1142 ◽  
Author(s):  
Anand Pillay
Keyword(s):  
Algebraic Group ◽  
Characteristic Zero ◽  
Quantifier Elimination ◽  
Closed Field ◽  
Zariski Topology ◽  
First Order ◽  
Differential Field ◽  
Closed Fields ◽  
Differential Fields ◽  
Algebraically Closed Fields

We point out that a group first order definable in a differentially closed field K of characteristic 0 can be definably equipped with the structure of a differentially algebraic group over K. This is a translation into the framework of differentially closed fields of what is known for groups definable in algebraically closed fields (Weil's theorem).I restrict myself here to showing (Theorem 20) how one can find a large “differentially algebraic group chunk” inside a group defined in a differentially closed field. The rest of the translation (Theorem 21) follows routinely, as in [B].What is, perhaps, of interest is that the proof proceeds at a completely general (soft) model theoretic level, once Facts 1–4 below are known.Fact 1. The theory of differentially closed fields of characteristic 0 is complete and has quantifier elimination in the language of differential fields (+, ·,0,1, −1,d).Fact 2. Affine n-space over a differentially closed field is a Noetherian space when equipped with the differential Zariski topology.Fact 3. If K is a differentially closed field, k ⊆ K a differential field, and a and are in k, then a is in the definable closure of k ◡ iff a ∈ ‹› (where k ‹› denotes the differential field generated by k and).Fact 4. The theory of differentially closed fields of characteristic zero is totally transcendental (in particular, stable).

scholarly journals Involutions on finite-dimensional algebras over real closed fields

2004 ◽  
Vol 77 (1) ◽  
pp. 123-128 ◽  
Author(s):  
W. D. Munn
Keyword(s):  
Characteristic Zero ◽  
Real Closed Field ◽  
Closed Field ◽  
Finite Dimensional Algebra ◽  
Dimensional Algebra ◽  
Algebraically Closed Field ◽  
Real Closed Fields ◽  
Finite Dimensional ◽  
Closed Fields ◽  
Finite Dimensional Algebras

AbstractIt is shown that the following conditions on a finite-dimensional algebra A over a real closed field or an algebraically closed field of characteristic zero are equivalent: (i) A admits a special involution, in the sense of Easdown and Munn, (ii) A admits a proper involution, (iii) A is semisimple.

scholarly journals THE NON-AXIOMATIZABILITY OF O-MINIMALITY

2014 ◽  
Vol 79 (01) ◽  
pp. 54-59 ◽  
Author(s):  
ALEX RENNET
Keyword(s):  
Function Symbol ◽  
Real Closed Field ◽  
Closed Field ◽  
Real Closed Fields ◽  
Ordered Fields ◽  
Closed Fields

Abstract Fix a language extending the language of ordered fields by at least one new predicate or function symbol. Call an L-structure R pseudo-o-minimal if it is (elementarily equivalent to) an ultraproduct of o-minimal structures. We show that for any recursive list of L-sentences , there is a real closed field satisfying which is not pseudo-o-minimal. This shows that the theory To−min consisting of those -sentences true in all o-minimal -structures, also called the theory of o-minimality (for L), is not recursively axiomatizable. And, in particular, there are locally o-minimal, definably complete expansions of real closed fields which are not pseudo-o-minimal.

scholarly journals A VALUATION THEORETIC CHARACTERIZATION OF RECURSIVELY SATURATED REAL CLOSED FIELDS

2015 ◽  
Vol 80 (1) ◽  
pp. 194-206 ◽  
Author(s):  
PAOLA D’AQUINO ◽  
SALMA KUHLMANN ◽  
KAREN LANGE
Keyword(s):  
Abelian Group ◽  
Real Closed Field ◽  
Closed Field ◽  
Real Closed Fields ◽  
Closed Fields ◽  
Theoretic Characterization ◽  
Image Position ◽  
Recursively Saturated

AbstractWe give a valuation theoretic characterization for a real closed field to be recursively saturated. This builds on work in [9], where the authors gave such a characterization for κ-saturation, for a cardinal $\kappa \ge \aleph _0 $. Our result extends the characterization of Harnik and Ressayre [7] for a divisible ordered abelian group to be recursively saturated.

scholarly journals Nilpotent orbits of exceptional Lie algebras over algebraically closed fields of bad characteristic

1985 ◽  
Vol 38 (3) ◽  
pp. 330-350 ◽  
Author(s):  
D. F. Holt ◽  
N. Spaltenstein
Keyword(s):  
Finite Field ◽  
Lie Algebras ◽  
Closed Field ◽  
Nilpotent Orbits ◽  
Reductive Algebraic Group ◽  
Exceptional Lie Algebras ◽  
Closed Fields ◽  
Characteristic 3 ◽  
Algebraically Closed Fields

AbstractThe classification of the nilpotent orbits in the Lie algebra of a reductive algebraic group (over an algebraically closed field) is given in all the cases where it was not previously known (E7 and E8 in bad characteristic, F4 in characteristic 3). The paper exploits the tight relation with the corresponding situation over a finite field. A computer is used to study this case for suitable choices of the finite field.

The model theory of ordered differential fields

1978 ◽  
Vol 43 (1) ◽  
pp. 82-91 ◽  
Author(s):  
Michael F. Singer
Keyword(s):  
Meromorphic Functions ◽  
Analytic Solutions ◽  
Positive Element ◽  
Real Closed Field ◽  
Real Field ◽  
Closed Field ◽  
Ordered Field ◽  
Positive Elements ◽  
Odd Degree ◽  
Differential Fields

In this paper, we show that the theory of ordered differential fields has a model completion. We also show that any real differential field, finitely generated over the rational numbers, is isomorphic to some field of real meromorphic functions. In the last section of this paper, we combine these two results and discuss the problem of deciding if a system of differential equations has real analytic solutions. The author wishes to thank G. Stengle for some stimulating and helpful conversations and for drawing our attention to fields of real meromorphic functions.§ 1. Real and ordered fields. A real field is a field in which −1 is not a sum of squares. An ordered field is a field F together with a binary relation < which totally orders F and satisfies the two properties: (1) If 0 < x and 0 < y then 0 < xy. (2) If x < y then, for all z in F, x + z < y + z. An element x of an ordered field is positive if x > 0. One can see that the square of any element is positive and that the sum of positive elements is positive. Since −1 is not positive, an ordered field is a real field. Conversely, given a real field F, it is known that one can define an ordering (not necessarily uniquely) on F [2, p. 274]. An ordered field F is a real closed field if: (1) every positive element is a square, and (2) every polynomial of odd degree with coefficients in F has a root in F. For example, the real numbers form a real closed field. Every ordered field can be embedded in a real closed field. It is also known that, in a real closed field K, polynomials satisfy the intermediate value property, i.e. if f(x) ∈ K[x] and a, b ∈ K, a < b, and f(a)f(b) < 0 then there is a c in K such that f(c) = 0.

Sign in / Sign up

Export Citation Format

Share Document