Real and complex analysis·OpenAI Math·Result 081·Lean formalisation listed
Riesz transforms and rectifiability in higher codimension
One of the 372 results in OpenAI's public mathematics catalogue, filed under real and complex analysis: 1 preprint, the latest dated 24 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 ‘Riesz transforms and rectifiability in higher codimension’ (real and complex analysis) in a preprint dated 24 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 84 of 84 in Every OpenAI Math Result, Part 3 of 4: Operator Paving, Naimark's Problem and 82 More · starts at 28:58 · watch from there on YouTube →
What OpenAI claims
Resolves the remaining higher-codimension Riesz-transform rectifiability problem: for d ≥ 4 and 2 ≤ n ≤ d-2, an n-Ahlfors–David regular Radon measure on ℝd is uniformly n-rectifiable whenever its n-dimensional Riesz transform is uniformly L2-bounded over all positive hard truncations. The rectifiability bounds depend only on dimension, regularity and operator bounds. (Lean)
Paper
Riesz transforms and uniform rectifiability in higher codimension
OpenAI's abstract We prove that an n-Ahlfors–David regular Radon measure on ℝd is uniformly n-rectifiable if its n-dimensional Riesz transform is uniformly bounded from scalar L2(μ) to vector-valued L2(μ) over all positive hard truncations, for integers d ≥ 4 and 2 ≤ n ≤ d-2. This gives a positive answer to the David–Semmes Riesz-transform question in its remaining higher-codimension range. The conclusion gives uniform big pieces of Lipschitz images of Euclidean balls.
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 24 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?
- Resolves the remaining higher-codimension Riesz-transform rectifiability problem: for d ≥ 4 and 2 ≤ n ≤ d-2, an n-Ahlfors–David regular Radon measure on ℝd is uniformly n-rectifiable whenever its n-dimensional Riesz transform is uniformly L2-bounded over all positive hard truncations. The rectifiability bounds depend only on dimension, regularity and operator bounds. (Lean)
- Where is the proof?
- In the paper, Riesz transforms and uniform rectifiability in higher codimension (PDF).
- Is there a video?
- Yes, on YouTube (29:20, chapter 84).
Also in
- Chapter 9 of 10 in Falconer Distance Conjecture, Bochner–Riesz Conjecture and 8 More · starts at 2:48 · 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 84 from 28:58 · description, sources and chapters →
Related results in Real and complex analysis
- 082Annular variation and dyadic absolute bounds for the triangular Hilbert transformVideoLean
- 083Hilbert transforms along Lipschitz directionsVideoLean
- 084The geometric case of the Erdős similarity conjectureVideoLean
- 085Endpoint Sobolev regularity of centered disk averagesVideoLean
- 086An L3 bound for the trilinear Hilbert transformVideo
- 071Koebe’s circle-domain conjectureLean