math / data /lean /OAI /Analysis /Fourier /SquareFunction /CountableSquare.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
4.42 kB
import OAI.Analysis.Fourier.SquareFunction.Summation
import OAI.Analysis.Fourier.SquareFunction.EnvelopeLp
/-! Passage from finite vector estimates to the square function over all
dyadic scales, without an a priori finiteness assumption. -/
namespace OAI.Analysis.Fourier.SquareFunction
open _root_.MeasureTheory
open scoped ENNReal
theorem rpow_iSup_positive {I : Sort*} (f : I β†’ ℝβ‰₯0∞) {p : ℝ} (hp : 0 < p) :
(⨆ i, f i) ^ p = ⨆ i, f i ^ p := (ENNReal.orderIsoRpow p hp).map_iSup f
theorem ennreal_eLpNorm_iSup_directed {X I : Type*} [MeasurableSpace X] [Countable I]
{ΞΌ : Measure X} {f : I β†’ X β†’ ℝβ‰₯0∞} (hf : βˆ€ i, Measurable (f i))
(hd : Directed (Β· ≀ Β·) f) {p : ℝ} (hp : 0 < p) :
eLpNorm (fun x => ⨆ i, f i x) (ENNReal.ofReal p) ΞΌ =
⨆ i, eLpNorm (f i) (ENNReal.ofReal p) ΞΌ := by
have hm : Measurable (fun x => ⨆ i, f i x) := Measurable.iSup hf
rw [eLpNorm_eq_lintegral_rpow_enorm_toReal (by positivity)
ENNReal.ofReal_ne_top hm.aestronglyMeasurable]
simp only [ENNReal.toReal_ofReal hp.le, enorm_eq_self]
simp_rw [rpow_iSup_positive _ hp]
rw [lintegral_iSup_directed_of_measurable (fun i => (hf i).pow_const p)]
Β· rw [rpow_iSup_positive _ (one_div_pos.mpr hp)]
congr 1
funext i
rw [eLpNorm_eq_lintegral_rpow_enorm_toReal (by positivity) ENNReal.ofReal_ne_top
(hf i).aestronglyMeasurable]
simp only [ENNReal.toReal_ofReal hp.le, enorm_eq_self]
Β· intro i j
obtain ⟨k, hik, hjk⟩ := hd i j
exact ⟨k, fun x => ENNReal.rpow_le_rpow (hik x) hp.le,
fun x => ENNReal.rpow_le_rpow (hjk x) hp.le⟩
noncomputable def countableSquareNorm {X I H : Type*} [NormedAddCommGroup H]
(u : I β†’ X β†’ H) (x : X) : ℝβ‰₯0∞ :=
(βˆ‘' i, β€–u i xβ€–β‚‘ ^ (2 : ℝ)) ^ (1 / 2 : ℝ)
theorem finite_square_eq_vectorNorm {I H : Type*} [NormedAddCommGroup H]
(s : Finset I) (u : I β†’ H) :
(βˆ‘ i ∈ s, β€–u iβ€–β‚‘ ^ (2 : ℝ)) ^ (1 / 2 : ℝ) =
ENNReal.ofReal (vectorNorm (fun i : s => u i)) := by
have h : ENNReal.ofReal (vectorNorm (fun i : s => u i)) ^ (2 : ℝ) =
βˆ‘ i ∈ s, β€–u iβ€–β‚‘ ^ (2 : ℝ) := by
exact (enorm_vectorNorm_sq (fun i : s => u i)).trans
(Finset.sum_coe_sort s (fun i => β€–u iβ€–β‚‘ ^ (2 : ℝ)))
rw [← h, ← ENNReal.rpow_mul]
norm_num
theorem eLpNorm_countableSquareNorm {X I H : Type*} [MeasurableSpace X] [Countable I]
[NormedAddCommGroup H] [MeasurableSpace H] [BorelSpace H]
{ΞΌ : Measure X} (u : I β†’ X β†’ H) (hu : βˆ€ i, Measurable (u i))
{p : ℝ} (hp : 0 < p) :
eLpNorm (countableSquareNorm u) (ENNReal.ofReal p) ΞΌ =
⨆ s : Finset I, eLpNorm (fun x => vectorNorm (fun i : s => u i x)) (ENNReal.ofReal p) ΞΌ := by
classical
let F : Finset I β†’ X β†’ ℝβ‰₯0∞ := fun s x =>
(βˆ‘ i ∈ s, β€–u i xβ€–β‚‘ ^ (2 : ℝ)) ^ (1 / 2 : ℝ)
have hF (s : Finset I) : Measurable (F s) :=
(Finset.measurable_sum s (fun i _ => (hu i).enorm.pow_const (2 : ℝ))).pow_const _
have hd : Directed (Β· ≀ Β·) F := by
intro s t
refine ⟨s βˆͺ t, ?_, ?_⟩
Β· intro x
exact ENNReal.rpow_le_rpow (Finset.sum_le_sum_of_subset Finset.subset_union_left) (by norm_num)
Β· intro x
exact ENNReal.rpow_le_rpow (Finset.sum_le_sum_of_subset Finset.subset_union_right) (by norm_num)
have he : countableSquareNorm u = fun x => ⨆ s, F s x := by
funext x
unfold countableSquareNorm
rw [ENNReal.tsum_eq_iSup_sum]
exact (ENNReal.orderIsoRpow (1 / 2) (by norm_num)).map_iSup _
rw [he, ennreal_eLpNorm_iSup_directed hF hd hp]
congr 1
funext s
have hs : F s = fun x => ENNReal.ofReal (vectorNorm (fun i : s => u i x)) := by
funext x
exact finite_square_eq_vectorNorm s (fun i => u i x)
rw [hs, eLpNorm_ofReal_eq ΞΌ (measurable_vectorNorm _ (fun i : s => hu i))
(fun x => vectorNorm_nonneg _)]
theorem countableSquareNorm_bound {X I H : Type*} [MeasurableSpace X] [Countable I]
[NormedAddCommGroup H] [MeasurableSpace H] [BorelSpace H]
{ΞΌ : Measure X} (u : I β†’ X β†’ H) (hu : βˆ€ i, Measurable (u i))
{p : ℝ} (hp : 0 < p) {B : ℝβ‰₯0∞}
(hb : βˆ€ s : Finset I,
eLpNorm (fun x => vectorNorm (fun i : s => u i x)) (ENNReal.ofReal p) ΞΌ ≀ B) :
eLpNorm (countableSquareNorm u) (ENNReal.ofReal p) ΞΌ ≀ B := by
rw [eLpNorm_countableSquareNorm u hu hp]
exact iSup_le hb
end OAI.Analysis.Fourier.SquareFunction