Functional analysis·OpenAI Math·Result 330·Lean formalisation listed
A uniformly discrete counterexample to bounded approximation in Lipschitz-free spaces
One of the 372 results in OpenAI's public mathematics catalogue, filed under functional analysis: 1 preprint, the latest dated 26 September 2026. This page quotes OpenAI's own summary of the claim, links the paper and abstract, and embeds the animation.
In one line: OpenAI reports a proof of a uniformly discrete counterexample to bounded approximation in Lipschitz-free spaces (functional analysis) in a preprint dated 26 September 2026. It has not been peer reviewed. The channel's animation, Every OpenAI Math Result, Part 3 of 4: Operator Paving, Naimark's Problem and 82 More, is on YouTube.
Chapter 29 of 84 in Every OpenAI Math Result, Part 3 of 4: Operator Paving, Naimark's Problem and 82 More · starts at 9:48 · watch from there on YouTube →
What OpenAI claims
Constructs a countable uniformly discrete metric space whose real Lipschitz-free Banach space has the approximation property but not the bounded approximation property, answering Kalton's question negatively. Finite-rank operators approximate the identity on every compact set, but their norms cannot share a finite bound. (Lean)
Paper
A uniformly discrete counterexample to bounded approximation in Lipschitz-free spaces
OpenAI's abstract We construct a countable uniformly discrete metric space whose real Lipschitz-free space has the approximation property but fails the bounded approximation property, answering Kalton's question negatively. The identity can be approximated on every compact set by finite-rank operators, but no uniform bound on their norms is possible.
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.
Quick answers
- Is it proven?
- Not independently yet. OpenAI posted a preprint on 26 September 2026; it has not been peer reviewed, so treat the result as OpenAI's claim until other mathematicians have checked it.
- What exactly does OpenAI claim?
- Constructs a countable uniformly discrete metric space whose real Lipschitz-free Banach space has the approximation property but not the bounded approximation property, answering Kalton's question negatively. Finite-rank operators approximate the identity on every compact set, but their norms cannot share a finite bound. (Lean)
- Where is the proof?
- In the paper, A uniformly discrete counterexample to bounded approximation in Lipschitz-free spaces (PDF).
- Is there a video?
- Yes, on YouTube (29:20, chapter 29).
Also in
- Chapter 5 of 10 in Tingley's Problem, Separable Quotient Problem and 8 More in Functional Analysis · starts at 1:24 · watch from there on YouTube →
The video
Every OpenAI Math Result, Part 3 of 4: Operator Paving, Naimark's Problem and 82 More · Compilation · 29:20 · chapter 29 from 9:48 · description, sources and chapters →
Related results in Functional analysis
- 331Reflexive midpoint convexity and diamond distortionVideoLean
- 332Metric Markov cotype of ℓ1 and Hilbert-space Lipschitz extensionVideo
- 322Tingley’s sphere-isometry problemVideoLean
- 323Independence of the separable quotient problemVideoLean
- 324Lipschitz equivalent Banach spaces need not be linearly isomorphicVideoLean
- 325The complete Crouzeix conjectureLean