Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix A, p. 107 — ρ∑(∥rk+1∥22+∥B(zk+1−zk)∥22)\rho\sum(\|r^{k+1}\|_2^2+\|B(z^{k+1}-z^k)\|_2^2)ρ∑(∥rk+1∥22​+∥B(zk+1−zk)∥22​) is bounded, so rk→0r^k\to0rk→0 and B(zk+1−zk)→0B(z^{k+1}-z^k)\to0B(zk+1−zk)→0

Proved
BoydADMM.Convergence.summed_bound

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

admmconvergence-prooflyapunovp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-bookp2o-v1

Under Assumptions 1 and 2, with ρ>0\rho>0ρ>0, a saddle point (x⋆,z⋆,y⋆)(x^\star,z^\star,y^\star)(x⋆,z⋆,y⋆) of L0L_0L0​ and any ADMM run, let Vk=(1/ρ)∥yk−y⋆∥22+ρ∥B(zk−z⋆)∥22V^k=(1/\rho)\|y^k-y^\star\|_2^2+\rho\|B(z^k-z^\star)\|_2^2Vk=(1/ρ)∥yk−y⋆∥22​+ρ∥B(zk−z⋆)∥22​ and rk=Axk+Bzk−cr^k=Ax^k+Bz^k-crk=Axk+Bzk−c. Then

ρ∑k=1∞(∥rk+1∥22+∥B(zk+1−zk)∥22)≤V1,\rho\sum_{k=1}^{\infty}\Bigl(\|r^{k+1}\|_2^2+\|B(z^{k+1}-z^k)\|_2^2\Bigr)\le V^1,ρk=1∑∞​(∥rk+1∥22​+∥B(zk+1−zk)∥22​)≤V1,

and consequently rk→0r^k\to0rk→0 and B(zk+1−zk)→0B(z^{k+1}-z^k)\to0B(zk+1−zk)→0 as k→∞k\to\inftyk→∞.

The vanishing of B(zk+1−zk)B(z^{k+1}-z^k)B(zk+1−zk) gives, after multiplication by ρAT\rho A^TρAT, the convergence of the dual residual to zero.

Formalization Note The book writes the sum from k=0k=0k=0 bounded by V0V^0V0, obtained by iterating (A.1); since (A.1) is proved only for k≥1k\ge1k≥1 (see ineq_A1), we state the sum from k=1k=1k=1 bounded by V1V^1V1, which yields the same limits. The infinite sum is stated as the bound on every partial sum, ρ∑j=0N−1(∥rj+2∥2+∥B(zj+2−zj+1)∥2)≤V1\rho\sum_{j=0}^{N-1}(\|r^{j+2}\|^2+\|B(z^{j+2}-z^{j+1})\|^2)\le V^1ρ∑j=0N−1​(∥rj+2∥2+∥B(zj+2−zj+1)∥2)≤V1 for all NNN, which for nonnegative terms is equivalent and avoids Lean's convention for non-summable series.

Preamble
import Mathlib
import Definitions.Def_BoydADMM_Convergence_Model
Formal statement
namespace BoydADMM.Convergence

/-- p. 107: iterating (A.1) gives
`ρ ∑_{k ≥ 1} (‖r^{k+1}‖₂² + ‖B(z^{k+1} − z^k)‖₂²) ≤ V^1` (every partial sum is bounded by
`V^1`), which implies `r^k → 0` and `B(z^{k+1} − z^k) → 0`. -/
theorem summed_bound
  {n m p : ℕ} (P : Problem n m p) (hA1 : P.Assumption1) {ρ : ℝ} (hρ : 0 < ρ)
    {xs : EuclideanSpace ℝ (Fin n)} {zs : EuclideanSpace ℝ (Fin m)}
    {ys : EuclideanSpace ℝ (Fin p)} (hsp : P.IsSaddlePoint xs zs ys)
    {x : ℕ → EuclideanSpace ℝ (Fin n)} {z : ℕ → EuclideanSpace ℝ (Fin m)}
    {y : ℕ → EuclideanSpace ℝ (Fin p)} (hrun : P.IsADMMSeq ρ x z y) :
    (∀ N : ℕ, ρ * ∑ j ∈ Finset.range N,
        (‖P.resid (x (j + 2)) (z (j + 2))‖ ^ 2 + ‖P.Bmul (z (j + 2) - z (j + 1))‖ ^ 2) ≤
      P.lyapunov ρ zs ys (z 1) (y 1)) ∧
    Filter.Tendsto (fun k => P.resid (x k) (z k)) Filter.atTop (nhds 0) ∧
    Filter.Tendsto (fun k => P.Bmul (z (k + 1) - z k)) Filter.atTop (nhds 0) := by sorry

end BoydADMM.Convergence
Source
Boyd et al., Found. Trends Mach. Learn. 3(1) (2011), Appendix A, p. 107
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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