Two Borel deletions yielding a full-source radial threshold
OpenFalconerPath.middle_borel_deletionsborel-deletionfalconerfubini
Let and let be probabilities on . Let be Borel. Fix , and with and no sign condition on . For , let and let be Borel. Put with value zero at , , , and . Assume for every that for -almost every , implies . Also assume that for every with and every , if there is with and , then . There exists a Borel relation such that and for every and every with , .
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 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, 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.