Compact Apporximations and Topological Complexity of definable Sets

We study upper bounds on topological complexity of sets definable in o-minimal structures over the reals. We suggest a new construction for approximating a large class of definable sets, including the sets defined by arbitrary Boolean combinations of equations and inequalities, by compact sets.

Those compact sets bound from above the homotopies and homologies of the approximated sets.

The construction is applicable to images under definable maps.

Based on this construction we refine the previously known upper bounds on Betti numbers of semialgebraic and semi-Pfaffian sets defined by quantifier-free formulae, and prove similar new upper bounds, individual for different Betti numbers, for their images under arbitrary continuous definable maps.

Joint work with A. Gabrielov.