Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Decreasing coarse filters with directional plate bounds

Open
FalconerPath.coarse_exclusion_heavy_plates

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

dyadic-filtersfalconerplates

Let k≥2k\ge2k≥2, k−12<s<kk-\tfrac12<s<kk−21​<s<k, and K>0K>0K>0. Let ρ1,ρ2\rho_1,\rho_2ρ1​,ρ2​ be probabilities on Rk+1\mathbb R^{k+1}Rk+1 with bounded separated supports, each satisfying ρi(B(z,r))≤Krs\rho_i(B(z,r))\le Kr^sρi​(B(z,r))≤Krs for all centers and 0<r≤10<r\le10<r≤1. Suppose ρ1+ρ2\rho_1+\rho_2ρ1​+ρ2​ gives zero mass to every affine kkk-plane. For every 0<ω≤10<\omega\le10<ω≤1 there is a decreasing sequence of Borel relations ΓN⊂supp⁡ρ1×supp⁡ρ2\Gamma_N\subset\operatorname{supp}\rho_1\times\operatorname{supp}\rho_2ΓN​⊂suppρ1​×suppρ2​ with (ρ1⊗ρ2)(⋂NΓN)>0(\rho_1\otimes\rho_2)(\bigcap_N\Gamma_N)>0(ρ1​⊗ρ2​)(⋂N​ΓN​)>0.

There are one translated dyadic grid and a fixed D≥0D\ge0D≥0 such that for every NNN, ΓN\Gamma_NΓN​ is the supported product intersected with a finite union of pairs of depth-jjj cells for some j≤ωN+Dj\le\omega N+Dj≤ωN+D. There are also ζ,C>0\zeta,C>0ζ,C>0, independent of NNN, such that both unnormalized directional laws of ΓN\Gamma_NΓN​ assign mass at most CuζCu^\zetaCuζ to every width-uuu neighborhood of a linear hyperplane on the sphere, for 2−N≤u≤12^{-N}\le u\le12−N≤u≤1, at almost every corresponding pin. Lean reads the cell-pair equality relative to the supported product and expresses the permitted null-fiber removal almost everywhere.

Preamble
import Definitions.Def_FalconerPath_defs
open Set MeasureTheory Filter
open scoped ENNReal NNReal Topology
Formal statement
namespace FalconerPath
theorem coarse_exclusion_heavy_plates {k : ℕ} (hk : 2 ≤ k) (s K : ℝ)
    (hs : (k:ℝ)-1/2 < s) (hsk : s < k) (hK : 0 < K)
    (ρ₁ ρ₂ : Measure (Space (k+1))) (h₁ : Probability ρ₁) (h₂ : Probability ρ₂)
    (hsep : HasBoundedSeparated ρ₁ ρ₂)
    (hf₁ : Frostman ρ₁ s K) (hf₂ : Frostman ρ₂ s K)
    (hzero : NoAffineMass (ρ₁+ρ₂) k)
    (ω : ℝ) (hω : 0 < ω) (hω₁ : ω ≤ 1) :
    ∃ Γ : ℕ → PairSet (k+1), (∀ N, MeasurableSet (Γ N) ∧
      Γ N ⊆ ρ₁.support ×ˢ ρ₂.support) ∧ Antitone Γ ∧
      0 < (ρ₁.prod ρ₂) (⋂ N, Γ N) ∧
      (∃ v : Space (k+1), ∃ D : ℝ, 0 ≤ D ∧ ∀ N : ℕ,
        ∃ j : ℕ, (j:ℝ) ≤ ω*N+D ∧
          CoarseCellPairs ρ₁.support ρ₂.support (Γ N) v j) ∧
      ∃ ζ C : ℝ, 0 < ζ ∧ 0 < C ∧ ∀ N,
        bothPlates ρ₁ ρ₂ (Γ N) ζ C (mesh N) := 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.3, Lemma 5.9 (Coarse exclusion of heavy plates), label prep:coarse-filter, clauses (i), (ii), and (iii). The paper proves this lemma and cites Shmerkin2023, Appendix B, and Ren2023, Section 7, as antecedents.

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