Documentation

SHSLib.Gardiner.Ito.StochDE.EulerDef

The Euler–Maruyama (Cauchy–Euler) scheme #

Gardiner §4.3.1 (4.3.5)–(4.3.9) and §10.1.4 (10.1.13)–(10.1.17). On the uniform grid t_i = t₀ + i τ, the Euler scheme is x_{i+1} = x_i + a(x_i, t_i) τ + b(x_i, t_i) (W(t_{i+1}) - W(t_i)), x_0 = ξ (eulerSeq).

For the error analysis we use the continuous-time interpolation (eulerInterp) X(u) = ξ + ∫_{t₀}^u a(x_{k(s)}, t_{k(s)}) ds + Σ_i b(x_i, t_i) (W(t_{i+1} ∧ u) - W(t_i ∧ u)), which satisfies X(t_k) = x_k (eulerInterp_grid) and is the Itô process with the step coefficients (eulerInterp_eq).

def Gardiner.Ito.StochDE.eulerGrid (t₀ τ : ℝ) (i : ℕ) :

The uniform grid t_i = t₀ + i τ.

Equations
Instances For
    def Gardiner.Ito.StochDE.eulerSeq {Ω : Type u_1} (W : ℝ → Ω → ℝ) (a b : ℝ → ℝ → ℝ) (t₀ τ : ℝ) (ξ : Ω → ℝ) :
    ℕ → Ω → ℝ

    The Euler–Maruyama scheme (4.3.6) / (10.1.15): x_{i+1} = x_i + a(x_i, t_i) τ + b(x_i, t_i) ΔW_i, x_0 = ξ.

    Equations
    Instances For
      def Gardiner.Ito.StochDE.eulerDrift {Ω : Type u_1} (W : ℝ → Ω → ℝ) (a b : ℝ → ℝ → ℝ) (t₀ τ : ℝ) (ξ : Ω → ℝ) (N : ℕ) (s : ℝ) (ω : Ω) :

      The step drift s ↦ a(x_{k(s)}, t_{k(s)}) on (t₀, t_N].

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For
        def Gardiner.Ito.StochDE.eulerNoise {Ω : Type u_1} (W : ℝ → Ω → ℝ) (a b : ℝ → ℝ → ℝ) (t₀ τ : ℝ) (ξ : Ω → ℝ) (N : ℕ) (s : ℝ) (ω : Ω) :

        The step diffusion s ↦ b(x_{k(s)}, t_{k(s)}) on (t₀, t_N].

        Equations
        • One or more equations did not get rendered due to their size.
        Instances For
          def Gardiner.Ito.StochDE.eulerNoiseRun {Ω : Type u_1} (W : ℝ → Ω → ℝ) (a b : ℝ → ℝ → ℝ) (t₀ τ : ℝ) (ξ : Ω → ℝ) (N : ℕ) (u : ℝ) (ω : Ω) :

          The running sum Σ_i b(x_i, t_i) (W(t_{i+1} ∧ u) - W(t_i ∧ u)).

          Equations
          • One or more equations did not get rendered due to their size.
          Instances For
            def Gardiner.Ito.StochDE.eulerInterp {Ω : Type u_1} (W : ℝ → Ω → ℝ) (a b : ℝ → ℝ → ℝ) (t₀ τ : ℝ) (ξ : Ω → ℝ) (N : ℕ) (u : ℝ) (ω : Ω) :

            The continuous Euler interpolation X(u) = ξ + ∫_{t₀}^u a(x_{k(s)}, t_{k(s)}) ds + Σ_i b(x_i, t_i) (W(t_{i+1} ∧ u) - W(t_i ∧ u)).

            Equations
            Instances For

              Grid arithmetic #

              theorem Gardiner.Ito.StochDE.eulerGrid_succ (t₀ τ : ℝ) (i : ℕ) :
              eulerGrid t₀ τ (i + 1) = eulerGrid t₀ τ i + τ
              theorem Gardiner.Ito.StochDE.eulerGrid_mono {t₀ τ : ℝ} (hτ : 0 ≤ τ) {i j : ℕ} (h : i ≤ j) :
              eulerGrid t₀ τ i ≤ eulerGrid t₀ τ j
              theorem Gardiner.Ito.StochDE.le_eulerGrid {t₀ τ : ℝ} (hτ : 0 ≤ τ) (i : ℕ) :
              t₀ ≤ eulerGrid t₀ τ i
              theorem Gardiner.Ito.StochDE.eulerGrid_zero {t₀ τ : ℝ} :
              eulerGrid t₀ τ 0 = t₀

              Measurability and integrability of the scheme #

              theorem Gardiner.Ito.StochDE.eulerSeq_zero {Ω : Type u_1} (W : ℝ → Ω → ℝ) (a b : ℝ → ℝ → ℝ) (t₀ τ : ℝ) (ξ : Ω → ℝ) :
              eulerSeq W a b t₀ τ ξ 0 = ξ
              theorem Gardiner.Ito.StochDE.eulerSeq_succ {Ω : Type u_1} (W : ℝ → Ω → ℝ) (a b : ℝ → ℝ → ℝ) (t₀ τ : ℝ) (ξ : Ω → ℝ) (i : ℕ) (ω : Ω) :
              eulerSeq W a b t₀ τ ξ (i + 1) ω = eulerSeq W a b t₀ τ ξ i ω + a (eulerSeq W a b t₀ τ ξ i ω) (eulerGrid t₀ τ i) * τ + b (eulerSeq W a b t₀ τ ξ i ω) (eulerGrid t₀ τ i) * (W (eulerGrid t₀ τ (i + 1)) ω - W (eulerGrid t₀ τ i) ω)
              theorem Gardiner.Ito.StochDE.stronglyMeasurable_comp_coeff {Ω : Type u_1} [mΩ : MeasurableSpace Ω] {m : MeasurableSpace Ω} {F : ℝ → ℝ → ℝ} (hF : Measurable (Function.uncurry F)) {X : Ω → ℝ} (hX : MeasureTheory.StronglyMeasurable X) (t : ℝ) :
              MeasureTheory.StronglyMeasurable fun (ω : Ω) => F (X ω) t
              theorem Gardiner.Ito.StochDE.eulerSeq_adapted {Ω : Type u_1} [mΩ : MeasurableSpace Ω] {𝓕 : MeasureTheory.Filtration ℝ mΩ} {P : MeasureTheory.Measure Ω} {W : ℝ → Ω → ℝ} {a b : ℝ → ℝ → ℝ} {t₀ τ : ℝ} {ξ : Ω → ℝ} (hW : IsFWiener W 𝓕 P) (ha : Measurable (Function.uncurry a)) (hb : Measurable (Function.uncurry b)) (ht₀ : 0 ≤ t₀) (hτ : 0 ≤ τ) (hξm : MeasureTheory.StronglyMeasurable ξ) (i : ℕ) :

              The Euler iterates are adapted: x_i is 𝓕 t_i-measurable.

              theorem Gardiner.Ito.StochDE.memLp_coeff_of_growth {Ω : Type u_1} [mΩ : MeasurableSpace Ω] {P : MeasureTheory.Measure Ω} [MeasureTheory.IsFiniteMeasure P] {F : ℝ → ℝ → ℝ} (hF : Measurable (Function.uncurry F)) {X : Ω → ℝ} (hX : MeasureTheory.MemLp X 2 P) (hXm : Measurable X) {t C : ℝ} (hg : ∀ (y : ℝ), |F y t| ≤ C * (1 + |y|)) :
              MeasureTheory.MemLp (fun (ω : Ω) => F (X ω) t) 2 P
              theorem Gardiner.Ito.StochDE.eulerSeq_memLp {Ω : Type u_1} [mΩ : MeasurableSpace Ω] {𝓕 : MeasureTheory.Filtration ℝ mΩ} {P : MeasureTheory.Measure Ω} {W : ℝ → Ω → ℝ} {a b : ℝ → ℝ → ℝ} {t₀ τ K : ℝ} {ξ : Ω → ℝ} {T : ℝ} (hW : IsFWiener W 𝓕 P) (hc : SDECoeffs a b t₀ T K) (ht₀ : 0 ≤ t₀) (hτ : 0 ≤ τ) (hξm : MeasureTheory.StronglyMeasurable ξ) (hξ : MeasureTheory.MemLp ξ 2 P) {n : ℕ} (hn : eulerGrid t₀ τ n ≤ T) (i : ℕ) :
              i ≤ n → MeasureTheory.MemLp (eulerSeq W a b t₀ τ ξ i) 2 P

              The Euler iterates are square integrable (up to the final time t_N ≤ T).

              Cells of the grid #

              theorem Gardiner.Ito.StochDE.exists_gridCell {t₀ τ : ℝ} (hτ : 0 < τ) {N : ℕ} {s : ℝ} (hs : s ∈ Set.Ioc t₀ (eulerGrid t₀ τ N)) :
              ∃ k < N, eulerGrid t₀ τ k < s ∧ s ≤ eulerGrid t₀ τ (k + 1)

              Every s ∈ (t₀, t_N] lies in a cell (t_k, t_{k+1}] with k < N.

              theorem Gardiner.Ito.StochDE.sum_cellInd_eq {t₀ τ : ℝ} (hτ : 0 < τ) {N k : ℕ} (hk : k < N) {s : ℝ} (hs1 : eulerGrid t₀ τ k < s) (hs2 : s ≤ eulerGrid t₀ τ (k + 1)) (v : ℕ → ℝ) :
              ∑ i : Fin N, v ↑i * cellInd (eulerGrid t₀ τ ↑i) (eulerGrid t₀ τ (↑i + 1)) s = v k

              On the cell (t_k, t_{k+1}], a step function Σ_i v_i 1_{(t_i, t_{i+1}]} equals v_k.

              theorem Gardiner.Ito.StochDE.integral_cellInd_grid {t₀ τ : ℝ} (hτ : 0 < τ) (i k : ℕ) :
              ∫ (s : ℝ) in t₀..eulerGrid t₀ τ k, cellInd (eulerGrid t₀ τ i) (eulerGrid t₀ τ (i + 1)) s = if i < k then τ else 0
              theorem Gardiner.Ito.StochDE.sum_fin_ite_lt {N k : ℕ} (hk : k ≤ N) (f : ℕ → ℝ) :
              (∑ i : Fin N, if ↑i < k then f ↑i else 0) = ∑ i ∈ Finset.range k, f i

              The interpolation on the grid #

              theorem Gardiner.Ito.StochDE.eulerSeq_eq_sum {Ω : Type u_1} {W : ℝ → Ω → ℝ} {a b : ℝ → ℝ → ℝ} {t₀ τ : ℝ} {ξ : Ω → ℝ} (k : ℕ) (ω : Ω) :
              eulerSeq W a b t₀ τ ξ k ω = ξ ω + ∑ i ∈ Finset.range k, (a (eulerSeq W a b t₀ τ ξ i ω) (eulerGrid t₀ τ i) * τ + b (eulerSeq W a b t₀ τ ξ i ω) (eulerGrid t₀ τ i) * (W (eulerGrid t₀ τ (i + 1)) ω - W (eulerGrid t₀ τ i) ω))
              theorem Gardiner.Ito.StochDE.integrable_eulerDrift {Ω : Type u_1} {W : ℝ → Ω → ℝ} {a b : ℝ → ℝ → ℝ} {t₀ τ : ℝ} {ξ : Ω → ℝ} (N : ℕ) (ω : Ω) :
              MeasureTheory.Integrable (fun (s : ℝ) => eulerDrift W a b t₀ τ ξ N s ω) MeasureTheory.volume
              theorem Gardiner.Ito.StochDE.eulerInterp_grid {Ω : Type u_1} {W : ℝ → Ω → ℝ} {a b : ℝ → ℝ → ℝ} {t₀ τ : ℝ} {N : ℕ} {ξ : Ω → ℝ} (hτ : 0 < τ) {k : ℕ} (hk : k ≤ N) (ω : Ω) :
              eulerInterp W a b t₀ τ ξ N (eulerGrid t₀ τ k) ω = eulerSeq W a b t₀ τ ξ k ω

              The interpolation agrees with the Euler scheme on the grid: X(t_k) = x_k for k ≤ N.

              theorem Gardiner.Ito.StochDE.exists_eulerElem {Ω : Type u_1} [mΩ : MeasurableSpace Ω] {𝓕 : MeasureTheory.Filtration ℝ mΩ} {P : MeasureTheory.Measure Ω} {W : ℝ → Ω → ℝ} {a b : ℝ → ℝ → ℝ} {t₀ τ K : ℝ} {N : ℕ} {ξ : Ω → ℝ} (hW : IsFWiener W 𝓕 P) (hc : SDECoeffs a b t₀ (eulerGrid t₀ τ N) K) (ht₀ : 0 ≤ t₀) (hτ : 0 < τ) (hξm : MeasureTheory.StronglyMeasurable ξ) (hξ : MeasureTheory.MemLp ξ 2 P) :
              ∃ (H : ElemIntegrand 𝓕 P (Fin N)), H.process = eulerNoise W a b t₀ τ ξ N ∧ ElemIntegrand.running W H = eulerNoiseRun W a b t₀ τ ξ N ∧ H.SupportedIn (eulerGrid t₀ τ N)

              The step diffusion is the process of an elementary integrand, whose running sum is eulerNoiseRun.

              theorem Gardiner.Ito.StochDE.eulerInterp_eq {Ω : Type u_1} [mΩ : MeasurableSpace Ω] {𝓕 : MeasureTheory.Filtration ℝ mΩ} {P : MeasureTheory.Measure Ω} {W : ℝ → Ω → ℝ} {a b : ℝ → ℝ → ℝ} {t₀ τ K : ℝ} {N : ℕ} {ξ : Ω → ℝ} (hW : IsFWiener W 𝓕 P) (hc : SDECoeffs a b t₀ (eulerGrid t₀ τ N) K) (ht₀ : 0 ≤ t₀) (hτ : 0 < τ) (hξm : MeasureTheory.StronglyMeasurable ξ) (hξ : MeasureTheory.MemLp ξ 2 P) (u : ℝ) :
              u ∈ Set.Icc t₀ (eulerGrid t₀ τ N) → eulerInterp W a b t₀ τ ξ N u =ᵐ[P] fun (ω : Ω) => (ξ ω + ∫ (s : ℝ) in t₀..u, eulerDrift W a b t₀ τ ξ N s ω) + itoInt W 𝓕 P u (eulerNoise W a b t₀ τ ξ N) ω

              The interpolation is the Itô process with the step coefficients: X(u) = ξ + ∫_{t₀}^u a(x_{k(s)}, t_{k(s)}) ds + ∫_{t₀}^u b(x_{k(s)}, t_{k(s)}) dW(s).

              theorem Gardiner.Ito.StochDE.continuous_eulerInterp {Ω : Type u_1} {W : ℝ → Ω → ℝ} {a b : ℝ → ℝ → ℝ} {t₀ τ : ℝ} {N : ℕ} {ξ : Ω → ℝ} {ω : Ω} (hω : Continuous fun (t : ℝ) => W t ω) :
              Continuous fun (u : ℝ) => eulerInterp W a b t₀ τ ξ N u ω