File size: 5,065 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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
import OAI.Probability.FreeIsing.Conditioning.CopyArrayBrownian

namespace OAI

noncomputable section

open MeasureTheory ProbabilityTheory Filter
open scoped NNReal

namespace Problem367.ConditionalCopyBrownian

variable {E O X : Type*} [MeasurableSpace E] [MeasurableSpace X]

theorem pastPath_comap_mono {s t : ℝβ‰₯0} (hst : s ≀ t) :
    MeasurableSpace.comap (PathSplit.pastPath (E := E) s) inferInstance ≀
      MeasurableSpace.comap (PathSplit.pastPath (E := E) t) inferInstance := by
  let : MeasurableSpace (ℝβ‰₯0 β†’ E) :=
    MeasurableSpace.comap (PathSplit.pastPath (E := E) t)
      (inferInstance : MeasurableSpace (Set.Iic t β†’ E))
  have hm : Measurable (PathSplit.pastPath (E := E) s) := by
    exact measurable_pi_iff.mpr fun u =>
      (measurable_pi_apply (⟨u.1, u.2.trans hst⟩ : Set.Iic t)).comp
        (comap_measurable (PathSplit.pastPath t))
  exact hm.comap_le

theorem joinedPast_eq_sup (s : ℝβ‰₯0) (p : O β†’ X) :
    joinedPast (E := E) s p =
      MeasurableSpace.comap (fun z : (ℝβ‰₯0 β†’ E) Γ— (O Γ— O) => PathSplit.pastPath s z.1) inferInstance βŠ”
      (MeasurableSpace.comap (fun z : (ℝβ‰₯0 β†’ E) Γ— (O Γ— O) => p z.2.1) inferInstance βŠ”
       MeasurableSpace.comap (fun z : (ℝβ‰₯0 β†’ E) Γ— (O Γ— O) => p z.2.2) inferInstance) := by
  have h : joinedPast (E := E) s p =
      MeasurableSpace.comap (fun z : (ℝβ‰₯0 β†’ E) Γ— (O Γ— O) => PathSplit.pastPath s z.1) inferInstance βŠ”
      MeasurableSpace.comap (fun z : (ℝβ‰₯0 β†’ E) Γ— (O Γ— O) => (p z.2.1, p z.2.2)) inferInstance :=
    MeasurableSpace.comap_prodMk _ _
  rw [h]
  congr 1
  exact MeasurableSpace.comap_prodMk _ _

theorem joinedPast_mono {s t : ℝβ‰₯0} (hst : s ≀ t) {p q : O β†’ X}
    (hpq : MeasurableSpace.comap p inferInstance ≀
      MeasurableSpace.comap q inferInstance) :
    joinedPast (E := E) s p ≀ joinedPast t q := by
  rw [joinedPast_eq_sup, joinedPast_eq_sup]
  apply sup_le_sup
  Β· have h := MeasurableSpace.comap_mono (g := fun z : (ℝβ‰₯0 β†’ E) Γ— (O Γ— O) => z.1)
      (pastPath_comap_mono (E := E) hst)
    simpa only [MeasurableSpace.comap_comp, Function.comp_def] using h
  Β· apply sup_le_sup
    Β· have h := MeasurableSpace.comap_mono (g := fun z : (ℝβ‰₯0 β†’ E) Γ— (O Γ— O) => z.2.1) hpq
      simpa only [MeasurableSpace.comap_comp, Function.comp_def] using h
    Β· have h := MeasurableSpace.comap_mono (g := fun z : (ℝβ‰₯0 β†’ E) Γ— (O Γ— O) => z.2.2) hpq
      simpa only [MeasurableSpace.comap_comp, Function.comp_def] using h

variable [MeasurableSpace O]

def joinedFiltration (past : ℝβ‰₯0 β†’ O β†’ X) (hpast : βˆ€ s, Measurable (past s))
    (hmono : Monotone (fun s => MeasurableSpace.comap (past s) inferInstance)) :
    Filtration ℝβ‰₯0 (inferInstance : MeasurableSpace ((ℝβ‰₯0 β†’ E) Γ— (O Γ— O))) where
  seq s := joinedPast s (past s)
  mono' := fun _ _ hst => joinedPast_mono hst (hmono hst)
  le' s := joinedPast_le s (hpast s)

@[simp]
theorem joinedFiltration_apply (past : ℝβ‰₯0 β†’ O β†’ X) (hpast : βˆ€ s, Measurable (past s))
    (hmono : Monotone (fun s => MeasurableSpace.comap (past s) inferInstance)) (s : ℝβ‰₯0) :
    joinedFiltration (E := E) past hpast hmono s = joinedPast s (past s) := rfl

end Problem367.ConditionalCopyBrownian

namespace Problem367.ConditionalCopyArrayBrownian

open ConditionalCopyBrownian

variable {ΞΉ O X : Type*} [MeasurableSpace O] [MeasurableSpace X]
variable [StandardBorelSpace X] [Nonempty X]

theorem commonNoise_martingale_joinedFiltration
    (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))
    (hmono : Monotone (fun s => MeasurableSpace.comap (past s) inferInstance))
    (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)
      (joinedFiltration past hpast hmono) (rho βŠ—β‚˜ (eta Γ—β‚– eta)) :=
  commonNoise_martingale i rho hB eta past hpast
    (joinedFiltration past hpast hmono) (fun _ => rfl) hind

theorem isBrownian_commonNoise
    (i : ΞΉ) (rho : Measure (ℝβ‰₯0 β†’ ΞΉ β†’ ℝ)) [IsProbabilityMeasure rho]
    (hB : IsBrownianReal (fun t (w : ℝβ‰₯0 β†’ ΞΉ β†’ ℝ) => w t i) rho)
    (eta : Kernel (ℝβ‰₯0 β†’ ΞΉ β†’ ℝ) O) [IsMarkovKernel eta] :
    IsBrownianReal (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 ⟨isPreBrownian_commonNoise i rho hB.toIsPreBrownianReal eta,
    hmp.quasiMeasurePreserving.ae hB.cont⟩

end Problem367.ConditionalCopyArrayBrownian

end

end OAI