This paper improves the Finiteness Principle for nonnegative $ C^2(R^2) $ interpolation, reducing the finiteness constant and enhancing computational practicality, while also exploring one-dimensional interpolants and extension operators.
Contribution
It presents two sharper versions of the Finiteness Principle for nonnegative $ C^2 $ interpolation and analyzes extension operators, advancing theoretical understanding and computational methods.
Findings
01
Finiteness constant improved to 64
02
Provided detailed construction of nonnegative $ C^2 $ interpolants in 1D
03
Proved nonexistence of a bounded linear $ C^2 $ extension operator that preserves nonnegativity
Abstract
In this paper, we prove two improved versions of the Finiteness Principle for nonnegative C2(R2) interpolation, previously proven by Fefferman, Israel, and Luli. The first version sharpens the finiteness constant to 64, and the second version carries better computational practicality. Along the way, we also provide detailed construction of nonnegative C2 interpolants in one-dimension, and prove the nonexistence of a bounded linear C2-extension operator that preserves nonnegativity.
∥f∥C+m(E):=inf{∥F∥Cm(Rn):F∈C+m(Rn) and F∣E=f}.
∥f∥C+m(E):=inf{∥F∥Cm(Rn):F∈C+m(Rn) and F∣E=f}.
Jx0F(x):=F(x0)+∇F(x0)⋅(x−x0).
Jx0F(x):=F(x0)+∇F(x0)⋅(x−x0).
Ix0:a(s−s0)+b(t−t0)+c↦(a,b,c).
Ix0:a(s−s0)+b(t−t0)+c↦(a,b,c).
if Q↔Q′, then 41δQ≤δQ′≤4δQ.
if Q↔Q′, then 41δQ≤δQ′≤4δQ.
#({Q′∈Λ:89Q′∩89Q=∅})≤21.
#({Q′∈Λ:89Q′∩89Q=∅})≤21.
θQ≥0,supp(θQ)⊂89Q,∣∂αθQ∣≤CδQ−∣α∣∀∣α∣≤2, and Q∈Λ∑θQ≡1.
θQ≥0,supp(θQ)⊂89Q,∣∂αθQ∣≤CδQ−∣α∣∀∣α∣≤2, and Q∈Λ∑θQ≡1.
\Gamma_{+}(x,S,M):=\left\{P\in\mathcal{P}:\,\begin{matrix}[l]\text{There exists }F^{S}\in C^{2}_{+}(\mathbb{R}^{2})\text{ such that }\\
\|{F^{S}}\|_{C^{2}(\mathbb{R}^{2})}\leq M,F^{S}\big{|}_{S}=f,\text{ and }\mathscr{J}_{x}{F^{S}}=P.\end{matrix}\right\}\,,
\Gamma_{+}(x,S,M):=\left\{P\in\mathcal{P}:\,\begin{matrix}[l]\text{There exists }F^{S}\in C^{2}_{+}(\mathbb{R}^{2})\text{ such that }\\
\|{F^{S}}\|_{C^{2}(\mathbb{R}^{2})}\leq M,F^{S}\big{|}_{S}=f,\text{ and }\mathscr{J}_{x}{F^{S}}=P.\end{matrix}\right\}\,,
\sigma(x,S):=\left\{P\in\mathcal{P}:\,\begin{matrix}[l]\text{There exist }F^{S}\in C^{2}(\mathbb{R}^{2})\text{ such that }\\
F^{S}\big{|}_{S}=0,\|{F^{S}}\|_{C^{2}(\mathbb{R}^{2})}\leq 1,\text{ and }\mathscr{J}_{x}{F^{S}}=P.\end{matrix}\right\}\,.
\sigma(x,S):=\left\{P\in\mathcal{P}:\,\begin{matrix}[l]\text{There exist }F^{S}\in C^{2}(\mathbb{R}^{2})\text{ such that }\\
F^{S}\big{|}_{S}=0,\|{F^{S}}\|_{C^{2}(\mathbb{R}^{2})}\leq 1,\text{ and }\mathscr{J}_{x}{F^{S}}=P.\end{matrix}\right\}\,.
Γ+♯(x,k,M):=S⊂E,#(S)≤k⋂Γ+(x,S,M),
Γ+♯(x,k,M):=S⊂E,#(S)≤k⋂Γ+(x,S,M),
σ♯(x,k):=S⊂E,#(S)≤k⋂σ(x,S).
σ♯(x,k):=S⊂E,#(S)≤k⋂σ(x,S).
B(x,δ):={P∈P:∣∂αP(x)∣≤δ2−∣α∣}.
B(x,δ):={P∈P:∣∂αP(x)∣≤δ2−∣α∣}.
∣∂α(P−P′)(x)∣,∣∂α(P−P′)(x′)∣≤CM∣x−x′∣2−∣α∣ for ∣α∣≤1.
∣∂α(P−P′)(x)∣,∣∂α(P−P′)(x′)∣≤CM∣x−x′∣2−∣α∣ for ∣α∣≤1.
\Gamma_{+}^{\mathrm{temp}}(S):=\left\{P^{\prime}\in\mathcal{P}:\,\,\begin{matrix}[l]\text{There exists }F^{S}\in C^{2}_{+}(\mathbb{R}^{2})\text{ such that }\|{F^{S}}\|_{C^{2}(\mathbb{R}^{2})}\leq M,\\
F^{S}\big{|}_{S}=f,\mathscr{J}_{x}{F^{S}}=P,\text{ and }\mathscr{J}_{x^{\prime}}{F^{S}}=P^{\prime}.\end{matrix}\right\}\,.
\Gamma_{+}^{\mathrm{temp}}(S):=\left\{P^{\prime}\in\mathcal{P}:\,\,\begin{matrix}[l]\text{There exists }F^{S}\in C^{2}_{+}(\mathbb{R}^{2})\text{ such that }\|{F^{S}}\|_{C^{2}(\mathbb{R}^{2})}\leq M,\\
F^{S}\big{|}_{S}=f,\mathscr{J}_{x}{F^{S}}=P,\text{ and }\mathscr{J}_{x^{\prime}}{F^{S}}=P^{\prime}.\end{matrix}\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.
Taxonomy
TopicsNumerical methods in engineering · Advanced Numerical Methods in Computational Mathematics · Electromagnetic Scattering and Analysis
Full text
Nonnegative C2(R2) Interpolation
Fushuai Jiang111Department of Mathematics, University of California, Davis, One Shields Ave, Davis, CA 95616, USA [email protected]
Garving K. Luli222Department of Mathematics, University of California, Davis, One Shields Ave, Davis, CA 95616, USA
[email protected]
Abstract
In this paper, we prove two improved versions of the Finiteness Principle for nonnegative C2(R2) interpolation, previously proven by Fefferman, Israel, and Luli. The first version sharpens the finiteness constant to 64, and the second version carries better computational practicality. Along the way, we also provide a detailed construction of nonnegative C2 interpolants in one-dimension, and prove the nonexistence of a bounded linear C2-extension operator that preserves nonnegativity.
1 Introduction
For nonnegative integers m,n, we write Cm(Rn) to denote the Banach space of m-times continuously differentiable real-valued functions such that the following norm is finite
[TABLE]
If S is a finite set, we write #(S) to denote the number of elements in S. We use C to denote constants that depend only on m and n.
Problem 1**.**
Let E⊂Rn be a finite set. Let f:E→[0,∞). Compute the order of magnitude of
[TABLE]
By “order of magnitude” we mean the following: Two quantities M and M~ determined by E,f,m,n are said to have the same order of magnitude provided that C−1M≤M~≤CM, with C depending only on m and n. To compute the order of magnitude of M~ is to compute a number M such that M and M~ have the same order of magnitude.
Problem 1 without the nonnegative constraint has been extensively studied, see [3, 6, 10, 11, 8, 12].
Let E⊂Rn be a finite set. Let f:E→[0,∞). Compute a nonnegative function F∈Cm(Rn) such that F∣E=f and ∥F∥Cm(Rn)≤C∥f∥C+m(E).
We will present a brief history of Problem 1 and an overview of our results on Problems 1 and 2.
We start with elementary background. Given a subset E⊂Rn and f:E→R, we define the trace norm of f as
[TABLE]
we say that F∈Cm(Rn) is an almost optimal Cm(Rn) interpolant if F∈Cm(Rn), F∣E=f, and ∥F∥Cm(Rn)≤C(m,n)∥f∥Cm(E) for some constant C(m,n) depending only on m,n. For nonnegative interpolants, one can define analogously the trace norm by requiring the interpolant to be nonnegative, see (1.1).
For large enough k♯ and C, both depending only on m and n, the following holds:
Let f:E→R with E⊂Rn finite. Suppose that for each S⊂E with #(S)≤k♯ there exists FS∈Cm(Rn) with norm FSCm(Rn)≤1, such that FS=f on S. Then there exists F∈Cm(Rn) with norm ∥F∥Cm(Rn)≤C, such that F=f on E.
Theorem 0.A and several related results were first conjectured by Y. Brudnyi and P. Shvartsman[1, 2, 21]. The first nontrivial case C2(Rn) was proven by P. Shvartsman[20, 21] with the sharp finiteness constant k♯=3⋅2n−1. Theorem 0.A is further refined to a Sharp Finiteness Principle in [8], which serves as the backbone for efficient algorithms for computing trace norms and almost optimal interpolants.
For nonnegative smooth interpolation, in [15], the authors proved the following theorem.
Theorem 0.B** (Finiteness Principle for Nonnegative Smooth Interpolation).**
For large enough k♯ and C, both depending only on m and n, the following holds:
Let f:E→[0,∞) with E⊂Rn finite. Suppose that for each S⊂E with #(S)≤k♯, there exists FS∈Cm(Rn) with norm ∥FS∥Cm(Rn)≤1, such that FS=f on S and FS≥0 on Rn. Then there exists F∈Cm(Rn) with norm ∥F∥Cm(Rn)≤C, such that F=f on E and F≥0 on Rn.
The proof of Theorem 0.B given in [15] depends on a refinement procedure for shape fields proven in [14]. As such, the construction of the interpolant is not very explicit, and the finiteness constant k♯ is larger than it is necessary. For example, for m=2,n=2, [15] gives k♯≥100+5l∗+100 for some l∗≥100.
In this paper, we begin by showing that for m=2,n=2, k♯=64 is sufficient (see Theorem 4). Although not proven sharp here, it is a substantial improvement over the one given by [15].
For a better finiteness constant than [15] and also ours, see [22] (which gives k♯=8); however, the method in [22] assumes the validity of the Finiteness Principle and does not yield a construction for the interpolant.
With a more careful analysis of our proof for the Finiteness Principle, we are able to prove a Sharp Finiteness Principle analogous to the first one proven in [8] without the nonnegative constraint; the Sharp Finiteness Principle reads as follows: Given a finite set E⊂R2 with #(E)=N, we can produce a list of subsets S1,⋯,SL such that E=⋃ℓ=1LSℓ, #(Sℓ)≤C, and L≤CN such that ∥f∥C+2(E) and ℓ=1,⋯,Lmax∥f∥C+2(Sℓ) have the same order of magnitude. Thus, computing the order of magnitude of ∥f∥C+2(E) amounts to computing each ∥f∥C+2(Sℓ) for ℓ=1,⋯,L. In the forthcoming papers [17, 18], we will use this result to provide efficient algorithms analogous to the Fefferman-Klartag algorithms [10] for solving nonnegative interpolation problems.
Our two-dimensional results in this paper rely on their one-dimensional counterparts. We will provide a detailed analysis of the one-dimensional situation in Section 6. Along the way, we also show the nonexistence of a bounded linear extension operator that preserves nonnegativity. This is the content of Theorem 3. This is in sharp contrast to Cm(Rn) extensions without the nonnegative constraint, for which there exists a bounded linear extension operator of bounded depth[7].
Our approach is inspired by [7, 8, 9, 16]. However, we will need new ingredients to apply the machinery adapted from the aforementioned references.
Lastly, we remark that our approach can be adapted to treat nonnegative Cm(R) (m>2) extensions for finite sets E, and to prove the Finiteness Principle for nonnegative C1,ω(R2) extensions for arbitrary closed sets E.
Next, we sketch the main ideas for our approach, sacrificing accuracy for the ease of understanding.
We begin with interpolation in one-dimension. For nonnegative C2(R) interpolation, we will show that, if one can interpolate three consecutive points, then one can interpolate any finite set of points by patching consecutive three-point interpolants together.333Here we mention that the finiteness constant k♯=3 is sharp for nonnegative C2(R) interpolation. See [3]. To handle nonnegative C2(R2) interpolation, we will reduce local interpolation problems to the one-dimensional situation.
To illustrate the idea, we assume that E⊂Q0:=[0,1)×[0,1). For a square Q⊂R2, we write 2Q to denote the two times concentric dilation of Q, and δQ to denote the sidelength of Q. We perform a Calderón-Zygmund decomposition to Q0, bisecting Q0 and its children, which we will call Qν, until the following conditions are satisfied: Any two nearby squares are comparable in size; E∩2Qν lies on a curve with slope ≤C and curvature ≤CδQν−1; and any two local solutions near Qν are indistinguishable up to a Taylor error on the order of δQν. We then solve the local interpolation problem by straightening E∩2Qν and treating it as a one-dimensional problem. To ensure two nearby local solutions are Whitney compatible when patched together by a partition of unity, we prescribe a collection of Whitney-compatible polynomials, denoted by Pν, each based at a representative point xν near the center of Qν, and force the local solution to take Pν as a jet at xν.
The two-dimensional Finiteness Principle is then a consequence of its one-dimensional counterpart and Helly’s Theorem from combinatorial geometry.
In order to prove the Sharp Finiteness Principle, we need to localize the dependence of the Pν’s on the given data (E,f). This involves a variant of Helly’s Theorem, a careful analysis when f is locally small (on the order of δQ2), and the combinatorial properties of the Calderón-Zygmund squares.
Here we have given an overly simplified account of our approach. In practice, we have to control derivatives on small scales and handle subtraction with great care in order to preserve nonnegativity. The technical matters will be handled in the sections below.
Inspired by [3], we also pose the following question on the best finiteness constant for nonnegative C2(R2) interpolation, and conjecture the answer to be in the positive.
Problem 3**.**
For nonnegative C2(R2) interpolation, can we take k♯=6?
It would be interesting to know more about the connection between the methods employed in this paper and the method of “Lipschitz selection” presented in [3].
We end the introduction by announcing here our solutions to Problems 1 and 2; the detail will be presented in the forthcoming papers [17, 18]. For a given E⊂R2 with #(E)=N, we can process E with at most CNlogN operations and CN storage. After that, we can compute the order of magnitude of ∥f∥C+2(E) for any f:E→[0,∞) using at most CN operations. After preprocessing E using at most CNlogN operations and CN storage, we are able to receive further inputs, consisting of a function f:E→[0,∞) and a number M≥0. Then, given x∈R2, we are able to produce a list (fα(x):∣α∣≤2) using at most ClogN operations. Suppose an Oracle tells us that ∥f∥C+2(E)≤M. We can then guarantee the existence of a nonnegative function F∈C2(R2) with ∥F∥C2(R2)≤CM and F∣E=f, such that ∂αF(x)=fα(x) for ∣α∣≤2.
To the extend of our knowledge, there has been no previously known result on Problem 2.
This paper is part of a literature on extension and interpolation, going back to the seminal works of H. Whitney [25, 26, 27]. We refer the interested readers to [1, 2, 3, 5, 6, 7, 10, 11, 8, 14, 15, 12, 9, 20, 21, 23] and references therein for the history and related problems.
Acknowledgment*.*
We express our gratitude to Charles Fefferman, Kevin O’Neill, and Pavel Shvartsman for their valuable comments. We also thank all the participants in the 11th Whitney workshop for fruitful discussions, and Trinity College Dublin for hosting the workshop.
The first author is supported by the UC Davis Summer Graduate Student Researcher Award and the Alice Leung Scholarship in Mathematics. The second author is supported by NSF Grant DMS-1554733 and the UC Davis Chancellor’s Fellowship.
2 Statement of results
First we set up notations. Let n=1,2. We write C+2(Rn) to denote the collection of all functions F:Rn→[0,∞) whose derivatives up to the second order are continuous and bounded. We write ∂m to denote the m-th derivative of a single-variable function.
We begin with our results in one-dimension.
Theorem 1.A** (1-D Finiteness Principle).**
There exists a constant C>0 such that the following holds.
Let E={x1,…,xN}⊂R be a finite set with x1<⋯<xN and N≥3. Let f:E→[0,∞). Suppose
(i)
For every consecutive three points Ej={xj,xj+1,xj+2}(j=1,…,N−2) there exists a function Fj∈C+2(R) such that F_{j}\big{|}_{E_{j}}=f; and
2. (ii)
∥Fj∥C2(R)≤M.
Then there exists F∈C+2(R) with
(A)
F∣E=f, and
2. (B)
∥F∥C2(R)≤CM.
Remark 2.1*.*
In the present work, we do not pursue the minimal C. See, e.g. [9] for a discussion on best constants.
We will also need the following variant of Theorem 1.A in the proof of Lemma 5.4.
Theorem 1.B**.**
There exists a constant C>0 such that the following holds.
Let E={x1,…,xN}⊂R be a finite set with x1<⋯<xN and N≥3. Let f:E→R. Suppose
(i)
For every consecutive three points Ej={xj,xj+1,xj+2}(j=1,…,N−2), there exists a function Fj∈C2(R) such that Fj∣Ej=f;
2. (ii)
∣∂mFj∣≤Am* on R for m=0,1,2.*
Then there exists F∈C2(R) such that
(A)
F∣E=f;
2. (B)
∣∂mF∣≤CAm* on R for m=0,1,2.*
Remark 2.2*.*
The proofs of Theorems 1.A and 1.B will be given in Section 6.
Let n=1,2. Given a finite set E⊂Rn, we write C2(E) to denote all functions f:E→R, equipped with the trace norm ∥f∥C2(E):=inf{∥F∥C2(Rn):F∣E=f}. We write C+2(E) to denote all functions f:E→[0,∞), equipped with the “trace norm” ∥f∥C+2(E):=inf{∥F∥C2(Rn):F∣E=f and F≥0}.
The proofs of Theorems 1.A and 1.B along with an argument involving quadratic programming immediately give rise to the following results.
Theorem 2.A**.**
Let E⊂R be a finite set. There exist universal constants C,D and an operator E:C+2(E)→C+2(R) such that the following hold.
(A)
{\mathcal{E}}(f)\big{|}_{E}=f* for all f∈C+2(E).*
2. (B)
∥E(f)∥C2(R)≤C∥f∥C+2(E).
3. (C)
Moreover, for each x∈R, there exists S(x)⊂E with #(S(x))≤D, such that for all f,g∈C+2(E) with f∣S(x)=g∣S(x), we have
Theorem 2.A holds in the absence of the nonnegative constraint. This is the content of the next theorem.
Theorem 2.B**.**
Let E⊂R be a finite set. There exist universal constants C,D and a linear operator E:C2(E)→C2(R) such that the following hold.
(A)
{\mathcal{E}}(f)\big{|}_{E}=f* for all f∈C2(E).*
2. (B)
∥E(f)∥C2(R)≤C∥f∥C2(E).
3. (C)
Moreover, for each x∈R, there exists S(x)⊂E with #(S(x))≤D, such that for all f,g∈C+2(E) with f∣S(x)=g∣S(x), we have
[TABLE]
Remark 2.4*.*
The number D in Theorems 2.A and 2.B is called the depth of the operator E. The proofs of Theorems 2.A and 2.B will be given in Section 6. We also remark that the set S(x) takes a particularly simple form.
•
Suppose #(E)≤3. We take S(x)=E.
•
Suppose #(E)≥4. Enumerate E={x1,⋯,xN} with x1<⋯<xN.
–
If x<x1 or x>xN, we take S(x) to be the three points in E closest to x.
–
If x∈[x1,x2], we take S(x)={x1,x2,x3}.
–
If x∈[xN−1,xN], we take S(x)={xN−2,xN−1,xN}.
–
Otherwise, we take S(x)={x1′,x2′,x3′,x4′}⊂E with x1′<x2′<x3′<x4′ such that x∈[x2′,x3′].
It has been shown in [26] the existence of an extension operator satisfying (A,B) of Theorem 2.B. We thank P. Shvartsman for bringing to our attention that an algorithm for constructing S(x) in a more general one-dimensional setting (without nonnegativity) was given in [23], in which the interested readers will also find an informative account of the one-dimensional extension theory (without nonnegativity).
Theorem 3**.**
Let E⊂R be a finite set. There does not exist a map E:C+2(E)→C2(R) that satisfies both of the following.
(A)
For all f∈C+2(E), we have E(f)(x)=f(x) for all x∈E, E(f)≥0 on R, and ∥E(f)∥C2(R)≤C∥f∥C+2(E) for some universal constant C.
2. (B)
E(f+g)=E(f)+E(g)* for all f,g∈C+2(E).*
Remark 2.5*.*
By considering finite sets of the form E⊂Rn−1×{0}, we can further conclude that, for C2(Rn) with n≥2, there does not exist a bounded additive extension operator that preserves nonnegativity. See Section 6 for the proof.
We now turn to our results in two-dimension.
Theorem 4** (2-D Finiteness Principle).**
There exists a constant C>0 such that the following holds.
Let f:E→[0,+∞) with E⊂R2 finite. Suppose for each S⊂E with #(S)≤64, there exists FS∈C+2(R2) such that
In a forthcoming paper[17], we will prove the following result.
Theorem 6**.**
Let E⊂R2 be a finite set. There exist (universal) constants C,D, and a map E:C+2(E)×[0,∞)→C+2(R2) such that the following hold.
(A)
Let M≥0. Then for all f∈C+2(E) with ∥f∥C+2(E)≤M, we have E(f,M)=f on E and
∥E(f,M)∥C2(R2)≤CM.
2. (B)
For each x∈R2, there exists a set S(x)⊂E with #(S(x))≤D such that for all M≥0 and f,g∈C+2(E) with ∥f∥C+2(E),∥g∥C+2(E)≤M and f∣S(x)=g∣S(x), we have
RESULT: A list of numbers (fα(x):∣α∣≤2) that guarantees the following: There exists a function F~∈C+2(R2) with ∥F~∥C2(R2)≤CM and F~∣E=f, such that ∂αF~(x)=fα(x) for ∣α∣≤2.
We will present the proofs for Theorems 2 - 5 in the sections below. We will start from scratch and introduce the relevant terminologies and notations in the next section.
3 Conventions and Preliminaries
Constants
We use c∗,C∗,C,C′>0, etc. to denote “controlled” universal constants. They may be different quantities in different instances. We will label them to avoid confusion when necessary.
Coordinates and norms
We assume that we are given an ordered orthogonal coordinate system x=(s,t)standard on R2 a priori. We write B(x,r) to denote the open disc of radius r>0 centered at x∈R2.
We use α,β∈N02 etc. to denote multi-indices. We adopt the partial ordering α≤β if and only if αi≤βi for i=1,2.
Let Ω⊂Rn be a set with nonempty interior Ω0. For positive integers m,n, we write Cm(Ω) to denote the vector space of m-times continuously differentiable real-valued functions on Ω0 such that the following norm is finite:
[TABLE]
We write C+m(Ω) to denote the collection of functions F∈Cm(Ω) such that F≥0 on Ω. This is not a vector space.
Let E⊂Rn be finite. We define
[TABLE]
Cm(E) is a vector space that can be equipped with a seminorm, which we will called the trace norm of f∈Cm(E):
[TABLE]
Similarly, we define
[TABLE]
We will abuse terminology and refer to the following as the (nonnegative) trace norm of f∈C+m(E):
[TABLE]
Jets
We write P to denote the space of degree one polynomials on R2. It is a three-dimensional vector space.
For x0=(s0,t0)∈R2 and a continuously differentiable function F on R2, the 1-jet of F at x0∈R2 is given by
[TABLE]
We use Rx0 to denote the vector space of 1-jets at x0∈R2. Rx0 inherits a norm from R3 via the identification
[TABLE]
Calderón-Zygmund squares
A square Q⊂R2 is of the form Q=[s0,s0+δ)×[t0,t0+δ), where δ>0 and s0,t0∈R.
For a square Q⊂R2, λQ denotes the concentric dilation of Q by a factor of λ>0. Let Q∗=2Q. δQ denotes the side length of Q.
For a square Q0∈R2, by a dyadic bisection of Q0, we mean dividing Q0 into four mutually disjoint congruent squares Q1,Q2,Q3,Q4 such that Q0=⋃i=14Qi. Q0 is called the dyadic parent of Q1,…,Q4. In this case, we write Qi+=Q0 for i=1,…,4. A dyadic parent for a dyadic square is unique if it exists.
Two squares Q and Q′ are neighbors if one of the following holds.
•
Q=Q′; or
•
closure(Q)∩closure(Q′)=∅, but interior(Q)∩interior(Q′)=∅.
If Q and Q′ are neighbors, we write Q↔Q′.
A collection of mutually disjoint squares Λ={Q} is a Calderón-Zygmund (CZ) covering of R2 if R2=⋃Q∈ΛQ, and
[TABLE]
It is easy to see that (3.3) implies that a CZ covering satisfies the bounded intersection property: If Q∈Λ, then
[TABLE]
We will only consider nonnegative (smooth) cutoff functions and partition of unity. A C2-partition of unity {θQ} subordinate to a CZ covering Λ={Q} of R2 is CZ-compatible with Λ if
[TABLE]
Here C is some universal constant. Such partition of unity exists, see e.g.[25].
4 Basic convex sets and Whitney fields
Definition 4.1**.**
Let E⊂R2 be a finite set. Let f:E→[0,+∞). For a point x∈R2, a subset S⊂E, and a real number M≥0, we introduce the following objects:
[TABLE]
and
[TABLE]
Given an integer k≥0 and a number M≥0, we define
[TABLE]
and
[TABLE]
Since #(E)<∞, for sufficiently large M≥0 depending on E and f, Γ+(x,S,M)=∅ for any S⊂E. As a consequence, for a specific k, Γ+♯(x,k,M)=∅ if M is sufficiently large.
It is easy to see that Γ+, Γ+♯, σ, and σ♯ are convex and bounded (as subsets of R3 via the identification (3.2)). We can easily see from (4.2) and (4.4) that σ and σ♯ are symmetric about the origin. Since E is finite, for each fixed x∈R2 and M>0, there are only finitely many distinct σ(x,S) and Γ(x,S,M) (for a fixed M). Therefore, we may apply the finite version of Helly’s Theorem (see Section 4.1 for the statement). Both σ♯ and Γ+♯ are monotone decreasing (with respect to set inclusion ⊂) in k. Furthermore, Γ+♯ is monotone increasing in M.
Since σ and σ♯ contain the zero polynomial, they are never empty.
Understanding the shapes of Γ+♯ and σ♯ is the key to proving Theorems 4, 5, and 6.
We will also be working with the following object.
Definition 4.2**.**
Given x∈R2 and δ>0, we introduce the following object
[TABLE]
To understand the significance of B(x,δ), we point out that Taylor’s theorem can be reformulated in the following way: Given F∈C2(R2) with ∥F∥C2(R2)≤M, then JxF−JyF∈CM⋅B(x,∣x−y∣) for any x,y∈R2.
4.1 Lemmas on convex sets
Lemma 4.1**.**
Γ+♯(x,k,M)−Γ+♯(x,k,M)⊂2M⋅σ♯(x,k). The minus sign denotes vector subtraction.
Proof.
Let P1,P2∈Γ+♯(x,k,M). For each S⊂E with #(S)≤k, there exist F1S,F2S∈C+2(R2) such that for i=1,2, F_{i}^{S}\big{|}_{S}=f, ∥FiS∥C2(R2)≤M, and JxFiS=Pi.
Then (F_{1}^{S}-F_{2}^{S})\big{|}_{S}=0, ∥F1S−F2S∥C2(R2)≤2M, and JxF1S−F2S=P1−P2. Since S is arbitrary, P1−P2∈σ♯(x,k,2M)=2M⋅σ♯(x,k).
∎
We recall a classical result by Helly, the proof of which can be found in [19].
Helly’s Theorem**.**
Let F be a finite collection of convex sets in RD. Suppose every subcollection of F of cardinality at most (D+1) has nonempty intersection. Then the whole collection has nonempty intersection.
The following lemma states that we can control polynomials in Γ+♯ based at some point by polynomials that are based at a different point but are “less universal” (in the sense that it is the jet for an interpolant for fewer points).
Lemma 4.2**.**
There exists a universal constant C such that the following holds. Let x,x′∈R2. Let k1≥4k2. Let M≥0.
Given P∈Γ+♯(x,k1,M), there exists P′∈Γ+♯(x′,k2,M) such that
[TABLE]
Proof.
Fix P and M as in the hypothesis of the lemma. For each S⊂E, we define
[TABLE]
Then Γ+temp is a convex and bounded subset of P. Notice that
[TABLE]
It also follows from the definition of Γ+♯(x,k1,M) that
[TABLE]
Let S1,...,S4⊂E be given with #(Si)≤k2 for each i. Let S=⋃i=14Si. Then #(S)≤4k2≤k1. Thanks to (4.7), Γ+temp(S)=∅.
Since Si⊂S, (4.6) implies that Γ+temp(S)⊂Γ+temp(Si). Therefore,
[TABLE]
Since {Si}i=14 are arbitrary, applying Helly’s Theorem to the convex sets Γ+temp(Si)⊂P (with dimP=3), we have
[TABLE]
Let P′∈S⊂E,#(S)≤k2⋂Γ+temp(S). By definition, P′∈Γ+♯(x′,k2,M). Setting S=∅, we see that there exists F∈C+2(R2) with
•
∥F∥C2(R2)≤M; and
•
JxF=P and Jx′F=P′.
By Taylor’s theorem, we have
[TABLE]
The estimate for ∣∂α(P−P′)(x′)∣ is similar.
∎
Lemma 4.3**.**
Under the hypothesis of Theorem 4, Γ+♯(x,16,M)=∅ for all x∈R2.
Proof.
Recall that Γ+(⋅,⋅,⋅) is a convex set in a three-dimensional vector space P. By Helly’s Theorem, it suffices to show that the intersection of any four-element subfamily is nonempty. To this end, fix x∈R2, let S1,⋯,S4⊂E with #(Si)≤16, and let S=⋃i=14Si. We have
[TABLE]
Since #(S)≤64, the hypothesis of Theorem 4 implies that Γ+(x,S,M)=∅, and hence, the intersection on the right hand side of (4.8) is nonempty. This concludes the proof.
∎
The following variant of Helly’s Theorem can be found in Section 3 of [7].
Lemma 4.4**.**
Let F be a finite collection of compact, convex, and symmetric subsets of RD. Suppose [math] is an interior point for each K∈F. Then there exist K1,⋯,KD(D+1)∈F such that
[TABLE]
Here, CD is a constant that depends only on D.
Lemma 4.5**.**
There exists a universal constant C such that the following holds. Let x∈R2. Then given k≥0, there exist S1,⋯,S12⊂E, with #(Si)≤k for each i, such that
[TABLE]
Proof.
Let x∈R2. Note that σ♯(x,k) has nonempty interior (in the relative topology of the maximal affine space that it spans).
We apply Lemma 4.4 (with D≤dimP=3) to closure(σ(x,S)). Thus, there exist S1,⋯,S12⊂E with #(Si)≤k for each i=1,⋯,12, such that
[TABLE]
Therefore,
[TABLE]
This proves the lemma.
∎
4.2 Whitney fields
In this subsection, we assume n=1 or 2. We use P to denote the space of polynomials on Rn with degree no greater than one.
We now recall the notion of a Whitney field.
Let S⊂Rn be a finite set. We use W2(S) to denote the (finite dimensional) vector space of sections of S×P. An element P∈W2(S) is called a Whitney field, and has the form P=(Px)x∈S. W2(S) can be endowed with a norm
[TABLE]
We are interested in jets that can be extended to nonnegative C2 functions. For x∈Rn and M≥0, we define
[TABLE]
The next lemma tells us how to approximate Γ+.
Lemma 4.6**.**
There exists a universal constant C such that the following holds. Given M≥0, we have
[TABLE]
Proof.
The statement is clear for M=0.
Suppose M>0.
The first inclusion follows immediately from Taylor’s theorem. We prove the second inclusion.
Without loss of generality, we may assume x=0.
Pick P∈C+(0,M). We have
[TABLE]
and
[TABLE]
Restricting P to each one-dimensional subspace of Rn and using (4.13), we see that
[TABLE]
Let B be the unit disc in Rn. Let θ∈C+2(Rn) be a cutoff function satisfying
[TABLE]
We define
[TABLE]
Immediately, we have J0F=J0P~=J0P=P and F≥0 on Rn. Moreover,
[TABLE]
Since θ is supported in B, we can conclude that, ∥F∥C2(Rn)≤CM and J0F∈Γ+(0,∅,A) for A=CM. This concludes the proof.
∎
Definition 4.3**.**
Recall the definition of C+ in (4.11). Given a finite set S⊂Rn, we define
The definition of M is motivated by the estimate (4.14).
The following is immediate from Taylor’s theorem and Lemma 4.6.
Lemma 4.7**.**
Let F∈C+2(Rn). Let S⊂Rn be a finite set. For each x∈S, let Px:=JxF. Let P:=(Px)x∈S. Then P∈W+2(S) with ∥P∥W+2(S)≤C∥F∥C2(Rn) for some constant C depending only on n.
The next lemma follows immediately from Lemma 4.7.
Lemma 4.8**.**
Let S⊂Rn be a finite set. Given any f∈C+2(E), there exists P∈W+2(S) such that ∥P∥W+2(S)≤C∥f∥C+2(S) and Px(x)=f(x) for each x∈S. The constant C depends only on n.
Lemma 4.9** (Whitney extension theorem for finite sets).**
Let S⊂Rn be a finite set. There exist a constant C depending only on n, and a map WS:W+2(S)→C+2(Rn) such that the following hold.
(A)
∥WS(P)∥C2(Rn)≤C∥P∥W+2(S).
2. (B)
JxWS(P)=Px* for each x∈S.*
Sketch of proof.
We begin by assuming S={y}. We write ∗ instead of {∗} in certain places to avoid cumbersome notation.
Let P=P∈W+2(y).
Suppose P(y)=0. Since P∈W2(y), we must have ∇P≡0. Therefore, we simply set
[TABLE]
Conclusions (A) and (B) are satisfied.
Suppose P(y)>0.
By definition,
[TABLE]
Thus, P~(x):=P(x)+M∣x−y∣2≥0 for all x∈Rn.
Let χ be a cutoff function that satisfies χ≡1 near y, supp(χ)⊂B(y,1), and ∣∂αχ∣≤C for ∣α∣≤2. Define
[TABLE]
It is clear that Wy(P)≥0 and JyWy(P)=JyP~=P.
Moreover, for x∈B(y,1) and ∣α∣≤2
[TABLE]
Therefore,
[TABLE]
Next, we sketch the proof of the lemma for general S,
Let WC be a Whitney cover of Rn associated with the set S, and let {θQ} be a partition of unity compatible with WC. See [15].
In particular, WC and {θQ} satisfy the following properties.
•
Rn=⋃Q∈WCQ;
•
Q∈WC if and only if Q satisfies one of the following:
–
δQ=1 and S∩Q∗≤1 (recall that Q∗=2Q);
–
δQ<1, S∩Q∗≤1, and S∩(Q+)∗>1 (recall that Q+ is the dyadic parent of Q).
•
If Q,Q′∈WC and Q↔Q′ (i.e. the closures of Q and Q′ have nonempty intersection), then C−1δQ≤δQ′≤CδQ.
•
∑Q∈WCθQ≡1,
•
supp(θQ)∈Q∗ for each Q∈WC, and
•
∣∂αθQ∣≤CδQ−∣α∣ for ∣α∣≤2 and Q∈WC.
For each Q∈WC, we consider three different cases.
Case 1
When S∩Q∗=∅, we set WQ:=Wy where y∈S∩Q∗ and Wy is defined in (4.18). We set PQ:=Py.
2. Case 2
When S∩Q∗=∅ and δQ<1, we may pick y∈S∩(Q+)∗. We set WQ:=Wy and set PQ:=Py.
3. Case 3
When S∩Q∗=∅ and δQ=1, we set WQ≡0 and PQ:≡0.
Finally, we set
[TABLE]
One then verifies that WS(P)≥0 and ∥WS(P)∥C2(Rn)≤C∥P∥W+2(S) via Lemma 4.6 and a routine argument from the classical Whitney extension theorem. See [24] for details.
∎
5 Calderón-Zygmund squares
5.1 Calderón-Zygmund decomposition of R2
Definition 5.1**.**
Let Cnice>0 and k≥1. Recall the notation Q∗=2Q. We say a dyadic square Q is k-nice if for all x∈E∩Q∗,
[TABLE]
We now describe our decomposition procedure.
CZ Algorithm**.**
Let Q be a square.
•
If Q is k-nice, then return ΛQ(k)={Q};
•
otherwise, return
[TABLE]
Remark 5.1*.*
The algorithm terminates after finitely many steps for each unit square. To see this, notice that E is finite, and for fixed k and Cnice, (5.1) clearly holds for sufficiently small squares containing no more than one point. Moreover, since σ♯ does not depend on f, the complexity of our algorithm depends solely on the set E.
Definition 5.2**.**
For a particular choice of Cnice>0 and k≥1, we use Λnice(k)={Qi} to denote the collection of k-nice squares obtained from applying the algorithm above to each of the unit squares with their vertices on the integer lattice.
Lemma 5.1**.**
Λnice(k)* is a CZ covering of R2.*
Proof.
Since we obtain Λnice(k) by applying the algorithm to each square of the unit grid, Λnice(k) is indeed a covering of R2.
Suppose (3.3) fails, i.e., there exist some Q,Q′∈Λnice(k) with Q↔Q′ but
[TABLE]
Then (Q+)∗⊂(Q′)∗. Since Q+ is not k-nice, there exists x∈E∩(Q+)∗∖Q∗ such that
[TABLE]
On the other hand,
[TABLE]
A contradiction is reached once we combine all the inequalities above, because Q′ is k-nice.
∎
Our main goal is to construct a local interpolant for each k-nice square and then to patch these local solutions together. We need several lemmas that guarantee the consistency of our operation.
The following lemma states that polynomials in Γ+♯ with the same base point x control each other in the Whitney sense after our decomposition.
Lemma 5.2**.**
Let Cnice,k≥1, Q∈Λnice(k), x∈E∩Q∗, and 0≤∣α∣≤1. If P,P′∈Γ+♯(x,k,M), then
[TABLE]
Proof.
Note that (5.2) is immediate if δQ=1 or α=(0,0). Therefore, we only need to consider the case when δQ<1 and ∣α∣=1. The assumption δQ<1 implies that there exists y∈E∩(Q+)∗ such that diam(σ♯(y,k))<2CniceδQ. Fix such y.
Suppose toward a contradiction, that we can find a point x∈E∩Q∗ and P,P′∈Γ+♯(x,k,M) such that (5.2) is false for some ∣α∣=1. Fix such α.
By Lemma 4.1, P−P′∈2M⋅σ♯(x,k). By definition, for any S⊂E with #(S)≤k, there exists FS∈C2(R2) such that
•
F^{S}\big{|}_{S}=0,
•
∥FS∥C2(R2)≤2M, and
•
∂α(JxFS)=∂α(P−P′).
By assumption, ∣∂αFS(x)∣>14CniceMδQ. Since, x,y∈(Q+)∗, we have ∣x−y∣<6δQ. Therefore,
[TABLE]
Since S is arbitrary, we have diam(σ♯(y,k))≥2CniceδQ. A contradiction.
∎
Lemma 5.3**.**
Let Cnice,k≥1. There exists a universal constant C such that the following holds. Let Q,Q′∈Λnice(k). Let xQ∈Q and xQ′∈Q′. Let M≥0. Let PQ∈Γ+♯(xQ,4k,M) and PQ′∈Γ+♯(xQ′,4k,M). Then for ∣α∣≤1 and x∈100Q∪100Q′,
Since PQ and PQ′ are affine polynomials, (5.3) follows from (5.6) in the case ∣α∣=1. By the fundamental theorem of calculus, we have
[TABLE]
where seg(xQ′→x) is the straight line segment from xQ′ to x. Note that ∇(PQ−PQ′) is a constant vector since both PQ and PQ′ are affine. Taking the absolute value of (5.7) and applying (5.6) with ∣α∣=1, we conclude that (5.3) holds for ∣α∣=0.
∎
5.2 Local geometry
The goal of this section is to show that according to our decomposition, we have partitioned the data points into clusters whose geometry is essentially one-dimensional. To proceed, we introduce some notations.
Note that the C2 norm we are using in (3.1) is rotationally invariant. Let ω∈[−π/2,π/2]. We associate with ω a coordinate system obtained by rotating the plane counterclockwise about the origin by an angle of ω. Thus, for x∈R2,
[TABLE]
where xω(1)=scosω+tsinω and xω(2)=−ssinω+tcosω. When the choice of ω is clear, we write ∂1,∂2 to denote the partial derivatives with respect to the first, second variable, respectively. They coincide with the directional derivatives along ω and ω⊥, if we also treat ω as a unit vector.
If ϕ:I→R is a function defined on I⊂R, we denote by Graph(ϕ;I,ω) the graph of ϕ over I (with respect to the standard coordinate system) rotated by the angle ω.
Lemma 5.4**.**
Let k≥4 and let Cnice be sufficiently large. Suppose Q∈Λnice(k). Then there exist ω∈[−π/2,π/2] and a twice continuously differentiable function ϕ:R→R such that
•
E∩Q∗⊂Graph(ϕ;R,ω);
•
∣ϕ′∣≤1, and
•
∣ϕ′′∣≤δQ−1.
The constant C depends only on Cnice.
Proof.
If E∩Q∗=∅, there is nothing to prove. From now on, we assume E∩Q∗=∅.
Fix x0∈E∩Q∗. Let δ=δQ. Since Q∈Λnice(k), we have diam(σ♯(x0,k))≥Cniceδ.
Since σ♯ is symmetric about the origin, there exist Px0∈σ♯(x0,k) and ω=∥Ix0(Px0)∥Ix0(Px0) (where Ix0 is the identification map in (3.2) and ∥⋅∥ is the Euclidean norm) such that
[TABLE]
and
[TABLE]
Here, ∂i=∂xω(i) for i=1,2.
Claim 5.1**.**
Given any ϵ0>0, we may pick Cnice>0 large enough such that the following holds.
For any S⊂E∩Q∗ containing x0 with #(S)≤k, there exists ϕS∈C2(R) such that
Therefore, if Cnice is sufficiently large, the implicit function theorem yields a function ϕS∈C2(IS) for some open interval IS such that S⊂Graph(ϕS;IS,ω).
First we compute the derivatives of ϕS:
[TABLE]
From (5.11) - (5.13), we conclude that, for sufficiently large Cnice,
[TABLE]
This concludes the proof of the claim.
∎
Next, we define the projections πi:R2→R by πi((xω(1),xω(2)))=xω(i), for i=1,2. By Claim 5.1, we know that π1∣E∩Q∗ is a one-to-one map. Therefore, E∩Q∗ lies on a graph with respect to the xω(1)-axis.
It remains to see that the graph can be taken to have controlled derivatives.
For simplicity of notation, we suppress ω in the subscript.
Let x0=(x0(1),x0(2)). We may assume without loss of generality that π1(E∩Q∗)={x0(1),x1(1),…,xL−1(1)} such that x0(1)<x1(1)<⋯<xL−1(1), where L=#(E∩Q∗). Let π2(E∩Q∗)={x0(2),x1(2),…,xL−1(2)}, where xi(2)=π2∘π1−1(xi(1)) for i=1,…,L−1.
Let Ej={xj(1),xj+1(1),xj+2(1)} for j=1,…,L−3. Let Sj=π1−1(Ej)∪{x0}. By Claim 5.1, we know that there exist ϕSj∈C2(Ij) and a constant C, depending only on Cnice, such that
∣(ϕSj)′(x(1))∣≤ϵ0 for all x(1)∈[xj(1),xj+2(1)], and
•
∣(ϕSj)′′(x(1))∣≤ϵ0δQ−1 for all x(1)∈[xj(1),xj+2(1)].
Therefore, by Theorem 1.B and the fact that δQ≤1, we may choose ϵ0 sufficiently small such that there exists ϕ∈C2(R) such that
•
ϕ∣E∩Q∗=π2∘π1−1,
•
∥ϕ′∥C0(R)≤1, and
•
∥ϕ′′∥C0(R)≤δQ−1.
This completes the proof of the lemma.
∎
For future reference, we make the following definition.
Definition 5.3**.**
A pair (k,Cnice)guarantees good geometry if the following hold:
•
k≥4; and
•
Cnice is sufficiently large such that Lemma 5.4 holds.
Lemma 5.5**.**
Let (k,Cnice) guarantee good geometry. Let Q∈Λnice(k). There exist a universal constant C and a diffeomorphism Φ=ΦQ∈C2(R2,R2), such that the following hold.
(A)
Φ(E∩Q∗)⊂R×{0};
2. (B)
\big{\|}\nabla\Phi\big{\|},\|{\nabla\Phi^{-1}}\|\leq 2; and
3. (C)
∥∇2Φ∥,∥∇2Φ−1∥≤CδQ−1.
Here, ∥⋅∥ denotes the Euclidean norm.
Proof.
We may compose on the right by a rotation ω if necessary, and assume ω=0. Such rotation will not affect the Euclidean norm. Let ϕ be as in Lemma 5.4. Put
[TABLE]
They are clearly inverses of each other and are twice continuously differentiable.
Property (A) follows from how we construct ϕ (see Lemma 5.4).
To see (B), we note that
[TABLE]
Property (B) then follows from (5.15) and the first derivative estimate of ϕ in Lemma 5.4.
Further differentiating each matrix in (5.15), we see that the only nonzero terms occur when ∂s is applied to the bottom left entries and yields ∓ϕ′′. Conclusion (C) then follows from the second derivative estimate of ϕ in Lemma 5.4.
∎
Lemma 5.6**.**
Let (k,Cnice) guarantee good geometry. There exists a universal constant crep such that the following holds. Let Q∈Λnice(k). Then there exists xQ♯∈Q with dist(xQ♯,E)≥crepδQ.
Proof.
If E∩21Q=∅, we may pick xQ♯ to be the center of Q and let crep=1/4.
Suppose E∩21Q=∅. Fix x∈E∩21Q. There exists a universal constant c1>0 such that B(x,c1δQ)⊂Q, where B(x,c1δQ) is the ball of radius c1δQ centered at x. Let Φ be as in Lemma 5.5. (Again, we may assume ω=0.) By (B) of Lemma 5.5, there exists a constant c2>0, depending only on Cnice, such that B(Φ(x),c2δQ)⊂Φ(B(x,c1δQ)). Recall that Φ(E∩Q∗)⊂R×{0}. Let xQ♯:=Φ(x)+(0,c2δQ/2). Then dist(xQ♯,Φ(E∩Q∗))≥c2δQ/2. Let xQ♯=Φ−1(xQ♯). By (B) of Lemma 5.5 again, dist(xQ♯,E∩Q∗)≥c3δQ for some c3>0 depending only on Cnice. Finally, since xQ♯∈Q, dist(xQ♯,E∖Q∗)≥δQ/2. This concludes the proof of the lemma.
Let (k,Cnice) guarantee good geometry. Let Q∈Λnice(k). Let xQ♯ be as in Lemma 5.6. Then
[TABLE]
for some universal constant C.
Proof.
If δQ=1, then the lemma follows from the definitions of σ♯ and B.
Suppose δQ<1. Then Q+ exists and is not k-nice, meaning that there exists x∈E∩(Q+)∗ such that
[TABLE]
Fix such x. By our choice of xQ♯ (see Lemma 5.6), we have that
[TABLE]
Let P∈σ♯(xQ♯,4k). The argument in the proof of Lemma 4.2 applied to σ♯ yields P′∈σ♯(x,k) such that
[TABLE]
Moreover, since P′∈σ♯(x,k), by the definition of σ♯, we have P′(x)=0. Thanks to (5.16), we also have ∣∇P′∣≤CδQ. Therefore, we can conclude that
[TABLE]
Taylor’s theorem, together with (5.17) and (5.18), implies that P∈C⋅B(xQ♯,δQ). Since P is an arbitrary element in σ♯(xQ♯,4k), the lemma follows.
∎
6 1-D Results
In this section, we provide the proofs for our one-dimensional results. First, we will prove Theorem 1.B and indicate how the proof of Theorem 1.A follows. Then, we will sketch a proof for Theorem 2.A. The proof for Theorem 2.B uses the same idea but with easier intermediate steps.
We will use x,y to denote points on R, and ∂m to denote the m-th derivative of a single-variable function. When m=1, we simply write ∂ instead of ∂1. We use P to denote the vector space of one-variable polynomials with degree no greater than one.
For N≥3, let
I1=(−∞,x3], I2=[x2,x4], …, IN−3=[xN−3,xN−1], and IN−2=[xN−2,+∞). By assumption, for each j, there exists Fj∈C+2(R) with F_{j}\big{|}_{E_{j}}=f and
[TABLE]
We introduce a partition of unity {θj} that satisfies
(i)
∑j=1n−2θj≡1 on R;
2. (ii)
supp(θj)⊂Ij for each j=1,…,N−2; and
3. (iii) 222
For the existence of such partition function, see e.g. [25].
for each 1≤k≤2 and 1≤j≤N−2,
[TABLE]
Notice that the interior of Ii∩Ij supports at most two partition functions (θi and θj).
Define
[TABLE]
Clearly, F∣E=f, F is twice continuously differentiable, and
[TABLE]
Observe that (6.1) and condition (ii) of {θj} imply
[TABLE]
Suppose x∈(x2,xN−1). Let j be the least integer such that x∈Ij. The only partition functions possibly nonzero at x are θj and θj+1. Since θj(x)+θj+1(x)≡1, we have ∂kθj(x)=−∂kθj+1(x) for k=1,2. Thus,
Observe that (Fj−Fj+1)(xj+1)=(Fj−Fj+1)(xj+2)=0. By Rolle’s theorem, there exists xj∈(xj,xj+1) such that ∂(Fj−Fj+1)(xj)=0. By the fundamental theorem of calculus and triangle inequality, we have
[TABLE]
Similar calculations yield the case l=0. (6.8) is proven.
∎
We simply take Am=1 for m=0,1,2 in the above proof of Theorem 1.B, and note that F(x) defined by (6.3) is nonnegative if all of the Fj’s are nonnegative.
∎
6.2 C2(R) and C+2(R) extension operators of bounded depth
Let E⊂R be a finite set. We enumerate E={x1,⋯,xN} with x1<⋯<xN. Let Ei:={xi,xi+1,xi+2} for i=1,⋯,N−2. Suppose for each i, we are given an extension operator Ei:C+2(Ei)→C+2(R) with ∥Ei(f)∥C2(R)≤C∥f∥C+2(Ei) and \left({\mathcal{E}}_{i}(f)\right)\big{|}_{E_{i}}=f. Let {Ii} and {θi} be as in the proof of Theorem 1.A. We define
[TABLE]
Conclusions (A) and (B) of Theorem 2.A follow from the same argument as in the proof of Theorem 1.A. Moreover, by assumption, Ei(f) depends only on {f(xi),f(xi+1),f(xi+2)} for each i, and the θi’s have bounded overlap. Therefore, conclusion (C) and Remark 2.4 follow.
Hence, in order to construct a bounded extension operator with bounded depth in dimension one, it suffices to construct a bounded extension operator for every consecutive three points. This is a routine linear algebra problem and is readily solvable via the nonnegative Whitney extension theorem (see Lemma 4.9). We leave the details to the interested readers.
For Theorem 2.B, we simply replace each summand on the right-hand side in (6.11) with θi⋅Ei, where Ei is an extension operator associated with Ei without the nonnegative constraints.
Let ϵ>0 be a sufficiently small number. We use C,C′,C∗ etc. to denote universal constants.
Consider E={x1,x2,x3}⊂R, where xj=(j−1)ϵ for j=1,2,3. Suppose toward a contradiction, that E:C+2(E)→C+2(R) is a bounded extension map that is additive. That is, E(f+g)=E(f)+E(g) for all f,g∈C+2(E), and
[TABLE]
For j=1,2,3, we define
[TABLE]
Then f,g∈C+2(E), and f+g≡1. It is easy to see that
[TABLE]
In fact,
[TABLE]
Since E is bounded, we have
[TABLE]
We analyze the trace norms of f and g.
We begin with f. By calculating the divided difference, we see that
Let ψ be a cutoff function such that ψ≡1 in a neighborhood of [0,2ϵ], supp(ψ)⊂[−1,1], and ∣∂mχ∣≤C for m=0,1,2. Consider the function g~ defined by
[TABLE]
It is clear that g~∈C+2(R) with g~∣E=g. Moreover,
[TABLE]
Therefore,
[TABLE]
Since E is bounded, we know that, for x0 as in (6.14),
[TABLE]
Therefore, we have, with C0 and C1 as in (6.14) and in (6.15),
[TABLE]
For sufficiently small ϵ, this would contradict (6.12).
∎
7 2-D Finiteness Principle
7.1 Statement of the main local lemma
The goal of this section is to prove a local version of the finiteness principle, which produces a nonnegative local interpolant taking a jet in some prescribed Γ+♯ (see (4.3)) at a point sufficiently far away from the data. We will use these jets as transitions in our estimates.
Recall Definition 5.3. Also recall that Lemma 5.6 produces a point xQ♯∈Q such that
[TABLE]
for each Q∈Λnice(k) given that (k,Cnice) guarantees good geometry. We fix the number crep.
Lemma 7.1**.**
Let E⊂R2 be finite, and let f:E→[0,∞). Let (k,Cnice) guarantee good geometry and Q∈Λnice(k). Let xQ♯∈Q satisfy (7.1). Let kloc≥3. Suppose Γ+♯(xQ♯,kloc,M)=∅. Then there exist a universal constant C and a function FQ♯∈C+2(100Q) such that the following hold.
(A)
F_{Q}\big{|}_{E\cap Q^{*}}=f,
2. (B)
∥FQ∥C2(100Q)≤CM, and
3. (C)
JxQ♯FQ∈Γ+♯(xQ♯,kloc,CM).
Note that if #(E∩Q∗)≤kloc, the conclusion follows immediately.
Hereafter, we assume #(E∩Q∗)>kloc≥3.
The main idea of the proof is to treat the local interpolation problem differently depending on whether the local data is big or small. For big local data, we solve the problem as if there were no nonnegative constraints. For small local data, we simply prescribe a zero jet.
Below we give a more detailed overview of our strategy, still without dwelling into the technicalities.
Our approach relies on three crucial lemmas. The first one (Lemma 7.2) describes the relationships among the value, gradient, and zero set of a jet generated by a nonnegative function. The second one (Lemma 7.3) is a perturbation lemma, which specifies the conditions under which we are allowed to modify an element in Γ+♯(xQ♯,⋅,⋅). We emphasize the importance of the choice of base point xQ♯, which is far away enough from all the data points (on the order of δQ) so that we have room to modify the interpolants’ behavior near xQ♯. The third one (Lemma 7.5) tells us that the local data is either uniformly big or uniformly small (on the order of δQ2).
We begin the proof of Lemma 7.1 by first tackling a one-dimensional interpolation problem. Recall that, thanks to Lemma 5.4, the data points locally lie on a curve. The interpolation problem along this curve is essentially one-dimensional and readily solved, thanks to Theorems 1.A, 1.B, and Lemma 5.5.
We then solve the local problem when the local data is uniformly large, namely, minx∈E∩Q∗f(x)≥BδQ2 for some universal B>0 to be determined. We replace the local data f∣E∩Q∗ by g(x)=f(x)−P♯(x) for x∈E∩Q∗, where P♯ is a suitable element in Γ+♯(xQ♯,kloc,C) such that g achieves two zeros and that P♯≥B′δQ2 on 100Q for some B′>0 depending only on B. Thanks to Rolle’s theorem, the resulting one-dimensional g-interpolant, although not necessarily nonnegative, will be uniformly small on the order of δQ2, and in particular, bounded from below by −cδQ2.
Now, we are in the suitable order of magnitude to force a zero jet at x♯.
To do this, we simply extend the one-dimensional interpolant in the normal direction by constant, and use a bump function to damp out the function at xQ♯.
If we choose B such that B′ is bigger than c, we may add P♯ back to the zero-jet interpolant while preserving nonnegativity of the sum on 100Q, and solve the local problem.
Next, we solve the local problem when the data is not uniformly big. Thanks to Lemma 7.5, the local data has to be uniformly small, i.e., maxx∈E∩Q∗f(x)≤B′′δQ2 for some B′′>0 depending only on B. Therefore, we are in the correct order of magnitude to force a zero jet as in the previous step. Thanks to the perturbation lemma (Lemma 7.3), the zero jet in this case is indeed a kloc-point jet, and the problem is solved.
Sections 7.2 and 7.3 will be devoted to the proof of Lemma 7.1.
7.2 Key lemmas
In this section, we use Cartesian coordinates x=(s,t) on R2. We also write xQ♯=xQ♯=(sQ♯,tQ♯).
Lemma 7.2**.**
There exist universal constants C,C′,C′′ such that the following hold. Suppose P∈Γ+(x,∅,M). Then
[TABLE]
Proof.
(7.2) is a direct consequence of Taylor’s Theorem.
To see (7.3), we simply compute the discriminants of the left hand side of (7.2) restricted to the s and t-directions.
Now we prove (7.4). If P(x)=0 or P is a constant polynomial, the inequality is obvious. Assume that P(x)>0 and P is nonconstant.
Since P is an affine function and the gradient points toward the direction of maximal increase, we have
[TABLE]
From (7.3) and (7.5), we have the desired estimate.
∎
Lemma 7.3**.**
Let M>0. Let (k,Cnice) guarantee good geometry (see Definition 5.3), let k′≥1, and let Q∈Λnice(k). Let xQ♯ be as in Lemma 5.6. Suppose E∩Q∗=∅. Suppose Γ+♯(xQ♯,k′,M)=∅.
(A)
There exists a number B>0 exceeding a large universal constant such that the following holds. Suppose f(x)≥BMδQ2 for each x∈E∩Q∗. Then
[TABLE]
2. (B)
Let A>0. Suppose f(x)≤AMδQ2 for some x∈E∩Q∗. Then
[TABLE]
The number A′ depends only on A.
Proof.
We prove (A) first.
Let B>0 be sufficiently large.
Claim 7.1**.**
Under the hypothesis of (A). Given any P∈Γ+♯(xQ♯,k′,M), we have
Fix x∈E∩Q∗ such that f(x)≤BMδQ2. Since k′≥1, by the definition of Γ+♯, there exists a function F∈C+2(R2) with F(x)=f(x)≤AMδQ2, ∥F∥C2(R2)≤M, and JxQ♯F=P. By Lemma 7.2, we have
[TABLE]
By Taylor’s theorem, we see that
[TABLE]
By the fundamental theorem of calculus, we see that
It remains to show that 0∈Γ+(xQ♯,S,A′M) for each S⊂E with #(S)≤k′.
We use A0,A1, etc. to denotes quantities that depend only on A.
Fix P∈Γ+♯(xQ♯,k′,M). Let S⊂E satisfy #(S)≤k′. By definition, there exists FS∈C+2(R2), such that F^{S}\big{|}_{S}=f, ∥FS∥C2(R2)≤1, and JxQ♯FS=P. By Claim 7.2, we see that P(xQ♯)≤A0MδQ2 and by (7.3) that ∣∇P∣≤A1MδQ. In other words,
[TABLE]
The fundamental theorem of calculus then implies
[TABLE]
Let ψ∈C+2(R2) be a cutoff function such that
[TABLE]
Let
[TABLE]
We have the following.
•
By (7.1) and the fact that supp(ψ)⊂B(xQ♯,100crepδQ), we have \tilde{F}^{S}\big{|}_{S}=f.
•
By (7.16) and the assumption that FS≥0, we have F~S≥0 on R2.
Since S is arbitrary, we have 0∈Γ+♯(xQ♯,k′,A2M). This completes the proof of (B) and the proof of the lemma.
∎
Lemma 7.4**.**
There exists a universal constant B>0 such that the following holds.
Let M>0. Let (k,Cnice) guarantee good geometry (see Definition 5.3). Let Q∈Λnice(k). Let xQ♯ be as in Lemma 5.6. Suppose E∩Q∗=∅ and f(x)≥BMδQ2 for all x∈E∩Q∗. Let k′≥0. Then
[TABLE]
Proof.
This is a direct consequence of Lemma 5.7 and Lemma 7.3 .
∎
Lemma 7.5**.**
For each Bmin>0, we can find Bmax, depending only on Bmin, such that the following holds.
Let E⊂R2 be a finite set. Let f:E→[0,∞). Let k′≥2. Suppose Γ+♯(x,k′,M)=∅ for all x∈R2. Let (k,Cnice) guarantee good geometry. Let Q∈Λnice(k).
Then at least one of the following holds.
(A)
f(x)≤BmaxMδQ2* for all x∈E∩Q∗.*
2. (B)
f(x)≥BminMδQ2* for all x∈E∩Q∗.*
Proof.
Fix Bmin>0. We use B,B′, etc. to denote quantities that depend only on Bmin.
Without loss of generality, we may assume M=1.
If x∈E∩Q∗minf(x)≥BminδQ2, there is nothing to prove.
Suppose there exists x0∈E∩Q∗ such that f(x0)<BminδQ2. Fix such x0.
Let S⊂E∩Q∗ satisfy x0∈S and #(S)≤k′. Since Γ+♯(x,k′,1)=∅ for each x∈R2, there exists FS∈C+2(R2) such that F^{S}\big{|}_{S}=f and ∥FS∥C2(R2)≤1.
Since FS(x0)<BminδQ2, (7.3) implies there exists B>0 such that
[TABLE]
Therefore, since ∥FS∥C2(R2)≤1, we have ∣∇FS(x)∣≤B′δQ for all x∈Q∗. By the fundamental theorem of calculus, since FS(x0)<BminδQ2, we must have ∣FS(x)∣≤B′′δQ2 for all x∈Q∗. In particular,
[TABLE]
Let Bmax:=B′′. Since S is arbitrary and is allowed to contain more than one point, we may conclude the proof of the lemma once we let S range over all k′-point subsets of E∩Q∗ containing x0.
∎
7.3 Solving the local problem
In this subsection, we prove Lemma 7.1. We fix the local data structure for the rest of the section.
Local Data Structure (LDS)
•
A lengthscale δ≤1.
•
A square Q⊂R2 with δQ=δ.
•
A representative point x♯∈Q such that dist(x♯,E)≥crepδ.
•
A function ϕ∈C2(R) that satisfies ∣ϕ(k)∣≤δ1−k for k=1,2.
•
A diffeomorphism Φ:R2→R2 given by Φ(s,t)=(s,t−ϕ(s)).
•
Eloc=E∩Q∗ such that Eloc⊂{(s,ϕ(s)):s∈R}.
Any Q∈Λnice(k) with (k,Cnice) guaranteeing good geometry admits the local data structure, thanks to Lemmas 5.4, 5.5, and 5.6.
We have shown in Lemma 7.5 that each local interpolation problem belongs to at least one of the two categories: The function’s local values are uniformly big (minx∈Elocf(x)≥Bminδ2), or are uniformly small (maxx∈Elocf(x)≤Bmaxδ2). The next lemma solves the former case.
Lemma 7.6**.**
There exists a sufficiently large Bmin>0 such that the following holds.
Let LDS be given. Let kloc≥3. Suppose Γ+♯(x♯,kloc,M)=∅, and f≥Bminδ2 on Eloc. Then there exists F∈C+2(R2) with F\big{|}_{E_{\mathrm{loc}}}=f, ∥F∥C2(100Q)≤CM, and Jx♯F∈Γ+♯(x♯,kloc,CM).
Proof.
Without loss of generality, we may assume M=1.
We will use b,B,B′, etc. to denote quantities that depend only on Bmin, and c,C,C′, etc. to denote universal constants.
Let P∈Γ+♯(x♯,kloc,1). Pick distinct x1,x2∈Eloc. Let P♯ be the unique affine polynomial that passes through (x1,f(x1)),(x2,f(x2)), and (x♯,P(x♯)). We first prove two claims about P♯.
For convenience of notation, we temporarily label x0:=x♯.
Let S={x1,x2}. Since P∈Γ+♯(x0,kloc,1) with kloc≥3, there exists FS∈C+2(R2) with F^{S}\big{|}_{S}=f, ∥FS∥C2(R2)≤1, and Jx0FS=P. In particular, FS agrees with P♯ at xi for i=0,1,2.
Let Lij be the (open) segment connecting xi and xj. The Lij’s are the sides of Triangle(x0,x1,x2). Let uij=∣xj−xi∣xj−xi. Rolle’s theorem implies that there exist ξij∈Lij such that
[TABLE]
Since ∥FS∥C2(R2)≤1 and P♯ is an affine polynomial, we have
[TABLE]
Since dist(x0,E)≥crepδ and Eloc lies on the graph of ϕ with ∣ϕ′∣≤1, we have
[TABLE]
for some γ>0 depending only on crep.
Let ω be any unit vector. (7.19) implies that we can write
[TABLE]
Here, C is a constant depending only on γ. (7.20) implies that
[TABLE]
We conclude (7.17) by letting ω range over all unit vectors. Thanks to Lemma 7.3, P♯∈Γ+♯(x♯,kloc,C). This proves the claim.
Recall from LDS that Eloc lies on the graph of a C2 function ϕ. Therefore, we may write Eloc={zi=(si,ϕ(si)):1≤i≤N} with si<si+1 for all i=1,⋯,N−1.
For i=1,⋯,N−2, let Si={zi,zi+1,zi+2}. By Claim 7.3, P♯∈Γ+♯(x♯,kloc,C). By definition, there exists FSi∈C+2(R2) such that F^{S_{i}}\big{|}_{S_{i}}=f, ∥FSi∥C2(R2)≤C, and Jx♯FSi=P♯.
Define g:Eloc→R by
[TABLE]
Note that g is not necessarily nonnegative.
Define GSi:R2→R by
[TABLE]
Then immediately, we have
[TABLE]
Since P♯∈Γ+♯(x♯,kloc,C), we have ∥P♯∥C2(100Q)≤C.
From this, together with the condition ∥FSi∥C2(R2)≤C, we learn that
[TABLE]
Thanks to (7.23), (7.24), and the fundamental theorem of calculus, we have
[TABLE]
Let I1=(−∞,s3],I2=[s2,s4],⋯,IN−3=[sN−3,sN−1], and IN−2=[sN−2,+∞). Let {θi:R→R} be a partition of unity subordinate to {Ii} such that
[TABLE]
Note that the interior (in the topology of R) of Ii∩Ij supports at most two partition functions.
Let
[TABLE]
It follows immediately that the interior of (Ii×R)∩(Ij×R) supports at most two partition functions. It is also clear that
[TABLE]
Recall Φ as in LDS. Define
[TABLE]
where γ(s):=(s,ϕ(s)) is a parametrization of the graph of ϕ.
Claim 7.5**.**
The function G satisfies G\big{|}_{E_{\mathrm{loc}}}=g and ∥G∥C2(100Q)≤C.
Fix Bmin as in Lemma 7.6. The following lemma complements Lemma 7.6.
Lemma 7.7**.**
Let LDS be given. Let kloc≥3.
Suppose Γ+♯(x♯,kloc,M)=∅, and that there exists x∈Eloc such that f(x)<BminMδ2. Then there exists F∈C+2(100Q) such that F\big{|}_{E_{\mathrm{loc}}}=f, ∥F∥C2(100Q)≤BM, and Jx♯F∈Γ+♯(x♯,kloc,BM). The number B depends only on Bmin.
Proof.
Without loss of generality, we may assume M=1.
We write B1,B2, etc. to denote quantities depending only on Bmin.
By Lemma 7.5, there exists Bmax>0, depending only on Bmin such that
Recall that Eloc lies on the graph of a C2 function ϕ. Write Eloc={zi=(si,ϕ(si)):1≤i≤N} with si<si+1 for all i=1,⋯,N−1.
For i=1,⋯,N−2, let Si={zi,zi+1,zi+2}. By (7.42), there exists FSi∈C+2(R2) such that F^{S_{i}}\big{|}_{S_{i}}=f, ∥FSi∥C2(R2)≤B4, and Jx♯FSi≡0.
Let I1=(−∞,s3],I2=[s2,s4],⋯,IN−3=[sN−3,sN−1], and IN−2=[sN−2,+∞). Let {θi} be a partition of unity subordinate to {Ii} such that
[TABLE]
Put
[TABLE]
Recall the diffeomorphism Φ in LDS. Define F:R2→R by
[TABLE]
It is clear that F≥0. By the same argument as in the proof of Claim 7.5, we have F∣Eloc=f and ∥F∥C2(100Q)≤B2.
Since f≤Bmaxδ2 on Eloc and F is constant in the t-direction, we also have
[TABLE]
Let ψ∈C+2(R2) be a cutoff function such that
•
0≤ψ≤1 on R2, ψ≡1 near x♯, supp(ψ)⊂B(x♯,100crepδ); and
•
∣∂αψ∣≤Cδ2−∣α∣ for ∣α∣≤2.
Define F:R2→R by
[TABLE]
The following hold.
•
F≥0, since F≥0 and 0≤ψ≤1.
•
F\big{|}_{E_{\mathrm{loc}}}=f, thanks to (7.1) and the fact that supp(ψ)⊂B(x♯,100crepδ).
•
Jx♯F≡0∈Γ+♯(x♯,kloc,B4), since ψ≡1 near x♯.
•
∥F∥C2(100Q)≤B3. To see this, we note that since F≥0 on R2, ∥F∥C2(100Q)≤B2, and ∣F∣≤CBmaxδ2 on 100Q, (7.3) implies that ∣∇F∣≤B4δ on 100Q. Thanks to the second condition on ψ, the conclusion follows.
Before proceeding to the proof of Theorem 4, we make a brief comment on the finiteness constant 64. Lemma 4.2 and Lemma 5.3 state that jets of 4k-point interpolants based in neighboring squares from Λnice(k) are compatible in the Whitney sense (see (5.3)); Lemma 5.4 states that the geometry of data points in each square of Λnice(k) is sufficiently nice when k≥4; Lemma 7.1 states that in such case, a local version of the extension problem is readily solved. Hence, if we pick k=4, we may use the jets of 4⋅4=16-point interpolants (if they exist) to guarantee compatibility of nearby local extensions. By Lemma 4.3, such jets exist.
Now, we examine compatibility of the local interpolants constructed in Lemma 7.1.
Let {θQ} be a partition of unity that is CZ-compatible with Λnice(4). Define
[TABLE]
It is clear that F≥0, F∣E=f, and F is twice continuously differentiable.
For ∣α∣≤2 and x∈Q,
[TABLE]
Applying (3.4), (3.5), (7.43), and (7.44) to (7.47), we can conclude that
[TABLE]
∎
8 Sharp Finiteness Principle
In this section, we give the proof of Theorem 5. Here we remind the readers the statement of the theorem.
Theorem 5** (2-D Sharp Finiteness Principle).**
Let E⊂R2 with #(E)=N<∞. Then there exist universal constants C,C′,C′′ and a list of subsets S1,S2,⋯,SL⊂E satisfying the following.
(A)
#(Sℓ)≤C* for each ℓ=1,⋯,L.*
2. (B)
L≤C′N.
3. (C)
Given any f:E→[0,∞), we have
[TABLE]
Before we proceed to the proof, we briefly explain the clusters Sℓ’s in the statement.
For each square Q∈Λnice(k), we associate to it a basic cluster S(xQ♯) (see Definition 8.2) that guarantees internal Whitney compatibility.
The clusters in Theorem 5 can be classified into three types.
•
The first type is the union of a “consecutive” three-point cluster (since E locally lies on a curve with controlled geometry), nearby basic clusters, and nearby “keystone” clusters (see next bullet point). This is the “largest” type of clusters, since it plays the key role of relaying information about E to various lengthscales.
•
The second type is the basic cluster for each “keystone square” (see Definition 8.1). Keystone squares are locally the smallest squares and they play an important role in relaying information to nearby small squares containing no data point.
•
The third type is the union of keystone square clusters (see the second bullet point above) that are associated with each “special square” (see Lemma 8.2). This type of clusters is used to eliminate the ambiguity in how these special squares receive information from E.
We now give the full account.
8.1 CZ squares and clusters
Let (k,Cnice) guarantee good geometry (Definition 5.3). We fix such (k,Cnice) for the rest of the section. We may assume, for instance,
[TABLE]
Definition 8.1**.**
We define the following objects.
•
We set
[TABLE]
•
We also set
[TABLE]
Note that Λ♯ coincides with Type 1 squares in the proof of Theorem 4 (Section 7.4).
•
We say Q∈Λ0 is a keystone square if δQ<1 and for any Q′∈Λ0 with Q′∩100Q=∅, we have δQ′≥δQ. The collection of keystone squares is denoted by ΛKS.
Keystone squares first appear in the work of Sobolev extension[16]. See also [13] for a more thorough discussion.
The proof of Lemma 8.1 can be found in Section 4 of [16] and Section 7 of [13].
Next, we define the basic cluster associated with each square in Λ0.
Definition 8.2**.**
Let Q∈Λ0 and let xQ♯ be as in Lemma 5.6. (Note that xQ♯ is a representative point “far” from the data on the lengthscale δQ.) Let S1,⋯,S12⊂E be as in Lemma 4.5 (with x=xQ♯ and 4k in place of k). We define
Next, we state a key lemma that allows us to relay information from keystone squares to small squares in Λ0 whose neighborhood contains no points from E. The latter requires separate attention for the following reason: Suppose Q∈Λ0 with δQ<1 and E∩Q∗=∅. Then (Q+)∗ may intersect an uncontrolled number of squares in Λ♯. Keystone squares are designed partially to deal with such situations. See [16, 13] for further discussion.
Lemma 8.2**.**
Let Λ0,ΛKS be as in Definition 8.1. We can find a subset Λspecial⊂Λ0 and a map μ:Λ0→ΛKS such that the following holds for some universal constant C.
(A)
#(Λspecial)≤C⋅#(E).
2. (B)
μ(Q)∈ΛKS, where ΛKS is as in Definition 8.1. Moreover, dist(Q,μ(Q))≤CδQ.
3. (C)
Suppose Q,Q′∈Λ0∖Λspecial and Q↔Q′, then μ(Q)=μ(Q′).
The proof of Lemma 8.2 can be found in Section 6 of [13].
Definition 8.3**.**
Recall Λ0,Λ♯,ΛKS as in Definition 8.1. Recall the representative point xQ♯ as in Lemma 5.6. Let Q∈ΛKS. We define
[TABLE]
where S(xQ♯) is as in (8.3). Recall Λspecial,μ as in Lemma 8.2. Let Q∈Λspecial. We define
[TABLE]
where xμ(Q′)♯ is as in Lemma 5.6 and S(xμ(Q′)♯) is as in (8.3).
Recall from Lemma 5.1 that Λ0 is a CZ covering of R2. In particular, Λ0 enjoys the bounded intersection property (3.4). Together with (8.4) and the definitions of SKS,Sspecial in (8.6),(8.7), we see that
[TABLE]
Now we turn our attention to clusters associated with Λ♯.
For convenience, we set, for each Q∈Λ♯,
[TABLE]
Thanks to Lemma 5.4, we know that for each Q∈Λ♯, up to a rotation, E∩Q∗⊂{(s,ϕ(s)):s∈R}, where ϕ is as in Lemma 5.4. We enumerate
For the rest of this section, whenever we consider Q∈Λ♯, we always assume that Q has been rotated so that enumeration of the form (8.10) holds.
The next three definitions describe the objects of interest in this section. Definitions 8.4 and 8.5 concern the clusters, and Definition 8.6 concerns the main polynomial convex sets.
By the bounded intersection property of Λ0 (see (3.4)), we have
[TABLE]
Definition 8.5**.**
Let Q∈Λ♯. Let S(Q,ν) be as in Definition 8.4. Let xQ♯ be as in Lemma 5.6. Let μ be the map in Lemma 8.2. Let S(⋅) be as in (8.3). For each ν=1,⋯,ν(Q), we set
[TABLE]
Remark 8.1*.*
The cluster S(Q,ν) associated with each Q∈Λ♯ is the “largest” among all three types of clusters (the other two being SKS(Q) in (8.6) and Sspecial(Q) in (8.7)). This is as expected, since each Q∈Λ♯ satisfies E∩Q∗=∅, and must relay information to neighboring squares and their keystone representatives.
Thanks to (8.4), the fact that #(S(Q,ν))≤3, and the bounded intersection property of Λ0 (see (3.4)), we have
There exists a universal constant C such that the following holds.
Let Q,Q′∈Λ0. Let xQ♯,xQ′♯ be as in Lemma 5.6. Let S(xQ♯) be as in (8.3). Let S,S′⊂E. Suppose
[TABLE]
Then given P∈Γ+(xQ♯,S,M) and P′∈Γ+(xQ′♯,S′,M), we have
[TABLE]
Proof.
Fix P and P′ as in the hypothesis. By definition, there exist F,F′∈C+2(R2) such that the following hold.
By Lemma 5.7 and the definition of S(xQ♯) in (8.3), we see that
[TABLE]
By the triangle inequality, we have
[TABLE]
Using (8.21) to estimate the first term, and using Taylor’s theorem to estimate the second, we see that (8.20) holds.
∎
Remark 8.2*.*
We note that Lemma 8.3 is a one-sided estimate, in the sense that the right hand side of (8.20) does not contain the lengthscale δQ′. However, this is remedied once we know that Q↔Q′. This is further examined in the next corollary, which states that suitable choices of clusters give rise to Whitney compatible jets.
Corollary 8.1**.**
There exists a universal constant C such that the following holds. Let Λ0,Λ♯,ΛKS be as in Definition 8.1. Let Λspecial and μ be as in Lemma 8.2. For Q∈Λ0, let xQ♯ be as in Lemma 5.6, and let S(xQ♯) be as in (8.3). Suppose Q,Q′∈Λ0 with Q↔Q′ and P,P′∈P satisfy one of the following conditions.
(A)
Suppose Q,Q′∈Λ♯. Let ν=1,⋯,ν(Q) and ν′=1,⋯,ν(Q′) (Definition 8.5). Let K(⋅,⋅,⋅) be as in Definition 8.6. Suppose P∈K(Q,ν,M) and P′∈K(Q′,ν′,M).
2. (B)
Suppose Q∈Λ♯ and Q′∈Λ0∖(Λ♯∪Λspecial). Suppose P∈K(Q,ν,M) (Definition 8.6) for some ν∈{1,⋯,ν(Q)} (Definition 8.5). Suppose P′∈Γ+(xμ(Q′)♯,SKS(μ(Q′)),M), with SKS(μ(Q′)) as in (8.6).
3. (C)
Suppose Q∈Λ♯ and Q′∈Λspecial∖Λ♯. Suppose P∈K(Q,ν,M) (Definition 8.6) for some ν∈{1,⋯,ν(Q)} (Definition 8.5). Suppose P′∈Γ+(xQ′♯,Sspecial(Q′),M), with Sspecial(Q′) as in (8.7).
4. (D)
Suppose Q,Q′∈Λ0∖(Λ♯∪Λspecial). Suppose P∈Γ+(xμ(Q)♯,SKS(μ(Q)),M) and suppose P′∈Γ+(xμ(Q′)♯,SKS(μ(Q′)),M), with SKS(μ(Q)) and SKS(μ(Q′)) as in (8.6).
5. (E)
Suppose Q∈Λ0∖(Λ♯∪Λspecial) and Q′∈Λspecial∖Λ♯. Suppose P∈Γ+(xμ(Q)♯,SKS(μ(Q)),M), with SKS(μ(Q)) as in (8.6). Suppose P′∈Γ+(xQ′♯,Sspecial(Q′),M), with Sspecial(Q′) as in (8.7).
6. (F)
Suppose Q,Q′∈Λspecial∖Λ♯. Suppose P∈Γ+(xQ♯,Sspecial(Q),M) and P′∈Γ+(xQ′♯,Sspecial(Q′),M), with Sspecial(Q) and Sspecial(Q′) as in (8.7).
Therefore, by Lemma 8.3 and Taylor’s theorem, it suffices to show that in (A)-(F), the sets S,S′ in Γ+(x⋆♯,S,M)∋P, Γ+(x⋆′♯,S′,M)∋P′ satisfy
[TABLE]
We analyze each scenario.
(A)
Recall from (8.18) that K(Q,ν,M)=Γ+(xQ♯,S(Q,ν),M) and K(Q′,ν′,M)=Γ+(xQ′♯,S(Q′,ν′),M). In this scenario, S=S(Q,ν) and S′=S(Q′,ν′). We let x⋆♯=xQ♯.
We see from (8.15) that S(xQ♯)⊂S(Q,ν) and S(xQ♯)⊂S(Q′,ν′), since Q↔Q′. Therefore, S(xQ♯)⊂S(Q,ν)∩S(Q′,ν′). (8.22) follows.
2. (B)
Recall from (8.18) that K(Q,ν,M)=Γ+(xQ♯,S(Q,ν),M). In this scenario, S=S(Q,ν) and S′=SKS(μ(Q′)). We let x⋆♯=xμ(Q′)♯.
We see from (8.15) that S(xμ(Q′)♯)⊂S(Q,ν), since Q↔Q′. Recall from (8.6) that SKS(μ(Q′))=S(xμ(Q′)♯). (8.22) follows.
3. (C)
Recall from (8.18) that K(Q,ν,M)=Γ+(xQ♯,S(Q,ν),M). Thus, in this scenario, S=S(Q,ν) and S′=Sspecial(Q′). We let x⋆♯=xμ(Q)♯.
We see from (8.15) that S(xμ(Q)♯)⊂S(Q,ν), since Q↔Q by definition. We see from (8.7) that S(xμ(Q)♯)⊂Sspecial(Q′) since Q↔Q′. (8.22) follows.
4. (D)
In the current scenario, S=SKS(μ(Q)) and S′=SKS(μ(Q′)).
By Lemma 8.2, we have μ(Q)=μ(Q′). Hence, S=S′. Taking x⋆♯=xμ(Q)♯, we see from (8.6) that S(xμ(Q)♯)=S∩S′. (8.22) follows.
5. (E)
In the current scenario, S=SKS(μ(Q)) and S′=Sspecial(Q′). Let x⋆♯=xμ(Q)♯.
Recall from (8.6) that S(xμ(Q)♯)=SKS(μ(Q)). From (8.7), we see that S(xμ(Q)♯)⊂Sspecial(Q′), since Q′↔Q. (8.22) follows.
6. (F)
In this scenario, S=Sspecial(Q) and S′=Sspecial(Q′). We let x⋆♯=xμ(Q)♯.
By (8.7), S(xμ(Q)♯)⊂Sspecial(Q), since Q↔Q by definition. By (8.7) again, S(xμ(Q)♯)⊂Sspecial(Q′), since Q′↔Q. (8.22) follows.
We have exhausted all the cases. This concludes the proof of the corollary.
∎
8.3 Local extension problem
The next lemma states that on the correct local scale, the two-dimensional trace norm behaves in a similar way as the one-dimensional trace norm.
Lemma 8.4**.**
Let Q∈Λ♯ and let ϕ be as in Lemma 5.4. Let S⊂E∩Q∗. Recall the definition of IQ in (8.11). There exists a universal constant C such that the following hold.
(A)
Let f:S→[0,∞). Suppose there exists F∈C+2(100Q) with F=f on S, and ∣∂αF∣≤MδQ2−∣α∣ on 100Q for ∣α∣≤2. Then there exists Fν∈C+2(IQ) with Fν(s)=f(s,ϕ(s)) for each (s,ϕ(s))∈S, and ∣∂skFν∣≤CMδQ2−k on IQ for k≤2.
2. (B)
Let g:S→R. Suppose there exists G∈C2(100Q) with G=g on S, and ∣∂αG∣≤MδQ2−∣α∣ on 100Q for ∣α∣≤2. Then there exists G∈C2(IQ) with G(s)=g(s,ϕ(s)) for each (s,ϕ(s))∈S, and ∣∂skG∣≤CMδQ2−∣α∣ on IQ for k≤2.
Proof.
We only prove (A) here. The proof for (B) is identical.
Let Φ be as in Lemma 5.5, and let Ψ=(Ψ1,Ψ2):=Φ−1. Let F be as in the hypothesis. Consider the function
[TABLE]
Since F≥0, we have F≥0. By Lemma 5.5, we have F(s)=f(s,ϕ(s)) for each (s,ϕ(s))∈S. It remains to estimate the derivatives for F. Setting ∂1=∂s and ∂2=∂t, we have
[TABLE]
Therefore, thanks to Lemma 5.5 and the hypothesis ∣∂αF∣≤MδQ2−∣α∣, we can conclude that ∣∂skF∣≤CMδQ2−k on IQ for k≤2. This concludes the proof of the lemma.
∎
We can think of the next lemma as a re-scaled local finiteness principle (without a prescribed jet). It is essentially a consequence of Theorem 1.A.
Lemma 8.5**.**
Let Q∈Λ♯. For each ν=1,⋯,ν(Q), let S(Q,ν) be as in Definition 8.4.
(A)
Let f:E∩Q∗→[0,∞). Suppose for each ν, there exists Fν∈C+2(100Q) such that Fν=f on S(Q,ν), and ∣∂αFν∣≤MδQ2−∣α∣. Then there exist a universal constant C and a function FQ∈C+2(R2) such that
(i)
\widehat{F}_{Q}\big{|}_{E\cap Q^{*}}=f, and
2. (ii)
∣∂αFQ∣≤CMδQ2−∣α∣* on 100Q, ∣α∣≤2.*
2. (B)
Let g:E∩Q∗→R. Suppose for each ν, there exists Gν∈C2(100Q) such that Gν=g on S(Q,ν), and ∣∂αGν∣≤MδQ2−∣α∣. Then there exist a universal constant C and a function GQ∈C2(R2) such that
(i)
\widehat{G}_{Q}\big{|}_{E\cap Q^{*}}=g, and
2. (ii)
∣∂αGQ∣≤CMδQ2−∣α∣* on 100Q, ∣α∣≤2.*
Proof.
We only prove (A) here. The proof for (B) is identical.
If #(E∩Q∗)≤3, then ν(Q)=1 and S(Q,ν(Q))=E∩Q∗, and the conclusions follow directly from the definition of ∥f∥C+2(S(Q,ν(Q))). For the rest of the proof, we assume #(E∩Q∗)>3.
Up to a rotation, we know that E∩Q∗⊂{(s,ϕ(s)):s∈R}, where ϕ is as in Lemma 5.4. Enumerate E∩Q∗ as in (8.10). For ν=1,⋯,N(Q)−2, we set
[TABLE]
We also set
[TABLE]
Let {θν}ν=1N(Q)−1 be a partition of unity subordinate to the cover {Iν}ν=1N(Q)−1, such that
[TABLE]
Here it is convenient to use s0:=−∞, sN(Q)+1=∞, and ∞0=1. We set
[TABLE]
Let Fν be as in Lemma 8.4 with S=S(Q,ν) for ν=1,⋯,N(Q)−2. By Rolle’s Theorem, we have
[TABLE]
for ν=1,⋯,N(Q)−2, s∈Iν∩Iν+1, and k≤2.
We also set
F0:=F1 and FN(Q)−1:=FN(Q)−2.
Define
[TABLE]
Finally, we set
[TABLE]
It is clear that FQ≥0 on R2 and FQ=f on E∩Q∗. By construction, ∂tθν=∂tFν≡0 for each ν=0,⋯,N(Q)−1. Then, using estimates (8.25) and (8.27), we can conclude that ∣∂αFQ∣≤CMδQ2−∣α∣ on 100Q for ∣α∣≤2.
∎
Repeating the proof of Lemma 7.5 and using Lemma 8.5(A), we have the following result tailored for the matter at hand.
Lemma 8.6**.**
For each Bmin>0 sufficiently large, we can find Bmax, depending only on Bmin, such that the following holds. Let Q∈Λ♯, and let K(Q,ν,M) be as in Definition 8.6. Suppose for each ν=1,⋯,ν(Q), K(Q,ν,M)=∅. Then at least one of the following holds.
(A)
f(x)≥BminMδQ2* for all x∈E∩Q∗.*
2. (B)
f(x)≤BmaxMδQ2* for all x∈E∩Q∗.*
Proof.
Suppose (A) holds. There is nothing to prove.
Suppose (A) fails. We write B0=Bmin and we fix the number B0 throughout.
By assumption, there exists x∈E∩Q∗ with f(x)<BminδQ2. There exists ν∈{1,⋯,N(Q)−2} such that x∈S(Q,ν)⊂S(Q,ν). By assumption, K(Q,ν,M)=∅, so there exists F∈C+2(R2) with F=f on S(Q,ν), ∥F∥C2(R2)≤M, and JxQ♯F∈K(Q,ν,M). By Lemma 7.2, we have
[TABLE]
Then Taylor’s theorem implies
[TABLE]
Let x0∈E∩Q∗. Then there exists ν(x0)∈{1,⋯N(Q)} such that x′∈S(Q,ν(x0)).
By assumption, K(Q,ν(x0),M)=∅. Pick P∈K(Q,ν(x0),M). By Corollary 8.1, we see that
[TABLE]
Therefore, we have P(xQ♯)≤CM(B0+1)2δQ2. By the definition of K(Q,ν(x0),M), there exists F∈C+2(R2) with F(x0)=f(x0) and JxQ♯F=P. In particular, by Lemma 7.2 and Taylor’s Theorem, we have
[TABLE]
By Taylor’s theorem again, we have
[TABLE]
Since x0∈E∩Q∗ was chosen arbitrarily, (B) follows.
∎
The next lemma mirrors Lemma 7.3. It says the following. When the local data is big, K can be viewed as a translate of σ♯. When the local data is small, K contains not much more information than the zero jet.
Lemma 8.7**.**
Let Q∈Λ♯. Let K(Q,ν,M) be as in Definition 8.6. Suppose K(Q,ν,M)=∅ for each ν=1,⋯,ν(Q).
(A)
There exists a number B>0 exceeding a universal constant such that the following holds. Suppose f(x)≥BMδQ2 for all x∈E∩Q∗. Then K(Q,ν,M)+M⋅σ♯(xQ♯,4k)⊂K(Q,ν,CM) for each ν=1,⋯,ν(Q). Here, C is a universal constant.
2. (B)
Let A>0. Suppose f(x)≤AMδQ2 for all x∈E∩Q∗. Then 0∈K(Q,ν,A′M) for each ν∈{1,⋯,ν(Q)}. Here the number A′ depends only on A.
Proof.
We adapt the proof of Lemma 7.3 with K in place of Γ+♯, and use the fact that S(Q,ν) contains S(Q,ν)⊂E∩Q∗. We include the relevant steps here for completeness.
Fix ν∈{1,⋯,ν(Q)}.
We begin with (A). Let B>0 be a sufficiently large number.
By (8.3), we have S(Q,ν(Q))⊂S(Q,ν). Let P∈K(Q,ν,M). Repeating the proof of Claim 7.1 in Lemma 7.3, we see that P(xQ♯)≥C(B−1/2)2MδQ2.
By (4.1), Lemma 4.8, and Definition 8.6, there exists a Whitney field
[TABLE]
such that Px=f(x) for all x∈S(Q,ν), and ∥P∥W+2({xQ♯}∪S(Q,ν))≤CM.
Let P~∈M⋅σ♯(xQ♯,4k). By Lemma 5.7, P~∈CM⋅B(x,δQ).
Consider the Whitney field
[TABLE]
By the same argument in the proof of Lemma 7.3, we can verify that
Let P∈K(Q,ν,M). Repeating the argument in Claim 7.2 in the proof of Lemma 7.3, we have P(xQ♯)≤C(A+1)2MδQ2. By the definitions of K and Γ+ in (8.18) and (4.1), there exists F∈C+2(R2) with F(x)=f(x) for all x∈S(Q,ν), ∥F∥C+2(R2)≤CM, and JxQ♯F=P. By Lemma 7.2 and Taylor’s theorem, we have
[TABLE]
Here, A′′ depends only on A.
Let ψ∈C+2(R2) be a cutoff function such that ψ≡1 near xQ♯, ψ≡0 outside of B(xQ♯,100crepδQ), and ∣∂αψ∣≤CδQ−∣α∣.
We set
[TABLE]
It is clear that F≥0 on R2, F~=f on S(Q,ν), and JxQ♯F~≡0. Using (8.28), we see that ∥F~∥C2(R2)≤A′M. This proves part (B) and concludes the proof of the lemma.
∎
The next lemma mirrors Lemma 7.1. It solves the local interpolation with a prescribed jet in K, so that they can be patched together by a partition of unity.
Lemma 8.8**.**
Let Q∈Λ♯. Let K(Q,ν,M) be as in Definition 8.6. Suppose K(Q,ν,M)=∅ for each ν=1,⋯,ν(Q). Then there exist a universal constant C and a function FQ∈C+2(100Q) such that
(A)
F_{Q}\big{|}_{E\cap Q^{*}}=f,
2. (B)
∥FQ∥C2(R2)≤CM, and
3. (C)
JxQ♯FQ∈K(Q,ν(Q),CM).
Proof.
We adapt the proof of Lemma 7.1 with the following main adjustments:
We use K in place of Γ+♯, and the condition Γ+♯(xQ♯,4k,M)=∅ is replaced by K(Q,ν,M)=∅ for each ν=1,⋯,ν(Q). See Lemma 8.5 and Lemma 8.8.
Here we present the relevant steps for completeness.
Fix Q∈Λ♯.
Suppose #(E∩Q∗)≤3. Recall Definitions 4.1, 8.4, 8.5, and 8.6. By assumption, K(Q,ν(Q),M)=Γ+(xQ♯,S(Q,ν(Q)),M)=∅. Pick P∈Γ+(xQ♯,S(Q,ν(Q)),M). By the definition of Γ+, there exists FQ∈C+2(R2) such that F_{Q}\big{|}_{S(Q,\nu(Q))}=f, ∥FQ∥C2(R2)≤M, and JxQ♯FQ∈Γ+(xQ♯,S(Q,ν(Q)),M). Since S(Q,ν)⊃S(Q,ν(Q)) and S(Q,ν(Q))=S(Q,1)=E∩Q∗ in this case, the conclusions follow.
From now on, we assume #(E∩Q∗)>3.
Let Bmin>0 be sufficiently large, and in particular, Bmin>B, where B is as in Lemma 8.7. Let Bmax be given as in Lemma 7.5 with such Bmin.
Thanks to Lemma 8.6, each Q∈Λ♯ falls into at least one of the following cases.
(i)
f(x)≥BminMδQ2 for all x∈E∩Q∗.
2. (ii)
f(x)≤BmaxMδQ2 for all x∈E∩Q∗.
We treat (i) first.
Since #(E∩Q∗)≥3, we may select distinct x1,x2∈E∩S(Q,ν(Q))∩Q∗. Pick P∈K(Q,ν(Q),M). Let P♯ be the unique affine polynomial that interpolates the points (x1,f(x1)), (x2,f(x2)), and (xQ♯,P(xQ♯)). We may repeat the argument in Claim 7.3 in the proof of Lemma 7.6 and use Lemma 8.7 to show that
Let g(x):=f(x)−P♯(x) for each x∈E∩Q∗. Note that g is not necessarily nonnegative. Since P♯∈K(Q,ν(Q),CM), there exists a function F∈C+2(R2) such that F∣S(Q,ν)=f, ∥F∥C2(R2)≤CM, and JxQ♯F=P. This, together with the assumption K(Q,ν,M)=∅ and Rolle’s theorem, implies that for each ν∈1,⋯,ν(Q), there exists Gν∈C2(R2) such that
[TABLE]
By Lemma 8.5(B), there exists G∈C2(100Q) such that
Conclusion (B) then follows from the triangle inequality.
•
Since ψ≡1 near xQ♯, we have JxQ♯FQ=JxQ♯P♯+0=P♯∈K(Q,ν(Q),CM). (C) is satisfied.
This proves case (i).
Now we turn to case (ii).
Recall the hypothesis ∥f∥C+2(S(Qν))≤M for each ν. By definition, for each ν=1,⋯,N(Q), there exists Fν∈C+2(R2) such that Fν=f on S(Q,ν) and ∥Fν∥C2(R2)≤CM. Since f(x)≤BmaxδQ2 for all x∈E∩Q∗, by Lemma 7.2, we have
[TABLE]
Therefore, the hypotheses of Lemma 8.5(A) are satisfied, and there exists F∈C+2(R2) such that F∣E∩Q∗=f and
It suffices to show that there exists F∈C+2(R2) such that F∣E=f and ∥F∥C2(R2)≤CM.
By the definition of M, we have ∥f∥C+2(Sℓ)≤M for all ℓ=1,⋯,L. This implies the following.
•
Recall Definitions 8.4, 8.5, and 8.6. For each Q∈Λ♯, we have
[TABLE]
This follows from the fact that S(Q,ν)∈S1♯⊂S♯ for ν=1,⋯,ν(Q) and K(Q,ν,CM)=Γ+(xQ♯,S(Q,ν),CM) (see Definition 8.6). Therefore, the hypotheses of Lemma 8.8 are satisfied.
•
For Q∈ΛKS and xQ♯ as in Lemma 5.6, Γ+(xQ♯,SKS(Q),CM)=∅. This follows from the fact that SKS(Q)∈S2♯⊂S♯ for Q∈ΛKS.
•
For Q∈Λspecial and xQ♯ as in Lemma 5.6, Γ+(xQ♯,Sspecial(Q),CM)=∅ . This follows from the fact that Sspecial(Q)∈S3♯⊂S♯ for Q∈Λspecial.
We distinguish three types of squares Q∈Λ0.
Type 1
Suppose E∩Q∗=∅, that is, Q∈Λ♯. We set FQ♯:=FQ, where FQ is as in Lemma 8.8. In particular, we have
[TABLE]
with xQ♯ as in Lemma 5.6 and S(Q,ν(Q)) as in (8.15).
2. Type 2
Suppose E∩Q∗=∅ but δQ<1. Let Λspecial,μ be as in Lemma 8.2.
•
Suppose Q∈/Λspecial. Pick
[TABLE]
with xμ(Q)♯ as in Lemma 5.6 and SKS(μ(Q)) as in (8.6).
We set FQ♯:=Wxμ(Q)♯(PQ♯), where Wxμ(Q)♯ is as in Lemma 4.9.
•
Suppose Q∈Λspecial. Pick
[TABLE]
with xQ♯ as in Lemma 5.6 and Sspecial(Q) as in (8.7).
We set FQ♯:=WxQ♯(PQ♯), where WxQ♯ is as in Lemma 4.9.
3. Type 3
Suppose E∩Q∗=∅ and δQ=1. We set FQ♯:≡0.
To wit, we associate Type 1 squares with clusters in S1♯, Type 2 non-special squares with clusters in S2♯, and Type 2 special squares with clusters in S3♯.
Let {θQ:Q∈Λ0} be a C2 partition of unity that is CZ compatible with Λ0.
We set
[TABLE]
By construction, FQ♯≥0 on 100Q and F_{Q}^{\sharp}\big{|}_{E\cap Q^{*}}=f for each Q∈Λ0. Therefore, F(x)≥0 and F=f on E.
Now we estimate the derivatives of F.
Let x∈R2. Then there exists Q∈Λ0 such that Q∋x. We have
[TABLE]
Claim 8.1**.**
Fix x∈R2. Let Q∋x, and let Q′∈Λ0 with Q′↔Q. Then
[TABLE]
Suppose the claim is true. Then applying Lemma 4.9, Lemma 8.8, and (8.39) to estimate (8.38), we can conclude that ∥F∥C2(R2)≤CM.
By Lemma 4.9, Lemma 8.8, and Taylor’s theorem, we have
[TABLE]
We want to show that
[TABLE]
We consider the following cases.
Case 1
Suppose either Q or Q′ is of Type 3. Then (8.42) follows from Lemma 4.9, Lemma 8.8, and Taylor’s theorem.
2. Case 2
Suppose both Q and Q′ are of Type 1, that is, Q,Q′∈Λ♯. Then (8.42) follows from (8.35), scenario (A) of Corollary 8.1, and Taylor’s theorem.
3. Case 3
Suppose one of Q,Q′ is of Type 1 and the other is of Type 2. Without loss of generality, we may assume Q∈Λ♯ and Q′∈Λ0. Recall Λspecial from Lemma 8.2.
Case 3-a
Suppose Q′∈/Λspecial. Then (8.42) follows from (8.35), (8.36), scenario (B) of Corollary 8.1, and Taylor’s theorem.
2. Case 3-b
Suppose Q′∈Λspecial. Then (8.42) follows from (8.35), (8.37), scenario (C) of Corollary 8.1, and Taylor’s theorem.
4. Case 4
Suppose both Q,Q′ are of Type 2.
Case 4-a
Suppose Q,Q′∈/Λspecial. Then (8.42) follows from (8.36), scenario (D) of Corollary 8.1, and Taylor’s theorem.
2. Case 4-b
Suppose Q∈Λspecial and Q′∈/Λspecial. Then (8.42) follows from (8.36), (8.37), scenario (E) of Corollary 8.1, and Taylor’s theorem.
3. Case 4-c
Suppose Q,Q′∈Λspecial. Then (8.42) follows from (8.37), scenario (F) of Corollary 8.1, and Taylor’s theorem.
This proves the claim.
∎
The theorem is proved.
∎
Bibliography27
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] Yuri Brudnyi and Pavel Shvartsman. The traces of differentiable functions to subsets of ℝ n superscript ℝ 𝑛 \mathbb{R}^{n} . Linear and complex analysis. Problem book 3. Part II , Lecture Notes in Mathematics, vol. 1574, Springer-Verlag, Berlin, 1994, 279–281.
2[2] Yuri Brudnyi and Pavel Shvartsman. Generalizations of Whitney’s extension theorem. Internat. Math. Res. Notices , (3):129 ff., approx. 11 pp. (electronic), 1994.
3[3] Yuri Brudnyi and Pavel Shvartsman. Whitney’s extension problem for multivariate C 1 , ω superscript 𝐶 1 𝜔 C^{1,\omega} -functions. Trans. Amer. Math. Soc. , 353(6):2487–2512 (electronic), 2001.
4[4] Paul B. Callahan and S. Rao Kosaraju. A decomposition of multidimensional point sets with applications to k 𝑘 k -nearest-neighbors and n 𝑛 n -body potential fields. J. Assoc. Comput. Mach. , 42(1):67–90, 1995.
5[5] Jacob Carruth, Abraham Frei-Pearson, Arie Israel, and Bo’az Klartag. A coordinate-free proof of the finiteness principle for Whitney’s extension problem. Rev. Mat. Iberoamericana , online, 2020.
6[6] Charles Fefferman. A sharp form of Whitney’s extension theorem. Ann. of Math. (2) , 161(1):509–577, 2005.
7[7] Charles Fefferman. Interpolation and extrapolation of smooth functions by linear operators. Rev. Mat. Iberoamericana , 21(1):313–348, 2005.
8[8] Charles Fefferman. Fitting a C m superscript 𝐶 𝑚 C^{m} -smooth function to data. III. Ann. of Math. (2) , 170(1):427–441, 2009.