Manifold parametrizations by eigenfunctions of the Laplacian and heat kernels
- *Department of Mathematics, Yale University, 10 Hillhouse Avenue, New Haven, CT 06510;
- †Department of Mathematics, Duke University, Box 90320, Durham, NC 27708; and
- §Department of Mathematics, University of California, Box 951555, Los Angeles, CA 90095-1555
-
Communicated by Ronald R. Coifman, Yale University, New Haven, CT, October 29, 2007 (received for review September 3, 2007)
Abstract
We use heat kernels or eigenfunctions of the Laplacian to construct local coordinates on large classes of Euclidean domains and Riemannian manifolds (not necessarily smooth, e.g., with 𝒞α metric). These coordinates are bi-Lipschitz on large neighborhoods of the domain or manifold, with constants controlling the distortion and the size of the neighborhoods that depend only on natural geometric properties of the domain or manifold. The proof of these results relies on novel estimates, from above and below, for the heat kernel and its gradient, as well as for the eigenfunctions of the Laplacian and their gradient, that hold in the non-smooth category, and are stable with respect to perturbations within this category. Finally, these coordinate systems are intrinsic and efficiently computable, and are of value in applications.
In many recent applications, one attempts to find local parametrizations of data sets. A recurrent idea is to approximate a high dimensional data set, or portions of it, by a manifold of low dimension. A variety of algorithms for this task have been proposed (1–8). Unfortunately, such techniques seldomly come with guarantees on their capabilities of indeed finding local parametrization (but see, for example, refs. 8 and 9) or on quantitative statements on the quality of such parametrizations. Examples of such disparate applications include document analysis, face recognition, clustering, machine learning (10–13), nonlinear image denoising and segmentation (11), processing of articulated images (8), and mapping of protein energy landscapes (14). It has been observed in many cases that the eigenfunctions of a suitable graph Laplacian on a data set provide robust local coordinate systems and are efficient in dimensional reduction (1, 4, 5). The purpose of this paper is to provide a partial explanation for this phenomenon by proving an analogous statement for manifolds as well as introducing other coordinate systems via heat kernels, with even stronger guarantees. Here, we should point out the 1994 paper of Bérard et al. (15) where a weighted infinite sequence of eigenfunctions is shown to provide a global coordinate system. (Points in the manifold are mapped to ℓ2.) To our knowledge, this was the first result of this type in Riemannian geometry. If a given data set has a piece that is statistically well approximated by a low dimensional manifold, it is then plausible that the graph eigenfunctions are well approximated by the Laplace eigenfunctions of the manifold. One of our results is that, with the normalization that the volume of a d-dimensional manifold ℳ equals one, any suitably embedded ball B r (z) in ℳ has the property that one can find (exactly) d eigenfunctions that are a “robust”coordinate system on B cr (z) (for a constant c depending on elementary properties of ℳ). In addition, these eigenfunctions, which depend on z and r, “blow up” the ball B cr (z) to diameter at least one. In other words, one can find d eigenfunctions that act as a “microscope” on B cr (z) and “magnify” it up to size ∼1. Another of our results is as follows. We introduce simple “heat coordinate” systems on manifolds. Roughly speaking (and in the language of the previous paragraph), these are d choices of manifold heat kernels that form a robust coordinate system on B cr (z). We call this method “heat triangulation” in analogy with triangulation as practiced in surveying, cartography, navigation, and modern GPS. Indeed, our method is a simple translation of these classical triangulation methods.
The embeddings we propose can be computed efficiently and therefore, together with the strong guarantees we prove, are expected to be useful in a variety of applications, from di-mensionality reduction to data set compression and navigation.
Given these results, it is plausible to guess that analogous results should hold for a local piece of a data set if that piece has in some sense a “local dimension” approximately d. There are certain difficulties with this philosophy. The first is that graph eigenfunctions are global objects and any definition of “local dimension” must change from point to point in the data set. A second difficulty is that our manifold results depend on classical estimates for eigenfunctions. This smoothness is often lacking in graph eigenfunctions.
For data sets, heat triangulation is a much more stable object than eigenfunction coordinates because
-
heat kernels are local objects;
-
if a manifold ℳ is approximated by discrete sets X, the corresponding graph heat kernels converge rather nicely to the manifold heat kernel (4, 5);
-
one has good statistical control on smoothness of the heat kernel, simply because one can easily examine it and because one can use the Hilbert space {f ∈ L 2 : ∇f ∈ L 2};
-
our results that use eigenfunctions rely in a crucial manner on Weyl's lemma, whereas heat kernel estimates do not.
The philosophy used in this paper is as follows.
Step 1.
Find suitable points y
j, 1 ≤ j ≤ d and a time t so that the mapping given by heat kernels
is a good local coordinate system on B(z, cr). (This is heat triangulation.)
Step 2.
Use Weyl's lemma to find suitable eigenfunctions ϕij so that (with K j(x) = K t(x, y j)) one has ∇ϕij (x) ≈ c j∇K j (x), x ∈ B(z, cr) for an appropriate constant c.
Results
Euclidean Domains.
We first present the case of Euclidean do-mains. Although our results in this setting follow from the more general results for manifolds discussed in the next section, the case of Euclidean domains is of independent interest, and the exposition of the theorem is simpler.
We consider the heat equation in Ω, a finite volume domain in ℝd, with either Dirichlet or Neumann boundary conditions:
Here, v is the outer normal on ∂Ω. Independently of the boundary conditions, we will denote by Δ the Laplacian on Ω. For the purpose
of this paper, in both the Dirichlet and Neumann case, we restrict our study to domains where the spectrum is discrete and
the corresponding heat kernel can be written as
where the {ϕj} form an orthonormal basis of eigenfunctions of Δ, with eigenvalues 0 ≤ λ0 ≤ ⋯ ≤ λj ≤ …. We also require that the following Weyl's estimate holds, i.e., there is a constant C
Weyl,Ω such that for any T > 0
(This condition is always satisfied in the Dirichlet case, where in fact C
Weyl,Ω can be chosen independent of Ω.) It should however be noted that these conditions are not always true and the Neumann case
is especially problematic (16, 17).
Theorem 1. Embedding via Eigenfunctions, for Euclidean Domains.
Let Ω be a domain in ℝd satisfying all the conditions above, rescaled so that |Ω| = 1. There are constants c 1, …, c 6 > 0 that depend only on d and C Weyl,Ω, such that the following hold. For any z ∈ Ω, let R z ≤ dist (z, ∂Ω). Then there exist i 1, …, i d and constants c 6 R z d/2 ≤ γ1 = γ1 (z), …, γd = γd(z) ≤ 1 such that
-
(a) the map
satisfies, for any x
1, x
2 ∈ B (z, c
1
R
z),
-
(b) the associated eigenvalues satisfy
Remark 1.
The dependence on the constant C Weyl,Ω is only needed in the Neumann case.
Manifolds with 𝒞α Metric.
The results above can be extended to certain classes of manifolds. To formulate a result corresponding to Theorem 1, we must first carefully define the manifold analogue of dist (z, ∂Ω). Let ℳ be a smooth, d-dimensional compact manifold, possibly with boundary. Suppose we are given a metric tensor g on ℳ is 𝒞α for some α > 0. For any z 0 ∈ ℳ, let (U, u) be a coordinate chart such that z 0 ∈ U and
-
(i) g il (u(z 0)) = δil;
-
(ii) for any x ∈ U, and any ξ, ν ∈ ℝd,
We let r
ℳ (z
0) = sup{r > 0 : B
r (u(z
0)) ⊆ u(U)}. Observe that, when g is at least 𝒞2, r
ℳ can be taken to be the inradius, with local coordinate chart given by the exponential map at z. We denote by ∥g∥α⋀1 the maximum over all i, j of the α ⋀ 1-Hölder norm of gij in the chart (U, u). The natural volume measure dμ on the manifold is given, in any local chart, by
; conditions 0.6 guarantee that detg is uniformly bounded below from 0. Let Δℳ be the Laplace Beltrami operator on ℳ In a local chart, we have
where (g
ij) is the inverse of gij. Conditions 0.6 are the usual uniform ellipticity conditions for the operator 0.7. With Dirichlet or Neumann boundary conditions, Δℳ is self-adjoint on L
2 (ℳ, μ). We will assume that the spectrum is discrete, denote by 0 ≤ λ0 ≤ ⋯ ≤ λj ≤ its eigenvalues and by {ϕj} the corresponding orthonormal basis of eigenfunctions, and write Eqs. 0.1 and 0.2 with Ω replaced by ℳ.
Theorem 2.
Let (ℳ, g), z ∈ ℳ and (U, u) be as above. Also, assume |ℳ| = 1. There are constants c 1, …, c 6 > 0, depending on d, c min, c max, ∥g∥α⋀1, α ⋀ 1, and C Weyl,ℳ, such that the following hold. Let R z = r ℳ (z). Then there exist i 1, …, i d and constants c 6 R z d/2 ≤ γ1 = γ1 (z), …, γd = γd (z) ≤ 1 such that
-
(a) the map
such that for any x
1, x
2 ∈ B (z, c
1
R
z)
-
(b) the associated eigenvalues satisfy
Remark.
In both Theorem 1 and Theorem 2, the constants γj are given by
where c is some fixed constant, depending on d, c
min, c
max, ∥g∥α⋀1, α ⋀ 1, and C
Weyl.
Remark 2.
The constant C Weyl,ℳ is only needed in the Neumann case.
Remark 3.
Most of the proof is done on one local chart containing z which we choose (one which contains a large enough ball around z). An inspection of the proof shows that we use only the norm ∥g∥α⋀1 of the g restricted to this chart. In particular, the theorem holds also for R z ≤ r ℳ (z).
Remark 4.
When rescaling Theorem 2, it is important to note that if f is a Hölder function with ∥f∥𝒞α⋀1 = A and f r (z) = f(r −1 z), then ∥f r∥𝒞α⋀1 = Ar α⋀1. Since we will have r < 1, f r satisfies a better Hölder estimate then f, i.e., ∥f r∥𝒞α⋀1 = Ar α⋀1 ≤ A = ∥f∥𝒞α⋀1.
Remark 5.
We do not know, in both Theorem 1 and Theorem 2, whether it is possible to choose eigenfunctions such that γ1 = … = γd.
Another result is true. One may replace the d chosen eigenfunctions above by d chosen heat kernels, i.e., {K t(z, y i)}i=1,…,d. In fact, such heat kernels arise naturally in the main steps of the proofs of Theorem 1 and Theorem 2. This leads to an embedding map with even stronger guarantees:
Theorem 3. Heat Triangulation Theorem.
Let (ℳ, g), z ∈ ℳ and (U, u) be as above, where we now allow |ℳ| = +∞. Let R
z ≤ min{1, r
ℳ(z)}. Let p
1, …, p
d
be d linearly independent directions. There are constants c
1, …, c
6 > 0, depending on d, c
min, c
max, ∥g∥α⋀1, α ⋀ 1, and the smallest and largest eigenvalues of the Gramian matrix (p
i, p
j)i,j=1,…,d, such that the following holds. Let y
i
be so that y
i − z is in the direction p
i, with c
4
R
z ≤ d
ℳ (y
i, z) ≤ c
5
R
z
for each i = 1, …, d and let t
z = c
6
R
z
2. The map Φ : B
c1Rz (z) → ℝd, defined by
satisfies, for any x
1, x
2 ∈ B
c1Rz (z),
This holds for the manifold and Euclidean case alike and depends only on estimates for the heat kernel and its gradient.
Remark 6.
One may replace the (global) heat kernel above with a local heat kernel, i.e., the heat kernel for the ball B (z, R z) with the metric induced by the manifold and Dirichlet boundary conditions. In fact, this is a key idea in the proof of all of the above theorems.
Remark 7.
All theorems hold for more general boundary condi-tions. This is especially true for the Heat Triangulation Theorem, which does not even depend on the existence of a spectral expansion for the heat kernel.
Example 1.
It is a simple matter to verify this theorem for the case where the manifold in ℝd. For example, if d = 2, R
z = 1, and z = 0, y
1 = (−1, 0) and y
2 = (0, −1). Then if K
t (x, y) is the Euclidean heat kernel,
is a (nice) biLipschitz map on B
1/2 ((0, 0)). (The result for arbitrary radii then follows from a scaling argument.) This is because on can simply evaluate the
heat kernel K
t (x, y) = [1/(4πt)]e
−(|x−y|2)/4t. In B
1/2 ((0, 0)),
Notation.
In what follows, we will write f (x) ≲c1,…,cn g(x) if there exists a constant C depending only on c 1, …, c n, and not on f, g, or x, such that f(x) ≤ Cg (x) for all x (in a specified domain). We will write f(x) ∼c1,…,cn g(x) if both f(x) ≲c1,…,cn g(x) and g(x) ≲c1,…,cn f(x). We will write a ∼C1 C2 b for a, b vectors, if a i ∼C1 C2 b i for all i.
The Proofs
The proofs in the Euclidean and manifold case are similar. In this section, we present the main steps of the proof. A full pre-sentation is given in ref. 2. Some remarks about the manifold case:
-
(a) As mentioned in Remark 3, we will often restrict to working on a single (fixed) chart in local coordinates. When we discuss moving in a direction p, we mean in the local coordinates.
-
(b) Let us say a few words about how the dependence on ∥g∥α⋀1 comes into play. Generally speaking, in all places except one (which we will mention momentarily), the α ⋀ 1-Hölder condition is used to get local bi-Lipschitz bounds on the perturbation of the metric (resp. the ellipticity constants) from the Euclidean metric (resp. the Laplacian). The place where one really uses the Hölder condition is an estimate on how much the gradient of a (global) eigenfunction changes in a ball.
-
(c) We will use Brownian motion arguments (on the manifold). To have existence and uniqueness, one needs smoothness assumptions on the metric (say, 𝒞2). Therefore, we will first prove the theorem in the manifold case in the 𝒞2 metric category, and then use perturbation estimates to obtain the result for g ij ∈ 𝒞α. To this end, we will often have dependence on the 𝒞α norm of the coordinates of the gij even though we will be (for a specific lemma or proposition) assuming the g has 𝒞2 entries.
-
(d) We will use estimates from ref. 18. The theorems in ref. 18 are stated only for the case of d ≥ 3. Our theorems are true also for the case d = 2 (and trivially, d = 1). This can beseen indirectly by considering ℳ̃: = ℳ × 𝕋 and noting that the eigenfunctions of ℳ̃ and the heat kernel of ℳ̃ both factor.
The idea of the proof of Theorem 1 and 2 is as follows. We start by fixing a direction p 1 at z. We would like to find an eigenfunction ϕi1 such that |∂p1ϕi1≳ R z −1 on B c1Rz (z). To achieve this, we start by showing that the heat kernel has large gradient in an annulus of inner and outer radius ∼ R z −1 around y 1 (y 1 chosen such that z is in this annulus, in direction p 1). We then show that the heat kernel and its gradient can be approximated on this annulus by as the partial sum of 0.1 over eigenfunctions ϕλ which satisfy both λ ∼ R z −2 and R z −d/2 ∥ϕλ∥L2(Bc1Rz (z)) ≳ 1. By the pigeon-hole principle, at least one such eigenfunction, let it be ϕi1, has a large partial derivative in the direction p 1. We then consider ∇ϕi1 and pick p 2 ⊥∇ϕi1 and by induction we select ϕi1, …, ϕid, making sure that at each stage we can find ϕik, not previously chosen, satisfying |∂pk ϕik| ∼ R z −1 on B c1Rz (z). We finally show that the Φ : = (ϕi1, …, ϕid) satisfies the desired properties.
Step 1. Estimates on the heat kernel and its gradient.
Let K be the Dirichlet or Neumann heat kernel on Ω or ℳ, corresponding to one of the Laplacian operators considered above associated
with g. We have the spectral expansion
When working on a manifold, we can assume in what follows that we fix a local chart containing B Rz (z).
Assumption A.1.
Let the constants δ0, δ1 > 0 depend on d, c min, c max, ∥g∥α⋀1, α ⋀ 1. We consider z, w ∈ Ω satisfying (δ1/2) R z < t 1/2 < δ1 R z and |z − w| < δ0 R z.
Proposition 4.
Under Assumption A.1, let g ∈ 𝒞α, δ0 sufficiently small, and δ1 is sufficiently small depending on δ0. Then there are constants C 1, C 2, C′ 1, C′ 2, C 9 > 0, that depend on d, δ0, δ1, c min, c max, ∥g∥α⋀1, α ⋀ 1} and C′ 1, C′ 2, C 9 dependent also on C Weyl, such that the following hold:
-
(i) the heat kernel satisfies
-
(ii) if (1/2)δ0 R z < |z − w|, p is a unit vector in the direction of z − w, and q is arbitrary unit vector, then
where C
9 → 0 as δ1 → 0 (with δ0
fixed);
-
(iii) if in addition gij ∈ 𝒞2, (1/2)δ0 R z < |z − w|, and q is as above, then for s ≤ t,
-
(iv) C 1, C 2 both tend to a single function of {d, c min, c max, δ0, C Weyl}, as δ1 tends to 0 with δ0 fixed;
-
(v) if g ∈ 𝒞2, then also C′ 1, C′ 2, C 9 can be chosen independently of C Weyl. Furthermore, the above estimates also hold for |ℳ| ≤ + ∞.
At this point we can side track and choose heat kernels {K t (·, y i)}i=1,…,d, with t ∼ R z 2, that provide a local coordinate chart with the properties claimed in Theorem 3.
Proof of Theorem 3.
We start with the case g ∈ 𝒞2. Let us consider the Jacobian J̃ (x), for x ∈ B
c1Rz (z), of the map
By 0.14 we have |J̃ij (x) − C′
2〈p
i, (x−y
j)/∥x−y
j∥〉 R
z
−1| ≤ C
9
R
z
−1, with C′
2 independent of C
Weyl. As dictated by Proposition 4, by choosing δ0, δ1 appropriately (and, correspondingly, c
1 and c
6), we can make the constant C
9 smaller than any chosen ϵ, for all entries, and for all x at distance no greater than c
1
R
z from z, where we use t = t
z = c
6
R
z
2 for Φ̃. Therefore, for c
1 small enough compared to c
4 we can write R
z
J̃ (x) = G
d + E(x), where G
d is the Gramian matrix 〈p
i, p
j〉 (indepedent of x), and |Eij (x)| < ϵ, for x ∈ B
c1Rz (z). This implies that R
z
−1 (σmin − C
dϵ) ∥υ∥ ≤ ∥ J̃ (x)υ∥ ≤ R
z
−1 (σmax + C
dϵ) ∥υ∥, with C
d depending linearly on d, where σmax and σmin are the largest and, respectively, smallest eigenvalues of G
d. At this point, we choose ϵ small enough, so that the above bounds imply that the Jacobian is essentially constant in B
c1Rz (z), and by integrating along a path from x
2 to x
2 in B
c1Rz (z), we obtain the Theorem (Φ and Φ̃ differ only by scalar multiplication). We note that ϵ ∼ 1/d suffices. To get the result when g is only 𝒞α we use perturbation techniques for the heat kernel (2).
We proceed towards the proof of Theorem 1 and 2. The following steps aim at replacing appropriately chosen heat kernels by a set of eigenfunctions, by extracting the “leading terms”in their spectral expansion.
Step 2. Heat kernel and eigenfunctions.
Let AveR
z (f) = (
BR(z) |f|2)1/2. We record the following (2):
Proposition 5.
Assume gij ∈ 𝒞α. There exists b
1 < 1, that depends on d, c
min, c
max, ∥g∥α⋀1, α ⋀ 1 such that the following holds. For an eigenfunction ϕj
of Δℳ, corresponding to the eigenvalue λj, and R ≤ R
z, the following estimates hold. For w ∈ B
b1R (z) and x, y ∈ B
b1R (z),


with constants depending only on d, c
max, c
min, ∥gij∥α⋀1, and P
1 (x) = (1 + x)(1/2)+β, P
2 (x) = (1 + x)(3/2)+β, P
3 (x) = (1 + x)(5/2)+β, with β the smallest integer larger than or equal to (d−2)/4.
We start by restricting our attention to eigenfunctions do not have too high frequency. Let ΛL (A) = {λj : λj ≤ At −1} and ΛH (A′) = {λj : λj > A′ t −1} = ΛL (A′)c.
A first connection between the heat kernel and eigenfunc-tions is given by the following truncation Lemma.
Lemma 1.
Assume g ∈ 𝒞2. Under Assumption A.1, for A > 1 large enough and A′ < 1 small enough, depending on δ0, δ1, C 1, C 2, C′ 1, C′ 2 (as in Proposition 4), there exist constants C 3, C 4 (depending on A, A′ as well as {d, c min, c max, ∥g∥α⋀1, α ⋀ 1}) such that
-
(i) The heat kernel is approximated by the truncated expansion
-
(ii) If (1/2)δ0 R z < |z − w| and p is a unit vector parallel to z − w, then
-
(iii) C 3, C 4 both tend to 1 as A → ∞ and A′ → 0.
This lemma implies that in the heat kernel expansion, we do not need to consider eigenfunctions corresponding to eigenval-ues
larger than At
−1. However, in our search for eigenfunctions with the desired properties, we need to restrict our attention further, by discarding
eigenfunctions that have too small a gradient around z. As a proxy for gradient, we use local energy. Recall AveR
z (f) = (
BR(z) |f|2)1/2, and let
The truncation Lemma 1 can be strengthened into
Lemma 2.
Assume g ∈ 𝒞2. Under Assumption A.1, for C
3, C
4
close enough to 1 (as in Lemma 1), and c
0
small enough (depending on d, c
min, c
max, ∥g∥α⋀1, α ⋀ 1, and C
Weyl,ℳ), there exist constants C
5, C
6
(depending only on C
3, C
4, c
0, and C
Weyl,ℳ
) such that the heat kernel satisfies
and if (1/2)δ0
R
z < |z − w|, then, if Λ := ΛL (A) ∩ ΛH (A′) ∩ ΛE (z, R
z, δ0, c
0),
C
5, C
6
tend to 1 as C
3, C
4
tend to 1 and c
0
tends to 0.
Step 3.
Choosing appropriate eigenfunctions.
The set of eigenfunctions with eigenvalues in Λ (as in Lemma 2) is well suited for our purposes, in view of:
Lemma 3.
Assume g ∈ 𝒞2. Under Assumption A.1, for δ0
small enough, there exists a constant C
7
depending on {C
1, C
2, C′
1, C′
2, C
5, δ1} and C
8
depending on {δ0, c
min, c
max, ∥g∥α⋀1, α ⋀ 1} such that the following holds. For any direction p there exist j ∈ Λ := ΛL (A) ∩ΛH (A′) ∩ΛE (z, R
z, δ0, c
0) such that
and moreover, if ∥z − z′∥ ≤ b
1
R
z, where b
1
is a constant that depends on C
7, C
8, d, c
min, c
max, ∥g∥α⋀1, α ⋀ 1, then
This lemma yields an eigenfunction that serves our purpose in a given direction. From this point onwards we let, with abuse of notation, ϕj(z′) = (Ave½ zδ0Rz z ϕj)−1 · ϕj(z′). To complete the proof of the theorems, we need to cover d linearly independent directions. Pick an arbitrary direction p 1. By Lemma 3 we can find j 1 ∈ Λ, (in particular j 1 ∼ t −1) such that |∂pl ϕjl (z)| ≥ c 0 R z −1. Let p 2 be a direction orthogonal to ∇ϕj1 (z). We apply again Lemma 3, and find j 2 < At −1 so that |∂p2ϕj2 (z)| ≥ c 0 R z −1. Note that necessarily j 2 ≠ j 1 and p 2 is linearly independent of p 1. In fact, by choice of p 2, ∂p2ϕj1 = 0. We proceed in this fashion. By induction, once we have chosen j 1, …, j k (k < d), and the corresponding p 1, …, p k, such that |∂pl ϕjl (z)| ≥ c 0 R z −1, for l = 1, …, k, we pick p k+1 orthogonal to 〈{∇ϕjn}n=1,…,k〉 and apply Lemma 3, that yields j k+1 such that |∂pk+1ϕjk+1 (z) | ≥ c 0 R z −1.
We claim that the matrix A k+1 := (∂pn ϕjm)m,n=1,…,k+1 is lower triangular and {p 1, …, p k+1} is linearly independent. Lower-triangularity of the matrix follows by induction and the choice of p k+1. Assume a ∈ ℝk+1 and Σn=1 k+1 a n p n = 0, then 〈Σn=1 k+1 a n p n, ∇ϕjl〉 = 0 for all l = 1, …, k + 1, i.e., a solves the linear system A k+1 a = 0. But A k+1 is lower triangular with all diagonal entries non-zero, hence a = 0.
For l ≤ k, we have 〈∇ϕjl, p
k+1〉 = 0 and, by Lemma 3, |〈∇ϕjl, p
l〉| ≳ R
z
−1. Now let Φk = (ϕj1, …, ϕjk) and Φ = Φd. We start by showing that ∥∇Φ|z (w − z)∥ ≳d 1/R
z ∥w − z∥. Indeed, suppose that ∥∇Φk|z (w − z)∥ ≤ c/R
z ∥w − z∥, for all k = 1, …, d. For c small enough, this will lead to a contradiction. Let w − z = Σl
a
l
p
l. We have (using say Lemma 3)
By induction, |a
k| ≤ Σl=1
k
c
l ∥w − z∥. For c small enough, |a
i| ≤ ∥w − z∥/d. This is a contradiction since ∥Σi
a
i
p
i∥ = ∥w − z∥ and ∥p
i∥ = 1. We also have, by Proposition 5,
Finally, by ensuring ∥z − w
i∥/R
z is smaller than a universal constant for i = 1, 2, we get from Eq. 0.16
which proves the lower bound 0.5. To prove the upper bound of 0.5, we observe that from Proposition 5 we have the upper bound |∂plϕil (z)|≲ AveRz
z (ϕil), and since ϕil is L
2-normalized, the right hand side can be as big as ∼ R
z
−d/2. Therefore, we can choose γl as in the statement of the theorem so as to satisfy the upper bound 0.5. This completes the proof for the Euclidean case.
In the manifold case, we consider first the case g ∈ 𝒞2, and thus let α ⋀ 1 = 1 in what follows. Let R
z be as in the theorem. We take c
1 ≤ (1/2)δ0 chosen so that
for all x ∈ B
2c1Rz (z). For this g, the above is carried on in local coordinates. It is then left to prove that the Euclidean distance in the range of the coordinate
map is equivalent to the geodesic distance on the manifold. For all x, y ∈ B
c1
Rz (z)
For the converse, let γ: [0, 1] → ℳ be the geodesic from x to y. γ is contained in B
2dℳ(x,y) (x) on the manifold, whose image in the local chart is contained in B
2(1+∥g∥α⋀1)dℳ
(x,y) (x). We have
Finally, when g ∈ 𝒞α we will need:
Lemma 4.
Let J > 0 be given. If ∥g̃
n
il − g
il∥L∞(BR(z))→n 0 with ∥g̃
n
il∥𝒞α
uniformly bounded, then for j < J
To conclude the proof of the theorem, let J = c
5
R
z
−2, depending on d, (1/2)c
min, 2c
max, ∥g∥α⋀1, α ⋀ 1. We may approximate g in 𝒞α norm arbitrarily well by a 𝒞2 (ℳ) metric. By the above lemma, and our main theorem for the case of 𝒞2 metric, we obtain the theorem for the 𝒞α case.
Examples
Example 2. Mapping with eigenfunctions, non simply-connected domain.
We consider the planar, non-simply connected domain Ω in Fig. 1. We fix a point z ∈ Ω, as in the figure, and display two eigenfunctions whose existence is implied by Theorem 1.
A non-simply connected domain in ℝ2. The dark circle is the neighborhood to be mapped, and grayscale intensity represents two (left and right) eigenfunctions for the embedding. Each of them has about half an oscillation in the neighborhood, and these two half-oscillations are in roughly orthogonal directions.
Example 3. Localized eigenfunctions.
In this example, we show that the factors γ1, …, γd in Theorem 1 and 2 may in fact be required to be as small as R z d/2. We consider the “two-drums” domain in Fig. 2, consisting of a unit-size square drum, connected by a small aperture to a small square drum, with size τ/N, where τ is the golden ratio. The with of the connecting aperture is δτ/N, for small δ. For this domain, for small enough δ, and for z in the smaller square, it can be shown that all possible eigenfunctions that may get chosen in the theorem are localized in the smaller square This is essentially a consequence of the fact that the proper frequencies of the two drums, for δ = 0, are all irrational with respect to each other, and therefore eigenfunctions are perfectly localized on each drum. For δ small enough, a perturbation argument shows that the eigenfunctions will be essentially localized on each drum. But the eigenfunctions localized on the small drum, being normalized to L 2 norm, will have L ∞ norm as large as R z −d/2, and therefore the lower bound for the γi's is sharp.
Acknowledgments
We thank K. Burdzy, R. R. Coifman, P. Gressman, H. Smith, and A. D. Szlam for useful discussions during the preparation of the manuscript, as well as IPAM for hosting these discussions and more. P.W.J., M.M., and R.S. are grateful for partial support from, respectively, NSF DMS 0501300, NSF DMS 0650413 and ONR N0001407-1-0625, NSF DMS 0502747.
Footnotes
- ‡To whom correspondence should be addressed. E-mail: mauro.maggioni{at}duke.edu
-
Author contributions: P.W.J., M.M., and R.S. designed research, performed research, analyzed data, and wrote the paper.
-
The authors declare no conflict of interest.
- © 2008 by The National Academy of Sciences of the USA












