Source authenticated

Naor's sublinear-dimension question for finite subsets of Lp, 1 < p < infinity, p not 2

Theorem 1.1: for fixed 1<p<∞1<p<\infty, p≠2p\ne2, and D>1D>1, every nn-point subset of any LpL_p embeds with distortion DD into ℓpd\ell_p^d (same exponent, coordinate target, nonlinear map) with d≤exp⁡(Cp,D(log⁡n)γ(p))=no(1)d\le\exp(C_{p,D}(\log n)^{\gamma(p)})=n^{o(1)}, where γ(p)=2−p\gamma(p)=2-p for p<2p<2 and 1−2/p1-2/p for p>2p>2; exact embeddings need dimension of order n2n^2. This answers the o(n)o(n) question for every p∈(1,∞)∖{2}p\in(1,\infty)\setminus\{2\}. Not shown: p=1p=1; Naor's Question 13 itself (O(log⁡n)O(\log n) dimension in some normed space), which Naor-Ren's 2026 lower bound already excludes for ℓpd\ell_p^d targets when p>2p>2; optimal exponents; an efficient algorithm.

Exact FrontierDelta

Prior state unknown→proved

Scope and record

Occurred: Sep 23, 2026

Delta type: SOURCE CLAIM

Assumptions: VibeMathed verification: lean-checked. Publication: announcement. AI contribution: ai-discovered. VibeMathed editorial classifications, scores, notes, relations, and dataset structure are CC BY 4.0. Source statements and linked content retain their own rights.

Canonical aliases: Naor's sublinear-dimension question for finite subsets of Lp, 1 < p < infinity, p not 2 · Sublinear dimension reduction in Lp

Confidence: Not scored

Registry verification: lean checked · announcement · candidate

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

Unreleased internal OpenAI model
model · ai model contributor · OpenAI

Artifacts and verifiers

Lean proof (OAI.SubpolynomialLp.source_main)

lean artifact · pending

Artifact ↗
Comparator statement: SubpolynomialLp.lean

lean artifact · pending

Artifact ↗

Compute record

No linked compute attempts recorded.

Lineage and corrections

VibeMathed record: Naor's sublinear-dimension question for finite subsets of Lp, 1 < p < infinity, p not 2 evidence for this event

Naor's sublinear-dimension question for finite subsets of Lp, 1 < p < infinity, p not 2 evidence for this event

This event attributed to Unreleased internal OpenAI model

Lean proof (OAI.SubpolynomialLp.source_main) evidence for this event

Comparator statement: SubpolynomialLp.lean evidence for this event

Naor, Metric dimension reduction: a snapshot of the Ribe program (arXiv) evidence for this event

Theorem 1.1: for fixed 1<p<∞1<p<\infty, p≠2p\ne2, and D>1D>1, every nn-point subset of any LpL_p embeds with distortion DD into ℓpd\ell_p^d (same exponent, coordinate target, nonlinear map) with d≤exp⁡(Cp,D(log⁡n)γ(p))=no(1)d\le\exp(C_{p,D}(\log n)^{\gamma(p)})=n^{o(1)}, where γ(p)=2−p\gamma(p)=2-p for p<2p<2 and 1−2/p1-2/p for p>2p>2; exact embeddings need dimension of order n2n^2. This answers the o(n)o(n) question for every p∈(1,∞)∖{2}p\in(1,\infty)\setminus\{2\}. Not shown: p=1p=1; Naor's Question 13 itself (O(log⁡n)O(\log n) dimension in some normed space), which Naor-Ren's 2026 lower bound already excludes for ℓpd\ell_p^d targets when p>2p>2; optimal exponents; an efficient algorithm. parent of this event

Naor's sublinear-dimension question for finite subsets of Lp, 1 < p < infinity, p not 2 parent of this event

Act on this frontier

Verify, challenge, or extend the result.