Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.3, p. 130 — minimizers of f are exactly fixed points of prox_{λf}

Proved
ProxAlg.FixedPoint.fixed_point_iff_minimizer

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

convex-optimizationfixed-pointp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1proximal-operator

Let f:Rn→R∪{+∞}f:\mathbb R^n\to\mathbb R\cup\{+\infty\}f:Rn→R∪{+∞} be closed, proper and convex, and let λ>0\lambda>0λ>0. A point x⋆∈Rnx^\star\in\mathbb R^nx⋆∈Rn minimizes fff if and only if it is a fixed point of the proximal operator of λf\lambda fλf:

f(x⋆)≤f(y)for every y∈Rn⟺x⋆=prox⁡λf(x⋆).f(x^\star)\le f(y)\quad\text{for every }y\in\mathbb R^n \quad\Longleftrightarrow\quad x^\star=\operatorname{prox}_{\lambda f}(x^\star).f(x⋆)≤f(y)for every y∈Rn⟺x⋆=proxλf​(x⋆).

This identifies the optimization problem with a fixed-point problem. The paper prints the case λ=1\lambda=1λ=1 and explicitly observes that positive scaling leaves minimizers unchanged.

Formalization Note The function λf\lambda fλf is the extended-real pointwise product, with λ>0\lambda>0λ>0 ensuring that λ(+∞)=+∞\lambda(+\infty)=+\inftyλ(+∞)=+∞.

Preamble
import Mathlib
import Definitions.Def_MoreauProx_Decomposition_ConvexDuality
import Definitions.Def_ProxAlg_FixedPoint_Basic
Formal statement
namespace ProxAlg.FixedPoint

theorem fixed_point_iff_minimizer {n : ℕ} (f : EuclideanSpace ℝ (Fin n) → EReal)
    (hf : MoreauProx.Decomposition.GammaZero f) (lam : ℝ) (hlam : 0 < lam)
    (xs : EuclideanSpace ℝ (Fin n)) :
    (∀ y, f xs ≤ f y) ↔
      MoreauProx.Decomposition.IsProx (fun u => ((lam : ℝ) : EReal) * f u) xs xs := by sorry

end ProxAlg.FixedPoint
Source
Parikh & Boyd, Proximal Algorithms, Found. Trends Optim. 1(3) (2014), §2.3, p. 130, opening fixed-point statement and parenthesis
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