Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Uniform one-scale improvement of directional cap exponents

Open
FalconerPath.one_scale_improvement

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

capsfalconerradial-projections

Fix an integer k≥2k\ge2k≥2, k−12<s<kk-\tfrac12<s<kk−21​<s<k, k−1≤q<k−12k-1\le q<k-\tfrac12k−1≤q<k−21​, and positive constants ζ,L,a,K,C\zeta,L,a,K,Cζ,L,a,K,C. There are ε0,c,D>0\varepsilon_0,c,D>0ε0​,c,D>0 and N0N_0N0​ such that the following holds for every N≥N0N\ge N_0N≥N0​, uniformly over the measures and relation. Put δ=2−N\delta=2^{-N}δ=2−N. Let ν,ρ\nu,\rhoν,ρ be probabilities on Rk+1\mathbb R^{k+1}Rk+1 whose supports lie in B‾(0,L)\overline B(0,L)B(0,L) and whose cross-support distances are at least aaa. Assume both have all-scale ball bounds KrsKr^sKrs for 0<r≤10<r\le10<r≤1. Let GGG be a Borel pair relation. Suppose its unnormalized forward and reverse directional laws satisfy cap bounds δ−ε0uq\delta^{-\varepsilon_0}u^qδ−ε0​uq and linear-hyperplane plate bounds CuζCu^\zetaCuζ for every δ≤u≤1\delta\le u\le1δ≤u≤1, at almost every corresponding pin.

There is a Borel B⊂GB\subset GB⊂G with (ν⊗ρ)(B)≤Dδc(\nu\otimes\rho)(B)\le D\delta^c(ν⊗ρ)(B)≤Dδc such that both directional laws of G∖BG\setminus BG∖B give every cap of radius δ\deltaδ mass at most δq+c\delta^{q+c}δq+c, at almost every corresponding pin. Lean displays the dyadic scale, the uniform threshold, and a deletion constant DDD distinct from the fixed plate constant CCC, using the paper's null-fiber convention.

Preamble
import Definitions.Def_FalconerPath_defs
open Set MeasureTheory Filter
open scoped ENNReal NNReal Topology
Formal statement
namespace FalconerPath
theorem one_scale_improvement {k : ℕ} (hk : 2 ≤ k) (s q ζ L a K C : ℝ)
    (hs : (k:ℝ)-1/2 < s) (hsk : s < k)
    (hq : (k:ℝ)-1 ≤ q) (hqS : q < (k:ℝ)-1/2)
    (hζ : 0 < ζ) (hL : 0 < L) (ha : 0 < a) (hK : 0 < K) (hC : 0 < C) :
    ∃ ε₀ c D : ℝ, 0 < ε₀ ∧ 0 < c ∧ 0 < D ∧ ∃ N₀ : ℕ,
      ∀ N ≥ N₀, ∀ ν ρ : Measure (Space (k+1)),
        Probability ν → Probability ρ → BoundedSeparated ν ρ L a →
        Frostman ν s K → Frostman ρ s K →
        ∀ G : PairSet (k+1), MeasurableSet G →
          bothCaps ν ρ G q ((mesh N)^(-ε₀)) (mesh N) →
          bothPlates ν ρ G ζ C (mesh N) →
          ∃ B : PairSet (k+1), MeasurableSet B ∧ B ⊆ G ∧
            (ν.prod ρ) B ≤ ENNReal.ofReal (D*(mesh N)^c) ∧
            bothAtRadius ν ρ (G \ B) (mesh N) ((mesh N)^(q+c)) := 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.1, Lemma 5.3 (One-scale improvement), label prep:one-scale.

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