## FANDOM

78 Pages

An ordered field $(K,<)$ is said to be real-closed if it satisfies one of the following equivalent conditions:

• $K(i)$ is algebraically closed.
• Every positive element of $K$ has a square root, and every odd-degree polynomial has a zero.
• $K$ is elementarily equivalent to $\mathbb{R}$, the reals.
• $K$ satisfies a version of the intermediate value theorem: if a polynomial $P(X) \in K[X]$ changes sign on an interval, i.e., $P(a) < 0 < P(b)$ for some $a, b \in K$, then $P$ has a zero on the interval, i.e., $P(c) = 0$ for some $a < c < b$.
• $K$ is o-minimal.

The prototypical example of a real-closed field is $\mathbb{R}$. Other notable examples include Puiseux series in $\mathbb{R}$, Hahn series in $\mathbb{R}$, and the surreal numbers.

The ordering on a real closed field can be algebraically defined: $x \ge y$ if and only if $x - y$ is a square. Real closed fields are uniquely orderable, so it makes sense to say that a pure field $K$ is real closed.

The Artin-Schreier theorem (?) says that if $K$ is a field with finite absolute Galois group, then either $K$ is algebraically closed, or $K$ is real closed (and hence of characteristic zero). So the real closed fields can also be described as those pure fields with finite but non-trivial absolute Galois group.

The class of real closed fields is an elementary class, i.e., the set of models of some theory. This theory is usually denoted RCF. Unlike the case of ACF, RCF is complete. One usually works in one of two languages:

• The language of rings. In this case, RCF is model complete, but does not have quantifier elimination. In fact, $x \ge y$ is not equivalent to a quantifier-free formula.
• The language of ordered rings, i.e., the language of rings together with a binary predicate for the order. In this language, RCF has quantifier elimination.

The theory RCF is the model companion of ordered fields, or more generally ordered domains. In the pure ring language, it is also the model companion of the theory of orderable fields, i.e., fields admitting at least one ordering. (These turn out to be exactly the fields in which $-1$ is not a sum of squares.)

RCF is o-minimal, and therefore NIP. On the other hand, RCF (obviously) has the strong order property, so it is not stable, or simple.

RCF has elimination of imaginaries, as does every o-minimal expansion of RCF. In fact, RCF and its o-minimal expansions all have definable choice: if $\phi(x;y)$ is a formula, then there is a formula $\psi(x;y)$ such that for every $b$, if $\phi(K;b)$ is non-empty, then $\psi(K;b)$ is a singleton in $\phi(K;b)$. In particular, RCF and its o-minimal expansions have definable Skolem functions. Every definably closed set is a model.