Functional analysis·OpenAI Math·Result 327·Lean formalisation listed
Markov type characterizes superreflexivity
One of the 372 results in OpenAI's public mathematics catalogue, filed under functional analysis: 1 preprint, the latest dated 23 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 result titled ‘Markov type characterizes superreflexivity’ (functional analysis) in a preprint dated 23 September 2026. It has not been peer reviewed. The channel's animation, Every OpenAI Math Result, Part 4 of 4: L = BPL, Integer Multiplication and 82 More, is on YouTube.
Chapter 72 of 84 in Every OpenAI Math Result, Part 4 of 4: L = BPL, Integer Multiplication and 82 More · starts at 24:42 · watch from there on YouTube →
What OpenAI claims
Proves that every real Banach space with Markov type p for some p > 1 admits an equivalent uniformly convex norm, answering Naor's renorming question. Together with the known converse, this characterizes superreflexivity by nontrivial Markov type. (Lean)
Paper
Nontrivial Markov Type Forces Superreflexivity
OpenAI's abstract We prove that every real Banach space with Markov type p > 1 is superreflexive. Together with the known converse, this characterizes superreflexivity by nontrivial Markov type. This answers Naor's question: every real Banach space with nontrivial Markov type admits an equivalent uniformly smooth norm.
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 23 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?
- Proves that every real Banach space with Markov type p for some p > 1 admits an equivalent uniformly convex norm, answering Naor's renorming question. Together with the known converse, this characterizes superreflexivity by nontrivial Markov type. (Lean)
- Where is the proof?
- In the paper, Nontrivial Markov Type Forces Superreflexivity (PDF).
- Is there a video?
- Yes, on YouTube (29:10, chapter 72).
Also in
- Chapter 8 of 10 in Tingley's Problem, Separable Quotient Problem and 8 More in Functional Analysis · starts at 2:26 · watch from there on YouTube →
The video
Every OpenAI Math Result, Part 4 of 4: L = BPL, Integer Multiplication and 82 More · Compilation · 29:10 · chapter 72 from 24:42 · description, sources and chapters →
Related results in Functional analysis
- 328Nonexpansive fixed points in reflexive Banach spacesVideoLean
- 329A counterexample to metric-entropy dualityVideoLean
- 330A uniformly discrete counterexample to bounded approximation in Lipschitz-free spacesVideoLean
- 331Reflexive midpoint convexity and diamond distortionVideoLean
- 332Metric Markov cotype of ℓ1 and Hilbert-space Lipschitz extensionVideo
- 322Tingley’s sphere-isometry problemVideoLean
