- Real closed field
In

mathematics , a**real closed field**is a field "F" in which any of the following equivalent conditions are true:#There is a

total order on "F" making it anordered field such that, in this ordering, every positive element of "F" is a square in "F" and anypolynomial of odd degree withcoefficients in "F" has at least one root in "F".

#"F" is aformally real field such that every polynomial of odd degree withcoefficients in "F" has at least one root in "F", and for every element "a" of "F" there is "b" in "F" such that "a"="b"^{2}or "a"="-b"^{2}.

#"F" is notalgebraically closed but its algebraic closure is afinite extension .

#"F" is not algebraically closed but thefield extension $F(sqrt\{-1\})$ is algebraically closed.

#There is an ordering on "F" which does not extend to an ordering on any properalgebraic extension of "F".

#"F" is aformally real field such that no proper algebraic extension of "F" is formally real. (In other words, the field is maximal in an algebraic closure with respect to the property of being formally real.)

#There is an ordering on "F" making it an ordered field such that, in this ordering, theintermediate value theorem holds for all polynomials over "F".The proof that these properties are all equivalent is not easy.

If F is an ordered field (not just orderable, but a definite ordering is fixed as part of the structure), 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 given ordering on F, and is unique up toorder isomorphism . For example, the real closure of the rational numbers are the realalgebraic number s. The theorem is named forEmil Artin andOtto 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"

^{2}. 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. By adding to the

ordered field axioms

*an axiom asserting that every positive number has a square root, and

*an axiom scheme asserting that allpolynomial s of odd order have at least one real root,one obtains afirst-order theory . Tarski (1951) proved that the theory of real closed fields, including thebinary predicate symbols "=", "≠", and "<", and the operations of addition and multiplication, admitselimination of quantifiers , which implies that it is acomplete and decidable theory.Decidability means that there exists at least one

decision procedure , i.e., a well-defined algorithm for determining whether a sentence in the first order language of real closed fields is true.Euclidean geometry (without the ability to measure angles) is also a model of the real field axioms, and thus is also decidable.The decision procedures are not necessarily "practical". The algorithmic complexities of all known decision procedures for real closed fields are very high, so that practical execution times can be prohibitively high except for very simple problems.

The algorithm Tarski proposed for

quantifier elimination hasNONELEMENTARY 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 (1988) proved that quantifier elimination is in fact (at least) 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 .Basu and Roy (1996) proved that there exists a well-behaved algorithm to decide the truth of a formula ∃x

_{1},…,∃x_{k}P_{1}(x_{1},…,x_{k})⋈0∧…∧P_{s}(x_{1},…,x_{k})⋈0 where ⋈ is <, > or =, with complexity in arithmetic operations s^{k+1}d^{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 inabsolute value . An equivalent statement is that for any real number, there are integers both larger and smaller. Anon-archimedean field is, of course, a field that is not archimedean, and there are real closed non-archimedean fields; for example any field ofhyperreal 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 cofinality 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 asaturated 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 η

_{1}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 innonstandard 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\_eta$ 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 series with a countable number of nonzero terms of the field $Bbb\{R\}((G))$ of

formal power series on the Sierpiński group.Ϝ 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 η

_{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*** the real

algebraic numbers

* thecomputable number s

* thedefinable number s

* thereal number s

*superreal number s

*hyperreal number s**References*** Basu, Saugata,

Richard Pollack , and Marie-Françoise Roy (2003) "Algorithms in real algebraic geometry" in "Algorithms and computation in mathematics". Springer. ISBN 3540330984 ( [*http://perso.univ-rennes1.fr/marie-francoise.roy/bpr-posted1.html online version*] )

* Caviness, B F, and Jeremy R. Johnson, eds. (1998) "Quantifier elimination and cylindrical algebraic decomposition". Springer. ISBN 3211827943

*C. C. Chang andH. Jerome Keisler (1989) "Model Theory". North-Holland.

* Dales, H. G., andW. Hugh Woodin (1996) "Super-Real Fields". Oxford Univ. Press.

* Mishra, Bhubaneswar (1997) " [*http://www.cs.nyu.edu/mishra/PUBLICATIONS/97.real-alg.ps Computational Real Algebraic Geometry,*] " in "Handbook of Discrete and Computational Geometry". CRC Press. 2004 edition, p. 743. ISBN 1-58488-301-4

*Alfred Tarski (1951) "A Decision Method for Elementary Algebra and Geometry". Univ. of California Press.

*Wikimedia Foundation.
2010.*