math / data /lean /OAI /Probability /FreeIsing /Conditioning /ConstructedConditionalCopies.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
4.24 kB
import OAI.Probability.FreeIsing.Estimates.FilteredFutureIndependence
import OAI.Probability.FreeIsing.Posterior.ContinuousObservationHistory
namespace OAI
noncomputable section
open MeasureTheory ProbabilityTheory
open scoped NNReal
namespace Problem367.ConstructedConditionalCopies
open WienerSampler ContinuousObservationHistory
theorem indepFun_map_of_comp {Ξ© Z A B : Type*}
[MeasurableSpace Ξ©] [MeasurableSpace Z] [MeasurableSpace A] [MeasurableSpace B]
{P : Measure Ξ©} [IsProbabilityMeasure P]
{z : Ξ© β†’ Z} (hz : Measurable z) {f : Z β†’ A} {g : Z β†’ B}
(hf : Measurable f) (hg : Measurable g)
(hind : IndepFun (f ∘ z) (g ∘ z) P) : IndepFun f g (P.map z) := by
let : IsProbabilityMeasure (P.map z) := inferInstance
rw [indepFun_iff_map_prod_eq_prod_map_map hf.aemeasurable hg.aemeasurable]
rw [Measure.map_map (hf.prodMk hg) hz, Measure.map_map hf hz, Measure.map_map hg hz]
exact hind.map_prod_eq_prod_map_map (hf.comp hz).aemeasurable (hg.comp hz).aemeasurable
theorem exists_compatible_conditionalCopies
{ΞΉ Ξ© : Type*} [Countable ΞΉ] [mΞ© : MeasurableSpace Ξ©]
(P : Measure Ξ©) [IsProbabilityMeasure P]
(F : Filtration ℝβ‰₯0 mΞ©) (X : ℝβ‰₯0 β†’ Ξ© β†’ ΞΉ β†’ ℝ)
(hX : βˆ€ t, Measurable[F t] (X t))
(hB : βˆ€ i, IsPreBrownianReal (fun t Ο‰ => X t Ο‰ i) P)
(hind : βˆ€ s t, s ≀ t β†’ Indep
(MeasurableSpace.comap (fun Ο‰ => X t Ο‰ - X s Ο‰) inferInstance) (F s) P)
(Y : Ξ© β†’ ΞΉ β†’ Path) (hY : Measurable Y)
(hYad : βˆ€ i t, Measurable[F t] (fun Ο‰ => Y Ο‰ i t)) :
βˆƒ (rho : Measure (ℝβ‰₯0 β†’ ΞΉ β†’ ℝ)) (eta : Kernel (ℝβ‰₯0 β†’ ΞΉ β†’ ℝ) (ΞΉ β†’ Path)),
IsProbabilityMeasure rho ∧ IsMarkovKernel eta ∧
rho = P.map (fun Ο‰ t => X t Ο‰) ∧
rho βŠ—β‚˜ eta = P.map (fun Ο‰ => ((fun t => X t Ο‰), Y Ο‰)) ∧
(βˆ€ i, IsPreBrownianReal
(fun t (q : (ℝβ‰₯0 β†’ ΞΉ β†’ ℝ) Γ— ((ΞΉ β†’ Path) Γ— (ΞΉ β†’ Path))) => q.1 t i)
(rho βŠ—β‚˜ (eta Γ—β‚– eta))) ∧
(βˆ€ i, Martingale
(fun t (q : (ℝβ‰₯0 β†’ ΞΉ β†’ ℝ) Γ— ((ΞΉ β†’ Path) Γ— (ΞΉ β†’ Path))) => q.1 t i)
ContinuousObservationHistory.joinedFiltration (rho βŠ—β‚˜ (eta Γ—β‚– eta))) := by
let W : Ξ© β†’ ℝβ‰₯0 β†’ ΞΉ β†’ ℝ := fun Ο‰ t => X t Ο‰
have hW : Measurable W := Measurable.of_eval fun t =>
(hX t).mono (F.le t) le_rfl
let Z : Ξ© β†’ (ℝβ‰₯0 β†’ ΞΉ β†’ ℝ) Γ— (ΞΉ β†’ Path) := fun Ο‰ => (W Ο‰, Y Ο‰)
have hZ : Measurable Z := hW.prodMk hY
let R := P.map Z
have : IsProbabilityMeasure R := inferInstance
let rho := R.fst
let eta := R.condKernel
have hrho : rho = P.map W := Measure.fst_map_prodMk hW hY
have hdecomp : rho βŠ—β‚˜ eta = R := Measure.disintegrate R eta
have hBrho (i : ΞΉ) : IsPreBrownianReal (fun t (w : ℝβ‰₯0 β†’ ΞΉ β†’ ℝ) => w t i) rho := by
rw [hrho]
constructor
intro I
have hm : Measurable (fun w : ℝβ‰₯0 β†’ ΞΉ β†’ ℝ => I.restrict (fun t => w t i)) :=
Measurable.of_eval fun t => (measurable_pi_apply i).comp (measurable_pi_apply t.1)
refine ⟨hm.aemeasurable, ?_⟩
rw [Measure.map_map hm hW]
exact (hB i).hasLaw I |>.map_eq
have hOriginal (s : ℝβ‰₯0) : IndepFun
(fun q : (ℝβ‰₯0 β†’ ΞΉ β†’ ℝ) Γ— (ΞΉ β†’ Path) =>
(PathSplit.pastPath s q.1, stoppedArray s q.2))
(fun q => PathSplit.futureIncrements s q.1) (rho βŠ—β‚˜ eta) := by
rw [hdecomp]
have hPast : Measurable[F s] (fun Ο‰ => stoppedArray s (Y Ο‰)) :=
measurable_stoppedArray_of_eval (mΞ© := F s) s Y
(fun i t ht => (hYad i t).mono (F.mono ht) le_rfl)
apply indepFun_map_of_comp hZ
(((PathSplit.measurable_pastPath s).comp measurable_fst).prodMk
((measurable_stoppedArray s).comp measurable_snd))
((PathSplit.measurable_futureIncrements s).comp measurable_fst)
exact FilteredFutureIndependence.indepFun_past_and_observable_strict_future
hX hind s hPast
exact ⟨rho, eta, inferInstance, inferInstance, hrho, hdecomp,
(fun i => ConditionalCopyArrayBrownian.isPreBrownian_commonNoise i rho (hBrho i) eta),
(fun i => ContinuousObservationHistory.commonNoise_martingale i rho (hBrho i) eta hOriginal)⟩
end Problem367.ConstructedConditionalCopies
end
end OAI