Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Cell rescaling and full-source radial heavy sets for the Falconer connection sketches

Definition
FalconerPath_connect

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

falconer

In Euclidean Rn\mathbb R^nRn, write hd=2−dh_d=2^{-d}hd​=2−d and Q(v,d,i)={z:vr+irhd≤zr<vr+(ir+1)hd for every r}Q(v,d,i)=\{z:v_r+i_rh_d\le z_r<v_r+(i_r+1)h_d\text{ for every }r\}Q(v,d,i)={z:vr​+ir​hd​≤zr​<vr​+(ir​+1)hd​ for every r} for i∈Zni\in\mathbb Z^ni∈Zn. The definition connectCellCenter gives the cell center cQ=(vr+(ir+1/2)hd)rc_Q=(v_r+(i_r+1/2)h_d)_rcQ​=(vr​+(ir​+1/2)hd​)r​. The definition connectCellMap gives the rescaling TQ(z)=hd−1(z−cQ)T_Q(z)=h_d^{-1}(z-c_Q)TQ​(z)=hd−1​(z−cQ​). The definition connectCellLaw gives μQ=(TQ)#(ρ(Q)−1ρ∣Q)\mu_Q=(T_Q)_\#(\rho(Q)^{-1}\rho|_Q)μQ​=(TQ​)#​(ρ(Q)−1ρ∣Q​), where the inverse and scalar multiplication are taken in the extended nonnegative reals, including at zero and infinity. Write πx(z)=∥z−x∥−1(z−x)\pi_x(z)=\|z-x\|^{-1}(z-x)πx​(z)=∥z−x∥−1(z−x) with πx(x)=0\pi_x(x)=0πx​(x)=0 and [u]+=max⁡(u,0)[u]_+=\max(u,0)[u]+​=max(u,0) as an extended nonnegative real. The definition connectRadialMass gives Mρ,Q,r(x,z)=ρ{z′∈Q:∥πx(z′)−πx(z)∥≤r}M_{\rho,Q,r}(x,z)=\rho\{z'\in Q:\|\pi_x(z')-\pi_x(z)\|\le r\}Mρ,Q,r​(x,z)=ρ{z′∈Q:∥πx​(z′)−πx​(z)∥≤r}. The definition connectHeavy gives Hρ,Q,r,f(x)={z∈Q∩supp⁡ρ:[f]+ρ(Q)<Mρ,Q,r(x,z)}\mathcal H_{\rho,Q,r,f}(x)=\{z\in Q\cap\operatorname{supp}\rho:[f]_+\rho(Q)<M_{\rho,Q,r}(x,z)\}Hρ,Q,r,f​(x)={z∈Q∩suppρ:[f]+​ρ(Q)<Mρ,Q,r​(x,z)}. These definitions allow every natural dimension and depth, any grid translation and index, any measure, arbitrary real r,fr,fr,f and arbitrary points x,zx,zx,z. The comparison points z′z'z′ range over the entire cell without a pair-relation restriction.

Definition code
import Definitions.Def_FalconerPath_defs

noncomputable section
set_option autoImplicit false
open Set MeasureTheory Filter
open scoped ENNReal NNReal Topology

namespace FalconerPath

/-! Explicit cell geometry and full-source radial tests for the two
connection sketches (Section 5, proof of Lemma 5.3). -/
/-- Center and rescaling of the actual half-open dyadic cell. -/
def connectCellCenter {n : ℕ} (v : Space n) (d : ℕ) (i : Fin n → ℤ) : Space n :=
  WithLp.toLp 2 (fun r => v r + ((i r : ℝ)+1/2)*mesh d)

def connectCellMap {n : ℕ} (v : Space n) (d : ℕ) (i : Fin n → ℤ)
    (z : Space n) : Space n :=
  (mesh d)⁻¹ • (z-connectCellCenter v d i)

def connectCellLaw {n : ℕ} (ρ : Measure (Space n)) (v : Space n)
    (d : ℕ) (i : Fin n → ℤ) : Measure (Space n) :=
  Measure.map (connectCellMap v d i) (normalizedRestriction ρ (dyadicCell v d i))

/-- Full conditional-source test: comparison points are never restricted to G. -/
def connectRadialMass {n : ℕ} (ρ : Measure (Space n)) (Q : Set (Space n))
    (r : ℝ) (x z : Space n) : ℝ≥0∞ :=
  ρ {z' | z' ∈ Q ∧ dist (radial x z') (radial x z) ≤ r}

def connectHeavy {n : ℕ} (ρ : Measure (Space n)) (Q : Set (Space n))
    (r f : ℝ) (x : Space n) : Set (Space n) :=
  {z | z ∈ Q ∧ z ∈ ρ.support ∧ ENNReal.ofReal f * ρ Q < connectRadialMass ρ Q r x z}

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, proof of Lemma 5.3 (One-scale improvement), label prep:one-scale, middle interval.

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