A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
Subpolynomial dimension reduction in $L_p$
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Egyptian Fractions <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, go here for help. (Lean version available!)
expertly designed by an internal OpenAI model

Difficulty:🧠🧠🧠🧠🧠 Ages:13 - ∞
Skills:shapes, measuring stuff Levels:1
Category:Convex and metric geometry Lean version:YES! ✔
Rate this game! 4.9 out of 5 (8,898 votes)

>>> How to Play <<<
Subpolynomial dimension reduction in Lp. For every fixed $1\lt p\lt \infty$ and distortion D > 1, every n-point subset of real Lp embeds into $\ell_p^d$ with distortion at most D and dimension $d=n^{o(1)}$, answering Naor's sublinear-dimension question for p ≠ 2. In contrast, exact embeddings require worst-case dimension $\Theta(n^2)$ when p ≠ 2.

>>> Level Select <<<
released 2026-09-23  |  1 theorem · 6 lemmas · 6 proofs · 6,190 words  |  PLAY LEVEL 1 »  (pdf)
For every fixed $1\lt p\lt \infty$ and D > 1, every n-point subset of a real Lp space embeds into $\ell_p^d$ with distortion at most D and subpolynomial dimension $d=n^{o(1)}$. The target has the same exponent p, and the embedding need not be linear.

More Convex and metric geometry Games!
The optimal order of convex-body covering densityDimension-free logarithmic Sobolev inequality for subgaussian log-concave measuresHyperbolicity cones without semidefinite liftsThe Gaussian propeller conjecture
The Euclidean Steinitz–Bergström conjectureA negative answer to the Lang–Plaut problemThe sharp distortion of edit distance into $\ell_1$A counterexample to Bang's cylinder-covering bound

Cool Links: openai/math   Lean   Mathlib   arXiv   the real Coolmath Games