Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.1, p. 26 — the prox of the indicator of ℝⁿ₊ is (v)₊

Proved
BoydADMM.Prox.prox_nonnegOrthant

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

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

Let ρ>0\rho>0ρ>0, v∈Rnv\in\mathbb R^nv∈Rn, and let fff be the indicator function of the nonnegative orthant R+n={x∣xi≥0 for all i}\mathbf R^n_+=\{x\mid x_i\ge0\text{ for all }i\}R+n​={x∣xi​≥0 for all i}. Then the 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​)

is unique and equals the nonnegative part of vvv:

x+=(v)+,((v)+)i=max⁡(vi,0).x^+=(v)_+,\qquad ((v)_+)_i=\max(v_i,0).x+=(v)+​,((v)+​)i​=max(vi​,0).

That is, a vector xxx minimizes ρ2∥x−v∥22\tfrac{\rho}{2}\|x-v\|_2^22ρ​∥x−v∥22​ over R+n\mathbf R^n_+R+n​ if and only if x=(v)+x=(v)_+x=(v)+​.

This is the simplest example of a projection-type ADMM update; it appears in nonnegative least squares and in every problem with sign constraints.

Formalization Note The indicator of R+n\mathbf R^n_+R+n​ is encoded as the domain R+n\mathbf R^n_+R+n​ with the zero function; (v)+(v)_+(v)+​ is the vector of componentwise maxima with 000.

Preamble
import Mathlib
import Definitions.Def_BoydADMM_Prox_Basic

open Matrix
Formal statement
namespace BoydADMM.Prox

theorem prox_nonnegOrthant {n : ℕ} (ρ : ℝ) (hρ : 0 < ρ) (v : EuclideanSpace ℝ (Fin n))
    (x : EuclideanSpace ℝ (Fin n)) :
    IsProx (nonnegOrthant n) (fun _ => 0) ρ v x ↔ x = posPartVec v := 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