Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(A.1) — Vk+1≤Vk−ρ∥rk+1∥22−ρ∥B(zk+1−zk)∥22V^{k+1}\le V^k-\rho\|r^{k+1}\|_2^2-\rho\|B(z^{k+1}-z^k)\|_2^2Vk+1≤Vk−ρ∥rk+1∥22​−ρ∥B(zk+1−zk)∥22​ for k≥1k\ge1k≥1

Proved
BoydADMM.Convergence.ineq_A1

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 for every k≥1k\ge1k≥1,

Vk+1≤Vk−ρ∥rk+1∥22−ρ∥B(zk+1−zk)∥22.V^{k+1}\le V^k-\rho\|r^{k+1}\|_2^2-\rho\|B(z^{k+1}-z^k)\|_2^2 .Vk+1≤Vk−ρ∥rk+1∥22​−ρ∥B(zk+1−zk)∥22​.

This is the first key inequality of Appendix A: VkV^kVk decreases by an amount controlled by the primal residual and the change in BzBzBz.

Formalization Note The book states (A.1) without an index range, but its proof uses the monotonicity step, which needs zkz^kzk to be a zzz-update, so it is proved for k≥1k\ge1k≥1; for k=0k=0k=0 and an arbitrary z0z^0z0 the inequality can fail. We state k≥1k\ge1k≥1, written with k+1k+1k+1, k+2k+2k+2 in place of kkk, k+1k+1k+1.

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

/-- (A.1), p. 107: `V^{k+1} ≤ V^k − ρ‖r^{k+1}‖₂² − ρ‖B(z^{k+1} − z^k)‖₂²` for every book
index `k ≥ 1` (here written with `k + 1` in place of the book's `k`). -/
theorem ineq_A1
  {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) (k : ℕ) :
    P.lyapunov ρ zs ys (z (k + 2)) (y (k + 2)) ≤
      P.lyapunov ρ zs ys (z (k + 1)) (y (k + 1))
        - ρ * ‖P.resid (x (k + 2)) (z (k + 2))‖ ^ 2
        - ρ * ‖P.Bmul (z (k + 2) - z (k + 1))‖ ^ 2 := by sorry

end BoydADMM.Convergence
Source
Boyd et al., Found. Trends Mach. Learn. 3(1) (2011), Appendix A, p. 107, (A.1); proof pp. 109–110
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