O-minimal theory explained

In mathematical logic, and more specifically in model theory, an infinite structure (M,<,...) that is totally ordered by < is called an o-minimal structure if and only if every definable subset X ⊆ M (with parameters taken from M) is a finite union of intervals and points.

O-minimality can be regarded as a weak form of quantifier elimination. A structure M is o-minimal if and only if every formula with one free variable and parameters in M is equivalent to a quantifier-free formula involving only the ordering, also with parameters in M. This is analogous to the minimal structures, which are exactly the analogous property down to equality.

A theory T is an o-minimal theory if every model of T is o-minimal. It is known that the complete theory T of an o-minimal structure is an o-minimal theory.^[1] This result is remarkable because, in contrast, the complete theory of a minimal structure need not be a strongly minimal theory, that is, there may be an elementarily equivalent structure that is not minimal.

Set-theoretic definition

O-minimal structures can be defined without recourse to model theory. Here we define a structure on a nonempty set M in a set-theoretic manner, as a sequence S = (S_n), n = 0,1,2,... such that

1. S_n is a boolean algebra of subsets of Mⁿ
2. if D ∈ S_n then M × D and D ×M are in S_n+1
3. the set is in S_n
4. if D ∈ S_n+1 and π : Mⁿ⁺¹ → Mⁿ is the projection map on the first n coordinates, then π(D) ∈ S_n.

For a subset A of M, we consider the smallest structure S(A) containing S such that every finite subset of A is contained in S₁. A subset D of Mⁿ is called A-definable if it is contained in S_n(A); in that case A is called a set of parameters for D. A subset is called definable if it is A-definable for some A.

If M has a dense linear order without endpoints on it, say <, then a structure S on M is called o-minimal (respect to <) if it satisfies the extra axioms

6. the set  < (=) is in S₂
7. the definable subsets of M are precisely the finite unions of intervals and points.

The "o" stands for "order", since any o-minimal structure requires an ordering on the underlying set.

Model theoretic definition

O-minimal structures originated in model theory and so have a simpler — but equivalent — definition using the language of model theory.^[2] Specifically if L is a language including a binary relation <, and (M,<,...) is an L-structure where < is interpreted to satisfy the axioms of a dense linear order,^[3] then (M,<,...) is called an o-minimal structure if for any definable set X ⊆ M there are finitely many open intervals I₁,..., I_r in M ∪  and a finite set X₀ such that

X = X _{0\cup} I _{1\cup\ldots\cup} I _{r.}

Examples

Examples of o-minimal theories are:

• The complete theory of dense linear orders in the language with just the ordering.
• RCF, the theory of real closed fields.^[4]
• The complete theory of the real field with restricted analytic functions added (i.e. analytic functions on a neighborhood of [0,1]ⁿ, restricted to [0,1]ⁿ; note that the unrestricted sine function has infinitely many roots, and so cannot be definable in an o-minimal structure.)
• The complete theory of the real field with a symbol for the exponential function by Wilkie's theorem. More generally, the complete theory of the real numbers with Pfaffian functions added.
• The last two examples can be combined: given any o-minimal expansion of the real field (such as the real field with restricted analytic functions), one can define its Pfaffian closure, which is again an o-minimal structure.^[5] (The Pfaffian closure of a structure is, in particular, closed under Pfaffian chains where arbitrary definable functions are used in place of polynomials.)

In the case of RCF, the definable sets are the semialgebraic sets. Thus the study of o-minimal structures and theories generalises real algebraic geometry. A major line of current research is based on discovering expansions of the real ordered field that are o-minimal. Despite the generality of application, one can show a great deal about the geometry of set definable in o-minimal structures. There is a cell decomposition theorem,^[6] Whitney and Verdier stratification theorems and a good notion of dimension and Euler characteristic.

Moreover, continuously differentiable definable functions in a o-minimal structure satisfy a generalization of Łojasiewicz inequality,^[7] a property that has been used to guarantee the convergence of some non-smooth optimization methods, such as the stochastic subgradient method (under some mild assumptions).^{[8] [9] [10]}

See also

• Semialgebraic set
• Real algebraic geometry
• Strongly minimal theory
• Weakly o-minimal structure
• C-minimal theory
• Tame topology

References

• Book: van den Dries, Lou . Tame Topology and o-minimal Structures . 1998 . . London Mathematical Society Lecture Note Series . 248 . Cambridge . 0953.03045 . 978-0-521-59838-5 .
• . Marker . David . 37 . 2000 . 351–357 . Review of "Tame Topology and o-minimal Structures" . 10.1090/S0273-0979-00-00866-1 . 3 . free .
• Book: Marker, David . Model theory: An introduction . Graduate Texts in Mathematics . 217 . New York, NY . . 2002 . 978-0-387-98760-6 . 1003.03034 .
• Pillay . Anand . Steinhorn, Charles . 1986 . Definable Sets in Ordered Structures I . . 295 . 2 . 565–592 . 10.2307/2000052 . 2000052 . 0662.03023 . free .
• Knight, Julia . Julia F. Knight. Pillay, Anand . Steinhorn, Charles . 1986 . Definable Sets in Ordered Structures II . . 295 . 593–605 . 10.2307/2000053 . 2000053 . 2 . 0662.03024 . free .
• Pillay . Anand . Steinhorn, Charles . 1988 . Definable Sets in Ordered Structures III . . 309 . 469–476 . 10.2307/2000920 . 2000920 . 2 . 0707.03024 . free .
• Wilkie . A.J. . Alex Wilkie . Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function . . 1996 . 9 . 10.1090/S0894-0347-96-00216-0 . 1051–1095 . 4 . free .
• Denef . J. . van den Dries. L. . p-adic and real subanalytic sets . . 128 . 1989 . 1971463 . 79–138 . 1 . 10.2307/1971463 .

External links

• Model Theory preprint server
• Real Algebraic and Analytic Geometry Preprint Server

Notes and References

1. Knight, Pillay and Steinhorn (1986), Pillay and Steinhorn (1988).
2. Marker (2002) p.81
3. The condition that the interpretation of < be dense is not strictly necessary, but it is known that discrete orders lead to essentially trivial o-minimal structures, see, for example, and .
4. Marker (2002) p.99
5. Patrick Speisseger, Pfaffian sets and o-minimality, in: Lecture notes on o-minimal structures and real analytic geometry, C. Miller, J.-P. Rolin, and P. Speissegger (eds.), Fields Institute Communications vol. 62, 2012, pp. 179–218.
6. Marker (2002) p.103
7. Kurdyka . Krzysztof . 1998 . On gradients of functions definable in o-minimal structures . Annales de l'Institut Fourier . 48 . 3 . 769–783 . 10.5802/aif.1638 . 0373-0956. free .
8. Davis . Damek . Drusvyatskiy . Dmitriy . Kakade . Sham . Lee . Jason D. . 2020 . Stochastic Subgradient Method Converges on Tame Functions . Foundations of Computational Mathematics . en . 20 . 1 . 119–154 . 10.1007/s10208-018-09409-5 . 1804.07795 . 5025719 . 1615-3375.
9. Descent dynamical systems and algorithms for tame optimization, and multi-objective problems . Université Montpellier; Universidad técnica Federico Santa María (Valparaiso, Chili) . 2015-11-02 . PhD . en . Guillaume . Garrigos.
10. Ioffe . A. D. . 2009 . An Invitation to Tame Optimization . SIAM Journal on Optimization . en . 19 . 4 . 1894–1917 . 10.1137/080722059 . 1052-6234.