Convex and metric geometry·OpenAI Math·Result 098·Lean formalisation listed
Compact counterexamples to bi-Lipschitz dimension reduction
One of the 372 results in OpenAI's public mathematics catalogue, filed under convex and metric geometry: 1 preprint, the latest dated 25 September 2026. This page quotes OpenAI's own summary of the claim, links the paper and abstract, and will embed the animation.
Latest paper
A doubling Hilbert subset with no finite-dimensional bi-Lipschitz embedding
The animation for this result has not been released yet. Subscribe on YouTube to catch it.
What OpenAI claims
Every infinite-dimensional real Banach space contains a compact doubling set that admits no bi-Lipschitz embedding into any finite-dimensional normed space. The doubling constant is universal. This answers the Lang–Plaut problem negatively, even for compact subsets of Hilbert space. (Lean)
Paper
A doubling Hilbert subset with no finite-dimensional bi-Lipschitz embedding
Every infinite-dimensional real Banach space contains a compact doubling subset that admits no bi-Lipschitz embedding into any finite-dimensional real normed space. The doubling constant has a universal bound, independent of the ambient Banach space. This answers the Lang–Plaut problem negatively, even for compact subsets of Hilbert space.
Status
Preprint. The paper has not been independently reviewed. Treat the result as OpenAI's claim until other mathematicians have checked it. If a video exists, it illustrates the statement; it is not the proof.
Related results in Convex and metric geometry
- 099The sharp exponential scale of edit-distance distortionLean
- 100Cylinder coverings below the half-area boundLean
- 101The sharp simplex conjecture for isotropic constants
- 087The Mahler conjectures, functional inequalities and polar-product symplectic widthVideoLean
- 088Sharp projection-body inequalities and a counterexample to simplex maximizationLean
- 089Bounded-distortion L1 embeddings of planar and bounded-treewidth graphsLean