The theory RCF of real closed fields is o-minimal: every definable set is a finite union of intervals and points. RCF has quantifier elimination and is decidable. O-minimality provides a tame geometric structure: definable sets behave topologically like semialgebraic sets. RCF illustrates how Shelah's o-minimality framework applies to classical mathematics, enabling algorithmic solutions to geometric problems.
Describe definable sets in RCF and observe their piecewise linear structure, then contrast with ACF where definable sets can be transcendentally complex.
You already know that o-minimal structures tame definable sets so that every definable subset of the line is a finite union of intervals and points. You also know ACF — the theory of algebraically closed fields — which admits quantifier elimination and is complete once you fix the characteristic. RCF (the theory of real closed fields) is the ordered analogue: it axiomatizes fields that are ordered, where every positive element has a square root, and every odd-degree polynomial has a root. The real numbers ℝ are the canonical model, but there are many non-isomorphic real closed fields, including non-Archimedean ones with infinitely large and infinitely small elements.
The most important theorem about RCF is Tarski's quantifier elimination: every first-order formula over the language {0, 1, +, ×, <} is equivalent to a quantifier-free formula. This means any definable set in RCF — a set defined by a first-order formula possibly with quantifiers — is actually semialgebraic: a finite Boolean combination of polynomial equalities and inequalities. Semialgebraic sets are exactly the quantifier-free definable sets, so quantifier elimination collapses the two. As a consequence, RCF is decidable: there is an algorithm that determines whether any given first-order sentence is true in all real closed fields.
O-minimality is the geometric content of this algebraic fact. Because every definable subset of ℝ is semialgebraic, and every semialgebraic subset of ℝ is a finite union of intervals and points, RCF is o-minimal. This has far-reaching consequences for definable sets in higher dimensions. Every definable set in ℝⁿ decomposes into finitely many cells (open regions diffeomorphic to open boxes), a result called the cell decomposition theorem. Definable functions are piecewise continuous with finitely many pieces; definable sets have finitely many connected components; Euler characteristic is well-behaved. All of this is "tame topology" in Grothendieck's sense — geometry without pathological oscillation.
Contrasting RCF with ACF sharpens the picture. In ACF, definable sets are constructible — Boolean combinations of algebraic varieties — and the theory is also o-minimal in the sense that ℂ has no definable ordering, but the tameness is different. In RCF, the ordering does real work: the intermediate value theorem and Rolle's theorem hold for definable functions, enabling genuine geometric reasoning. Applications include algorithmic real algebraic geometry (deciding the satisfiability of polynomial inequalities over ℝ), Morse theory for semialgebraic functions, and, through more general o-minimal structures, the model-theoretic proof of the André-Oort conjecture for Shimura varieties. RCF demonstrates how a logical property — quantifier elimination — can translate directly into deep geometric and algorithmic consequences.
No topics depend on this one yet.