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

namespace OAI

noncomputable section
open MeasureTheory ProbabilityTheory Filter
open scoped NNReal Topology

namespace Problem367.BrownianIntegralProcess

variable {Ξ© : Type*} [MeasurableSpace Ξ©] {P : Measure Ξ©}

theorem exists_rapid_meanSquare_subsequence
    {X : β„• β†’ Ξ© β†’ ℝ} (hX : βˆ€ n, MemLp (X n) 2 P)
    (hCauchy : CauchySeq (fun n => (hX n).toLp (X n))) :
    βˆƒ k : β„• β†’ β„•, StrictMono k ∧
      Summable (fun n => (4 : ℝ) ^ n *
        ∫ Ο‰, (X (k (n + 1)) Ο‰ - X (k n) Ο‰) ^ 2 βˆ‚P) := by
  obtain ⟨k, hk, hstep⟩ := Metric.exists_subseq_bounded_of_cauchySeq
    (fun n => (hX n).toLp (X n)) hCauchy
    (fun n => (1 / 4 : ℝ) ^ n) (fun n => by positivity)
  refine ⟨k, hk, ?_⟩
  apply Summable.of_nonneg_of_le
    (fun n => mul_nonneg (by positivity) (integral_nonneg (fun Ο‰ => sq_nonneg _)))
    (f := fun n => (1 / 4 : ℝ) ^ n) ?_
    (summable_geometric_of_lt_one (by norm_num) (by norm_num))
  intro n
  have hnorm : β€–(hX (k (n + 1))).toLp (X (k (n + 1))) -
      (hX (k n)).toLp (X (k n))β€– ≀ (1 / 4 : ℝ) ^ n := by
    simpa only [dist_eq_norm] using
      (hstep n (k (n + 1)) (hk.monotone (Nat.le_succ n))).le
  have hsq := (sq_le_sqβ‚€ (norm_nonneg _) (by positivity : 0 ≀ (1 / 4 : ℝ) ^ n)).2 hnorm
  rw [BrownianGrid.norm_sq_toLp_sub] at hsq
  calc
    _ ≀ (4 : ℝ) ^ n * ((1 / 4 : ℝ) ^ n) ^ 2 :=
      mul_le_mul_of_nonneg_left hsq (by positivity)
    _ = _ := by
      simp only [pow_two, ← mul_pow]
      norm_num

omit [MeasurableSpace Ξ©] in
theorem continuous_stoppedUniformSum
    {B H : ℝβ‰₯0 β†’ Ξ© β†’ ℝ} {Ο‰ : Ξ©}
    (hB : Continuous (fun t => B t Ο‰)) (T : ℝβ‰₯0) (n : β„•) :
    Continuous (fun t => stoppedUniformSum B H T n t Ο‰) := by
  unfold stoppedUniformSum
  apply continuous_finsetSum
  intro i hi
  exact continuous_const.mul
    ((hB.comp (continuous_id.min continuous_const)).sub
      (hB.comp (continuous_id.min continuous_const)))

theorem ae_continuous_stoppedUniformSum
    {B H : ℝβ‰₯0 β†’ Ξ© β†’ ℝ}
    (hB : βˆ€α΅ Ο‰ βˆ‚P, Continuous (fun t => B t Ο‰)) (T : ℝβ‰₯0) (n : β„•) :
    βˆ€α΅ Ο‰ βˆ‚P, Continuous (fun t => stoppedUniformSum B H T n t Ο‰) := by
  filter_upwards [hB] with ω hω
  exact continuous_stoppedUniformSum hω T n

omit [MeasurableSpace Ξ©] in
@[simp] theorem stoppedUniformSum_zero (B H : ℝβ‰₯0 β†’ Ξ© β†’ ℝ) (T : ℝβ‰₯0) (n : β„•) :
    stoppedUniformSum B H T n 0 = 0 := by
  funext Ο‰
  simp [stoppedUniformSum, StoppedSimpleIntegral.intervalSum]

theorem initial_zero_of_stopped_uniform_limit
    {B H M : ℝβ‰₯0 β†’ Ξ© β†’ ℝ} (T : ℝβ‰₯0) (hM : MemLp (M 0) 2 P)
    (hlim : Tendsto (fun n => ∫ Ο‰,
      (stoppedUniformSum B H T n 0 Ο‰ - M 0 Ο‰) ^ 2 βˆ‚P) atTop (𝓝 0)) :
    M 0 =ᡐ[P] 0 := by
  have hlim' : Tendsto (fun _ : β„• => ∫ Ο‰, (M 0 Ο‰) ^ 2 βˆ‚P) atTop (𝓝 0) := by
    simpa only [stoppedUniformSum_zero, Pi.zero_apply, zero_sub, neg_sq] using hlim
  have hzero : (∫ Ο‰, (M 0 Ο‰) ^ 2 βˆ‚P) = 0 :=
    tendsto_nhds_unique tendsto_const_nhds hlim'
  apply ae_eq_of_integral_sq_sub_eq_zero
  Β· simpa only [Pi.zero_apply, sub_zero] using hM.integrable_sq
  Β· simpa only [Pi.zero_apply, sub_zero] using hzero

end Problem367.BrownianIntegralProcess

end

end OAI