Real closed field
In mathematics, a real closed field is a field F that has the same first-order properties as the field of real numbers.
≈ 8 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In mathematics, a real closed field is a field F that has the same first-order properties as the field of real numbers. (First-order properties are those properties that can be expressed with the logic symbols \forall, \exists, \vee, \and, \neg, \to and the arithmetic symbols 0, 1, +, -, \times , \div, = , where the domain of all quantifiers is the set F ; it is hence not allowed to quantify over natural numbers, subsets of F , sequences in F , functions F\to F etc.) Some examples of real closed fields are the field of real numbers itself, the field of real algebraic numbers, and fields of hyperreal numbers that include infinitesimals.
In algebra, most theorems that involve the real numbers remain true when formulated for arbitrary real closed fields.
Equivalent definitions
A real closed field is a field F in which any of the following equivalent conditions is true: F is elementarily equivalent to the field of real numbers. In other words, it has the same first-order properties as the reals: any sentence in the first-order language of fields is true in F if and only if it is true in the reals.
There is a total order on F turning F into an ordered field such that, in this ordering, every positive 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. There is a total order on F turning F into an ordered field such that, in this ordering, the intermediate value theorem holds for all polynomials with coefficients in F. F is a formally real field (meaning there exists a total order on F turning F into an ordered field) such that every polynomial of odd degree with coefficients 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 not algebraically closed, but its algebraic closure is a finite extension of F. F is not algebraically closed but the field extension F(\sqrt{-1}\,) is algebraically closed.
There is an ordering on F that does not extend to an ordering on any proper algebraic extension of F. F is a formally 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.) F is a weakly o-minimal ordered field.
Real closure
If F is an 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 given ordering on F, and is unique up to a unique isomorphism of fields identical on F (note that every ring homomorphism between real closed fields automatically is order preserving, because x ≤ y if and only if ∃z : y = x + z 2 ). For example, the real closure of the ordered field of rational numbers is the field \mathbb{R}_\mathrm{alg} of real algebraic numbers.
The theorem is named for Emil Artin and Otto Schreier, who proved it in 1926. If (F, P) is an ordered field, and E is a Galois extension of F, then by Zorn's lemma there is a maximal ordered field extension (M, Q) with M a subfield of E containing F and the order on M extending P. This M, together with its ordering Q, is called the relative real closure of (F, P) in E. We call (F, P) real closed relative to E if M is just F. When E is the algebraic closure of F the relative real closure of F in E is actually the real closure of F described earlier.
If F is a field (not ordered or even orderable) then F still has a real closure, which may not be a field anymore, but just a real closed ring. For example, the real closure of the field \mathbb{Q}(\sqrt 2) is the ring \mathbb{R}_\mathrm{alg} \!\times \mathbb{R}_\mathrm{alg} (the two copies correspond to the two orderings of \mathbb{Q}(\sqrt 2) ).
On the other hand, if \mathbb{Q}(\sqrt 2) is considered as an ordered subfield of \mathbb{R} , its real closure is again the field \mathbb{R}_\mathrm{alg} .
Decidability and quantifier elimination
The language of real closed fields \mathcal{L}_\text{rcf} includes symbols for the operations of addition and multiplication, the constants 0 and 1, and the order relation (as well as equality, if this is not considered a logical symbol). In this language, the (first-order) theory of real closed fields, \mathcal{T}_\text{rcf} , consists of all sentences that follow from the following axioms: the axioms of ordered fields; the axiom asserting that every positive number has a square root; for every odd number d , the axiom asserting that all polynomials of degree d have at least one root.
All of these axioms can be expressed in first-order logic (i.e. quantification ranges only over elements of the field). Note that \mathcal{T}_\text{rcf} is just the set of all first-order sentences that are true about the field of real numbers.
Tarski showed that \mathcal{T}_\text{rcf} is complete, meaning that any \mathcal{L}_\text{rcf} -sentence can be proven either true or false from the above axioms. Furthermore, \mathcal{T}_\text{rcf} is decidable, meaning that there is an algorithm to determine the truth or falsity of any such sentence.
This was done by showing quantifier elimination: there is an algorithm that, given any \mathcal{L}_\text{rcf} -formula, which may contain free variables, produces an equivalent quantifier-free formula in the same free variables, where equivalent means that the two formulas are true for exactly the same values of the variables. Tarski's proof uses a generalization of Sturm's theorem.
Since the truth of quantifier-free formulas without free variables can be easily checked, this yields the desired decision procedure. These results were obtained and published in 19481. The Tarski–Seidenberg theorem extends this result to the following projection theorem.
If is a real closed field, a formula with free variables defines a subset of , the set of the points that satisfy the formula. Such a subset is called a semialgebraic set. Given a subset of variables, the projection from to is the function that maps every -tuple to the -tuple of the components corresponding to the subset of variables.
The projection theorem asserts that a projection of a semialgebraic set is a semialgebraic set, and that there is an algorithm that, given a quantifier-free formula defining a semialgebraic set, produces a quantifier-free formula for its projection. In fact, the projection theorem is equivalent to quantifier elimination, as the projection of a semialgebraic set defined by the formula is defined by (\exists x) P(x,y), where and represent respectively the set of eliminated variables, and the set of kept variables.
The decidability of a first-order theory of the real numbers depends dramatically on the primitive operations and functions that are considered (here addition and multiplication). Adding other functions symbols, for example, the sine or the exponential function, can provide undecidable theories; see Richardson's theorem and Decidability of first-order theories of the real numbers.
Furthermore, the completeness and decidability of the first-order theory of the real numbers (using addition and multiplication) contrasts sharply with Gödel's and Turing's results about the incompleteness and undecidability of the first-order theory of the natural numbers (using addition and multiplication). There is no contradiction, since the statement "x is an integer" cannot be formulated as a first-order formula in the language \mathcal{L}_\text{rcf} .
External links
Real Algebraic and Analytic Geometry Preprint Server Model Theory preprint server
Text derived from https://en.wikipedia.org/w/index.php?oldid=1375976123 under CC BY-SA 4.0; modifications have been made.
References
- ↩Wikipedia “Real closed field” publication date (×1) · confidence 0.95 revision URL