Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The parallel-projection dual average vanishes in one step

Proved
BoydADMM.Constrained.average_step

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

admmconvex-optimizationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-bookp2o-v1projections

Let N≥1N\ge1N≥1, ρ>0\rho>0ρ>0, let Ai⊆Rn\mathcal A_i\subseteq\mathbb R^nAi​⊆Rn be nonempty closed convex sets, and let (xk,zk,uk)(x^k,z^k,u^k)(xk,zk,uk) be any parallel projection ADMM run from arbitrary z0,u0z^0,u^0z0,u0. Averaging its second and third updates gives, for every k≥0k\ge0k≥0,

zk+1=xˉk+1+uˉk,uˉk+1=0.z^{k+1}=\bar x^{k+1}+\bar u^k,\qquad \bar u^{k+1}=0.zk+1=xˉk+1+uˉk,uˉk+1=0.

The identities explain when the common iterate equals the average and provide the index base for the simplified algorithm.

Formalization Note The book prints −zk-z^k−zk in the intermediate averaged dual update; the displayed iteration on page 35 and the next line on page 36 require −zk+1-z^{k+1}−zk+1. This statement uses the corrected index.

Preamble
import Mathlib
import Definitions.Def_BoydADMM_Constrained_Run
Formal statement
namespace BoydADMM.Constrained

/-- §5.1.2, p. 36: averaging the last two updates eliminates the dual average. -/
theorem average_step {N n : ℕ} (hN : 0 < N) (A : Fin N → Set (Vec n))
    (hAne : ∀ i, (A i).Nonempty) (hAclosed : ∀ i, IsClosed (A i))
    (hAconvex : ∀ i, Convex ℝ (A i))
    (ρ : ℝ) (hρ : 0 < ρ)
    (x : ℕ → Blocks N n) (z : ℕ → Vec n) (u : ℕ → Blocks N n)
    (hrun : IsParallelRun A x z u) :
    ∀ k, z (k + 1) = avg (x (k + 1)) + avg (u k) ∧ avg (u (k + 1)) = 0 := by sorry

end BoydADMM.Constrained
Source
Boyd, Parikh, Chu, Peleato, Eckstein, Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers, Found. Trends Mach. Learn. 3(1) (2011), p. 36, §5.1.2, averaged updates; https://doi.org/10.1561/2200000016
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