O-Minimality

Origin. van den Dries, Knight, Pillay, Steinhorn (1986). Tame geometry over the reals. Definable sets are finite unions of intervals. No pathological sets. Foundation for real algebraic geometry.

Models. An expansion of any linearly ordered structure (M, <) — with (ℝ, <) the paradigm — in which every definable subset of M is a finite union of points and open intervals with endpoints in M ∪ {±∞}. "Order-minimal": the definable sets are no richer than the order alone already forces.

Formalism.

O-minimal structure: M = (ℝ, <, ...) where: Every definable X ⊆ ℝ is finite union of:

Points {a}
Open intervals (a,b)
Half-infinite intervals (-∞,a), (a,∞)
ℝ itself

Definable: Defined by first-order formula with parameters. X = {x ∈ ℝ | M ⊨ φ(x, a₁,...,aₙ)}

Examples of o-minimal structures: (ℝ, <, +, ·): real closed fields (ℝ, <, +, ·, exp): exponential field (ℝ_an): real analytic functions (ℝ_an,exp): analytic + exp

Cell decomposition: Definable sets in ℝⁿ decompose into cells. Cells: products of points and intervals. Finite decomposition.

Definable functions: Piecewise continuous. Eventually monotone. Finite number of local extrema.

Dimension theory: Well-behaved dimension. dim(X) defined topologically. Agrees with algebraic dimension.

Symbols.

Symbol	Unicode	Name	Meaning
(ℝ, <)	—	Ordered reals	The paradigm base structure
ℝ	U+211D	Reals	Underlying set of the standard example
<	—	Order	The linear order o-minimality is relative to
φ	U+03C6	Formula	Defining formula
dim	—	Dimension	Topological dimension of a definable set
∪	U+222A	Union	Finite union of points and intervals
⊆	U+2286	Subset	Definable subset of Mⁿ
⊨	U+22A8	Satisfaction	M ⊨ φ(x, ā)
∞	U+221E	Infinity	Endpoint of a half-infinite interval
ℝ_an	—	Restricted analytic	Reals with restricted analytic functions
ℝ_exp	—	Exponential field	(ℝ, <, +, ·, exp), o-minimal by Wilkie

Metatheory. Knight, Pillay, and Steinhorn (1986) proved that o-minimality is a property of the theory: if M is o-minimal then every model of Th(M) is o-minimal, so the notion is elementary and transfers along elementary equivalence. The cell decomposition theorem gives every definable subset of Mⁿ as a finite disjoint union of cells and every definable function as piecewise continuous; the monotonicity theorem gives a definable unary function as constant or strictly monotone and continuous on each of finitely many subintervals. Definable families have uniformly bounded numbers of connected components, which yields a dimension theory agreeing with topological dimension. Every o-minimal theory is unstable, since the order has the order property, but every o-minimal theory is NIP. An o-minimal expansion of an ordered field has real closed underlying field (Pillay and Steinhorn). Wilkie (1996) proved ℝ_exp model complete and hence o-minimal; van den Dries, Macintyre, and Marker (1994) established ℝ_an,exp. Pila and Wilkie's counting theorem (2006) turned o-minimality into a Diophantine tool.

Applies to. Real algebraic geometry. Diophantine geometry. Analysis. Model theory. Differential equations.

Limitations. No o-minimal structure defines an infinite discrete subset, so ℤ, ℕ, and any infinite periodic zero set are excluded; no o-minimal structure interprets arithmetic, and none can express counting, cardinality, or a limit along a sequence. That is what rules out unrestricted analytic functions: (ℝ, <, +, ·, sin) is not o-minimal because the zero set of sin is πℤ, which is why the analytic structures must be restricted to bounded boxes as ℝ_an is. O-minimality does not imply decidability — it constrains definable sets and supplies no algorithm — and decidability of Th(ℝ_exp) is open, known only to follow from Schanuel's conjecture (Macintyre and Wilkie). The definition presupposes a linear order, so there is no o-minimal account of ℂ. Definable choice needs an expansion of an ordered group, not o-minimality alone.