The Andoni–Krauthgamer–Razenshteyn characterization of sketchable norms fails for sketchable metrics

Andoni, Krauthgamer and Razenshteyn (AKR) proved (STOC’15) that a finite-dimensional normed space (X, k·kX) admits a O(1) sketching algorithm (namely, with O(1) sketch size and O(1) approximation) if and only if for every ε ∈ (0, 1) there exist α > 1 and an embedding f : X → `<sub>1</sub>−ε such that kx − ykX 6 kf(x) − f(y)k<sub>1</sub>−<sub>ε</sub> 6 αkx − yk<sub>X</sub> for all x, y ∈ X. The”if part” of this theorem follows from a sketching algorithm of Indyk (FOCS 2000). The contribution of AKR is therefore to demonstrate that the mere availability of a sketching algorithm implies the existence of the aforementioned geometric realization. Indyk’s algorithm shows that the”if part” of the AKR characterization holds true for any metric space whatsoever, i.e., the existence of an embedding as above implies sketchability even when X is not a normed space. Due to this, a natural question that AKR posed was whether the assumption that the underlying space is a normed space is needed for their characterization of sketchability. We resolve this question by proving that for arbitrarily large n ∈ N there is an n-point metric space (M(n), d<sub>M</sub>(n<sub>)</sub>) which is O(1)-sketchable yet for every ε ∈ (0, <sup>1</sup><sub>2</sub> ), if α(n) > 1 and f<sub>n</sub> : M(n) → `₁−_ε are such that d_M(n₎(x, y) 6 kf_n(x) − f_n(y)k₁−_ε 6 α(n)d_M(n₎(x, y) for all x, y ∈ M(n), then necessarily lim_n→∞ α(n) = ∞.