Overview

The proof is a comparison argument at three levels. First, the surface problem is replaced by the Neumann Laplacian on the thin tube ; the normal direction contributes only high modes, so the first fixed eigenvalues differ from the Laplace-Beltrami eigenvalues by .

Second, a weighted finite-volume graph Laplacian is introduced on the cut cells of the lattice. Cell averages of smooth Neumann eigenfunctions give the upper bound for .

Third, the lower bound is obtained by trilinear interpolation. A low-energy graph eigenspace is interpolated into ; local finite-element estimates control the continuum Dirichlet energy by the graph energy, while a discrete trace estimate controls cells cut by . The min-max principle on then forces the graph eigenvalues from below.

Finally, the weighted graph is compared with the unweighted graph. Since the two differ only in an boundary layer, the resulting perturbation is lower order once . Balancing the tube error and the boundary-layer error gives .

The proof has no new tools involved, hence not adequate for publication.

Statement and Notation

Let be a connected closed surface with unit normal . Let be the signed distance function and let

Throughout is smaller than a fixed tubular radius of . In this tube every point is written uniquely as

The surface eigenvalues are denoted by

where the eigenfunctions are orthonormal in . Repeated eigenvalues are listed with multiplicity. All constants below may depend on and on a fixed spectral index , but not on or on the lattice scale .

For define

The scaled graph Laplacian is

The inner product on functions on is

Main estimate

Let be the th eigenvalue of with respect to . For ,

In particular, for fixed , the choice gives

1. Eigenvalues on the Thin Tube

Let be the Neumann eigenvalues of on :

Lemma 1.1: tube comparison

For each fixed ,

Proof. In normal coordinates the Euclidean volume form has the expansion

where is the shape operator. The tangential metric on is also an perturbation of the metric on .

For the upper bound, lift the first surface eigenfunctions constantly in the normal direction:

If and , then

and

The min-max principle therefore gives

For the lower bound, define the weighted normal average

The one-dimensional Neumann Poincare inequality along normal fibers implies

Jensen’s inequality and the metric expansion give

Let be the span of the first lifted and normalized modes. If in , then is orthogonal to up to an perturbation. Equivalently, after replacing the lifted basis by the Gram-Schmidt orthonormalization of , the perturbation is absorbed in the constants. Hence

Combining this estimate with the normal Poincare inequality yields

The max-min principle for the Neumann Laplacian gives the desired lower bound for . This proves the lemma.

2. The Weighted Graph Laplacian

Let

and set

Then . The weighted inner product is

The weighted graph Laplacian is

Its quadratic form is

Define the piecewise-constant reconstruction and the cell-average projection by

Then .

Lemma 2.1: consistency of cell averages

For every ,

and

Proof. Split , where

The boundary set is contained in an -neighborhood of , hence . If and , then unless lies in the boundary layer. For an interior edge,

By Cauchy-Schwarz and the fundamental theorem of calculus,

Multiplication by the weight factor and summation over all interior edges gives at most . The remaining edges have at least one endpoint in . There are such edges, and each contributes at most

Thus the total boundary contribution is .

For the second estimate, on each cell ,

Summing over gives . Since , the stated bound follows.

Lemma 2.2: weighted upper bound

Let be the th eigenvalue of in . Then

Proof. Let , where are the Neumann eigenfunctions on . The thin-tube elliptic estimate

is obtained by applying local elliptic estimates to and rescaling the normal coordinate. Lemma 2.1 gives

The same lemma gives

Therefore

Taking the maximum over and then using min-max gives

Lemma 1.1 replaces by and proves the estimate.

3. Trilinear Interpolation and the Weighted Lower Bound

Let be the Cartesian mesh of cubes

For a grid function define to be the standard trilinear interpolant on every cube whose vertices are in the one-layer enlargement of . On the boundary layer of we use the restriction of the same local trilinear polynomial. Values needed outside are filled by the nearest value in ; this affects only the boundary layer and is estimated below. The resulting function is in .

Lemma 3.1: one-cube interpolation estimates

Let and let be the trilinear interpolant of the eight nodal values of on . Then

where the sum is over the twelve edges of and is the difference of the endpoint values. In particular, after summing over full interior cubes, the interpolated energy is bounded by the corresponding graph energy. Moreover,

where is the average of on .

Proof. Write , , and let

For example,

The coefficients in this convex combination are nonnegative and sum to one. Jensen’s inequality gives

After integration over , this is bounded by times a convex weighted sum of the four squared edge differences in the direction. The same argument in the other two coordinate directions proves the gradient estimate. The stated summed form follows because each full-grid edge is counted with total weight at most one. The second estimate is the Poincare inequality on the cube applied to .

Lemma 3.2: discrete trace estimate in the tube

Let be the union of grid cells meeting the boundary layer . If , then

Proof. Work in normal coordinates and partition into surface patches of diameter comparable to . Above each patch the lattice points form, up to a uniformly bounded overlap, normal strings of length comparable to and mesh size . It suffices to prove the corresponding one-dimensional statement. For a sequence with ,

This follows by writing each boundary value as the average of the string plus the telescoping sum from the boundary to the interior, and then applying Cauchy-Schwarz. Summing these inequalities over the tangential patches gives the stated estimate, because the normal edge contribution is bounded by and .

Lemma 3.3: interpolation estimate on low-energy subspaces

Suppose is a finite-dimensional subspace of grid functions such that

Then, for all ,

and

Proof. On cubes lying a distance at least from , all nodal control volumes have full weight . The summed form of Lemma 3.1 bounds the interpolated energy on these cubes by the interior part of with leading constant one.

It remains to estimate the cubes meeting the boundary layer. Lemma 3.1 bounds their contribution by times the squared edge differences in an enlargement of that layer. The portion of those edge differences already present in is absorbed into . The values inserted in the one-layer extension and the cut-cell terms are controlled by Lemma 3.2; the resulting contribution is

This proves the gradient estimate.

For the norm estimate, use the standard mass-lumping estimate for elements. On a full cube ,

where denotes the eight vertices of . Summing this estimate over the interior cubes and using the bounded overlap of vertex stars gives

The part of the mass in is controlled by Lemma 3.2. Combining this trace bound with the gradient estimate already proved gives

This proves the lemma.

Lemma 3.4: weighted lower bound

For each fixed ,

Proof. Let be the span of the first eigenvectors of . By Lemma 2.2,

for and sufficiently small. Therefore Lemma 3.3 applies on with . The lower bound on implies that is injective on , so has dimension . The continuum min-max principle on gives

Using Lemma 3.3 in this quotient yields

Solving this inequality for and then applying Lemma 1.1 gives the claimed lower bound.

4. Passage to the Unweighted Graph

The remaining issue is that uses cut-cell volumes, whereas uses the uniform volume on lattice points lying inside . Let

Lemma 4.1: smooth boundary-layer comparison

Let . Then

and

Proof. If , then and the two norms coincide at . The norm difference is supported on lattice points whose cubes meet . This set has elements and each term has size at most , which proves the norm estimate. The form estimate is similar: only boundary-layer edges differ, there are of them, and along such an edge

After multiplication by the graph scaling and the volume weight , the total contribution is .

Lemma 4.2: unweighted interpolation lower bound

Suppose is a finite-dimensional subspace of functions on such that

Then the trilinear interpolant satisfies

and

Proof. This is the unweighted analogue of Lemma 3.3. On interior cubes the proof is identical, because the unweighted control volume is exactly . On cubes meeting , the same one-dimensional trace inequality used in Lemma 3.2 gives

This controls both the boundary part of the interpolated energy and the boundary part of the mass. The interior mass comparison is again the mass-lumping estimate, which gives the term.

Proof of the main theorem. For the upper bound, use the trial space , where . Lemma 4.1 and the thin-tube elliptic estimates

show that replacing and by and changes the Rayleigh quotient by at most the relative term and the additive term . Combining this with Lemma 2.2 yields

For the lower bound, let be the span of the first eigenvectors of on . The upper bound just proved implies

for small and . Therefore Lemma 4.2 applies to with . Since is injective on , the min-max principle on gives

Using Lemma 4.2 in this quotient and then solving for gives

where Lemma 1.1 was used to replace by . The two inequalities prove the asserted estimate. Taking proves the corollary for fixed .

Numerical Check

For the unit sphere , the Laplace-Beltrami spectrum is with multiplicity . Thus

The numerical experiment uses the spherical shell with and lattice resolutions

The figure uses actual sparse graph eigenvalues computed by block LOBPCG for , with the constant vector constrained out. Projected spherical harmonics are used only as initial guesses for the iteration, not as a prescribed eigenspace. For the plotted modes the largest relative residual is about .

The log-log error plot is consistent with the predicted scale. The fourth eigenvalue converges more slowly because it is the first member of the five-dimensional eigenspace and is more visibly affected by the cubic anisotropy of the lattice.

See Also