On the impossibility of dimension reduction in l(1)
The Johnson-Lindenstrauss lemma shows that any n points in Euclidean space (i.e., R" with distances measured under the l(2) norm) may be mapped down to O((log n)/epsilon(2)) dimensions such that no pairwise distance is distorted by more than a (1 + epsilon) factor. Determining whether such dimension reduction is possible in l(1) has been an intriguing open question. We show strong lower bounds for general dimension reduction in l(1). We give an explicit family of n points in l(1) such that any embedding with constant distortion D requires n(Omega(1/D2)) dimensions. This proves that there is no analog of the Johnson-Lindenstrauss lemma for l(1); in fact, embedding with any constant distortion requires n(Omega(1)) dimensions. Further, embedding the points into l(1) with (1 + epsilon) distortion requires n(1/2-O(epsilon log(1/epsilon))) dimensions. Our proof establishes this lower bound for shortest path metrics of series-parallel graphs. We make extensive use of linear programming and duality in devising our bounds. We expect that the tools and techniques we develop will be useful for I future investigations of embeddings into l(1).
dimension reduction embedding metric spaces