math / data /lean /OAI /Probability /FreeIsing /Brownian /CoefficientApproximationIdentification.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
3.73 kB
import OAI.Probability.FreeIsing.Brownian.ArrayCrossIsometry
namespace OAI
noncomputable section
open MeasureTheory ProbabilityTheory Filter
open scoped NNReal Topology
namespace Problem367.BrownianFiltrationGrid
variable {Ξ© : Type*} [mΞ© : MeasurableSpace Ξ©] {P : Measure Ξ©}
{B : ℝβ‰₯0 β†’ Ξ© β†’ ℝ} {F : Filtration ℝβ‰₯0 mΞ©}
(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)
(K : β„• β†’ ℝβ‰₯0 β†’ Ξ© β†’ ℝ) (H : ℝβ‰₯0 β†’ Ξ© β†’ ℝ)
(hK : βˆ€ n, StronglyAdapted F (K n)) (hH : StronglyAdapted F H)
(hcK : βˆ€ n, βˆ€α΅ Ο‰ βˆ‚P, Continuous (fun t => K n t Ο‰))
(hcH : βˆ€α΅ Ο‰ βˆ‚P, Continuous (fun t => H t Ο‰))
(C : β„• β†’ ℝ) (D : ℝ) (hC : βˆ€ n, 0 ≀ C n) (hD : 0 ≀ D)
(hbK : βˆ€ n, βˆ€α΅ Ο‰ βˆ‚P, βˆ€ t, |K n t Ο‰| ≀ C n)
(hbH : βˆ€α΅ Ο‰ βˆ‚P, βˆ€ t, |H t Ο‰| ≀ D)
(T : ℝβ‰₯0) {X : β„• β†’ Ξ© β†’ ℝ} {J : Ξ© β†’ ℝ}
(hX : βˆ€ n, MemLp (X n) 2 P) (hJ : MemLp J 2 P)
(haX : βˆ€ n, Tendsto (fun k => ∫ Ο‰,
(BrownianGrid.uniformSum B (K n) T k Ο‰ - X n Ο‰) ^ 2 βˆ‚P) atTop (𝓝 0))
(haJ : Tendsto (fun k => ∫ Ο‰,
(BrownianGrid.uniformSum B H T k Ο‰ - J Ο‰) ^ 2 βˆ‚P) atTop (𝓝 0))
include hB hAd hind hK hH hcK hcH hC hD hbK hbH hX hJ haX haJ
theorem tendsto_meanSquare_of_coefficient_interval
(hcoeff : Tendsto (fun n => ∫ t in (0 : ℝ)..(T : ℝ), ∫ Ο‰,
(K n t.toNNReal Ο‰ - H t.toNNReal Ο‰) ^ 2 βˆ‚P) atTop (𝓝 0)) :
Tendsto (fun n => ∫ Ο‰, (X n Ο‰ - J Ο‰) ^ 2 βˆ‚P) atTop (𝓝 0) := by
have he (n : β„•) := uniform_meanSquare_difference_isometry
hB hAd hind (K n) H (hK n) hH (hcK n) hcH (hC n) hD
(hbK n) hbH T (hX n) hJ (haX n) haJ
simpa only [he] using hcoeff
theorem tendsto_meanSquare_of_coefficient_timeSpace
(hInt : βˆ€ n, Integrable (fun p : ℝ Γ— Ξ© =>
(K n p.1.toNNReal p.2 - H p.1.toNNReal p.2) ^ 2)
((volume.restrict (Set.Ioc (0 : ℝ) (T : ℝ))).prod P))
(hcoeff : Tendsto (fun n => ∫ p : ℝ Γ— Ξ©,
(K n p.1.toNNReal p.2 - H p.1.toNNReal p.2) ^ 2
βˆ‚(volume.restrict (Set.Ioc (0 : ℝ) (T : ℝ))).prod P) atTop (𝓝 0)) :
Tendsto (fun n => ∫ Ο‰, (X n Ο‰ - J Ο‰) ^ 2 βˆ‚P) atTop (𝓝 0) := by
let : IsProbabilityMeasure P := hB.isGaussianProcess.isProbabilityMeasure
apply tendsto_meanSquare_of_coefficient_interval hB hAd hind K H hK hH hcK hcH
C D hC hD hbK hbH T hX hJ haX haJ
have he (n : β„•) :
(∫ t in (0 : ℝ)..(T : ℝ), ∫ Ο‰,
(K n t.toNNReal Ο‰ - H t.toNNReal Ο‰) ^ 2 βˆ‚P) =
∫ p : ℝ Γ— Ξ©, (K n p.1.toNNReal p.2 - H p.1.toNNReal p.2) ^ 2
βˆ‚(volume.restrict (Set.Ioc (0 : ℝ) (T : ℝ))).prod P := by
rw [intervalIntegral.integral_of_le T.coe_nonneg]
exact (integral_prod _ (hInt n)).symm
simpa only [he] using hcoeff
theorem ae_eq_of_coefficient_timeSpace_approximation
(hInt : βˆ€ n, Integrable (fun p : ℝ Γ— Ξ© =>
(K n p.1.toNNReal p.2 - H p.1.toNNReal p.2) ^ 2)
((volume.restrict (Set.Ioc (0 : ℝ) (T : ℝ))).prod P))
(hcoeff : Tendsto (fun n => ∫ p : ℝ Γ— Ξ©,
(K n p.1.toNNReal p.2 - H p.1.toNNReal p.2) ^ 2
βˆ‚(volume.restrict (Set.Ioc (0 : ℝ) (T : ℝ))).prod P) atTop (𝓝 0))
{I : Ξ© β†’ ℝ} (hI : MemLp I 2 P)
(hlimI : Tendsto (fun n => ∫ Ο‰, (X n Ο‰ - I Ο‰) ^ 2 βˆ‚P) atTop (𝓝 0)) :
I =ᡐ[P] J := by
exact BrownianGrid.ae_eq_of_mean_square_limits hX hI hJ hlimI
(tendsto_meanSquare_of_coefficient_timeSpace hB hAd hind K H hK hH hcK hcH
C D hC hD hbK hbH T hX hJ haX haJ hInt hcoeff)
end Problem367.BrownianFiltrationGrid
end
end OAI