Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3, p. 9 — the small gain theorem: ‖s¹‖^λ_F ≤ (ω₁γ₂⋯γ_m + ⋯ + ω_m)/(1 − γ₁⋯γ_m)

Proved
DIGing.Push.theorem_3

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

control-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1small-gain

Let λ∈(0,1)\lambda\in(0,1)λ∈(0,1) and let s1,…,sm\mathbf s^1,\dots,\mathbf s^ms1,…,sm (m≥1m\ge1m≥1) be sequences of n×pn\times pn×p matrices. Suppose that for all positive integers KKK and each i=1,…,mi=1,\dots,mi=1,…,m there is an arrow si→s(i mod m)+1\mathbf s^i\to\mathbf s^{(i\bmod m)+1}si→s(imodm)+1, that is,

∥s(i mod m)+1∥Fλ,K≤γi∥si∥Fλ,K+ωi,\|\mathbf s^{(i\bmod m)+1}\|_F^{\lambda,K}\le\gamma_i\|\mathbf s^i\|_F^{\lambda,K}+\omega_i,∥s(imodm)+1∥Fλ,K​≤γi​∥si∥Fλ,K​+ωi​,

where the gains γ1,…,γm\gamma_1,\dots,\gamma_mγ1​,…,γm​ are nonnegative and γ1γ2⋯γm<1\gamma_1\gamma_2\cdots\gamma_m<1γ1​γ2​⋯γm​<1. Then for every k≥0k\ge0k≥0

1λk∥s1(k)∥F≤11−γ1γ2⋯γm(ω1γ2γ3⋯γm+ω2γ3⋯γm+⋯+ωm−1γm+ωm),\frac{1}{\lambda^k}\|\mathbf s^1(k)\|_F\le\frac{1}{1-\gamma_1\gamma_2\cdots\gamma_m}\big(\omega_1\gamma_2\gamma_3\cdots\gamma_m+\omega_2\gamma_3\cdots\gamma_m+\cdots+\omega_{m-1}\gamma_m+\omega_m\big),λk1​∥s1(k)∥F​≤1−γ1​γ2​⋯γm​1​(ω1​γ2​γ3​⋯γm​+ω2​γ3​⋯γm​+⋯+ωm−1​γm​+ωm​),

that is, ∥s1∥Fλ=sup⁡kλ−k∥s1(k)∥F\|\mathbf s^1\|^\lambda_F=\sup_k\lambda^{-k}\|\mathbf s^1(k)\|_F∥s1∥Fλ​=supk​λ−k∥s1(k)∥F​ is bounded by the right-hand side.

This is the device that turns the four arrows of the Push-DIGing analysis into a bound on the optimality error.

Formalization Note Indices are 0-based: s1\mathbf s^1s1 is s ⟨0, hm⟩ and the arrow si→s(i mod m)+1\mathbf s^i\to\mathbf s^{(i\bmod m)+1}si→s(imodm)+1 is i ↦ finRotate m i. The bracket is written ∑jωj∏l>jγl\sum_j\omega_j\prod_{l>j}\gamma_l∑j​ωj​∏l>j​γl​. The supremum, which may be infinite, is stated pointwise in kkk. 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 theorem_3 {n p m : ℕ} (hm : 0 < m) (s : Fin m → ℕ → DIGing.Undir.Stack n p) (lam : ℝ)
    (hlam0 : 0 < lam) (hlam1 : lam < 1) (γ ω : Fin m → ℝ) (hγ : ∀ i, 0 ≤ γ i)
    (hprod : ∏ i, γ i < 1)
    (harrow : ∀ K : ℕ, 0 < K → ∀ i : Fin m,
      DIGing.Undir.ergK lam K (fun k => DIGing.Undir.frob (s (finRotate m i) k)) ≤ γ i * DIGing.Undir.ergK lam K (fun k => DIGing.Undir.frob (s i k)) + ω i) :
    ∀ k : ℕ, DIGing.Undir.frob (s ⟨0, hm⟩ k) / lam ^ k ≤
      (1 - ∏ i, γ i)⁻¹ * ∑ j, ω j * ∏ l ∈ Finset.univ.filter (fun l => j < l), γ l := by sorry

end DIGing.Push
Source
arXiv:1607.03218v3, Theorem 3, (7), 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