This paper develops algorithms to determine when a system of linear equations with semialgebraic function coefficients has a $C^m$ solution, by identifying a finite set of differential operators that characterize solvability.
Contribution
It introduces algorithms for computing differential operators that characterize the existence of $C^m$ solutions to systems with semialgebraic coefficients.
Findings
01
Algorithms for computing differential operators are provided.
02
Characterization of solvability via annihilation by differential operators.
03
Applicable to systems with semialgebraic function coefficients.
Abstract
Fix m≥0, and let A=(Aij(x))1≤i≤N,1≤j≤M be a matrix of semialgebraic functions on Rn or on a compact subset E⊂Rn. Given f=(f1,⋯,fN)∈C∞(Rn,RN), we consider the following system of equations \begin{equation} \sum_{j=1}^{M}A_{ij}\left( x\right) F_{j}\left( x\right) =f_{i}\left( x\right) \text{ }\left( i=1,\cdots ,N\right) \text{.} \end{equation} In this paper, we give algorithms for computing a finite list of linear partial differential operators such that AF=f admits a Cm(Rn,RM) solution F=(F1,⋯,FM) if and only if f=(f1,⋯,fN) is annihilated by the linear partial differential operators.
\tilde{E}=\left\{\begin{array}[]{c}\left(x_{1},\cdots,x_{n},\underline{x}_{1},\cdots,\underline{x}_{n}\right)\in E\times\underline{E}:\left(\underline{x}_{1},\cdots,\underline{x}_{n}\right)\text{ is at least as close as}\\
\text{any point of }\underline{E}\text{ to }\left(x_{1},\cdots,x_{n}\right)\end{array}\right\},
\tilde{E}=\left\{\begin{array}[]{c}\left(x_{1},\cdots,x_{n},\underline{x}_{1},\cdots,\underline{x}_{n}\right)\in E\times\underline{E}:\left(\underline{x}_{1},\cdots,\underline{x}_{n}\right)\text{ is at least as close as}\\
\text{any point of }\underline{E}\text{ to }\left(x_{1},\cdots,x_{n}\right)\end{array}\right\},
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.
Full text
Solutions to A System of Equations for Cm Functions
Charles Fefferman, Garving K. Luli
The first author is
supported in part by NSF Grant DMS-1608782, AFOSR Grant FA9550-12-1-0425,
and Grant No 2014055 from the United States-Israel Binational Science
Foundation. The second author is supported by NSF Grant DMS-1554733.
1. Introduction
Here and in [11], we study systems of linear equations
[TABLE]
for unknown functions F1,⋯,FN∈Cm(Rn) for fixed m.111Cm(Rn)
denotes the vector space of m-times continuously differentiable functions Rn, with no growth conditions assumed at infinity. Similarly, Cm(Rn,RD) denotes the space of all
such RD-valued functions on Rn. These notations
remain in force during the introduction, but will be changed later.
Because m is fixed, we’re not allowed to lose derivatives.
The most interesting systems (1.0.1) are underdetermined. An example
due to Epstein and Hochster [5] is the single equation
[TABLE]
for unknown continuous functions F1,F2,F3 on R3.
For a system of the form (1.0.1), we pose three problems.
Problem 1**.**
Suppose the Aij and fi are given functions. For
fixed m, how can we decide whether (1.0.1) admits a solution F=(F1,⋯,FM)∈Cm(Rn,RM)?
Problem 2**.**
Suppose the Aij are given polynomials. For fixed m,
the vectors f=(f1,⋯,fN) of polynomials f1,⋯,fN for which (1.0.1) admits a Cm solution F
form a module M over the ring R of polynomials on Rn. Exhibit generators for M.
Problem 3**.**
Suppose the Aij and fi are polynomials and suppose (1.0.1) admits a Cm solution F. Can we take our Cm
solution F to be semialgebraic?
For m=0, these problems were posed by Brenner [3], and
Epstein-Hochster [5], and solved by Fefferman-Kollár [8] and Kollár [12].
In particular, for m=0, the answer to Problem 3 is
affirmative; F∈C0 can be taken to be semialgebraic. An example in
Kollár-Nowak [13] shows that it isn’t always possible to
take F1,⋯,FN to be rational functions. See Brenner-Steinbuch [4], Kollár [12], Kollár-Nowak [13], and
Kucharz-Kurdyka [14] for several related questions and
results.
For m≥1, Problem 1 was solved in Fefferman-Luli [9], with no restriction on the functions Aij, fi.
In this paper and [11], we solve Problem 2
for m≥1.
We needn’t assume that the given matrix elements Aij are polynomials;
we may take them to be (possibly discontinuous) semialgebraic functions.
Observe that Problem 2 can’t be solved using only analysis,
because it concerns generators for a module over a polynomial ring. On the
other hand, it can’t be solved using only algebra, because it concerns Cm functions. To make a clean splitting into an analysis problem and an
algebra problem, we pose the analogue of Problem 2 for vectors f=(f1,⋯,fN) of C∞ functions.
Problem 4**.**
Fix a nonnegative integer m and a matrix (Aij) of semialgebraic functions on Rn. Characterize
all the f=(f1,⋯,fN)∈C∞(Rn,RN) for which (1.0.1) admits a Cm-solution.
To illustrate our result on Problem 4, consider the
Epstein-Hochster equation (1.0.2), for unknown continuous F1,F2,F3. For f∈C∞(R3), one
checks that a continuous solution exists if and only if f satisfies
[TABLE]
Note that a third derivative of f enters into (1.0.3), even though
we are merely looking for solutions F=(F1,F2,F3)∈C0.
For general systems (1.0.1), our result on Problem 4 is
as follows.
Theorem 1**.**
Fix m≥0, and let (Aij(x))1≤i≤N,1≤j≤M be a matrix of semialgebraic
functions on Rn. Then there exist linear partial differential
operators L1,L2,⋯,LK, for which the following hold.
•
Each Lν acts on vectors f=(f1,⋯,fN)∈C∞(Rn,RN), and has the
form
[TABLE]
where the coefficients aνiα are semialgebraic. (Perhaps mˉ>m.)
•
Let f=(f1,⋯,fN)∈C∞(Rn,RN). Then the system (1.0.1) admits a
solution F=(F1,⋯,FM)∈Cm(Rn,RM) if and only if Lνf=0 on Rn for
each ν=1,⋯,K.
For the Epstein-Hochster equation (1.0.2), with m=0, the operators Lν are
[TABLE]
where I denotes the indicator function. (Compare with (1.0.3).)
Our proof of Theorem 1 is constructive. In principle, we can
compute the operators Lν from the data m, (Aij(x))1≤i≤N,1≤j≤M.
In [11], we apply Theorem 1 to solve
Problem 2. The idea is as follows.
Given linear partial differential operators L1,⋯,LK with
semialgebraic coefficients (not necessarily given by Theorem 1), we introduce the R-module of all polynomial vectors
[TABLE]
and for every polynomial P. (Recall R is the ring of
polynomials on Rn.) Let us call this R-module M(L1,⋯,LK).
If, as in Theorem 1, the polynomial vectors f annihilated by
the Lν already form an R-module, then that R-module coincides with M(L1,⋯,LK).
In particular, the module M in Problem 2 satisfies M=M(L1,⋯,LK) for the L1,⋯,LK given by Theorem 1.
Consequently, Problem 2 is reduced to the following problem of
computational algebra.
Problem 5**.**
Given linear partial differential operators L1,⋯,LK with semialgebraic coefficients, exhibit generators for the R-module M(L1,⋯,LK).
We solve Problem 5 in [11], completing the
solution of Problem 2.
Thus, by posing Problem 4, we have split Problem 2
into an analysis problem and an algebra problem.
Let us sketch the proof of Theorem 1. We oversimplify to bring
out the main ideas. The correct discussion appears in Sections 2, ⋯, 8 below.
To prepare the way, we introduce notation. For x∈Rn and F∈Cm(Rn,RD), we write Jx(m)F (the “m-jet” of F at x) to
denote the mth order Taylor polynomial of F at x.
Thus, Jx(m)F belongs to P(m)(Rn,RD), the vector space of all RD-valued polynomials of degree at most m on Rn.
If D=1, we write P(m)(Rn) in place of P(m)(Rn,R).
For F,G∈Cm(Rn) and x∈Rn,
we have Jx(m)(FG)=Jx(m)F⊙xJx(m)G, where P⊙xQ:=Jx(m)(PQ) for P,Q∈P(m)(Rn). The multiplication ⊙x makes P(m)(Rn) into a ring Rx(m), the “ring of m-jets at x”. Similarly, the
multiplication Q⊙x(P1,⋯,PM):=(Q⊙xP1,⋯,Q⊙xPM) makes P(m)(Rn,RM) into an Rx(m)-module.
We can now explain our solution [9] to Problem 1;
later, we will apply what we have learned to Problem 4. Thus,
let us fix m≥0, and let Aij and fi be given functions. We
investigate whether (1.0.1) has a solution F∈Cm(Rn,RM).
The idea is to construct families H=(Hx)x∈Rn of affine subspaces Hx⊂P(m)(Rn,RM), such that any Cm solution of (1.0.1) necessarily satisfies
[TABLE]
To start with, we can simply take
(1.0.5)
H=(H^x)x∈Rn,
where
[TABLE]
We allow the empty set as an affine subspace of P(m)(Rn,RM). This can already
happen for H given by ((1.0.5)), if equations (1.0.1) are inconsistent for some x. Obviously, (1.0.4)
cannot hold if some of the Hx are empty.
The nonempty Hx arising in our families H will have a
special form; they are translates of Rx(m)-submodules of P(m)(Rn,RM).
Thus,
(1.0.7)
H=(Hx)x∈Rn, where for each x,
either Hx is empty, or Hx=Px+I(x), where Px∈P(m)(Rn,RM)
and I(x)∈P(m)(Rn,RM) is an Rx(m)-submodule.
We call any H of the form ((1.0.7)) a “bundle”, and we call F∈Cm(Rn,RM)
a “section” of the bundle H if (1.0.4)
holds. Also, if H=(Hx)x∈Rn and
H′=(Hx′)x∈Rn
are bundles, then we say that H′ is a “subbundle” of H if Hx′⊂Hx if all x∈Rn. We write H⊃H′ to
indicate that H′ is a subbundle of H.
We call Hx0 the “fiber” of H=(Hx)x∈Rn at x0.
Immediately from the definition ((1.0.5)), we see that a Cm
solution of the system (1.0.1) is precisely a section of the bundle H. Therefore, Problem 1 is a special case
of the following.
Problem 6**.**
Given a bundle H, decide whether H has a section.
We solve this problem using the notion of “Glaeser
refinement”. The idea is as follows. Let H=(Hx)x∈Rn be a bundle, and let x0∈Rn. By
definition, any section F of H must satisfy Jx0(m)F∈Hx0. However, Hx0 may contain polynomials P0∈P(m)(Rn,RM) that can never arise as the m-jet at x0 of any section.
In that case, we may replace H by a subbundle H~ without losing any sections. Let us see how such an H~ can be
defined.
Fix x0∈Rn and P0∈Hx0. Suppose F is a
section of H, with Jx0(m)F=P0. Fix a
large integer constant k (determined by m,n,M), and let x1,⋯,xk∈Rn lie close to x0.
Setting Pi=Jxi(m)F for i=1,⋯,k, we have P1∈Hx1,P2∈Hx2,⋯,Pk∈Hxk, and
(1.0.9)
∑0≤i<j≤k∑∣α∣≤m(∣xi−xj∣m−∣α∣∣∂α(Pi−Pj)(xj)∣)2→0 as x1,⋯,xk→x0, by Taylor’s theorem.
Note that P0,⋯,Pk enter into ((1.0.9)), but P0 plays
a different rôle from P1,⋯,Pk.
The above remarks lead us to define the Glaeser refinement of the bundle H=(Hx)x∈Rn by setting G(H)=(H~x)x∈Rn, where for each x0∈Rn, H~x0 consists of those P0∈Hx0 such that
(1.0.11)
min{∑0≤i<j≤k∑∣α∣≤m(∣xi−xj∣m−∣α∣∣∂α(Pi−Pj)(x0)∣)2:P1∈Hx1,⋯,Pk∈Hxk} tends to zero
as x1,⋯,xk→x0.
The Glaeser refinement has three basic properties.
•
G(H) is a subbundle of H.
•
G(H) and H have the
same sections, as we saw above.
•
G(H) can in principle be computed
from H, thanks to the explicit nature of ((1.0.11)).
Note that G(H) may have empty fibers,
even if H has none. In that case, we know that H has
no sections.
Starting from a given bundle H, we can now perform
“iterated Glaeser refinement” to pass to ever smaller
subbundles H(1),H(2),
etc., without losing sections. We set H(0)=H, and for l≥0, we set H(l+1)=G(H(l)). Thus, by an
obvious induction on l, H=H(0)⊃H(1)⊃H(2)⊃⋯, yet H and H(l) have the
same sections.
Solution to Problem 6: For a large
enough integer constant * l∗ determined by m,n,M, the following holds. *
Let H be a bundle, and let H(0),H(1),H(2),⋯ be its iterated Glaeser refinements. Then H has a section if and only if H(l∗) has no empty fibers.
In particular, this solves Problem 1 for systems of equations (1.0.1). This concludes our discussion of Problem 1.
We now want to apply the above to Problem 4. To do so, we have
to understand how the iterated Glaeser refinements arising from the bundle H in ((1.0.5)) depend on the right-hand side f=(f1,⋯,fN) in (1.0.1), assuming f∈C∞.
This gives rise to the study of bundles of the form
(1.0.13)
Hf=(T(x)Jx(mˉ)f+I(x))x∈Rn, where I(x)⊂P(m)(Rn,RM) is an Rx(m)-submodule depending
semialgebraically on x, and T(x):P(mˉ)(Rn,RN)→P(m)(Rn,RM) is a linear
map, also depending semialgebraically on x.
We want to understand how the Glaeser refinement of the bundle Hf in ((1.0.13)) depends on f∈C∞. In particular, we
want to know when that Glaeser refinement has no empty fibers. Under
suitable assumptions on T(x) in ((1.0.13)), we prove the
following:
(1.0.15)
The
fibers of G(Hf) are all non-empty if
and only if f is annihilated by finitely many linear partial differential
operators L1,⋯,LK with semialgebraic coefficients.
(1.0.17)
If the
fibers of G(Hf) are all non-empty,
then G(Hf) again has the form ((1.0.13)), possibly with a smaller I(x), a larger mˉ, and a
different T(x).
This allows us to keep track of the f-dependence of the iterated Glaeser
refinements of the bundle H in ((1.0.5)), thus
proving Theorem 1.
Let us say a few words about the proof of ((1.0.15)) and ((1.0.17)).
Because a quadratic form in ((1.0.11)) lies at the heart of the matter,
we have to understand quadratic forms acting on the jets of a function f∈C∞(Rn,RN) at points x1,⋯,xk∈Rn. More precisely, suppose we are given
a positive semidefinite quadratic form
(1.0.19)
(P0,P1,⋯,Pk)↦Q(x0,P0,x1,P1,⋯,xk,Pk) depending
semialgebraically on points x1,⋯,xk∈Rn. Here, P0∈P(m)(Rn,RM), while P1,⋯,Pk∈P(mˉ)(Rn,RN).
We fix x0,P0, and let x1,⋯,xk vary. We have to
characterize the functions f∈C∞(Rn,RN) such that Q(x0,P0,x1,Jx1(mˉ)f,⋯,xk,Jxk(mˉ)f)→0 as x1,⋯,xk→x0.
Section 3.2 contains our results on this problem,
namely Propositions 2 and 3. These propositions are
proven by induction on the dimension of a relevant semialgebraic set. To
make the induction work, we have to allow our quadratic form ((1.0.19))
to depend on additional points z1,⋯,zL. We refer the reader to
Section 4 for full details. Section 4 contains the
main work in our proof of Theorem 1.
We will first establish the following variant of Theorem 1.
Theorem 2**.**
Let E⊂Rn be compact,
semialgebraic. Let (Aij(x))1≤i≤N,1≤j≤M be a matrix of semialgebraic functions defined on E. Let
m≥0 be given. Then there exist linear partial differential operators Lν(1≤ν≤νmax), for which the
following hold.
•
Each Lν has semialgebraic coefficients and carries functions
in C∞(Rn,RN) to
scalar-valued functions on Rn.
•
Let f=(f1,⋯,fN)∈C∞(Rn,RN). Then there exist F1,⋯,FM∈Cm(Rn) such that
[TABLE]
all x∈E, i=1,⋯,N
if and only if Lνf=0 on E for all ν=1,⋯,νmax.
In Section 8, we show how to pass from the compact case
to the noncompact case, and thus establish Theorem 1.
This concludes our explanation of the proof of Theorem 1. We
again warn the reader that the explanation is oversimplified, and that the
true story is to be found in Sections 2, ⋯, 8 below.
We should also warn the reader that although our results solve Problems 1 and 2 in principle, the calculations involved are
prohibitive in practice, except in the simplest cases.
We are grateful to Matthias Aschenbrenner, Saugata Basu, Edward Bierstone,
Zeev Dvir, János Kollár,
Pierre Milman, Wieslaw Pawłucki, Ary Shaviv and the participants in the 9th-11th Whitney workshops for valuable discussions, and to the
Technion – Israel Institute of Technology, College of William and Mary, and
Trinity College Dublin, for hosting the above workshops.
2. Preliminaries
2.1. Notation
P(m)(Rn,RD) denotes the
vector space of RD-valued polynomials of degree at most m on
Rn. If D=1, we may write P(m)(Rn) in place of P(m)(Rn,R).
We depart from the notation used in the Introduction. From now on, Cm(Rn,RD) denotes the space of all RD-valued functions on Rn whose derivatives up to
order m are continuous and bounded on Rn; Clocm(Rn,RD) denotes the space of RD-valued functions on Rn with continuous derivatives up to order m; C0∞(Rn,RD) denotes the space of
infinitely differentiable RD-valued functions of compact support
on Rn; C∞(Rn,RD)
denotes the space of infinitely differentiable RD-valued
functions on Rn. If D=1, we write Cm(Rn),C∞(Rn),C0∞(Rn) in place of Cm(Rn,RD),C∞(Rn,RD),C0∞(Rn,RD), respectively.
If F∈Cm(Rn,RD) and x∈Rn, then Jx(m)F (the “m-jet” of F at x) denotes the mth order Taylor polynomial of F at x.
We write πxm′→m:P(m′)(Rn,RD)→P(m)(Rn,RD) for the natural
projection from m′-jets at x to m-jets at x(m′≥m).
2.2. A simple consequence of Taylor’s Theorem
Let F∈Cmˉˉ(Rn,RD),
let mˉˉ≥mˉ, and let x,y∈Rn. Then for ∣α∣≤mˉ, we have
[TABLE]
The quantity (2.2.1) has absolute value (i.e. norm in RD) at
most
[TABLE]
by Taylor’s theorem, with C0 depending only on mˉˉ,n,D.
Therefore, the following holds:
Proposition 1**.**
[TABLE]
where C depends only on mˉˉ,n,D.
2.3. Semialgebraic sets and functions
Let A:E→R, where E⊂RN is
semialgebraic. Recall that A is a semialgebraic function if its graph {(x,y)∈E×R:y=A(x)} is semialgebraic. In particular, semialgebraic functions needn’t be continuous.
Note that, by definition, a semialgebraic function is finite everywhere on E. Thus, the following functions are not semialgebraic on R:
The dimension of a semialgebraic set E⊂Rn
is the maximum of the dimensions of all the imbedded (not necessarily
compact) submanifolds of Rn that are contained in E.
For instance, in R3, the union of the x-y plane and the z
axis has dimension 2.
A map ϕ:E→RN is semialgebraic if {(x,y)∈E×RN:y=ϕ(x)} is a semialgebraic set.
Again, semialgebraic maps ϕ:E→RN are defined
everywhere on E.
2.4. Limits
Let E be a metric space, let f:E→R be a function,
and let x∈E be given. As every student knows, limy→xf(y)=L means that given ε>0 there exists δ>0 such that ∣f(y)−L∣<ε for all y∈E with dist(y,x)<δ.
We point out here that if x is an isolated point of E, then limy→xf(x)=L means simply that f(x)=L.
Note that the function
[TABLE]
defined on R, does not satisfy limy→0f(y)=0.
Similarly, if G⊂E×⋯×E, then the condition
[TABLE]
is defined in the usual way via ε’s and δ’s.
In particular, (2.4.1) holds vacuously if G fails to contain points
arbitrarily close to (x,x,⋯,x).
2.5. Computations with Semialgebraic Sets
In this section, we present some known technology for computations
involving semialgebraic sets. See the reference book [2].
We begin by describing our model of computation. Our algorithms are to be
run on an idealized computer with standard von Neumann architecture [17],
able to store and perform basic arithmetic operations on integers and
infinite precision real numbers, without roundoff errors or overflow
conditions. We suppose that our computer can access an ORACLE that solves
polynomial equations in one unknown. More precisely, the ORACLE answers
queries; a query consists of a non-constant polynomial P (in one variable)
with real coefficients, and the ORACLE responds to a query P by producing
a list of all the real roots of P.
Let us compare our model of computation with that of [2].
All arithmetic in [2] is performed within a subring Λ of a real
closed field K (e.g. the integers sitting inside the reals). However,
some algorithms in [2] produce as output a finite list of elements of
K not necessarily belonging to Λ. A field element x0 arising in
such an output is specified by exhibiting a polynomial P (in one
variable) with coefficients in Λ such that P(x0)=0, together with
other data to distinguish x0 from the other roots of P.
In our model of computation, we take Λ and K to consist of all real
numbers, and we query the ORACLE whenever [2] specifies a real number
by means of a polynomial P as above.
Next, we describe how we will represent a semialgebraic set E. We will
specify a Boolean combination of sets of the form
(2.5.1)
{(x1,⋯,xn)∈Rn:P(x1,⋯,xn)>0},
(2.5.3)
{(x1,⋯,xn)∈Rn:P(x1,⋯,xn)<0}, or
(2.5.5)
{(x1,⋯,xn)∈Rn:P(x1,⋯,xn)=0}
for polynomials P with real coefficients.
Of course it is possible to represent the same set E by many different
Boolean combination of the above form, but that doesn’t bother us.
We will specify a semialgebraic function by specifying its graph.
Given a semialgebraic set E⊂Rn, we compute its
dimension. (See Algorithm 14.31 in [2].)
•
Given a zero-dimensional (and consequently finite) semialgebraic set E⊂Rn, we compute a list of all the elements of E. (See Algorithm 16.20 in [2].)
•
Given a semialgebraic set, we produce a list of its connected components, exhibiting each component as a Boolean combination of sets of the form ((2.5.1)), ((2.5.3)), and ((2.5.5)). (See Algorithm 16.20 in [2].)
•
Given semialgebraic sets E1⊂Rn1, E⊂E1×Rn2, we check whether it is the case that
[TABLE]
If (2.5.7) holds, we compute a (possibly discontinuous) semialgebraic function F:E1→Rn2 such that (x,F(x))∈E for all x∈E1. (See Algorithm 11.3 as well as Section 5.1 in [2].)
Next, we discuss “elimination of quantifiers”, a powerful tool to show that
certain sets are semialgebraic, and to compute those sets.
The sets in question consist of all (x1,⋯,xn)∈Rn
that satisfy a certain condition Φ(x1,⋯,xn). Here, Φ(x1,⋯,xn) is a statement in a formal language, the “first order
predicate calculus for the theory of real closed fields”.
Rather than giving careful definitions, we illustrate with a few examples,
and refer the reader to [1, 2].
•
If E⊂Rn1×Rn2 is a given
semialgebraic set, and if π:Rn1×Rn2→Rn1 denotes the natural projection, then we can
compute the semialgebraic set πE, because πE consists of all (x1,⋯,xn1)∈Rn1 satisfying the condition
[TABLE]
•
Suppose E⊂Rn is semialgebraic. Then we can compute
Eclosure, the closure of E, because Eclosure
consists of all (x1,⋯,xn) satisfying the condition
[TABLE]
In particular, Eclosure is semialgebraic.
•
Let E,E⊂Rn be given semialgebraic
sets. Then we can compute the semialgebraic set
[TABLE]
because E~ consists of all (x1,⋯,xn,x1,⋯,xn)∈R2n satisfying the
condition
[TABLE]
With a single exception, all the semialgebraic sets and functions arising in
our arguments in the following sections can be computed by obvious
applications of the above standard algorithms, together with elimination of
quantifiers. When that exception arises (in the next section), we explain how to
deal with it.
2.6. Growth of Semialgebraic functions
We will use a special case of a result of Łojasiewicz and Wachta [15].
Theorem 3**.**
Let S1,S2⊂Rn×Rp be
compact semialgebraic sets. For x∈Rn, let Si(x)={y∈Rp:(x,y)∈Si}(i=1,2). Then there exists a positive
integer K for which the following holds.
Given x∈Rn such that S1(x)∩S2(x)=∅,
there exists a positive number C(x) such that
[TABLE]
for all y∈S1(x).
Remarks: The result of [15] applies to subanalytic sets. We need
only the semialgebraic case. Our notation differs from that of [15].
We will apply Theorem 3 to prove the following result.
Lemma 1** (Growth Lemma).**
Let E⊂Rn1 and E+⊂E×Rn2 be compact and semialgebraic, with dimE+≥1. Let A be a semialgebraic function on E+. Then there exist an
integer K≥1, a semialgebraic function A1 on E, and a compact
semialgebraic set E+⊂E+, with the following
properties.
**(GL1): **
dimE+<dimE+.
For x∈E, set E+(x)={y∈Rn2:(x,y)∈E+} and E+(x)={y∈Rn2:(x,y)∈E+}. Then, for each x∈E, the following hold.
**(GL2): **
If E+(x) is empty, then
[TABLE]
**(GL3): **
If E+(x) is non-empty, then
[TABLE]
Proof.
By replacing A(x,y) by 1+∣A(x,y)∣, we may suppose that A(x,y)≥1
for all (x,y)∈E+.
We define semialgebraic sets
•
S0={(x,y,A(x,y)1)∈Rn1×Rn2×R:(x,y)∈E+}.
•
S1= closure of S0 in Rn1×Rn2×R.
•
S2=E+×{0}⊂Rn1×Rn2×R.
In particular, S1,S2 are compact semialgebraic subsets of Rn1×Rn2×R, so Theorem 3 applies.
Observe that S1∩S2 has the form E+×{0} for
a compact semialgebraic set E+⊂E+. Moreover, S1∩S2⊂S0closure∖S0, hence dimE+=dimS1∩S2≤dim(S0closure∖S0)<dimS0=dimE+.
Thus, dimE+<dimE+.
Now let x∈E be given. We write E+(x)={y∈Rn2:(x,y)∈E+}.
Case 1: Suppose E+(x)=∅. Then S1(x)∩S2(x)=∅.
Therefore, S0(x) avoids a neighborhood of S2(x) in Rn1×Rn2×R, which implies that A(x,y)1 avoids a neighborhood of zero as y varies over E+(x).
We thank M. Aschenbrenner and W. Pawłucki for pointing out that Lemma 1 follows easily from known results, thus subtracting
approximately 20 pages from this paper. Pawłucki supplied the above proof
of Lemma 1 based on [15].
We indicate how E+,K,A1 in Lemma 1 can be computed. The delicate
point is the computation of K.
Proceeding as in the proof of Lemma 1, we first replace A by
1+∣A∣, then compute E+.
Given any positive integer K, we can then decide whether the following
hold for each x∈E.
(2.6.5)
sup{A(x,y):y∈E+(x)} finite if E+(x) is empty.
(2.6.7)
sup{A(x,y)⋅[dist(y,E+(x))]K:y∈E+(x)} finite if
E+(x) is nonempty.
We successively test K=1,2,3,⋯ until we find a K for which ((2.6.5))
and ((2.6.7)) hold. We will eventually find such a K, thanks to the
proof of Lemma 1.
Once we have found E+ and K, we can compute the function A1 defined
in the proof of Lemma 1. Thus, we compute E+,K,A1 as promised.
3. Semialgebraic Quadratic Forms and C∞ Functions
3.1. Setup
We are given the following objects and assumptions:
We prove Propositions 2 and 3 by induction on dimE+.
All the semialgebraic sets and functions arising in our proof of
Propositions 2 and 3 will be computable by the methods of Sections 2.5
and 2.6.
In the base case, dimE+=0, i.e., E+ is finite.
In that case, hypothesis ((3.1.15)) from Section 3.1
asserts that for some constant A, we have
[TABLE]
for all (x0,⋯,xk,z1,⋯,zL)∈E++
and all P0,P1,⋯,Pk.
Consequently (3.2.1) in Proposition 2 is satisfied, for any
F∈C0∞(Rn,RI). We take mˉˉ=mˉ and
[TABLE]
Then (3.2.1) and (3.2.2) both hold for any F∈C0∞(Rn,RI), proving Proposition 2 in the base case dimE+=0.
To prove Proposition 3 in the base case, we note that since E+
is finite, condition (3.2.3) in Proposition 3 is
equivalent to the following:
[TABLE]
We define Hlim(x0) to consist of all (P0,P)∈P(m)(Rn,RD)⊕P(mˉ)(Rn,RI) such that
[TABLE]
Then, by taking m+=mˉ, we see that (3.2.3) is equivalent
to (3.2.4) as in Proposition 3. Note that Hlim(x0) is a vector subspace of P(m)(Rn,RD)⊕P(mˉ)(Rn,RI), since
[TABLE]
is a semidefinite quadratic form for each (x0,x1,⋯,xk,z1,⋯,zL)∈E++.
The semialgebraic dependence of Hlim(x0) on x0∈E is trivial, since E is finite (because E+ is finite).
This completes the proof of Propositions 2 and 3 in the
base case (dimE+=0).
For the induction step, we fix a positive integer Δ, and
assume that Propositions 2 and 3 hold whenever dimE+<Δ. We will prove those propositions in the case dimE+=Δ.
Let us assume that all is as in Section 3.1, and that dimE+=Δ.
We apply Lemma 1 to the semialgebraic function A(x0,x1,⋯,xk) in ((3.1.13)), ((3.1.15)) of
Section 3.1.
Thus, there exist an integer K≥1, a compact semialgebraic subset E+⊂E+, and a semialgebraic function A1
defined on E, having the following properties:
Thus, E++ is a semialgebraic subset of E+×L copiesRn×⋯×Rn.
Thanks to \eqrefP1, our induction hypothesis applies to Q(x0,P0,x1,P1,⋯,xk,Pk,z1,⋯,zk) restricted to (x0,⋯,xk,z1,⋯,zL)∈E++. Applying
Proposition 2, we therefore learn the following.
There exist m′≥mˉ, and a computable family of vector spaces
[TABLE]
depending semialgebraically on (x0,⋯,xk)∈E+, such that the following holds.
Let x0∈E, P0∈P(m)(Rn,RD), F∈C0∞(Rn,RI).
Then
[TABLE]
if and only if
[TABLE]
for each (y1,⋯,yk)∈E+(x0).
Later on, we will apply Proposition 3 in the same setting; see ((4.0.113)) below.
Let us sketch the arguments that follow, concentrating on the proof of
Proposition 2.
Given x0,P0,F, we must decide whether the quantity
[TABLE]
stays bounded as (x1,⋯,xk,z1,⋯,zL)
varies over E++(x0).
If we restrict attention to the set of such (x1,⋯,xk,z1,⋯,zL) where (x1,⋯,xk)∈E+(x0), then already the equivalence of (4.0.20) to (4.0.21) settles the issue. Hence, we may restrict
attention to the set where (x1,⋯,xk)∈E+(x0). Also, ((3.1.15)) and ((4.0.7))
easily imply that the quantity (4.0.22) stays bounded whenever E+(x0) is empty. Hence, we may assume that E+(x0) is non-empty.
Thus, our problem is to decide whether the quantity (4.0.22) stays
bounded as (x1,⋯,xk,z1,⋯,zL) varies
over the set where
In deciding this question, we are fighting against the factor [dist((x1,⋯,xk),E+(x0))]−K in estimate ((4.0.9)).
Our strategy is to pick mˉˉ much larger than mˉ, and approximate Jxi(mˉ)F by πximˉˉ→mˉJxi(mˉˉ)F in (4.0.22), where (x1,⋯,xk) is a point of E+(x0) lying as close as possible to (x1,⋯,xk). According to Proposition 1, the derivatives
of the error Jxi(mˉ)F−πxim→mˉJxi(m)F at xi are
[TABLE]
If we pick mˉˉ large enough, then the small factor [dist(⋯)]mˉˉ−mˉ
overcomes the large factor [dist(⋯)]−K
in ((4.0.9)).
Therefore, the induction step in the proof of Proposition 2 comes
down to deciding whether the quantity
[TABLE]
remains bounded as (x1,⋯,xk,z1,⋯,zL,x1,⋯,xk) varies over the set
where
[TABLE]
We are therefore tempted to define
[TABLE]
for (x1,⋯,xk,z1,⋯,zL,x1,⋯,xk) as in (4.0.26), and for P0∈P(m)(Rn,RD),
P1,⋯,Pk∈P(mˉˉ)(Rn,RI).
Our problem is then to decide whether the quantity
[TABLE]
remains bounded as (x1,⋯,xk,z1,⋯,zL,x1,⋯,xk) varies over the set E^++(x0) defined by (4.0.26). We hope to decide
this question by applying Proposition 2 to the quadratic form Q~ and the sets
[TABLE]
in place of Q,E++,E+,E.
Here, our present (x1,⋯,xk) plays the rôle of (x1,⋯,xk) in the statement of
Proposition 2, while our present (z1,⋯,zL,x1,⋯,xk) plays the rôle of (z1,⋯,zL). The key point is that dimE^+=dimE+<Δ, by ((4.0.1)), so we can hope to apply our induction hypothesis
(Proposition 2 holds when dimE+<Δ). If we could apply
Proposition 2 to Q~,E^++,E^+,E^,
then we could decide whether the quantity (4.0.28) satisfies the
required boundedness condition, and thus complete our inductive proof of
Proposition 2.
Unfortunately, the above doesn’t quite work, because the quadratic form Q~ needn’t satisfy the analogue of hypothesis ((3.1.15)) of
Proposition 2.
We rescue the argument by modifying Q~. Given (x0,x1,⋯,xk) we define a projection Π(x0,x1,⋯,xk)
from
[TABLE]
to a subspace on which Q~ behaves well. We then define
[TABLE]
where (P^0,P^1,⋯,P^k)=∏(x0,x1,⋯,xk)(P0,P1,⋯,Pk). (Compare with (4).)
Our induction hypothesis – Proposition 2 in lower dimension –
applies to Q^,E^++,E^+,E^, allowing us to argue
as we hoped to do for Q~,E^++,E^+,E^. Thus, we
can complete our induction on dimE+. This completes our preview of
the proof of Proposition 2.
Proposition 3 is proven similarly. In some cases, we approximate Jxi(mˉ)F in (3.2.1) by πximˉˉ→mˉJx0(m)F, rather than by πximˉˉ→mˉJxi(mˉˉ)F.
Having done with previews, let us return to the proof of Proposition 2.
We will now estimate Q(x0,P0,x1,Jx1(mˉ)F,⋯,xk,Jxk(mˉ)F,z1,⋯,zL) under several different assumptions on
(x0,x1,⋯,xk,z1,⋯,zL)∈E++.
Case 1:
Suppose (x0,x1,⋯,xk)∈E+∖E+, and suppose also that E+(x0) is nonempty. Let F∈C0∞(Rn,RI).
Let (x1,⋯,xk)∈E+(x0) be as close as possible to (x1,⋯,xk). (Recall, E+(x0) is compact.)
Then, for mˉˉ>mˉ to be picked in a moment, Taylor’s theorem
(see Proposition 1) gives
[TABLE]
for ∣α∣≤mˉ, j=1,⋯k, F∈C0∞(Rn,RI).
Throughout this section, we write c,C,C′, etc. to denote
constants determined by mˉˉ, mˉ,n,k,L,I,K,D, and an
upper bound for diameter of E+. These symbols may denote different
constants in different occurrences.
Since
[TABLE]
is a positive semidefinite quadratic form, we have the estimates
for any P0,P1,⋯,Pk; compare with (4.0.38). Hence, we may
proceed as in the proof of (4), (4), to establish the
following result.
(4.0.46)
In Case
1’, if ∣(x1,⋯,xk)−(x0,⋯,x0)∣<21dist((x0,⋯,x0),E+(x0)), then we have
[TABLE]
and
[TABLE]
This completes our analysis of Case 1’.
For fixed (x0,x1,⋯,xk)∈E+ and
[TABLE]
we ask whether
[TABLE]
Note: In (4.0.48), (x0,x1,⋯,xk) are held fixed, i.e., the sup is over z1,⋯,zL,x1,⋯,xk satisfying the constraints. The sup is taken to
be [math] if the the set of points satisfying the constraints is empty.
Observe that the set of all (x0,x1,⋯,xk,P0,P1,⋯,Pk) satisfying (4.0.48) is semialgebraic,
since Q, E++, E+, E+ are semialgebraic.
Moreover, since
[TABLE]
is a nonnegative quadratic form for fixed x0,x1,⋯,xk, z1,⋯,zL, it follows that the set of all (P0,P1,⋯,Pk) satisfying (4.0.48) is a vector
subspace of
[TABLE]
for fixed (x0,x1,⋯,xk)∈E+. We denote this vector subspace by
[TABLE]
Thus,
(4.0.49)
H^bdd(x0,x1,⋯,xk)⊂P(m)(Rn,RD)⊕k copiesP(mˉˉ)(Rn,RI)⊕⋯⊕P(mˉˉ)(Rn,RI) is a vector subspace depending
semialgebraically on (x0,x1,⋯,xk)∈E+,
for any (P0,P1,⋯,Pk), (P0′,⋯,Pk′)∈H^bdd(x0,x1,⋯,xk) and any (x0,x1,⋯,xk)∈E+,
because
[TABLE]
is a positive semidefinite quadratic form in (P0,P1,⋯,Pk) for fixed (x0,x1,⋯,xk,z1,⋯,zL).
Also, for λ∈R we have
[TABLE]
Thus, for fixed (x0,x1,⋯,xk)∈E+, the function (P0,P1,⋯,Pk)↦Norm(P0,P1,⋯,Pk;x0,x1,⋯,xk) is a
seminorm on the finite-dimensional vector space H^bdd(x0,x1,⋯,xk).
It follows that, for each (x0,x1,⋯,xk)∈E+, we have
[TABLE]
for all (P0,P1,⋯,Pk)∈H^bdd(x0,x1,⋯,xk); here, M(x0,x1,⋯,xk) is some
finite constant.
Since H^bdd(x0,x1,⋯,xk) depends semialgebraically on (x0,x1,⋯,xk), and since Norm(P0,⋯,Pk;x0,x1,⋯,xk) is
semialgebraic in (P0,⋯,Pk;x0,x1,⋯,xk), it follows that the least possible nonnegative M(x0,x1,⋯,xk) in (4.0.53) is a semialgebraic function of (x0,x1,⋯,xk)∈E+.
From now on, we define M(x0,x1,⋯,xk) to be the least possible nonnegative number for which (4.0.53) holds for all (P0,P1,⋯,Pk)∈H^bdd(x0,x1,⋯,xk).
Thus, M(x0,x1,⋯,xk) is
a semialgebraic function; and from (4.0.53), we obtain the estimate
[TABLE]
whenever
[TABLE]
[TABLE]
denote the orthogonal projection from
[TABLE]
onto
[TABLE]
with respect to the quadratic form ∑∣α∣≤m∣∂αP0(x0)∣2+∑i=1k∑∣α∣≤mˉˉ∣∂αPi(xi)∣2.
If
[TABLE]
then the following hold.
[TABLE]
[TABLE]
[TABLE]
Also, Π(x0,x1,⋯,xk)(P0,P1,⋯,Pk) is given by a semialgebraic map
[TABLE]
We prepare to invoke the induction hypothesis (Propositions 2 and 3 hold for dimE+<Δ).
Let
[TABLE]
[TABLE]
[TABLE]
(4.0.62)
For (x0,x1,⋯,xk,z1,⋯,zL,x1,⋯,xk)∈E^++ and
[TABLE]
define
[TABLE]
and then set
[TABLE]
Here, (x1,⋯,xk) plays the
role of (x1,⋯,xk) in Section 3.1,
and (z1,⋯,zL,x1,⋯,xk) plays the role
of (z1,⋯,zL) in Section 3.1.
We check that E^, E^+, E^++, Q^, A^
satisfy hypotheses ((3.1.1)), ⋯,((3.1.15)) in Section 3.1, and that dimE^+<Δ. This will allow us to
apply Propositions 2 and 3 to E^, E^+, E^++, Q^, A^.
Hypothesis ((3.1.1)) for E^, E^+, E^++, Q^, A^ simply asserts that
[TABLE]
From (4.0.60) and (4.0.61), we see that E^⊂Rn
and E^+⊂E^×Rn×⋯×Rn. Also (4.0.59) and (4.0.60) show that E^++⊂E^+×Rn×⋯×Rn. Thus, Hypothesis ((3.1.1)) holds for E^, E^+, E^++, Q^, A^.
Hypothesis ((3.1.3)) for E^, E^+, E^++, Q^, A^ asserts that E^, E^+, E^++ are
semialgebraic, which follows from ((4.0.5)), (4.0.59), (4.0.60), (4.0.61), since E++, E++ are semialgebraic.
Hypothesis ((3.1.5)) for E^, E^+, E^++, Q^, A^ asserts that E^ and E^+ are compact, which
follows from (4.0.60), (4.0.61) and the compactness of E+.
Hypothesis ((3.1.7)) for E^, E^+, E^++, Q^, A^ asserts that mˉˉ≥m≥0 and D,I≥1,
which we know from our selection of mˉˉ, and from Hypothesis ((3.1.7)) for E, E+, E++, Q, A.
Hypothesis ((3.1.9)) for E^, E^+, E^++, Q^, A^ asserts that
[TABLE]
is a semialgebraic function of x0,x1,⋯,xk,z1,⋯,zL,x1,⋯,xk, P0,P1,⋯,Pk.
This follows from ((4.0.62)), since
[TABLE]
depends semialgebraically on x0,x1,⋯,xk,P0,P1,⋯,Pk, the projection πximˉˉ→mˉ depends semialgebraically on xi and
[TABLE]
is semialgebraic in (x0,x1,⋯,xk,z1,⋯,zL,P^0,P^1,⋯,P^k).
Thus, Hypothesis ((3.1.9)) holds for E^, E^+, E^++, Q^, A^.
Hypothesis ((3.1.11)) for E^, E^+, E^++, Q^, A^ asserts that for fixed x0,x1,⋯,xk,z1,⋯,zL,x1,⋯,xk, the map
[TABLE]
is a positive semidefinite quadratic form. This follows from ((4.0.62)) and
Hypothesis ((3.1.11)) for E, E+, E++, Q, A, since the maps
[TABLE]
for fixed x0,x1,⋯,xk,z1,⋯,zL,x1,⋯,xk.
Thus, Hypothesis ((3.1.11)) holds for E^, E^+, E^++, Q^, A^.
Hypothesis ((3.1.13)) for E^, E^+, E^++, Q^, A^ asserts that
[TABLE]
is a nonnegative semialgebraic function.
This is immediate from (4.0.64), since M(x0,x1,⋯,xk) is a semialgebraic function.
Hypothesis ((3.1.15)) for E^, E^+, E^++, Q^, A^ asserts that
If x0∈E, then (P0,Jx1(m′)F,⋯,Jxk(m′)F)∈Hbdd(x0,x1,⋯,xk) for each (x1,⋯,xk)∈E+(x0).
If x0∈E^, then E+(x0)=∅ by (4.0.61). Hence, by (4) and (4.0.70), we
find that (4.0.48) holds for any (x1,⋯,xk)∈E+(x0), with Pi:=Jxi(mˉˉ)F for i=1,⋯,k.
(To see this, recall that (4) holds whenever ((4.0.36)) holds, and
note that ((4.0.36)) holds whenever x0,x1,⋯,xk,z1,⋯,zL,x1,⋯,xk are as in (4.0.48).)
Thanks to ((4.0.51)), we therefore learn that
where again x0 stays fixed. From (4.0.90) and (4.0.91), we learn
that
[TABLE]
with x0 fixed as usual. Thus, as promised, we have proven (4.0.70).
Recalling ((4.0.82)), we now see that we have established the following.
(4.0.92)
Let x0∈E, P0∈P(m)(Rn,RD), F∈C0∞(Rn,RI). Then
[TABLE]
remains bounded over all (x1,⋯,xk,z1,⋯,zL)∈E++(x0) if and only if for all (x1,⋯,xk)∈E+(x0), we have
[TABLE]
and
[TABLE]
From ((4.0.92)), we see easily that the conclusion of Proposition 2 holds for E, E+, E++, Q, A. This completes the
induction step in our proof of Proposition 2.
We turn our attention to the induction step in the proof of Proposition 3.
Let x0∈E, P0∈P(m)(Rn,RD), F∈C0∞(Rn,RI) be given. Assume that
[TABLE]
In our discussion of the induction step for Proposition 2, we
already saw that (4.0.94) implies the following (see (4.0.77) and (4.0.79)).
Let δ>0. If (x0,x1,⋯,xk,z1,⋯,zL,x1,⋯,xk)∈E^++ and
[TABLE]
and also
[TABLE]
it follows that
(4.0.101)
(x1,⋯,xk,z1,⋯,zL)∈E++(x0), (x1,⋯,xk)∈E+(x0), and ∣xi−x0∣<δ (all i), ∣zi−x0∣<δ (all i), see (4.0.59).
Conversely, suppose ((4.0.101)) holds and assume (x0,⋯,x0)∈E+(x0). Let (x1,⋯,xk)∈E+(x0) be as close as
possible to (x1,⋯,xk). Then by (4.0.59), (x1,⋯,xk,z1,⋯,zL,x1,⋯,xk) belongs to E^++(x0); and we
have
[TABLE]
In view of the above remarks, ((4.0.99)) implies the following.
(4.0.103)
Suppose (4.0.94) holds, and suppose (x0,⋯,x0)∈E+(x0). Then (P0,Jx0(m^+)F)∈Hˇlim(x0) if
and only if
[TABLE]
On the other hand, suppose (4.0.94) holds, E+(x0)=∅, and assume that (x0,⋯,x0)∈E+(x0).
(x1,⋯,xk,z1,⋯,zL)∈E++(x0)limx1,⋯,xk,z1,⋯,zL→x0Q(x0,P0,x1,Jx1(mˉ)F,⋯,xk,Jxk(mˉ)F,z1,⋯,zL)=0 if
and only if
[TABLE]
(4.0.107)
We define
[TABLE]
to consist of all (P0,P) such that
[TABLE]
Then, H′(x0)⊂P(m)(Rn,RD)⊕P(mˉˉ)(Rn,RI) is a vector
space depending semialgebraically on x0; see ((3.1.11)). Moreover, ((4.0.105)) now tells us the following.
(4.0.109)
Suppose (4.0.94) holds, E(x0)=∅, but (x0,⋯,x0)∈E(x0). Then
[TABLE]
if and only if
[TABLE]
Next, suppose (4.0.94) holds and E(x0)=∅. Then we are in Case 2 above; see (4.0.38),⋯,((4.0.44)).
In particular, ((4.0.44)) holds for (x1,⋯,xk,z1,⋯,zL)∈E++(x0); hence (4) and (4) hold.
Therefore, as in our discussion of ((4.0.105))⋯((4.0.109)), we learn
from ((4.0.107)) that
[TABLE]
if and only if
[TABLE]
Together with ((4.0.109)), this tells us the following.
(4.0.111)
Suppose (4.0.94) holds and (x0,⋯,x0)∈E+(x0). Then
[TABLE]
if and only if
[TABLE]
Next, exploiting ((4.0.1)), we apply our inductive hypothesis (Propositions 2 and 3 hold for dimE+<Δ) to
[TABLE]
restricted to {(x1,⋯,xk,z1,⋯,zL)∈E++(x0):(x1,⋯,xk)∈E+(x0)}. From Proposition 3 applied to this case, we
obtain an integer m^≥mˉ and a computable family of vector spaces
[TABLE]
depending semialgebraically on x0∈E, such that the following holds.
(4.0.113)
Let x0∈E, P0∈P(m)(Rn,RD), F∈C0∞(Rn,RI). Suppose that E+(x0)=∅
(i.e., x0∈E), and
Let x0∈E, P0∈P(m)(Rn,RD), F∈C0∞(Rn,RI) be given. Suppose that
[TABLE]
Then
(a)
If (x0,⋯,x0)∈E+(x0), then
[TABLE]
if and only if
[TABLE]
and
[TABLE]
(b)
If (x0,⋯,x0)∈E+(x0), then
[TABLE]
if and only if
[TABLE]
From ((4.0.115)), we obtain at once the conclusion of Proposition 3
for the data E, E+, E++, Q, A.
This concludes our inductive proof of Propositions 2 and 3.
∎
5. Bundles and Glaeser Refinements
5.1. Notation, Definitions, Preliminaries
Let Q∈P(m)(Rn,RD);
say Q=(Q1,⋯,QD) with each Qi∈P(m)(Rn,R). Let P∈P(m)(Rn,R).
For x∈Rn, we define P⊙xQ:=(P⊙xQ1,⋯,P⊙xQD), where P⊙xQi=Jx(m)(PQi) is the product of P and Qi as m-jets at x. The above multiplication ⊙x
makes Rxm:=P(m)(Rn)
into a ring, and it also makes P(m)(Rn,RD) into an Rxm-module.
Let E⊂Rn be compact. Fix m≥0, D≥1. A
bundle over E is a family H=(Hx)x∈E parameterized by points x∈E, where, for each x, the
fiber Hx is either the empty set or else has the form
[TABLE]
where f(x)∈P(m)(Rn,RD) and I(x)⊂P(m)(Rn,RD) is an Rxm-submodule.
We call H proper if each of its fibers is non-empty.
Note that compactness of E is part of the definition of a bundle. Let H=(Hx)x∈E be a bundle, and let F∈Cm(Rn,RD). We say that F is a
section of H if Jx(m)F∈Hx
for all x∈E. Clearly, this cannot happen unless H is proper.
Next, we define the strong Glaeser refinement of a bundle H=(Hx)x∈E, denoted by G(H)=(H~x)x∈E. For any x0∈E, the fiber H~x0 consists of all P0=(P0,1,⋯,P0,D)∈Hx0 satisfying the following
conditions, for a large enough kˉ determined by m,n,D:
(GR1)
For some finite constant K, we have
[TABLE]
for all x1,⋯,xkˉ∈E.
(GR2)
The left-hand side of (\refNDP1) tends to zero
as (x1,⋯,xkˉ)→(x0,⋯,x0) in Ekˉ.
This definition differs from the usual definition of Glaeser refinement in
previous papers [6, 7, 9] on Whitney’s problem.
The fiber at x0 of the standard Glaeser refinement of H is defined to consist of all P0∈Hx0 that satisfy
(GR2); we do not require (GR1). This notion agrees with the definition of
the Glaeser refinement in the previous papers on Whitney’s problems.
Note that the strong Glaeser refinement of H is a subbundle of
the standard Glaeser refinement of H, which in turn is a
subbundle of H.
(We say that H=(Hx)x∈E is a subbundle of H′=(Hx′)x∈E
if H and H′ are bundles and Hx⊆Hx′ for all x∈E.)
Moreover, Taylor’s theorem implies that any section of H is
already a section of G(H), the strong Glaeser
refinement of H.
For any bundle H, and for any integer l≥0, we define the lth iterated (strong) Glaeser refinement of H by the
following induction:
G(0)H=H;G(l+1)H=G(G(l)H). In principle, we can compute any given G(l)(H) from H.
By induction on l, we see that the sections of H are the same
as the sections of G(l)H.
The following result is therefore immediate from the corresponding assertion
for the standard Glaeser refinement, proven in the papers [6, 9]
for m≥1, and in [8] for m=0.
Theorem 4**.**
There exists l∗, depending only on m, n, D,
for which the following holds. Let H be a bundle. Then H has a section if and only if G(l∗)H is a proper bundle.
Let H=(f(x)+I(x))x∈E
be a proper bundle. Then H=(f~(x)+I(x))x∈E whenever f~(x)−f(x)∈I(x) for all x∈E. Thus, H uniquely determines I(x), but it determines f(x) only modulo I(x). If φ∈C0∞(Rn), then we define
[TABLE]
Thus, φ⊙H is again a proper bundle. Note that our
definition of φ⊙H is independent of the choice of f(x), i.e., it is unaffected by changing f(x)
to f~(x) when f(x)−f~(x)∈I(x). If F is a section of H, then φF is a section of φ⊙H.
The operation H↦φ⊙H is related to
the (strong) Glaeser refinement as follows:
Lemma 2**.**
Let H=(Hx)x∈E be a bundle with
strong Glaeser refinement H~=(H~x)x∈E, and let φ∈C0∞(Rn). If P0∈H~x0, then Jx0(m)φ⊙x0P0 belongs to the fiber of G(φ⊙H) at x0.
Proof.
We write K1,K2,⋯ to denote constants determined by m,n,D,φ,E,H,P0.
Let x1,⋯,xkˉ∈E. Because (GR1) holds for x0,P0,H, there exist P1∈Hx1,⋯,Pkˉ∈Hxkˉ such that
(5.1.2)
∣∂α(Pi−Pj)(xj)∣≤K1∣xi−xj∣m−∣α∣ for ∣α∣≤m,i,j=0,⋯,kˉ.
(We adopt the convention that 00=0 to deal with the degenerate case ∣α∣=m,xi=xj.)
Taking j=0, we see that
(5.1.4)
∣∂αPi(x0)∣≤K2 for ∣α∣≤m,i=0,⋯,kˉ.
By expanding Pi(y) in powers of y−x0, we deduce from ((5.1.4))
(5.1.6)
∣∂αPi(y)∣≤K3 for ∣α∣≤m,∣y−x0∣≤diameter(E),i=0,⋯,kˉ.
In particular,
(5.1.8)
∣∂αPi(xj)∣≤K3 for ∣α∣≤m,i,j=0,⋯,kˉ.
For k=0,⋯,kˉ, let
(5.1.10)
Pk#=Jxk(m)φ⊙xkPk. Thus,
(5.1.12)
Pk#
belongs to the fiber of φ⊙H at xk, for each k=0,⋯,kˉ.
We estimate the derivatives of Pk#−Pk′#. To do so,
we write
P0#=Jx0(m)φ⊙x0P0
satisfies (GR1) for the point x0 and the bundle φ⊙H.
Similarly, we establish (GR2) for P0#, x0, φ⊙H.
We sketch the argument. Let 0<ε<1 be given. Let δ>0 be
as in (GR2) for P0, x0, H, and let x1,⋯,xkˉ∈B(x0,δ^)∩E, where δ^∈(0,δ) will be picked below.
Then there exist P1∈Hx1,⋯,Pkˉ∈Hxkˉ
such that
(5.1.29)
∣∂α(Pi−Pj)(xj)∣≤ε∣xi−xj∣m−∣α∣ for ∣α∣≤m, i,j=0,⋯,kˉ.
A homogeneous bundle is a bundle of the form H=(I(x))x∈E with each I(x)⊂P(m)(Rn,RD) an Rxm-submodule. (That is, we can take f≡0 in H=(f(x)+I(x))x∈E.)
The (strong) Glaeser refinement of a homogenous bundle is again a
homogeneous bundle.
(5.1.41)
Let H=(f(x)+I(x))x∈E be
a proper bundle, and let (I~(x))x∈E
be the (strong) Glaeser refinement of (I(x))x∈E. If for each x∈E, g(x) belongs to the fiber
at x of the strong Glaeser refinement G(H), then it follows that G(H)=(g(x)+I~(x))x∈E.
Let H be a bundle, and suppose G(H) is proper. Then for any φ∈C0∞(Rn), we have G(φ⊙H)=φ⊙G(H).
Proof.
For each x∈E, pick f(x) in the fiber of G(H) at x. In particular, f(x)
belongs to the fiber of H at x, so H=(f(x)+I(x))x∈E for a family of Rxm-submodules I(x)⊂P(m)(Rn,RD). Let (I~(x))x∈E be the strong Glaeser refinement of (I(x))x∈E. We have G(H)=(f(x)+I~(x))x∈E by ((5.1.41)), hence φ⊙G(H)=(Jx(m)φ⊙xf(x)+I~(x))x∈E; also φ⊙H=(Jx(m)φ⊙xf(x)+I(x))x∈E, hence if G(φ⊙H)
is a proper bundle, then (by ((5.1.41))) the fiber at every x∈E of G(φ⊙H) has the form
[TABLE]
for some g(x). According to the preceding lemma, G(φ⊙H) is a proper bundle; and, with g as in (5.1.43), we have Jx(m)φ⊙xf(x)∈g(x)+I~(x). Therefore, the fiber at x of
G(φ⊙H) is equal to Jx(m)φ⊙xf(x)+I~(x).
That’s also the fiber at x of φ⊙G(H), as we saw above. Thus, G(φ⊙H)=φ⊙G(H), as
claimed.
∎
6. Bundles Determined by Smooth Functions
Setup. Let E⊂Rn be compact, semialgebraic. For
x∈E, let I(x)⊂P(m)(Rn,RD) be an Rxm-submodule, depending semialgebraically on x. For l≥0, let (I(l)(x))x∈E denote the lth
(strong) Glaeser refinement of the homogeneous bundle (I(x))x∈E. Thus, I(0)(x)=I(x), and (I(l+1)(x))x∈E=G((I(l)(x))x∈E). Note that I(l)(x) depends
semialgebraically on x, by an obvious induction on l. Let T(x):P(mˉ)(Rn,RM)→P(m)(Rn,RD)
be a linear map, depending semialgebraically on x∈E. Here, mˉ≥m. For f∈C0∞(Rn,RM),
we write Hf to denote the bundle
[TABLE]
We make the following
Assumption:
[TABLE]
For l≥0, let Hf(l) denote the lth
(strong) Glaeser refinement of Hf. Thus, Hf(0)=Hf and Hf(l+1)=G(Hf(l)).
Under the above assumptions, we will prove the following result:
Lemma 3** (Main Lemma on Hf).**
For each l≥0, there exist an integer mˉˉ≥mˉ, a finite list of linear differential operators Lν(ν=1,⋯,νmax), and a linear map
[TABLE]
with the following properties.
•
Each Lν has semialgebraic coefficients, and maps functions in C∞(Rn,RM) to scalar-valued
functions on Rn.
•
Each Lν has order at most mˉˉ.
•
T(l)(x)* depends semialgebraically on x.*
•
Let f∈C0∞(Rn,RM).
Then Hf(l) is a proper bundle (i.e., all of
its fibers are non-empty) if and only if Lνf=0 on E for each ν=1,⋯,νmax.
•
Let f∈C0∞(Rn,RM).
If Hf(l) is a proper bundle, then Hf(l)=(T(l)(x)Jx(mˉˉ)f+I(l)(x))x∈E.
Proof.
We use induction on l. For l=0, we take mˉˉ=mˉ, {L1,⋯,Lνmax}= empty list (νmax=0), T(0)(x)=T(x). The conclusions of Lemma 3 (for l=0) are immediate
from our assumptions in Setup.
For the induction step, we fix l≥1 and assume that Lemma 3 on Hf holds with l replaced by l−1. We
then prove Lemma 3 on Hf for the given l.
By our inductive assumption, there exist m^≥m; linear
differential operators
[TABLE]
of order at most m^, with semialgebraic coefficients; and a linear
map Told(x) mapping P(m^)(Rn,RM)→P(m)(Rn,RD) such that the following hold.
(6.0.3)
Let f∈C0∞(Rn,RM). Then Hf(l−1) is a proper bundle if and only if Lνoldf=0 on E for each ν=1,⋯,νmaxold.
(6.0.5)
Let f∈C0∞(Rn,RM). If Hf(l−1) is a proper bundle, then Hf(l−1)=(Told(x)Jx(m^)f+I(l−1)(x))x∈E.
Suppose f∈C0∞(Rn,RM), x0∈E, P0∈P(m)(Rn,RD) are given; and assume that Hf(l−1) is a proper bundle.
We investigate whether P0 belongs to the fiber at x0 of Hf(l)=G(Hf(l−1)). We recall the definition (GR1) and (GR2) of the
(strong) Glaeser refinement in Section 5.1.
For x1,⋯,xkˉ∈E, and for P1,⋯,Pkˉ∈P(m^)(Rn,RM), we
define Q(x0,P0,x1,P1,⋯,xkˉ,Pkˉ) to be the minimum of the quantity
[TABLE]
over all P1#=(P1,1#,⋯,P1,D#),⋯,Pkˉ#=(Pkˉ,1#,⋯,Pkˉ,D#) such that
[TABLE]
Here, we take P0#=(P0,1#,⋯,P0,D#) to equal P0.
By linear algebra, Q(x0,P0,x1,P1,⋯,xkˉ,Pkˉ) is a positive semidefinite quadratic form in P0,P1,⋯,Pkˉ, for each fixed x0,x1,⋯,xkˉ∈E. Moreover, since x↦Told(x) and x↦I(l−1)(x) are semialgebraic, it follows that
[TABLE]
is a semialgebraic function of (x0,P0,⋯,xkˉ,Pkˉ).
If we define A(x0,⋯,xkˉ) to be the norm of
this quadratic form, i.e., the least A(x0,⋯,xkˉ) such that
[TABLE]
for all P0,P1,⋯,Pkˉ, then A(x0,⋯,xkˉ) is a nonnegative semialgebraic function of (x0,⋯,xkˉ).
Therefore, we have all the conditions assumed in the setup in Section 3.1. (The number of z’s there is zero.)
From Propositions 2 and 3, we have the following
conclusions.
There exist mˉˉ≥m^; and families of vector subspaces
[TABLE]
and
[TABLE]
with the following properties.
(6.0.7)
Hbdd(x0,⋯,xkˉ) depends semi-algebraically on (x0,x1,⋯,xkˉ)∈E×⋯×E.
(6.0.9)
Hlim(x0) depends semi-algebraically on x0∈E.
(6.0.11)
Let x0∈E, P0∈P(m)(Rn,RD), f∈C0∞(Rn,RM). Then
[TABLE]
is bounded if and only if (P0,Jx1(mˉˉ)f,⋯,Jxkˉ(mˉˉ)f)∈Hbdd(x0,x1,⋯,xkˉ) for all x1,⋯,xkˉ∈E.
(6.0.13)
Let x0∈E, P0∈P(m)(Rn,RD), f∈C0∞(Rn,RM). Suppose that
[TABLE]
is bounded. Then
[TABLE]
if and only if (P0,Jx0(mˉˉ)f)∈Hlim(x0).
Comparing our definition of Q(⋯) with (GR1), and (GR2) in the
definition of the (strong) Glaeser refinement, we see the following.
Let H(l−1)=(Told(x)Jx(m^)f+I(l−1)(x))x∈E, where f∈C0∞(Rn,RM) is given.
Let x0∈E, and let P0 belong to the fiber of H(l−1) at x0. Then (GR1) holds for (x0,P0) and
H(l−1), if and only if
[TABLE]
is bounded. Moreover, (GR2) holds for (x0,P0) and H(l−1), if and only if
Let f∈C0∞(Rn,RM).
Suppose Hf(l−1) is a proper bundle. Let x0∈E, and let P0 belong to the fiber of Hf(l−1) at x0. Then P0 belongs to the fiber of Hf(l)=G(Hf(l−1)) at x0, if and only if (P0,Jx0(mˉˉ)f)∈Hlim(x0) and (P0,Jx1(mˉˉ)f,⋯,Jxkˉ(mˉˉ)f)∈Hbdd(x0,x1,⋯,xkˉ) for all x1,⋯,xkˉ∈E.
Together with ((6.0.3)) and ((6.0.5)), this immediately implies that there
exists a family of vector spaces
(6.0.15)
HGR(x0,x1,⋯,xkˉ)⊂P(m)(Rn,RD)⊕∑i=0kˉP(mˉˉ)(Rn,RM)
depending semialgebraically on
x0,x1,⋯,xkˉ∈E,
for which the following holds.
(6.0.17)
Let f∈C0∞(Rn,RM), and suppose Hf(l−1) is a proper bundle. Let x0∈E, P0∈P(m)(Rn,RD).
Then P0 belongs to the fiber of Hf(l) at
x0 if and only if
[TABLE]
for all x1,⋯,xkˉ∈E.
By linear algebra (and basic facts about semialgebraic sets), there exist
finitely many linear functionals
[TABLE]
depending semialgebraically on x0,x1,⋯,xkˉ∈E, such
that the following holds.
Let x0,x1,⋯,xkˉ∈E. Let P0∈P(m)(Rn,RD) and let P0#,⋯,Pkˉ#∈P(mˉˉ)(Rn,RM). Then
[TABLE]
if and only if
[TABLE]
Hence, (\refB9) yields the following result.
(6.0.19)
Let f∈C0∞(Rn,RM), and suppose Hf(l−1) is a proper bundle. Let x0∈E, P0∈P(m)(Rn,RD).
Then P0 belongs to the fiber of Hf(l) at
x0 if and only if
[TABLE]
for x1,⋯,xkˉ∈E and ν=1,⋯,νmax#.
It may happen that xi=xj in (\refB10) for some i=j. In that case, λi,ν and λj,ν play
redundant roles. We may easily rewrite (\refB10) as follows.
For each integer k(0≤k≤kˉ), there are linear
functionals
[TABLE]
and
[TABLE]
i=0,⋯,k, ν=1,⋯,νmax#(k),
depending semialgebraically on (x0,⋯,xk)∈E×⋯×E, for which we have the following.
(6.0.21)
Let f∈C0∞(Rn,RM), and suppose Hf(l−1) is a proper bundle. Let x0∈E, P0∈P(m)(Rn,RD).
Then P0 belongs to the fiber of Hf(l) at
x0 if and only if, for each 0≤k≤kˉ, for each x1,⋯,xk∈E∖{x0} distinct, and for each ν=1,⋯,νmax#(k), we have
[TABLE]
Now let f∈C0∞(Rn,RM),
and suppose Hf(l−1) is a proper bundle. Let x0∈E, P0∈P(m)(Rn,RD), and suppose P0 belongs to the fiber at x0 of Hf(l).
Let φ be a scalar-valued C0∞ function on Rn. Then Hφf=φ⊙Hf (see
assumption (6.0.2)), hence by Corollary 1, we see that
Hφf(l−1)=φ⊙Hf(l−1). In particular, Hφf(l−1) is a proper bundle, so (\refB11) applies,
with φf in place of f, and with Jx0(m)φ⊙x0P0 in place of P0. Note that Jx0(m)φ⊙x0P0 belongs to the
fiber at x0 of Hφf(l)=G(Hφf(l−1))=G(φ⊙Hf(l−1)), thanks
to Lemma 2.
Therefore, from ((6.0.21)), we obtain the following result.
Let f∈C0∞(Rn,RM), and
suppose Hf(l−1) is a proper bundle. Let x0∈E, P0∈P(m)(Rn,RD).
Suppose P0 belongs to the fiber at x0 of Hf(l).
Then, for any φ∈C0∞(Rn),
for each 0≤k≤kˉ, for each x1,⋯,xk∈E∖{x0} distinct, and for each ν=1,⋯,νmax#(k), we have
[TABLE]
Let 0≤k≤kˉ, x1,⋯,xk∈E distinct (also
distinct from x0), and ν=1,⋯,νmax#(k) be given. For each i=0,⋯,k, we may pick φ∈C0∞(Rn) so that φ≡1 in a neighborhood
of xi, but φ≡0 in a neighborhood of each xj(j=i). (That’s why we were careful to arrange that x0,⋯,xk are distinct.)
Let f∈C0∞(Rn,RM), and
suppose Hf(l−1) is a proper bundle. Let x0∈E, P0∈P(m)(Rn,RD).
(6.0.26)
If P0
belongs to the fiber of Hf(l) at x0,
then (\refB13) holds for 0≤k≤kˉ, x1,⋯,xk∈E∖{x0} distinct, and ν=1,⋯,νmax#(k); and also (\refB14) holds for 1≤k≤kˉ, x1,⋯,xk∈E∖{x0} distinct, i=1,⋯,k, and ν=1,⋯,νmax#(k).
The converse of ((6.0.26)) is immediate from ((6.0.21)). Therefore, we
obtain the following result, since the μνk(x0,⋯,xk) and λi,νk(x0,⋯,xk)
are semialgebraic.
There exist families of vector subspaces
[TABLE]
and
[TABLE]
with the following properties.
(6.0.28)
HGR,0(x0) depends semialgebraically on x0; HGR,1(x0,x) depends semialgebraically on x0, x.
(6.0.30)
Let f∈C0∞(Rn,RM), and suppose Hf(l−1) is a proper bundle. Let x0∈E, P0∈P(m)(Rn,RD).
Then P0 belongs to the fiber of Hf(l) at
x0 if and only if
[TABLE]
and
[TABLE]
For each x0∈E, there exist a vector subspace HGR,00(x0)⊂P(mˉˉ)(Rn,RM) and a linear map
[TABLE]
both depending semialgebraically on x0, such that the following holds:
(6.0.32)
Let x0∈E and let P#∈P(mˉˉ)(Rn,RM). Then there exists P0∈P(m)(Rn,RD) such that (P0,P#)∈HGR,0(x0), if and only if
P#∈HGR,00(x0). Moreover, if such a P0
exists, then (Tnew(x0)P#,P#)∈HGR,0(x0).
Indeed, ((6.0.32)) follows from linear algebra and standard properties of
semialgebraic sets and functions.
Now let f∈C0∞(Rn,RM),
and suppose Hf(l−1) is a proper bundle.
According to (\refB17), Hf(l)
is a proper bundle if and only if
•
Jx(mˉˉ)f∈HGR,1(x0,x) for all x0,x∈E with x0=x, and
•
For each x0∈E there exists P0∈P(m)(Rn,RD) such that (P0,Jx0(mˉˉ)f)∈HGR,0(x0).
Let f∈C0∞(Rn,RM), and
suppose Hf(l−1) is a proper bundle. Then Hf(l) is a proper bundle if and only if
•
Jx(mˉˉ)f∈HGR,1(x0,x) for all x0,x∈E with x0=x, and
•
Jx0(mˉˉ)f∈HGR,00(x0) for all x0∈E.
Moreover, if Hf(l) is a proper bundle, then,
for each x0∈E, Tnew(x0)Jx0(mˉˉ)f belongs to the fiber of Hf(l) at x0; consequently if Hf(l)
is a proper bundle, then Hf(l)=(Tnew(x)Jx(mˉˉ)f+I(l)(x))x∈E. (Recall that (I(l)(x))x∈E is the lth (strong)
Glaeser refinement of the homogeneous bundle (I(x))x∈E introduced in the setup of this section.)
The above remarks imply that there exists a family of vector subspaces Hnew(x)⊂P(mˉˉ)(Rn,RM), depending semialgebraically on x∈E, such that the following holds.
(6.0.34)
Let f∈C0∞(Rn,RM), and suppose Hf(l−1) is a proper bundle. Then Hf(l) is a proper bundle if and only if Jx(mˉˉ)f∈Hnew(x) for all x∈E.
Moreover, if Hf(l) is a proper bundle, then Hf(l)=(Tnew(x)Jx(mˉˉ)f+I(l)(x))x∈E.
We can now produce linear functionals λνnew(x):P(mˉˉ)(Rn,RM)→R, ν=1,⋯,νmaxnew, depending
semialgebraically on x∈E such that
[TABLE]
Setting Lνnewf(x):=λνnew(x)[Jx(mˉˉ)f], we obtain
the following from ((6.0.34)), (6.0.36):
•
Each Lνnew is a linear differential operator, with
semialgebraic coefficients, carrying functions in C∞(Rn,RM) to scalar-valued functions.
•
Let f∈C0∞(Rn,RM). Then Hf(l) is a proper bundle if and only
if Hf(l−1) is a proper bundle and Lνnewf=0 for ν=1,⋯,νmaxnew.
•
Let f∈C0∞(Rn,RM). Suppose Hf(l) is a proper bundle. Then
[TABLE]
Recall that Tnew(x) depends semialgebraically on x∈E.
The above bullet points and ((6.0.3)) together imply the conclusions of
Lemma 3.
This completes our induction on l, proving Lemma 3.
∎
In proving Theorem 2, we may suppose that f has
compact support, simply because E is compact.
Thus, let E⊂Rn be a compact semialgebraic set, and let M,N≥1. Suppose we are given a matrix (Aij)1≤i≤N,1≤j≤M of semialgebraic functions on E. Suppose further
we are given fi∈C0∞(Rn), i=1,⋯,N.
We want to solve the equations
[TABLE]
for unknown functions F1,⋯,FM∈Cm(Rn).
We write f=(f1,⋯,fN)∈C0∞(Rn,RN).
We reinterpret (7.0.1) in terms of bundles. For x∈E, let I(x)⊂P(m)(Rn,RM) be the set of all P=(P1,⋯,PM)∈P(m)(Rn,RM) such that
[TABLE]
Note that (7.0.2) involves only the values of the Pj at x, and
thus discards the higher-order information encoded in Pj.
Note also that I(x) depends semialgebraically on x.
Observe that I(x) is an Rxm-submodule of P(m)(Rn,RM). Indeed, if P=(P1,⋯,PM)∈I(x), and if Q∈Rxm, then
[TABLE]
and
[TABLE]
Therefore, condition (7.0.2) for P implies condition (7.0.2) for Q⊙xP.
(7.0.3)
For each x∈E, let Π(x) denote the orthogonal projection from RN onto the range of the matrix (Aij(x)).
(7.0.5)
For (ξ1,⋯,ξN)∈RN, let To(x)[ξ1,⋯,ξN] denote the vector (η1,⋯,ηM)∈RM that solves the
equation
[TABLE]
with the (Euclidean) norm of (η1,⋯,ηM) as
small as possible.
Thus, Π(x) and To(x) are matrices that
depend semialgebraically on x∈E.
(7.0.7)
For any P=(P1,⋯,PN)∈P(m)(Rn,RN), and any x∈E, let T(x)[P] be the vector of constant polynomials given by To(x)[P1(x),⋯,PN(x)].
We will prove the following two facts.
Lemma 4**.**
Let f=(f1,⋯,fN)∈C0∞(Rn,RN) be given. A function F=(F1,⋯,FM)∈Cm(Rn,RM) solves equations (\refS1) if and only if it
is a section of the bundle
[TABLE]
and (I−Π(x))f(x)=0 for all x∈E.
Lemma 5**.**
For f=(f1,⋯,fN)∈C0∞(Rn,RN), let Hf be
defined by (\refS6). Then for φ∈C0∞(Rn) and f=(f1,⋯,fN)∈C0∞(Rn,RN) we have
If (I−Π(x))f(x)=0 for some x∈E, then (f1(x),⋯,fN(x)) doesn’t belong to the range of (Aij(x)), so obviously equations (7.0.1) have no solution. Hence, we may
assume that
We will check the stronger result that the expression in square
brackets is zero.
In fact, T(x)Jx(m)f is the vector of
constant polynomials T^{o}\left(x\right)\left(\begin{array}[]{c}f_{1}\left(x\right)\\
\vdots\\
f_{N}\left(x\right)\end{array}\right) by definition (\refS5).
We take l in Lemma 3 to equal the large constant l∗ from Theorem 4.
We can then argue as follows.
Let f=(f1,⋯,fN)∈C0∞(Rn,RN) be given. Then, by Lemma 4, the
equations (7.0.1) admit a Cm solution (F1,⋯,FM) if and only if
[TABLE]
for all x∈E and Hf has a section.
By Theorem 4, this holds if and only if (I−Π(x))f(x)=0 for all x∈E and G(l∗)Hf is a proper bundle.
By Lemma 3, this in turn holds if and only if (I−Π(x))f(x)=0 for all x∈E and Lνf=0 on E for ν=1,⋯,νmax, where each Lν
is a linear partial differential operator with semialgebraic coefficients,
mapping functions in C∞(Rn,RN) to scalar-valued functions on Rn.
Since the equation (I−Π(x))f(x)=0
on E is also a system of such linear partial differential equations (of
order 0), the proof of Theorem 2 is complete. ∎
Let U be a bounded open semialgebraic subset of Rn and let (Aij(x))1≤i≤N,1≤j≤M be a matrix of
semialgebraic functions on Rn.
According to Theorem 2, there exist linear partial
differential operators Lν(ν=1,⋯,νmax) with
semialgebraic coefficients, such that given f∈C∞(Rn,RN) there exists F∈Cm(Rn,RM)
such that ∑j=1MAij(x)Fj(x)=fi(x)(i=1,⋯,N), all x∈Uclosure if and only if Lνf=0 on Uclosure, all ν.
Let mˉ be greater than or equal to the order of each Lν.
Now, suppose F∈Clocm(U,RM),
f∈C∞(U,RN), and ∑j=1MAij(x)Fj(x)=fi(x)(i=1,⋯,N) on U.
Fix x0∈U, and let θ∈C0∞(U).
Then θF∈Cm(Rn,RM), θf∈C∞(Rn,RN), and ∑j=1MAij(x)(θFj)(x)=(θfi)(x)(i=1,⋯,N)
on Uclosure.
Consequently, Lν(θf)(x0)=0 for all ν.
Given any P∈P(mˉ) there exists θ∈C0∞(U) such that Jx0(mˉ)θ=P, hence Lν(θf)(x0)=Lν(Pf)(x0).
Thus, Lν(Pf)=0 on U, all P∈P(mˉ), i.e.,
(8.0.1)
Lν(xγf)=0 on U for all ∣γ∣≤mˉ and each ν.
Thus, if f∈C∞(U,RN) admits a solution
F∈Clocm(U,RM) of ∑j=1MAijFj=fi (i=1,⋯,N) on U, then ((8.0.1))
holds.
Conversely, suppose ((8.0.1)) holds on U. Then Lν(Pf)(x0)=0 for any x0∈U, P∈P(mˉ),ν=1,⋯,νmax.
Let θ∈C∞(U). Then Lν(θf)(x0)=Lν([Jx0(mˉ)θ]f)(x0)=0, for any x0∈U; i.e., Lν(θf)=0 on U.
Lemma 6**.**
Given f1,⋯,fN∈C∞(U), there exists θ∈C∞(U) such that θ>0 on U, IUθfi∈C∞(Rn) for each i, and Jx(mˉ)(IUθfi)=0 for each x∈∂U. Here IU is the indicator function of U.
Proof.
Fix cutoff functions φν(x)(ν=1,2,3,⋯) with the following properties.
•
Each φν is a nonnegative C0∞ function on Rn.
•
Supp (φν)⊂⊂U for each ν.
•
For any x∈U we have φν(x)>0 for some ν.
For instance, we may take {φν} to be the
Whitney partition of unity, associated to the decomposition of U into
Whitney cubes. (See [16].)
We then fix a sequence of positive numbers τν(ν=1,2,3,⋯) with the following properties.
•
τν⋅∣∂αφν(x)∣≤2−ν for ∣α∣≤ν,x∈Rn.
•
τν⋅∣∂α(φνfi)(x)∣≤2−ν for ∣α∣≤ν,x∈Rn, i=1,⋯,N.
Such τν exist because φν, fi∈C∞(U) and supp φν⊂⊂U.
Indeed ((8.0.3)) holds in U, and it holds on ∂U because Jx(mˉ)(IUθfi)=0
for x∈∂U, while Lν has order ≤mˉ.
Because IUθf belongs to C∞(Rn,RN) and is annihilated by the Lν on Uclosure, there exists F~=(F~1,⋯,F~M)∈Cm(Rn,RM)
such that ∑j=1MAijF~j=IUθfi on Uclosure (i=1,⋯,N). Setting Fj=F~j/θ
on U (recall, θ>0 on U,θ∈C∞(U)), we have Fj∈Clocm(U) and ∑j=1MAijFj=fi on U (i=1,⋯,N).
So we have proven the following corollary of Theorem 2.
Corollary 2**.**
Let U be a bounded open semialgebraic subset of Rn, and let (Aij(x))1≤i≤N,1≤j≤M be a matrix of semialgebraic functions on U. Then there exist
linear partial differential operators L1,⋯,Lνmax with
semialgebraic coefficients such that
•
Each Lν maps vectors f of smooth functions to scalar-valued
functions.
•
Let f=(f1,⋯,fN)∈C∞(U,RN). Then the equations
[TABLE]
admit a solution F1,⋯,FN∈Clocm(U) if and
only if Lνf=0 on U for ν=1,⋯,νmax.
Finally, note that Rn is semialgebraically diffeomorphic to
the open unit cube U=(−1,1)n via the map
[TABLE]
Theorem 1 now follows at once from Corollary 2.
(Recall that our notation has changed; the function space called Cm(Rn,RM) in the Introduction is now called Clocm(Rn,RM).) ∎
As promised, all the semialgebraic sets and functions introduced in
Sections 3,…,8 above can be computed using the results and techniques
presented in Sections 2.5 and 2.6. Therefore, in principle, we can
compute the partial differential operators appearing in Theorem 1.
Bibliography17
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] Carlos Andradas, Ludwig Bröcker, and Jesús M. Ruiz. Constructible sets in real geometry , volume 33 of Ergebnisse der Mathematik und ihrer Grenzgebiete (3) [Results in Mathematics and Related Areas (3)] . Springer-Verlag, Berlin, 1996.
2[2] Saugata Basu, Richard Pollack, and Marie-Françoise Roy. Algorithms in real algebraic geometry , volume 10 of Algorithms and Computation in Mathematics . Springer-Verlag, Berlin, second edition, 2006.
3[3] Holger Brenner. Continuous solutions to algebraic forcing equations. ar Xiv:math/0608611 v 2 , august 2006.
4[4] Holger Brenner and Jonathan Steinbuch. Tight Closure and Continuous Closure. ar Xiv:1712.00337 , December 2017.
5[5] Neil Epstein and Melvin Hochster. Continuous closure, axes closure, and natural closure. Trans. Amer. Math. Soc. , 370(5):3315–3362, 2018.
6[6] Charles Fefferman. Whitney’s extension problem for C m superscript 𝐶 𝑚 C^{m} . Ann. of Math. (2) , 164(1):313–359, 2006.
7[7] Charles Fefferman, Arie Israel, and Garving K. Luli. Finiteness principles for smooth selection. Geom. Funct. Anal. , 26(2):422–477, 2016.
8[8] Charles Fefferman and János Kollár. Continuous solutions of linear equations. In From Fourier analysis and number theory to Radon transforms and geometry , volume 28 of Dev. Math. , pages 233–282. Springer, New York, 2013.