Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.4.2, p. 31 — component separability: the x-update splits into n scalar minimizations

Proved
BoydADMM.Prox.component_separable

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

admmdecompositionp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-bookp2o-v1separability

Let f(x)=f1(x1)+⋯+fn(xn)f(x)=f_1(x_1)+\cdots+f_n(x_n)f(x)=f1​(x1​)+⋯+fn​(xn​) with fi:R→Rf_i:\mathbb R\to\mathbb Rfi​:R→R, let A∈Rp×nA\in\mathbb R^{p\times n}A∈Rp×n with ATA=diag⁡(d1,…,dn)A^TA=\operatorname{diag}(d_1,\dots,d_n)ATA=diag(d1​,…,dn​) diagonal, let ρ>0\rho>0ρ>0 and v∈Rpv\in\mathbb R^pv∈Rp. Then x∈Rnx\in\mathbb R^nx∈Rn is an xxx-update,

x∈argmin⁡y∈Rn(∑i=1nfi(yi)+ρ2∥Ay−v∥22),x\in\operatorname*{argmin}_{y\in\mathbb R^n}\Bigl(\sum_{i=1}^n f_i(y_i)+\tfrac{\rho}{2}\|Ay-v\|_2^2\Bigr),x∈y∈Rnargmin​(i=1∑n​fi​(yi​)+2ρ​∥Ay−v∥22​),

if and only if, for every iii, the scalar xix_ixi​ minimizes

t  ↦  fi(t)+ρ2(di t2−2 (ATv)i t)t\;\mapsto\; f_i(t)+\tfrac{\rho}{2}\bigl(d_i\,t^2-2\,(A^Tv)_i\,t\bigr)t↦fi​(t)+2ρ​(di​t2−2(ATv)i​t)

over t∈Rt\in\mathbb Rt∈R. For A=IA=IA=I this is the scalar problem min⁡tfi(t)+ρ2(t−vi)2\min_t f_i(t)+\tfrac{\rho}{2}(t-v_i)^2mint​fi​(t)+2ρ​(t−vi​)2 (up to the constant ρ2vi2\tfrac{\rho}{2}v_i^22ρ​vi2​).

This is what the book calls component separability: the xxx-minimization is carried out by nnn independent scalar minimizations. Soft thresholding (§4.4.3) is the case fi=λ∣⋅∣f_i=\lambda|\cdot|fi​=λ∣⋅∣.

Formalization Note The book does not write the scalar problems out; we write them explicitly, dropping the constant ρ2∥v∥22\tfrac{\rho}{2}\|v\|_2^22ρ​∥v∥22​, which does not affect minimizers. The fif_ifi​ are real-valued, as on the page.

Preamble
import Mathlib
import Definitions.Def_BoydADMM_Prox_Basic

open Matrix
Formal statement
namespace BoydADMM.Prox

theorem component_separable {n p : ℕ} (f : Fin n → ℝ → ℝ) (A : Matrix (Fin p) (Fin n) ℝ)
    (d : Fin n → ℝ) (hdiag : Aᵀ * A = Matrix.diagonal d) (ρ : ℝ) (hρ : 0 < ρ)
    (v : EuclideanSpace ℝ (Fin p)) (x : EuclideanSpace ℝ (Fin n)) :
    IsXUpdate Set.univ (fun y => ∑ i, f i (y i)) ρ A v x ↔
      ∀ i, ∀ t : ℝ,
        f i (x i) + (ρ / 2) * (d i * x i ^ 2 - 2 * (Matrix.toEuclideanLin Aᵀ v) i * x i) ≤
          f i t + (ρ / 2) * (d i * t ^ 2 - 2 * (Matrix.toEuclideanLin Aᵀ v) i * t) := by sorry

end BoydADMM.Prox
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. 31, §4.4.2
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