math / data /lean /OAI /Probability /FreeIsing /Brownian /ContinuousCross.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
10.8 kB
import OAI.Probability.FreeIsing.Brownian.ArrayFiltrationIntegral
import OAI.Probability.FreeIsing.Brownian.IntegralHorizon
import OAI.Probability.FreeIsing.Estimates.CompensatedSquareLimit
import OAI.Probability.FreeIsing.Stochastic.StoppedBrownianCross
namespace OAI
noncomputable section
open MeasureTheory ProbabilityTheory Filter
open scoped NNReal Topology
namespace Problem367.BrownianContinuousCross
variable {Ξ© : Type*} [mΞ© : MeasurableSpace Ξ©] {P : Measure Ξ©}
theorem tendsto_eLpNorm_mul_sub {N : Type*} {l : Filter N}
{f g : N β†’ Ξ© β†’ ℝ} {u v : Ξ© β†’ ℝ}
(hf : βˆ€ n, MemLp (f n) 2 P) (hg : βˆ€ n, MemLp (g n) 2 P)
(hu : MemLp u 2 P) (hv : MemLp v 2 P)
(hfu : Tendsto (fun n => eLpNorm (f n - u) 2 P) l (𝓝 0))
(hgv : Tendsto (fun n => eLpNorm (g n - v) 2 P) l (𝓝 0)) :
Tendsto (fun n => eLpNorm (f n * g n - u * v) 1 P) l (𝓝 0) := by
let M : Lp ℝ 2 P β†’L[ℝ] Lp ℝ 2 P β†’L[ℝ] Lp ℝ 1 P :=
ContinuousLinearMap.holderL P 2 2 1 (ContinuousLinearMap.mul ℝ ℝ)
have hmul {a b : Ξ© β†’ ℝ} (ha : MemLp a 2 P) (hb : MemLp b 2 P) :
M (ha.toLp a) (hb.toLp b) = (memLp_one_iff_integrable.mpr (ha.integrable_mul hb)).toLp (a * b) := by
apply Lp.ext
have hm := (ContinuousLinearMap.mul ℝ ℝ).coeFn_holder (r := 1)
(ha.toLp a) (hb.toLp b)
filter_upwards [hm, ha.coeFn_toLp, hb.coeFn_toLp,
(memLp_one_iff_integrable.mpr (ha.integrable_mul hb)).coeFn_toLp] with ω hm hωa hωb hab
change M (ha.toLp a) (hb.toLp b) Ο‰ = (ha.toLp a) Ο‰ * (hb.toLp b) Ο‰ at hm
rw [hωa, hωb] at hm
exact hm.trans hab.symm
have hfLp := (Lp.tendsto_Lp_iff_tendsto_eLpNorm'' f hf u hu).mpr hfu
have hgLp := (Lp.tendsto_Lp_iff_tendsto_eLpNorm'' g hg v hv).mpr hgv
have h := (M.continuousβ‚‚.tendsto (hu.toLp u, hv.toLp v)).comp
(hfLp.prodMk_nhds hgLp)
change Tendsto (fun n => M ((hf n).toLp (f n)) ((hg n).toLp (g n))) l
(𝓝 (M (hu.toLp u) (hv.toLp v))) at h
simp only [hmul] at h
exact (Lp.tendsto_Lp_iff_tendsto_eLpNorm'' (fun n => f n * g n)
(fun n => (memLp_one_iff_integrable.mpr ((hf n).integrable_mul (hg n)))) (u * v)
(memLp_one_iff_integrable.mpr (hu.integrable_mul hv))).mp h
theorem condExp_ae_eq_of_L1_limits
{ΞΉ N : Type*} [LinearOrder ΞΉ] [IsFiniteMeasure P]
{F : Filtration ΞΉ mΞ©} {l : Filter N} [l.NeBot]
{X : N β†’ ΞΉ β†’ Ξ© β†’ ℝ} (hX : βˆ€ n, Martingale (X n) F P)
{s t : ΞΉ} (hst : s ≀ t) {u v : Ξ© β†’ ℝ}
(hu : StronglyMeasurable[F s] u) (hui : Integrable u P) (hvi : Integrable v P)
(hs : Tendsto (fun n => eLpNorm (X n s - u) 1 P) l (𝓝 0))
(ht : Tendsto (fun n => eLpNorm (X n t - v) 1 P) l (𝓝 0)) :
P[v | F s] =ᡐ[P] u := by
apply (ae_eq_condExp_of_forall_setIntegral_eq (F.le s) hvi
(fun A hA _ => hui.integrableOn) ?_ hu.aestronglyMeasurable).symm
intro A hA hAfin
have hs' := tendsto_setIntegral_of_L1' u
(Eventually.of_forall (fun n => (hX n).integrable s)) hs A
have ht' := tendsto_setIntegral_of_L1' v
(Eventually.of_forall (fun n => (hX n).integrable t)) ht A
have heq : (fun n => ∫ Ο‰ in A, X n s Ο‰ βˆ‚P) =
(fun n => ∫ Ο‰ in A, X n t Ο‰ βˆ‚P) :=
funext fun n => (hX n).setIntegral_eq hst hA
rw [heq] at hs'
exact tendsto_nhds_unique hs' ht'
theorem global_uniform_limits_product_martingale
{B C H G I J : ℝβ‰₯0 β†’ Ξ© β†’ ℝ} {F : Filtration ℝβ‰₯0 mΞ©}
(hB : IsPreBrownianReal B P) (hC : IsPreBrownianReal C P)
(hAdB : StronglyAdapted F B) (hAdC : StronglyAdapted F C)
(hpair : βˆ€ s t, s ≀ t β†’ Indep (MeasurableSpace.comap
(fun Ο‰ => (B t Ο‰ - B s Ο‰, C t Ο‰ - C s Ο‰)) inferInstance) (F s) P)
(hind : βˆ€ s t, s ≀ t β†’
IndepFun (fun Ο‰ => B t Ο‰ - B s Ο‰) (fun Ο‰ => C t Ο‰ - C s Ο‰) P)
(hH : StronglyAdapted F H) (hG : StronglyAdapted F G)
{K L : ℝ} (hboundH : βˆ€α΅ Ο‰ βˆ‚P, βˆ€ t, β€–H t Ο‰β€– ≀ K)
(hboundG : βˆ€α΅ Ο‰ βˆ‚P, βˆ€ t, β€–G t Ο‰β€– ≀ L)
(hI : StronglyAdapted F I) (hJ : StronglyAdapted F J)
(hI2 : βˆ€ t, MemLp (I t) 2 P) (hJ2 : βˆ€ t, MemLp (J t) 2 P)
(hlimI : βˆ€ (N : β„•), 0 < N β†’ βˆ€ t ≀ (N : ℝβ‰₯0),
Tendsto (fun n => ∫ Ο‰,
(BrownianIntegralProcess.stoppedUniformSum B H N n t Ο‰ - I t Ο‰) ^ 2 βˆ‚P)
atTop (𝓝 0))
(hlimJ : βˆ€ (N : β„•), 0 < N β†’ βˆ€ t ≀ (N : ℝβ‰₯0),
Tendsto (fun n => ∫ Ο‰,
(BrownianIntegralProcess.stoppedUniformSum C G N n t Ο‰ - J t Ο‰) ^ 2 βˆ‚P)
atTop (𝓝 0)) :
Martingale (fun t Ο‰ => I t Ο‰ * J t Ο‰) F P := by
let : IsProbabilityMeasure P := hB.isGaussianProcess.isProbabilityMeasure
have hB2 (t : ℝβ‰₯0) := (hB.isGaussianProcess.hasGaussianLaw_eval t).memLp_two
have hC2 (t : ℝβ‰₯0) := (hC.isGaussianProcess.hasGaussianLaw_eval t).memLp_two
have hBH (t : ℝβ‰₯0) : βˆ€α΅ Ο‰ βˆ‚P, β€–H t Ο‰β€– ≀ K := hboundH.mono fun Ο‰ hΟ‰ => hΟ‰ t
have hCG (t : ℝβ‰₯0) : βˆ€α΅ Ο‰ βˆ‚P, β€–G t Ο‰β€– ≀ L := hboundG.mono fun Ο‰ hΟ‰ => hΟ‰ t
refine ⟨fun t => (hI t).mul (hJ t), ?_⟩
intro s t hst
obtain ⟨N, hN⟩ := exists_nat_ge t
have htN : t ≀ ((N + 1 : β„•) : ℝβ‰₯0) :=
hN.trans (by exact_mod_cast Nat.le_succ N)
let X := fun n => BrownianIntegralProcess.stoppedUniformSum B H ((N + 1 : β„•) : ℝβ‰₯0) n
let Y := fun n => BrownianIntegralProcess.stoppedUniformSum C G ((N + 1 : β„•) : ℝβ‰₯0) n
have hX2 (n : β„•) (r : ℝβ‰₯0) : MemLp (X n r) 2 P := by
apply memLp_finsetSum (Finset.range n)
intro i hi
exact StoppedBrownianCross.intervalSum_memLp_two_of_bounded hB2
(hH _) (hBH _) r
have hY2 (n : β„•) (r : ℝβ‰₯0) : MemLp (Y n r) 2 P := by
apply memLp_finsetSum (Finset.range n)
intro i hi
exact StoppedBrownianCross.intervalSum_memLp_two_of_bounded hC2
(hG _) (hCG _) r
have hM (n : β„•) : Martingale (fun r Ο‰ => X n r Ο‰ * Y n r Ο‰) F P :=
StoppedBrownianCross.stopped_brownian_sum_product_martingale hB hC hAdB hAdC
hpair hind (BrownianGrid.uniformGrid ((N + 1 : β„•) : ℝβ‰₯0) n) (BrownianGrid.uniformGrid_mono _ _)
(fun i => H (BrownianGrid.uniformGrid ((N + 1 : β„•) : ℝβ‰₯0) n i))
(fun i => G (BrownianGrid.uniformGrid ((N + 1 : β„•) : ℝβ‰₯0) n i))
(fun i => hH _) (fun i => hG _) (fun _ => K) (fun _ => L)
(fun i => hBH _) (fun i => hCG _) n
have hprod (r : ℝβ‰₯0) (hr : r ≀ ((N + 1 : β„•) : ℝβ‰₯0)) :
Tendsto (fun n => eLpNorm (X n r * Y n r - I r * J r) 1 P) atTop (𝓝 0) :=
tendsto_eLpNorm_mul_sub (fun n => hX2 n r) (fun n => hY2 n r) (hI2 r) (hJ2 r)
(CompensatedSquareLimit.tendsto_eLpNorm_two_of_meanSquare
(fun n => hX2 n r) (hI2 r) (hlimI (N + 1) (Nat.succ_pos N) r hr))
(CompensatedSquareLimit.tendsto_eLpNorm_two_of_meanSquare
(fun n => hY2 n r) (hJ2 r) (hlimJ (N + 1) (Nat.succ_pos N) r hr))
exact condExp_ae_eq_of_L1_limits hM hst ((hI s).mul (hJ s))
((hI2 s).integrable_mul (hJ2 s)) ((hI2 t).integrable_mul (hJ2 t))
(hprod s (hst.trans htN)) (hprod t htN)
end Problem367.BrownianContinuousCross
namespace Problem367.BrownianArrayFiltration
variable {Ξ© ΞΉ : Type*} [mΞ© : MeasurableSpace Ξ©] {P : Measure Ξ©}
{B H I : ΞΉ β†’ ℝβ‰₯0 β†’ Ξ© β†’ ℝ} {F : Filtration ℝβ‰₯0 mΞ©}
theorem global_uniform_limits_pairwise_product_martingale
(hB : βˆ€ a, IsPreBrownianReal (B a) P)
(hAd : βˆ€ a, StronglyAdapted F (B a))
(hpast : βˆ€ s t, s ≀ t β†’ Indep (MeasurableSpace.comap
(fun Ο‰ a => B a t Ο‰ - B a s Ο‰) inferInstance) (F s) P)
(hind : βˆ€ s t, s ≀ t β†’ Pairwise fun a b =>
IndepFun (fun Ο‰ => B a t Ο‰ - B a s Ο‰) (fun Ο‰ => B b t Ο‰ - B b s Ο‰) P)
(hH : βˆ€ a, StronglyAdapted F (H a))
{K : ΞΉ β†’ ℝ} (hbound : βˆ€ a, βˆ€α΅ Ο‰ βˆ‚P, βˆ€ t, β€–H a t Ο‰β€– ≀ K a)
(hI : βˆ€ a, StronglyAdapted F (I a))
(hI2 : βˆ€ a t, MemLp (I a t) 2 P)
(hlim : βˆ€ 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)) :
Pairwise fun a b => Martingale (fun t Ο‰ => I a t Ο‰ * I b t Ο‰) F P := by
intro a b hab
apply BrownianContinuousCross.global_uniform_limits_product_martingale
(hB a) (hB b) (hAd a) (hAd b) ?_ (fun s t hst => hind s t hst hab)
(hH a) (hH b) (hbound a) (hbound b) (hI a) (hI b) (hI2 a) (hI2 b)
(hlim a) (hlim b)
intro s t hst
apply indep_of_indep_of_le_left (hpast s t hst)
have hm : Measurable[MeasurableSpace.comap
(fun Ο‰ c => B c t Ο‰ - B c s Ο‰) inferInstance]
(fun Ο‰ c => B c t Ο‰ - B c s Ο‰) := measurable_iff_comap_le.mpr le_rfl
exact (((measurable_pi_apply a).comp hm).prodMk
((measurable_pi_apply b).comp hm)).comap_le
theorem exists_global_continuous_channel_integrals
(hB : βˆ€ a, IsPreBrownianReal (B a) P)
(hAd : βˆ€ a, StronglyAdapted F (B a))
(hpast : βˆ€ s t, s ≀ t β†’ Indep (MeasurableSpace.comap
(fun Ο‰ a => B a t Ο‰ - B a s Ο‰) inferInstance) (F s) P)
(hind : βˆ€ 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 Ο‰))
(hH : βˆ€ a, StronglyAdapted F (H a))
(hHc : βˆ€ a, βˆ€α΅ Ο‰ βˆ‚P, Continuous (fun t => H a t Ο‰))
{K : ΞΉ β†’ ℝ} (hK : βˆ€ a, 0 ≀ K a)
(hbound : βˆ€ a, βˆ€α΅ Ο‰ βˆ‚P, βˆ€ t, |H a t Ο‰| ≀ K a) :
βˆƒ I : ΞΉ β†’ ℝβ‰₯0 β†’ Ξ© β†’ ℝ,
(βˆ€ a, IsStronglyPredictable F (I a)) ∧
(βˆ€ a, Martingale (I a) F P) ∧
(βˆ€ a, βˆ€α΅ Ο‰ βˆ‚P, Continuous (fun t => I a t Ο‰)) ∧
(βˆ€ a t, MemLp (I a t) 2 P) ∧
(βˆ€ a, I a 0 =ᡐ[P] 0) ∧
(βˆ€ a t, (∫ Ο‰, I a t Ο‰ βˆ‚P) = 0) ∧
(βˆ€ a t, (∫ Ο‰, (I a t Ο‰) ^ 2 βˆ‚P) =
∫ s in (0 : ℝ)..(t : ℝ), ∫ Ο‰, (H a s.toNNReal Ο‰) ^ 2 βˆ‚P) ∧
(βˆ€ 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)) ∧
(Pairwise fun a b => Martingale (fun t Ο‰ => I a t Ο‰ * I b t Ο‰) F P) := by
have hex (a : ΞΉ) := BrownianIntegralProcess.exists_global_continuous_uniform_integral
(hB a) (hAd a)
(fun s t hst => coordinate_increment_indep_past (hpast s t hst) a)
(hBc a) (hH a) (hHc a) (hK a) (hbound a)
choose I hIp hIM hIc hI2 hIz hImean hIiso hIlim using hex
refine ⟨I, hIp, hIM, hIc, hI2, hIz, hImean, hIiso, hIlim, ?_⟩
exact global_uniform_limits_pairwise_product_martingale hB hAd hpast hind hH
(by simpa only [Real.norm_eq_abs] using hbound)
(fun a => (hIM a).stronglyAdapted) hI2 hIlim
end Problem367.BrownianArrayFiltration
end
end OAI