Lemma 4, p. 9 — bounded norm ⇒ R-linear rate: λ^{-k}‖s(k)‖_F ≤ U for all k implies ‖s(k)‖_F ≤ Uλᵏ
ProvedDIGing.Push.lemma_4linear-convergencep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1small-gain
Let and let be a sequence of matrices with , i.e. for all . Then
so converges to at the R-linear rate .
This is the last step of the proof of Theorem 18.
Formalization Note The page's "if is bounded" is written with an explicit bound ; the statement is close to unfolding the definition and is included because the paper states it and the goal's proof cites it. This statement is identical to the one in the companion DIGing mission.
Preamble
import Mathlib import Definitions.Def_DIGing_Undir_Common
Formal statement
namespace DIGing.Push
theorem lemma_4 {n p : ℕ} (s : ℕ → DIGing.Undir.Stack n p) (lam : ℝ) (hlam0 : 0 < lam) (hlam1 : lam < 1)
(U : ℝ) (hU : ∀ k : ℕ, DIGing.Undir.frob (s k) / lam ^ k ≤ U) :
∀ k : ℕ, DIGing.Undir.frob (s k) ≤ U * lam ^ k := by sorry
end DIGing.Push
Source
arXiv:1607.03218v3, Lemma 4, p. 9
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.