Optimal Embeddings of Constant-Dimensional Subspaces of $L^p$ into $\ell_p^N$
Abstract
For $d \geq 2$, $p \geq 1$ and $ε> 0$, let $N_p(d,ε)$ be the smallest integer $N$ such that every $d$-dimensional subspace of $L^p[0,1]$ admits a linear embedding into $\ell_p^N$ with distortion at most $1 + ε$. For fixed $d\geq 2$ and $p\geq 1$, the bound \[ N_p(d,ε) \lesssim_{d,p} ε^{-2(d-1)/(d+2p)} \] is established. For $p \notin 2\mathbb{Z}$, this matches the known lower bound up to constant factors. For odd integers $p$, previous upper bounds with this exponent incurred additional logarithmic factors, except in the logarithm-free case $p = 1$; for non-integral $p$, no upper bound with this exponent was previously known. For even integers $p$, isometric embeddings of dimension independent of $ε$ are known. For $p \notin 2\mathbb{Z}$, the proof approximates $|t|^p$ by a polynomial with a remainder of small total variation. The polynomial part contributes no error, while the error from the remainder is controlled by an integrated equatorial-band discrepancy estimate.
Disclosure
“n AcRF Tier 1 grant RG21/25. The author used ChatGPT 5.5 Plus during the development of this work to explore and refine proof strategies, formulate intermediate results, and generate initial drafts of parts of the technical proofs. All AI-generated material was substantially revised, corrected, and integrated by the author. All mathematical claims, proofs, and references were independently checked by the author. 22”
PDF page 22
- Classification
- Substantial mathematical content or result generation
- Multiplier
- 10
- Verified
Structural counts
Count notes
- Source counts use the expanded primary TeX file main.tex.
- Appendix pages include the first PDF page with an explicit Appendix heading through the final page.