Main menu:

Categories

Site search

 

April 2007
M T W T F S S
« Mar   May »
 1
2345678
9101112131415
16171819202122
23242526272829
30  

Archives

Meta

Spectral rigidity.

For X a metric space, and S \subset X, define the length spectrum of S to be D_S := { d(x,y) : x, y \in S }. It might be better to call this the “distance spectrum” or “distance set.”

Ian, during his Pizza seminar, gave the following definition: a set S \subset \R^n is a k-distance set if D_S has cardinality no greater than k. In words, the distances between points in a k-distance set take on no more than k possible values.

The question that Ian answered is the following: how big can a k-distance set in \R^n be? Clever linear algebra shows that the size grows polynomially in n with degree k. A related exercise is the following: suppose S \subset \R^n and D_S is countable; prove that S is countable.

Now here is my question: suppose S \subset \R^n and D_S is measurable with measure m. Can one then bound the measure of S? Ian asked this for the counting measure, but presumably one can get results for Lebesgue measure. Likewise, one can ask this for spaces other than \R^n.

All this talk of spectra has gotten me thinking very vaguely about a bunch of stuff—some random ideas! One context in which I have seen spectra is for lattices in Lie groups; I don’t know, but definitely ought to know how much control the spectrum exerts on the lattice. As a baby example, it is true that one can recover a lattice \Lambda \subset \R^2 from its length spectrum? Similarly, a Riemannian manifold has a length spectrum, and the “marked length rigidity conjecture” asks how much of the Riemannian structure is related to this. For information:

Furman, Alex Coarse-geometric perspective on negatively curved manifolds and groups. Rigidity in dynamics and geometry (Cambridge, 2000), 149—166, Springer, Berlin, 2002.

Finally, it is possible to define a “spectral distance” (I’m mis-using so many word here!) between two lattices in a Lie group. Namely, given \Lambda_1, \Lambda_2 \subset G, define d(\Lambda_1, \Lambda_2) = d_{GH}(D_{\Lambda_1}, D_{\Lambda_2}), i.e., the Hausdorff distance between their spectra. Though you’d probably want something slightly more refined (to count multiplicities). You could likewise say that two manifolds are “nearly isospectral” if their spectra are not so far apart in Gromov-Hausdorff distance. I have no idea whether this is a good idea; it probably isn’t. In any case,

Sunada, Toshikazu Riemannian coverings and isospectral manifolds. Ann. of Math. (2) 121 (1985), no. 1, 169—186.

constructs isospectral manifolds, and it would be interesting to know how easy it is to construct nearly isospectral manifolds. A braver person than I might conjecture that two manifolds are isospectral if they are \epsilon-nearly isospectral for small enough \epsilon.

At last, can one detect arithmeticity of a lattice from its spectrum? I suppose if I were really hip, I would ask: can a geometer hear arithmeticity? I think Sunada’s examples are all arithmetic?

Comments

Comment from Jean Lafont
Time: November 15, 2008, 5:43 pm

Didn’t Milnor have a construction of two high dimensional flat toris that were isospectral but not isometric? I don’t recall if he was looking at the length spectrum or the spectrum of the Laplacian, but anyways, might be relevant to your first question. Also, Gopal Prasad has several recent preprints with Rapinchuk looking at isospectrality questions for arithmetic lattices… they might say something about your last question.

Write a comment