Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(3.11) — f(xk)+g(zk)−p⋆≤−(yk)Trk+(xk−x⋆)Tskf(x^k)+g(z^k)-p^\star\le-(y^k)^Tr^k+(x^k-x^\star)^Ts^kf(xk)+g(zk)−p⋆≤−(yk)Trk+(xk−x⋆)Tsk

Proved
BoydADMM.Convergence.ineq_3_11

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

admmconvergence-proofp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-bookp2o-v1stopping-criterion

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

f(xk)+g(zk)−p⋆≤−(yk)Trk+(xk−x⋆)Tsk,f(x^k)+g(z^k)-p^\star\le-(y^k)^Tr^k+(x^k-x^\star)^Ts^k,f(xk)+g(zk)−p⋆≤−(yk)Trk+(xk−x⋆)Tsk,

where rk=Axk+Bzk−cr^k=Ax^k+Bz^k-crk=Axk+Bzk−c is the primal residual and sk=ρATB(zk−zk−1)s^k=\rho A^TB(z^k-z^{k-1})sk=ρATB(zk−zk−1) the dual residual.

The bound shows that small residuals force small objective suboptimality; it underlies the stopping criterion of §3.3.1.

Formalization Note Stated at index k+1k+1k+1 for k≥0k\ge0k≥0 (as on p. 107), since x0x^0x0 and s0s^0s0 are not defined by the method. p⋆p^\starp⋆ is the infimum optVal. The book derives (3.11) from (A.2) via the identity printed as "−rk+1+B(zk+1−zk)=−A(xk+1−x⋆)-r^{k+1}+B(z^{k+1}-z^k)=-A(x^{k+1}-x^\star)−rk+1+B(zk+1−zk)=−A(xk+1−x⋆)"; the intended identity, forced by (A.2) and Ax⋆+Bz⋆=cAx^\star+Bz^\star=cAx⋆+Bz⋆=c, is −rk+1+B(zk+1−z⋆)=−A(xk+1−x⋆)-r^{k+1}+B(z^{k+1}-z^\star)=-A(x^{k+1}-x^\star)−rk+1+B(zk+1−z⋆)=−A(xk+1−x⋆). The statement of (3.11) itself is unaffected.

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

/-- (3.11), p. 19 (stated at index `k + 1` on p. 107): for every `k ≥ 0`,
`f(x^{k+1}) + g(z^{k+1}) − p⋆ ≤ −(y^{k+1})ᵀr^{k+1} + (x^{k+1} − x⋆)ᵀs^{k+1}`,
with `s^{k+1} = ρAᵀB(z^{k+1} − z^k)`. -/
theorem ineq_3_11
  {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.f (x (k + 1)) + P.g (z (k + 1)) - P.optVal ≤
      -inner ℝ (y (k + 1)) (P.resid (x (k + 1)) (z (k + 1)))
        + inner ℝ (x (k + 1) - xs) (P.dualResid ρ (z k) (z (k + 1))) := by sorry

end BoydADMM.Convergence
Source
Boyd et al., Found. Trends Mach. Learn. 3(1) (2011), §3.3.1, p. 19, (3.11); derived on 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