Pullback of coarse filters preserves mass and product counts
OpenFalconerPath.starting_pair_coarse_partitionLet , let and , and let be a starting geometry for these parameters. Fix and a decreasing sequence of Borel relations whose intersection has positive mass. Assume there are one translated dyadic grid and such that for every , is the projected support product intersected with a finite union of depth- cell pairs for some integer .
Then is a decreasing family of Borel subsets of whose intersection has positive mass. There is , independent of , such that every is a disjoint union of at most products of spatial Borel sets.
A starting geometry consists of compact equal to the supports of probabilities carried by them, common constants giving all-scale ball bounds , positive cross separation, and one unit for which all original cross directions lie in . It includes continuous linear orthogonal surjections and , with . The original, middle, and smallest support pairs are bounded and separated. The two middle laws and the two smallest laws share the same all-scale exponent and constant . The smallest supports are compact. If , vanishes on every affine -plane. The Lean statement isolates the spatial and mass conclusions of the proof and requires availability separately.
import Definitions.Def_FalconerPath_defs open Set MeasureTheory Filter open scoped ENNReal NNReal Topology
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