File size: 4,242 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 | 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
|