math / data /lean /OAI /Probability /FreeIsing /Brownian /ContinuousSpatialIntegral.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
9.68 kB
import OAI.Probability.FreeIsing.Brownian.ArrayFiltrationIntegral
import OAI.Probability.FreeIsing.Brownian.IntegralHorizon
import OAI.Probability.FreeIsing.Martingales.SpatialLimit
namespace OAI
noncomputable section
open MeasureTheory ProbabilityTheory Filter
open scoped NNReal Topology
namespace Problem367.BrownianArrayFiltration
variable {Ξ© ΞΉ : Type*} [mΞ© : MeasurableSpace Ξ©] {P : Measure Ξ©}
{B : ΞΉ β†’ ℝβ‰₯0 β†’ Ξ© β†’ ℝ} {F : Filtration ℝβ‰₯0 mΞ©}
theorem stopped_grid_sums_orthogonal [IsProbabilityMeasure P]
(hB : βˆ€ a, IsPreBrownianReal (B a) P)
(hAd : βˆ€ a, StronglyAdapted F (B a))
(hind : βˆ€ s t, s ≀ t β†’ Indep
(MeasurableSpace.comap (fun Ο‰ a => B a t Ο‰ - B a s Ο‰) inferInstance) (F s) P)
(hcross : βˆ€ s t, s ≀ t β†’ Pairwise fun a b =>
IndepFun (fun Ο‰ => B a t Ο‰ - B a s Ο‰) (fun Ο‰ => B b t Ο‰ - B b s Ο‰) P)
(Ο„ : β„• β†’ ℝβ‰₯0) (hΟ„ : Monotone Ο„) (H : ΞΉ β†’ β„• β†’ Ξ© β†’ ℝ)
(hH : βˆ€ a i, StronglyMeasurable[F (Ο„ i)] (H a i))
(hH2 : βˆ€ a i, MemLp (H a i) 2 P)
{a b : ΞΉ} (hab : a β‰  b) (u v : Finset β„•) (t : ℝβ‰₯0) :
(∫ Ο‰,
(βˆ‘ i ∈ u, StoppedSimpleIntegral.intervalSum (B a) (H a i) (Ο„ i) (Ο„ (i + 1)) t Ο‰) *
(βˆ‘ i ∈ v, StoppedSimpleIntegral.intervalSum (B b) (H b i) (Ο„ i) (Ο„ (i + 1)) t Ο‰)
βˆ‚P) = 0 := by
classical
let Οƒ : β„• β†’ ℝβ‰₯0 := fun i => min t (Ο„ i)
let G : ΞΉ β†’ β„• β†’ Ξ© β†’ ℝ := fun a i => if Ο„ i ≀ t then H a i else 0
have hσ : Monotone σ := fun i j hij => min_le_min_left t (hτ hij)
have hG (a : ΞΉ) (i : β„•) : StronglyMeasurable[F (Οƒ i)] (G a i) := by
change StronglyMeasurable[F (min t (Ο„ i))] (if Ο„ i ≀ t then H a i else 0)
by_cases hi : Ο„ i ≀ t
Β· rw [ite_eq_left hi, min_eq_right hi]
exact hH a i
Β· rw [ite_eq_right hi]
exact stronglyMeasurable_zero
have hG2 (a : ΞΉ) (i : β„•) : MemLp (G a i) 2 P := by
by_cases hi : Ο„ i ≀ t
Β· simpa only [G, ite_eq_left hi] using hH2 a i
Β· simp only [G, ite_eq_right hi]
exact MemLp.zero
have hterm (a : ΞΉ) (i : β„•) (Ο‰ : Ξ©) :
StoppedSimpleIntegral.intervalSum (B a) (H a i) (Ο„ i) (Ο„ (i + 1)) t Ο‰ =
G a i Ο‰ * (B a (Οƒ (i + 1)) Ο‰ - B a (Οƒ i) Ο‰) := by
by_cases hi : Ο„ i ≀ t
Β· simp only [G, ite_eq_left hi, Οƒ, StoppedSimpleIntegral.intervalSum]
Β· have hti : t ≀ Ο„ i := le_of_not_ge hi
have hti' : t ≀ Ο„ (i + 1) := hti.trans (hΟ„ (Nat.le_succ i))
simp only [G, ite_eq_right hi, Οƒ, StoppedSimpleIntegral.intervalSum,
min_eq_left hti, min_eq_left hti', sub_self, mul_zero, Pi.zero_apply]
simp_rw [hterm]
exact grid_sums_orthogonal hB hAd hind hcross σ hσ G hG hG2 hab u v
theorem stopped_uniform_limits_orthogonal [IsProbabilityMeasure P]
(hB : βˆ€ a, IsPreBrownianReal (B a) P)
(hAd : βˆ€ a, StronglyAdapted F (B a))
(hind : βˆ€ s t, s ≀ t β†’ Indep
(MeasurableSpace.comap (fun Ο‰ a => B a t Ο‰ - B a s Ο‰) inferInstance) (F s) P)
(hcross : βˆ€ s t, s ≀ t β†’ Pairwise fun a b =>
IndepFun (fun Ο‰ => B a t Ο‰ - B a s Ο‰) (fun Ο‰ => B b t Ο‰ - B b s Ο‰) P)
{H : ΞΉ β†’ ℝβ‰₯0 β†’ Ξ© β†’ ℝ} (hH : βˆ€ a, StronglyAdapted F (H a))
(hH2 : βˆ€ a t, MemLp (H a t) 2 P) (T t : ℝβ‰₯0)
{I : ΞΉ β†’ Ξ© β†’ ℝ} (hI2 : βˆ€ a, MemLp (I a) 2 P)
(hlim : βˆ€ a, Tendsto (fun n => ∫ Ο‰,
(BrownianIntegralProcess.stoppedUniformSum (B a) (H a) T n t Ο‰ - I a Ο‰) ^ 2 βˆ‚P)
atTop (𝓝 0)) :
Pairwise (fun a b => ∫ Ο‰, I a Ο‰ * I b Ο‰ βˆ‚P = 0) := by
have hi (a : ΞΉ) (s t : ℝβ‰₯0) (hst : s ≀ t) :
Indep (MeasurableSpace.comap (fun Ο‰ => B a t Ο‰ - B a s Ο‰) inferInstance) (F s) P :=
coordinate_increment_indep_past (hind s t hst) a
have hS2 (a : ΞΉ) (n : β„•) :
MemLp (BrownianIntegralProcess.stoppedUniformSum (B a) (H a) T n t) 2 P :=
BrownianFiltration.stopped_predictable_sum_memLp_two (hB a) (hi a)
(BrownianGrid.uniformGrid T n) (BrownianGrid.uniformGrid_mono T n)
(fun i => H a (BrownianGrid.uniformGrid T n i)) (fun i => hH a _) (fun i => hH2 a _)
(Finset.range n) t
have hLp (a : ΞΉ) := BrownianIntegralProcess.L2_tendsto_of_integral_sq_sub_tendsto
(hS2 a) (hI2 a) (hlim a)
intro a b hab
have hinner := (hLp a).inner (π•œ := ℝ) (hLp b)
have hz (n : β„•) : inner ℝ
((hS2 a n).toLp (BrownianIntegralProcess.stoppedUniformSum (B a) (H a) T n t))
((hS2 b n).toLp (BrownianIntegralProcess.stoppedUniformSum (B b) (H b) T n t)) = 0 := by
rw [PredictableL2.inner_toLp]
exact stopped_grid_sums_orthogonal hB hAd hind hcross
(BrownianGrid.uniformGrid T n) (BrownianGrid.uniformGrid_mono T n)
(fun a i => H a (BrownianGrid.uniformGrid T n i))
(fun a i => hH a _) (fun a i => hH2 a _) hab (Finset.range n) (Finset.range n) t
have heq : inner ℝ ((hI2 a).toLp (I a)) ((hI2 b).toLp (I b)) = 0 :=
tendsto_nhds_unique hinner (by simpa only [hz] using
(tendsto_const_nhds : Tendsto (fun _ : β„• => (0 : ℝ)) atTop (𝓝 0)))
simpa only [PredictableL2.inner_toLp] using heq
theorem exists_global_continuous_spatial_integral [Countable ΞΉ] [IsProbabilityMeasure P]
(hB : βˆ€ a, IsPreBrownianReal (B a) P)
(hAd : βˆ€ a, StronglyAdapted F (B a))
(hind : βˆ€ s t, s ≀ t β†’ Indep
(MeasurableSpace.comap (fun Ο‰ a => B a t Ο‰ - B a s Ο‰) inferInstance) (F s) P)
(hcross : βˆ€ s t, s ≀ t β†’ Pairwise fun a b =>
IndepFun (fun Ο‰ => B a t Ο‰ - B a s Ο‰) (fun Ο‰ => B b t Ο‰ - B b s Ο‰) P)
(hBc : βˆ€ a, βˆ€α΅ Ο‰ βˆ‚P, Continuous (fun t => B a t Ο‰))
(H : ΞΉ β†’ ℝβ‰₯0 β†’ Ξ© β†’ ℝ) (hH : βˆ€ a, StronglyAdapted F (H a))
(hc : βˆ€ a, βˆ€α΅ Ο‰ βˆ‚P, Continuous (fun t => H a t Ο‰))
(C : ΞΉ β†’ ℝ) (hC : βˆ€ a, 0 ≀ C a)
(hb : βˆ€ a, βˆ€α΅ Ο‰ βˆ‚P, βˆ€ t, |H a t Ο‰| ≀ C a)
(henergy : βˆ€ N : β„•, Summable (fun a =>
∫ s in (0 : ℝ)..(N : ℝ), ∫ Ο‰, H a s.toNNReal Ο‰ ^ 2 βˆ‚P)) :
βˆƒ (I : ΞΉ β†’ ℝβ‰₯0 β†’ Ξ© β†’ ℝ) (Y : ℝβ‰₯0 β†’ Ξ© β†’ ℝ)
(hI2 : βˆ€ a t, MemLp (I a t) 2 P) (hY2 : βˆ€ t, MemLp (Y t) 2 P),
(βˆ€ a, IsStronglyPredictable F (I a) ∧ Martingale (I a) F P ∧
(βˆ€α΅ Ο‰ βˆ‚P, Continuous (fun t => I a t Ο‰))) ∧
(βˆ€ a (N : β„•), 0 < N β†’ βˆ€ t ≀ (N : ℝβ‰₯0),
Tendsto (fun n => ∫ Ο‰,
(BrownianIntegralProcess.stoppedUniformSum (B a) (H a) N n t Ο‰ - I a t Ο‰) ^ 2 βˆ‚P)
atTop (𝓝 0)) ∧
IsStronglyPredictable F Y ∧ Martingale Y F P ∧
(βˆ€α΅ Ο‰ βˆ‚P, Continuous (fun t => Y t Ο‰)) ∧ Y 0 =ᡐ[P] 0 ∧
(βˆ€ t, (∫ Ο‰, Y t Ο‰ βˆ‚P) = 0) ∧
(βˆ€ t, (∫ Ο‰, Y t Ο‰ ^ 2 βˆ‚P) =
βˆ‘' a, ∫ s in (0 : ℝ)..(t : ℝ), ∫ Ο‰, H a s.toNNReal Ο‰ ^ 2 βˆ‚P) ∧
(βˆ€ t, HasSum (fun a => (hI2 a t).toLp (I a t)) ((hY2 t).toLp (Y t))) ∧
(βˆ€ T : ℝβ‰₯0, Tendsto (fun q : Finset ΞΉ =>
∫ Ο‰, MartingaleStrongMaximal.maximalSquare
(MartingaleSpatialLimit.finiteSum I q - Y) T Ο‰ βˆ‚P) atTop (𝓝 0)) := by
have hi (a : ΞΉ) (s t : ℝβ‰₯0) (hst : s ≀ t) :
Indep (MeasurableSpace.comap (fun Ο‰ => B a t Ο‰ - B a s Ο‰) inferInstance) (F s) P :=
coordinate_increment_indep_past (hind s t hst) a
have hH2 (a : ΞΉ) (t : ℝβ‰₯0) : MemLp (H a t) 2 P := by
apply MemLp.of_bound ((hH a t).mono (F.le t)).aestronglyMeasurable (C a)
filter_upwards [hb a] with ω hω
simpa only [Real.norm_eq_abs] using hω t
have hex (a : ΞΉ) := BrownianIntegralProcess.exists_global_continuous_uniform_integral
(hB a) (hAd a) (hi a) (hBc a) (hH a) (hc a) (hC a) (hb a)
choose I hIp hIM hIc hI2 hIz hImean hIiso hIlim using hex
have horth (t : ℝβ‰₯0) : Pairwise (fun a b => ∫ Ο‰, I a t Ο‰ * I b t Ο‰ βˆ‚P = 0) := by
obtain ⟨N, hN⟩ := exists_nat_ge t
have ht : t ≀ ((N + 1 : β„•) : ℝβ‰₯0) :=
hN.trans (by exact_mod_cast Nat.le_succ N)
exact stopped_uniform_limits_orthogonal hB hAd hind hcross hH hH2
((N + 1 : β„•) : ℝβ‰₯0) t (fun a => hI2 a t)
(fun a => hIlim a (N + 1) (Nat.succ_pos N) t ht)
have hIenergy (N : β„•) : Summable (fun a => ∫ Ο‰, I a (N : ℝβ‰₯0) Ο‰ ^ 2 βˆ‚P) := by
simpa only [hIiso, NNReal.coe_natCast] using henergy N
obtain ⟨Y, hY2, hYp, hYM, hYc, hYsum, hYmax⟩ :=
MartingaleSpatialLimit.exists_continuous_martingale_sum hIM hI2 hIc horth hIenergy
have hYiso (t : ℝβ‰₯0) : (∫ Ο‰, Y t Ο‰ ^ 2 βˆ‚P) =
βˆ‘' a, ∫ s in (0 : ℝ)..(t : ℝ), ∫ Ο‰, H a s.toNNReal Ο‰ ^ 2 βˆ‚P := by
have he := MartingaleSpatialLimit.summable_energy_of_integer hIM hI2 hIenergy t
have hinner : Pairwise (fun a b => inner ℝ
((hI2 a t).toLp (I a t)) ((hI2 b t).toLp (I b t)) = 0) := by
intro a b hab
simpa only [PredictableL2.inner_toLp] using horth t hab
have hn := PredictableL2.norm_tsum_sq_of_orthogonal
(fun a => (hI2 a t).toLp (I a t)) hinner
(by simpa only [PredictableL2.norm_toLp_sq] using he)
rw [(hYsum t).tsum_eq] at hn
simpa only [PredictableL2.norm_toLp_sq, hIiso] using hn
have hYzero : Y 0 =ᡐ[P] 0 := by
apply ae_eq_of_integral_sq_sub_eq_zero
Β· simpa only [Pi.zero_apply, sub_zero] using (hY2 0).integrable_sq
Β· simpa only [Pi.zero_apply, sub_zero, NNReal.coe_zero,
intervalIntegral.integral_same, tsum_zero] using hYiso 0
exact ⟨I, Y, hI2, hY2, (fun a => ⟨hIp a, hIM a, hIc a⟩), hIlim,
hYp, hYM, hYc, hYzero,
(fun t => PredictableL2.integral_eq_zero_of_hasSum
(fun a => I a t) (fun a => hI2 a t) (hY2 t) (hYsum t) (fun a => hImean a t)),
hYiso, hYsum, hYmax⟩
end Problem367.BrownianArrayFiltration
end
end OAI