Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.4, pp. 479–480 — backward discrete Gronwall: max_i a_i ≤ e^{CT}[a_n + Σ_i b_i]

Proved
ZhangBSDE.Scheme.lemma_5_4

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

discrete-inequalitygronwall-inequalityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let π:0=t0<⋯<tn=T\pi:0=t_0<\dots<t_n=Tπ:0=t0​<⋯<tn​=T be a partition, C≥0C\ge0C≥0 a constant, and ai,bia_i,b_iai​,bi​, i=0,…,ni=0,\dots,ni=0,…,n, real numbers with an≥0a_n\ge0an​≥0, bi≥0b_i\ge0bi​≥0 and

ai−1≤(1+CΔti) ai+bi,i=1,…,n.a_{i-1}\le(1+C\Delta t_i)\,a_i+b_i,\qquad i=1,\dots,n .ai−1​≤(1+CΔti​)ai​+bi​,i=1,…,n.

Then

max⁡0≤i≤nai≤eCT[an+∑i=1nbi].\max_{0\le i\le n}a_i\le e^{CT}\Big[a_n+\sum_{i=1}^n b_i\Big].0≤i≤nmax​ai​≤eCT[an​+i=1∑n​bi​].

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 i≤ni\le ni≤n. The hypothesis C≥0C\ge0C≥0 is added: the paper's CCC is its generic positive constant, and for C<0C<0C<0 the conclusion fails already at i=ni=ni=n when an>0a_n>0an​>0.

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
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me