Quantitative approximate definable choices

In semialgebraic geometry, projections play a prominent role. A definable choice is a semialgebraic selection of one point in every fiber of a projection. Definable choices exist by semialgebraic triviality, but their complexity depends exponentially on the number of variables. By allowing the selection to be approximate (in the Hausdorff sense), we improve on this result. In particular, we construct an approximate selection whose degree is linear in the complexity of the projection and does not depend on the number of variables. This work is motivated by infinite-dimensional applications, in particular to the Sard conjecture in sub-Riemannian geometry. To prove these results, we develop a general quantitative theory for Hausdorff approximations in semialgebraic geometry, which has independent interest.