Towards a metric characterization of Euclidean spaces - MathOverflow most recent 30 from http://mathoverflow.net 2013-05-22T14:40:15Z http://mathoverflow.net/feeds/question/64269 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/64269/towards-a-metric-characterization-of-euclidean-spaces Towards a metric characterization of Euclidean spaces Marcos Cossarini 2011-05-08T08:42:49Z 2011-05-14T05:55:17Z <p>I want to obtain a metric characterization of the classical finite dimensional spaces of Euclidean geometry. </p> <p>Motivation: Suppose $A$ and $B$ live in an $n$-dimensional Euclidean space. They are each assigned the task of constructing an equilateral triangle of side length 5. Subject $A$ finds first one point $p_1$. If $n>0$, he can then find another point $p_2$ at distance 5 from $p_1$. If $n>1$, he can then find $p_3$ at distance 5 from $p_1$ and $p_2$. Then $B$ proceeds similarly. He selects a point $q_1$ (probably different from $p_1$), then finds another point $q_2$ and $q_3$. We wouldn't expect him to get stuck before constructing $q_3$, since $n$ is the same for both subjects. I will say a space is all-equal if the possibility of completing a figure is independent of the starting points chosen. Are Euclidean spaces all-equal? Are there non Euclidean all-equal spaces? </p> <p>Precise statement </p> <p>Definition: A metric space $X$ is all-equal if every time $S$ and $T$ are isometric subspaces of $X$ (with a selected isometry $S\to T$), the isometry extends to an automorphism of $X$. </p> <p>Question 0: Is every Euclidean space all-equal? </p> <p>To state the second question we must first observe some limitations. Being connected our life intervals, we cannot visit more than one connected component of our space, and being imprecise our measurements, we cannot distinguish directly between a space and its completion. Finally, existing no natural unit of measurement, the correct category to state these questions is that of spaces in which the distance is defined up to scale. That is, it takes values in a 1-dimensional module $M$ over $[0,+\infty)$, with no multiplication structure (although lengths can be tensorised to obtain areas). </p> <p>More definitions: A congruence space is a pair $(X,M,d)$ where $X$ is a set, $M$ is a 1-dimensional $[0,+\infty)$ module and d is a distance in $X$ taking values in $M$. The morphisms from $(X,M,d)$ to $(Y,N,e)$ will be the subsimilarities, that is, the pairs $(f,\alpha)$ where $f$ is a function from $X$ to $Y$ and $\alpha$ is a morphism from $M$ to $N$ such that for each $x$, $x'$ in $X$ we have $e(fx,fx')\leq\alpha(d(x,x'))$. Similarities are similarly defined using an $=$ sign instead of $\leq$. Subspaces are defined by restriction, and the identity of $(X,M,d)$ is the obvious $(id_X,id_M)$. It's easy to prove that every isomorphism is a similarity. A congruence space $X$ is all-equal if every time $S$ and $T$ are similar subspaces, the similarity extends to an automorphism of $X$. </p> <p>Question 1: Is every connected complete all-equal space a finite dimensional real inner-product space? </p> <p>Remarks: if the connectedness hypothesis is dropped, some discrete spaces would be all-equal. If we work in the usual category of metric spaces, projective and hyperbolic spaces could be all-equal, and also Euclidean spheres, both with their inner metric and with the subspace metric. </p> <p>Partial results and lines of thought: </p> <p>EDIT: As noted by Sergei, there are counterexamples. Generally, if $(X,d)$ is an all-equal metric space, and $p>1$, then $(X,d^{\frac 1p})$ could be an all-equal space. This is similar to the example in which However, I was thinking of spaces in which the distance from $x$ to $y$ is measured using a signal that travels form $x$ to $y$ at constant speed. Hence I require that the space have the following property: </p> <p>If $x$ is a point and $a$ and $b$ are lengths, then $N_b(N_a({x}))=N_{a+b}({x})$ (where the $N$ stands for open neighborhood of a set). </p> <p>Related MO questions: <a href="http://mathoverflow.net/questions/47882/characterizations-of-euclidean-space" rel="nofollow">http://mathoverflow.net/questions/47882/characterizations-of-euclidean-space</a> http://mathoverflow.net/questions/41211/easy-proof-of-the-fact-that-isotropic-spaces-are-euclidean <a href="http://mathoverflow.net/questions/8513/characterization-of-riemannian-metrics" rel="nofollow">http://mathoverflow.net/questions/8513/characterization-of-riemannian-metrics</a></p> http://mathoverflow.net/questions/64269/towards-a-metric-characterization-of-euclidean-spaces/64322#64322 Answer by Marcos Cossarini for Towards a metric characterization of Euclidean spaces Marcos Cossarini 2011-05-08T20:52:47Z 2011-05-13T00:22:17Z <p>Since the post is getting too long, I will place here my partial results. </p> <p>If a real Banach space is all-equal, I think that it is finite dimensional and inner-product. This can be proved (at least in the finite dimensional case) using the John ellipsoid (see <a href="http://mathoverflow.net/questions/41211/easy-proof-of-the-fact-that-isotropic-spaces-are-euclidean" rel="nofollow">http://mathoverflow.net/questions/41211/easy-proof-of-the-fact-that-isotropic-spaces-are-euclidean</a>), even though I don't like to introduce such a cumbersome structure. </p> <p>If a Riemannian manifold is all-equal, then it is homogeneous and with constant curvature (how do we deal with the fundamental group?). If a Finsler manifold is all-equal, then I would expect it to be Riemannian (again using the John ellipsoid). I have no idea how to proceed without differential structure. </p> <p>The hypothesis added after edition is equivalent to saying that if $x$, $z$ are points and $a$, $b$, are lengths such that $a+b>d(x,z)$, then there exists $y$ such that $a>d(x,y)$ and $b>d(y,z)$. </p> <p>Now it is easy to construct approximate midpoints, then midpoints (using completeness), then segments, then complete geodesics (a segment can be extended by moving the starting point to the midpoint and the midpoint to the end (EDIT:the starting point must go to the starting point, and the midpoint to the end)). Then every pair of points can be joined by a geodesic of the expected length. </p> <p>Are geodesics unique, or is it possible that there is an ugly graph embedded in the space? (See <a href="http://mathoverflow.net/questions/12394/representability-of-finite-metric-spaces" rel="nofollow">http://mathoverflow.net/questions/12394/representability-of-finite-metric-spaces</a>, an example of ugly graph is a 4-cycle with the path distance.) </p> <p>Is it possible to define angles? That is, suppose $S$ and $T$ are rays with common origin $x$. If I consider $s$ and $t$ their respective intersections with a ball $B_r(x)$ and $s'$, $t'$ their respective intersections with the ball of radius $B_{r'}(x)$, is it true that $\frac{d(s,t)}{r}=\frac{d(s',t')}{r'}$? </p> <p>Actually, since every sphere in an all-equal congruence space is all-equal (as a metric space; it doesn't have dilations), it would be nice to define an intrinsic metric in each sphere, so that the angle between $S$ and $T$ could be defined as $\frac{i(s,t)}{r}$, where $i$ is the intrisic metric of $B_r(x)$. </p> http://mathoverflow.net/questions/64269/towards-a-metric-characterization-of-euclidean-spaces/64345#64345 Answer by Michael Hardy for Towards a metric characterization of Euclidean spaces Michael Hardy 2011-05-09T00:50:50Z 2011-05-09T00:50:50Z <p>Perhaps Wikipedia's article titled <a href="http://en.wikipedia.org/wiki/Distance_geometry" rel="nofollow">distance geometry</a> is relevant.</p> http://mathoverflow.net/questions/64269/towards-a-metric-characterization-of-euclidean-spaces/64808#64808 Answer by Anton Petrunin for Towards a metric characterization of Euclidean spaces Anton Petrunin 2011-05-12T16:19:44Z 2011-05-12T19:37:39Z <p>First let me reformulate the problem.</p> <blockquote> <p>Let $X$ be a complete length space such that $X$ is isometric to any of its rescalings and for any subset $Q\subset X$, any distance preserving map $Q\to X$ can be exteded to an isometry of $X$. Prove that $X$ is isometric to a Euclidean space.</p> </blockquote> <p>I am sure that this can be done, but it does require some work. Below I wrote a sketch which might work; feel free to edit.</p> <p>Consider a maximal set in $X$ such that distance between any pair of points in is equal to 1. Note that if this set (say $Q$) is finite, otherwise there are some distance preserving map from $Q$ to its subset and it can not be exteded to a (bijective!) isometry of $X$. Denote this number by $q(X)$; it will be used instead of dimension as the induction parameter.</p> <p>It is easy to prove existance of lines (two-side infinite minimizing geodesics) in $X$.</p> <p>Note that all level sets of all Busemann functions for any lines in $X$ are isometric and have the same property as $X$, one only has to find a way to show that it is length space. It should be true that for such level set say $X'$, we have $q(X') &lt; q(X)$. Then from induction you get that you can sweep out $X$ by Euclidean spaces, this should not be far from the end of proof. </p> http://mathoverflow.net/questions/64269/towards-a-metric-characterization-of-euclidean-spaces/64935#64935 Answer by Sergei Ivanov for Towards a metric characterization of Euclidean spaces Sergei Ivanov 2011-05-13T21:09:37Z 2011-05-14T05:55:17Z <p>I can complete Anton's plan with an additional assumption that geodesics do not branch. I also assume local compactness (otherwise there are too many technical details to deal with). More precisely, I prove the following:</p> <p>Let $X$ be a geodesic space. Suppose that</p> <ul> <li><p>For every finite subset $Q\subset X$, every similarity $Q\to X$ can be extended to a bijective similarity $X\to X$. A similarity is a map that multiplies all distances by a constant. (It is easy to see that, in the case of a length metric, the more complicated definition from the question reduces to this.)</p></li> <li><p>$X$ is locally compact.</p></li> <li><p>For every two distinct points of $X$ there is a unique line containing them. (A line is a subset isometric to $\mathbb R$. The existence of lines follows from the two other assumptions.)</p></li> </ul> <p>Then $X$ is isometric to $\mathbb R^n$ for some $n$.</p> <p><strong>Proof.</strong> First observe that the group of similarities acts transitively on pairs (oriented line, point not on this line). Indeed, given two such pairs $(\ell_1,p_1)$ and $(\ell_2,p_2)$, it suffices to find similar triples $p_1,x_1,y_1$ and $p_2,x_2,y_2$ where $x_i,y_i$ is a positively oriented pair of points on $\ell_i$. And it is easy to see that such triples $p_i,x_i,y_i$ realise all similarity types of, e.g. isosceles triangles.</p> <p>Next we construct perpendiculars. Lines $\alpha$ and $\beta$ intersecting at a point $q$ are said to be perpendicular if there exists an isometry that fixes $\alpha$ and maps $\beta$ to itself by reflection in $q$. It is easy to see that this relation is symmetric. Further, for every line $\ell$ and every point $p\notin\ell$ there exists a unique perpendicular to $\ell$ containing $p$. To prove existence, pick two points $x,y\in\ell$ such that $|px|=|py|$. There is an isometry that fixes $p$ and exchanges $x$ and $y$. It acts on $\ell$ by reflection in the midpoint $q$ of $[xy]$, hence the line $(pq)$ is perpendicular to $\ell$. Uniqueness follows from the fact that two distinct reflections of $\ell$ cannot fix $p$, otherwise their composition shifts $\ell$ along itself and fixes $p$, and some iteration of this shift would break the triangle inequality.</p> <p>This argument also shows that the base $q$ of the perpendicular is the nearest point to $p$ on $\ell$, and the distance from $p$ to $x\in\ell$ grows monotonically with $|qx|$.</p> <p>Clearly all right-angled triangles with given leg lengths $a$ and $b$ are isometric; denote their hypotenuse by $f(a,b)$. Then $f$ is strictly monotone in each argument and positively homogeneous: $f(ta,tb)=tf(a,b)$.</p> <p>Next, we show that the sum of Busemann function of two opposite rays is zero. Or, equivalently, if $\gamma$ is an arc-length parametrized line, $q=\gamma(0)$ and a line $(pq)$ is perpendicular to $\gamma$, then $B_\gamma(p)=0$ where $B_\gamma$ denotes the Busemann function of $\gamma$. Suppose the contrary. We may assume that $|pq|=1$ and $B_\gamma(p)=c>0$. This means that for every point $x\in\gamma$ we have $|px|-|qx|\ge c$. Let $s\in\ell$ be very far away and let $p_1$ be the perpendicular from $q$ to $(ps)$. The above inequality implies that $|pp_1|\ge c$, hence we have an upper bound $|qp_1|\le\lambda&lt;1$ where $\lambda$ is determined by $f$ and $c$ and does not depend on $s$. Let $q_1$ be the base of the perpendicular from $p_1$ to $(qs)$, then rescaling the above inequality yields that $|p_1q_1|\le\lambda|qp_1|\le\lambda^2$. The next perpendicular (from $q_1$ to $p_2$ on $(ps)$) has length at most $\lambda^3$ and so on. Summing up these perpendiculars, we see that $|ps|\le 1/(1-\lambda)$ which is not that far away, a contradiction.</p> <p>The fact that opposite rays yield opposite Busemann functions implies that the Busemann function of a line $\gamma$ is the only 1-Lipschitz function $f$ such that $f(\gamma(t))=-t$ for all $t$. And, given local compactness and non-branching of geodesics, this implies that $X$ is split into lines parallel to $\ell$, where a line $\gamma_1$ is said to be parallel to $\gamma$ if the Busemann function of $\ell$ decays with unit rate along $\gamma_1$ (to construct a parallel line, just glue together two opposite asymptotic rays). Further, Busemann functions of parallel lines coincide, due to their above mentioned uniqueness.</p> <p>Now it is easy to see that the level set of a Busemann function (which is also a union of perpendiculars to a given line at a given point) has the same isometry extension property and is a geodesic space. Then we can carry induction in the parameter $d$ defined as the maximum number of pairwise perpendicular lines that can go through one point. The cases $d=1$ and $d=2$ can be done by hand, then use isometries exchanging perpendicular lines to do the induction step.</p>