math / data /lean /OAI /Probability /FreeIsing /Brownian /ArrayCrossIsometry.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
13.3 kB
import OAI.Probability.FreeIsing.Brownian.ArrayFiltrationIntegral
import OAI.Probability.FreeIsing.Stochastic.IntegralAssociativityLimit
namespace OAI
noncomputable section
open MeasureTheory ProbabilityTheory Filter
open scoped NNReal Topology BigOperators
namespace Problem367
namespace BrownianGrid
theorem uniformSum_sub_coeff {Ξ© : Type*} (B H K : ℝβ‰₯0 β†’ Ξ© β†’ ℝ)
(T : ℝβ‰₯0) (n : β„•) (Ο‰ : Ξ©) :
uniformSum B (fun t Ο‰ => H t Ο‰ - K t Ο‰) T n Ο‰ =
uniformSum B H T n Ο‰ - uniformSum B K T n Ο‰ := by
simp only [uniformSum, integralSum, sub_mul, Finset.sum_sub_distrib]
end BrownianGrid
namespace SimpleIntegral
theorem meanSquare_limit_sub {Ξ© Ξ± : Type*} [MeasurableSpace Ξ©]
{P : Measure Ξ©} {l : Filter Ξ±} {X Y : Ξ± β†’ Ξ© β†’ ℝ} {I J : Ξ© β†’ ℝ}
(hX : βˆ€ a, MemLp (X a) 2 P) (hY : βˆ€ a, MemLp (Y a) 2 P)
(hI : MemLp I 2 P) (hJ : MemLp J 2 P)
(hx : Tendsto (fun a => ∫ Ο‰, (X a Ο‰ - I Ο‰) ^ 2 βˆ‚P) l (𝓝 0))
(hy : Tendsto (fun a => ∫ Ο‰, (Y a Ο‰ - J Ο‰) ^ 2 βˆ‚P) l (𝓝 0)) :
Tendsto (fun a => ∫ Ο‰, ((X a Ο‰ - Y a Ο‰) - (I Ο‰ - J Ο‰)) ^ 2 βˆ‚P)
l (𝓝 0) := by
apply (tendsto_toLp_iff_meanSquare (fun a => (hX a).sub (hY a)) (hI.sub hJ)).mp
change Tendsto (fun a => (hX a).toLp (X a) - (hY a).toLp (Y a)) l
(𝓝 (hI.toLp I - hJ.toLp J))
exact ((tendsto_toLp_iff_meanSquare hX hI).mpr hx).sub
((tendsto_toLp_iff_meanSquare hY hJ).mpr hy)
end SimpleIntegral
namespace BrownianFiltrationGrid
variable {Ξ© : Type*} [mΞ© : MeasurableSpace Ξ©] {P : Measure Ξ©}
{B : ℝβ‰₯0 β†’ Ξ© β†’ ℝ} {F : Filtration ℝβ‰₯0 mΞ©}
theorem uniform_meanSquare_limit_isometry
(hB : IsPreBrownianReal B P) (hAd : StronglyAdapted F B)
(hind : βˆ€ s t, s ≀ t β†’ Indep
(MeasurableSpace.comap (fun Ο‰ => B t Ο‰ - B s Ο‰) inferInstance) (F s) P)
(H : ℝβ‰₯0 β†’ Ξ© β†’ ℝ) (hH : StronglyAdapted F H)
(hc : βˆ€α΅ Ο‰ βˆ‚P, Continuous (fun t => H t Ο‰))
{C : ℝ} (hC : 0 ≀ C) (hb : βˆ€α΅ Ο‰ βˆ‚P, βˆ€ t, |H t Ο‰| ≀ C)
(T : ℝβ‰₯0) {I : Ξ© β†’ ℝ} (hI : MemLp I 2 P)
(happrox : Tendsto (fun n => ∫ Ο‰,
(BrownianGrid.uniformSum B H T n Ο‰ - I Ο‰) ^ 2 βˆ‚P) atTop (𝓝 0)) :
(∫ Ο‰, I Ο‰ ^ 2 βˆ‚P) =
∫ t in (0 : ℝ)..(T : ℝ), ∫ Ο‰, H t.toNNReal Ο‰ ^ 2 βˆ‚P := by
let : IsProbabilityMeasure P := hB.isGaussianProcess.isProbabilityMeasure
have hH2 (t : ℝβ‰₯0) : MemLp (H t) 2 P := by
apply MemLp.of_bound ((hH t).mono (F.le t)).aestronglyMeasurable C
filter_upwards [hb] with ω hω
simpa only [Real.norm_eq_abs] using hω t
have hlim := (SimpleIntegral.tendsto_toLp_iff_meanSquare
(uniformSum_memLp hB hAd hind H hH hH2 T) hI).mpr happrox
have hiso := uniformSumLp_limit_isometry hB hAd hind H hH hH2 hc hC hb T hlim
calc
(∫ Ο‰, I Ο‰ ^ 2 βˆ‚P) = ∫ Ο‰, (hI.toLp I Ο‰) ^ 2 βˆ‚P := by
apply integral_congr_ae
filter_upwards [hI.coeFn_toLp] with ω hω
rw [hω]
_ = _ := hiso
theorem uniform_meanSquare_difference_isometry
(hB : IsPreBrownianReal B P) (hAd : StronglyAdapted F B)
(hind : βˆ€ s t, s ≀ t β†’ Indep
(MeasurableSpace.comap (fun Ο‰ => B t Ο‰ - B s Ο‰) inferInstance) (F s) P)
(H K : ℝβ‰₯0 β†’ Ξ© β†’ ℝ) (hH : StronglyAdapted F H) (hK : StronglyAdapted F K)
(hcH : βˆ€α΅ Ο‰ βˆ‚P, Continuous (fun t => H t Ο‰))
(hcK : βˆ€α΅ Ο‰ βˆ‚P, Continuous (fun t => K t Ο‰))
{C D : ℝ} (hC : 0 ≀ C) (hD : 0 ≀ D)
(hbH : βˆ€α΅ Ο‰ βˆ‚P, βˆ€ t, |H t Ο‰| ≀ C)
(hbK : βˆ€α΅ Ο‰ βˆ‚P, βˆ€ t, |K t Ο‰| ≀ D)
(T : ℝβ‰₯0) {I J : Ξ© β†’ ℝ} (hI : MemLp I 2 P) (hJ : MemLp J 2 P)
(haI : Tendsto (fun n => ∫ Ο‰,
(BrownianGrid.uniformSum B H T n Ο‰ - I Ο‰) ^ 2 βˆ‚P) atTop (𝓝 0))
(haJ : Tendsto (fun n => ∫ Ο‰,
(BrownianGrid.uniformSum B K T n Ο‰ - J Ο‰) ^ 2 βˆ‚P) atTop (𝓝 0)) :
(∫ Ο‰, (I Ο‰ - J Ο‰) ^ 2 βˆ‚P) =
∫ t in (0 : ℝ)..(T : ℝ), ∫ Ο‰, (H t.toNNReal Ο‰ - K t.toNNReal Ο‰) ^ 2 βˆ‚P := by
let : IsProbabilityMeasure P := hB.isGaussianProcess.isProbabilityMeasure
have hH2 (t : ℝβ‰₯0) : MemLp (H t) 2 P := by
apply MemLp.of_bound ((hH t).mono (F.le t)).aestronglyMeasurable C
filter_upwards [hbH] with ω hω
simpa only [Real.norm_eq_abs] using hω t
have hK2 (t : ℝβ‰₯0) : MemLp (K t) 2 P := by
apply MemLp.of_bound ((hK t).mono (F.le t)).aestronglyMeasurable D
filter_upwards [hbK] with ω hω
simpa only [Real.norm_eq_abs] using hω t
refine uniform_meanSquare_limit_isometry hB hAd hind (fun t Ο‰ => H t Ο‰ - K t Ο‰)
(fun t => (hH t).sub (hK t)) ?_ (add_nonneg hC hD) ?_ T (hI.sub hJ) ?_
· filter_upwards [hcH, hcK] with ω hωH hωK
exact hωH.sub hωK
· filter_upwards [hbH, hbK] with ω hωH hωK
intro t
exact (abs_sub _ _).trans (add_le_add (hωH t) (hωK t))
Β· simpa only [BrownianGrid.uniformSum_sub_coeff, Pi.sub_apply] using
SimpleIntegral.meanSquare_limit_sub
(uniformSum_memLp hB hAd hind H hH hH2 T)
(uniformSum_memLp hB hAd hind K hK hK2 T) hI hJ haI haJ
end BrownianFiltrationGrid
namespace BrownianArrayFiltration
variable {Ξ© ΞΉ : Type*} [mΞ© : MeasurableSpace Ξ©] {P : Measure Ξ©}
{B : ΞΉ β†’ ℝβ‰₯0 β†’ Ξ© β†’ ℝ} {F : Filtration ℝβ‰₯0 mΞ©}
theorem uniform_meanSquare_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 : ℝβ‰₯0)
{I : ΞΉ β†’ Ξ© β†’ ℝ} (hI : βˆ€ a, MemLp (I a) 2 P)
(ha : βˆ€ a, Tendsto (fun n => ∫ Ο‰,
(BrownianGrid.uniformSum (B a) (H a) T n Ο‰ - 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) :=
coordinate_increment_indep_past (hind s t hst) a
have hS (a : ΞΉ) := BrownianFiltrationGrid.uniformSum_memLp
(hB a) (hAd a) (hi a) (H a) (hH a) (hH2 a) T
have hlim (a : ΞΉ) := (SimpleIntegral.tendsto_toLp_iff_meanSquare (hS a) (hI a)).mpr (ha a)
intro a b hab
have hliminner := (hlim a).inner (π•œ := ℝ) (hlim b)
have hz (n : β„•) : inner ℝ
((hS a n).toLp (BrownianGrid.uniformSum (B a) (H a) T n))
((hS b n).toLp (BrownianGrid.uniformSum (B b) (H b) T n)) = 0 := by
rw [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 ℝ ((hI a).toLp (I a)) ((hI b).toLp (I b)) = 0 :=
tendsto_nhds_unique hliminner (by simpa only [hz] using
(tendsto_const_nhds : Tendsto (fun _ : β„• => (0 : ℝ)) atTop (𝓝 0)))
exact (PredictableL2.inner_toLp (hI a) (hI b)).symm.trans heq
theorem uniform_meanSquare_differences_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 K : ΞΉ β†’ ℝβ‰₯0 β†’ Ξ© β†’ ℝ)
(hH : βˆ€ a, StronglyAdapted F (H a)) (hK : βˆ€ a, StronglyAdapted F (K a))
(hH2 : βˆ€ a t, MemLp (H a t) 2 P) (hK2 : βˆ€ a t, MemLp (K a t) 2 P)
(T : ℝβ‰₯0) {I J : ΞΉ β†’ Ξ© β†’ ℝ}
(hI : βˆ€ a, MemLp (I a) 2 P) (hJ : βˆ€ a, MemLp (J a) 2 P)
(haI : βˆ€ a, Tendsto (fun n => ∫ Ο‰,
(BrownianGrid.uniformSum (B a) (H a) T n Ο‰ - I a Ο‰) ^ 2 βˆ‚P) atTop (𝓝 0))
(haJ : βˆ€ a, Tendsto (fun n => ∫ Ο‰,
(BrownianGrid.uniformSum (B a) (K a) T n Ο‰ - J a Ο‰) ^ 2 βˆ‚P) atTop (𝓝 0)) :
Pairwise fun a b => ∫ Ο‰, (I a Ο‰ - J a Ο‰) * (I b Ο‰ - J b Ο‰) βˆ‚P = 0 := by
apply uniform_meanSquare_limits_orthogonal hB hAd hind hcross
(fun a t Ο‰ => H a t Ο‰ - K a t Ο‰)
(fun a t => (hH a t).sub (hK a t)) (fun a t => (hH2 a t).sub (hK2 a t)) T
(fun a => (hI a).sub (hJ a))
intro a
have hi (s t : ℝβ‰₯0) (hst : s ≀ t) :=
coordinate_increment_indep_past (hind s t hst) a
simpa only [BrownianGrid.uniformSum_sub_coeff, Pi.sub_apply] using
SimpleIntegral.meanSquare_limit_sub
(BrownianFiltrationGrid.uniformSum_memLp (hB a) (hAd a) hi (H a) (hH a) (hH2 a) T)
(BrownianFiltrationGrid.uniformSum_memLp (hB a) (hAd a) hi (K a) (hK a) (hK2 a) T)
(hI a) (hJ a) (haI a) (haJ a)
section RowComparison
variable [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 K : ΞΉ β†’ ℝβ‰₯0 β†’ Ξ© β†’ ℝ)
(hH : βˆ€ a, StronglyAdapted F (H a)) (hK : βˆ€ a, StronglyAdapted F (K a))
(hcH : βˆ€ a, βˆ€α΅ Ο‰ βˆ‚P, Continuous (fun t => H a t Ο‰))
(hcK : βˆ€ a, βˆ€α΅ Ο‰ βˆ‚P, Continuous (fun t => K a t Ο‰))
(C D : ΞΉ β†’ ℝ) (hC : βˆ€ a, 0 ≀ C a) (hD : βˆ€ a, 0 ≀ D a)
(hbH : βˆ€ a, βˆ€α΅ Ο‰ βˆ‚P, βˆ€ t, |H a t Ο‰| ≀ C a)
(hbK : βˆ€ a, βˆ€α΅ Ο‰ βˆ‚P, βˆ€ t, |K a t Ο‰| ≀ D a)
(T : ℝβ‰₯0) {I J : ΞΉ β†’ Ξ© β†’ ℝ}
(hI : βˆ€ a, MemLp (I a) 2 P) (hJ : βˆ€ a, MemLp (J a) 2 P)
(haI : βˆ€ a, Tendsto (fun n => ∫ Ο‰,
(BrownianGrid.uniformSum (B a) (H a) T n Ο‰ - I a Ο‰) ^ 2 βˆ‚P) atTop (𝓝 0))
(haJ : βˆ€ a, Tendsto (fun n => ∫ Ο‰,
(BrownianGrid.uniformSum (B a) (K a) T n Ο‰ - J a Ο‰) ^ 2 βˆ‚P) atTop (𝓝 0))
include hB hAd hind hcross hH hK hcH hcK hC hD hbH hbK hI hJ haI haJ in
theorem finite_row_difference_isometry (s : Finset ΞΉ) :
(∫ Ο‰, ((βˆ‘ a ∈ s, I a Ο‰) - βˆ‘ a ∈ s, J a Ο‰) ^ 2 βˆ‚P) =
βˆ‘ a ∈ s, ∫ t in (0 : ℝ)..(T : ℝ),
∫ Ο‰, (H a t.toNNReal Ο‰ - K a t.toNNReal Ο‰) ^ 2 βˆ‚P := by
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 [hbH a] with ω hω
simpa only [Real.norm_eq_abs] using hω t
have hK2 (a : ΞΉ) (t : ℝβ‰₯0) : MemLp (K a t) 2 P := by
apply MemLp.of_bound ((hK a t).mono (F.le t)).aestronglyMeasurable (D a)
filter_upwards [hbK a] with ω hω
simpa only [Real.norm_eq_abs] using hω t
have horth := uniform_meanSquare_differences_orthogonal hB hAd hind hcross H K hH hK
hH2 hK2 T hI hJ haI haJ
simp_rw [← Finset.sum_sub_distrib]
rw [SimpleIntegral.integral_sq_sum_of_orthogonal s
(fun a Ο‰ => I a Ο‰ - J a Ο‰)
(fun a _ b _ => ((hI a).sub (hJ a)).integrable_mul ((hI b).sub (hJ b)))
(fun a _ b _ hab => horth hab)]
apply Finset.sum_congr rfl
intro a ha
exact BrownianFiltrationGrid.uniform_meanSquare_difference_isometry
(hB a) (hAd a) (fun s t hst => coordinate_increment_indep_past (hind s t hst) a)
(H a) (K a) (hH a) (hK a) (hcH a) (hcK a) (hC a) (hD a)
(hbH a) (hbK a) T (hI a) (hJ a) (haI a) (haJ a)
include hB hAd hind hcross hH hK hcH hcK hC hD hbH hbK hI hJ haI haJ in
theorem infinite_row_difference_isometry
{Y Z : Ξ© β†’ ℝ} (hY : MemLp Y 2 P) (hZ : MemLp Z 2 P)
(hsY : Tendsto (fun s : Finset ΞΉ => ∫ Ο‰,
((βˆ‘ a ∈ s, I a Ο‰) - Y Ο‰) ^ 2 βˆ‚P) atTop (𝓝 0))
(hsZ : Tendsto (fun s : Finset ΞΉ => ∫ Ο‰,
((βˆ‘ a ∈ s, J a Ο‰) - Z Ο‰) ^ 2 βˆ‚P) atTop (𝓝 0))
(henergy : Summable fun a => ∫ t in (0 : ℝ)..(T : ℝ),
∫ Ο‰, (H a t.toNNReal Ο‰ - K a t.toNNReal Ο‰) ^ 2 βˆ‚P) :
(∫ Ο‰, (Y Ο‰ - Z Ο‰) ^ 2 βˆ‚P) =
βˆ‘' a, ∫ t in (0 : ℝ)..(T : ℝ),
∫ Ο‰, (H a t.toNNReal Ο‰ - K a t.toNNReal Ο‰) ^ 2 βˆ‚P := by
have hIs (s : Finset ΞΉ) : MemLp (fun Ο‰ => βˆ‘ a ∈ s, I a Ο‰) 2 P :=
memLp_finsetSum s (fun a _ => hI a)
have hJs (s : Finset ΞΉ) : MemLp (fun Ο‰ => βˆ‘ a ∈ s, J a Ο‰) 2 P :=
memLp_finsetSum s (fun a _ => hJ a)
have hd := SimpleIntegral.meanSquare_limit_sub hIs hJs hY hZ hsY hsZ
have hlp := (SimpleIntegral.tendsto_toLp_iff_meanSquare
(fun s => (hIs s).sub (hJs s)) (hY.sub hZ)).mpr hd
have hnorm : Tendsto (fun s : Finset ΞΉ => ∫ Ο‰,
((βˆ‘ a ∈ s, I a Ο‰) - βˆ‘ a ∈ s, J a Ο‰) ^ 2 βˆ‚P) atTop
(𝓝 (∫ Ο‰, (Y Ο‰ - Z Ο‰) ^ 2 βˆ‚P)) := by
simpa only [PredictableL2.norm_toLp_sq, Pi.sub_apply] using hlp.norm.pow 2
have heq (s : Finset ΞΉ) := finite_row_difference_isometry hB hAd hind hcross
H K hH hK hcH hcK C D hC hD hbH hbK T hI hJ haI haJ s
apply tendsto_nhds_unique hnorm
simpa only [HasSum, SummationFilter.unconditional, heq] using henergy.hasSum
end RowComparison
end BrownianArrayFiltration
end Problem367
end
end OAI