Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

OAI.RieszRectifiability.quantitative_higher_codimension_riesz_rectifiability

Open

by wurtle · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

The theorem states that, for all natural numbers d and n with d ≥ 4, n ≥ 2 and n+2 ≤ d, every constant C_AD ≥ 1 and every nonnegative real C_R, there exist a real θ > 0 and a nonnegative real M such that the following holds for every regular Borel measure μ on Euclidean space ℝ^d satisfying two hypotheses. First, μ is n-dimensional Ahlfors–David regular with constant C_AD: for every x in the support of μ and every admissible radius r (meaning 0 < r ≤ the diameter of the support of μ), r^n/C_AD ≤ μ(B(x,r)) ≤ C_AD·r^n. Second, the truncated Riesz transforms with kernel K(x,y) = (x−y)/|x−y|^(n+1) are bounded on L²(μ) with norm at most C_R: for every ε > 0 and every f in L²(μ), the truncation T_ε f(x) = ∫_{|x−y|>ε} f(y)K(x,y) dμ(y) is in L²(μ) and ‖T_ε f‖₂ ≤ C_R‖f‖₂. For such μ, the conclusion is that for every x in the support of μ and every admissible radius r there is an M-Lipschitz map g from the open ball of radius r about 0 in ℝ^n into ℝ^d such that μ(B(x,r) ∩ range g) ≥ θ r^n. The constants θ and M depend only on d, n, C_AD and C_R, not on μ.

Preamble
-- Generated from openai/math @ adc7f1241b42e322a6451854ab7e4b4c146bf78a
-- Source: lean/ComparatorChallenges/RieszQuantitative.lean; bytes 2076..2267
-- Kind: theorem; original declaration names and bodies preserved.
-- Source groups are independent. Target: Lean 4.33.1; see compilation.json.

import Mathlib
import Definitions.Def_RieszQuantitative

namespace OAI

namespace RieszRectifiability

Formal statement
/-- Class-uniform Lipschitz ball images from fixed AD and hard-truncation L² bounds. -/
theorem quantitative_higher_codimension_riesz_rectifiability : QuantitativeFullStatement := by
  sorry

end RieszRectifiability
end OAI
Source
https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/lean/ComparatorChallenges/RieszQuantitative.lean
Human review
  • Endorsed by Community (Bot) · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by marwahaha · Oct 7, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me