Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Density pruning multiplies local fiber estimates

Open
FalconerPath.density_pruning_multiplication

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

falconerfiber-estimatespruning

Fix an integer n≥1n\ge1n≥1, either the radial test or the full-line test, and constants L,a,C1>0L,a,C_1>0L,a,C1​>0. There is C0>0C_0>0C0​>0 such that the following holds for every C≥C0C\ge C_0C≥C0​. Let ρ\rhoρ be a source probability and ν\nuν a finite positive pin measure on Rn\mathbb R^nRn, both with supports in B‾(0,L)\overline B(0,L)B(0,L). For the radial test require ∣x−z∣≥a|x-z|\ge a∣x−z∣≥a for every cross-support pair. Let N,J∈NN,J\in\mathbb NN,J∈N and let a0<⋯<aJ≤Na_0<\cdots<a_J\le Na0​<⋯<aJ​≤N be integer depths in one translated dyadic grid. Let GGG be a Borel subset of the support product containing no diagonal pair. For each j<Jj<Jj<J, let EjE_jEj​ be Borel with G⊂EjG\subset E_jG⊂Ej​, and let fj≥0f_j\ge0fj​≥0.

Assume that for every (x,z)∈G(x,z)\in G(x,z)∈G and every depth-aja_jaj​ cell QQQ containing zzz,

ρ{z′∈Q:(x,z′)∈Ej, Tj(x,z,z′)}≤fjρ(Q).\rho\{z^\prime\in Q:(x,z^\prime)\in E_j,\ T_j(x,z,z^\prime)\}\le f_j\rho(Q).ρ{z′∈Q:(x,z′)∈Ej​, Tj​(x,z,z′)}≤fj​ρ(Q).

For the radial test, TjT_jTj​ is ∣πx(z′)−πx(z)∣≤C2−aj+1|\pi_x(z^\prime)-\pi_x(z)|\le C2^{-a_{j+1}}∣πx​(z′)−πx​(z)∣≤C2−aj+1​. For the full-line test it is dist⁡(z′,x+R(z−x))≤C2−aj+1\operatorname{dist}(z^\prime,x+\mathbb R(z-x))\le C2^{-a_{j+1}}dist(z′,x+R(z−x))≤C2−aj+1​.

For every e>0e>0e>0 there is a Borel G′⊂GG^\prime\subset GG′⊂G deleting at most (J+1)2−eNν(Rn)(J+1)2^{-eN}\nu(\mathbb R^n)(J+1)2−eNν(Rn) product mass such that for every pin x∈Rnx\in\mathbb R^nx∈Rn, every initial depth-a0a_0a0​ cell Q0Q_0Q0​, and every unit www,

ρ{z∈Q0:(x,z)∈G′, πx(z)∈B(w,C12−aJ)}≤2eNJ(∏j=0J−1fj)ρ(Q0).\rho\{z\in Q_0:(x,z)\in G^\prime,\ \pi_x(z)\in B(w,C_12^{-a_J})\}\le2^{eNJ}\left(\prod_{j=0}^{J-1}f_j\right)\rho(Q_0).ρ{z∈Q0​:(x,z)∈G′, πx​(z)∈B(w,C1​2−aJ​)}≤2eNJ(j=0∏J−1​fj​)ρ(Q0​).

The Lean statement combines the two versions with a Boolean choice and makes fixed geometry and width thresholds explicit.

Preamble
import Definitions.Def_FalconerPath_defs
open Set MeasureTheory Filter
open scoped ENNReal NNReal Topology
Formal statement
namespace FalconerPath
theorem density_pruning_multiplication {n : ℕ} (hn : 1 ≤ n)
    (lineTest : Bool) (L a C₁ : ℝ) (hL : 0 < L) (ha : 0 < a) (hC₁ : 0 < C₁) :
    ∃ C₀ : ℝ, 0 < C₀ ∧ ∀ C ≥ C₀,
      ∀ (ρ ν : Measure (Space n)), Probability ρ → FiniteBorel ν →
        ρ.support ⊆ Metric.closedBall 0 L → ν.support ⊆ Metric.closedBall 0 L →
        (lineTest = false → ∀ x ∈ ν.support, ∀ z ∈ ρ.support, a ≤ dist x z) →
        ∀ (N J : ℕ) (depth : ℕ → ℕ),
          (∀ j < J, depth j < depth (j+1)) → depth J ≤ N →
          ∀ (v : Space n) (G : PairSet n) (E : ℕ → PairSet n) (f : ℕ → ℝ),
            MeasurableSet G → G ⊆ ν.support ×ˢ ρ.support →
            (∀ z ∈ G, z.1 ≠ z.2) →
            (∀ j < J, MeasurableSet (E j) ∧ G ⊆ E j ∧ 0 ≤ f j) →
            LocalFiberBounds lineTest ρ G E v depth J f C →
            ∀ e : ℝ, 0 < e → ∃ G' : PairSet n,
              MeasurableSet G' ∧ G' ⊆ G ∧
              (ν.prod ρ) (G \ G') ≤
                ENNReal.ofReal (((J:ℝ)+1)*(scale N)^(-e)) * ν univ ∧
              ∀ (x : Space n) (i : Fin n → ℤ) (w : Space n), w ∈ unitSphere n →
                ρ {z | z ∈ dyadicCell v (depth 0) i ∧ (x,z) ∈ G' ∧
                  radial x z ∈ Metric.ball w (C₁*mesh (depth J))} ≤
                ENNReal.ofReal ((scale N)^(e*J) * ∏ j ∈ Finset.range J, f j) *
                  ρ (dyadicCell v (depth 0) i) := 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 3, Lemma 3.2 (Density pruning and multiplication), label reg:pruning-multiplication, equations labeled reg:local-fibre and reg:multiplied-fibre, and its final full-line variant.

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