math / data /lean /OAI /Probability /FreeIsing /Conditioning /CopyArrayBrownian.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
5.31 kB
import OAI.Probability.FreeIsing.Conditioning.CopyBrownian
namespace OAI
noncomputable section
open MeasureTheory ProbabilityTheory Filter
open scoped NNReal
namespace Problem367.ConditionalCopyArrayBrownian
open ConditionalCopyBrownian
variable {ΞΉ O X : Type*} [MeasurableSpace O] [MeasurableSpace X]
variable [StandardBorelSpace X] [Nonempty X]
theorem condExp_increment_eq_zero
(i : ΞΉ) (rho : Measure (ℝβ‰₯0 β†’ ΞΉ β†’ ℝ)) [IsProbabilityMeasure rho]
(hB : IsPreBrownianReal (fun t (w : ℝβ‰₯0 β†’ ΞΉ β†’ ℝ) => w t i) 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 i - q.1 s i) |
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 i - w s i) 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⟩ i) ((measurable_pi_apply i).comp (measurable_pi_apply _)) hi
have hz : (∫ w : ℝβ‰₯0 β†’ ΞΉ β†’ ℝ, w t i - w s i βˆ‚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, Pi.sub_apply, hz] using hc
theorem condExp_increment_sq_eq_elapsed
(i : ΞΉ) (rho : Measure (ℝβ‰₯0 β†’ ΞΉ β†’ ℝ)) [IsProbabilityMeasure rho]
(hB : IsPreBrownianReal (fun t (w : ℝβ‰₯0 β†’ ΞΉ β†’ ℝ) => w t i) 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 i - q.1 s i) ^ 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 i - w s i) ^ 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⟩ i) ^ 2) (((measurable_pi_apply i).comp (measurable_pi_apply _)).pow_const 2) hi
have hz : (∫ w : ℝβ‰₯0 β†’ ΞΉ β†’ ℝ, (w t i - w s i) ^ 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, Pi.sub_apply, hz] using hc
theorem isPreBrownian_commonNoise
(i : ΞΉ) (rho : Measure (ℝβ‰₯0 β†’ ΞΉ β†’ ℝ)) [IsProbabilityMeasure rho]
(hB : IsPreBrownianReal (fun t (w : ℝβ‰₯0 β†’ ΞΉ β†’ ℝ) => w t i) rho)
(eta : Kernel (ℝβ‰₯0 β†’ ΞΉ β†’ ℝ) O) [IsMarkovKernel eta] :
IsPreBrownianReal (fun t (q : (ℝβ‰₯0 β†’ ΞΉ β†’ ℝ) Γ— (O Γ— O)) => q.1 t i)
(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
(i : ΞΉ) (rho : Measure (ℝβ‰₯0 β†’ ΞΉ β†’ ℝ)) [IsProbabilityMeasure rho]
(hB : IsPreBrownianReal (fun t (w : ℝβ‰₯0 β†’ ΞΉ β†’ ℝ) => w t i) 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 i) G
(rho βŠ—β‚˜ (eta Γ—β‚– eta)) := by
have had : StronglyAdapted G
(fun t (q : (ℝβ‰₯0 β†’ ΞΉ β†’ ℝ) Γ— (O Γ— O)) => q.1 t i) := 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 i).comp ((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 i rho hB eta).integrable_eval t)
intro s t hst
rw [hG s]
exact condExp_increment_eq_zero i rho hB eta hst (past s) (hpast s) (hind s)
end Problem367.ConditionalCopyArrayBrownian
end
end OAI