O-minimal theory

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

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

A theory is an o-minimal theory if every model of is o-minimal. It is known that the complete theory of an o-minimal structure is an o-minimal theory. 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 in a set-theoretic manner, as a sequence such that

  1. is a boolean algebra of subsets of
  2. if then and are in
  3. the set is in
  4. if and is the projection map on the first coordinates, then .

For a subset of , we consider the smallest structure containing such that every finite subset of is contained in . A subset of is called -definable if it is contained in ; in that case, is called a set of parameters for . A subset is called definable if it is -definable for some .

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

  1. the set (identified with its graph ) is in
  2. the definable subsets of 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. Namely, if is a language including a binary relation , and is an -structure where is interpreted to satisfy the axioms of a dense linear order, then is called an o-minimal structure if for any definable set there are finitely many open intervals in and a finite set such that

Examples

Examples of o-minimal theories are:

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, Whitney and Verdier stratification theorems and a good notion of dimension and Euler characteristic.

Moreover, continuously differentiable definable functions in an o-minimal structure satisfy a generalization of Łojasiewicz inequality, 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).

See also

Notes

  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, MR 0899083 and MR 0943306.
  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. doi:10.1007/978-1-4614-4042-0_5
  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. doi:10.5802/aif.1638. ISSN 0373-0956.
  8. ↑ Davis, Damek; Drusvyatskiy, Dmitriy; Kakade, Sham; Lee, Jason D. (2020). "Stochastic Subgradient Method Converges on Tame Functions". Foundations of Computational Mathematics. 20 (1): 119–154. arXiv:1804.07795. doi:10.1007/s10208-018-09409-5. ISSN 1615-3375. S2CID 5025719.
  9. ↑ Garrigos, Guillaume (2015-11-02). Descent dynamical systems and algorithms for tame optimization, and multi-objective problems (PhD thesis). Université Montpellier; Universidad técnica Federico Santa María (Valparaiso, Chili).
  10. ↑ Ioffe, A. D. (2009). "An Invitation to Tame Optimization". SIAM Journal on Optimization. 19 (4): 1894–1917. doi:10.1137/080722059. ISSN 1052-6234.

References