Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4, p. 9 — bounded norm ⇒ R-linear rate: λ^{-k}‖s(k)‖_F ≤ U for all k implies ‖s(k)‖_F ≤ Uλᵏ

Proved
DIGing.Push.lemma_4

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

linear-convergencep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1small-gain

Let λ∈(0,1)\lambda\in(0,1)λ∈(0,1) and let s\mathbf ss be a sequence of n×pn\times pn×p matrices with ∥s∥Fλ≤U\|\mathbf s\|^\lambda_F\le U∥s∥Fλ​≤U, i.e. 1λk∥s(k)∥F≤U\frac1{\lambda^k}\|\mathbf s(k)\|_F\le Uλk1​∥s(k)∥F​≤U for all kkk. Then

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

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

This is the last step of the proof of Theorem 18.

Formalization Note The page's "if ∥s∥Fλ\|\mathbf s\|^\lambda_F∥s∥Fλ​ is bounded" is written with an explicit bound UUU; 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
  • 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