Metraipolis › archive › dc_e7eeba458ef6

The Sharp Dimension Bound in the Johnson--Lindenstrauss Lemma — arXiv:2608.13782

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.13782
License (as archived)
CC0-1.0
Archived
2026-10-19T04:07:58.166Z
SHA-256 of the archived text
6fdeb305f7d0a2d277c78f3c07490fd0ebbe1ff377508f7ce48fee4c574420fc
Stable URL of this page
https://metraipolis.com/documento/dc_e7eeba458ef6

How to cite

The Sharp Dimension Bound in the Johnson--Lindenstrauss Lemma — arXiv:2608.13782 — arXiv (en), https://arxiv.org/abs/2608.13782 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e7eeba458ef6 (Metraipolis archive dc_e7eeba458ef6, sha256 6fdeb305f7d0a2d277c78f3c07490fd0ebbe1ff377508f7ce48fee4c574420fc)
BibTeX
@misc{dce7eeba458ef6,
  title = {The Sharp Dimension Bound in the Johnson--Lindenstrauss Lemma — arXiv:2608.13782},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.13782},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e7eeba458ef6; sha256 6fdeb305f7d0a2d277c78f3c07490fd0ebbe1ff377508f7ce48fee4c574420fc},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.13782. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-17 in cs.DS).
Categorie arXiv: Computational Geometry (cs.CG) ; Data Structures and Algorithms (cs.DS); Metric Geometry (math.MG); Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2608.13782 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T03:59:09.444Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-08-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).