Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3 — a three-step linear recursion with block-bounded perturbations has summable terms

Proved
BotNguyenADMM.KL.lemma_3

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

nonconvex-optimizationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1real-sequences

Let ak=(a1k,…,aNk)∈R+Na^k=(a_1^k,\dots,a_N^k)\in\mathbb R^N_+ak=(a1k​,…,aNk​)∈R+N​ and δk∈R\delta_k\in\mathbb Rδk​∈R satisfy, for every k≥2k\ge2k≥2,

⟨1,ak+1⟩≤⟨c0,ak⟩+⟨c1,ak−1⟩+⟨c2,ak−2⟩+δk,\langle\mathbb 1,a^{k+1}\rangle\le\langle c_0,a^k\rangle+\langle c_1,a^{k-1}\rangle+\langle c_2,a^{k-2}\rangle+\delta_k,⟨1,ak+1⟩≤⟨c0​,ak⟩+⟨c1​,ak−1⟩+⟨c2​,ak−2⟩+δk​,

where c0∈RNc_0\in\mathbb R^Nc0​∈RN, c1,c2∈R+Nc_1,c_2\in\mathbb R^N_+c1​,c2​∈R+N​ and c0+c1+c2<1c_0+c_1+c_2<\mathbb 1c0​+c1​+c2​<1 componentwise. Assume there is δˉ≥0\bar\delta\ge0δˉ≥0 with ∑k=K‾K‾δk≤δˉ\sum_{k=\underline K}^{\overline K}\delta_k\le\bar\delta∑k=K​K​δk​≤δˉ for all K‾≥K‾≥2\overline K\ge\underline K\ge2K≥K​≥2. Then ∑k≥0aik<+∞\sum_{k\ge0}a_i^k<+\infty∑k≥0​aik​<+∞ for every iii, and for every iii and every K‾≥K‾≥2\overline K\ge\underline K\ge2K≥K​≥2,

∑k=K‾K‾aik≤∑j=1N[(1−c0,j−c1,j)ajK‾+(1−c0,j)ajK‾+1+ajK‾+2]+δˉ1−c0,i−c1,i−c2,i.\sum_{k=\underline K}^{\overline K}a_i^k\le\frac{\sum_{j=1}^N\big[(1-c_{0,j}-c_{1,j})a_j^{\underline K}+(1-c_{0,j})a_j^{\underline K+1}+a_j^{\underline K+2}\big]+\bar\delta}{1-c_{0,i}-c_{1,i}-c_{2,i}} .k=K​∑K​aik​≤1−c0,i​−c1,i​−c2,i​∑j=1N​[(1−c0,j​−c1,j​)ajK​​+(1−c0,j​)ajK​+1​+ajK​+2​]+δˉ​.

It closes the proof of Theorem 14, applied with N=1N=1N=1 and ak=∥xk−xk−1∥a^k=\|x^k-x^{k-1}\|ak=∥xk−xk−1∥.

Preamble
import Mathlib
open Filter Topology
Formal statement
namespace BotNguyenADMM.KL

/-- Lemma 3 (p. 6). Let `aᵏ ∈ ℝᴺ₊` and `δ_k ∈ ℝ` satisfy
`⟨𝟙, aᵏ⁺¹⟩ ≤ ⟨c₀, aᵏ⟩ + ⟨c₁, aᵏ⁻¹⟩ + ⟨c₂, aᵏ⁻²⟩ + δ_k` for all `k ≥ 2` (9), where `c₀ ∈ ℝᴺ`,
`c₁, c₂ ∈ ℝᴺ₊` and `c₀ + c₁ + c₂ < 𝟙` componentwise, and let `δ̄ ≥ 0` bound every block sum
`∑_{k=K̲}^{K̄} δ_k` with `K̄ ≥ K̲ ≥ 2`. Then every coordinate sequence `(a_iᵏ)_k` is summable and
(10) holds for every `i` and every `K̄ ≥ K̲ ≥ 2`. -/
theorem lemma_3 (N : ℕ) (a : ℕ → Fin N → ℝ) (ha : ∀ k i, 0 ≤ a k i) (δ : ℕ → ℝ)
    (c₀ c₁ c₂ : Fin N → ℝ) (hc₁ : ∀ i, 0 ≤ c₁ i) (hc₂ : ∀ i, 0 ≤ c₂ i)
    (hc : ∀ i, c₀ i + c₁ i + c₂ i < 1)
    (h9 : ∀ k, 2 ≤ k → ∑ i, a (k + 1) i ≤
      ∑ i, c₀ i * a k i + ∑ i, c₁ i * a (k - 1) i + ∑ i, c₂ i * a (k - 2) i + δ k)
    (δbar : ℝ) (hδbar : 0 ≤ δbar)
    (hδ : ∀ Klo Khi : ℕ, 2 ≤ Klo → Klo ≤ Khi → ∑ k ∈ Finset.Icc Klo Khi, δ k ≤ δbar) :
    (∀ i, Summable (fun k => a k i)) ∧
    ∀ (i : Fin N) (Klo Khi : ℕ), 2 ≤ Klo → Klo ≤ Khi →
      ∑ k ∈ Finset.Icc Klo Khi, a k i ≤
        (∑ j, ((1 - c₀ j - c₁ j) * a Klo j + (1 - c₀ j) * a (Klo + 1) j + a (Klo + 2) j)
          + δbar) / (1 - c₀ i - c₁ i - c₂ i) := by sorry

end BotNguyenADMM.KL
Source
Boţ and Nguyen, The proximal ADMM in the nonconvex setting, arXiv:1801.01994v2, p. 6, Lemma 3, (9)–(10)
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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