Density pruning multiplies local fiber estimates
OpenFalconerPath.density_pruning_multiplicationFix an integer , either the radial test or the full-line test, and constants . There is such that the following holds for every . Let be a source probability and a finite positive pin measure on , both with supports in . For the radial test require for every cross-support pair. Let and let be integer depths in one translated dyadic grid. Let be a Borel subset of the support product containing no diagonal pair. For each , let be Borel with , and let .
Assume that for every and every depth- cell containing ,
For the radial test, is . For the full-line test it is .
For every there is a Borel deleting at most product mass such that for every pin , every initial depth- cell , and every unit ,
The Lean statement combines the two versions with a Boolean choice and makes fixed geometry and width thresholds explicit.
import Definitions.Def_FalconerPath_defs open Set MeasureTheory Filter open scoped ENNReal NNReal Topology
namespace FalconerPath
theorem density_pruning_multiplication {n : ℕ} (hn : 1 ≤ n)
(lineTest : Bool) (L a C₁ : ℝ) (hL : 0 < L) (ha : 0 < a) (hC₁ : 0 < C₁) :
∃ C₀ : ℝ, 0 < C₀ ∧ ∀ C ≥ C₀,
∀ (ρ ν : Measure (Space n)), Probability ρ → FiniteBorel ν →
ρ.support ⊆ Metric.closedBall 0 L → ν.support ⊆ Metric.closedBall 0 L →
(lineTest = false → ∀ x ∈ ν.support, ∀ z ∈ ρ.support, a ≤ dist x z) →
∀ (N J : ℕ) (depth : ℕ → ℕ),
(∀ j < J, depth j < depth (j+1)) → depth J ≤ N →
∀ (v : Space n) (G : PairSet n) (E : ℕ → PairSet n) (f : ℕ → ℝ),
MeasurableSet G → G ⊆ ν.support ×ˢ ρ.support →
(∀ z ∈ G, z.1 ≠ z.2) →
(∀ j < J, MeasurableSet (E j) ∧ G ⊆ E j ∧ 0 ≤ f j) →
LocalFiberBounds lineTest ρ G E v depth J f C →
∀ e : ℝ, 0 < e → ∃ G' : PairSet n,
MeasurableSet G' ∧ G' ⊆ G ∧
(ν.prod ρ) (G \ G') ≤
ENNReal.ofReal (((J:ℝ)+1)*(scale N)^(-e)) * ν univ ∧
∀ (x : Space n) (i : Fin n → ℤ) (w : Space n), w ∈ unitSphere n →
ρ {z | z ∈ dyadicCell v (depth 0) i ∧ (x,z) ∈ G' ∧
radial x z ∈ Metric.ball w (C₁*mesh (depth J))} ≤
ENNReal.ofReal ((scale N)^(e*J) * ∏ j ∈ Finset.range J, f j) *
ρ (dyadicCell v (depth 0) i) := by sorry
end FalconerPath