OpenAI claim summary for Math-2270
mathematicsTop Open Problemscontributionliterature_reportClaim: literature report
Summary of a claim published in openai/math; not a claim by this platform.
The displayed question has a negative answer under the manuscript's stated construction. Its counterexample meets the conditions in this problem and defeats the universal assertion, so this is a full disproof claim. The supporting result is manuscript 1 (family 098; 2026-09-25).
Limitations: The linked openai/math material has not been examined or verified by the platform.
Manuscript
Contents
Finite-dimensional embeddings of doubling Hilbert subsets
OpenAI's claim
OpenAI presents the following claims relevant to this question, with manuscript numbers following paper order in Sources. In manuscript 1 (family 098; 2026-09-25), the asserted result is that in each infinite-dimensional real Banach space one can choose a compact subset with a universal doubling constant for which every bi-Lipschitz map into a finite-dimensional normed target is impossible.Mathematical statement of the claimed result
Manuscript 1.
A single subset $S$ of real $\ell_2$, with the distance inherited from its Hilbert norm, is claimed to satisfy \[ \operatorname{dbl}(S)\le76800,\qquad \forall k\ge1\ \forall D<\infty:\ S\text{ has no bi-Lipschitz embedding into }\mathbb R^k\text{ of distortion }D. \] Here doubling means that every metric ball is covered by at most that many balls of half its radius. The obstruction concerns one fixed doubling space, not a sequence with increasing doubling constants.Outline of the argument
For manuscript 1 (family 098; 2026-09-25), sheet-like pieces are arranged so that coverings remain uniformly doubling. Near-extremal derivatives of a hypothetical finite-dimensional embedding have small quadratic variation; crossings between separated sheets then force more packed images than the target can accommodate.Formal verification
For manuscript 1 (family 098; 2026-09-25), OpenAI lists Lean statements for this assertion: in each infinite-dimensional real Banach space one can choose a compact subset with a universal doubling constant for which every bi-Lipschitz map into a finite-dimensional normed target is impossible.The selected statement includes the clause used for this problem.
The linked family Comparator checks are CompactBanach.lean, DoublingHilbert.lean.
Their named declarations include OAI.CompactBanach.main, OAI.DoublingHilbert.main.
This site has not executed the Lean code. Described statement coverage is not an independent proof check.
Status caveat
The manuscripts were produced by an internal OpenAI model. OpenAI cautions that results without formalization can contain mistakes. This site has not independently checked the proofs; the label records the scope of OpenAI's claim.Sources
- OpenAI, A doubling Hilbert subset with no finite-dimensional bi-Lipschitz embedding, 2026-09-25; citation key
OAI:A-doubling-Hilbert-subset-with-no-finite-dimensional-bi-Lipschitz-embedding-September-25-2026. PDF (GitHub); PDF (direct); Manuscript page and citation; Latest version; Statement source: thm:main. - Family 098: Lean scope.
- Comparator CompactBanach.json.
- Comparator CompactBanach.lean.
- Comparator DoublingHilbert.json.
- Comparator DoublingHilbert.lean.
- OpenAI catalogue entry.