Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Failure of uniform gain yields obstructing regular classes

Open
FalconerPath.one_scale_regular_class_obstruction

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

compactnessfalconerregularization

Fix 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 ζ,L,a,K,C>0\zeta,L,a,K,C>0ζ,L,a,K,C>0. Suppose the uniform forward-gain assertion fails. That assertion would give fixed ε,c,D>0\varepsilon,c,D>0ε,c,D>0 and N0N_0N0​ working for every N≥N0N\ge N_0N≥N0​, every pair of probabilities in Rk+1\mathbb R^{k+1}Rk+1 with support radius LLL, separation aaa, and all-scale sss-ball constant KKK, and every Borel relation with cap bounds 2εNuq2^{\varepsilon N}u^q2εNuq and plate bounds CuζCu^\zetaCuζ in both orientations for 2−N≤u≤12^{-N}\le u\le12−N≤u≤1. Its desired conclusion is a Borel subrelation deleting at most D2−cND2^{-cN}D2−cN product mass and bounding all radius-2−N2^{-N}2−N forward caps by 2−N(q+c)2^{-N(q+c)}2−N(q+c) at almost every pin.

Then there are positive constants L′,a′,C′L^\prime,a^\prime,C^\primeL′,a′,C′ and a sequence of normalized regular-class data with these fixed geometry and plate constants, such that Nj→∞N_j\to\inftyNj​→∞ and hj→0h_j\to0hj​→0. For every c,D>0c,D>0c,D>0, for all sufficiently large jjj there is no Borel H⊂GjH\subset G_jH⊂Gj​ for which

(νj⊗ρj)(Gj∖H)≤DRj−c(\nu_j\otimes\rho_j)(G_j\setminus H)\le DR_j^{-c}(νj​⊗ρj​)(Gj​∖H)≤DRj−c​

and every radius-Rj−1R_j^{-1}Rj−1​ forward cap of (πx)#(ρj∣Hx)(\pi_x)_\#(\rho_j|_{H_x})(πx​)#​(ρj​∣Hx​​) has mass at most Rj−q−cR_j^{-q-c}Rj−q−c​ for νj\nu_jνj​-almost every xxx.

Here a normalized regular-class datum consists of an integer NjN_jNj​, probabilities νj,ρj\nu_j,\rho_jνj​,ρj​ on Rk+1\mathbb R^{k+1}Rk+1 with supports in B‾(0,L′)\overline B(0,L^\prime)B(0,L′) and cross distances at least a′a^\primea′, a translated half-open unit root carrying ρj\rho_jρj​, a nonnegative error hjh_jhj​, and a profile mjm_jmj​ with mj(0)=0m_j(0)=0mj​(0)=0, nondecreasing and (k+1)(k+1)(k+1)-Lipschitz on [0,1][0,1][0,1], satisfying mj(u)≥su−hjm_j(u)\ge su-h_jmj​(u)≥su−hj​. In its translated dyadic grid, every occupied depth-bbb cell has ρj\rho_jρj​-mass between Rj−mj(b/Nj)−hjR_j^{-m_j(b/N_j)-h_j}Rj−mj​(b/Nj​)−hj​​ and Rj−mj(b/Nj)+hjR_j^{-m_j(b/N_j)+h_j}Rj−mj​(b/Nj​)+hj​​, for b≤Njb\le N_jb≤Nj​, where Rj=2NjR_j=2^{N_j}Rj​=2Nj​. For occupied nested cells P⊂QP\subset QP⊂Q at depths c≥bc\ge bc≥b, c≤Njc\le N_jc≤Nj​, the ratio ρj(P)/ρj(Q)\rho_j(P)/\rho_j(Q)ρj​(P)/ρj​(Q) lies between Rj−[mj(c/Nj)−mj(b/Nj)]−hjR_j^{-[m_j(c/N_j)-m_j(b/N_j)]-h_j}Rj−[mj​(c/Nj​)−mj​(b/Nj​)]−hj​​ and Rj−[mj(c/Nj)−mj(b/Nj)]+hjR_j^{-[m_j(c/N_j)-m_j(b/N_j)]+h_j}Rj−[mj​(c/Nj​)−mj​(b/Nj​)]+hj​​. The datum includes a Borel Gj⊂supp⁡νj×supp⁡ρjG_j\subset\operatorname{supp}\nu_j\times\operatorname{supp}\rho_jGj​⊂suppνj​×suppρj​ such that, for ρj\rho_jρj​-almost every zzz, the unnormalized reverse law (πz)#(νj∣Gjz)(\pi_z)_\#(\nu_j|_{G_j^z})(πz​)#​(νj​∣Gjz​​) obeys cap bounds RjhjuqR_j^{h_j}u^qRjhj​​uq and directional plate bounds C′uζC^\prime u^\zetaC′uζ for Rj−1≤u≤1R_j^{-1}\le u\le1Rj−1​≤u≤1. The geometry constants L′,a′L^\prime,a^\primeL′,a′ are positive. The Lean statement isolates a sequential obstruction from the proof rather than asserting a new numbered paper result.

Preamble
import Definitions.Def_FalconerPath_defs
open Set MeasureTheory Filter
open scoped ENNReal NNReal Topology
Formal statement
namespace FalconerPath
theorem one_scale_regular_class_obstruction {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)
    (hfail : ¬ ForwardGain k s q ζ L a K C) :
    ∃ L' a' C' : ℝ, 0 < L' ∧ 0 < a' ∧ 0 < C' ∧
      ∃ X : ℕ → RadialClassData k s q ζ L' a' C',
        Tendsto (fun j => (X j).N) atTop atTop ∧
        Tendsto (fun j => (X j).err) atTop (𝓝 0) ∧
        ∀ c D : ℝ, 0 < c → 0 < D → ∀ᶠ j in atTop,
          ¬ ∃ H : PairSet (k+1), MeasurableSet H ∧ H ⊆ (X j).G ∧
            ((X j).ν.prod (X j).ρ) ((X j).G \ H) ≤
              ENNReal.ofReal (D*(scale (X j).N)^(-c)) ∧
            ∀ᵐ x ∂(X j).ν, ∀ w ∈ unitSphere (k+1),
              forwardDirection (X j).ρ H x (Metric.ball w (mesh (X j).N)) ≤
                ENNReal.ofReal ((scale (X j).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, proof paragraph beginning “We prove this assertion by contradiction”, together with the final paragraph beginning “Choose the regularization parameter” and its recombination with original source weights.

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