Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 8, p. 221 — the supergradients of l in p: ∂̂ₚl(x, p) = {g(x)} − ∂δ⁺(p)

Proved
BregmanPPA.ProxMult.supdiff_formula

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

lagrangianp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1saddle-pointsupergradient

For a problem of the form (10), every x∈Cx\in Cx∈C and every p≥0p\ge0p≥0, the set of supergradients of the concave function l(x,⋅)l(x,\cdot)l(x,⋅) at ppp is

∂^pl(x,p)={g(x)}−∂δ+(p)={ g(x)−u: u∈∂δ+(p) }.\hat\partial_p l(x,p)=\{g(x)\}-\partial\delta^+(p)=\{\,g(x)-u:\ u\in\partial\delta^+(p)\,\}.∂^p​l(x,p)={g(x)}−∂δ+(p)={g(x)−u: u∈∂δ+(p)}.

Coordinatewise, this says ∂^pil(x,p)={gi(x)}\hat\partial_{p_i}l(x,p)=\{g_i(x)\}∂^pi​​l(x,p)={gi​(x)} when pi>0p_i>0pi​>0 and [gi(x),∞)[g_i(x),\infty)[gi​(x),∞) when pi=0p_i=0pi​=0. It is the step of the proof of Theorem 8 that identifies the ppp-update of (12) with the ppp-component of the proximal step on KKK.

Formalization Note The page prints {g(x)}−δ+(p)\{g(x)\}-\delta^+(p){g(x)}−δ+(p), using δ+(p)\delta^+(p)δ+(p) for the subdifferential ∂δ+(p)\partial\delta^+(p)∂δ+(p) of the indicator (the normal cone of Ω+‾\overline{\Omega^+}Ω+ at ppp), as on p. 222. The statement uses ∂δ+(p)\partial\delta^+(p)∂δ+(p), built from IsSubgradient and the indicator indicatorPos.

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

/-- Proof of Theorem 8, p. 221: for `x ∈ C` and `p ≥ 0`, the supergradients of `l(x, ·)` at `p`
are `∂̂ₚ l(x, p) = {g(x)} − ∂δ⁺(p)`. -/
theorem supdiff_formula {n m : ℕ} (C : Set (BregmanPPA.IneqMult.E n)) (f : BregmanPPA.IneqMult.E n → EReal) (g : Fin m → BregmanPPA.IneqMult.E n → EReal)
    (hP : BregmanPPA.IneqMult.IsConvexProgram C f g) :
    ∀ x ∈ C, ∀ p ∈ BregmanPPA.IneqMult.nonnegOrthant m,
      supdiffP C f g x p = {v | ∃ u ∈ BregmanPPA.Convergence.subdiffOp (BregmanPPA.IneqMult.indicatorPos m) p, v = BregmanPPA.IneqMult.gvec g x - u} := 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 (supergradient set of l)
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