Documentation

Mathlib.Analysis.ODE.DiscreteGronwall

Discrete Grönwall inequality #

Various forms of the discrete Grönwall inequality, bounding solutions to recurrence inequalities u (n+1) ≤ c n * u n + b n and u (n+1) ≤ (1 + c n) * u n + b n.

Main results #

References #

See also #

Generalized product form #

theorem discrete_gronwall_prod_general {R : Type u_1} [CommSemiring R] [PartialOrder R] [IsOrderedRing R] {u b c : R} {n₀ : } (hu : nn₀, u (n + 1) c n * u n + b n) (hc : nn₀, 0 c n) n : (hn : n₀ n) :
u n u n₀ * iFinset.Ico n₀ n, c i + kFinset.Ico n₀ n, b k * iFinset.Ico (k + 1) n, c i

Discrete Grönwall inequality, product form: if u (n+1) ≤ c n * u n + b n and 0 ≤ c n then u n ≤ u n₀ * ∏ c i + ∑ b k * ∏ c i over the appropriate ranges.

Real-valued exponential form #

theorem discrete_gronwall {u b c : } {n₀ : } (hun₀ : 0 u n₀) (hu : nn₀, u (n + 1) (1 + c n) * u n + b n) (hc : nn₀, 0 c n) (hb : nn₀, 0 b n) n : (hn : n₀ n) :
u n (u n₀ + kFinset.Ico n₀ n, b k) * Real.exp (∑ iFinset.Ico n₀ n, c i)

Discrete Grönwall inequality, exponential form: if u (n+1) ≤ (1 + c n) * u n + b n with b, c, and u n₀ non-negative, then u n ≤ (u n₀ + ∑ b k) * exp (∑ c i).

theorem discrete_gronwall_Ico {u b c : } {n₀ n₁ : } (hun₀ : 0 u n₀) (hu : nn₀, u (n + 1) (1 + c n) * u n + b n) (hc : nn₀, 0 c n) (hb : nn₀, 0 b n) n : (hn : n Finset.Ico n₀ n₁) :
u n (u n₀ + kFinset.Ico n₀ n₁, b k) * Real.exp (∑ iFinset.Ico n₀ n₁, c i)

Discrete Grönwall inequality, uniform bound: a single bound holding for all n ∈ [n₀, n₁).