math / data /lean /OAI /Probability /FreeIsing /Brownian /ArrayFiltrationIntegral.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
12 kB
import OAI.Probability.FreeIsing.Brownian.ArrayIntegralCompletion
namespace OAI
noncomputable section
open MeasureTheory ProbabilityTheory Filter
open scoped NNReal Topology BigOperators
namespace Problem367.BrownianArrayFiltration
variable {Ξ© ΞΉ : Type*} [mΞ© : MeasurableSpace Ξ©] {P : Measure Ξ©}
{B : ΞΉ β†’ ℝβ‰₯0 β†’ Ξ© β†’ ℝ} {F : Filtration ℝβ‰₯0 mΞ©}
theorem coordinate_increment_indep_past {s t : ℝβ‰₯0}
(hind : Indep
(MeasurableSpace.comap (fun Ο‰ a => B a t Ο‰ - B a s Ο‰) inferInstance) (F s) P)
(a : ΞΉ) :
Indep (MeasurableSpace.comap (fun Ο‰ => B a t Ο‰ - B a s Ο‰) inferInstance)
(F s) P := by
have hm : Measurable[
MeasurableSpace.comap (fun Ο‰ a => B a t Ο‰ - B a s Ο‰) inferInstance]
(fun Ο‰ => B a t Ο‰ - B a s Ο‰) :=
(measurable_pi_apply a).comp (show Measurable[
MeasurableSpace.comap (fun Ο‰ a => B a t Ο‰ - B a s Ο‰) inferInstance]
(fun Ο‰ a => B a t Ο‰ - B a s Ο‰) from measurable_iff_comap_le.mpr le_rfl)
exact indep_of_indep_of_le_left hind hm.comap_le
theorem coefficients_indep_increments {s t : ℝβ‰₯0}
(hind : Indep
(MeasurableSpace.comap (fun Ο‰ a => B a t Ο‰ - B a s Ο‰) inferInstance) (F s) P)
{H : ΞΉ β†’ Ξ© β†’ ℝ} (hH : βˆ€ a, StronglyMeasurable[F s] (H a)) :
IndepFun (fun Ο‰ a => H a Ο‰) (fun Ο‰ a => B a t Ο‰ - B a s Ο‰) P := by
have hm : Measurable[F s] (fun Ο‰ a => H a Ο‰) := by
let : MeasurableSpace Ξ© := F s
exact Measurable.of_eval fun a => (hH a).measurable
exact indep_of_indep_of_le_left hind.symm hm.comap_le
theorem grid_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)
(t : β„• β†’ ℝβ‰₯0) (ht : Monotone t) (H : ΞΉ β†’ β„• β†’ Ξ© β†’ ℝ)
(hH : βˆ€ a k, StronglyMeasurable[F (t k)] (H a k))
(hH2 : βˆ€ a k, MemLp (H a k) 2 P) :
Pairwise fun p q : ΞΉ Γ— β„• => ∫ Ο‰,
(H p.1 p.2 Ο‰ * (B p.1 (t (p.2 + 1)) Ο‰ - B p.1 (t p.2) Ο‰)) *
(H q.1 q.2 Ο‰ * (B q.1 (t (q.2 + 1)) Ο‰ - B q.1 (t q.2) Ο‰)) βˆ‚P = 0 := by
let G : Filtration β„• mΞ© :=
⟨fun k => F (t k), fun _ _ h => F.mono (ht h), fun k => F.le (t k)⟩
let D : ΞΉ β†’ β„• β†’ Ξ© β†’ ℝ := fun a k Ο‰ => B a (t (k + 1)) Ο‰ - B a (t k) Ο‰
have hD2 (a : ΞΉ) (k : β„•) : MemLp (D a k) 2 P :=
((hB a).isGaussianProcess.hasGaussianLaw_eval (t (k + 1))).memLp_two.sub
((hB a).isGaussianProcess.hasGaussianLaw_eval (t k)).memLp_two
have hi (k : β„•) : IndepFun (fun Ο‰ a => H a k Ο‰) (fun Ο‰ a => D a k Ο‰) P :=
coefficients_indep_increments (hind _ _ (ht (Nat.le_succ k))) (fun a => hH a k)
have hHD (a : ΞΉ) (k : β„•) : MemLp (fun Ο‰ => H a k Ο‰ * D a k Ο‰) 2 P :=
PredictableL2.memLp_two_mul_of_indep
((hi k).comp (measurable_pi_apply a) (measurable_pi_apply a)) (hH2 a k) (hD2 a k)
have hz (a : ΞΉ) (k : β„•) : (∫ Ο‰, D a k Ο‰ βˆ‚P) = 0 := by
change (∫ Ο‰, B a (t (k + 1)) Ο‰ - B a (t k) Ο‰ βˆ‚P) = 0
rw [integral_sub ((hB a).integrable_eval _) ((hB a).integrable_eval _),
(hB a).integral_eval, (hB a).integral_eval, sub_self]
have hnoise (k : β„•) : Pairwise fun a b => ∫ Ο‰, D a k Ο‰ * D b k Ο‰ βˆ‚P = 0 := by
intro a b hab
have heq := (hcross _ _ (ht (Nat.le_succ k)) hab).integral_fun_mul_eq_mul_integral
(hD2 a k).aestronglyMeasurable (hD2 b k).aestronglyMeasurable
change (∫ Ο‰, D a k Ο‰ * D b k Ο‰ βˆ‚P) =
(∫ Ο‰, D a k Ο‰ βˆ‚P) * ∫ Ο‰, D b k Ο‰ βˆ‚P at heq
simpa only [hz, zero_mul] using heq
apply SimpleIntegral.predictable_array_increments_orthogonal G H D hH
Β· intro a k
exact (hAd a (t (k + 1))).sub
((hAd a (t k)).mono (F.mono (ht (Nat.le_succ k))))
Β· exact fun a k => (hD2 a k).integrable (by norm_num)
Β· exact hHD
Β· intro a k
exact BrownianFiltration.increment_condExp_zero (hB a) (hAd a)
(coordinate_increment_indep_past (hind _ _ (ht (Nat.le_succ k))) a)
Β· intro k
exact PredictableL2.weighted_array_orthogonal (hi k) (fun a => hH2 a k)
(fun a => hD2 a k) (hnoise k)
theorem 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)
(t : β„• β†’ ℝβ‰₯0) (ht : Monotone t) (H : ΞΉ β†’ β„• β†’ Ξ© β†’ ℝ)
(hH : βˆ€ a k, StronglyMeasurable[F (t k)] (H a k))
(hH2 : βˆ€ a k, MemLp (H a k) 2 P)
{a b : ΞΉ} (hab : a β‰  b) (u v : Finset β„•) :
(∫ Ο‰, (βˆ‘ k ∈ u, H a k Ο‰ * (B a (t (k + 1)) Ο‰ - B a (t k) Ο‰)) *
(βˆ‘ k ∈ v, H b k Ο‰ * (B b (t (k + 1)) Ο‰ - B b (t k) Ο‰)) βˆ‚P) = 0 := by
have hHD (a : ΞΉ) (k : β„•) : MemLp
(fun Ο‰ => H a k Ο‰ * (B a (t (k + 1)) Ο‰ - B a (t k) Ο‰)) 2 P :=
BrownianFiltration.predictable_mul_memLp_two (hB a)
(coordinate_increment_indep_past (hind _ _ (ht (Nat.le_succ k))) a)
(hH a k) (hH2 a k)
apply SimpleIntegral.integral_mul_sums_eq_zero
(fun k Ο‰ => H a k Ο‰ * (B a (t (k + 1)) Ο‰ - B a (t k) Ο‰))
(fun k Ο‰ => H b k Ο‰ * (B b (t (k + 1)) Ο‰ - B b (t k) Ο‰))
(hHD a) (hHD b) _ u v
intro k l
exact grid_orthogonal hB hAd hind hcross t ht H hH hH2
(show (a, k) β‰  (b, l) from fun h => hab (congrArg Prod.fst h))
theorem exists_channel_integrals [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))
(hc : βˆ€ a, βˆ€α΅ Ο‰ βˆ‚P, Continuous (fun t => H a t Ο‰))
(C : ΞΉ β†’ ℝ) (hC : βˆ€ a, 0 ≀ C a)
(hb : βˆ€ a, βˆ€α΅ Ο‰ βˆ‚P, βˆ€ t, |H a t Ο‰| ≀ C a) (T : ℝβ‰₯0) :
βˆƒ I : ΞΉ β†’ Ξ© β†’ ℝ,
(βˆ€ a, MemLp (I a) 2 P) ∧
(βˆ€ a, StronglyMeasurable (I a)) ∧
(βˆ€ a, AEStronglyMeasurable[F T] (I a) P) ∧
(βˆ€ a, (∫ Ο‰, I a Ο‰ βˆ‚P) = 0) ∧
(βˆ€ a, (∫ Ο‰, I a Ο‰ ^ 2 βˆ‚P) =
∫ t in (0 : ℝ)..(T : ℝ), ∫ Ο‰, H a t.toNNReal Ο‰ ^ 2 βˆ‚P) ∧
(Pairwise fun a b => ∫ Ο‰, I a Ο‰ * I b Ο‰ βˆ‚P = 0) ∧
(βˆ€ a, Tendsto (fun n => ∫ Ο‰,
(BrownianGrid.uniformSum (B a) (H a) T n Ο‰ - I a Ο‰) ^ 2 βˆ‚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 hmH (a : ΞΉ) (t : ℝβ‰₯0) : AEStronglyMeasurable (H a t) P :=
((hH a t).mono (F.le t)).aestronglyMeasurable
have hH2 (a : ΞΉ) (t : ℝβ‰₯0) : MemLp (H a t) 2 P := by
apply MemLp.of_bound (hmH a t) (C a)
filter_upwards [hb a] with ω hω
simpa only [Real.norm_eq_abs] using hω t
have hex (a : ΞΉ) := BrownianFiltrationGrid.exists_uniformSumLp_limit
(hB a) (hAd a) (hi a) (H a) (hH a) (hH2 a) T
(fun _ hΞ΅ => MeanSquareContinuity.uniform_integral_sq_sub_le
(hmH a) (hc a) (hC a) (hb a) T hΞ΅)
choose I hI using hex
have hprop (a : ΞΉ) := BrownianFiltrationGrid.uniformSumLp_limit_terminal_centered
(hB a) (hAd a) (hi a) (H a) (hH a) (hH2 a) T (hI a)
refine ⟨fun a => I a, fun a => Lp.memLp (I a), fun a => Lp.stronglyMeasurable (I a),
fun a => (hprop a).1, fun a => (hprop a).2, ?_, ?_, ?_⟩
Β· intro a
exact BrownianFiltrationGrid.uniformSumLp_limit_isometry
(hB a) (hAd a) (hi a) (H a) (hH a) (hH2 a) (hc a) (hC a) (hb a) T (hI a)
Β· intro a b hab
have hlim := (hI a).inner (π•œ := ℝ) (hI b)
have hz (n : β„•) : inner ℝ
(BrownianFiltrationGrid.uniformSumLp (hB a) (hAd a) (hi a) (H a) (hH a) (hH2 a) T n)
(BrownianFiltrationGrid.uniformSumLp (hB b) (hAd b) (hi b) (H b) (hH b) (hH2 b) T n) = 0 := by
rw [BrownianFiltrationGrid.uniformSumLp, BrownianFiltrationGrid.uniformSumLp,
PredictableL2.inner_toLp]
exact grid_sums_orthogonal hB hAd hind hcross
(BrownianGrid.uniformGrid T n) (BrownianGrid.uniformGrid_mono T n)
(fun a k => H a (BrownianGrid.uniformGrid T n k))
(fun a k => hH a _) (fun a k => hH2 a _) hab (Finset.range n) (Finset.range n)
have heq : inner ℝ (I a) (I b) = 0 :=
tendsto_nhds_unique hlim (by simpa only [hz] using
(tendsto_const_nhds : Tendsto (fun _ : β„• => (0 : ℝ)) atTop (𝓝 0)))
rw [L2.inner_def] at heq
simpa only [Real.inner_apply] using heq
Β· intro a
exact BrownianFiltrationGrid.integral_sq_error_tendsto_of_Lp_tendsto
(hB a) (hAd a) (hi a) (H a) (hH a) (hH2 a) T (hI a)
theorem exists_infinite_integral [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))
(hc : βˆ€ a, βˆ€α΅ Ο‰ βˆ‚P, Continuous (fun t => H a t Ο‰))
(C : ΞΉ β†’ ℝ) (hC : βˆ€ a, 0 ≀ C a)
(hb : βˆ€ a, βˆ€α΅ Ο‰ βˆ‚P, βˆ€ t, |H a t Ο‰| ≀ C a) (T : ℝβ‰₯0)
(henergy : Summable fun a =>
∫ t in (0 : ℝ)..(T : ℝ), ∫ Ο‰, H a t.toNNReal Ο‰ ^ 2 βˆ‚P) :
βˆƒ (I : ΞΉ β†’ Ξ© β†’ ℝ) (Y : Ξ© β†’ ℝ),
(βˆ€ a, MemLp (I a) 2 P) ∧
(βˆ€ a, Tendsto (fun n => ∫ Ο‰,
(BrownianGrid.uniformSum (B a) (H a) T n Ο‰ - I a Ο‰) ^ 2 βˆ‚P) atTop (𝓝 0)) ∧
Measurable Y ∧ AEStronglyMeasurable[F T] Y P ∧ MemLp Y 2 P ∧
(∫ Ο‰, Y Ο‰ βˆ‚P) = 0 ∧
(∫ Ο‰, Y Ο‰ ^ 2 βˆ‚P) =
βˆ‘' a, ∫ t in (0 : ℝ)..(T : ℝ), ∫ Ο‰, H a t.toNNReal Ο‰ ^ 2 βˆ‚P ∧
Tendsto (fun s : Finset ΞΉ => ∫ Ο‰,
((βˆ‘ a ∈ s, I a Ο‰) - Y Ο‰) ^ 2 βˆ‚P) atTop (𝓝 0) := by
obtain ⟨I, hI2, _, hIterm, hz, hiso, horth, happrox⟩ :=
exists_channel_integrals hB hAd hind hcross H hH hc C hC hb T
obtain ⟨Y, hY, hmY, hsY, heY⟩ := PredictableL2.exists_orthogonal_sum I hI2 horth
(by simpa only [hiso] using henergy)
have hsumterm (s : Finset ΞΉ) :
AEStronglyMeasurable[F T] (fun Ο‰ => βˆ‘ a ∈ s, I a Ο‰) P := by
classical
induction s using Finset.induction_on with
| empty => simpa only [Finset.sum_empty] using
(stronglyMeasurable_const.aestronglyMeasurable :
AEStronglyMeasurable[F T] (fun _ : Ξ© => (0 : ℝ)) P)
| @insert a s has ih =>
simpa only [Finset.sum_insert has, Pi.add_def] using (hIterm a).add ih
have htermLp : AEStronglyMeasurable[F T] (hY.toLp Y : Ξ© β†’ ℝ) P := by
apply (isClosed_aestronglyMeasurable (F.le T)).mem_of_tendsto hsY
apply Filter.Eventually.of_forall
intro s
change AEStronglyMeasurable[F T] (↑(βˆ‘ a ∈ s, (hI2 a).toLp (I a)) : Ξ© β†’ ℝ) P
rw [← PredictableL2.toLp_finsetSum I hI2 s]
exact (hsumterm s).congr (MemLp.coeFn_toLp _).symm
have hterminal : AEStronglyMeasurable[F T] Y P := htermLp.congr hY.coeFn_toLp
refine ⟨I, Y, hI2, happrox, hmY, hterminal, hY, ?_, ?_, ?_⟩
Β· exact PredictableL2.integral_eq_zero_of_hasSum I hI2 hY hsY hz
Β· simpa only [hiso] using heY
Β· exact PredictableL2.tendsto_integral_sq_error_of_hasSum I hI2 hY hsY
end Problem367.BrownianArrayFiltration
end
end OAI