Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Two Borel deletions yielding a full-source radial threshold

Open
FalconerPath.middle_borel_deletions

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

borel-deletionfalconerfubini

Let n∈Nn\in\mathbb Nn∈N and let ν,ρ\nu,\rhoν,ρ be probabilities on Rn\mathbb R^nRn. Let G⊆supp⁡ν×supp⁡ρG\subseteq\operatorname{supp}\nu\times\operatorname{supp}\rhoG⊆suppν×suppρ be Borel. Fix v∈Rnv\in\mathbb R^nv∈Rn, d∈Nd\in\mathbb Nd∈N and r,f,η∈Rr,f,\eta\in\mathbb Rr,f,η∈R with f,η≥0f,\eta\ge0f,η≥0 and no sign condition on rrr. For i∈Zni\in\mathbb Z^ni∈Zn, let Qi={z:vℓ+iℓ2−d≤zℓ<vℓ+(iℓ+1)2−d for all ℓ}Q_i=\{z:v_\ell+i_\ell2^{-d}\le z_\ell<v_\ell+(i_\ell+1)2^{-d}\text{ for all }\ell\}Qi​={z:vℓ​+iℓ​2−d≤zℓ​<vℓ​+(iℓ​+1)2−d for all ℓ} and let Bi+⊆RnB_i^+\subseteq\mathbb R^nBi+​⊆Rn be Borel. Put πx(z)=∥z−x∥−1(z−x)\pi_x(z)=\|z-x\|^{-1}(z-x)πx​(z)=∥z−x∥−1(z−x) with value zero at z=xz=xz=x, λz=(πz)#(ν∣{x:(x,z)∈G})\lambda_z=(\pi_z)_\#(\nu|_{\{x:(x,z)\in G\}})λz​=(πz​)#​(ν∣{x:(x,z)∈G}​), Mi(x,z)=ρ{z′∈Qi:∥πx(z′)−πx(z)∥≤r}M_i(x,z)=\rho\{z'\in Q_i:\|\pi_x(z')-\pi_x(z)\|\le r\}Mi​(x,z)=ρ{z′∈Qi​:∥πx​(z′)−πx​(z)∥≤r}, and Hi(x)={z∈Qi∩supp⁡ρ:fρ(Qi)<Mi(x,z)}\mathcal H_i(x)=\{z\in Q_i\cap\operatorname{supp}\rho:f\rho(Q_i)<M_i(x,z)\}Hi​(x)={z∈Qi​∩suppρ:fρ(Qi​)<Mi​(x,z)}. Assume for every iii that for ρ\rhoρ-almost every zzz, z∈Qiz\in Q_iz∈Qi​ implies λz(Bi+)≤η\lambda_z(B_i^+)\le\etaλz​(Bi+​)≤η. Also assume that for every iii with ρ(Qi)>0\rho(Q_i)>0ρ(Qi​)>0 and every x∈supp⁡νx\in\operatorname{supp}\nux∈suppν, if there is z∈Qi∩supp⁡ρz\in Q_i\cap\operatorname{supp}\rhoz∈Qi​∩suppρ with (x,z)∈G(x,z)\in G(x,z)∈G and πz(x)∉Bi+\pi_z(x)\notin B_i^+πz​(x)∈/Bi+​, then (ρ(Qi)−1ρ∣Qi)(Hi(x))≤η(\rho(Q_i)^{-1}\rho|_{Q_i})(\mathcal H_i(x))\le\eta(ρ(Qi​)−1ρ∣Qi​​)(Hi​(x))≤η. There exists a Borel relation H⊆GH\subseteq GH⊆G such that (ν⊗ρ)(G∖H)≤2η(\nu\otimes\rho)(G\setminus H)\le2\eta(ν⊗ρ)(G∖H)≤2η and for every (x,z)∈H(x,z)\in H(x,z)∈H and every iii with z∈Qiz\in Q_iz∈Qi​, Mi(x,z)≤fρ(Qi)M_i(x,z)\le f\rho(Q_i)Mi​(x,z)≤fρ(Qi​).

Preamble
import Definitions.Def_FalconerPath_connect
open Set MeasureTheory Filter
open scoped ENNReal NNReal Topology
Formal statement
namespace FalconerPath
/-- Section 5, Lemma 5.3, the two Fubini deletions: first delete pairs
whose reverse direction is in the cell's Borel bad set; then intersect with
the radial threshold event. Cell weights sum to one. A pin with no surviving
witness incurs zero second deletion. This elementary assembly statement is
valid for an arbitrary grid depth, radius and threshold; it assumes the
conditional heavy-set estimate and supplies no analytic gain of its own. -/
theorem middle_borel_deletions {n : ℕ}
    (ν ρ : Measure (Space n)) (hν : Probability ν) (hρ : Probability ρ)
    (G : PairSet n) (hG : MeasurableSet G) (hsupp : G ⊆ ν.support ×ˢ ρ.support)
    (v : Space n) (d : ℕ) (r f η : ℝ) (hf : 0 ≤ f) (hη : 0 ≤ η)
    (Bplus : (Fin n → ℤ) → Set (Space n))
    (hB : ∀ i, MeasurableSet (Bplus i))
    (hbad : ∀ i, ∀ᵐ z ∂ρ, z ∈ dyadicCell v d i →
      reverseDirection ν G z (Bplus i) ≤ ENNReal.ofReal η)
    (hheavy : ∀ i, 0 < ρ (dyadicCell v d i) → ∀ x ∈ ν.support,
      (∃ z ∈ dyadicCell v d i, z ∈ ρ.support ∧ (x,z) ∈ G ∧ radial z x ∉ Bplus i) →
      normalizedRestriction ρ (dyadicCell v d i)
        (connectHeavy ρ (dyadicCell v d i) r f x) ≤ ENNReal.ofReal η) :
    ∃ H : PairSet n, MeasurableSet H ∧ H ⊆ G ∧
      (ν.prod ρ) (G \ H) ≤ ENNReal.ofReal (2*η) ∧
      ∀ x z : Space n, (x,z) ∈ H → ∀ i : Fin n → ℤ,
        z ∈ dyadicCell v d i →
        connectRadialMass ρ (dyadicCell v d i) r x z ≤
          ENNReal.ofReal f * ρ (dyadicCell v d 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 5, Lemma 5.3 (prep:one-scale), the first Fubini deletion after (prep:witness-bad), together with the paragraph beginning with the pair relation surviving the bad-direction deletion. The latter integrates the heavy deletion over represented pins and sums with original source-cell weights, with zero cost for an unrepresented pin and a Borel threshold intersection requiring no measurable witness choice.

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