Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pull compact radial restrictions back to original patches

Open
FalconerPath.starting_pair_radial_pullback

by dangnguyen · Nov 3, 2026 · Mathlib 0df444a (Lean v4.33.1)

compact-restrictionsfalconerradial-projections

Let d,h,k∈Nd,h,k\in\mathbb Nd,h,k∈N, let E⊂RdE\subset\mathbb R^dE⊂Rd, let r∈Rr\in\mathbb Rr∈R, and let AAA be a starting geometry for these parameters. Put ηi=Q#P#μi\eta_i=Q_\#P_\#\mu_iηi​=Q#​P#​μi​. Let p>1p>1p>1 and let Ki⊂supp⁡ηiK_i\subset\operatorname{supp}\eta_iKi​⊂suppηi​ be compact with ηi(Ki)>0\eta_i(K_i)>0ηi​(Ki​)>0. Suppose L>0L>0L>0 and the normalized restrictions ηi′=ηi∣Ki/ηi(Ki)\eta_i^\prime=\eta_i|_{K_i}/\eta_i(K_i)ηi′​=ηi​∣Ki​​/ηi​(Ki​) have, in both orientations, jointly measurable nonnegative radial surface densities whose pppth power integrals are at most LLL at every pin in the corresponding support.

There is a new starting geometry BBB for the same d,E,r,h,kd,E,r,h,kd,E,r,h,k with B.Ei⊂A.EiB.E_i\subset A.E_iB.Ei​⊂A.Ei​, the same maps P,QP,QP,Q, and the same gap χ\chiχ. For some L′>0L^\prime>0L′>0, its smallest projected laws have jointly measurable nonnegative radial densities in both orientations whose pppth power integrals are bounded by L′L^\primeL′ at every support pin.

A starting geometry consists of compact E1,E2⊂EE_1,E_2\subset EE1​,E2​⊂E equal to the supports of probabilities μ1,μ2\mu_1,\mu_2μ1​,μ2​ carried by them, common constants χ,C>0\chi,C>0χ,C>0 giving all-scale ball bounds Crd/2+χCr^{d/2+\chi}Crd/2+χ, positive cross separation, and one unit www for which all original cross directions lie in B(w,r)B(w,r)B(w,r). It includes continuous linear orthogonal surjections P:Rd→Rk+1P:\mathbb R^d\to\mathbb R^{k+1}P:Rd→Rk+1 and Q:Rk+1→Rh+1Q:\mathbb R^{k+1}\to\mathbb R^{h+1}Q:Rk+1→Rh+1, with h+1≤k+1≤dh+1\le k+1\le dh+1≤k+1≤d. The original, middle, and smallest support pairs are bounded and separated. The two middle laws P#μiP_\#\mu_iP#​μi​ and the two smallest laws Q#P#μiQ_\#P_\#\mu_iQ#​P#​μi​ share the same all-scale exponent d/2+χd/2+\chid/2+χ and constant CCC. The smallest supports are compact. If d=2k−1d=2k-1d=2k−1, P#μ1+P#μ2P_\#\mu_1+P_\#\mu_2P#​μ1​+P#​μ2​ vanishes on every affine kkk-plane. The Lean statement isolates the compact pullback step, allows the common Frostman constant to change, and preserves the gap and projection maps explicitly.

Preamble
import Definitions.Def_FalconerPath_defs
open Set MeasureTheory Filter
open scoped ENNReal NNReal Topology
Formal statement
namespace FalconerPath
theorem starting_pair_radial_pullback {d h k : ℕ} {E : Set (Space d)} {r : ℝ}
    (A : StartingGeometry d E r h k) (p : ℝ) (hp : 1 < p)
    (K₁ K₂ : Set (Space (h+1))) (hc₁ : IsCompact K₁) (hc₂ : IsCompact K₂)
    (hs₁ : K₁ ⊆ (Measure.map A.Q (Measure.map A.P A.μ₁)).support)
    (hs₂ : K₂ ⊆ (Measure.map A.Q (Measure.map A.P A.μ₂)).support)
    (hm₁ : 0 < (Measure.map A.Q (Measure.map A.P A.μ₁)) K₁)
    (hm₂ : 0 < (Measure.map A.Q (Measure.map A.P A.μ₂)) K₂)
    (L : ℝ) (hL : 0 < L)
    (hlp : UniformRadialLp
      (normalizedRestriction (Measure.map A.Q (Measure.map A.P A.μ₁)) K₁)
      (normalizedRestriction (Measure.map A.Q (Measure.map A.P A.μ₂)) K₂) p L) :
    ∃ B : StartingGeometry d E r h k,
      B.E₁ ⊆ A.E₁ ∧ B.E₂ ⊆ A.E₂ ∧ B.P = A.P ∧ B.Q = A.Q ∧ B.χ = A.χ ∧
      ∃ L' : ℝ, 0 < L' ∧ UniformRadialLp
        (Measure.map B.Q (Measure.map B.P B.μ₁))
        (Measure.map B.Q (Measure.map B.P B.μ₂)) p L' := by sorry
end FalconerPath
Source
OpenAI, The Falconer distance conjecture in all dimensions, OpenAI Math Release preprint, September 23, 2026, https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/The-Falconer-distance-conjecture-in-all-dimensions-September-23-2026/paper.pdf. Section 5.4, Proposition 5.10 (Starting pair measures), label prep:starting-pairs, third proof paragraph at “pull its positive compact restrictions back to the original measures”, “Inner regularity permits positive compact preimages”, and “further restriction preserves all established bounds”.

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me