Source authenticated

The David-Semmes problem in higher codimension: bounded Riesz transforms force uniform rectifiability for 1 < n < d-1

Theorem 1.3: for integers d≥4d\ge4 and 2≤n≤d−22\le n\le d-2, an nn-AD-regular Radon measure on Rd\mathbb R^d whose hard-truncated Riesz transforms are uniformly bounded L2(μ)→L2(μ;Rd)L^2(\mu)\to L^2(\mu;\mathbb R^d) is uniformly nn-rectifiable, with constants depending only on d,n,CAD,CRd,n,C_{AD},C_R; the conclusion is given as uniform big pieces of Lipschitz images of balls. With the known cases n=1n=1 and n=d−1n=d-1 this answers the David-Semmes question in every dimension and codimension. The converse direction and non-integer dimensions are not addressed here.

Exact FrontierDelta

Prior state unknown→proved

Scope and record

Occurred: Sep 24, 2026

Delta type: SOURCE CLAIM

Assumptions: VibeMathed verification: lean-checked. Publication: announcement. AI contribution: ai-discovered. VibeMathed editorial classifications, scores, notes, relations, and dataset structure are CC BY 4.0. Source statements and linked content retain their own rights.

Canonical aliases: The David-Semmes problem in higher codimension: bounded Riesz transforms force uniform rectifiability for 1 < n < d-1 · David-Semmes problem, higher codimension

Confidence: Not scored

Registry verification: lean checked · announcement · candidate

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

Unreleased internal OpenAI model
model · ai model contributor · OpenAI

Artifacts and verifiers

Lean proof (OAI.RieszRectifiability.quantitative_higher_codimension_riesz_rectifiability)

lean artifact · pending

Artifact ↗
Comparator statement: RieszQuantitative.lean

lean artifact · pending

Artifact ↗

Compute record

No linked compute attempts recorded.

Lineage and corrections

Theorem 1.3: for integers d≥4d\ge4 and 2≤n≤d−22\le n\le d-2, an nn-AD-regular Radon measure on Rd\mathbb R^d whose hard-truncated Riesz transforms are uniformly bounded L2(μ)→L2(μ;Rd)L^2(\mu)\to L^2(\mu;\mathbb R^d) is uniformly nn-rectifiable, with constants depending only on d,n,CAD,CRd,n,C_{AD},C_R; the conclusion is given as uniform big pieces of Lipschitz images of balls. With the known cases n=1n=1 and n=d−1n=d-1 this answers the David-Semmes question in every dimension and codimension. The converse direction and non-integer dimensions are not addressed here. parent of this event

This event attributed to Unreleased internal OpenAI model

The David-Semmes problem in higher codimension: bounded Riesz transforms force uniform rectifiability for 1 < n < d-1 parent of this event

Comparator statement: RieszQuantitative.lean evidence for this event

The David-Semmes problem in higher codimension: bounded Riesz transforms force uniform rectifiability for 1 < n < d-1 evidence for this event

VibeMathed record: The David-Semmes problem in higher codimension: bounded Riesz transforms force uniform rectifiability for 1 < n < d-1 evidence for this event

Lean proof (OAI.RieszRectifiability.quantitative_higher_codimension_riesz_rectifiability) evidence for this event

Act on this frontier

Verify, challenge, or extend the result.