Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(3.5), p. 2279 — φᵗ ≥ M(zᵗ) ≥ f̲: the potential is bounded below

Proved
ProxADMMLC.Conv.eq_3_5

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

admmp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1potential-function

Let fff be differentiable and p>0p>0p>0, let x(y,z)x(y,z)x(y,z), ddd, x∗(z)x^*(z)x∗(z), MMM be as in (2.6)–(2.9), and let f‾=min⁡x∈P, Ax=bf(x)\underline f=\min_{x\in P,\,Ax=b}f(x)f​=minx∈P,Ax=b​f(x). Then M(z)≥f‾M(z)\ge\underline fM(z)≥f​ for every z∈Pz\in Pz∈P, and for every run (xt,yt,zt)(x^t,y^t,z^t)(xt,yt,zt) of Algorithm 2.2 (with any parameters) and every ttt, the potential ϕt=K(xt,zt;yt)−2d(yt,zt)+2M(zt)\phi^t=K(x^t,z^t;y^t)-2d(y^t,z^t)+2M(z^t)ϕt=K(xt,zt;yt)−2d(yt,zt)+2M(zt) satisfies

ϕt ≥ M(zt) ≥ f‾.(3.5)\phi^t\ \ge\ M(z^t)\ \ge\ \underline f.\tag{3.5}ϕt ≥ M(zt) ≥ f​.(3.5)

Since the potential decreases by (3.37), this lower bound makes the decreases summable; it is also what bounds the iteration count in Theorem 4.2.

Formalization Note f‾\underline ff​ is sInf (f '' feas A b ℓ u). The feasible set is nonempty (it contains x∗(z)x^*(z)x∗(z)) and compact, and fff is continuous, so the infimum is attained and equals the paper's minimum; it is never Lean's junk value of sInf on an empty or unbounded set.

Preamble
import Mathlib
import Definitions.Def_ProxADMMLC_Conv_Setting
Formal statement
namespace ProxADMMLC.Conv

theorem eq_3_5 {n m : ℕ} (f : E n → ℝ) (A : E n →L[ℝ] E m) (b : E m) (ℓ u : Fin n → ℝ)
    (hℓu : ∀ i, ℓ i < u i) (hdiff : Differentiable ℝ f) (Γ p c α β : ℝ)
    (hp : 0 < p) (xs : E m → E n → E n) (hxs : IsXSel f A b ℓ u Γ p xs)
    (xst : E n → E n) (hxst : IsXStarSel f A b ℓ u p xst)
    (x z : ℕ → E n) (y : ℕ → E m) (hrun : IsRun f A b ℓ u Γ p c α β x y z) :
    (∀ w ∈ box ℓ u, sInf (f '' feas A b ℓ u) ≤ Mval f p xst w) ∧
      ∀ t, Mval f p xst (z t) ≤ phi f A b Γ p xs xst (x t) (z t) (y t) ∧
        sInf (f '' feas A b ℓ u) ≤ Mval f p xst (z t) := by sorry

end ProxADMMLC.Conv
Source
Zhang & Luo, A proximal alternating direction method of multiplier for linearly constrained nonconvex minimization, SIAM J. Optim. 30(3) (2020), p. 2279, (3.5) and the definition of f̲ (§3.1.1)
Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

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