Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7.1.1: for ggg the indicator of R+n\mathbb R^n_+R+n​ the proximal step is the positive part

Proved
BoydADMM.Consensus.nonneg_prox_positive_part

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

admmconsensusp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-bookp2o-v1projection

Let N≥1N\ge1N≥1, ρ>0\rho>0ρ>0, and let ggg be the indicator function of the nonnegative orthant R+n\mathbb R^n_+R+n​ (zero on R+n\mathbb R^n_+R+n​, +∞+\infty+∞ elsewhere). With v=xˉk+1+(1/ρ)yˉkv=\bar x^{k+1}+(1/\rho)\bar y^kv=xˉk+1+(1/ρ)yˉ​k, the proximal step

minimize⁡z∈Rn g(z)+(Nρ/2) ∥z−v∥22\operatorname*{minimize}_{z\in\mathbb R^n}\ g(z)+(N\rho/2)\,\|z-v\|_2^2z∈Rnminimize​ g(z)+(Nρ/2)∥z−v∥22​

has the unique solution z=v+z=v_+z=v+​, that is,

zj=max⁡(vj,0),j=1,…,n.z_j=\max(v_j,0),\qquad j=1,\dots,n.zj​=max(vj​,0),j=1,…,n.

Formalization Note The indicator is encoded by its domain {z:zj≥0 ∀j}\{z: z_j\ge0\ \forall j\}{z:zj​≥0 ∀j} with value 000 there. The book prints (xˉk+1−(1/ρ)yˉk)+(\bar x^{k+1}-(1/\rho)\bar y^k)_+(xˉk+1−(1/ρ)yˉ​k)+​; the intended reading, forced by the proximal form of the zzz-update displayed earlier on the same page, is xˉk+1+(1/ρ)yˉk\bar x^{k+1}+(1/\rho)\bar y^kxˉk+1+(1/ρ)yˉ​k, which is what is stated.

Preamble
import Mathlib
import Definitions.Def_BoydADMM_Consensus_Model

open scoped BigOperators InnerProductSpace
Formal statement
namespace BoydADMM.Consensus

/-- §7.1.1, p. 52 (sign corrected): for `g` the indicator function of `ℝⁿ₊` (effective domain
`{z | z ≥ 0}`, value `0` there), the proximal step
`argmin_z (g(z) + (Nρ/2)‖z − x̄^{k+1} − (1/ρ)ȳ^k‖²)` has the unique solution
`z = (x̄^{k+1} + (1/ρ)ȳ^k)₊`, componentwise. The book prints `x̄^{k+1} − (1/ρ)ȳ^k`. -/
theorem nonneg_prox_positive_part {n N : ℕ} (hN : 0 < N) (ρ : ℝ) (hρ : 0 < ρ)
    (x y : Fin N → EuclideanSpace ℝ (Fin n)) (z : EuclideanSpace ℝ (Fin n)) :
    ((∀ j, 0 ≤ z j) ∧ ∀ z' : EuclideanSpace ℝ (Fin n), (∀ j, 0 ≤ z' j) →
        ((N : ℝ) * ρ / 2) * ‖z - avg x - (1 / ρ) • avg y‖ ^ 2 ≤
          ((N : ℝ) * ρ / 2) * ‖z' - avg x - (1 / ρ) • avg y‖ ^ 2) ↔
      ∀ j, z j = max ((avg x + (1 / ρ) • avg y) j) 0 := 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. 52, §7.1.1 (example g = indicator of R^n_+; the book prints x̄^{k+1} − (1/ρ)ȳ^k, corrected to +)
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