No label defined (Q3840696)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1187511
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1187511

      Statements

      25 October 1998
      0 references
      o-minimal structure
      0 references
      elementary pair
      0 references
      dense pair
      0 references
      small definable set
      0 references
      0 references
      In a classic paper at the end of the fifties, Abraham Robinson showed the completeness of the theory of the pairs \(({\mathcal B},{\mathcal A})\), where \({\mathcal B}\), \({\mathcal A}\) are real closed fields and \({\mathcal A}\) is a proper dense ordered subfield of \({\mathcal B}\). Later, some possible extensions of this result were explored by several people, including Macintyre and Pillay. Here the author generalizes the analysis in the following setting: \(T\) is a complete o-minimal theory extending the theory of ordered abelian groups; \(L\) denotes the language of \(T\); a pair \(({\mathcal B},{\mathcal A})\) of models \({\mathcal B}\), \({\mathcal A}\) of \(T\) is called dense if \({\mathcal A}\) is an elementary substructure of \({\mathcal B}\), \(A \not = B\) and \(A\) is dense in \(B\); \(T^d\) is the theory of dense pairs of models of \(T\) in the obvious language \(L^d = L \cup \{ U \}\) where \(U\) is a new 1-ary relation symbol to be interpreted in the dense submodel. A back-and-forth argument proves that \(T^d\) is complete and provides the following weak form of quantifier elimination: each \(L^d\)-formula \(\psi(w_0,\ldots,w_n)\) is equivalent within \(T^d\) to a boolean combination of formulas \[ \exists v_0\ldots\exists v_m( \bigwedge_{i \leq m} U(v_i)\land \phi(v_0,\dots,v_m,w_0,\dots, w_n) \] where \(\phi\) is an \(L\)-formula. But the main purpose of the paper under review is to characterize definable sets and functions in a dense pair \(({\mathcal B},{\mathcal A})\) and to relate definability in \(({\mathcal B},{\mathcal A})\) to definability in \({\mathcal B}\) and \({\mathcal A}\). A key role under this point of view is played by the so-called \({\mathcal A}\)-small subsets of \(B\), i.e. subsets \(X\) (parametrically) definable in \(({\mathcal B},{\mathcal A})\) and satisfying \(X \subseteq f(A^n)\) for some function \(f\) of \(B^n\) in \(B\) definable in \({\mathcal B}\). It turns out that each function \(F\) of \(B\) in \(B\) definable in \(({\mathcal B},{\mathcal A})\) agrees off some \({\mathcal A}\)-small subset with a function definable in \({\mathcal B}\), and, for each subset \(S\) of \(B\) definable in \(({\mathcal B},{\mathcal A})\), there is an \({\mathcal A}\)-small subset \(X\) such that \(S - X = S' - X\) for some \(S'\subseteq B\) definable in \({\mathcal B}\); moreover a function \(F\) of \(A^n\) in \(A\) definable in \(({\mathcal B},{\mathcal A})\) is piecewise given by functions definable in \({\mathcal A}\). Furthermore, for every \({\mathcal A}\)-small set \(X\), there is a partition \[ - \infty \leq b_0 < b_1 <\ldots< b_k < b_{k+1} \leq + \infty \] of \(B\) such that, for each \(i \leq k\), \(X \cap (b_i,b_{i+1}) = \emptyset\) or \(X\) is dense and codense in \((b_i,b_{i+1})\); and so, for every \(S\subseteq B\) definable in \(({\mathcal B},{\mathcal A})\), there is a partition \[ - \infty \leq b_0 < b_1 <\ldots < b_k < b_{k+1} \leq + \infty \] of \(B\) such that, for each \(i \leq k\), \(S \cap (b_i, b_{i+1}) = \emptyset\), or \(S \supseteq (b_i, b_{i+1})\), or \(S\) is dense and codense in \((b_i, b_{i+1})\). The last statement has some remarkable consequences when \({\mathcal B}\) is an expansion of the ordered field or real numbers. For instance, if \(S \subseteq {\mathbb R^n}\) is open and definable in \(({\mathcal B}, {\mathcal A})\), then \(S\) is definable in \({\mathcal B}\).
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references