Smooth parameterizations of power-subanalytic sets and compositions of Gevrey functions

TL;DR

The paper establishes a uniform $C^r$-parameterization for definable sets in a power-analytic structure, with bounds depending polynomially on r, and these maps are real analytic.

Contribution

It provides explicit bounds on the number of real analytic maps needed for $C^r$-parameterizations of definable sets in power-analytic structures.

Findings

Existence of $C^r$-parameterizations with $cr^{m^3}$ maps

Maps are real analytic and uniform across definable families

Bounds are explicit and polynomial in r

Abstract

We show that if $X$ is an $m$-dimensional definable set in $\mathbb{R}^\text{pow}_\text{an}$, the structure of real subanalytic sets with real power maps added, then for any positive integer r there exists a $C^r$-parameterization of X consisting of $cr^{m^3}$ maps for some constant $c$. Moreover, these maps are real analytic and this bound is uniform for a definable family.

Equations

$$\{f_i:(0,1{)}^m\to X\mid i\in \{1,\dots ,N\}\}$$

$$|\nu |$$

$$\nu !$$

$$x^{\nu }$$

$$f^{(\nu )}$$

$$|f{|}_r=\underset{x\in U}{\sup }\underset{\begin{array}{c}|\nu |\le r\\ \nu \in N^d\end{array}}{\sup }\frac{|f^{(\nu )}(x)|}{|\nu |!}.$$

$$\left|f^{(\nu )}(x)\right|\le B^{C+1}{A}^{|\nu |}|\nu |{!}^{C+1}.$$

$$\nu !$$

$$|\nu |!$$

$$\left|f^{(\nu )}(x)\right|\le B^{C+1}{A}^{|\nu |}|\nu |{!}^{C+1}.$$

$$\psi :(x_1,\dots ,x_d)\mapsto \left(\frac{x_1}{A{r}^C}+P_1,\dots ,\frac{x_d}{A{r}^C}+P_d\right).$$

$$\underset{x\in U}{\sup }\underset{\begin{array}{c}|\nu |\le r\\ \nu \in N^d\end{array}}{\sup }|f^{(\nu )}(x)|.$$

$$(f\circ g{)}^{(\nu )}(x)=\sum _{1\le |\lambda |\le n}{f}^{(\lambda )}(g(x))\sum _{s=1}^n\sum _{p_s(\nu ,\lambda )}\nu !\prod _{j=1}^s\frac{(g^{(l_j)}(x){)}^{k_j}}{k_j!(l_j!{)}^{|k_j|}}$$

$$\sum _{i=1}^s{k}_i=\lambda$$

$$\sum _{i=1}^s|k_i|l_i=\nu .$$

$$\left|f^{(\nu )}(x)\right|\le {\left(M\frac{|\nu |!}{R^{|\nu |}}\right)}^{\alpha }$$

$$\left|f^{(\nu )}(x)\right|\le {\left(M_f\frac{|\nu |!}{R_f^{|\nu |}}\right)}^{\alpha }$$

$$\left|g_i^{(\nu )}(x)\right|\le {\left(M_g\frac{|\nu |!}{R_g^{|\nu |}}\right)}^{\alpha }$$

$$F=\frac{M_f{R}_f}{(R_f+d{M}_g)-(x_1+\dots +x_d)}$$

$$G_i=\frac{M_g{R}_g}{R_g-(x_1+\dots +x_e)}.$$

$$G_i^{(\lambda )}(x)=(M_g{R}_g)|\lambda |!(R_g-S(x){)}^{-(1+|\lambda |)}.$$

$$G_i^{(\lambda )}(0)=M_g\frac{|\lambda |!}{R_g^{|\lambda |}}.$$

$$F^{(\lambda )}(G(0))=M_f\frac{|\lambda |!}{R_f^{|\lambda |}}.$$

$$(F\circ G)(x)=\frac{M_f{R}_f(R_g-S(x))}{R_f{R}_g-(R_f+d{M}_g)S(x)}$$

$$(F\circ G{)}^{(\lambda )}(x)=\frac{d{M}_f{M}_g{R}_f{R}_g}{R_f+d{M}_g}\frac{(R_f+d{M}_g{)}^{|\lambda |}|\lambda |!}{(R_f{R}_g-(R_f+d{M}_g)S(x){)}^{|\lambda |+1}}.$$

$$(F\circ G{)}^{(\lambda )}(0)=M\frac{|\lambda |!}{R^{|\lambda |}}$$

$$M\frac{|\nu |!}{R^{|\nu |}}=(F\circ G{)}^{(\nu )}(0)=\sum _{1\le |\lambda |\le n}{M}_f\frac{|\lambda |!}{R_f^{|\lambda |}}\sum _{s=1}^n\sum _{p_s(\nu ,\lambda )}\nu !\prod _{j=1}^s\frac{{\left(M_g\frac{|l_j|!}{R_g^{|l_j|}}\right)}^{|k_j|}}{k_j!(l_j!{)}^{|k_j|}}.$$

$$A$$

$$B$$

$$A=A_g(d{A}_f+1).$$

$$\left|f^{(\nu )}(x)\right|\le \frac{B^{C+1}{A}^{|\nu |}|\nu |{!}^{C+1}}{x^{\nu }}.$$

$$(x_1,\dots ,x_d)\mapsto (x_1^{n_1},\dots ,x_d^{n_d})$$

$${\left(\frac{\partial }{\partial x_i}\right)}^k{\varphi }_i(x)=n_i\cdots (n_i-(k+1))x_i^{n_i-k}\le N^k{x}_i^{n_i-k}\le N^k.$$

Full text

The author is partially supported by KU Leuven grant IF C14/17/083.

1. Introduction

A parameterization of a set $X\subset\operatorname{\mathbb{R}}^{n}$ of dimension $m$ is a finite set of maps

[TABLE]

for some $N\in\operatorname{\mathbb{N}}$, such that the images of these maps cover $X$. Consider the following question: given any positive integer $r$, can one construct a parameterization of $X$ consisting of $r$ times continuously differentiable maps whose $C^{r}$-norm is bounded by $1$, i.e. a $C^{r}$-parameterization?

The interest in this question first arose in 1987 in the study of entropy of dynamical systems in [17] and [19]. In these papers, Yomdin sketched a $C^{r}$-parameterization result for semi-algebraic sets. A more refined explanation was given by Gromov in [7], a complete proof by Burguet in [3]. In their result the number of maps of the parameterization is shown to depend on combinatorial data defining $X$, i.e. $n$, $m$, $r$ and the complexity $\beta$, which is the maximum degree of the equations and inequalities necessary to define $X$. However, there is no explicit formula for the number of maps. Yomdin has written a nice survey on the study of parameterizations in [18].

Using o-minimality, a tool of model theory, Pila and Wilkie showed in 2006 that any bounded definable set in any o-minimal structure (containing the semi-algebraic sets) has a $C^{r}$-parameterization [13]. However, in the special case that $X$ is semi-algebraic, they did not deduce a formula for the number of maps of the parametrization in terms of the complexity of $X$. The main result of [13] bounds the number of rational points on a definable set $X$ up to a certain height, known as the counting theorem. To obtain this result, they constructed $C^{r}$-parameterizations for arbitrarily large $r$ and therefore it is interesting to know how large the parameterization becomes depending on $r$.

The dependence on $r$ has recently been investigated in [1] by Binyamini and Novikov, who construct a $C^{r}$-parameterization consisting of $cr^{m}$ maps for subanalytic sets. Here, $c$ is a constant that depends on $X$. Moreover, they show that $c$ depends polynomially on the complexity of $X$, if $X$ is semi-algebraic. Around the same time, Cluckers, Pila and Wilkie proved in [4] a $C^{r}$-parameterization result for power-subanalytic sets using $cr^{d}$ maps, where $c$ and $d$ are constants depending on $X$, and this result is uniform.

In this paper, we built on the methods of [4] to further refine their result in Theorem (3.7). It is weaker than the result of [1] for subanalytic sets, but holds for the larger class of power-subanalytic sets.

Theorem**.**

If $X\subset[-1,1]^{n}$ is power-subanalytic of dimension $m\leq n$, then for any positive integer $r$ there exists a $C^{r}$-parameterization of $X$ consisting of $cr^{m^{3}}$ maps whose $C^{r}$-norm is bounded by $1$. Moreover, if $X$ belongs a power-subanalytic family of such sets, the constant $c$ holds for all members of the family.

The theorem above and the results of [4] actually hold for structures $\operatorname{\mathbb{R}}^{K}_{\mathcal{F}}$, which were studied by Miller in [10]. These structures expand the semi-algebraic sets with restricted analytic functions in a Weierstrass system $\mathcal{F}$ and power maps $x\mapsto x^{\mu}$ for any $\mu\in K$, where $K$ is a subfield of the field of exponents of $\mathcal{F}$ (see the introduction of Section 3 for precise definitions). The structures $\operatorname{\mathbb{R}}$, $\operatorname{\mathbb{R}}_{\text{an}}$ and $\operatorname{\mathbb{R}}^{\text{pow}}_{\text{an}}$, corresponding to the semi-algebraic, subanalytic and power-subanalytic sets respectively, are all examples of this class of structures. The main result of [10], is a preparation theorem for functions definable in these structures, which is one of the main ingredients for the proof of the main result.

In 2011, Jones, Miller and Thomas have shown in [8] that any set definable in (any reduct of) $\mathbb{R}_{\text{an}}$ expanding the real field has an $(A,0)$-mild parameterization for some $A>0$, i.e. a parameterization consisting of maps that are $(A,0)$-mild. The precise definition of a mild function is given in Section 2. Informally, for $C\geq 0$, an $(A,C)$-mild function is a smooth function with good bounds on the derivatives depending on $A$ and $C$. For any integer $r>0$, these bounds allow us to bound the $C^{r}$-norm by $1$ after a suitable substitution. Since we only control the derivatives up to order $r$, their result is stronger. However, by an elementary example of Yomdin [16, Proposition 3.3], their result cannot be made uniform. Indeed, the family of hyperbolas $\{xy=t^{2}\mid(x,y)\in(0,1)^{2},t\in(0,1)\}$ does not have a uniform $(A,0)$-mild parameterization, i.e. the number of charts will depend on the parameter $t$. Recently it has been shown in [15] that it has a uniform $(A,C)$-mild parameterization for all $C>0$.

The paper is organized as follows. In Section 2, we prove various properties of mild functions using only standard techniques of real analysis. A key result on the composition of these functions, Theorem (2.5), permits us to make all of the results of [4] on mild functions explicit and thus also the constant $d$. This key result is in fact an old result on Gevrey functions [6]. We will give the original proof of this result, but in full generality, and reformulate it in terms of mild functions. In Section 3 we provide the necessary background in model theory to state the main theorem and we prove the main theorem. Finally we explain that when $m\geq 2$, we can in fact obtain a parameterization consisting of $cr^{m^{2}(m-1)}$ maps.

2. Mild functions

Mild functions are a class of $C^{\infty}$-maps introduced by Pila in [11]. The upper bounds on the derivatives of a mild function are very suitable to use the determinant method. This method, which Pila developed with Bombieri [2], a useful tool in diophantine geometry. For example, the determinant method is used in the proof of the counting theorem in [13].

Cluckers, Pila and Wilkie introduced several variants to mild functions in [4]. Since in their result (and our main theorem), they only cared about derivatives up to order $r$, they defined functions that are mild up to order $r$. These functions are $C^{r}$-maps that satisfy the same bounds on the derivatives as mild functions, but up to order $r$. In fact, the maps are actually smooth in their work.

Since we will encounter many compositions of mild maps, we need a result on compositions of these maps. This result on compositions will allow us to find the number of charts in Section 3. One can think of mild functions as functions of some class indexed by a real number $C\geq 0$. When $C=0$, these maps are real analytic, when $C=+\infty$, they are real smooth. Using the theory of Gevrey functions [6], we show that compositions of mild functions of class $C$ are again of class $C$.

We start with some definitions of multidimensional calculus. Throughout this section we will work with maps $f=(f_{1},\ldots,f_{n}):U\subset\operatorname{\mathbb{R}}^{d}\to\operatorname{\mathbb{R}}^{n}$, where $U$ is always assumed to be open in $\operatorname{\mathbb{R}}^{d}$. We say that $f:U\subset\operatorname{\mathbb{R}}^{d}\to\operatorname{\mathbb{R}}$ is $C^{r}$ for a natural number $r$ (or $+\infty$) if $f$ is $r$ times continuously differentiable on $U$ and $f=(f_{1},\ldots,f_{n}):U\subset\operatorname{\mathbb{R}}^{d}\to\operatorname{\mathbb{R}}^{n}$ is $C^{r}$ if $f_{1},\ldots,f_{n}$ are all $C^{r}$. For any $i\in\{1,\ldots,d\}$, denote $(\partial f/\partial x_{i})=(\partial f_{1}/\partial x_{i},\ldots,\partial f_{n}/\partial x_{i})$. For any multi-index $\nu=(\nu_{1},\ldots,\nu_{d})\in\operatorname{\mathbb{N}}^{d}$, map $f:U\to\operatorname{\mathbb{R}}^{n}$ and $x=(x_{1},\ldots,x_{d})\in U$ we set:

[TABLE]

where by definition $0!=1$, and $0^{0}=1$.

Definition 2.1** ($C^{r}$-norm).**

Suppose that $f:U\subset\operatorname{\mathbb{R}}^{d}\to\operatorname{\mathbb{R}}$ is $C^{r}$. Then we define the $C^{r}$-norm $|\cdot|_{r}$ of $f$ as follows:

[TABLE]

Note that $|f|_{r}$ can be $+\infty$. We define the $C^{r}$-norm of a map $f:U\subset\operatorname{\mathbb{R}}^{d}\to\operatorname{\mathbb{R}}^{n}$ to be the maximum of the $C^{r}$-norms of the component functions $f_{1},\ldots,f_{n}$.

This is the norm used in [1]. In [4] they did not divide by $|\nu|!$. This yields equivalent norms but has an impact on the exponent of $r$ in the main theorem (see Lemma (2.1)).

Definition 2.2** (Mild functions).**

Suppose that $A,B>0$, $C\geq 0$ are real numbers and $f:U\subset\operatorname{\mathbb{R}}^{d}\to\operatorname{\mathbb{R}}$. Then $f$ is called $(A,B,C)$-mild if it is $C^{\infty}$ and if for all $\nu\in\operatorname{\mathbb{N}}^{d}$ and $x\in U$:

[TABLE]

A map $f:U\subset\operatorname{\mathbb{R}}^{d}\to\operatorname{\mathbb{R}}^{n}$ is $(A,B,C)$-mild if all component functions $f_{1},\ldots,f_{n}$ are $(A,B,C)$-mild. If $B\leq 1$, we simply say that $f$ is $(A,C)$-mild and if we say that $f$ is mild, then we mean that $f$ is $(A,C)$-mild for some $A>0$ and $C\geq 0$.

This definition is slightly different than the original one by Pila in [11] ([12] for the multivariate case), where the bounds on the derivatives for an $(A,C)$-mild function are given by $\nu!(A|\nu|^{C})^{|\nu|}$. Now, due to the following inequalities:

[TABLE]

(where the number $e$ appears as a result of Stirling’s formula), one sees that the definitions of $(A,C)$-mild coincide in the following way: $f$ is $(A_{1},C)$-mild for some $A_{1}>0$ as in our definition if and only if $f$ is $(A_{2},C)$-mild for some $A_{2}>0$ as in [12]. The reason to adjust the definition is to keep the proof of Theorem (2.5) as simple as possible.

Following [4], we will use ‘up to order $r$’ versions of many definitions and theorems, for example the following definition.

Definition 2.3** (Mild up to order $r$).**

Suppose that $A,B>0$, $C\geq 0$ are real numbers, $r>0$ an integer or $+\infty$ and $f:U\subset\operatorname{\mathbb{R}}^{d}\to\operatorname{\mathbb{R}}$. Then $f$ is called $(A,B,C)$-mild up to order $r$ if it is $C^{r}$ and if for all $\nu\in\operatorname{\mathbb{N}}^{d}$ with $|\nu|\leq r$ and $x\in U$:

[TABLE]

A map $f:U\subset\operatorname{\mathbb{R}}^{d}\to\operatorname{\mathbb{R}}^{n}$ is $(A,B,C)$-mild up to order $r$ if all component functions $f_{1},\ldots,f_{n}$ are $(A,B,C)$-mild up to order $r$. If $B\leq 1$, we simply say that $f$ is $(A,C)$-mild up to order $r$ and if we say that $f$ is mild up to order $r$, then we mean that $f$ is $(A,C)$-mild up to order $r$ for some $A>0$ and $C\geq 0$.

Note $(A,B,C)$-mild up to order $+\infty$ agrees with $(A,B,C)$-mild. The following corollary is an immediate consequence of the definitions.

Corollary 2.0.1**.**

Suppose $f:U\subset\operatorname{\mathbb{R}}^{d}\to\operatorname{\mathbb{R}}^{n}$ is $C^{r}$. Then $f$ has $C^{r}$-norm less than or equal to $B$ if and only if $f$ is (1,B,0)-mild up to order $r$.

For $(A,C)$-mild functions up to order $r$, one can bound the $C^{r}$-norm by $1$ with an easy substitution. It will be used to count the numbers of maps in the proof of the main theorem. More precisely, we will construct a parameterization consisting of $(A,0)$-mild maps up to order $r$.

Lemma 2.1**.**

Suppose that $f:U\subset(0,1)^{d}\to[-1,1]$ is $(A,C)$-mild up to order $r$. Let $P=(P_{1},\ldots,P_{d})$ be any point in $(0,1)^{d}$ and consider the map

[TABLE]

If $V=\psi^{-1}(U)$ then $(f\circ\psi):V\to[-1,1]$ has $C^{r}$-norm bounded by $1$.

Proof.

This is a direct calculation using the chain rule. ∎

This lemma is nearly identical to [4, Lemma 4.1.3]. The difference is the exponent of $r$, which is $C+1$ in [4], because they use the following norm:

[TABLE]

Since this norm is stronger, the number of maps in the $C^{r}$-parameterization is larger.

We conclude this section with the following class of examples which will show up in Section 3. For a proof we refer to [9, Proposition 2.2.10].

Lemma 2.2**.**

Suppose that $f:U\subset\operatorname{\mathbb{R}}^{d}\to\operatorname{\mathbb{R}}$ is analytic on an open neighborhood of the topological closure $\overline{U}$ of $U$. Then $f$ is (A,B,0)-mild for some $A,B>0$.

2.1. Compositions of mild functions

In this section we show that if $f$ and $g$ are $(A_{f},B_{f},C)$- and $(A_{g},B_{g},C)$-mild respectively, then the composition $f\circ g$ is $(A,B,C)$-mild for some explicit $A$ and $B$. Of course, we will need a multivariate version of a formula for arbitrary derivatives of a composite function. This is known as the Faà di Bruno formula, which has first been proved in [5] and we reformulate it here. A proof can also be found in [9, Theorem 1.3.2].

Theorem 2.3**.**

Suppose that $n$ is a positive integer, $V\subset\operatorname{\mathbb{R}}^{d}$ and $U\subset\operatorname{\mathbb{R}}^{e}$ are open, $f:V\to\operatorname{\mathbb{R}}$, $g:U\to V$ and that $f$ and $g$ are $C^{n}$. For any $x\in U$ and $\nu\in\operatorname{\mathbb{N}}^{e}$ with $|\nu|=n$ we have that

[TABLE]

where $p_{s}(\nu,\lambda)$ is the set consisting of all $k_{1},\ldots,k_{s}\in\operatorname{\mathbb{N}}^{d}$ with $|k_{i}|>0$ and $l_{1},\ldots,l_{s}\in\operatorname{\mathbb{N}}^{e}$ with $0\prec l_{1}\prec\ldots\prec l_{s}$ such that:

[TABLE]

and

[TABLE]

Here $l_{i}\prec l_{i+1}$ means that $|l_{i}|<|l_{i+1}|$ or, if $|l_{i}|=|l_{i+1}|$, then $l_{i}$ comes lexicographically before $l_{i+1}$.

This formula is the heart of all of the proofs of results on compositions of mild functions that will follow. In [4], Cluckers, Pila and Wilkie use this formula to deduce that the composition of mild functions is mild. However, they show this by roughly estimating the sum and hence they obtain no explicit formulas for $A,B$ and $C$. In his paper [6], Gevrey introduces ‘functions of class $\alpha$’ (see below), later known as Gevrey functions, and showed that the functions of class $\alpha$ with $\alpha\geq 1$ are closed under composition. In fact, Gevrey proved his result only where one of the functions involved has only one variable. The proof uses the Faà di Bruno formula in an essential way. Even though we refer to a more recent paper for the proof of this formula, the formula was already known for a long time. Because the result on Gevrey functions will immediately yield our result on mild functions and the technique is important for all other proofs, we will give a full proof of Gevrey’s theorem for functions in arbitrary many variables, that is, the general version of what he proved.

Definition 2.4** (Gevrey functions).**

Suppose that $\alpha\geq 0$ and $f:U\subset\operatorname{\mathbb{R}}^{d}\to\operatorname{\mathbb{R}}$. We say that $f$ is a Gevrey function of class $\alpha$ if it is $C^{\infty}$ and for all $\nu\in\operatorname{\mathbb{N}}^{d}$ and $x\in U$ we have:

[TABLE]

for some $M,R>0$. A map $f:U\subset\operatorname{\mathbb{R}}^{d}\to\operatorname{\mathbb{R}}^{n}$ is a Gevrey function of class $\alpha$ if all of its component functions are Gevrey functions of class $\alpha$.

The following proposition, together with Theorem (2.5), motivates why we adjusted the definition of a mild function, as we explained below Definition (2.2).

Proposition 2.4**.**

Suppose that $f:U\subset\operatorname{\mathbb{R}}^{d}\to\operatorname{\mathbb{R}}$ is $C^{\infty}$, then $f$ is $(A,B,C)$-mild for some $A,B>0$ if and only if it is a Gevrey function of class $C+1$.

Proof.

If one sets $R=A^{-1/(C+1)}$ and $M=B$, then it follows immediately that the bounds on the derivatives are the same. ∎

Of course, one could define a Gevrey function of class $\alpha$ up to order $r$ and the result above has an up to order $r$ version and thus, so do the theorem and the subsequent corollary below.

Theorem 2.5** (Gevrey [6]).**

Suppose that $f:V\subset\operatorname{\mathbb{R}}^{d}\to\operatorname{\mathbb{R}}$ and $g:U\subset\operatorname{\mathbb{R}}^{e}\to V$ are Gevrey functions of class $\alpha\geq 1$, then $f\circ g$ is a Gevrey function of class $\alpha$.

Proof.

The idea of this ingenious proof of Gevrey is as follows. For some specific $F$ and $G$, we can explicitly compute both sides of the Faà di Bruno formula at some well chosen point since all derivatives of $F\circ G$ will be easy to compute. In turns out that the values of these derivatives at this point are exactly the bounds we have for the derivatives of our given maps $f$ and $g$. Now let $x\in U$ be arbitrary. Using the Faà di Bruno formula and the triangle inequality to bound $|(f\circ g)^{(\nu)}(x)|$, we obtain the same sum of positive terms where the bounds on the derivatives of $f$ and $g$ occur. Moreover, this sum does not depend on $x$, since the bounds of a Gevrey function are uniform.

To define the maps $F$ and $G$, we need the constants that bound the derivatives of $f$ and $g$. Since they’re Gevrey functions of class $\alpha$, we have:

[TABLE]

and

[TABLE]

for $i=1,\ldots,d$. The maps that do the trick are the following $F$ and $G=(G_{1},\ldots,G_{d})$:

[TABLE]

and for $i=1,\ldots,d$:

[TABLE]

We first compute an arbitrary derivative of $G_{i}$ for some $i\in\{1,\ldots,d\}$. Set $S(x)=x_{1}+\ldots+x_{e}$. Then we have for all $j\in\{1,\ldots,e\}$ that $(\partial/\partial x_{j})(S(x))=1$. Writing $G_{i}(x)=M_{g}R_{g}(R_{g}-S(x))^{-1}$ we easily obtain that for any $\lambda\in\operatorname{\mathbb{N}}^{e}$:

[TABLE]

Hence we get:

[TABLE]

Noticing that $G(0)=(M_{g},\ldots,M_{g})$, we see that for all $\lambda\in\operatorname{\mathbb{N}}^{d}$ we obtain similarly:

[TABLE]

Next, one checks that:

[TABLE]

and that for any $\lambda\in\operatorname{\mathbb{N}}^{e}$ with $|\lambda|\geq 1$:

[TABLE]

Finally we get that:

[TABLE]

with $M=\frac{dM_{f}M_{g}}{R_{f}+dM_{g}}$ and $R=\frac{R_{f}R_{g}}{R_{f}+dM_{g}}$. Hence if we plug in values as in (2) and (1) in the sum of Theorem (2.3), then we know that it is equal to (3). More precisely, we get the following equalities:

[TABLE]

Now first suppose $\alpha=1$. To compute an upper bound on $|(f\circ g)^{(\nu)}(x)|$, use the Faà di Bruno formula, the triangle inequality and finally the bounds on the derivatives of $f$ and $g$ to obtain the sum on the right hand side of these equations. We now know it equals the desired form on the left hand side. This finishes the proof if $\alpha=1$. If $\alpha>1$, you additionally use that $r^{\alpha}+s^{\alpha}\leq(r+s)^{\alpha}$ $(r,s\geq 0)$, which yields the result. ∎

Combining this with Proposition (2.4) one deduces from this proof the following result on mild functions.

Corollary 2.5.1**.**

Suppose that $f:V\subset\operatorname{\mathbb{R}}^{d}\to\operatorname{\mathbb{R}}$ is $(A_{f},B_{f},C)$-mild and that $g:U\subset\operatorname{\mathbb{R}}^{e}\to V$ is $(A_{g},B_{g},C)$-mild. Then $f\circ g$ is $(A,B,C)$-mild where:

[TABLE]

In particular, if $f$ is $(A_{f},0)$-mild and $g$ is $(A_{g},0)$-mild then $f\circ g$ is $(A,0)$-mild with:

[TABLE]

2.2. Weakly mild functions and power substitutions

Many nice functions are not mild. For instance, if $f$ is analytic on $U$, this still isn’t sufficient: consider for example the function $x\mapsto x^{1/2}$ on $(0,1)$. So one can not weaken the conditions of Lemma (2.2). Maps of this form will be crucial later on. They are also examples of the next definition, a variant on mild functions that has been introduced by Cluckers, Pila and Wilkie in [4]. By a reparameterization, which we will call a power substitution, we can make these functions mild up to any order if they satisfy an additional condition.

Definition 2.5** (Weakly mild functions).**

Suppose that $A,B>0$, $C\geq 0$ are real numbers, $r>0$ an integer or $+\infty$ and $f:U\subset(0,1)^{d}\to\operatorname{\mathbb{R}}$. Then $f$ is called weakly $(A,B,C)$-mild up to order $r$ if it is $C^{r}$ and if for all $\nu\in\operatorname{\mathbb{N}}^{d}$ with $|\nu|\leq r$ and $x\in U$:

[TABLE]

A map $f=(f_{1},\ldots,f_{n}):U\subset(0,1)^{d}\to\operatorname{\mathbb{R}}^{n}$ is weakly $(A,B,C)$-mild up to order $r$ if all component functions $f_{1},\ldots,f_{n}$ are weakly $(A,B,C)$-mild up to order $r$. If $B\leq 1$, we simply say that $f$ is weakly $(A,C)$-mild up to order $r$ and if we say that $f$ is weakly mild up to order $r$, then we mean that $f$ is weakly $(A,C)$-mild up to order $r$ for some $A>0$ and $C\geq 0$. Finally, if $r=+\infty$, we might just say weakly $(A,B,C)$-mild or weakly mild.

Using the technique of the proof of Theorem (2.5), we can make the result of [4, Proposition 4.1.5] more explicit in the proposition below. In particular we have an explicit formula for $\tilde{A}$ and the constant $C$ is preserved.

Proposition 2.6** (Power substitution).**

Let $A\geq 1$, $B>0$ and $C\geq 0$ be real numbers and suppose that $f:U\subset(0,1)^{d}\to\operatorname{\mathbb{R}}$ is a map such that $f$ and all first order derivatives of $f$ are weakly $(A,B,C)$-mild. Let $r>0$ be an integer and define $\phi:(0,1)^{d}\to(0,1)^{d}$ by:

[TABLE]

with $n_{i}\geq r$ for all $i\in\{1,\ldots,d\}$, and denote $V=\phi^{-1}(U)$. Then the map $f\circ\phi:V\to\operatorname{\mathbb{R}}$ is $(\tilde{A},B,C)$-mild up to order $r$ with $\tilde{A}=NA(d+1)^{C+1}$, with $N=\max(n_{1},\ldots,n_{d})$.

Remark: if $f$ satisfies the conditions above, but with $0<A<1$ instead, one can apply the proposition after enlarging $A$ to $1$.

Proof.

We first take a look at the derivatives of $\phi$. Take any component function $\phi_{i}$ of $\phi$. Because it only depends on $x_{i}$, we just have to bound the following derivatives:

[TABLE]

Thus, $\phi$ is $(N,0)$-mild. However, we will use the sharper bound (involving the power $n_{i}-k$ of $x_{i}$) to deal with the derivatives of $f$. By Theorem (2.3) and the triangle inequality, we have for every $x\in V$ that

[TABLE]

Consider one term in this sum, so we also have a fixed $\lambda\in\operatorname{\mathbb{N}}^{d}$ with $1\leq|\lambda|\leq|\nu|$, $s\in\{1,\ldots,n\}$ and $(k_{1},\ldots,k_{s},l_{1},\ldots,l_{s})\in p_{s}(\nu,\lambda)$. Then, for any $i\in\{1,\ldots,d\}$ and $j\in\{1,\ldots,s\}$, we have:

[TABLE]

and thus the power of $x_{i}$ coming from the product over $j$ is $\sum_{j=1}^{s}(n_{i}-l_{j,i})k_{j,i}$.

We now compute the ‘negative’ contribution to the powers of $x_{i}$ in this term coming from $f^{(\lambda)}(\phi(x))$. Write $\lambda=\lambda^{\prime}+\beta$ for some $\beta\in\operatorname{\mathbb{N}}^{d}$ with $|\beta|=1$ and let $k\in\{1,\ldots,d\}$ be the unique index such that $\beta_{k}=1$. For any choice of $\beta$ we have the following (thus we may pick some particular $\beta$, equivalently, make a choice for $k$, later):

[TABLE]

Hence the power of $x_{i}$ coming from $f^{(\lambda)}(\phi(x))$ in the term is equal to $-n_{i}\lambda^{\prime}_{i}$. We can now compute the total power of $x_{i}$ occurring in the term. The total power of $x_{i}$ when $i\neq k$ is (then $\lambda_{i}^{\prime}=\lambda_{i}$):

[TABLE]

When $i=k$ (then $\lambda^{\prime}_{k}=\lambda_{k}-1$) one computes in the same way that the power of $x_{k}$ is $n_{k}-\sum_{j=1}^{s}k_{j,k}l_{j,k}$. We now pick $k$ such that

[TABLE]

Then we have for all $i\in\{1,\ldots,d\}$:

[TABLE]

and we can bound the product of all $x_{i}$ and their powers by:

[TABLE]

since $n_{k}\geq r$ and $|\nu|\leq r$. So we can bound this term independent of $x$.

Putting everything together we obtain that:

[TABLE]

This is the same upper bound as the one that one would find for the composition of an $(A,B,C)$-mild function up to order $r$ and an $(N,1,C)$-mild function up to order $r$ using Proposition (2.4) and then the proof of Theorem (2.5). Therefore one can use the formula of Corollary (2.5.1) to find the expression for $\tilde{A}$. ∎

The extra condition that all first order derivatives are weakly mild is crucial and cannot be omitted. For instance, consider again the map $x\mapsto x^{1/2}$. Then we see that by composing with the power map $x\mapsto x^{3}$, we do not obtain a map that is mild up to order $3$. Of course, using the power map $x\mapsto x^{2}$, it becomes mild (up to order $+\infty$). This observation will be the key to slightly improve the main theorem in Section 3.

Even though we can say something about the derivatives of a composition of weakly mild functions, it is not necessarily weakly mild. We do have the following result.

Proposition 2.7**.**

Suppose that $f:V\subset\operatorname{\mathbb{R}}^{d}\to\operatorname{\mathbb{R}}$ is $(A_{f},B_{f},C)$-mild up to order $r$ and that $g:U\subset(0,1)^{e}\to V$ is weakly $(A_{g},B_{g},C)$-mild up to order $r$. Then $f\circ g$ is weakly $(A,B,C)$-mild up to order $r$, where $A$ and $B$ are as in Corollary (2.5.1).

Proof.

The strategy of the proof is completely the same as in Proposition (2.6): one just checks that in each term one obtains exactly a factor $\frac{1}{x^{\nu}}$ when bounding $(f\circ g)^{(\nu)}(x)$ using Theorem (2.3). ∎

We conclude this section with a result on the product of (weakly) mild functions. In this proposition, one can replace $(0,1)^{d}$ by $\operatorname{\mathbb{R}}^{d}$ in the case of mild functions.

Proposition 2.8**.**

Suppose that $f_{1},\ldots,f_{l}:U\subset(0,1)^{d}\to\operatorname{\mathbb{R}}$ are (weakly) $(A,B,C)$-mild up to order $r$ for some $A,B>0$ and $C\geq 0$. Then the product $f_{1}\cdots f_{l}$ is (weakly) $(lA,B^{l},C)$-mild up to order $r$.

Proof.

As in [12, Proposition 2.6], we have that:

[TABLE]

where the sum runs over all $\nu_{1},\ldots,\nu_{l}\in\operatorname{\mathbb{N}}^{d}$ such that $\nu_{1}+\ldots+\nu_{l}=\nu$ and $\text{Ch}(\nu_{1},\ldots,\nu_{l})$ is a constant depending on $\nu_{1},\ldots,\nu_{l}$. If $f_{1},\ldots,f_{l}$ are $(A,B,C)$-mild, we find:

[TABLE]

If $f_{1},\ldots,f_{l}$ are weakly $(A,B,C)$-mild, one obtains an extra factor $1/x^{\nu}$ as desired. Finally, in Section 3.2 of [4], it is shown that $\sum_{\nu_{1}+\ldots+\nu_{l}=\nu}\text{Ch}(\nu_{1},\ldots,\nu_{l})\leq l^{|\nu|}$. ∎

3. The $C^{r}$-parameterization theorem

In this section we give a precise definition of the structure wherein the family $X_{T}$, $T\subset\operatorname{\mathbb{R}}^{k}$, of our main theorem should be definable. This structure is o-minimal, a powerful tool of model theory, and thus enables us to use the cell decomposition theorem, see [14]. Furthermore, in [10] Miller has shown a preparation theorem for definable functions in this structure. Combining these results, we obtain a very strong parameterization theorem from which we will easily deduce the main theorem with the results of the last section.

We start with the necessary definitions of model theory and the result of Miller. In his paper definability (in $\operatorname{\mathbb{R}}^{n}$) is with respect to the following language. Let $\mathcal{L}_{\text{r}}=\{+,-,\cdot,<,0,1\}$ be the language of ordered rings and expand it with a symbol for each of the following functions:

[TABLE]

where $f:U\to\operatorname{\mathbb{R}}$ is a real analytic function on an open neighborhood $U$ of $[-1,1]^{n}$. Denote this language $\mathcal{L}_{\text{an}}$. If $X$ is $\mathcal{L}_{\text{an}}$-definable in $\operatorname{\mathbb{R}}^{n}$, then it is called (globally) subanalytic. Remember that a function is definable if its graph is a definable set. Next, if we expand $\mathcal{L}_{\text{an}}$ with a symbol for all functions

[TABLE]

for $r\in\operatorname{\mathbb{R}}$, we obtain the language $\mathcal{L}^{\text{pow}}_{\text{an}}$ and the corresponding structure $\operatorname{\mathbb{R}}^{\text{pow}}_{\text{an}}$. If $X$ is $\mathcal{L}_{\text{an}}^{\text{pow}}$-definable in $\operatorname{\mathbb{R}}^{n}$, we say that $X$ is power-subanalytic. In [10], Miller considers the following reducts of $\operatorname{\mathbb{R}}^{\text{pow}}_{\text{an}}$. Let $\mathcal{F}$ be a Weierstrass system: a collection $\mathcal{F}_{n}$ of real analytic functions $\operatorname{\mathbb{R}}^{n}\to\operatorname{\mathbb{R}}$ for each $n\in\operatorname{\mathbb{N}}$, containing the polynomials in $n$ variables, for all $n$ which is closed under several operations such as the ring operations, composition and Weierstrass preparation (for a precise definition, see [10]). If one adds to the language $\mathcal{L}_{r}$ symbols for each $\tilde{f}$, where $f\in\mathcal{F}$, one obtains the language $\mathcal{L}_{\mathcal{F}}$. In particular, the easiest examples are $\mathcal{L}_{r}$ and $\mathcal{L}_{\text{an}}$, corresponding to adding no functions and all subanalytic functions respectively. For any Weierstrass system $\mathcal{F}$, one can consider its field of exponents:

[TABLE]

(Miller shows in his paper that this is indeed a field.) Note that for the smallest Weierstrass system, i.e. just polynomials in $n$ variables, this field is $\operatorname{\mathbb{Q}}$ and thus any field of exponents $K$ contains $\operatorname{\mathbb{Q}}$. For the largest Weierstrass system, i.e. consisting of all restrictions of all analytic functions (as above), this field is $\operatorname{\mathbb{R}}$. Denote $\mathcal{L}^{K}_{\mathcal{F}}$ the language obtained by adding to $\mathcal{L}_{\mathcal{F}}$ a symbol for all power maps $x\mapsto x^{r}$ for $r\in K$ (as above), where $K$ can be any subfield of $\operatorname{\mathbb{R}}$. From now on, definability is with respect to the language $\mathcal{L}_{\mathcal{F}}^{K}$, where $K$ is a subfield of the field of exponents of $\mathcal{F}$. The corresponding structure $\operatorname{\mathbb{R}}_{\mathcal{F}}^{K}$ is o-minimal.

Definition 3.1** (Cell).**

A cell in $\operatorname{\mathbb{R}}^{m}$ is a set of the following form:

[TABLE]

where $x_{<i}=(x_{1},\ldots,x_{i-1})$, $\alpha_{i}$ and $\beta_{i}$ are continuous definable functions, with $\alpha_{i}<\beta_{i}$, and $\Box$ is ‘no condition’ or the conditions $<$ or $=$, where $\Box_{i2}$ is $<$ or no condition if $\Box_{i1}$ is equality. Obviously, a cell is open in $\operatorname{\mathbb{R}}^{m}$ if and only if $\Box_{i1}$ is not equality for all $i$. In that case we call $\alpha_{i}$ and $\beta_{i}$ the walls of $x_{i}$.

Suppose that $C$ is a cell in $\operatorname{\mathbb{R}}^{n}$. Then, up to reordering the variables if necessary, we may suppose that for $i=1,\ldots,m$ ($m\leq n$) the condition $\Box_{i1}$ is inequality and for the last $n-m$ variables $\Box_{i1}$ is equality. In this way, we see that any cell in $\operatorname{\mathbb{R}}^{n}$ corresponds to the graph of a definable function $f:U\subset\operatorname{\mathbb{R}}^{m}\to\operatorname{\mathbb{R}}^{n-m}$. Combining this with the fact that an open cell in $\operatorname{\mathbb{R}}^{n}$ is definably homeomorphic to $(0,1)^{n}$, we get that a cell in $\operatorname{\mathbb{R}}^{n}$ is the same as the graph of a definable function $(0,1)^{m}\to\operatorname{\mathbb{R}}^{n-m}$. The number $m$ is the dimension of the cell and thus is nothing more than counting how many times $\Box_{i1}$ is inequality. We will do many manipulations with these functions and thus end up in general with definable maps $U\subset(0,1)^{m}\to\operatorname{\mathbb{R}}^{n-m}$, where $U$ is an open cell in $(0,1)^{m}$. To conclude, because any definable set in an o-minimal structure is a finite union of cells, it suffices to prove the main theorem, where we assume $X_{T}$ to be a definable family of $m$-dimensional subsets of $[-1,1]^{n}$, with $T\subset\operatorname{\mathbb{R}}^{k}$ the set of parameters, in the case that $X_{T}$ is the graph of a definable map $f:T\times(0,1)^{m}\to[-1,1]^{n-m}$. (If $X$ does not depend on parameters, $T=\operatorname{\mathbb{R}}^{0}$, which is by definition a set with only one point.) Later on, our map will be of the form $f:C\subset T\times(0,1)^{m}\to[-1,1]^{n-m}$, where the fibers $C_{t}$ of $C$ are open cells in $(0,1)^{m}$ for any $t\in T$ and we will denote $f_{t}$ for the map $C_{t}\to[-1,1]^{n-m}$ given by $x\mapsto f(t,x)$.

In this section $T$ is a definable subset of $\operatorname{\mathbb{R}}^{k}$ and we will often use the following notation. Suppose $U\subset\operatorname{\mathbb{R}}^{m}$. Then we denote by $\overline{U}$ the topological closure of $U$ in $\mathbb{R}^{m}$ endowed with the standard topology. Furthermore, for any $i\in\{2,\ldots,m\}$, $\pi_{<i}:T\times\operatorname{\mathbb{R}}^{m}\to T\times\operatorname{\mathbb{R}}^{i-1}$ denotes the map

[TABLE]

and $\pi_{<1}(t,x)=t$. The following two definitions coincide with [4, Definition 4.4.1].

Definition 3.2** (Centre of a cell).**

Suppose that $C$ is a cell in $\operatorname{\mathbb{R}}^{m}$. A definable continuous map $\theta:\pi_{<m}(C)\to\operatorname{\mathbb{R}}$ is called a centre for $C$ if its graph and $\overline{C}$ are disjoint or if its graph is contained in $\overline{C}\setminus C$, and $\theta$ is identically zero or $\theta(x_{<m})\sim x_{m}$ for all $x\in C$, that is, there exists some $\epsilon\in(0,1)$ such that for all $x\in C$:

[TABLE]

The next definition motivates why $\theta$ is called the centre of a cell.

Definition 3.3** (Prepared with centre).**

A bounded definable function $f:C\to\operatorname{\mathbb{R}}$, where $C$ is a cell in $\operatorname{\mathbb{R}}^{m}$, is called prepared with centre $\theta$ if $\theta$ is a centre for $C$ and $f$ can be written in the following way:

[TABLE]

where $b:C\to\operatorname{\mathbb{R}}^{N}$ (for some $N\in\operatorname{\mathbb{N}}$) is bounded, $b_{j}$ is a component function of $b$ and the component functions $b_{i}$, $i\in\{1,\ldots,N\}$, of $b$ are of the following form:

[TABLE]

with $r_{i}\in K$ and $a_{i}:\pi_{<m}(C)\to\operatorname{\mathbb{R}}$ definable and, finally, $F$ is a non-vanishing analytic function on an open neighborhood of $\overline{b(C)}$. We call $b$ the associated bounded range map of $f$. A map $f:C\to\operatorname{\mathbb{R}}^{n}$ is prepared with centre $\theta$ if all of its component functions are prepared with centre $\theta$ and moreover have the same bounded range map $b$.

We now state the preparation theorem as in [4, Proposition 4.4.2], which follows from the main theorem of [10] by [10, Lemma 3.7 and Lemma 4.4].

Theorem 3.1**.**

Suppose that $f:X\subset\operatorname{\mathbb{R}}^{m}\to\operatorname{\mathbb{R}}^{n}$ is a bounded definable map. Then there exists a finite partition of $X$ into cells $C_{i}$ with centre $\theta_{i}$ such that the restriction $f|_{C_{i}}$ of $f$ to $C_{i}$ is prepared with centre $\theta_{i}$.

We follow [4, Section 4], but in our proofs, we avoid transforming parameters, i.e. we prove everything uniformly. The main reason we do this is to clearly point out that the power substitution in the proof of [4, Theorem 2.1.3] does not require a power substitution in the parameter variables. The idea here is that we stop the inductive proof of [4, Theorem 4.3.1] when we reach the parameter variables (see Theorem (3.6)) and then apply a (uniform) power substitution (Theorem (3.5)). To achieve this, we slightly adjusted some definitions , namely the notion of an a-b-m function in [4], which is here replaced by ‘prepared in $x$’ (see below). The main theorem will be deduced from Theorem (3.6). In this theorem we parameterize $X_{T}$ with maps that satisfy the conditions of Proposition (2.6). Finally we conclude by Lemma (2.1).

Definition 3.4**.**

Suppose that $C$ is a cell in $\operatorname{\mathbb{R}}^{k}\times(0,1)^{m}$ and denote an element of $C$ as a tuple $(t,x)$. A bounded definable function $f:C\to\operatorname{\mathbb{R}}$ is prepared in $x$ if it can be written as:

[TABLE]

where $b:C\to\operatorname{\mathbb{R}}^{N}$ (for some $N\in\operatorname{\mathbb{N}}$) is bounded, $b_{j}$ is a component function of $b$, any component function $b_{i}$, $i\in\{1,\ldots,N\}$, of $b$ is of the form:

[TABLE]

for some definable function $a_{i}:\pi_{<k+1}(C)\to\operatorname{\mathbb{R}}$, $\mu_{i}\in K^{m}$ and $F$ is analytic and non-vanishing on an open neighborhood of $\overline{b(C)}$. We call $b$ the associated bounded monomial map of $f$. A bounded definable map $f:C\to\operatorname{\mathbb{R}}^{n}$ is prepared in $x$ if all of its component functions are prepared in $x$ and have the same associated bounded monomial map $b$.

Note that $k$ can be zero. In that case, up to a scalar $a$, the associated bounded monomial map $b$ is a monomial and the definition of prepared in $x$ coincides with the definition of an analytic-bounded-monomial map of [4]. We now show some properties of these maps that relate to the previous section.

Lemma 3.2**.**

Let $b:U\subset(0,1)^{m}\to\operatorname{\mathbb{R}}$, where $U$ is open, be given by $b(x)=ax^{\mu}$ for some $a\in\operatorname{\mathbb{R}}$ and some $\mu\in\operatorname{\mathbb{R}}^{m}$. If $b$ is bounded, then $b$ is weakly ({\color[rgb]{0,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@gray@stroke{0}\pgfsys@color@gray@fill{0}M},B,0)-mild, where {\color[rgb]{0,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@gray@stroke{0}\pgfsys@color@gray@fill{0}M}=\max(1,|\mu_{1}|,\ldots,|\mu_{m}|) and $B=\sup_{U}b(x)$.

Proof.

Clearly, for any $\nu\in\operatorname{\mathbb{N}}^{m}$, by the form of $b$, we have:

[TABLE]

for some constant $c(\nu,\mu)$ depending on $\nu$ and $\mu$, which remains to be bounded as desired. It is easy to see that computing the next order derivative would multiply $c(\nu,\mu)$ with a factor that is at most $M+|\nu|$ in absolute value. Therefore, we find that:

[TABLE]

∎

Lemma 3.3**.**

Suppose that $f:U\subset T\times(0,1)^{m}\to\operatorname{\mathbb{R}}$ is prepared in $x$ with associated bounded monomial map $b$, where for any $t\in T$ the fiber $U_{t}$ is open. Then there exist $A,B>0$ such that for any $t\in T$ the map $f_{t}$ is weakly $(A,B,0)$-mild. Moreover, if the $C^{1}$-norm of the associated bounded monomial map $b_{t}$ of $f_{t}$ is bounded independently of $t$, then there exist $A,B>0$ such that for any $\beta\in\operatorname{\mathbb{N}}^{m}$ with $|\beta|\leq 1$ and $t\in T$ the map $f^{(\beta)}_{t}$ is weakly $(A,B,0)$-mild.

Proof.

Since $f$ is prepared in $x$, we have that $f(t,x)=b_{j}(t,x)F(b(t,x))$ as in Definition (3.4). By Lemma (3.2), there exist $A,B>0$, such that for any $t\in T$ the map $b_{t}$ is weakly $(A,B,0)$-mild. The constant $A$ does not depend on $t$ and, since $b$ is bounded, we may suppose $B$ does not depend on $t$. Finally, by Proposition (2.7) and Lemma (2.2), for any $t\in T$ we have that $F\circ b_{t}$ is weakly $(A,B,0)$-mild for some $A,B>0$ that do not depend on $t$ and we can conclude by Proposition (2.8) that for any $t\in T$, $f_{t}$ is weakly $(A,B,0)$-mild for some $A,B>0$ that do not depend on $t$.

Now fix any $t\in T$ and $1\leq i\leq m$. By the product rule we have

[TABLE]

Since we can bound the derivatives of $b_{t}$ independently of $t$, this is for any $t$ a sum of weakly $(A,B,0)$-mild functions for some $A,B>0$ independent of $t$ and thus is also weakly $(A,B,0)$-mild (for possibly larger $A>0$ and $B>0$). ∎

This lemma motivates the following definition.

Definition 3.5**.**

Suppose that $f:U\subset\operatorname{\mathbb{R}}^{k}\times\operatorname{\mathbb{R}}^{m}\to\operatorname{\mathbb{R}}^{n}$ is a family of functions. If there exists a $B$ such that for all $t\in\pi_{<1}(U)$ and $x\in U_{t}$ we have that $|f_{t}(x)|<B$, we say that $f$ is bounded in $x$. More generally, if $r$ is a natural number, we say $f$ is $C^{r}$-bounded in $x$ if there exists a $B$ such that for any $t\in\pi_{<1}(U)$ the map $f_{t}$ is $C^{r}$ and for any $x\in U_{t}$ the $C^{r}$-norm of $f_{t}$ is bounded by $B$.

As an example, let $T=(0,1)$ and consider the family of maps $f_{T}:(t,x)\mapsto t^{2}/x$ on the cell given by

[TABLE]

Then for a fixed $t\in T$, the map $f_{t}$ is in fact mild, but the upper bound depends on $t$. However, one sees that $f$ is $C^{1}$-bounded in $x$.

Lemma (3.3) shows that if $f$ is prepared in $x$ such that its associated bounded monomial map $b$ is $C^{1}$-bounded in $x$, then we can apply Proposition (2.6) to $f$. The following result, which we need in the proof of Proposition (3.5), is a more refined version of Proposition (2.6) for the bounded monomial map $b$. The technique of the proof is similar, but will use the particular form of $b$.

Proposition 3.4**.**

Let $b:U\subset(0,1)^{m}\to\operatorname{\mathbb{R}}$, where $U$ is open, be given by $b(x)=ax^{\mu}$ for some $a\in\operatorname{\mathbb{R}}$ and $\mu\in\operatorname{\mathbb{R}}^{m}$. Suppose that $b$ is $C^{1}$-bounded. Let $r>0$ be an integer and $\phi:(0,1)^{m}\to(0,1)^{m}$ be the map given by:

[TABLE]

where for all $i\in\{1,\ldots,m\}$, we have that $n_{i}\geq r^{l}$ for some integer $l\geq 1$ and set $V=\phi^{-1}(U)$. Then (b\circ\phi)^{1/r^{l-1}}{\color[rgb]{0,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@gray@stroke{0}\pgfsys@color@gray@fill{0}:V\to\operatorname{\mathbb{R}}} is ({\color[rgb]{0,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@gray@stroke{0}\pgfsys@color@gray@fill{0}\max(n_{1},\ldots,n_{m})}A,B,0)-mild up to order $r$, for some $A,B>0$ depending on $b$ only.

Proof.

For simplicity, we assume that $a=1$. We have that $(b\circ\phi)(x)=x^{N\mu}$, where $N\mu=(n_{i}\mu_{i})_{i}$. We apply Theorem (2.3) to the composition {\color[rgb]{0,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@gray@stroke{0}\pgfsys@color@gray@fill{0}(b\circ\phi)^{1/r^{l-1}}}=b^{1/r^{l-1}}\circ\phi to get:

[TABLE]

for any $x\in V$. We again compute the power of $x_{i}$ in a fixed term of this sum as in the proof of Proposition (2.6). The product of the $|(\phi^{(l_{j})}(x))^{k_{j}}|$ gives a power $\sum_{j=1}^{s}(n_{i}-l_{j,i})k_{j,i}$. Using the notation of Lemma (3.2), we have that

[TABLE]

where $N\lambda=(n_{i}\lambda_{i})_{i}$ and $c(\lambda,r^{-(l-1)}\mu)$ is a constant depending on $\lambda,r,l$ and $\mu$. We have that $x_{i}^{\sum_{j=1}^{s}((n_{i}-l_{j,i})k_{j,i})-n_{i}\lambda_{i}}=x_{i}^{-\sum_{j=1}^{s}l_{j,i}k_{j,i}}$. Let $k\in\{1,\ldots,m\}$ be such that $x_{k}=\min_{i}\{x_{i}\mid\lambda_{i}\neq 0\}$. We may then assume that $\mu_{k}\neq 0$ for the computations below, since if $\mu_{k}=0$, the partial derivative of $b^{1/r^{l-1}}$ with respect to $\lambda$ is zero since $\lambda_{k}\neq 0$. Then we bound the product over all $x_{i}$ in terms of $x_{k}$:

[TABLE]

Finally assume $|\nu|\leq r$. Using that $n_{k}\geq r^{l}$, we further bound:

[TABLE]

Finally, observe that

[TABLE]

which is bounded since $\phi(x)\in U$ and $b$ is $C^{1}$-bounded on $U$. This bound only depends on $b$ and the $r^{l-1}$-th root of this bound can be bounded by some constant that only depends on $b$, not on $r$ or $l$. As in the proof of Lemma (3.2), we can bound $|c(\lambda,r^{-(l-1)}\mu)|$ by $M^{|\lambda|}|\lambda|!$, where $M>0$ can be further bounded to only depend on $b$. One now finishes the proof similarly as the (end of) the proof of Proposition (2.6). ∎

The next proposition is one of the two main ingredients for the proof of the main theorem.

Proposition 3.5**.**

Suppose that $f:C\subset T\times(0,1)^{m}\to[-1,1]$ is prepared in $x$ such that the associated bounded monomial $b$ is $C^{1}$-bounded in $x$. Suppose moreover that for any $t\in T$, the cell $C_{t}$ is open and that the walls of $C$ are also prepared in $x$ with associated bounded monomial maps that are $C^{1}$-bounded in $x$. Let $r>0$ be any integer and consider the map $\phi_{r}:T\times(0,1)^{m}\to T\times(0,1)^{m}$ given by

[TABLE]

Then $C_{r}=\phi_{r}^{-1}(C)$ is a cell and there exists an $A>0$ such that for any $t\in T$ the walls of the open cell $C_{r,t}$ of $x_{1}$ are $(A,0)$-mild, for $i=2,\ldots,m$, the walls of $x_{i}$ are $(r^{m}A,0)$-mild up to order $r$ and $(f\circ\phi_{r})_{t}:C_{r,t}\to[-1,1]$ is $(r^{m}A,0)$-mild up to order $r$.

Proof.

Fix some $t\in T$ and consider a wall of the cell $C_{t}$, say $\alpha_{i}$ of $x_{i}$. If $i=1$, the walls are constant and there is nothing to show, so suppose $i\geq 2$. Then $\alpha_{i}(x_{<i})=b_{j,t}(x_{<i})F(b_{t}(x_{<i}))$ for some $b$ and $F$ as in Definition (3.4), since $\alpha_{i}$ is prepared in $x$. It follows that the corresponding wall of $x_{i}$ in the cell $C_{r,t}$ is given by:

[TABLE]

By a uniform version of Proposition (3.4), we have that $\sqrt[r^{m-i+1}]{b_{j,t}(x_{1}^{r^{m}},\ldots,x_{i-1}^{r^{m-i+2}})}$ is $(r^{m}A_{1},B_{1},0)$-mild up to order $r$ for some $A_{1},B_{1}>0$ independent of $t$ and $r$. $A_{1}$ does not depend on $t$ since it only depends on the exponent of $x$ in $b_{j}$, which does not depend on $t$ by Definition (3.4). To show that $B_{1}$ does not depend on $t$, one should dismiss the assumption that $a=1$ in the proof of (3.4), but can later use that $b_{j}$ is $C^{1}$-bounded in $x$ to find $B_{1}$ independent of $t$ (and also $r$ and $l$).

Since $F$ is a non-vanishing analytic function on some open neighborhood of $\operatorname{\text{Im}}(b_{t})$, we may suppose that there is some $S>1$ such that $\operatorname{\text{Im}}(F)\subset(1/S,S)$. On this domain, the function $\sqrt[r^{m-i+1}]{}$ is $(S,S,0)$-mild. Hence, $\sqrt[r^{m-i+1}]{}\circ F$ is an $(A_{F},B_{F},0)$-mild map for some $A_{F},B_{F}>0$ by Lemma (2.2) and Corollary (2.5.1), where $A_{F}$ and $B_{F}$ only depend on $F$, not on $t$ or $r$. Next, $b_{t}(x_{1}^{r^{m}},\ldots,x_{i-1}^{r^{m-i+2}})$ is $(r^{m}A^{\prime},B^{\prime},0)$-mild up to order $r$ by Proposition (2.6) for some $A^{\prime},B^{\prime}>0$ depending only on $b$,not on $t$ or $r$. Applying the up to order $r$ version of Corollary (2.5.1), we see that $\sqrt[r^{m-i+1}]{F(b_{t}(x_{1}^{r^{m}},\ldots,x_{i-1}^{r^{m-i+2}}))}$ is $(r^{m}A_{2},B_{2},0)$-mild up to order $r$ for some $A_{2},B_{2}>0$ depending only on $\alpha_{i}$, not on $t$ or $r$.

By Proposition (2.8), we see that $\alpha_{r,t}$ is $(r^{m}A,B,0)$-mild up to order $r$ for some $A,B>0$ independent of $t$ and $r$. Since $\operatorname{\text{Im}}(\alpha_{r,t})\subset(0,1)$, after possibly enlarging $A$, we can conclude that $\alpha_{r,t}$ is $(r^{m}A,0)$-mild up to order $r$ for some $A>0$ independent of $t$ and $r$. Finally, by Proposition (2.6) and Lemma (3.3), the function $(f\circ\phi_{r})_{t}$ is $(r^{m}A^{\prime\prime},B^{\prime\prime},0)$-mild up to order $r$ for some $A^{\prime\prime},B^{\prime\prime}>0$ independent of $t$ and $r$. Since $|f|\leq 1$, after possibly enlarging $A^{\prime\prime}$, we have that $(f\circ\phi_{r})_{t}$ is $(r^{m}A^{\prime\prime},0)$-mild up to order $r$. We conclude after redefining $A$ to be the maximum over all $A$ corresponding to the mildness of the walls and $A^{\prime\prime}$ of the mildness of $(f\circ\phi_{r})_{t}$. ∎

We will now show one can obtain the conditions of this proposition. It is a parameterization result, a slight modification of [4, Theorem 4.3.1], that will allow us to easily deduce the main theorem.

Theorem 3.6**.**

Suppose that $X_{T}$ is the graph of a definable function {\color[rgb]{0,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@gray@stroke{0}\pgfsys@color@gray@fill{0}\varphi}:C\subset T\times(0,1)^{m}\to[-1,1]^{n-m}, where $C$ is open in $T\times(0,1)^{m}$. Then there exist finitely many definable maps

[TABLE]

such that:

1. (1)

$\bigcup_{l}\text{Im}(f_{l})=X_{T}$, 2. (2)

for each $l$, $C_{l}$ is an open cell in $T_{l}\times(0,1)^{m}$, where $T_{l}$ is a cell contained in $T$, 3. (3)

for each $l$ and for any $(t,x)\in C_{l}$, $f_{l}(t,x)\in X_{t}$, thus $f_{l}$ is a family of maps $C_{l,t}\to X_{t}$ with $C_{l,t}$ open in $(0,1)^{m}$, 4. (4)

each $f_{l}$ is prepared in $x$ and the associated bounded monomial map of $f_{l}$ is $C^{1}$-bounded in $x$, 5. (5)

the walls of all $C_{l}$ are prepared in $x$ and their associated bounded monomial maps are $C^{1}$-bounded in $x$.

Proof.

The proof uses induction on $m$. The case $m=0$ is trivial. By o-minimality, we may assume that there exist finitely many $f_{l}:C_{l}\subset T\times(0,1)^{m}\to X_{T}$, satisfying properties $1$, $2$ and $3$. For the rest of the proof, we focus on one such map $f_{l}$. Next, we apply Theorem (3.1) to $f_{l}$ such that we may suppose that $f_{l}$ is prepared on $C_{l}$ with centre $\theta_{l}$. Note that some of the cells obtained by applying (3.1) might not be open, but then it has lower dimension, therefore can be considered separately and can be ignored by induction. For this reason, whenever we further partition $C_{l}$, we always assume the cells are open.

Next, we will show that we may assume $\theta_{l}=0$ on $C_{l}$. Since $x_{m}\sim\theta_{l}(x_{<m})$ on $C_{l}$, there exists some $\epsilon\in(0,1)$ such that $\epsilon x_{m}<\theta_{l}(t,x_{<m})<(1/\epsilon)x_{m}$ for all $(t,x)\in C_{l}$. Up to finite partitioning, if necessary, we may assume that either $\theta_{l}(t,x_{<m})>x_{m}$ for all $(t,x)\in C_{l}$ or $\theta_{l}(t,x_{<m})<x_{m}$ for all $(t,x)\in C_{l}$. In the first case, the other is similar, consider the cell

[TABLE]

and define $\tilde{f}_{l}:\tilde{C}_{l}\to X_{T}$ by $\tilde{f}_{l}(t,x)=f_{l}(t,x_{<m},\frac{-1}{\epsilon}x_{m}+\theta_{l}(t,x_{<m}))$. Then $\tilde{f}_{l}$ is prepared on $\tilde{C}_{l}$ with centre zero. Moreover, properties $1$, $2$ and $3$ are still satisfied. Thus, from now on we will assume additionally that $f_{l}$ is prepared on $C_{l}$ with centre zero.

Next we show that, up to finite partitioning, if necessary, the associated bounded range map $b_{l}=(b_{l,1},\ldots,b_{l,N})$ of $f_{l}$ is $C^{1}$ and $|\partial b_{l}/\partial x_{m}|\leq 1$. That we may suppose that $b_{l}$ is $C^{1}$ is a classical consequence of the cell decomposition theorem. Up to further partitioning using o-minimality, we may suppose that there exists some $i\in\{1,\ldots,N\}$ such that for any other $i^{\prime}\in\{1,\ldots,N\}$ we have: $|\partial b_{l,i}/\partial x_{m}|\geq|\partial b_{l,i^{\prime}}/\partial x_{m}|$ on $C_{l}$ and that either $|\partial b_{l,i}/\partial x_{m}|\geq 1$ or $|\partial b_{l,i}/\partial x_{m}|<1$ on $C_{l}$. The second case is exactly what we want. In the first case, we do a change of variables. To ensure that we recover a map $T\times(0,1)^{m}\to[-1,1]^{m-n}$, we first have to further partition $C_{l}$ such that $b_{l,i}$ is either identically $-1$,[math] or $1$, $b_{l,i}>0$ or $b_{l,i}<0$. We only have to consider the last two cases. Suppose we have $b_{l,i}>0$ (the case $b_{l,i}<0$ is similar up to changing a sign). Once more using o-minimality, we may assume that for fixed $(t,x_{1},\ldots,x_{m-1})$ the map $x_{m}\mapsto b_{l,i}(t,x_{1},\ldots,x_{m-1},x_{m})$ is injective and it follows that the map

[TABLE]

is invertible. Set $\bar{C}_{l}=\phi(C_{l})$ and $\bar{f}_{l}=f_{l}\circ\phi^{-1}$. Then $\bar{C}_{l}$ is an open cell in $T\times(0,1)^{m}$ and $\bar{f}_{l}$ satisfies the same properties as $f_{l}$, in particular it is prepared in $x_{m}$ with bounded range map $\bar{b_{l}}$ but moreover $|\partial\bar{b}_{l,i}/\partial x_{m}|\leq 1$ for all component functions $\bar{b}_{l,i}$ of $\bar{b}_{l}$ (by the chain rule and the choice of $i$).

So up to now, we may suppose we have finitely many maps $f_{l}:C_{l}\to X_{T}$ satisfying the first three properties, that are prepared in $x_{m}$ and the associated bounded range map $b_{l}$ of $f_{l}$ is $C^{1}$ and $|\partial b_{l,i}/\partial x_{m}|\leq 1$. Thus, for any $i\in\{1,\ldots,N\}$, the component function $b_{l,i}$ of $b_{l}$ is given by:

[TABLE]

Denote $\alpha_{m}$ for the wall of $C_{l}$ bounding the variable $x_{m}$ from below and $\beta_{m}$ for the wall of $C_{l}$ bounding $x_{m}$ from above. Up to further partitioning, we may suppose $\alpha_{m}\neq 0$ on $C_{l}$ and we will also suppose that $r_{l,i}\neq 0$ for every $i\in\{1,\ldots,N\}$. We will come back to this at the end of the proof. Now consider the following maps:

[TABLE]

and define $h_{\beta}$ and $g_{\beta}$ analogously. Note that $g_{\alpha}$ and $g_{\beta}$ are well defined by our effort to bound $|\partial b_{l,i}/\partial x_{m}|$ by 1. For any $i\in\{1,\ldots,N\}$, by the form of $b_{l,i}$, the component functions of $h_{\alpha,i}$ and $g_{\alpha,i}$ (similarly for $h_{\beta}$ and $g_{\beta}$) become:

[TABLE]

Now define the map $F:\pi_{<m}(C_{l})\to\text{Im}(F)$ whose component functions are $\alpha_{m},\beta_{m},h_{\alpha},h_{\beta},g_{\alpha}$ and $g_{\beta}$. Next, apply the induction hypothesis to the graph of $F$. Hence we obtain finitely many maps $\psi_{l,j}:D_{l,j}\to\text{graph}(F)$ satisfying all properties of the theorem. In particular, they are prepared in $x_{<m}$ with associated bounded monomial map $c_{l,j}$ that is $C^{1}$-bounded in $x_{<m}$. Therefore, by their form, the maps $\psi_{l,j}$ are $C^{1}$-bounded in $x_{<m}$. Note that $\psi_{l,j}(t,x_{<m})_{<m}\in\pi_{<m}(C_{l})$ and thus, for instance, $\alpha_{m}(\psi_{l,j}(t,x_{<m})_{<m})$ is a component function of $\psi_{l,j}$. Now set

[TABLE]

By construction, these cells have all the properties we want. Finally define $f_{l,j}:C_{l,j}\to X_{T}$ by:

[TABLE]

By the form of $f_{l}$, it remains to show that for any $i\in\{1,\ldots,N\}$, $b_{l,i}(\psi_{l,j}(t,x_{<m})_{<m},x_{m})$ is prepared in $x$ and is $C^{1}$-bounded in $x$. Thus, let $b_{l,i}$ be a component function of $b_{l}$ and suppose $r_{l,i}<0$ (in the case $r_{l,i}>0$, use $\beta$ instead of $\alpha$ in the calculations). We have that:

[TABLE]

By the construction, $h_{\alpha,i}(\psi_{l,j}(t,x_{<m})_{<m})$ and $\alpha_{m}(\psi_{l,j}(t,x_{<m})_{<m})$ are prepared in $x_{<m}$ with associated bounded monomial map $c_{l,j}$ that is $C^{1}$-bounded in $x_{<m}$. It follows that $b_{l,i}(\psi_{l,j}(t,x_{<m})_{<m},x_{m})$ is prepared in $x$. We now look at the $C^{1}$-norm. To simplify notation, denote $y=\psi_{l,j}(t,x_{<m})_{<m}$. Let $s\in\{1,\ldots,m-1\}$, then:

[TABLE]

The first term is bounded in $x$ since $h_{\alpha,i}(y)=h_{\alpha,i}(\psi_{i,l}(t,x_{<m})_{<m})$ is $C^{1}$-bounded in $x_{<m}$ (because it is prepared in $x_{<m}$, with $C^{1}$-bounded associated bounded monomial map) and $(x_{m}/\alpha_{m}(y))^{r_{l,i}}<1$ since $x_{m}>\alpha_{m}(y)$ and $r_{l,i}<0$. We further compute the last term:

[TABLE]

Hence we see that also this term is bounded in $x$. Since $(\partial b_{l}/\partial x_{m})$ was already bounded, we obtain that $b_{l,i}(\psi_{l,j}(t,x_{<m})_{<m},x_{m})$ is $C^{1}$-bounded in $x$.

To conclude we explain the cases $\alpha_{m}=0$ and $r_{l,i}=0$. If $\alpha_{m}=0$, this forces the exponent $r_{l,i}$ to be positive or zero since $b_{l}$ is bounded. If $r_{l,i}>0$, we can just use the maps $h_{\beta}$ and $g_{\beta}$ as above since $\beta_{m}>0$. If $r_{l,i}=0$, one can use the induction hypothesis on $b_{l,i}=a_{l,i}$ immediately. ∎

We can now easily prove the main theorem using this parameterization result and Lemma (2.1). It refines the $C^{r}$-parameterization theorem of [4] by making the constant $d$ more explicit; we have $d=m^{3}$.

Theorem 3.7**.**

Suppose that $X_{T}$ is a definable family of $m$-dimensional subsets in $[-1,1]^{n}$. Then there exists a constant $c>0$ such that for any integer $r>0$ and $t\in T$ there is a collection of finitely many analytic maps

[TABLE]

whose $C^{r}$-norm is bounded by $1$ and such that for any $t\in T$ the ranges of $f_{r,i,t}$, for $i=1,\ldots,cr^{m^{3}}$, cover $X_{t}$. Moreover for each $i$ and $r$, $\{f_{r,i,t}\mid t\in T\}$ is a definable family of maps.

Proof.

As we explained below Definition (3.1), we may suppose that $X_{T}$ is the graph of a definable function $T\times(0,1)^{m}\to[-1,1]^{n-m}$. By the previous result, we obtain finitely many $f:C\to X_{T}$, where $C$ is an open cell in $T\times(0,1)^{m}$. Furthermore, $f$ is prepared in $x$ with associated bounded monomial map $b$ that is $C^{1}$-bounded in $x$ and also the walls of $C$ are of this form. By Proposition (3.5) using the map

[TABLE]

we get finitely many maps $f_{r}:C_{r}\to X_{T}$, where $C_{r}$ is open in $T\times(0,1)^{m}$. Moreover, there is an $A>0$ such that for any $t\in T$, the walls $\alpha_{1}$ and $\beta_{1}$ of $C_{r,t}$ of $x_{1}$ are $(A,0)$-mild, for $i=2,\ldots,m$, the walls $\alpha_{i}$ and $\beta_{i}$ of $x_{i}$ are $(Ar^{m},0)$-mild up to order $r$ and $f_{r,t}:C_{r,t}\to X_{t}$ is $(Ar^{m},0)$-mild up to order $r$.

We now inductively map $T\times(0,1)^{m}$ on the cell $C_{r}$ as follows. For $i=1,\ldots,m$, define the map

[TABLE]

given by:

[TABLE]

and let $\Phi=\Phi_{1}\circ\ldots\circ\Phi_{m}:T\times(0,1)^{m}\to C_{r}$. If $i\geq 2$, since for any $t\in T$, $\alpha_{i}$ and $\beta_{i}$ are $(Ar^{m},0)$-mild up to order $r$, there is some $A^{\prime}>0$ such that for any $t\in T$, the map $\Phi_{i,t}$ is $(A^{\prime}r^{m},0)$-mild up to order $r$, where $A^{\prime}>0$ is possibly larger than $A$ due to the product (2.8) and addition of mild functions. If $i=1$, $\Phi_{1,t}$ is $(A^{\prime},0)$-mild, for possibly larger $A^{\prime}$. Thus we obtain that there is some $A^{\prime\prime}>0$, possibly larger than $A^{\prime}$ by Corollary (2.5.1), such that for any $t\in T$, the map $(f_{r}\circ\Phi)_{t}$ is $(A^{\prime\prime}r^{m^{2}},0)$-mild up to order $r$.

Finally, by Lemma (2.1), covering the unit cube with cubes of size $1/(A^{\prime\prime}r^{m^{2}})$, we obtain $cr^{m^{3}}$ maps that parametrize $X_{T}$ with bounded $C^{r}$-norm. ∎

Remark. The main obstacle to obtain a better result (e.g. $cr^{m}$ maps as in [1]), is the power substitution using $r^{m}$ to ensure that the walls of the cell are mild up to order $r$ too. Thus it would be interesting to prove a stronger version of Theorem (3.6) that has better walls.

A small improvement that we show now slightly improves the walls. More precisely, if $m\geq 2$, we will show that we can first improve the walls bounding the variable $x_{2}$ and use a slightly better power substitution with powers up to $r^{m-1}$ (instead of $r^{m}$).

Suppose we are given a map as a result of Theorem (3.6), call it $f:C\to X_{T}$, where $C$ is an open cell in $T^{\prime}\times(0,1)^{m}$ and $T^{\prime}$ a cell contained in $T$. Now, since the walls bounding $x_{1}$ and $x_{2}$ are prepared in $x$, the first two inequalities defining $C_{t}$ are:

[TABLE]

We will now manipulate $f$ and $C$ to ensure that the maps $a_{i}(t)x_{1}^{r}$ and $b_{j}(t)x_{1}^{s}$ become mild for any $t\in T$, by transforming $r$ and $s$ to natural numbers. If they are already mild, there is no power substitution required for these walls and we can use a better version of Proposition (3.5). Suppose that $r-s\geq 0$, the other case is similar. Since $G$ is analytic and non-vanishing on $\text{Im}(b)$, there exists $S>0$ such that $G(b(t,x_{1}))\in(1/S,S)$ for all $t$ and $x$. Equivalently: $G(b(t,x_{1}))/S\in(1/S^{2},1)$. Now consider the map $\phi$ given by:

[TABLE]

Since $b_{j}(t)x_{1}^{s}$ is $C^{1}$-bounded in $x_{1}$ by assumption, the map $\phi$ is $C^{1}$-bounded in $x$. We see that $\phi^{-1}(C)$ is a cell where the walls bounding $x_{1}$ and $x_{2}$ are now given by:

[TABLE]

By the form of $\phi$, the walls bounding $x_{3},\ldots,x_{m}$ are still prepared in $x$ and their associated bounded monomial map is $C^{1}$-bounded in $x$. If $r-s=0$, the walls are already as desired. Denote by $R$ the smallest integer greater than or equal to $r-s$. We then use the power substitution

[TABLE]

to obtain a cell $\tilde{C}$ and a map $\tilde{f}:\tilde{C}\to X_{T}$ with the same properties as $f$, i.e. $\tilde{f}$ and all of the walls of $\tilde{C}$ are prepared in $x$ with an associated bounded monomial map that is $C^{1}$-bounded in $x$. The walls of $\tilde{C}$ bounding $x_{1}$ and $x_{2}$ are of the form:

[TABLE]

where $N\in\operatorname{\mathbb{N}}$. We now have that for any $t\in T$, $\tilde{a}_{i}(t)x_{1}^{N}$ is mild. One now proceeds as in the proof of (3.7) using a slightly modified version of Proposition (3.5), namely with the power substitution

[TABLE]

In the proof of Theorem (3.7), we would now have that there is some $A>0$ such that for any $t\in T$, the walls $\alpha_{i}$ and $\beta_{i}$ of $x_{i}$ are $(Ar^{m-1},0)$-mild up to order $r$ and $f_{r,t}$ is $(Ar^{m-1},0)$-mild up to order $r$. It follows that for some possibly larger $A$ and for any $t\in T$, $(f_{r}\circ\Phi)_{t}$ is $(Ar^{m(m-1)},0)$-mild up to order $r$ and thus obtain $cr^{m^{2}(m-1)}$ maps as result.

It would be interesting to know if we could also transform the walls of the other variables in this way. However, currently it is not clear how to achieve this.