Assaf Naor and I have just uploaded to the arXiv our joint paper “Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem“.

Consider a finite metric space , with being a set of points. It is not always the case that this space can be isometrically embedded into a Hilbert space such as ; for instance, in a Hilbert space every pair of points has a unique midpoint, but uniqueness can certainly fail for finite metric spaces (consider for instance the graph metric on a four-point diamond). The situation improves, however, if one allows (a) the embedding to have some distortion, and (b) one is willing to embed just a subset of , rather than all of . More precisely, for any integer and any *distortion* , let be the largest integer with the property that given every -point metric space , there exists a -point subset of , and a map , which has distortion at most in the sense that

for all .

Bourgain, Figiel, and Milman established that for any fixed , one has the lower bound , and also showed for sufficiently close to there was a matching upper bound . This type of result was called a *nonlinear Dvoretsky theorem*, in analogy with the linear Dvoretsky theorem that asserts that given any -dimensional normed vector space and , there existed a -dimensional subspace which embedded with distortion into , with . In other words, one can ensure that about of the points in an arbitrary metric space behave in an essentially Euclidean manner, and that this is best possible if one wants the distortion to be small.

Bartel, Linial, Mendel, and Naor observed that there was a threshold phenomenon at . Namely, for , the Bourgain-Figiel-Milman bounds were sharp with ; but for one instead had a power law

for some . In other words, once one allows distortion by factors greater than , one can now embed a polynomial portion of the points, rather than just a logarithmic portion, into a Hilbert space. This has some applications in theoretical computer science to constructing “approximate distance oracles” for high-dimensional sets of data. (The situation at the critical value is still unknown.)

In the special case that the metric is an ultrametric, so that the triangle inequality is upgraded to the *ultra-triangle inequality* , then it is an easy exercise to show that can be embedded isometrically into a Hilbert space, and in fact into a sphere of radius . Indeed, this can be established by an induction on the cardinality of , using the ultrametric inequality to partition any finite ultrametric space of two or more points into sets of strictly smaller diameter that are all separated by , and using the inductive hypothesis and Pythagoras’ theorem.

One can then replace the concept of embedding into a Hilbert space, with the apparently stronger concept of embedding into an ultrametric space; this is useful for the computer science applications as ultrametrics have a tree structure which allows for some efficient algorithms for computing distances in such spaces. As it turns out, all the preceding constructions carry over without difficulty to this setting; thus, for , one can embed a logarithmic number of points with distortion into an ultrametric space, and for one can embed a polynomial number of points.

One can view the task of locating a subset of a metric space that is equivalent (up to bounded distortion) to an ultrametric as that of *fragmenting* a metric space into a tree-like structure. For instance, the standard metric on the arithmetic progression of length is not an ultrametric (and in fact needs a huge distortion factor of in order to embed into an ultrametric space), but if one restricts to the Cantor-like subset of integers in whose base expansion consists solely of s and s, then one easily verifies that the resulting set is fragmented enough that the standard metric is equivalent (up to a distortion factor of ) to an ultrametric, namely the metric where is the largest integer for which divides and .

The above fragmentation constructions were somewhat complicated and deterministic in nature. Mendel and Naor introduced a simpler probabilistic method, based on random partition trees of , which reproved the above results in the high-distortion case (with in the limit ). However, this method had inherent limitations in the low-distortion case, in particular failing for (basically because the method would establish a stronger embedding result which fails in that regime).

In this paper, we introduce a variant of the random partition tree method, which involves a random fragmentation at a randomly chosen set of scales, that works all the way down to and gives a clean value for the exponent , namely ; in fact we have the more precise result that we can take to be , where is the unique solution to the equation

and that this is the limit of the method if one chooses a “scale-oblivious” approach that applies uniformly to all metric spaces, ignoring the internal structure of each individual metric space.

The construction ends up to be relatively simple (taking about three pages). The basic idea is as follows. Pick two scales , and let be a random sequence of points in (of course, being finite, every point in will almost surely be visited infinitely often by this sequence). We can then partition into pieces , by defining to be the set of points for which is the first point in the sequence to lie in the ball . We then let be the subset of in which actually falls in the smaller ball . As a consequence, we see that each is contained in a ball of radius (namely ), but that any two are separated by a distance of at least (from the triangle inequality). This gives one layer of a quasi-ultrametric tree structure on ; if one iterates this over many different pairs of scales , one gets a full quasi-ultrametric tree structure, which one can then adjust with bounded distortion to a genuine ultrametric structure. The game is then to optimise the choice of so as to maximise the portion of that remains in the tree; it turns out that a suitably random choice of such scales is the optimal one.

## 5 comments

Comments feed for this article

22 March, 2010 at 10:42 pm

Yan ShenHey Professor Tao, this is entirely off of the topic of this particular post and probably all of your other posts as well, but I was just wondering what your personal philosophical views towards mathematics was? Are you a Platonic realist? Or do you adopt the viewpoint of mathematical fictionalism? Or perhaps something entirely different altogether? I find mathematical fictionalism to be a particularly reasonable point of view, given that it seems rather absurd to posit the existence of objects transcending the physical world of space-time.

http://plato.stanford.edu/entries/fictionalism-mathematics/

By the way, the mathematics on this blog is light-years beyond my comprehension… :)

24 March, 2010 at 6:30 pm

Terence TaoMathematics can be used to model the real world, but this does not imply that mathematical objects are “real” in any ontological sense. Conversely, real world intuition is very useful for thinking about mathematical concepts, but this again does not directly impact whether one should view concepts as “real” or not.

As long as one maintains the map-territory distinction between a real-world system, and a mathematical model of that system, I find that one’s philosophical interpretation of mathematical concepts makes very little practical difference in doing mathematics.

23 March, 2010 at 2:01 am

konradswanepoelIn your definition of an ultrametric on the Cantor-like subset of , I think you meant the largest for which divides .

[Corrected, thanks – T.]24 March, 2010 at 1:53 pm

gowersAnother small typo — at one point you write “a logarithmic points” when you clearly mean “a logarithmic number of points”.

[Corrected, thanks – T.]29 March, 2010 at 4:58 pm

Yan ShenThanks for the response Professor Tao! I assume based off of your response that you remain ontologically non-committal on the issue of mathematical realism. Judging by the large number of thumbs down my comment received, I’m guessing that your readers either felt I was posting something entirely off topic, or are in fact fervently Platonic realist. Either way, thanks for the response, and once again I apologize for deviating off the topic of your particular post.