Skip to content
Preprint

The Sharp Dimension Bound in the Johnson--Lindenstrauss Lemma

Aug 2026 · 0 citations · 13 references
Computer Science Mathematics

Abstract

The Johnson--Lindenstrauss lemma asserts that every set of $n$ points in $d$-dimensional Euclidean space embeds into $O(\varepsilon^{-2}\log n)$-dimensional Euclidean space with distortion at most $1+\varepsilon$. Larsen and Nelson conjectured that the optimal target dimension throughout the full range of the parameters $n,d, \varepsilon$ is \[ \Theta\left(\min\left\{d,n-1,\frac{\log(2+\varepsilon^2n)}{\varepsilon^2}\right\}\right). \] We resolve this conjecture in the affirmative. In fact, we prove the stronger statement that the upper bound is attained by a linear map. The matching lower bound, due to Larsen--Nelson and Alon--Klartag, holds even for nonlinear embeddings.

View source

Similar papers

Preprint Jul 2026

A weighted entropy approach for the quadratic inverse large sieve conjecture

The quadratic inverse large sieve problem predicts that the examples sharp at the square-root threshold are essentially quadratic. Hanson proved the first unconditional result in this direction: if $A\subseteq[N]$, $|A|\gg\sqrt N$, and $|A_p|\le p/2+O(1)$ for every prime $p$, then $A$ contains $\gg\log N$ elements in t...

Ernie Croot, C. Yip · 0 citations
Preprint Aug 2026

A Counterexample to the Tang Zhang Schatten Norm Conjecture and Sharp Positive Results

For $m\geq 2$, let $c_p(m)$ be the all-dimensional best constant in $$ \left\|\sum_{k=1}^m A_k\right\|_p \leq c_p(m)\left\|\sum_{k=1}^m |A_k|\right\|_p. $$ Tang and Zhang conjectured an explicit formula for every finite $p>1$. We disprove the conjecture with two explicit real $2\times 2$ rank-one matrices at $p=3/2$. T...

Zi-Jian Zeng, Hou-De Liu, Kurunathan Ratnavelu · 2 citations
Preprint Aug 2026

Nondegeneracy and regularity of polynomial pushforwards

Let $\mu$ be a log-concave probability measure on $\mathbb R^n$ and let $f\colon\mathbb R^n\to\mathbb R^k$ be a polynomial mapping of degree at most $d$. We show that \[ \mu(f\in A) \le C\bigl(\lambda_k(A)\bigr)^{\frac{1}{k(d-1)+1}} \] for every Borel set $A\subset\mathbb R^k$ whenever the image measure $\mu\circ f^{-1...

Egor D. Kosov, A. Zhukova · 1 citation · ⚡1
Preprint Aug 2026

Near-Optimal Bounds for Sketching the Schatten Norms

Let $k_{1,\varepsilon}(n)$ be the smallest number of real linear measurements needed by a randomized oblivious sketch that estimates the nuclear norm of every fixed real $n\times n$ matrix within a factor $1\pm\varepsilon$, with probability at least $2/3$. For every fixed $0<\varepsilon<1$, we prove \[ \frac{n^2}{(\log...

Lin F. Yang · 0 citations
Preprint Aug 2026

The uniform Littlewood conjecture fails on a set of positive Hausdorff dimension

The uniform Littlewood conjecture (ULC), introduced by Bandi, Fregoli and Kleinbock, asserts in the two-number case that $$ \lim_{Q\to\infty} Q\min_{1\le n\le Q}\|n\xi\|\,\|n\zeta\|=0 $$ for all real $\xi,\zeta$. It is proven to hold for almost every pair $(\xi,\zeta)$. Schleischitz, however, has recently disproved the...

N. Shulga · 1 citation
Preprint Jul 2026

The sharp exponent for the minimal distance problem

We show that for every fixed $\varepsilon>0$, there exist arbitrarily large families of point-line pairs $(x_1,\ell_1),\ldots,(x_n,\ell_n)$ in $[0,1]^2$, with $x_i \in \ell_i$ for all $i$, and such that $\operatorname{dist}(x_i,\ell_j)\ge n^{-2/3-\varepsilon}$ for all $i \neq j$. Combined with a previous result of Cohe...

C. Pohoata · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.