Lemma 5.4, pp. 479–480 — backward discrete Gronwall: max_i a_i ≤ e^{CT}[a_n + Σ_i b_i]
ProvedZhangBSDE.Scheme.lemma_5_4discrete-inequalitygronwall-inequalityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a partition, a constant, and , , real numbers with , and
Then
This discrete Gronwall inequality, run backward in time, is applied to the one-step error recursion of the backward scheme in the proof of Theorem 5.3.
Formalization Note The maximum is stated as a bound for every . The hypothesis is added: the paper's is its generic positive constant, and for the conclusion fails already at when .
Preamble
import Mathlib import Definitions.Def_ZhangBSDE_Scheme_Setting open MeasureTheory Filter Topology Set Peng1990.SMP ReflectedBSDE.Existence open scoped NNReal ENNReal
Formal statement
namespace ZhangBSDE.Scheme
/-- Lemma 5.4 (pp. 479–480), a backward discrete Gronwall inequality: for a partition
`π : 0 = t_0 < ⋯ < t_n = T`, a constant `C ≥ 0` and reals `a_i, b_i` (`i = 0, …, n`) with `a_n ≥ 0`,
`b_i ≥ 0` and `a_{i−1} ≤ (1 + C Δt_i) a_i + b_i` for `i = 1, …, n`,
`max_{0≤i≤n} a_i ≤ e^{CT} [a_n + Σ_{i=1}^n b_i]`. -/
theorem lemma_5_4 {T : ℝ≥0} (π : Partition T) (C : ℝ) (hC : 0 ≤ C) (a b : ℕ → ℝ)
(ha : 0 ≤ a π.n) (hb : ∀ i ≤ π.n, 0 ≤ b i)
(hrec : ∀ i ∈ Finset.Icc 1 π.n, a (i - 1) ≤ (1 + C * π.Δt i) * a i + b i) :
∀ i ≤ π.n, a i ≤ Real.exp (C * T) * (a π.n + ∑ j ∈ Finset.Icc 1 π.n, b j) := by sorry
end ZhangBSDE.Scheme
Source
Zhang (2004), Ann. Appl. Probab. 14, Lemma 5.4, pp. 479–480
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.