It is common to consider vector spaces , , , … as a nested sequence with inclusion maps

To define these inclusion maps we did not need any structure of other than the existence of a distinguished element . The same could be done for any *pointed set*, i.e., a set with a distinguished element . Each inclusion is *split*, because we can retract onto by deleting the last coordinate. This works in the category of sets, and also in every other category I can think of.

However, many naturally occurring manifolds (more generally, metric spaces) do not have any distinguished elements: spheres, hyperbolic spaces, tori, … indeed, such spaces are called *homogeneous* because all their points look alike (the group of isometries is transitive). The line did not have a distinguished element until we gave it the group structure of , and to introduce such a structure we had to make an arbitrary choice of a point to be called .

Is there a way to have a nested sequence of powers of a space without distinguished points? Yes, but it will not be the Cartesian product . Instead, we consider the *symmetric product* whose elements are nonempty subsets of with cardinality at most . This product (really a power, but the name “symmetric product” is more common) is naturally related to :

- There is a canonical surjection which sends to .
- If are disjoint subsets of , then the restriction of to is injective.

The symmetric products are nested by virtue of the obvious inclusion : each set stays as it is, nothing needs to be added.

If is a topological or metric space, we can give the same structure to by declaring to be a quotient map. In the metric case there is a more direct and explicit definition of a metric on : the *Hausdorff metric*. First, introduce -neighborhood of a set : this is the set of all points at distance at most from , denoted . Given two sets , define

To better relate this metric to , we use the maximum metric on : the distance between is . It is clear that the forgetful surjection is -Lipschitz. Unfortunately, it is not a submetry: for example, the points and are at unit distance in but any pair of their preimages under has distance at least in . Oh well.

Recalling that the inclusions of Cartesian products are split, we ask if the same holds for symmetric products: is there always a retraction when ? A retraction is a Lipschitz map (in topological setting, continuous) which agrees with the identity on .

For example, is the circle a retract of ? The first idea may be to appeal to non-existence of continuous single-valued square root, but then we recall that a retraction need not send into either or . The following argument works, though: supposing that is a retraction, for each fixed we define the map so that is the sole element of . Then is the identity, is an even map (hence of even degree), but they are homotopic via , which is a contradiction.

In the positive direction, is a Lipschitz retract of whenever . The idea is simple: given a set of cardinality , label its elements as and define where . This can even be promoted to a deformation retraction via , . Geometrically, this map deflates all gaps in the set at the same rate, until the smallest one collapses.

For a slightly more general version, see Lemma 4.2 here.

I got stuck on the case when is , the Euclidean plane . It is easy to retract onto : just send each two-point set into its center of mass (midpoint). I also have a Lipschitz retraction of onto , but it is not as simple. Given a -point set in the plane, let be the center of the circle inscribed in the triangle with vertices ; if the points are collinear, let be the one that lies between two others. Equivalently, is the center of mass of the vertices where each vertex is given weight equal to the length of opposite side. One can check that the map is Lipschitz. By relabeling vertices, we may assume that . Let be the point on the segment at distance from . The map is the desired retraction. Again, we can make it into a deformation retraction in an obvious way.

In both cases, the idea is to pretend that the original set lives on a tree, and pull all of its elements toward some vertex of the tree. The incenter of triangle enters the game once one recalls the tripod representation of a -point set. However, with sets of greater cardinality the non-hyperbolicity of becomes apparent, making it hard to pretend that we work with a tree. I do not know if there is a Lipschitz retract from to for every .

Sorry I didn’t understand the non-hyperbolicity part.. You can form a tight span of the n-point space , and pull every point toward the “center” right?

Define a point, so that the sum of the pairwise distances from all points in the set to this point is minimized. Then pull every point simultaneously toward that point until the first 2 of them arrive.

Intuitively the path should be stable. Consider points on the convex hull of the set of points, and leave out the interior points for now. In this case that optimal point is the center of mass inside the hull. Adding one interior point at a time should only move that optimal point inside the convex hull, and the rate of movement depends on the distance between that point to the optimal point.

Let’s see if the following works. Build a hierarchical clustering tree on the given n points with euclidean distance. Imagine hypothetical edges exist among nodes with the same parents, which makes the tree a composition of several triangles. Now shrink the edges of the triangles with a uniform speed, until one of the edges completely disappear. For nodes that contain more than one points, we shrink the edges by moving the center of mass of the points, which is done by moving points in this node uniformly in the same direction.

As an illustration, consider the example you gave. becomes:

layer 1:

layer 2: left: right:

the center of the left node of layer 1 is , right . Let them move together with unit speed.

Meanwhile, the left and right branches themselves move together with unit speed.

The net effect is, after t unit of time, the points become

So they will meet at

.

Now consider the other configuration :

layer 1:

layer 2: left: right:

layer 3: left: latex \{(t,0)\}, \{(t, \epsilon-2t)\}, \{(t,t-\epsilon)\}, \{(1-t, 0)\}$

They also meet at

.