Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4, p. 9 — bounded ‖s‖^λ_F implies the R-linear rate ‖s(k)‖_F ≤ Uλᵏ

Proved
DIGing.Undir.lemma_4

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

ergodic-normlinear-convergencep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let λ∈(0,1)\lambda\in(0,1)λ∈(0,1) and let s(0),s(1),…\mathbf s(0),\mathbf s(1),\dotss(0),s(1),… be n×pn\times pn×p matrices. If ∥s∥Fλ=sup⁡k≥0λ−k∥s(k)∥F≤U\|\mathbf s\|_F^\lambda=\sup_{k\ge0}\lambda^{-k}\|\mathbf s(k)\|_F\le U∥s∥Fλ​=supk≥0​λ−k∥s(k)∥F​≤U, then

∥s(k)∥F≤Uλkfor all k,\|\mathbf s(k)\|_F\le U\lambda^k\qquad\text{for all }k,∥s(k)∥F​≤Uλkfor all k,

so ∥s(k)∥F\|\mathbf s(k)\|_F∥s(k)∥F​ converges to 000 at a global R-linear (geometric) rate O(λk)O(\lambda^k)O(λk).

This turns the bound produced by the small gain theorem into the convergence rate claimed in Theorem 10.

Formalization Note. The bound on the supremum is stated pointwise in kkk.

Preamble
import Mathlib
import Definitions.Def_DIGing_Undir_Common
Formal statement
namespace DIGing.Undir

theorem lemma_4 {n p : ℕ} (s : ℕ → Stack n p) (lam : ℝ) (hlam0 : 0 < lam) (hlam1 : lam < 1)
    (U : ℝ) (hU : ∀ k : ℕ, frob (s k) / lam ^ k ≤ U) :
    ∀ k : ℕ, frob (s k) ≤ U * lam ^ k := by sorry

end DIGing.Undir
Source
Nedić, Olshevsky & Shi, arXiv:1607.03218v3, Lemma 4, p. 9
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 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