Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(7.13): with zˉ\bar zzˉ fixed, zi=ai+zˉ−aˉz_i=a_i+\bar z-\bar azi​=ai​+zˉ−aˉ

Proved
BoydADMM.Consensus.sharing_fixed_average_solution

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

admmp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-bookp2o-v1sharing

Let N≥1N\ge1N≥1 and a1,…,aN∈Rna_1,\dots,a_N\in\mathbb R^na1​,…,aN​∈Rn, and fix w∈Rnw\in\mathbb R^nw∈Rn (the value of the average zˉ\bar zzˉ). The problem

minimize⁡ ∑i=1N∥zi−ai∥22subject to1N∑i=1Nzi=w\operatorname*{minimize}\ \sum_{i=1}^N\|z_i-a_i\|_2^2\quad\text{subject to}\quad \frac1N\sum_{i=1}^N z_i=wminimize i=1∑N​∥zi​−ai​∥22​subject toN1​i=1∑N​zi​=w

over (z1,…,zN)(z_1,\dots,z_N)(z1​,…,zN​) has the unique solution

zi=ai+w−aˉ,i=1,…,N.(7.13)z_i=a_i+w-\bar a,\qquad i=1,\dots,N.\tag{7.13}zi​=ai​+w−aˉ,i=1,…,N.(7.13)

In the sharing zzz-update, with zˉ\bar zzˉ fixed the term g(Nzˉ)g(N\bar z)g(Nzˉ) is constant and the factor ρ/2>0\rho/2>0ρ/2>0 does not change the minimizers, so this is exactly the book's "minimizing over z1,…,zNz_1,\dots,z_Nz1​,…,zN​ with zˉ\bar zzˉ fixed".

Formalization Note The book says "has the solution"; uniqueness is also stated.

Preamble
import Mathlib
import Definitions.Def_BoydADMM_Consensus_Model

open scoped BigOperators InnerProductSpace
Formal statement
namespace BoydADMM.Consensus

/-- (7.13), §7.3, p. 57: with the average `z̄ = w` fixed, the problem of minimizing
`∑_i ‖z_i − a_i‖²` over `(z_1, …, z_N)` subject to `(1/N)∑_i z_i = w` has the unique solution
`z_i = a_i + w − ā`. (With `z̄` fixed, the term `g(N z̄)` of the book's objective is constant and
the factor `ρ/2 > 0` does not change the minimizers.) -/
theorem sharing_fixed_average_solution {n N : ℕ} (hN : 0 < N)
    (a z : Fin N → EuclideanSpace ℝ (Fin n)) (w : EuclideanSpace ℝ (Fin n)) :
    (avg z = w ∧ ∀ z' : Fin N → EuclideanSpace ℝ (Fin n), avg z' = w →
        ∑ i, ‖z i - a i‖ ^ 2 ≤ ∑ i, ‖z' i - a i‖ ^ 2) ↔
      ∀ i, z i = a i + w - avg a := by sorry

end BoydADMM.Consensus
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. 57, §7.3, (7.13)
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