Decreasing coarse filters with directional plate bounds
OpenFalconerPath.coarse_exclusion_heavy_platesdyadic-filtersfalconerplates
Let , , and . Let be probabilities on with bounded separated supports, each satisfying for all centers and . Suppose gives zero mass to every affine -plane. For every there is a decreasing sequence of Borel relations with .
There are one translated dyadic grid and a fixed such that for every , is the supported product intersected with a finite union of pairs of depth- cells for some . There are also , independent of , such that both unnormalized directional laws of assign mass at most to every width- neighborhood of a linear hyperplane on the sphere, for , 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 FalconerPathSource
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.