Doubling coverings via resolution of singularities and preparation
Raf Cluckers, Omer Friedland, Yosef Yomdin

TL;DR
This paper establishes asymptotic upper bounds on the complexity of doubling coverings and chart coverings for polynomial hypersurfaces and semi-algebraic sets, using resolution of singularities and preparation techniques.
Contribution
It provides general bounds for the complexity of coverings in singular and regular hypersurfaces, extending to semi-algebraic and subanalytic sets, with new asymptotic estimates.
Findings
Bounds of the form κ(𝒰) ≤ K₁(log(1/δ))^{K₂} confirmed for various hypersurfaces.
Upper bounds for the number of charts covering semi-algebraic sets established.
Results hold uniformly across different complexities of the sets.
Abstract
In this paper we provide asymptotic upper bounds on the complexity in two (closely related) situations. We confirm for the total doubling coverings and not only for the chains the expected bounds of the form This is done in a rather general setting, i.e. for the -complement of a polynomial zero-level hypersurface and for the regular level hypersurfaces themselves with no assumptions on the singularities of . The coefficient is the ambient dimension in the first case and in the second case. However, the question of a uniform behavior of the coefficient remains open. As a second theme, we confirm in arbitrary dimension the upper bound for the number of a-charts covering a real semi-algebraic set of dimension away from the -neighborhood of a lower dimensional set…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Doubling coverings via resolution of singularities and preparation
Raf Cluckers
Université de Lille, Laboratoire Painlevé, CNRS - UMR 8524, Cité Scientifique, 59655 Villeneuve d’Ascq Cedex, France, and, KU Leuven, Department of Mathematics, Celestijnenlaan 200B, B-3001 Leuven, Belgium
[email protected] http://rcluckers.perso.math.cnrs.fr/ ,
Omer Friedland
Institut de Mathématiques de Jussieu - Paris Rive Gauche, Sorbonne Université - Campus Pierre et Marie Curie, 4 place Jussieu, 75252 Paris, France.
and
Yosef Yomdin
Department of Mathematics, The Weizmann Institute of Science, Rehovot 76100, Israel.
Abstract.
In this paper we provide asymptotic upper bounds on the complexity in two (closely related) situations. We confirm for the total doubling coverings and not only for the chains the expected bounds of the form
[TABLE]
This is done in a rather general setting, i.e. for the -complement of a polynomial zero-level hypersurface and for the regular level hypersurfaces themselves with no assumptions on the singularities of . The coefficient is the ambient dimension in the first case and in the second case. However, the question of a uniform behavior of the coefficient remains open. As a second theme, we confirm in arbitrary dimension the upper bound for the number of a-charts covering a real semi-algebraic set of dimension away from the -neighborhood of a lower dimensional set , with bound of the form
[TABLE]
holding uniformly in the complexity of . We also show an analogue for level sets with parameter away from the -neighborhood of a low dimensional set. More generally, the bounds are obtained also for real subanalytic and real power-subanalytic sets.
R.C. was partially supported by the European Research Council under the European Community’s Seventh Framework Programme (FP7/2007-2013) with ERC Grant Agreement nr. 615722 MOTMELSUM, by the Labex CEMPI (ANR-11-LABX-0007-01), and by KU Leuven IF C14/17/083. Y.Y. was partially supported by the Minerva foundation.
1. Introduction
Let us recall the definition of a doubling covering, as given in [FY17, FY]. Let be a complex -dimensional manifold and let be a relatively compact domain in . Let be the unit ball in . For , a -doubling covering of in is a finite collection of analytic univalent functions satisfying the following conditions:
-
The images (aka charts) cover the closure of .
-
Each is extendible to a mapping , which is univalent in a neighborhood of , where is the -times larger concentric ball of .
For we may omit in notations, and call a covering just a doubling one (sometimes using this short name also for -doubling coverings with ). Recall also that a doubling chain joining two points is a series of doubling charts , , so that their images satisfy , , and . We denote by the length of a chain , that is, the number of its elements.
Doubling coverings provide a conformally invariant version of Whitney’s ball coverings of a domain , introduced in [Whi]. These coverings consist of balls so that larger concentric balls are still in . In our definition we replace by a complex manifold , while the balls are replaced by the charts . In [FY17] we prove, in a rather general form, that the doubling coverings (more accurately, the chains of doubling charts) on provide an upper bound to the Kobayashi metric and an upper bound to the “doubling constants” on this manifold (see also [FY]). Thus, these facts suggest possible connections with complex hyperbolic geometry. The results on quasi-hyperbolic metrics, on one side and on the complexity of Whitney’s ball coverings, on the other, obtained in [MV87] and in other related publications, look very relevant (see also the survey [BB12, Chapter 6] for extensions and developments of Whitney’s coverings in other directions).
In view of these connections, one can hope that doubling coverings on provide a common ground for a better understanding of the above mentioned structures. Consequently, one of the most important problems related to doubling coverings of in is an explicit bound on their “complexity”, , which is the number of the doubling charts in .
Let us stress that the mere existence of a finite doubling covering for any regular complex manifold and any compact is immediate: we just use the coordinate charts on . Moreover, for singular (a situation not addressed in this paper) this fact remains basically true. Indeed, in situations where the resolution of singularities works (algebraic, analytic, sub-analytic and some o-minimal settings), we just double-cover a “non-singular model” of and , and compose the charts with the resolution mapping . However, the complexity may blow up in families. “Uncontrolled” complexity growth may present a major problem in applications, while the power-logarithmic bounds obtained below promise to work.
Now, we can explain the nature of the difficulties we settle in this paper. Let us start with Whitney’s ball coverings. In this case there are rather accurate bounds on the complexity of such coverings. In particular, in [MV87] some bounds on the complexity of the ball coverings of the complements of closed sets are given, in terms of the Minkowski dimension of these sets. For a set of dimension a (rather accurate) bound on Whitney’s ball covering of is of the form
[TABLE]
Compare also with [FY17] where a similar bound for Whitney’s ball covering of the punctured disk was given (uniform in the geometry of the deleted points). Easy examples (for instance, being a hyperplane) show that these bounds are sharp and cannot be improved for Whitney’s balls. The factor in the bound of (1) is too big for the intended applications. However, if we replace the doubling Whitney’s balls with their holomorphic images (as we do in the definition of doubling coverings), we can hope to get a bound of the form
[TABLE]
This kind of bounds were conjectured (in different forms) in [FY17, FY, Y87, Y91, Y08, Y15]. A special case was settled in [FY17], where we confirm the expected bound (with !) in case of regular level hypersurfaces for polynomials with non-degenerated critical points. However, the method of [FY17] cannot be directly extended to the polynomials with non-isolated singularities.
On the other hand, in [FY] we prove the bound of the form (2), (also with !), for the length of the “doubling chains”, joining any two points in the -complement of a zero-level hypersurface of a polynomial. Thus, for the length of the chains and hence, for the Kobayashi distance, the bound (2) was, essentially, confirmed with and with depending only on the degree of .
Let us introduce some notatios. Let be a complex polynomial of degree in written in the usual multi-index notations , , and . We say that is normalized if . We denote by
[TABLE]
the -level hypersurface of .
In this paper we provide asymptotic upper bounds on the complexity in two (closely related) situations, we confirm for the total doubling coverings and not only for the chains the expected bounds of the form (2). This is done in a rather general setting, i.e. for the -complement of a polynomial zero-level hypersurface and for the regular level hypersurfaces themselves with no assumptions on the singularities of . The coefficient in (2) is the ambient dimension in the first case and in the second case. However, the question of a uniform behavior of the coefficient in (2) remains open.
Theorem 1.1** (Complement of zero-level hypersurfaces).**
Let be the zero-level hypersurface of and let , where is a -neighborhood of for . There exists a doubling covering of in so that
[TABLE]
where are constants depending on and .
Theorem 1.2** (Regular level hypersurfaces).**
Let be a regular level hypersurface of and let . Let be the distance of to the set of singular values of . We assume that . There exists a doubling covering of in so that
[TABLE]
where are constants depending on and .
In Section 2 we provide a doubling covering for in the monomial case, and we do so also for . On this base, using resolution of singularities, we prove Theorems 1.1 and 1.2.
In a somewhat different setting and under the name “analytic parametrizations”, doubling coverings were essentially introduced in [Y91] as a tool for handling topological entropy and other similar dynamical invariants, of real analytic mappings. We refer to [FY17, FY, Y91, Y08, Y15] for further developments and for some discussions on the connections with bounding the density of rational points on analytic varieties in diophantine geometry and other applications.
In Section 3 we study this slightly different setting of “analytic parametrizations” using a-charts, recalled in Definition 1.3 and introduced first in [Y91, Definition 2.1] under the name acu’s. We provide analogues of Theorems 1.1 and 1.2 for real semi-algebraic sets and with a-charts.
Let us give our main results. Write for the real interval and for each write for the complex disk . As usual, for a subset , we call a function real analytic if there exists an open neighborhood of and a real analytic function whose restriction to is . We recall Definition 3.1 from [Y08], where they are called analytic -chart in full and a-charts in short.
Definition 1.3** (a-charts).**
A real analytic mapping is called an a-chart if it can be extended to a holomorphic mapping such that moreover lies in for each .
For a set and , by the -neighborhood of we mean the set of points that lie at distance at most to , and we write to denote this tube. Here, the distance between and is defined as the infimum over all of .
The following is a variant in general dimension of Theorem 3.1 of [Y08] and of the complex case of Theorem 1.1 above. Note that it is more uniform than Theorem 1.1.
Theorem 1.4**.**
Let be a semi-algebraic set of dimension . Then, there exist a semi-algebraic subset of dimension and a constant such that the following holds. For each with there are semi-algebraic a-charts
[TABLE]
with
[TABLE]
such that the union of the contains , where is the -neighborhood of . Furthermore, and the complexity of are bounded in terms of the complexity of .
Next comes our analogue for real semi-algebraic sets of any dimension of the complex result of Theorem 1.2 above. Again, it is more uniform than Theorem 1.2, and, more flexible in the dimension of the family parameters.
Theorem 1.5**.**
Let be a semi-algebraic function. Suppose that the nonempty fibers of have dimension . Then, there exist a constant and a subanalytic set of dimension less than such that, for any with and for any of distance at least to there are a-charts
[TABLE]
with
[TABLE]
such that the union of the contains .
The proofs of Theorems 1.4 and 1.5 and the definition of subanalytic sets are given in Section 3, as well as their corresponding generalizations for subanalytic and power-subanalytic sets as Theorems 3.1 and 3.2. It may be interesting to see whether can be taken semi-algebraic as well in Theorem 1.5 (see also the two questions at the very end of the paper).
2. Proof of theorems 1.1 and 1.2
The main idea behind the proofs of these two results, is to make a reduction from the general case of a polynomial of degree in to the monomial case. This is done by applying the following basic version of resolution of singularities (see, e.g. [BM91]).
Theorem 2.1**.**
Let be a polynomial of degree in , and let be its zero-level hypersurface. There exist a regular -dimensional algebraic variety and a proper mapping so that for any point there is a neighborhood of in and a local coordinate system in , in which
[TABLE]
where , , and is a non-vanishing function (clearly, depends on ). In particular, the preimage coincides locally with the union of the coordinate hyperplanes for where is the number of the local coordinates, actually apearing in the monomial .
Accordingly, in order to construct a doubling covering either for , or for (for sufficiently small and ), it is enough to construct such coverings in each of a finite number of the neighborhoods in , covering the compact preimage of
In case of we have also to cover the part of out of the union of , but this is immediate, with the number of charts not depending on .
2.1. Proof of Theorem 1.1
The reduction achieved above allows us to restrict considerations to the following case: in the appropriate system of local coordinates for any we have, as above, . Without lost of generality we may assume that in local coordinates the neighborhood is defined by , , and that there is a constant so that
[TABLE]
We also assume below that . The case is treated exactly in the same way, with better bounds.
The following proposition from [FY] is, essentially, a version of Łojasiewicz inequality. For our applications it is important to keep all the constant explicit and depending only on . Notice however, that it is valid only in complex domain.
Proposition 2.2**.**
Let be a normalized polynomial of degree on and let be its zero-level hypersurface. Then, for any we have
[TABLE]
where are constants depending only on .
Let to be chosen later. For we define the set , in local coordinates , by , and denote by a -neighborhood of the union of the coordinate hyperplanes , defined as the union .
Corollary 2.3**.**
Let , and put . Then,
[TABLE]
where, as above, is a -neighborhood of .
Proof.
By Proposition 2.2 for any we have
[TABLE]
Let and denote by the sublevel set . Then, for any point we have and therefore , i.e. . Thus, . We conclude that the preimage contains the subset of defined by the inequality
[TABLE]
But for any , by definition of and by (3), we have
[TABLE]
and hence . ∎
Therefore, it is sufficient to construct a doubling covering of in , where , as above, is the union of the coordinate hyperplanes for . Indeed, for all the charts of the doubling covering of in , the charts will form a doubling covering of in . Note also that it is enough to consider the case where and is the unit polydisc
[TABLE]
We denote the complement of in by .
Now, we need the following “model” result:
Proposition 2.4**.**
Let and let . There exists a -doubling covering of in with the following properties:
1. Each chart of is an affine mapping of to , extendible, as an affine mapping, to .
2. The complexity does not exceed . In particular, for ,
[TABLE]
Before proving this proposition, let us first conclude the proof of Theorem 1.1. In order to prove the theorem, we chose a certain finite covering of by the neighborhoods , provided by Theorem 2.1. Then, we apply Proposition 2.4 with to each of these neighborhoods separately. However, first we have to normalize to the standard form , used in Proposition 2.4. Next, in each we apply Corollary 2.3, in order to find the appropriate . In these steps the parameter is scaled accordingly. As a result, enters the bound in Theorem 1.1 with a coefficient , depending on the geometry of the resolution of Theorem 2.1, in contrast with Proposition 2.4, where the coefficients are absolute and explicit. The same concerns the coefficient , which is obtained by summing the corresponding coefficients over the neighborhoods . This completes the proof of Theorem 1.1.
First, let us sketch the proof of Proposition 2.4. It is done by induction on the dimension. In dimension the result is a partial case of [FY17, Theorem 2.2] (see also [FY, Example 2]), the required covering of in consists of the “Whitney’s disks”, accumulating to the origin. Assume that the required covering has been constructed in dimension . We produce the required covering in dimension . To achieve this extension we introduce a “suspension” construction, extending an -dimensional chart into an -dimensional one. This name (suspension), in a pretty similar meaning, is traditionally used in algebraic and homotopic topology.
What follows is a definition of a suspension, then we return to the proof of Proposition 2.4 below. We assume that is fixed, and have three free parameters: , with . The parameter defines the “height” of the suspension, while defines its “vertical” (in ) shift. The third parameter controls a “thickening” of the suspensions, which is necessary to “suspend” coverings.
Definition 2.5**.**
Let be a complex -dimensional manifold and let be a -doubling chart. Let , with be given. The -suspension of is an analytic mapping
[TABLE]
defined, for with and , by
[TABLE]
where is the analytic extension of to .
In the following lemma, we summarize some simple properties of the suspension construction.
Lemma 2.6**.**
Let be a complex -dimensional manifold and let be a -doubling chart. Let , with . Then, the -suspension of is a -doubling chart in with .
Moreover, if is a -doubling covering of a compact , then the collection of the suspended charts forms a -doubling covering of , with a disk of radius centered at , and .
Proof.
The suspension of is extendible to the concentric ball by the same expression (4). Indeed, since by assumptions, , for any we have and hence is well defined and belongs to . Hence, is a -doubling chart in .
Now, let be a -doubling covering of a compact . In order to prove that forms a -doubling covering of , consider a point . Since is a covering of , we have , for certain and . Therefore, by (4) we get
[TABLE]
We need to check that . Indeed, and so and thus . Hence, by our choice of , we get
[TABLE]
which completes the proof of Lemma 2.6. ∎
Now, we come to a general statement, concerning the coverings with suspensions. For a given , starting with a -doubling covering of a compact , we want to cover the compact set in .
Proposition 2.7**.**
Let be given, and put . Let be a complex -dimensional manifold and let be a -doubling covering of a compact . Then, for any there exists a -doubling covering of in with
[TABLE]
where .
Proof.
We construct the required covering as the union of the suspensions of over , where are determined below. Thus, is the union of “layers”, each layer being “vertically” (in the direction of the factor in ) shifted and properly rescaled suspension of . The “widths” of decreases exponentially in and thus we need an order of such layers to cover (see e.g. a similar construction in [FY, Example 2]).
More accurately, let us fix , and let
[TABLE]
be a -covering of in , where are the “Whitney disks”, provided by Theorem 2.2 of [FY17].
For denote by and the center and the radius of the disk , respectively, and put .
We claim that the suspensions for all , form the required covering. Indeed, by Lemma 2.6, the collection of the suspended charts forms a -doubling covering of , with . Thus, covers . Since cover , we conclude that covers .
It remains to show that the suspended charts do not touch the zero section . Since the disks form a -covering of in , for any we have (this is the doubling condition).
On the other hand, for any and consider the projection of the image of the suspension in to . By the expression (4) for , this projection is the disk of radius in , centered at . Since and its suspensions are affine mappings, for the -extension the image is the disk of radius
[TABLE]
and hence this disk does not touch . This completes the proof of Proposition 2.7. ∎
Proof of Proposition 2.4.
We have to construct, for , a covering of with the complexity at most . We fix , and proceed by induction on the dimension of : for we show the existence of a -covering of with .
In dimension the result is a partial case of [FY17, Theorem 2.2]: for any the required -covering of in consists of “Whitney’s disks”, accumulating to the origin. To start the induction, we put in this theorem , and get a -covering of in consisting of less than Whitney’s disks.
Assume that the required -covering of has been constructed in dimension with . We produce the required covering of in dimension , using the fact that . We use the suspension construction, as developed above, and apply Proposition 2.7 with , , , , and . Thus, , and we obtain a -covering of in with the complexity not exceeding , where
[TABLE]
since by assumptions . Therefore, we have
[TABLE]
[TABLE]
This completes the induction step. For we get a -covering of with the complexity satisfying
[TABLE]
thus completing the proof of Proposition 2.4. ∎
2.2. Proof of Theorem 1.2
As it was explained above, in order to prove our second main result it is sufficient to construct a required doubling covering “locally”, in each coordinate neighborhood provided by Theorem 2.1. As above, we assume that in local coordinates the neighborhood is defined by , , while the polynomial takes a form
[TABLE]
Let be defined by , , . We will produce, for a regular value , a doubling covering of , with defined in by the equation .
We present the hypersurface as the graph over , for an appropriate . The function is a multivalued (more accurately, -valued) function and we show that all its branches are regular. Finally, we use Proposition 2.4 to construct a doubling covering of and hence, of and extend it to the required covering of , composing the charts in with .
Now, we present the proof in detail.
Lemma 2.8**.**
Let . Let . Then, for any , we have
[TABLE]
In particular, the projection of onto the subspace of the points in is contained in , for .
Proof.
We have
[TABLE]
since, by assumptions, for any we have , and , . Therefore
[TABLE]
∎
Next we use Proposition 2.4 to construct a -doubling covering of . In order to extend to the required covering of , we show, using the implicit function theorem, that the equation (5) of the hypersurface locally defines each branch of as a regular function. Then, we compose the charts in with , in order to get the charts of .
Let us fix , and consider a function of one variable , for .
Lemma 2.9**.**
For we have .
Proof.
We have
[TABLE]
Since by assumptions we have , by Cauchy formula we conclude that . Consequently, for we have
[TABLE]
and hence . ∎
Lemma 2.9, combined with the implicit function theorem, shows that equation of the hypersurface locally defines each branch of as a regular function. Consequently, for any chart , for any and for any choice of the branch at there is a unique analytic continuation of to the entire chart . Indeed, using a local regularity of the chosen branch of , and extending it along the straight segments from to any other point of the ellipsoid , (and, in fact, to ) we obtain the required continuation of to the entire chart and to its -concentric extension. The corresponding chart in is obtained as the composition . The entire collection of the charts in is obtained as we compose all the charts with all the branches of over .
Clearly, the charts in are -doubling charts in . The complexity , i.e. the number of the charts, is equal to . Now, choosing the neighborhoods as in the proof of Theorem 1.1, and applying the arguments above, as well as Proposition 2.4, to each , we obtain the required complexity bound. This completes the proof of Theorem 1.2.
3. Analytic parameterizations of real semi-algebraic, subanalytic, and power-subanalytic sets
In this section we treat analogues of Theorems 1.1 and 1.2 for real semi-algebraic, subanalytic, and power-subanalytic sets (see Theorems 1.4, 1.5, 3.1 and 3.2). These notions of sets generalize the ones of globally subanalytic sets and of real semi-algebraic sets and are recalled below. The main idea behind the proofs of these two theorems is similar to the complex reduction from the previous section to the monomial case, this time not exactly by resolving the singularities, but, by using a pre-parameterization result from [CPW], based on preparation of power-subanalytic functions from [M06], and a rectilinear variant of preparation for subanalytic functions from [CM13]. All these mentioned results are incarnations on the reals of results related to both Weierstrass preparation and resolution of singularities. In fact, we give a refined pre-parameterization which combines the mentioned results from [CPW] and [CM13], see Theorem 3.9.
3.1. Analytic parameterizations
We define the following generalization of real semi-algebraic sets and functions, as an example to which the results in this section apply. Call a set power-semi-algebraic if it is given by a finite Boolean combination of conditions on of the form
[TABLE]
for some polynomials with coefficients in , some integer , and some positive real numbers for some with . Call a function power-semi-algebraic if , , and the graph of are power-semi-algebraic sets. By the complexity of such a Boolean combination, we mean the tuple consisting of the number of involved polynomials and for each involved polynomial the total degree, the number of variables of the polynomial (namely for as above), and the real numbers . If no real exponents occur, (namely in the occurring polynomials as above), then one says semi-algebraic instead of power-semi-algebraic.
As a second and richer setting, let us define power-subanalytic sets, as generalization of globally subanalytic subsets of . Call a function a restricted analytic map if its restriction to is analytic (in the above sense), and, the restriction of to the complement of in is identically zero. (Note that no continuity of is required on the boundary of .) Call a function a power-basic function if it is a composition for some , where each is either a power-semi-algebraic map or a restricted analytic map. Call a set power-subanalytic if it is given by a finite Boolean combination of conditions on of the form
[TABLE]
for some power-basic functions . Call a function power-subanalytic if , , and the graph of are power-subanalytic sets. (Sometimes one says -definable or -definable instead of power-subanalytic.) When moreover the involved power-semi-algebraic maps are semi-algebraic, then one calls the sets and functions globally subanalytic (or, in short, subanalytic). By D. Miller’s work [M06], the power-subanalytic sets form an o-minimal structure, the subject of [vdD98]. By the dimension of a (nonempty) power-subanalytic set , we mean the maximum integer taken over all linear maps such that has nonempty topological interior (this has good properties coming from o-minimality, see e.g. [vdD98]).
We now come to our two main results on parameterizations of power-subanalytic sets, resp. of subanalytic sets.
Theorem 3.1**.**
Let and be positive integers. Let and be power-subanalytic sets such that for each , the fiber has dimension . Then, there exist a power-subanalytic set such that each fiber has dimension and a constant depending only on such that the following holds. For each with there are power-subanalytic functions
[TABLE]
with
[TABLE]
such that, for each , the maps
[TABLE]
are a-charts and
[TABLE]
where is the -neighborhood of in .
Theorem 3.2**.**
Let be positive integers. Let and be subanalytic sets such that, for each , the fiber has dimension . Then, there exist a constant and a subanalytic set of dimension less than the dimension of such that the following holds for each with . There are subanalytic functions
[TABLE]
with
[TABLE]
such that for any the functions
[TABLE]
are a-charts and
[TABLE]
where the -neighborhood of .
In Theorem 3.1, small tubes are removed of the sets which are to be parameterized, where as in Theorem 3.2, a small tube is removed from the parameter space, thus leaving out a small portion of the family members. We leave to the reader to formulate the special case of Theorem 3.2 with level sets, similar as in Theorem 1.2.
For the proofs of Theorems 3.1 and 3.2 we will use freely basic properties of a-charts given in [Y91] (for acu’s). Note that Theorem 1.4 is a special case of Theorem 3.1. We give a slight refinement of Theorem 3.2 at the end of the paper, in Section 3.4, from which Theorem 1.5 follows as a special case.
3.2. Pre-parameterization and the proof of Theorem 3.1
We recall the notions of bounded-monomial functions and of a-b-m functions from [CPW] as the following Definitions 3.3 and 3.4.
Definition 3.3** (bounded-monomial functions).**
Let be a subset of . A function with bounded range is called bounded-monomial if either is identically zero, or, is of the form
[TABLE]
for some in and . We say that only integer exponents appear in the bounded-monomial function if moreover (including the case that is identically zero). A map is called bounded-monomial if all of its component functions are, and similarly for the appearance of only integer exponents.
Definition 3.4** (a-b-m functions).**
Let be a subset of . A function is called a-b-m, in full analytic-bounded-monomial, if it is of the form
[TABLE]
for some bounded-monomial map for some and for some nonvanishing analytic function , where is an open neighborhood of , the topological closure of in , and where lies in . We call the map an associated bounded-monomial map of .
Finally, call a map a-b-m, with associated bounded-monomial map , if all its component functions are (namely, each is a-b-m, and, is an associated bounded-monomial map for each ).
The a-b-m functions with an associated bounded-monomial map such that moreover has bounded -norm have particularly nice properties as illustrated by their use in [CPW] and in the proofs of Theorems 3.1 and 3.2.
Definition 3.5** (Cells and their walls).**
A power-subanalytic subset is called a cell, if
[TABLE]
for some continuous power-subanalytic functions and with , , and with either , , or no condition, and with either or no condition, with the conventions that is no condition if is equality. If is or then we call a wall of . Likewise, if is then we also call a wall of .
We can now recall the pre-parameterization result from [CPW] that we use to prove Theorems 3.1 and 3.2. The boundedness of the -norms in item (4) is a key property (without this boundedness, the result would be much more easy to prove). Note that the triangularity property from (3) allows one to use the result uniformly in family settings, and this is indeed exploited in this way below as well as in [CPW].
Theorem 3.6** (Pre-parameterization, [CPW]).**
Let be power-subanalytic, and suppose that is the graph of a power-subanalytic function for some and open set . Then, there exist finitely many power-subanalytic maps
[TABLE]
such that the following hold
- (1)
. 2. (2)
Each is an open cell in . 3. (3)
Each is a triangular map, in the sense that for each there is a unique map making a commutative diagram with and the projection maps and , with in both cases the projection to the first coordinates. 4. (4)
For each , the map and the walls of are a-b-m with an associated bounded-monomial map such that has bounded -norm.
We can now give the proof of Theorem 3.1.
Proof of Theorem 3.1.
By transforming if necessary and by working piecewise on , we may suppose that for some , that is open, and that equals the graph of a power-subanalytic function for some open (indeed, these are typical manipulations involving basic finiteness properties of o-minimality, see [vdD98]). Apply the pre-parameterization result Theorem 3.6 to . Up to another transformation of and working piecewise on , we reduce to the case that we have finitely many power-subanalytic maps
[TABLE]
such that is definable and open, and such that and the walls of are a-b-m maps with associated bounded monomial map with bounded -norm. Clearly, by their special nature, the have a unique continuous extention to the topological closure of in . This extension is power-subanalytic, since clearly definable. Let be the union over of the sets , namely the images of the boundaries. Then, has dimension less than (see the dimension theory for o-minimal structures explained in [vdD98]). Also, by the special form of the maps , there is a constant such that for each and each , the map is Lipschitz-continuous with Lipschitz constant , where the metric is the supremum norm. Now, fix . For each , write
[TABLE]
with
[TABLE]
Further, write
[TABLE]
for the restriction of to
[TABLE]
Then, by the mentioned Lipschitz continuity with Lipschitz constant , the union over of the images of the contains . We claim that there is a constant such that for each and each , the graph of can be covered by no more than a-charts. This can be seen as follows. Since is bounded-monomial and by Lemma 3.7, for each there is such that for each , the graph of
[TABLE]
can be covered by no more than a-charts. Now, the claim and the theorem follow from properties for covering compositions by a-charts from [Y91, Y08]. ∎
The following lemma treats the case of monomial functions with real exponents and bounded range.
Lemma 3.7**.**
Given , there exists such that the following holds. Let be open and let be a map of the form
[TABLE]
for some real and some . For each with let be the restriction of to . Then, there are many a-charts with and such that the graph of is contained in the union of the sets .
Proof of Lemma 3.7.
For any , let be the set of such that with the set of positive real numbers, and let be the map on . Write and let be the map on . We will in fact prove slightly more than the lemma: we will cover the graph of by a-charts going into the graph of with and and with for depending only on . For any , let be the open interval in . Choose any . Then, by construction, the set
[TABLE]
is contained in . Moreover, and hence also can clearly be covered by many sets of the form with in , with a constant depending only on . Finally, we show for any that the graph of the map
[TABLE]
can be covered by no more than a-charts, with a constant depending only on . But this can be seen by composing with the map
[TABLE]
for some sufficiently large depending only on , and by taking the Taylor series around [math] of the composition. Indeed, the estimates on the Taylor coefficients are easy to obtain. ∎
Note that is a bounded-monomial function with and as in Lemma 3.7, but, when , then itself is not bounded-monomial.
3.3. Rectilinear pre-parameterization and the proof of Theorem 3.2
In the subanalytic case, we can give a refinement of the pre-parameterization result of [CPW], by combining with the notion and results about rectilinear cells of Theorem 1.5 of [CM13]. This will be used to prove Theorem 3.2. We leave the discovery of a variant of Theorem 3.9 for power-subanalytic sets to the future.
Definition 3.8** (Rectilinear cells).**
Let and be positive integers with . An open cell is called -rectilinear if it is of the form , where is an open cell satisfying , where is the topological closure of in .
The refinement given by the following variant of Theorem 3.6 lies in the property that the cells are rectilinear in (2), and, the appearance of only integer exponents in (4).
Theorem 3.9** (Rectilinear pre-parameterization).**
Let and be subanalytic, and suppose that is the graph of a subanalytic function for some and some subanalytic such that is nonempty and open in for each . Then, there exist finitely many subanalytic maps
[TABLE]
for some subanalytic sets and integers such that the following hold
- (1)
. 2. (2)
Each is an open cell in , and, for each , the set (when nonempty) is an -rectilinear open cell in . 3. (3)
Each is a triangular map, in the sense that for each there is a unique map making a commutative diagram with and the projection maps and , with in both cases the projection to the first coordinates. 4. (4)
For each , the map and the walls of are a-b-m with an associated bounded-monomial map such that has bounded -norm and such that only integer exponents appear in .
The proof is similar to the proof of the Pre-parameterization result of [CPW] where moreover Theorem 1.5 of [CM13] is used to make the initial situation already rectilinear.
Proof of Theorem 3.9.
By Theorem 1.5 of [CM13] we may suppose that is the graph of a subanalytic function such that is an open cell in and such that moreover is -rectilinear for each and some independent from . Moreover, by the same theorem of [CM13], we may suppose that and all the walls of are a-b-m with associated bounded-monomial map with only integer exponents.
We now show by induction on that from this situation on, up to some parts with a lower value for (which can be treated by induction on ), we can partition into finitely many parts each of which can be reparamaterized by maps as in the theorem with moreover . Suppose . The map is , since it is bounded-monomial. By a classical technique (with inverse functions) we will reduce to the case that furthermore is at most for each component function of . First note that if is of the form for some (that is, we are in the case that ), then is already bounded for each component function of since is bounded-monomial with only integer exponents. (Indeed, the boundedness of forces the exponents of to be nonnegative integers.) In the other case that , we proceed as follows. Up to partitioning into finitely many definable pieces and neglecting pieces where is of lower dimension by induction on , we may suppose that there is such that is maximal on , in the sense that
[TABLE]
on for any . This partitioning based on conditions of the form (6) preserves the -rectilinear form, as well as the fact that the walls are a-b-m, even with the very same bounded-monomial map with only integer exponents. Similarly, for this we may furthermore suppose that either on , or, that on . In the first case, we have what we want at this point. In the second case, we note that the function sending to is injective, for each choice of , since is bounded-monomial. Up to replacing by the graph of the function sending to , where is in and is sufficiently large, we may thus suppose (by the chain rule) that we are in the first case, namely, that on . Note that this change of variables preserves . We have thus reduced to the case that furthermore is at most for each component function of .
We still need to show that we can ensure that the -norm of is bounded. Since is a bounded-monomial map, there is such that
[TABLE]
for each component function of and some . For each wall of bounding , and with being either or , let be the map
[TABLE]
where is the image of under the coordinate projection sending to . This limit always exists by the definition of bounded-monomial maps, and, moreover, is a bounded-monomial map itself. Let be the collection of functions on consisting of the component functions of the maps from (7) and the walls of bounding . Consider the map whose component functions are the maps for those in which are not identically zero. Apply the induction hypothesis, for instead of and with instead of , to the graph of instead of the graph of , to find a finite collection of maps satisfying properties (1), (2), (3), and (4), with in the role of , with for each , with associated bounded-monomial maps , and with of dimension smaller than for each . Using these newly obtained maps we easily get finitely many maps with properties (1), (2), (3), and (4) for where for each and for some where has dimension less than for each . Indeed, let be the cell
[TABLE]
and let be the map
[TABLE]
By the above application of the induction hypothesis the function
[TABLE]
on is a-b-m with an associated bounded-monomial map with bounded -norm and with only integer exponents. Let be the map . Then, the maps satisfy (1), (2), (3) and (4) with associated bounded-monomial maps . This finishes the proof of Theorem 3.9. ∎
We can now give the proof of Theorem 3.2.
Proof of Theorem 3.2.
The theorem follows almost directly from the rectilinear pre-parameterization result 3.9. Indeed, by Theorem 3.9 we can reduce to the situation that is an open cell such that is -rectilinear for each and such that all walls of are a-b-m with an associated bounded-monomial map with only integer exponents such that moreover has bounded -norm. This reduction involves working piecewise, and, a subanalytic Lipschitz-continuous transformation of which is harmless because of the Lipschitz continuity (recall how Lipschitz continuity is used in the proof of Theorem 3.1). Now, let be , where is the topological closure of in . Choose . If lies in , then one has by the the rectilinear form and since the walls are a-b-m that
[TABLE]
for each and some and which are independent of . Note also that the exponents of in must be nonnegative integers for any by the rectilinear form and the fact that has bounded range. Now, we are done by a variant of Lemma 3.7 which takes the rectilinear form and the special nature (as integers, some known to be non-negative) of the exponents into account. ∎
3.4.
We end with a further refinement, using a more flexible notion of sets in of [M06] than the one of power-subanalytic sets, which we now recall.
Let be a Weierstrass system and let be the corresponding language as in [M06, Definition 2.1]. By the field of exponents of is meant the set of real such that is -definable; this set is moreover a field by Remark 2.3.5 of [M06]. Let be a subfield of the field of exponents of . We denote by the expansion of by the functions
[TABLE]
for each .
Now, we can refine the above theorem 3.1 as follows. If the initial data of and of Theorem 3.1 are moreover -definable, then and the maps can be chosen to be -definable as well. Theorem 1.4 thus follows by using and the minimal choice of , see [M06]. A similar refinement of Theorem 3.2 (giving -definability of and the ) would also follow from the corresponding adaptation of Theorem 1.5 of [CM13], which we leave for the future. One may also expect that if the are topologically closed, the a-charts from Theorems 1.4, 1.5, 3.1 and 3.2 can be taken with ranges contained in .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1]
- 2[3]
- 3[5]
- 4[7]
- 5[9]
- 6[11]
- 7[13]
- 8[15]
