|
In mathematics, a real closed field is an ordered field F in which any of the following equivalent conditions are true: If F is any ordered field, the Artin-Schreier theorem states that F has an algebraic extension, called the real closure K of F, such that K is a real closed field whose ordering is an extension of the ordering on F, and is unique up to order isomorphism. For example, the real closure of the rational numbers are the real algebraic numbers. The theorem is named for Emil Artin and Otto Schreier, who proved it in 1926.
Model theory Two real closed fields, isomorphic as fields, are necessarily isomorphic as ordered fields; any field isomorphism of real closed fields is isotonic, or order-preserving, as the ordering of a real closed field is definable by a first-order formula from its field operations: x ≤ y if and only if ∃z y = x+z2. For any field F such that is an algebraically closed field, there is a unique ordering which makes F a real closed field (and it is given by the formula above). Decidability and quantifier elimination The theory of real closed fields was invented by algebraists but taken up with enthusiasm by logicians. By adding to the finite list of ordered field axioms an axiom saying that square roots of positive numbers exist, as well as an axiom scheme saying there exists a root for any polynomial of odd order, one obtains a first-order theory. Tarski's theorem tells us that the theory of real closed fields, including a "<" predicate symbol, admits elimination of quantifiers, which in turn entails it is a complete and decidable theory. The latter means that we can always tell by a decision procedure whether some sentence in the first-order language with relation symbols for inequality and equality, and functions for addition and multiplication, is true. Euclidean geometry (without the ability to measure angles) can be axiomatized using the real field axioms, and thus is decidable. This decision procedure, however, is not necessarily practical. The algorithmic complexities of the currently known decision procedures are very high and practical execution times can be prohibitive except for very simple, small problems. Tarski's algorithm for quantifier elimination has non-elementary complexity, meaning that no tower can bound the execution time of the algorithm if n is the size of the problem. Davenport and Heinz proved in 1988 that quantifier elimination is in fact doubly exponential: there exists a family Φn of formulas with n quantifiers, of length O(n) and constant degree such that any quantifier-free formula equivalent to Φn must involve polynomials of degree and length , using the Ω asymptotic notation. Basu and Roy (1996) proved that there exists a well-behaved algorithm to decide the truth of a formula ∃x1,…,∃xk P1(x1,…,xk)⋈0∧…∧Ps(x1,…,xk)⋈0 where ⋈ is <, > or =, with complexity in arithmetic operations sk+1dO(k). Order properties A crucially important property of the real numbers is that it is an archimedean field, meaning it has the archimedean property that for any real number, there is an integer larger than it in absolute value. An equivalent statement is that for any real number, there are integers both larger and smaller. A non-archimedean field is, of course, a field that is not archimedean, and there are real closed non-archimedean fields; for example any field of hyperreal numbers is real closed and non-archimedean. The archimedean property is related to the concept of cofinality. A set X contained in an ordered set F is cofinal in F if for every y in F there is an x in X such that y < x. In other words, X is an unbounded sequence in F. The confinality of F is the size of the smallest cofinal set, which is to say, the size of the smallest cardinality giving an unbounded sequence. For example natural numbers are cofinal in the reals, and the cofinality of the reals is therefore . We have therefore the following invariants defining the nature of a real closed field F: To this we may add These three cardinal numbers tell us much about the order properties of any real closed field, though it may be difficult to discover what they are, especially if we are not willing to invoke generalized continuum hypothesis. There are also particular properties which may or may not hold: The generalized continuum hypothesis The characteristics of real closed fields become much simpler if we are willing to assume the generalized continuum hypothesis. If the continuum hypothesis holds, all real closed fields with cardinality the continuum and having the η1 property are order isomorphic. This unique field Ϝ can be defined by means of an ultrapower, as , where M is a maximal ideal not leading to a field order-isomorphic to . This is the most commonly used hyperreal number field in nonstandard analysis, and its uniqueness is equivalent to the continuum hypothesis. (Even without the continuum hypothesis we have that if the cardinality of the continuum is then we have a unique ηβ field of size ηβ.) Moreover, we do not need ultrapowers to construct Ϝ, we can do so much more constructively as the subfield of of formal power series on the Sierpinski group with a countable number of nonzero terms. Ϝ however is not a complete field; if we take its completion, we end up with a field Κ of larger cardinality. Ϝ has the cardinality of the continuum which by hypothesis is , Κ has cardinality , and contains Ϝ as a dense subfield. It is not an ultrapower but it is a hyperreal field, and hence a suitable field for the usages of nonstandard analysis. It can be seen to be the higher-dimensional analogue of the real numbers; with cardinality instead of , cofinality instead of , and weight instead of , and with the η1 property in place of the η0 property (which merely means between any two real numbers we can find another.) Examples of real closed fields | ||||||||
|
| |||||||||
 |
|
| |