On polynomial images of a closed ball

Abstract

In this work we approach the problem of determining which (compact) semialgebraic subsets of Rn are images under polynomial maps f : Rm → Rn of the closed unit ball Bm centered at the origin of some Euclidean space Rm and that of estimating (when possible) which is the smallest m with this property. Contrary to what happens with the images of Rm under polynomial maps, it is quite straightforward to provide basic examples of semialgebraic sets that are polynomial images of the closed unit ball. For instance, simplices, cylinders, hypercubes, elliptic, parabolic or hyperbolic segments (of dimension n) are polynomial images of the closedunit ball in Rn. The previous examples (and other basic ones proposed in the article) provide a large family of ‘n-bricks’ and we find necessary and sufficient conditions to guarantee that a finite union of ‘n-bricks’ is again a polynomial image of the closed unit ball either of dimension n or n + 1. In this direction, we prove: A finite union S of n-dimensional convex polyhedra is the image of the n-dimensional closed unit ball Bn if and only if S is connected by analytic paths. The previous result can be generalized using the ‘n-bricks’ mentioned before and we show: If S1, . . . , S` ⊂ Rn are ‘n-bricks’, the union S := S` i=1 Si is the image of the closed unit ball Bn+1 of Rn+1 under a polynomial map f: Rn+1 → Rn if and only if S is connected by analytic paths.