File size: 2,907 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 | import OAI.Analysis.Fourier.Restriction.FiniteLp
open OAI.Analysis.Fourier.Wave
open _root_.MeasureTheory Set Metric
open scoped ENNReal BigOperators
noncomputable section
namespace OAI.Analysis.Fourier.Restriction
theorem sparse_balls_disjoint {n N : β} (hn : 2 β€ n) {R : β} (hR : 1 β€ R)
(z : Fin N β Space n)
(hsep : β i j, i β j β R ^ (16 * n) * (N : β) ^ (16 * n) β€ dist (z i) (z j)) :
Pairwise (fun i j β¦ Disjoint (ball (z i) R) (ball (z j) R)) := by
intro i j hij
have hN : 2 β€ N := by
have hi := i.isLt
have hj := j.isLt
have hne : i.val β j.val := fun h β¦ hij (Fin.ext h)
omega
have hN' : (2 : β) β€ N := by exact_mod_cast hN
have hD : 1 β€ 16 * n := by omega
have hpowR : R β€ R ^ (16 * n) := by
simpa only [pow_one] using pow_le_pow_rightβ hR hD
have hpowN : (N : β) β€ (N : β) ^ (16 * n) := by
simpa only [pow_one] using pow_le_pow_rightβ (by linarith : (1 : β) β€ N) hD
have hdist : 2 * R β€ dist (z i) (z j) := by
apply le_trans _ (hsep i j hij)
nlinarith [mul_le_mul hpowR hpowN (by linarith : (0 : β) β€ N) (by positivity : 0 β€ R ^ (16 * n))]
rw [Set.disjoint_left]
intro x hxi hxj
have H := dist_triangle (z i) x (z j)
have hxi' : dist (z i) x < R := by simpa only [mem_ball, dist_comm] using hxi
have hxj' : dist x (z j) < R := hxj
linarith
theorem sum_ball_indicators_eq {n N : β} (z : Fin N β Space n) (R : β)
(hd : Pairwise (fun i j β¦ Disjoint (ball (z i) R) (ball (z j) R)))
(f : Space n β β) (hs : β x, (β i, x β ball (z i) R) β f x = 0) (x : Space n) :
β i, (ball (z i) R).indicator f x = f x := by
classical
by_cases hex : β i, x β ball (z i) R
Β· obtain β¨i, hiβ© := hex
rw [Finset.sum_eq_single i]
Β· exact indicator_of_mem hi f
Β· intro j hj hji
exact indicator_of_notMem (fun h β¦ Set.disjoint_left.mp (hd hji) h hi) f
Β· simp
Β· have hh : β i, x β ball (z i) R := by simpa only [not_exists] using hex
simp only [indicator_of_notMem (hh _), Finset.sum_const_zero, hs x hh]
theorem sum_indicator_enorm_rpow_le {X : Type*} {N : β} (s : Fin N β Set X)
(hd : Pairwise (fun i j β¦ Disjoint (s i) (s j))) (f : X β β)
{p : β} (hp : 0 < p) (x : X) :
β i, β(s i).indicator f xββ ^ p β€ βf xββ ^ p := by
classical
by_cases hex : β i, x β s i
Β· obtain β¨i, hiβ© := hex
rw [Finset.sum_eq_single i]
Β· rw [indicator_of_mem hi]
Β· intro j hj hji
rw [indicator_of_notMem (fun h β¦ Set.disjoint_left.mp (hd hji) h hi), enorm_zero,
ENNReal.zero_rpow_of_pos hp]
Β· simp
Β· have hh : β i, x β s i := by simpa only [not_exists] using hex
simp only [indicator_of_notMem (hh _), enorm_zero, ENNReal.zero_rpow_of_pos hp,
Finset.sum_const_zero]
exact bot_le
end OAI.Analysis.Fourier.Restriction
|