Outer-interval radial fiber estimates
OpenFalconerPath.one_scale_outer_radial_estimatesLet and let be real parameters. Take a sequence of normalized regular-class data with these fixed parameters, with and , whose profiles converge uniformly on to a function . Suppose , for , and for . Let .
For all sufficiently large there is a Borel with deleted product mass at most . Put , , , and . For every , every , and every depth- cell containing ,
where , , and .
Here a normalized regular-class datum consists of an integer , probabilities on with supports in and cross distances at least , a translated half-open unit root carrying , a nonnegative error , and a profile with , nondecreasing and -Lipschitz on , satisfying . In its translated dyadic grid, every occupied depth- cell has -mass between and , for , where . For occupied nested cells at depths , , the ratio lies between and . The datum includes a Borel such that, for -almost every , the unnormalized reverse law obeys cap bounds and directional plate bounds for . The geometry constants are positive. The Lean statement packages the two outer tests on one retained relation, with the unrestricted full conditional source law and the trivial middle factor.
import Definitions.Def_FalconerPath_defs open Set MeasureTheory Filter open scoped ENNReal NNReal Topology
namespace FalconerPath
theorem one_scale_outer_radial_estimates {k : ℕ} (hk : 2 ≤ k)
(s q ζ L a C : ℝ) (X : ℕ → RadialClassData k s q ζ L a C)
(hN : Tendsto (fun j => (X j).N) atTop atTop)
(herr : Tendsto (fun j => (X j).err) atTop (𝓝 0))
(m : ℝ → ℝ)
(hconv : ∀ ε : ℝ, 0 < ε → ∃ J : ℕ, ∀ j ≥ J, ∀ u ∈ Icc (0:ℝ) 1,
|(X j).m u-m u| < ε)
(A B : ℝ) (hA : 0 < A) (hAB : A < B) (hB : B < 1)
(hfirst : ∀ w ∈ Icc 0 A, q*w ≤ m w)
(hlast : ∀ w ∈ Icc B 1, q*(w-B) ≤ m w-m B)
(e W : ℝ) (he : 0 < e) (hW : 0 < W) :
∀ᶠ j in atTop, ∃ H : PairSet (k+1), MeasurableSet H ∧ H ⊆ (X j).G ∧
((X j).ν.prod (X j).ρ) ((X j).G \ H) ≤
ENNReal.ofReal ((scale (X j).N)^(-e/2)) ∧
LocalFiberBounds false (X j).ρ H (fun _ => univ) (X j).v
(contactDepths (X j).N A B) 3
(fun i => if i = 0 then (scale (X j).N)^(-q*A+e)
else if i = 2 then (scale (X j).N)^(-q*(1-B)+e) else 1) W := by sorry
end FalconerPath