math / data /lean /OAI /Probability /FreeIsing /Conditioning /CopyBrownian.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
7.76 kB
import OAI.Probability.FreeIsing.Brownian.Martingale
import OAI.Probability.FreeIsing.Martingales.InnovationMartingale
import OAI.Probability.FreeIsing.Trees.PathSplit
namespace OAI
noncomputable section
open MeasureTheory ProbabilityTheory Filter
open scoped NNReal
namespace Problem367.ConditionalCopyBrownian
variable {O X E : Type*} [MeasurableSpace O] [MeasurableSpace X] [MeasurableSpace E]
def joinedHistory (s : ℝβ‰₯0) (past : O β†’ X)
(q : (ℝβ‰₯0 β†’ E) Γ— (O Γ— O)) : (Set.Iic s β†’ E) Γ— (X Γ— X) :=
(PathSplit.pastPath s q.1, (past q.2.1, past q.2.2))
theorem measurable_joinedHistory (s : ℝβ‰₯0) {past : O β†’ X}
(hpast : Measurable past) : Measurable (joinedHistory (E := E) s past) := by
exact ((PathSplit.measurable_pastPath s).comp measurable_fst).prodMk
((hpast.comp (measurable_fst.comp measurable_snd)).prodMk
(hpast.comp (measurable_snd.comp measurable_snd)))
abbrev joinedPast (s : ℝβ‰₯0) (past : O β†’ X) :
MeasurableSpace ((ℝβ‰₯0 β†’ E) Γ— (O Γ— O)) :=
MeasurableSpace.comap (joinedHistory s past) inferInstance
theorem joinedPast_le (s : ℝβ‰₯0) {past : O β†’ X} (hpast : Measurable past) :
joinedPast s past ≀ (inferInstance : MeasurableSpace ((ℝβ‰₯0 β†’ E) Γ— (O Γ— O))) :=
(measurable_joinedHistory s hpast).comap_le
variable [StandardBorelSpace X] [Nonempty X]
theorem condExp_future_eq_integral
[AddCommGroup E] [MeasurableAddβ‚‚ E] [MeasurableSubβ‚‚ E]
(s : ℝβ‰₯0) (rho : Measure (ℝβ‰₯0 β†’ E)) [IsProbabilityMeasure rho]
(eta : Kernel (ℝβ‰₯0 β†’ E) O) [IsMarkovKernel eta]
(past : O β†’ X) (hpast : Measurable past)
(hind : IndepFun
(fun q : (ℝβ‰₯0 β†’ E) Γ— O => (PathSplit.pastPath s q.1, past q.2))
(fun q => PathSplit.futureIncrements s q.1) (rho βŠ—β‚˜ eta))
(f : (Set.Ioi s β†’ E) β†’ ℝ) (hf : Measurable f)
(hfint : Integrable (fun w => f (PathSplit.futureIncrements s w)) rho) :
(rho βŠ—β‚˜ (eta Γ—β‚– eta))[
(fun q : (ℝβ‰₯0 β†’ E) Γ— (O Γ— O) => f (PathSplit.futureIncrements s q.1)) |
joinedPast s past] =ᡐ[rho βŠ—β‚˜ (eta Γ—β‚– eta)]
fun _ => ∫ w, f (PathSplit.futureIncrements s w) βˆ‚rho := by
have hi := (PathSplit.indepFun_future_conditionalCopies s rho eta past hpast hind).symm.comp
hf measurable_id
have hfm : Measurable (fun q : (ℝβ‰₯0 β†’ E) Γ— (O Γ— O) =>
f (PathSplit.futureIncrements s q.1)) :=
hf.comp ((PathSplit.measurable_futureIncrements s).comp measurable_fst)
have hce := condExp_indep_eq hfm.comap_le (joinedPast_le s hpast)
(measurable_iff_comap_le.mpr le_rfl).stronglyMeasurable hi
have hmp : MeasurePreserving (Prod.fst : (ℝβ‰₯0 β†’ E) Γ— (O Γ— O) β†’ (ℝβ‰₯0 β†’ E))
(rho βŠ—β‚˜ (eta Γ—β‚– eta)) rho := ⟨measurable_fst, Measure.fst_compProd _ _⟩
have hint := hmp.integrable_comp_of_integrable hfint
have hmean : (∫ q : (ℝβ‰₯0 β†’ E) Γ— (O Γ— O),
f (PathSplit.futureIncrements s q.1) βˆ‚rho βŠ—β‚˜ (eta Γ—β‚– eta)) =
∫ w, f (PathSplit.futureIncrements s w) βˆ‚rho := by
simpa only [Function.comp_apply, integral_const, probReal_univ,
one_smul] using (Measure.integral_compProd hint)
simpa only [Function.comp_def, hmean] using hce
theorem condExp_increment_eq_zero
(rho : Measure (ℝβ‰₯0 β†’ ℝ)) [IsProbabilityMeasure rho]
(hB : IsPreBrownianReal (fun t (w : ℝβ‰₯0 β†’ ℝ) => w t) rho)
(eta : Kernel (ℝβ‰₯0 β†’ ℝ) O) [IsMarkovKernel eta]
{s t : ℝβ‰₯0} (hst : s ≀ t)
(past : O β†’ X) (hpast : Measurable past)
(hind : IndepFun
(fun q : (ℝβ‰₯0 β†’ ℝ) Γ— O => (PathSplit.pastPath s q.1, past q.2))
(fun q => PathSplit.futureIncrements s q.1) (rho βŠ—β‚˜ eta)) :
(rho βŠ—β‚˜ (eta Γ—β‚– eta))[
(fun q : (ℝβ‰₯0 β†’ ℝ) Γ— (O Γ— O) => q.1 t - q.1 s) |
joinedPast s past] =ᡐ[rho βŠ—β‚˜ (eta Γ—β‚– eta)] fun _ => 0 := by
rcases hst.eq_or_lt with rfl | hst
Β· simp
have hi : Integrable (fun w : ℝβ‰₯0 β†’ ℝ => w t - w s) rho :=
(hB.integrable_eval t).sub (hB.integrable_eval s)
have hc := condExp_future_eq_integral s rho eta past hpast hind
(fun z => z ⟨t, hst⟩) (measurable_pi_apply _) hi
have hz : (∫ w : ℝβ‰₯0 β†’ ℝ, w t - w s βˆ‚rho) = 0 := by
rw [integral_sub (hB.integrable_eval t) (hB.integrable_eval s),
hB.integral_eval, hB.integral_eval, sub_self]
simpa only [PathSplit.futureIncrements, hz] using hc
theorem condExp_increment_sq_eq_elapsed
(rho : Measure (ℝβ‰₯0 β†’ ℝ)) [IsProbabilityMeasure rho]
(hB : IsPreBrownianReal (fun t (w : ℝβ‰₯0 β†’ ℝ) => w t) rho)
(eta : Kernel (ℝβ‰₯0 β†’ ℝ) O) [IsMarkovKernel eta]
{s t : ℝβ‰₯0} (hst : s ≀ t)
(past : O β†’ X) (hpast : Measurable past)
(hind : IndepFun
(fun q : (ℝβ‰₯0 β†’ ℝ) Γ— O => (PathSplit.pastPath s q.1, past q.2))
(fun q => PathSplit.futureIncrements s q.1) (rho βŠ—β‚˜ eta)) :
(rho βŠ—β‚˜ (eta Γ—β‚– eta))[
(fun q : (ℝβ‰₯0 β†’ ℝ) Γ— (O Γ— O) => (q.1 t - q.1 s) ^ 2) |
joinedPast s past] =ᡐ[rho βŠ—β‚˜ (eta Γ—β‚– eta)]
fun _ => (t : ℝ) - (s : ℝ) := by
rcases hst.eq_or_lt with rfl | hst
Β· simp
have hi : Integrable (fun w : ℝβ‰₯0 β†’ ℝ => (w t - w s) ^ 2) rho :=
((hB.isGaussianProcess.hasGaussianLaw_eval t).memLp_two.sub
(hB.isGaussianProcess.hasGaussianLaw_eval s).memLp_two).integrable_sq
have hc := condExp_future_eq_integral s rho eta past hpast hind
(fun z => (z ⟨t, hst⟩) ^ 2) ((measurable_pi_apply _).pow_const 2) hi
have hz : (∫ w : ℝβ‰₯0 β†’ ℝ, (w t - w s) ^ 2 βˆ‚rho) = (t : ℝ) - (s : ℝ) := by
have h := preBrownian_integral_sq (hB.shift s) (t - s)
simpa [add_tsub_cancel_of_le hst.le, NNReal.coe_sub hst.le] using h
simpa only [PathSplit.futureIncrements, hz] using hc
theorem isPreBrownian_commonNoise
(rho : Measure (ℝβ‰₯0 β†’ ℝ)) [IsProbabilityMeasure rho]
(hB : IsPreBrownianReal (fun t (w : ℝβ‰₯0 β†’ ℝ) => w t) rho)
(eta : Kernel (ℝβ‰₯0 β†’ ℝ) O) [IsMarkovKernel eta] :
IsPreBrownianReal (fun t (q : (ℝβ‰₯0 β†’ ℝ) Γ— (O Γ— O)) => q.1 t)
(rho βŠ—β‚˜ (eta Γ—β‚– eta)) := by
have hmp : MeasurePreserving (Prod.fst : (ℝβ‰₯0 β†’ ℝ) Γ— (O Γ— O) β†’ (ℝβ‰₯0 β†’ ℝ))
(rho βŠ—β‚˜ (eta Γ—β‚– eta)) rho := ⟨measurable_fst, Measure.fst_compProd _ _⟩
exact ⟨fun I => (hB.hasLaw I).comp hmp.hasLaw⟩
theorem commonNoise_martingale
(rho : Measure (ℝβ‰₯0 β†’ ℝ)) [IsProbabilityMeasure rho]
(hB : IsPreBrownianReal (fun t (w : ℝβ‰₯0 β†’ ℝ) => w t) rho)
(eta : Kernel (ℝβ‰₯0 β†’ ℝ) O) [IsMarkovKernel eta]
(past : ℝβ‰₯0 β†’ O β†’ X) (hpast : βˆ€ s, Measurable (past s))
(G : Filtration ℝβ‰₯0 (inferInstance : MeasurableSpace ((ℝβ‰₯0 β†’ ℝ) Γ— (O Γ— O))))
(hG : βˆ€ s, G s = joinedPast s (past s))
(hind : βˆ€ s, IndepFun
(fun q : (ℝβ‰₯0 β†’ ℝ) Γ— O => (PathSplit.pastPath s q.1, past s q.2))
(fun q => PathSplit.futureIncrements s q.1) (rho βŠ—β‚˜ eta)) :
Martingale (fun t (q : (ℝβ‰₯0 β†’ ℝ) Γ— (O Γ— O)) => q.1 t) G
(rho βŠ—β‚˜ (eta Γ—β‚– eta)) := by
have had : StronglyAdapted G
(fun t (q : (ℝβ‰₯0 β†’ ℝ) Γ— (O Γ— O)) => q.1 t) := by
intro t
rw [hG t]
have hh : Measurable[joinedPast (E := ℝ) t (past t)]
(joinedHistory (E := ℝ) t (past t)) :=
comap_measurable _
exact ((measurable_pi_apply (⟨t, by simp⟩ : Set.Iic t)).comp
(measurable_fst.comp hh)).stronglyMeasurable
apply martingale_of_conditional_increment_zero had
(fun t => (isPreBrownian_commonNoise rho hB eta).integrable_eval t)
intro s t hst
rw [hG s]
exact condExp_increment_eq_zero rho hB eta hst (past s) (hpast s) (hind s)
end Problem367.ConditionalCopyBrownian
end
end OAI