Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pullback of coarse filters preserves mass and product counts

Open
FalconerPath.starting_pair_coarse_partition

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

dyadic-filtersfalconerproduct-partitions

Let d,h,k∈Nd,h,k\in\mathbb Nd,h,k∈N, let E⊂RdE\subset\mathbb R^dE⊂Rd and r∈Rr\in\mathbb Rr∈R, and let AAA be a starting geometry for these parameters. Fix ω>0\omega>0ω>0 and a decreasing sequence of Borel relations ΓN⊂supp⁡(P#μ1)×supp⁡(P#μ2)\Gamma_N\subset\operatorname{supp}(P_\#\mu_1)\times\operatorname{supp}(P_\#\mu_2)ΓN​⊂supp(P#​μ1​)×supp(P#​μ2​) whose intersection has positive (P#μ1)⊗(P#μ2)(P_\#\mu_1)\otimes(P_\#\mu_2)(P#​μ1​)⊗(P#​μ2​) mass. Assume there are one translated dyadic grid and D≥0D\ge0D≥0 such that for every NNN, ΓN\Gamma_NΓN​ is the projected support product intersected with a finite union of depth-jjj cell pairs for some integer j≤ωN+Dj\le\omega N+Dj≤ωN+D.

Then ΔN=(E1×E2)∩(P×P)−1(ΓN)\Delta_N=(E_1\times E_2)\cap(P\times P)^{-1}(\Gamma_N)ΔN​=(E1​×E2​)∩(P×P)−1(ΓN​) is a decreasing family of Borel subsets of E1×E2E_1\times E_2E1​×E2​ whose intersection has positive (μ1⊗μ2)(\mu_1\otimes\mu_2)(μ1​⊗μ2​) mass. There is C0>0C_0>0C0​>0, independent of NNN, such that every ΔN\Delta_NΔN​ is a disjoint union of at most C022dωNC_0 2^{2d\omega N}C0​22dωN products of spatial Borel sets.

A starting geometry consists of compact E1,E2⊂EE_1,E_2\subset EE1​,E2​⊂E equal to the supports of probabilities μ1,μ2\mu_1,\mu_2μ1​,μ2​ carried by them, common constants χ,C>0\chi,C>0χ,C>0 giving all-scale ball bounds Crd/2+χCr^{d/2+\chi}Crd/2+χ, positive cross separation, and one unit www for which all original cross directions lie in B(w,r)B(w,r)B(w,r). It includes continuous linear orthogonal surjections P:Rd→Rk+1P:\mathbb R^d\to\mathbb R^{k+1}P:Rd→Rk+1 and Q:Rk+1→Rh+1Q:\mathbb R^{k+1}\to\mathbb R^{h+1}Q:Rk+1→Rh+1, with h+1≤k+1≤dh+1\le k+1\le dh+1≤k+1≤d. The original, middle, and smallest support pairs are bounded and separated. The two middle laws P#μiP_\#\mu_iP#​μi​ and the two smallest laws Q#P#μiQ_\#P_\#\mu_iQ#​P#​μi​ share the same all-scale exponent d/2+χd/2+\chid/2+χ and constant CCC. The smallest supports are compact. If d=2k−1d=2k-1d=2k−1, P#μ1+P#μ2P_\#\mu_1+P_\#\mu_2P#​μ1​+P#​μ2​ vanishes on every affine kkk-plane. The Lean statement isolates the spatial and mass conclusions of the proof and requires availability separately.

Preamble
import Definitions.Def_FalconerPath_defs
open Set MeasureTheory Filter
open scoped ENNReal NNReal Topology
Formal statement
namespace FalconerPath
theorem starting_pair_coarse_partition {d h k : ℕ} {E : Set (Space d)} {r : ℝ}
    (A : StartingGeometry d E r h k) (ω : ℝ) (hω : 0 < ω)
    (Γ : ℕ → PairSet (k+1))
    (hΓ : ∀ N, MeasurableSet (Γ N) ∧
      Γ N ⊆ (Measure.map A.P A.μ₁).support ×ˢ (Measure.map A.P A.μ₂).support)
    (hanti : Antitone Γ)
    (hmass : 0 < ((Measure.map A.P A.μ₁).prod (Measure.map A.P A.μ₂)) (⋂ N, Γ N))
    (hcells : ∃ v : Space (k+1), ∃ D : ℝ, 0 ≤ D ∧ ∀ N : ℕ,
      ∃ j : ℕ, (j:ℝ) ≤ ω*N+D ∧ CoarseCellPairs
        (Measure.map A.P A.μ₁).support (Measure.map A.P A.μ₂).support (Γ N) v j) :
    let Δ := fun N => supportedPullback A.P A.E₁ A.E₂ (Γ N)
    (∀ N, MeasurableSet (Δ N) ∧ Δ N ⊆ A.E₁ ×ˢ A.E₂) ∧ Antitone Δ ∧
      0 < (A.μ₁.prod A.μ₂) (⋂ N, Δ N) ∧
      ∃ C : ℝ, 0 < C ∧ ∀ N, ProductPartition (Δ N) (C*(scale N)^(2*(d:ℝ)*ω)) := 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.4, Proposition 5.10 (Starting pair measures), label prep:starting-pairs, final proof paragraph at “The auxiliary finest-depth cell partition has at most”, “As k+1 ≤ d”, and “pullback preserves disjointness”.

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