math / data /lean /OAI /MeasureTheory /Falconer /Shells /ActualComparableShellDistance.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
3.73 kB
import OAI.MeasureTheory.Falconer.Shells.ActualComparableShellRebin
import OAI.MeasureTheory.Falconer.Geometry.SeparatedDistanceMaximum
namespace OAI
namespace PlanarFalconer
open Set MeasureTheory
open scoped ENNReal ContDiff
attribute [local instance] Classical.propDecidable
theorem uniform_actual_comparable_shell_distance {Ξ¨ : ℝ β†’ ℝ}
(hΞ¨ : ContDiff ℝ ∞ Ξ¨) (hsΞ¨ : βˆ€ t, Ξ¨ t β‰  0 β†’ t ∈ Ioo (1/4:ℝ) 4)
{sig : ℝ} (hsig : 0 < sig) (K o : β„•) {J : β„•} (hJ : 0 < J) :
βˆƒ H : ℝ, 0 ≀ H ∧ βˆƒ Nβ‚€ : β„•, βˆ€ N β‰₯ Nβ‚€,
βˆ€ (Q : Fin 2 β†’ DyadicSquare), (βˆ€ l, (Q l).side = 1) β†’
βˆ€ (ρ : Fin 2 β†’ Measure Plane) [βˆ€ l, IsFiniteMeasure (ρ l)],
(βˆ€ l, ρ l (Q l).carrierᢜ = 0) β†’
βˆ€ (m : ℝ β†’ ℝ) (q aβ‚€ tβ‚€ a d n v : β„•),
0 < q β†’ aβ‚€ ≀ a+n β†’ v ≀ tβ‚€ β†’ v ≀ N β†’
βˆ€ (S : Fin 2 β†’ Finset PolicyDescriptor) (k : Fin 2 β†’ PolicyDescriptor β†’ β„•),
(βˆ€ l, remainingPolicyDescriptors (fun t => m t-(t:ℝ)/(N:ℝ)) N q aβ‚€ tβ‚€ a βŠ† S l) β†’
(βˆ€ l, (S l).card ≀ (N+1)^3+1) β†’ (βˆ€ l, βˆ‘ t ∈ S l, k l t ≀ K) β†’
βˆ€ L : β„•, (βˆ€ l t, t ∈ S l β†’ descriptorLength t ≀ L) β†’
βˆ€ Lβ‚€ : ℝ, (v:ℝ)-(a+d:β„•) = 2*Lβ‚€ β†’ (L:ℝ) ≀ Lβ‚€ β†’ 10*sig*(N:ℝ) ≀ Lβ‚€ β†’
βˆ€ (lam : ℝ) (i : Fin 2 β†’ β„•) (hsp : Fin 2 β†’ Plane β†’ β„‚),
(βˆ€ l x, β€–hsp l xβ€– ≀ 1) β†’
βˆ€ A B : CellPath, A.length = a β†’ B.length = a β†’
let β := fun l => inheritedCircleSymbol (S l) id (k l) (Q l) (ρ l) (m)
N (lam) sig J (i l) (hsp l)
let D : Fin 2 β†’ PositiveDistanceData := fun l =>
⟨Q l,ρ l,m,N,q,a+n,v,lam,sig,J,i l+1,[],[]⟩
β€–βˆ‘ row ∈ sourceProductVertices (Q 0) (Q 1) (ρ 0) (ρ 1) A B d,
βˆ‘ col ∈ sourceProductVertices (Q 0) (Q 1) (ρ 0) (ρ 1) A B d,
if Β¬ angularNear (Q 0) (Q 1) (a+d) row col then
∫ x in angularLengthShell (a+n), angularStationarySpatialKernel (β 0) (β 1) o v Ψ x
βˆ‚angularFourCellMeasure (Q 0) (Q 1) (ρ 0) (ρ 1) row col
else 0β€–β‚‘ ≀
ENNReal.ofReal H * binKernelConstant *
ENNReal.ofReal ((((2:ℝ)^N)^(-m (a+n)))^4*(2:ℝ)^(-2*((v:ℝ)-(a+n:β„•)))) *
((sourceProductVertices (Q 0) (Q 1) (ρ 0) (ρ 1) A B n).card:ℝβ‰₯0∞) *
257025537024256 *
(D 0).separatedMaximum (D 1) (sourceProductVertices (Q 0) (Q 1) (ρ 0) (ρ 1) A B n) (a+n) := by
obtain ⟨H,hH,Nβ‚€,hβ‚€βŸ© := uniform_actual_comparable_shell_rebin hΞ¨ hsΞ¨ hsig K o hJ
refine ⟨H,hH,Nβ‚€,?_⟩
intro N hN Q hQ ρ inst hcarry m q aβ‚€ tβ‚€ a d n v hq haβ‚€ ht hv S k hS hcard hK L hL
Lβ‚€ hvh hLL hLβ‚€ lam i hsp hspb A B hA hB
let D : Fin 2 β†’ PositiveDistanceData := fun l =>
⟨Q l,ρ l,m,N,q,a+n,v,lam,sig,J,i l+1,[],[]⟩
have he := hβ‚€ N hN Q hQ ρ hcarry (fun _ => m) q aβ‚€ tβ‚€ a d n v hq haβ‚€ ht hv
S k hS hcard hK L hL Lβ‚€ hvh hLL hLβ‚€ (fun _ => lam) i hsp hspb A B hA hB
have hn : (D 0).normalization = (D 1).normalization := rfl
have hk := PositiveDistanceData.rebinned_positive_kernel_max (D 0) (D 1) rfl hn A B n (a+n)
have hc := PositiveDistanceData.separated_sum_le_maximum (D 0) (D 1) (hQ 0) (hQ 1) (a+n)
(sourceProductVertices (Q 0) (Q 1) (ρ 0) (ρ 1) A B n)
(sourceProductVertices_subset _ _ _ _ _ _ a n hA hB)
dsimp only at he ⊒
rw [mul_assoc] at he
have hh := he.trans (mul_le_mul_right hk (ENNReal.ofReal H))
have hh' := hh.trans (mul_le_mul_right
(mul_le_mul_right hc (binKernelConstant * ENNReal.ofReal
((D 0).levelMass^4*(2:ℝ)^(-2*((v:ℝ)-(a+n:β„•)))))) (ENNReal.ofReal H))
simpa only [D,PositiveDistanceData.levelMass,mul_assoc,Nat.cast_add] using hh'
end PlanarFalconer
end OAI