math / data /lean /OAI /MeasureTheory /Falconer /Shells /FarPositiveSum.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
4.17 kB
import OAI.MeasureTheory.Falconer.Estimates.FarCellCount
import OAI.MeasureTheory.Falconer.Shells.PositiveSpatialKernel
namespace OAI
/-! # Positive far kernels over the actual comparable cell pairs
The maximum ranges over the original tested distance laws. The number
of summands is bounded by two free cell labels, not four.
-/
namespace Falconer
open Set MeasureTheory
open scoped ENNReal
attribute [local instance] Classical.propDecidable
noncomputable def farCollisionMaximum {d : β„•}
(wβ‚€ : Sphere d) (Q : DyadicCube d) (ρ : Measure (Space d))
(m : ℝ β†’ ℝ) (A : β„• β†’ ℝ) (N : β„•) (Οƒ : ℝ) (J i q b t : β„•)
(X Y : List (Fin d β†’ Bool)) (n : β„•) : ℝβ‰₯0∞ :=
((farCellPartners (Q.descendant X) ρ n) Γ—Λ’
(farCellPartners (Q.descendant Y) ρ n)).sup fun z =>
max (positiveCollisionCount wβ‚€ Q ρ m A N Οƒ J i q b t (X++z.1.1) (X++z.1.2))
(positiveCollisionCount wβ‚€ Q ρ m A N Οƒ J i q b t (Y++z.2.1) (Y++z.2.2))
theorem far_positive_kernel_sum_le {d : β„•}
(wβ‚€ : Sphere d) (Q : DyadicCube d) (ρ : Measure (Space d)) [IsFiniteMeasure ρ]
(m : ℝ β†’ ℝ) (A : β„• β†’ ℝ) (N : β„•) (Οƒ : ℝ) (J i q b t : β„•)
(X Y : List (Fin d β†’ Bool)) (n : β„•)
(S : (List (Fin d β†’ Bool) Γ— List (Fin d β†’ Bool)) β†’
(List (Fin d β†’ Bool) Γ— List (Fin d β†’ Bool)) β†’
Set ((Space d Γ— Space d) Γ— (Space d Γ— Space d))) :
(βˆ‘ z ∈ (farCellPartners (Q.descendant X) ρ n) Γ—Λ’
(farCellPartners (Q.descendant Y) ρ n),
ENNReal.ofReal ((2:ℝ)^(t-b)*((2:ℝ)^N)^(4*m b)) *
(∫⁻ v in S z.1 z.2,
ENNReal.ofReal (1/(1+(2:ℝ)^t*|dist v.1.1 v.1.2-dist v.2.1 v.2.2|)^2)
βˆ‚(testedCellPair ρ ρ (Q.descendant (X++z.1.1)) (Q.descendant (X++z.1.2))
(policyTestPairs wβ‚€ Q ρ m A N Οƒ J i q b t)).prod
(testedCellPair ρ ρ (Q.descendant (Y++z.2.1)) (Q.descendant (Y++z.2.2))
(policyTestPairs wβ‚€ Q ρ m A N Οƒ J i q b t)))) ≀
(((farCellPartners (Q.descendant X) ρ n) Γ—Λ’
(farCellPartners (Q.descendant Y) ρ n)).card : ℝβ‰₯0∞) *
PlanarFalconer.binKernelConstant *
farCollisionMaximum wβ‚€ Q ρ m A N Οƒ J i q b t X Y n := by
let T := (farCellPartners (Q.descendant X) ρ n) Γ—Λ’
(farCellPartners (Q.descendant Y) ρ n)
calc
_ ≀ βˆ‘ _z ∈ T, PlanarFalconer.binKernelConstant *
farCollisionMaximum wβ‚€ Q ρ m A N Οƒ J i q b t X Y n := by
apply Finset.sum_le_sum
intro z hz
exact (positiveCollision_spatial_kernel_max wβ‚€ Q ρ m A N Οƒ J i q b t
(X++z.1.1) (X++z.1.2) (Y++z.2.1) (Y++z.2.2) (S z.1 z.2)).trans
(mul_le_mul' le_rfl (Finset.le_sup (s := T) (f := fun z =>
max (positiveCollisionCount wβ‚€ Q ρ m A N Οƒ J i q b t (X++z.1.1) (X++z.1.2))
(positiveCollisionCount wβ‚€ Q ρ m A N Οƒ J i q b t (Y++z.2.1) (Y++z.2.2))) hz))
_ = _ := by simp only [Finset.sum_const, nsmul_eq_mul, mul_assoc, T]
theorem farCellPartners_regular_card {d : β„•} {Q : DyadicCube d}
{ρ : Measure (Space d)} {N : β„•} {s lam : ℝ} {m : ℝ β†’ ℝ}
(h : Regularization.RegularizedProfileData Q ρ N s lam m) (hQ : 0 < Q.side)
{a b : β„•} (hab : a ≀ b) (hb : b ≀ N)
(X Y : List (Fin d β†’ Bool)) (hX : X.length = a) (hY : Y.length = a) :
(((farCellPartners (Q.descendant X) ρ (b-a)) Γ—Λ’
(farCellPartners (Q.descendant Y) ρ (b-a))).card : ℝ) ≀
((2*(1100*(d+1))+1)^(2*d):β„•) *
((2:ℝ)^N)^(2*(m ((b:ℝ)/N)-m ((a:ℝ)/N))+4*((d:ℝ)+1)*lam) := by
have hc := farCellPartners_pair_card (Q.descendant X) (Q.descendant Y)
(Q.descendant_side_pos hQ X) (Q.descendant_side_pos hQ Y) ρ ρ (b-a)
have hc' : (((farCellPartners (Q.descendant X) ρ (b-a)) Γ—Λ’
(farCellPartners (Q.descendant Y) ρ (b-a))).card : ℝ) ≀
(((2*(1100*(d+1))+1)^(2*d):β„•):ℝ) *
(((Q.descendant X).occupiedPaths ρ (b-a) Γ—Λ’
(Q.descendant Y).occupiedPaths ρ (b-a)).card : ℝ) := by exact_mod_cast hc
exact hc'.trans (mul_le_mul_of_nonneg_left (h.pair_count hab hb X Y hX hY)
(Nat.cast_nonneg _))
end Falconer
end OAI