Real closed field

In mathematics, a real closed field is an ordered field F in which any of the following equivalent conditions are true:

Every non-negative element of F has a square root in F, and any polynomial of odd degree with coefficients in F has at least one root in F.
The field extension $F(\sqrt{-1})$ is algebraically closed.
F has no proper algebraic extension to an ordered field.
F is a formally real field such that any algebraic extension of F is not formally real.

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+z². For any field F such that $F(\sqrt{-1})$ 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. If you add to the finite list of ordered field axioms an axiom saying that square roots of positive numbers exist, and 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.

Note that this decision procedure is not necessarily practical, in the sense that the algorithmic complexities of the currently known decision procedures are very high and practical execution times can be prohibitive except for very small problems.

Tarski's algorithm for quantifier elimination has non-elementary complexity, meaning that no tower $2^{2^{\cdot^{\cdot^{\cdot^n}}}}$ 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 $2^{2^\Omega(n)}$ and length $2^{2^\Omega(n)}$ , using O.2C o.2C .CE.A9.2C .CF.89.2C .CE.98.2C .C3.95.

Basu and Roy (1996) proved that there exists a well-behaved algorithm to decide the truth of a formula ∃x₁,…,∃x_k P₁(x₁,…,x_k)⋈0∧…∧P_s(x₁,…,x_k)⋈0 where ⋈ is <, > or =, with complexity in arithmetic operations s^k+1d^O(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 $\aleph_0$ .

We have therefore the following invariants defining the nature of a real closed field F:

The cardinality of F.

The cofinality of F.

To this we may add

The weight of F, which is the minimum size of a dense subset of F.

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:

A field F is complete if there is no ordered field K properly containing F such that F is dense in K. If the cofinality of K is κ, this is equivalent to saying Cauchy sequences indexed by κ are convergent in F.

An ordered field F has the η_α property for the ordinal number α if for any two subsets L and U of F of cardinality less than $\aleph_\alpha$ , at least one of which is nonempty, and such that every element of L is less than every element of U, there is an element x in F with x larger than every element of L and smaller than every element of U. This is closely related to the model-theoretic property of being a saturated model; any two real closed fields are η_α if and only if they are $\aleph_\alpha$ -saturated, and moreover two η_α real closed fields both of cardinality $\aleph_\alpha$ are order isomorphic.

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 η₁ property are order isomorphic. This unique field Ϝ can be defined by means of an ultrapower, as $\Bbb{R}^{\Bbb{N}}/{\mathbf M}$ , where M is a maximal ideal not leading to a field order-isomorphic to $\Bbb{R}$ . 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 $\aleph_\beta$ 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 $\Bbb{R}((G))$ 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 $\aleph_1$ , Κ has cardinality $\aleph_2$ , 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 $\aleph_2$ instead of $\aleph_1$ , cofinality $\aleph_1$ instead of $\aleph_0$ , and weight $\aleph_1$ instead of $\aleph_0$ , and with the η₁ property in place of the η₀ property (which merely means between any two real numbers we can find another.)

Examples of real closed fields

References

Chang, Chen Chung and Keisler, H. Jerome: Model Theory, North-Holland, 1989.
H. Garth Dales and W. Hugh Woodin: Super-Real Fields, Clarendon Press, 1996.
Computational Real Algebraic Geometry, Bhubaneswar Mishra, Handbook of Discrete and Computational Geometry, CRC Press, 1997 (Postscript version); also in 2004 edition, p. 743, ISBN 1584883014