Efroymson's approximation theorem for globally subanalytic functions
Anna Valette, Guillaume Valette

TL;DR
This paper generalizes Efroymson's approximation theorem from semialgebraic to globally subanalytic functions, extending to broader o-minimal structures and including Lipschitz and -definable functions.
Contribution
It extends Efroymson's approximation theorem to globally subanalytic and o-minimal structures, broadening the class of functions that can be approximated by smooth definable functions.
Findings
Approximation theorem holds for globally subanalytic functions.
Results apply to functions definable in polynomially bounded o-minimal structures.
Includes approximation results for Lipschitz and -definable functions.
Abstract
Efroymson's approximation theorem asserts that if is a semialgebraic mapping on a semialgebraic submanifold of and if is a positive continuous semialgebraic function then there is a semialgebraic function such that . We prove a generalization of this result to the globally subanalytic category. Our theorem actually holds in a larger framework since it applies to every function which is definable in a polynomially bounded o-minimal structure (expanding the real field) that admits cell decomposition. We also establish approximation theorems for Lipschitz and definable functions.
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.
Taxonomy
TopicsAdvanced Topics in Algebra · Advanced Topology and Set Theory · Homotopy and Cohomology in Algebraic Topology
Efroymson’s approximation Theorem for globally subanalytic functions
Anna Valette and Guillaume Valette
Instytut Matematyki Uniwersytetu Jagiellońskiego, ul. S Łojasiewicza, Kraków, Poland
Instytut Matematyki Uniwersytetu Jagiellońskiego, ul. S Łojasiewicza, Kraków, Poland
Abstract.
Efroymson’s Approximation Theorem asserts that if is a semialgebraic mapping on a semialgebraic submanifold of and if is a positive continuous semialgebraic function then there is a semialgebraic function such that . We prove a generalization of this result to the globally subanalytic category. Our theorem actually holds in a larger framework since it applies to every function which is definable in a polynomially bounded o-minimal structure (expanding the real field) that admits cell decomposition. We also establish approximation theorems for Lipschitz and definable functions.
Key words and phrases:
subanalytic functions, o-minimal structures, analytic functions, Nash functions, approximation theorem, Efroymson’s theorem
2010 Mathematics Subject Classification:
14P10, 32B20, 41A30, 58A07
Research partially supported by the NCN grant 2014/13/B/ST1/00543.
0. Introduction
In [E], G. Efroymson proved an approximation theorem for continuous semialgebraic functions (see also [BCR, S1, S2]). This result can be stated as follows:
Theorem 0.1**.**
Let be a Nash submanifold of and let be a positive continuous semialgebraic function. Given a continuous semialgebraic function on there is a Nash function on such that , for all .
Let us recall that a Nash function is a semialgebraic function. The rigidity of this class of functions makes this result very attractive. Shiota, who gave an independent proof of this result [S1, S2], also achieved a stronger theorem ensuring that, when is , it is possible to approximate the first derivatives as well.
The aim of the present article is to generalize Efroymson’s theorem to the globally subanalytic category (Theorem 1.1 below). Our framework is however much bigger than this category since our approximation theorems hold every polynomially bounded o-minimal structure expanding the real field that admits cell decomposition. In particular, it applies to quasi-analytic Denjoy-Carleman classes [RSW]. These assumptions can be considered as weak since, although there exist examples of o-minimal structures that do not admit cell decomposition [GR], such examples are rather difficult to construct and all the basic examples of o-minimal structures do possess this property.
We assume that the structure is polynomially bounded rather for convenience since it is known that Efroymson’s theorem holds in the non polynomially bounded case [F1]. Indeed, in that case, the exponential function is necessarily in the structure [M1] and one can construct definable partitions of unity.
The difficulty to prove Efroymson’s theorem in polynomially bounded structures is that the rings of definable functions are quasi-analytic, in the sense that the Taylor series of such a function-germ cannot vanish, unless this function-germ is identically zero. Basic techniques of approximation theory, such as partitions of unity, therefore have to be excluded. On the other hand, the known proofs of Theorem 0.1 heavily rely on the algebraicity of the semialgebraic functions. This is the reason why we adopted a different approach, proving an approximation theorem for definable manifolds (Proposition 4.5).
We should nevertheless emphasize that our argument does not provide a new proof of Theorem 0.1 for we make use of this result. We will also provide a approximation theorem for functions (Theorem 4.6) that can be seen as a generalized version of Shiota’s result (see [S1, S2]) and an approximation theorem for Lipschitz functions (Theorem 3.2) with some uniform bounds for the Lipschitz constant of the approximations. This improves the results that were obtained in [Es, F2]. We wish to stress the fact that, if Theorems 3.2 and 4.6 are of their own interest, they are also definitely needed even if one is only interested in constructing approximations. The reason is that we shall need to prove an approximation theorem for manifolds, and this kind of result is less difficult to achieve in the category (see section 4.2).
The aim of this article being the generalization of Efroymson’s approximation theorem, we only focused on approximations of and functions. A systematic generalization of the method (to the order ) would however provide a theorem for functions with the approximation of the first derivatives, which would then be the subanalytic counterpart of Shiota’s theorem [S1, S2]. The cases and are nevertheless satisfying for most of the applications of Efroymson’s theorem. In particular, a byproduct of the main theorem of this article is that Mostowski’s separation theorem [Mo, BCR] holds in the subanalytic category. Embedding theorems for manifolds or applications to triviality of mappings could also be derived.
1. Framework and basic facts
Throughout this article, and stand for two integers. Given two functions and , we write if everywhere both functions are defined. Given a subset of on which both and are defined, we write “ on ”, if this inequality holds for all .
Given a function , with , will stand for the graph of . If is another function, we set
[TABLE]
The sets as well as and are defined analogously. We also set
[TABLE]
and define as well as and analogously.
Given , we denote by the Euclidean norm of and by the (Euclidean) distance of from the subset . If , we can then define a neighborhood of by setting:
[TABLE]
Unless otherwise specified, by “manifold” we will mean “manifold without boundary”. Manifolds (without boundary) can however also be considered as manifolds with boundary (which is then empty).
1.1. O-minimal structures.
A structure (expanding ) is a family such that for each the following properties hold
- (1)
is a Boolean algebra of subsets of . 2. (2)
If and then belongs to . 3. (3)
contains , where . 4. (4)
If then belongs to , where is the standard projection onto the first coordinates.
Such a family is said to be o-minimal if in addition:
- (5)
Any set is a finite union of intervals and points.
A set belonging to the structure is called a definable set and a map whose graph is in the structure is called a definable map.
A structure is said to be polynomially bounded if for each -function , there exists a positive number and such that for all .
Examples of polynomially bounded o-minimal structures are the semi-algebraic sets, the globally subanalytic sets [DD, LR] but also the so called -sets [M2, LR] as well as the structures defined by the quasi-analytic Denjoy-Carleman classes of functions [RSW]. We refer to [C, D] for basic facts about o-minimal structures.
We say that an o-minimal structure admits cell decomposition if for each definable function , open subset of , there is a definable open dense subset of of on which is .
All the just above mentioned examples of polynomially bounded o-minimal structures admit cell decomposition. Our theorems will therefore apply to these structures.
Throughout this article, will stand for a fixed polynomially o-minimal structure (expanding ) admitting cell decomposition. The term definable will refer to this structure. Since all the sets and mappings will be definable, we will often omit to mention it in the proofs. For the sake of completeness of statements, we however have chosen to emphasize it in the definitions, propositions, and theorems.
Given and , we denote by the set of definable mappings and by the set of definable functions , whereas will stand for the set of positive definable continuous functions on the set .
Given , we write (resp. ) for the elements of (resp. ) that are (a function will be said to be on if it extends to a function on an open neighborhood of in ).
1.2. Efroymson’s topology.
Given a mapping , with , , and we set:
[TABLE]
The * Efroymson topology* on is the topology for which a basis of neighborhoods of is given by the family . Efroymson’s theorem (Theorem 0.1) yields that is dense in in the semialgebraic category (for each definable set ).
Let now be a definable submanifold (possibly with boundary) and let , where is a definable submanifold of (possibly with boundary). We will write for the norm of (as a linear mapping) derived from the Euclidean norm . We will write for the function defined by . We then set
[TABLE]
and, given ,
[TABLE]
The * Efroymson topology* on is the topology for which a basis of neighborhoods of is given by the family . It was proved by M. Shiota that is dense in in the semialgebraic category [S1, S2] whereas Escribano showed that is dense in for [Es].
Let for positive and
[TABLE]
Since the are Nash functions, they all belong to .
Remark also that, since the structure is assumed to be polynomially bounded, by Łojasiewicz inequality, the sequences and converge to zero (in ). In particular, for every there is such that . As a matter of fact, a function lies in the closure of a set if and only if there is a sequence such that , for all . Of course, the analogous fact can be observed for the Efroymson topology.
We now state our approximation theorem:
Theorem 1.1**.**
For every definable submanifold of , is dense in for the Efroymson topology.
In other words, given any and , there is such that . As is dense in , this theorem follows from Theorem 4.6, which asserts that is dense in (for the Efroymson topology).
1.3. Lipschitz functions.
A function is Lipschitz if it is Lipschitz with respect to the metric induced by , i.e., if there is a constant such that . The smallest such constant is then called the Lipschitz constant of and is denoted . Every Lipschitz function , , may be extended to an -Lipschitz function defined as
[TABLE]
A straightforward computation yields the following fact that we will use all along this article: if is Lipschitz we have for
[TABLE]
The following related fact will be of service.
Lemma 1.2**.**
Given a positive constant , there are constants such that for all -Lipschitz functions and we have:
[TABLE]
where for we have set .
Proof.
We first check that the second inclusion holds for small enough and then we will check that the first one holds for small enough (with fixed). Observe that if satisfies then which implies for that so that for
[TABLE]
yielding the right-hand-side inclusion. Let us now fix a sufficiently small and show the left-hand-side inclusion. If satisfies for some then, by (1.2)
[TABLE]
so that for small enough
[TABLE]
which implies that for such , which, by (1.3), entails in turn that for small enough ∎
Definition 1.3**.**
We are going to define the Lipschitz cells of , which requires to first define the cells of inductively on . Every subset of is a cell. A definable subset is a cell of if there is a cell of such that one of the following conditions holds:
- (1)
with . 2. (2)
, where is either equal to or a function on , and is either equal or a function on satisfying .
We then call the basis of . Now, a cell is a Lipschitz cell if its basis is a Lipschitz cell and if in addition the functions appearing in its description (in or above) are Lipschitz. A Lipschitz open cell of is a Lipschitz cell of of dimension .
If is a Lipschitz open cell of and , we set:
[TABLE]
The following result is a well-known fact about definable sets which relies on the assumption of existence of cell decompositions. The stratification provided by this proposition will be useful in the proof of Theorem 3.2 and Proposition 4.2. Let us recall that a stratification of a set is a finite partition of this set into manifolds, called strata, such that the closure of one stratum is the union of some strata.
Proposition 1.4**.**
Given , there is a stratification of such that is on every stratum and such that each stratum is a Lipschitz cell after a possible orthonormal change of coordinates.
1.4. Pullback and pushforward.
Given two mappings and , with , we denote by the mapping induced by pull-back, i.e., the mapping defined by .
In the case where is a homeomorphism (onto its image) and is a mapping with we denote by the push-forward of , which is merely the pull-back of under .
2. Some preliminary lemmas
The lemmas listed in this section provide tools to construct definable functions. They rely on Efroymson’s approximation theorem and elementary facts. We recall that a semialgebraic function is called a Nash function.
Lemma 2.1**.**
There is a Nash function satisfying
- (1)
* whenever .* 2. (2)
* and whenever .* 3. (3)
There is a constant such that for all we have
[TABLE]
Proof.
Let be a piecewise polynomial function satisfying if and if . For set
[TABLE]
We first check that , for some constant independent of . Indeed, a simple computation of partial derivative yields such an estimate for and . Moreover, if then which implies that (for all ). We thus can assume , which entails , and we can conclude that there is a constant such that
[TABLE]
By Efroymson’s Theorem, we can find a Nash function on such that . This function has all the required properties. ∎
Lemma 2.2**.**
There is a Lipschitz Nash function such that
- (1)
For all we have , for all . 2. (2)
On the set , we have
[TABLE]
*where is the function defined by . *
Proof.
Let be a piecewise polynomial function satisfying if , if . Define first a one-variable function on by
[TABLE]
The desired function will be provided by an approximation of . We first check that is a Lipschitz function. It suffices to show that is bounded. Rewriting as
[TABLE]
we see that it is enough to prove that the function has bounded derivative. If or if then vanishes and it is easy to find a bound for the derivative (it is clear that is a Lipschitz function). We thus will focus on the couples satisfying . For such , a straightforward computation yields that the norm of the derivative of the function is not greater than , for some constant , and since , we see that the desired bound is easy to find.
We now claim that , for all such that . Indeed, if then , so that , which clearly belongs to the interval . If then, because both and belong to this interval, it is clear from the definition of that sits in this interval too, as claimed.
By Efroymson’s Theorem, we know that there is a function such that , on , where . Set then
[TABLE]
Since coincides with on the set , we see that clearly holds. Moreover, if then, because , we must have , which entails that , yielding . ∎
Lemma 2.3**.**
There is a Lipschitz Nash function such that on the set , we have
[TABLE]
where is the function defined by .
Proof.
Let be the Lipschitz mapping provided by Lemma 2.2 and set . Fix a positive constant and, for , set
[TABLE]
and let us check that if is chosen large enough then this mapping has the required properties.
Observe that and of Lemma 2.2 imply that
[TABLE]
Furthermore, since is positive for all , we have:
[TABLE]
We deduce that:
[TABLE]
for . Moreover, since is positive for all , we clearly have
[TABLE]
yielding that . A straightforward computation of derivative then yields that if is chosen sufficiently large then of Lemma 2.2 implies (2.7). ∎
We shall also need the following elementary fact.
Lemma 2.4**.**
Let , where is a open set, and let . There is such that for all and in , entails .
Proof.
For , let . This function is definable and bounded below away from zero on compact subsets of . Hence, there must be such that . ∎
3. Approximations of Lipschitz functions
In this section we establish that the definable Lipschitz functions are dense in the set of definable Lipschitz functions. We start with the following technical lemma.
Lemma 3.1**.**
Let be a Lipschitz open cell of and let . For each and in , there is , such that on .
Proof.
Fix two functions and in . Let be the image of under the orthogonal projection onto (so that ).
We are going to construct for each (by downward induction on ) a function which satisfies on for all (starting with ). The function will then be the desired approximation.
Let us fix and assume that has been constructed. The cell can be written where is either or a Lipschitz function on and is either or a Lipschitz function on satisfying .
We start with the case where and are both finite. We first check that we can assume, without loss of generality, that , i.e., that and . In fact, if denotes the diffeomorphism defined by , for , it suffices to prove the result for , assuming and .
Fix an integer , and set for :
[TABLE]
where is provided by Lemma 2.3. For every , we have , which means that . Hence, is a (well-defined) smooth function on .
We claim that if is chosen large enough on . For simplicity, let for and set
[TABLE]
so that we have on . We deduce that it suffices to show that we can make smaller than any given positive continuous function on by choosing large enough. But, in view of (2.7), this fact is clear. This proves the result in the case where and are finite.
We now address the case where one of the two functions, say , is infinite (if both are infinite then and there is nothing to prove). In this case, composing with the diffeomorphism if necessary, we see that we can assume that . We then define in the same way, just replacing the mapping provided by Lemma 2.3 with the mapping provided by Lemma 2.2, i.e., we set for :
[TABLE]
The same argument (simply replacing Lemma 2.3 with Lemma 2.2) then yields that if is chosen large enough then is a sufficiently close approximation of on . ∎
Theorem 3.2**.**
Let be a Lipschitz definable function, . For every there exists a Lipschitz function such that on . Moreover, the Lipschitz constant of can be bounded independently of the chosen function .
To prove this theorem, we shall need the following two propositions which will also be used in the proof of Proposition 4.2.
Proposition 3.3**.**
Given , there are positive constants and such that for every -Lipschitz functions and and every there is which satisfies:
- (1)
* on and on .* 2. (2)
* on and on .*
Proposition 3.4**.**
Let be a Lipschitz cell of of dimension . Given , there are positive constants and such that for every -Lipschitz function and each , we can find which satisfies:
- (1)
* on and on .* 2. (2)
* on and on .*
We wish to make two remarks about the statements of these two propositions which will be useful in the proofs.
Remark 3.5**.**
We assume that for convenience. What actually matters is that is bounded independently of and . This is the reason why we will not really care when the constructed function has values greater than . In particular, the constructed function will be the product of such functions although it takes higher values. Indeed, one can always compose the resulting function with a function that maps the image into .
Remark 3.6**.**
In Proposition 3.3 (resp. Proposition 3.4), we require on . In the proof we will sometimes just check it on (resp. ) since on the complement of this set the estimates of the derivative and will be better.
We are going to prove simultaneously Theorem 3.2 and Propositions 3.3 and 3.4, inductively on . We do this because, given , on the one hand we can show that the statement of Theorem 3.2 for variable functions implies Propositions 3.3 and 3.4 in (see steps 4 and 5 below) and we need, on the other hand, these two statements in to establish Theorem 3.2 for -variable functions (see step 6).
To start our induction, we thus just have to check Theorem 3.2 in , which is obvious. We therefore fix and assume that Theorem 3.2 holds for -variable functions.
Remark 3.7**.**
Given a Lipschitz function and , by our induction assumption, we know that there is satisfying . We can actually require in addition that . Indeed, since we know that for every we can construct a function satisfying (see (1.1) for ), it suffices to choose sufficiently big to have and then satisfies and .
Step 1**.**
Given definable Lipschitz functions and on , we show that there is a constant such that for each there is an -Lipschitz function such that on .
For , let . This defines a -Lipschitz function. Let also
[TABLE]
Thanks to our induction hypothesis, we know that for every , we can find a function such that . Moreover, again thanks to the induction hypothesis, this function may be required to be -Lipschitz, for some constant (independent of ).
We may regard the function as an -variable function, constant with respect to the last variable. If , by (1.2), we see that , which, by definition of , entails (since ). As a matter of fact, for all we have
[TABLE]
which, by (1.2), is smaller than if . This shows that has the required properties.
Step 2**.**
Given , we show that there is a constant such that for every -Lipschitz functions and , and every there is which satisfies:
- (i)
on and on . 2. (ii)
on and on .
Fix as well as some -Lipschitz functions and . By induction on , we know that we can find such that on :
[TABLE]
Moreover, our induction hypothesis also ensures that the Lipschitz constant of may be assumed to be bounded independently of . We can also assume (see Remark 3.7). For the same reason, there is a Lipschitz function such that , and again, by Remark 3.7, we can assume .
Let also be a -function such that . Define then a function by setting for every
[TABLE]
where is provided by Lemma 2.1, and let us check that the function has the required properties (i) and (ii).
If satisfies then , so that the first inequality of (i) follows from (1) of Lemma 2.1.
To check the second inequality, take which satisfies and notice that then
[TABLE]
which, thanks to (2) of Lemma 2.1, yields the claimed inequality.
It thus only remains to establish (ii). Notice for this purpose that if we set
[TABLE]
then is a Lipschitz mapping and we have . If then so that, by (2.5), which, since is Lipschitz, yields the first estimate of (ii). Furthermore, notice that there is a positive constant such that:
[TABLE]
which yields the second estimate of (ii).
Step 3**.**
We establish the statement of Proposition 3.3 for .
Fix a positive constant and denote by the corresponding constant provided by Lemma 1.2.
By step 2, there is a positive constant such that for each -Lipschitz functions and and each , we can find a function satisfying and on and on , and satisfying for all :
[TABLE]
where we have set for , .
Step 2 also entails that if is large enough, we can find, for every -Lipschitz functions and on and each , a function such that and on and on , and for which estimate (3.12) also holds (since we can apply step 2 to the function to get a function and set ).
But then the function defined as is a function satisfying:
- (1)
on and on . 2. (2)
on and on .
We claim that this function has the required properties (see Remark 3.5). Indeed, thanks to Lemma 1.2, we see that above implies of the proposition (it is enough to establish the desired statement for arbitrarily small functions ). Note also that, thanks to Lemma 1.2, the first estimate in implies the first estimate of .
Moreover, if is chosen small enough then yields the second estimate that appears in on the set . We thus only have to prove this inequality on . By Lipschitzness of , for all in this set we have , which implies that for such
[TABLE]
which by the second inequality of just above, establishes the second estimate of .
Step 4**.**
We establish the statement of Proposition 3.4 in the case where the cell is of type , where either is either or a Lipschitz function on and is or a Lipschitz function on satisfying .
We first assume that both and are finite. We shall use the same strategy as in the preceding step. The only difference is that we are now working with two functions and instead of one single function . Fix a positive constant as well as an -Lipschitz function and . Define then two -variable functions by setting for ,
[TABLE]
where is provided by Lemma 1.2.
By step 2, we know that we can find a function satisfying on the set and on the set , and such that
[TABLE]
Step 2 also entails that if is chosen large enough, we can find a function such that on and on (since we can apply step 2 to the function to get a function and set ), and such that
[TABLE]
We claim that the function has the desired properties (see Remark 3.5). Indeed, since on the set and on , it follows from Lemma 1.2 that on , for small enough (it is enough show that this inequality can be obtained for arbitrarily small functions ). As in addition we have on which, by Lemma 1.2 (and choices of and ), contains , we can see that (\ref{item_w_1}) holds.
By (3.13) and (3.14), we see that on , which, thanks to Lemma 1.2, already yields the first part of (\ref{item_w_2}).
It suffices to prove the second inequality of (\ref{item_w_2}) on (see Remark 3.6). Since it is enough to establish it for both and , we will focus on , the corresponding argument for being completely analogous.
By Lipschitzness of , for all in we have , which implies that for such
[TABLE]
which by (3.13) entails that on . On , this follows from the first inequality of (3.13).
To complete the proof of step 4, note that in the case where (resp. ) is infinite, the function (resp. ) has all the required properties.
Step 5**.**
We establish the statement of Proposition 3.4 for .
Let , , where is the canonical projection. For every , we can write as where is either or a Lipschitz function on and is either or a Lipschitz function on satisfying .
We can extend and to Lipschitz functions and on satisfying , and then, regarding these extensions as constant with respect to the last variables, to Lipschitz functions on . Set then
[TABLE]
where means that the coordinate is omitted.
It now follows from Step 4 that for each , each -Lipschitz function and each , there is a function on satisfying on the set and on the set , and satisfying on as well as (for some constants and independent of and ). Indeed, Step 4 ensures that this fact holds for , and, since we can interchange the and the coordinates, we see that this is true as well for all the .
But since , this implies that the function has all the required properties (see Remark 3.5).
Step 6**.**
We prove the statement of Theorem 3.2 for , completing the induction step.
Fix a Lipschitz function , . The function can be extended to an -Lipschitz function on (still denoted ). For large enough, we shall construct a Lipschitz function satisfying , with independent of . As the Lipschitz constant of will be bounded independently of , this will be enough for our purpose.
Let be a stratification of as provided by Proposition 1.4. We denote by the collection of all the strata of that are maximal, in the sense that they do not lie in the closure of another stratum. We denote by the set constituted by all the strata of of dimension and by the set of the strata of that are of positive codimension. Hence, .
Let . Up to an orthonormal change of coordinates, is the graph of some Lipschitz function , where is a Lipschitz cell of . As no confusion may arise, we will identify with the graph of . We can extend to an -Lipschitz function defined on .
By step 1, there is a constant such that for every and every , there is a function which satisfies on
[TABLE]
Let be a constant bigger than all the , , and let be the constant obtained by applying Proposition 3.3 to this . Moreover, applying Proposition 3.4 to all the strata of (which are open Lipschitz cells after a possible orthonormal change of coordinates), we get a positive constant .
Fix now a stratum . By Lemma 3.1, for every , there is a function on which satisfies on
[TABLE]
Now, for sufficiently big we can set:
[TABLE]
We then are going to use the bump functions provided by Propositions 3.3 and 3.4 to construct the desired approximation by means of the .
Let for this purpose be an element of . As above, we will identify with the graph of . By Proposition 3.3, there exists a constant such that for every there is a function such that on the set , on the set , and on
[TABLE]
Let now denote a stratum of . By Proposition 3.4, there is a constant such that for every there is a function which satisfies on the set , on the set , and which satisfies (3.18) for some constant .
Set now
[TABLE]
Let us check that is the desired approximation. Observe first that the sets , , together with the sets , , cover . Therefore, for every , there is a stratum such that . This shows that , which proves that , for each . By (3.17), this implies that for every we have on
[TABLE]
By (3.15), we deduce that on we have for such a stratum:
[TABLE]
with . Moreover, the same argument (replacing (3.15) with (3.16)) yields the same estimate for the strata of . As a matter of fact, we can write:
[TABLE]
for some constant (independent of ). It thus remains to establish the Lipschitz character of . We shall provide a bound for its derivative.
Observe for this purpose that by definition of we have for in an open dense subset of :
[TABLE]
We first check that is bounded independently of . This is clear if is a stratum of since both and are bounded. In the case where , by (3.16), we see that is bounded on . On the complement of this set, because , by (3.17), we see that the result is also clear. It thus suffices to check that is bounded as well.
We first deal with the case where belongs to . Remark that, thanks to (3.18), a straightforward computation of derivative shows that there is a constant (independent of ) such that we have:
[TABLE]
By (3.15), we see that this inequality already shows that is bounded on .
On the complement of this set, because we have , a direct computation of derivative shows that there is a constant such that we have
[TABLE]
which clearly entails that is bounded on .
We now address the case of a stratum of . On , we have , an since (3.22) holds for the strata of as well, we see that is bounded on this set. Moreover, on the complement of this set, because we have we see that (3.23) holds for , which entails that is a bounded function.
4. -approximations of functions
We prove in this section that is dense in , for submanifold of . We will first prove it in the case where the considered manifold is (Proposition 4.2) in order to derive it for an arbitrary definable submanifold of (Theorem 4.6).
4.1. The case .
The strategy is somehow similar to the one used in the proof of Theorem 3.2. We shall however need approximations with sharp estimates on the derivative. This motivates the following definition.
Definition 4.1**.**
Let and take and in . Given , we say that a function induces a -approximation of on if we have and on .
Proposition 4.2**.**
* is dense in for the Efroymson topology.*
Proof.
We prove the result by induction on , starting at , for which the statement is vacuous. Let and . We split the induction step into two steps.
Step 1**.**
Given a Lipschitz function and , we show that there exists such that for each satisfying , there is which induces a -approximation of on , where .
We first reduce it to the case , i.e., we establish the claimed statement in general assuming it to be true in the particular case where is identically zero. By Theorem 3.2, there is a Lipschitz function on satisfying on , where
[TABLE]
Moreover, we can assume to be Lipschitz with a Lipschitz constant bounded independently of and .
Let us define a diffeomorphism by and set . Apply the case to the function to get a function which induces a -approximation of on (for each with sufficiently small). Let then and observe that since on , we already see that on . Since , we also see that contains . Moreover,
[TABLE]
As is bounded independently of and , this completes our reduction.
We now shall prove the result in the case where . Fix and let be a function satisfying . Such a function being -Lipschitz, it is easily checked that on we have:
[TABLE]
By Lemma 2.4, if is a small enough function then for all and in satisfying we have:
[TABLE]
For , let
[TABLE]
By induction on , there are and in such that we have:
[TABLE]
where is as in (4.24) (with ). Define then by setting
[TABLE]
We shall show that if is sufficiently small then the function has the desired properties, i.e., we shall check that for small enough we have on :
[TABLE]
Observe first that it follows from (4.26) that for small enough we have for all :
[TABLE]
Applying Taylor’s formula to , we see that there is a function on with such that for all :
[TABLE]
For , thanks to the definition of , we can deduce
[TABLE]
By (4.27), the first term of the sum which appears in the right-hand-side of this inequality is smaller than , and by (4.29), the second one is smaller than , for all . Since (by (4.25)) and (by (4.24)) on , this shows that on this set.
It thus only remains to prove the corresponding estimate for the derivative, i.e., that on for small enough. We first check that, for small enough, we have for each :
[TABLE]
To see this, observe that a computation of derivative yields that for each :
[TABLE]
where, we have set for simplicity . Since is , the function tends to zero (in ) as tends to [math] and the sequence function is bounded (in ). Consequently, tends to zero in as goes to zero. For small enough, this function is thus smaller than , which, via the second inequality of (4.27), establishes (4.31).
Observe then that by definition of we have for each :
[TABLE]
and therefore
[TABLE]
which, due to (4.27), (4.31), and (4.26), must be smaller than for all satisfying and each . Finally, note that
[TABLE]
which, thanks to (4.27) and (4.29), must be smaller than for all . This yields the result in the case where , completing step 1.
Step 2**.**
We perform the induction step of the proof.
We shall make use of the same method as in the last step of the proof of Theorem 3.2. Let be a stratification of as provided by Proposition 1.4. We denote by the collection of all the strata of that are maximal, in the sense that they do not lie in the closure of another stratum of positive codimension. We denote by the set constituted by all the strata of of codimension [math] and by the set of the strata of that are of positive codimension. Hence, .
Let . Up to an orthonormal change of coordinates, is the graph of some Lipschitz function , where is a Lipschitz cell of . As no confusion may arise, we will identify with the graph of . We can extend to a Lipschitz function defined on . Given , set (where is as in (1.1)).
By step 1, for every large enough there is a function which satisfies on :
[TABLE]
By Lemma 1.2, there is a positive real number such that (since the stratification is finite, we may choose the same for all the strata).
Fix now a stratum . Let be a constant bigger than all the , , and let be the constant obtained by applying Proposition 3.3 to this . Moreover, applying Proposition 3.4 to each stratum of (which are open Lipschitz cells after a possible orthonormal change of coordinates), we get a positive constant .
By Lemma 3.1, for every , there is a function on which satisfies on , ,
[TABLE]
Now, for sufficiently big we can set:
[TABLE]
Let now again be an element of . As above, we will identify with the graph of . By Proposition 3.3, there exists a constant such that for every there is a function such that on the set , on the set , and which satisfies (3.18) on .
Let now denote a stratum of . By Proposition 3.4, there is a constant such that for every there is which satisfies on the set , on the set , and which satisfies (3.18) for some constant .
We now define the functions , , and as in (3.19) (for some large enough). Let us check that is the desired approximation.
Observe first that the sets , , together with the sets , , cover . Therefore, for every , there is a stratum such that . This shows that , which proves that , for each . We deduce that for every we have on
[TABLE]
By (4.33), we deduce that we have for such (on the whole of ):
[TABLE]
Moreover, the same argument (replacing (4.33) with (4.34), yields the analogous estimate holds for the strata of . As a matter of fact, we can write:
[TABLE]
for some constant (independent of ). This already yields the desired estimate for . It remains to prove the analogous estimate for .
In view of (3.21), it is clear that it suffices to show that for all we have for
[TABLE]
and
[TABLE]
for some constant independent of .
We first focus on (4.37), starting with the case where the stratum belongs to . Remark that, because (3.18) holds for , inequality (3.22), which comes down from this estimate, must hold as well. By (4.33), we see that this inequality already shows that estimate (4.37) holds on .
On the complement of this set, because we have , a direct computation of derivative shows that there is a constant such that we have
[TABLE]
This shows (4.37) for the strata of .
We now prove (4.37) in the case of a stratum of . On , because by (4.34) we have , and since (3.22) holds (again this inequality follows from (3.18) which holds for ), we see that
[TABLE]
yielding (4.37) on this set. Moreover, on the complement of this set, because we have , writing the same computation as in (4.39), we get (4.37).
It remains to prove (4.38). We start with the case where the stratum belongs to . By (4.33) we see that the desired estimate holds on (since ). On the complement of this set, since , we can write:
[TABLE]
yielding (4.38) for the strata of .
We now address the case where belongs to . For such a stratum, inequality (4.34) shows that the desired estimate holds on . On the complement of this set, because , we see that computation which is carried out in (4.40) yields the desired estimate. ∎
4.2. Approximations on submanifolds of
The idea is to first establish the desired theorem for a closed definable manifold with boundary of (Proposition 4.3). We then make use of this result to show that every definable manifold has a closed embedding (Proposition 4.5).
Given a definable submanifold of , , there is a definable neighborhood of in and a definable retraction such that for all , is the point that realizes the distance from to . The vector is then orthogonal to the tangent space to at and we say that is a tubular neighborhood of . The mapping is at least and, if is , then so is .
We also recall that a definable function on a set is said to be on , , if it extends to a function on an open neighborhood of in .
Proposition 4.3**.**
Let , where is a closed submanifold with boundary of and a submanifold of . Given , there is satisfying on .
Proof.
Since is closed, the mapping extends to a mapping . By Proposition 4.2, for every there is a mapping such that on . Let be a tubular neighborhood of and let be a closed neighborhood of in . If is chosen sufficiently small then , for all , and we can set for such , . Given , if we choose sufficiently small then will be smaller than on . ∎
The idea to show Proposition 4.5 is to first construct a embedding that we will approximate by a embedding. We thus shall need the following approximation result for manifolds, which is inspired from the techniques developed to study Nash compact manifolds [BCR].
Proposition 4.4**.**
Given a closed definable submanifold of , there is a definable diffeomorphism , with definable closed submanifold of . This embedding can be chosen arbitrarily close to the identity in the sense that, given , we can require that for all and all unit vector :
[TABLE]
Proof.
Let be the Grassmannian of -dimensional vector subspaces of , where , and
[TABLE]
Denote by the vector bundle defined by . We will regard as a submanifold of , for some . Let be a tubular neighborhood of and the mapping that assigns to every element the vector space . Define then a mapping by . Taking smaller if necessary, we can assume that it is a closed manifold with boundary. By Proposition 4.3, for every , there is a mapping satisfying . The mapping is transverse to the zero section of the vector bundle and we have . Consequently, if the approximation is good enough, this mapping is also transverse to the zero section of the vector bundle and the set
[TABLE]
is a closed submanifold of . Moreover, if the approximation is good enough the mapping induces a diffeomorphism from onto isotopic to the identity map. ∎
Proposition 4.5**.**
Every definable submanifold of is definably diffeomorphic to a closed definable submanifold of .
Proof.
Let be a submanifold of and let be the positive continuous function defined by . As is dense in , we can take a function such that . The function is positive and tends to zero as tends to the frontier of . Let us denote by the graph of the function and note that this subset is a closed submanifold of . By Proposition 4.4, for every , there is a submanifold of and a diffeomorphism for which (4.41) holds.
Notice that the canonical projection induces (by restriction) a diffeomorphism . For sufficiently small, the mapping therefore also induces (by restriction again) a diffeomorphism . ∎
Theorem 4.6**.**
If is a definable submanifold of then is dense in for the Efroymson topology.
Proof.
By Proposition 4.5, we can assume that is closed. The result then follows from Proposition 4.3. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[BCR] J. Bochnak, M. Coste, and M.-F. Roy, Géométrie algébrique réelle, Springer 1987.
- 2[C] M. Coste, An introduction to o-minimal geometry, Dip. Mat. Univ. Pisa, Dottorato di Ricerca in Matematica, Istituti Editoriali e Poligrafici Internazionali, Pisa (2000).
- 3[D] L. van den Dries, Tame topology and o-minimal structures, London Mathematical Society Lecture Note Series, 248. Cambridge University Press, Cambridge, 1998.
- 4[DD] J. Denef, L. van den Dries, p-adic and real subanalytic sets, Ann. of Math. (2) 128 (1988), no. 1, 79–138.
- 5[E] G. Efroymson, The extension theorem for Nash functions, Real algebraic geometry and quadratic forms (Rennes, 1981), pp. 343–357, Lecture Notes in Math., 959, Springer, Berlin-New York, 1982.
- 6[Es] J. Escribano, Approximation theorems in o-minimal structures, Illinois J. Math. 46 (2002), no. 1, 111–128.
- 7[F 1] A. Fischer, Smooth functions in o-minimal structures, Adv. Math. 218 (2008), no. 2, 496–514.
- 8[F 2] A. Fischer, Approximation of o-minimal maps satisfying a Lipschitz condition, Ann. Pure Appl. Logic 165 (2014), no. 3, 787–802.
