File size: 3,355 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
import OAI.Probability.FreeIsing.Brownian.IntegralProcess

namespace OAI

noncomputable section
open MeasureTheory
open scoped NNReal
namespace Problem367.RandomStoppedSimpleIntegral

variable {Ξ© I : Type*} [LinearOrder I] [Nonempty I]

theorem stoppedProcess_min (B : I β†’ Ξ© β†’ ℝ) (Ο„ : Ξ© β†’ WithTop I) (a t : I) (Ο‰ : Ξ©) :
    stoppedProcess B Ο„ (min t a) Ο‰ =
      B (min (min (t : WithTop I) (Ο„ Ο‰)).untopA a) Ο‰ := by
  rcases eq_or_ne (Ο„ Ο‰) ⊀ with hΟ„ | hΟ„
  Β· simp only [stoppedProcess, hΟ„, min_eq_left le_top]
    rfl
  Β· obtain ⟨s, hs⟩ := WithTop.ne_top_iff_exists.mp hΟ„
    simp only [stoppedProcess, ← hs, ← WithTop.coe_min]
    change B (min (min t a) s) Ο‰ = B (min (min t s) a) Ο‰
    rw [min_right_comm t a s]

theorem stopped_intervalSum (B H : I β†’ Ξ© β†’ ℝ) (Ο„ : Ξ© β†’ WithTop I)
    {a b : I} (hab : a ≀ b) (t : I) (Ο‰ : Ξ©) :
    stoppedProcess (StoppedSimpleIntegral.intervalSum B (H a) a b) Ο„ t Ο‰ =
      StoppedSimpleIntegral.intervalSum (stoppedProcess B Ο„)
        (stoppedProcess H Ο„ a) a b t Ο‰ := by
  rw [StoppedSimpleIntegral.intervalSum, stoppedProcess_min, stoppedProcess_min]
  change H a Ο‰ * (B (min (min (t : WithTop I) (Ο„ Ο‰)).untopA b) Ο‰ -
    B (min (min (t : WithTop I) (Ο„ Ο‰)).untopA a) Ο‰) = _
  by_cases ha : (a : WithTop I) ≀ Ο„ Ο‰
  Β· rw [stoppedProcess_eq_of_le ha]
  Β· have hΟ„a : Ο„ Ο‰ ≀ (a : WithTop I) := le_of_not_ge ha
    have hcap : (min (t : WithTop I) (Ο„ Ο‰)).untopA ≀ a := by
      exact WithTop.untopA_le ((min_le_right _ _).trans hΟ„a)
    rw [min_eq_left hcap, min_eq_left (hcap.trans hab), sub_self, mul_zero, mul_zero]

theorem stopped_intervalSum_integrator (B : I β†’ Ξ© β†’ ℝ) (H : Ξ© β†’ ℝ)
    (Ο„ : Ξ© β†’ WithTop I) (a b t : I) (Ο‰ : Ξ©) :
    stoppedProcess (StoppedSimpleIntegral.intervalSum B H a b) Ο„ t Ο‰ =
      StoppedSimpleIntegral.intervalSum (stoppedProcess B Ο„) H a b t Ο‰ := by
  rw [StoppedSimpleIntegral.intervalSum, stoppedProcess_min, stoppedProcess_min]
  rfl

theorem stopped_finite_intervalSum {J : Type*} (s : Finset J)
    (B : I β†’ Ξ© β†’ ℝ) (H : J β†’ Ξ© β†’ ℝ) (a b : J β†’ I) (Ο„ : Ξ© β†’ WithTop I) :
    stoppedProcess (fun t Ο‰ => βˆ‘ i ∈ s,
      StoppedSimpleIntegral.intervalSum B (H i) (a i) (b i) t Ο‰) Ο„ =
    fun t Ο‰ => βˆ‘ i ∈ s,
      StoppedSimpleIntegral.intervalSum (stoppedProcess B Ο„) (H i) (a i) (b i) t Ο‰ := by
  funext t Ο‰
  change (βˆ‘ i ∈ s, stoppedProcess
    (StoppedSimpleIntegral.intervalSum B (H i) (a i) (b i)) Ο„ t Ο‰) = _
  exact Finset.sum_congr rfl fun i hi =>
    stopped_intervalSum_integrator B (H i) Ο„ (a i) (b i) t Ο‰

theorem stopped_uniformSum (B H : ℝβ‰₯0 β†’ Ξ© β†’ ℝ) (T : ℝβ‰₯0)
    (n : β„•) (Ο„ : Ξ© β†’ WithTop ℝβ‰₯0) :
    stoppedProcess (BrownianIntegralProcess.stoppedUniformSum B H T n) Ο„ =
      BrownianIntegralProcess.stoppedUniformSum
        (stoppedProcess B Ο„) (stoppedProcess H Ο„) T n := by
  funext t Ο‰
  change (βˆ‘ i ∈ Finset.range n, stoppedProcess
    (StoppedSimpleIntegral.intervalSum B (H (BrownianGrid.uniformGrid T n i))
      (BrownianGrid.uniformGrid T n i) (BrownianGrid.uniformGrid T n (i + 1)))
    Ο„ t Ο‰) = _
  exact Finset.sum_congr rfl fun i hi => stopped_intervalSum B H Ο„
    (BrownianGrid.uniformGrid_mono T n (Nat.le_succ i)) t Ο‰

end Problem367.RandomStoppedSimpleIntegral

end

end OAI