research

Bourgain's discretization theorem

Abstract

Bourgain's discretization theorem asserts that there exists a universal constant C(0,)C\in (0,\infty) with the following property. Let X,YX,Y be Banach spaces with dimX=n\dim X=n. Fix D(1,)D\in (1,\infty) and set δ=enCn\delta= e^{-n^{Cn}}. Assume that N\mathcal N is a δ\delta-net in the unit ball of XX and that N\mathcal N admits a bi-Lipschitz embedding into YY with distortion at most DD. Then the entire space XX admits a bi-Lipschitz embedding into YY with distortion at most CDCD. This mostly expository article is devoted to a detailed presentation of a proof of Bourgain's theorem. We also obtain an improvement of Bourgain's theorem in the important case when Y=LpY=L_p for some p[1,)p\in [1,\infty): in this case it suffices to take δ=C1n5/2\delta= C^{-1}n^{-5/2} for the same conclusion to hold true. The case p=1p=1 of this improved discretization result has the following consequence. For arbitrarily large nNn\in \mathbb{N} there exists a family Y\mathscr Y of nn-point subsets of 1,...,n2R2{1,...,n}^2\subseteq \mathbb{R}^2 such that if we write Y=N|\mathscr Y|= N then any L1L_1 embedding of Y\mathscr Y, equipped with the Earthmover metric (a.k.a. transportation cost metric or minimumum weight matching metric) incurs distortion at least a constant multiple of loglogN\sqrt{\log\log N}; the previously best known lower bound for this problem was a constant multiple of logloglogN\sqrt{\log\log \log N}.Comment: Proof of Lemma 5.1 corrected; its statement remains unchange

    Similar works

    Full text

    thumbnail-image

    Available Versions