Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.1, p. 26 — the proximity operator of the indicator of C is Π_C, for every ρ > 0

Proved
BoydADMM.Prox.prox_indicator_eq_projection

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

admmp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-bookp2o-v1projectionproximal-operator

Let C⊆Rn\mathcal C\subseteq\mathbb R^nC⊆Rn be a closed, nonempty, convex set and let v∈Rnv\in\mathbb R^nv∈Rn. Let fff be the indicator function of C\mathcal CC (f=0f=0f=0 on C\mathcal CC, f=+∞f=+\inftyf=+∞ off C\mathcal CC). Then:

  1. the Euclidean projection ΠC(v)\Pi_{\mathcal C}(v)ΠC​(v) exists and is unique: there is exactly one x∈Cx\in\mathcal Cx∈C with ∥v−x∥2≤∥v−w∥2\|v-x\|_2\le\|v-w\|_2∥v−x∥2​≤∥v−w∥2​ for all w∈Cw\in\mathcal Cw∈C;
  2. for every penalty ρ>0\rho>0ρ>0, a point xxx is an xxx-update
x+=argmin⁡x(f(x)+ρ2∥x−v∥22)x^+=\operatorname*{argmin}_x\Bigl(f(x)+\tfrac{\rho}{2}\|x-v\|_2^2\Bigr)x+=xargmin​(f(x)+2ρ​∥x−v∥22​)

if and only if x=ΠC(v)x=\Pi_{\mathcal C}(v)x=ΠC​(v).

In particular proxf,ρ(v)=ΠC(v)\mathbf{prox}_{f,\rho}(v)=\Pi_{\mathcal C}(v)proxf,ρ​(v)=ΠC​(v) independently of the choice of ρ\rhoρ. This is the reason that constraint sets in ADMM are handled by projections.

Formalization Note The indicator function is encoded as the domain C\mathcal CC with the zero function. The book says "This holds independently of the choice of ρ\rhoρ"; we state it for every ρ>0\rho>0ρ>0, the book's standing assumption on ρ\rhoρ (p. 14); at ρ=0\rho=0ρ=0 every point of C\mathcal CC would be a minimizer.

Preamble
import Mathlib
import Definitions.Def_BoydADMM_Prox_Basic

open Matrix
Formal statement
namespace BoydADMM.Prox

theorem prox_indicator_eq_projection {n : ℕ} (C : Set (EuclideanSpace ℝ (Fin n)))
    (hC_closed : IsClosed C) (hC_convex : Convex ℝ C) (hC_ne : C.Nonempty)
    (v : EuclideanSpace ℝ (Fin n)) :
    (∃! x, IsProjection C v x) ∧
      ∀ ρ : ℝ, 0 < ρ → ∀ x, IsProx C (fun _ => 0) ρ v x ↔ IsProjection C v x := 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. 26, §4.1
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