Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of (A.1) — (yk+1−yk)T(B(zk+1−zk))≤0(y^{k+1}-y^k)^T(B(z^{k+1}-z^k))\le0(yk+1−yk)T(B(zk+1−zk))≤0 for k≥1k\ge1k≥1

Proved
BoydADMM.Convergence.dual_step_monotone

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

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

Let f,gf,gf,g satisfy Assumption 1, let ρ>0\rho>0ρ>0 and let (xk,zk,yk)(x^k,z^k,y^k)(xk,zk,yk) be any ADMM run. Then for every k≥1k\ge1k≥1,

(yk+1−yk)T(B(zk+1−zk))≤0.(y^{k+1}-y^k)^T\bigl(B(z^{k+1}-z^k)\bigr)\le0 .(yk+1−yk)T(B(zk+1−zk))≤0.

This is the monotonicity step in the proof of (A.1): zk+1z^{k+1}zk+1 minimizes g(z)+y(k+1)TBzg(z)+y^{(k+1)T}Bzg(z)+y(k+1)TBz and zkz^kzk minimizes g(z)+ykTBzg(z)+y^{kT}Bzg(z)+ykTBz, and the two optimality conditions combine.

Formalization Note The book does not state the index range; its argument needs zkz^kzk to be itself a zzz-update, i.e. k≥1k\ge1k≥1, because z0z^0z0 is an arbitrary starting point. The Lean statement is written with k+1k+1k+1 and k+2k+2k+2 in place of the book's kkk and k+1k+1k+1, k≥0k\ge0k≥0.

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

/-- Proof of (A.1), p. 110: `(y^{k+1} − y^k)ᵀ(B(z^{k+1} − z^k)) ≤ 0` for every book index
`k ≥ 1` (here written with `k + 1` in place of the book's `k`, so that `z^k` is itself a
`z`-update). -/
theorem dual_step_monotone
  {n m p : ℕ} (P : Problem n m p) (hA1 : P.Assumption1) {ρ : ℝ} (hρ : 0 < ρ)
    {x : ℕ → EuclideanSpace ℝ (Fin n)} {z : ℕ → EuclideanSpace ℝ (Fin m)}
    {y : ℕ → EuclideanSpace ℝ (Fin p)} (hrun : P.IsADMMSeq ρ x z y) (k : ℕ) :
    inner ℝ (y (k + 2) - y (k + 1)) (P.Bmul (z (k + 2) - z (k + 1))) ≤ 0 := by sorry

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