Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(14), proof of Theorem 8, p. 221 — (1/c_k)(∇h_x(x^k) − ∇h_x(x^{k+1})) ∈ ∂ₓl(x^{k+1}, p^{k+1})

Proved
BregmanPPA.ProxMult.eq14

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

lagrangianp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1proximal-method-of-multiplierssubdifferential

Assume the hypotheses of Theorem 8: a problem of the form (10); ck>0c_k>0ck​>0; hxh_xhx​ a Bregman function on Rn\mathbb R^nRn with zone Sx⊇CS_x\supseteq CSx​⊇C; hph_php​ a Bregman function on Rm\mathbb R^mRm with zone Sp⊇Ω+‾S_p\supseteq\overline{\Omega^+}Sp​⊇Ω+ and im⁡(∇hp)=Rm\operatorname{im}(\nabla h_p)=\mathbb R^mim(∇hp​)=Rm; and {(xk,pk)}\{(x^k,p^k)\}{(xk,pk)} conforming to the recursions (12). Then for every k≥0k\ge0k≥0, pk+1≥0p^{k+1}\ge0pk+1≥0 and

1ck(∇hx(xk)−∇hx(xk+1))∈∂xl(xk+1,pk+1).(14)\frac1{c_k}\big(\nabla h_x(x^k)-\nabla h_x(x^{k+1})\big)\in\partial_x l(x^{k+1},p^{k+1}).\tag{14}ck​1​(∇hx​(xk)−∇hx​(xk+1))∈∂x​l(xk+1,pk+1).(14)

This is the xxx-component of the identity (13) that makes (12) a Bregman proximal point run on KKK.

Formalization Note The conjunct pk+1≥0p^{k+1}\ge0pk+1≥0 is part of the statement because l(⋅,p)l(\cdot,p)l(⋅,p) is identically −∞-\infty−∞ on CCC for p≱0p\not\ge0p≥0, where every vector satisfies the subgradient inequality; with it, (14) is the inclusion for the proper convex function l(⋅,pk+1)=f+∑ipik+1gi+δCl(\cdot,p^{k+1})=f+\sum_ip_i^{k+1}g_i+\delta_Cl(⋅,pk+1)=f+∑i​pik+1​gi​+δC​, as in the paper (which uses pk+1≥0p^{k+1}\ge0pk+1≥0 on p. 222). The bounded-away-from-zero hypothesis on ckc_kck​ is not needed and is omitted.

Preamble
import Mathlib
import Definitions.Def_BregmanPPA_Convergence_Model
import Definitions.Def_BregmanPPA_IneqMult_Program
import Definitions.Def_BregmanPPA_ProxMult_Saddle
Formal statement
namespace BregmanPPA.ProxMult

/-- (14), proof of Theorem 8, p. 221: along a run of (12), `p^{k+1} ≥ 0` and
`(1/c_k)(∇h_x(x^k) − ∇h_x(x^{k+1})) ∈ ∂ₓ l(x^{k+1}, p^{k+1})`. -/
theorem eq14 {n m : ℕ} (C : Set (BregmanPPA.IneqMult.E n)) (f : BregmanPPA.IneqMult.E n → EReal) (g : Fin m → BregmanPPA.IneqMult.E n → EReal)
    (Sx : Set (BregmanPPA.IneqMult.E n)) (hx : BregmanPPA.IneqMult.E n → ℝ) (Sp : Set (BregmanPPA.IneqMult.E m)) (hp : BregmanPPA.IneqMult.E m → ℝ)
    (c : ℕ → ℝ) (x : ℕ → BregmanPPA.IneqMult.E n) (p : ℕ → BregmanPPA.IneqMult.E m)
    (hP : BregmanPPA.IneqMult.IsConvexProgram C f g) (hc : ∀ k, 0 < c k)
    (hhx : BregmanPPA.Convergence.IsBregmanFunction Sx hx) (hSx : C ⊆ Sx)
    (hhp : BregmanPPA.Convergence.IsBregmanFunction Sp hp) (hSp : BregmanPPA.IneqMult.nonnegOrthant m ⊆ Sp)
    (him : gradient hp '' Sp = Set.univ)
    (hrun : IsProxMultRun C f g Sx hx Sp hp c x p) :
    ∀ k, p (k + 1) ∈ BregmanPPA.IneqMult.nonnegOrthant m ∧
      (c k)⁻¹ • (gradient hx (x k) - gradient hx (x (k + 1)))
        ∈ subdiffX C f g (x (k + 1)) (p (k + 1)) := by sorry

end BregmanPPA.ProxMult
Source
Eckstein, Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming, Math. Oper. Res. 18(1) (1993), p. 221, proof of Theorem 8, display (14)
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