Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 4.1 (Proximal map formula) — prox1f(U)=Ts(P+(U))\mathrm{prox}^f_1(U)=T_s(P_+(U))prox1f​(U)=Ts​(P+​(U)) for f=δX≥0+δ∥X∥0≤sf=\delta_{X\ge0}+\delta_{\|X\|_0\le s}f=δX≥0​+δ∥X∥0​≤s​

Proved
PALM.ProxNMF.proposition_4_1

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

nonconvex-optimizationnonnegative-matrix-factorizationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1proximal-operatorsparsity

Let U∈Rm×nU\in\mathbb R^{m\times n}U∈Rm×n, let sss be a natural number, and let f:=δX≥0+δ∥X∥0≤sf:=\delta_{X\ge0}+\delta_{\|X\|_0\le s}f:=δX≥0​+δ∥X∥0​≤s​, the indicator of the nonnegative matrices with at most sss nonzero entries. Then

prox⁡1f(U)=argmin⁡{12∥X−U∥F2:X≥0, ∥X∥0≤s}=Ts(P+(U)),\operatorname{prox}^f_1(U)=\operatorname{argmin}\Big\{\frac12\|X-U\|_F^2 : X\ge0,\ \|X\|_0\le s\Big\}=T_s\big(P_+(U)\big),prox1f​(U)=argmin{21​∥X−U∥F2​:X≥0, ∥X∥0​≤s}=Ts​(P+​(U)),

where prox⁡1f\operatorname{prox}^f_1prox1f​ is the proximal map (2.2) with t=1t=1t=1, TsT_sTs​ is the hard-thresholding operator of Definition 4.1, and P+(U)=max⁡{0,U}P_+(U)=\max\{0,U\}P+​(U)=max{0,U} componentwise. All three sides are sets, and both equalities are equalities of sets.

This formula is what makes PALM implementable for sparse nonnegative matrix factorization: the proximal step for the nonconvex constraint reduces to clipping the negative entries of UUU and then keeping sss largest entries.

Formalization Note Matrices are Matrix (Fin m) (Fin n) ℝ. fff takes values in EReal, so membership in prox⁡1f(U)\operatorname{prox}^f_1(U)prox1f​(U) is the inequality f(X)+12∥X−U∥F2≤f(W)+12∥W−U∥F2f(X)+\frac12\|X-U\|_F^2\le f(W)+\frac12\|W-U\|_F^2f(X)+21​∥X−U∥F2​≤f(W)+21​∥W−U∥F2​ in EReal for every WWW. No restriction is placed on sss: s=0s=0s=0 and s≥mns\ge mns≥mn are included.

Preamble
import Mathlib
import Definitions.Def_CaiCandesShen_ProximalLimit_Basic
import Definitions.Def_PALM_ProxNMF_Setting

open CaiCandesShen.ProximalLimit PALM.ProxNMF
Formal statement
namespace PALM.ProxNMF

/-- Proposition 4.1 (Proximal map formula), p. 28: for `f := δ_{X≥0} + δ_{‖X‖₀≤s}`,
`prox^f_1(U) = argmin {½‖X − U‖²_F : X ≥ 0, ‖X‖₀ ≤ s} = T_s(P_+(U))`, as sets. -/
theorem proposition_4_1 {m n : ℕ} (s : ℕ) (U : Matrix (Fin m) (Fin n) ℝ) :
    proxSet (f s) 1 U =
        argminOn (fun X => 1 / 2 * frobInner (X - U) (X - U))
          {X | X ∈ NonnegSet m n ∧ l0 X ≤ s} ∧
      argminOn (fun X => 1 / 2 * frobInner (X - U) (X - U))
          {X | X ∈ NonnegSet m n ∧ l0 X ≤ s} =
        Ts s (Pplus U) := by sorry

end PALM.ProxNMF
Source
Bolte, Sabach, Teboulle, Proximal alternating linearized minimization for nonconvex and nonsmooth problems, Math. Program. 146 (2014), doi:10.1007/s10107-013-0701-9 (source: author version), p. 28, Proposition 4.1
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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