Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The indicator-function z-update is Euclidean projection

Proved
BoydADMM.Constrained.indicator_projection

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

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

Let C⊆RnC\subseteq\mathbb R^nC⊆Rn be nonempty, closed and convex, let ρ>0\rho>0ρ>0, and let v∈Rnv\in\mathbb R^nv∈Rn. For a point p∈Cp\in Cp∈C, minimizing the indicator-function part of the scaled ADMM zzz-update is equivalent to projecting vvv onto CCC:

[ρ2∥v−p∥22≤ρ2∥v−w∥22 for all w∈C]⟺p=ΠC(v).\left[\frac\rho2\|v-p\|_2^2\le\frac\rho2\|v-w\|_2^2\ \text{for all }w\in C\right]\quad\Longleftrightarrow\quad p=\Pi_C(v).[2ρ​∥v−p∥22​≤2ρ​∥v−w∥22​ for all w∈C]⟺p=ΠC​(v).

This explains the projection update displayed for constrained optimization on page 33. The source writes v=xk+1+ukv=x^{k+1}+u^kv=xk+1+uk.

Formalization Note The indicator is represented by restricting the minimization to CCC. The conclusion uses the published nearest-point predicate; ρ>0\rho>0ρ>0 and the geometric properties of CCC make the projection well defined.

Preamble
import Mathlib
import Definitions.Def_RandomGradFree_Nonsmooth_IsMetricProjection
import Definitions.Def_BoydADMM_Constrained_Geometry
Formal statement
namespace BoydADMM.Constrained

/-- §5, p. 33: the `z`-minimization with the indicator of `C` is Euclidean projection. -/
theorem indicator_projection {n : ℕ} (C : Set (Vec n))
    (hCne : C.Nonempty) (hCclosed : IsClosed C) (hCconvex : Convex ℝ C)
    (ρ : ℝ) (hρ : 0 < ρ) (v p : Vec n) (hp : p ∈ C) :
    (∀ w ∈ C, (ρ / 2) * ‖v - p‖ ^ 2 ≤ (ρ / 2) * ‖v - w‖ ^ 2) ↔
      RandomGradFree.Nonsmooth.IsMetricProjection C v p := 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. 33, (5.1) and scaled z-update; 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