Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5, p. 220 — (x*, p*) is a saddle point of l iff (0, 0) ∈ K(x*, p*)

Proved
BregmanPPA.ProxMult.saddle_iff_zero

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

lagrangianmonotone-operatorp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1saddle-point

For a problem of the form (10) with Lagrangian lll and saddle operator KKK, and any (x∗,p∗)∈Rn×Rm(x^*,p^*)\in\mathbb R^n\times\mathbb R^m(x∗,p∗)∈Rn×Rm,

l(x∗,p)≤l(x∗,p∗)≤l(x,p∗)∀x∈Rn, p∈Rm⟺(0,0)∈K(x∗,p∗).l(x^*,p)\le l(x^*,p^*)\le l(x,p^*)\quad\forall x\in\mathbb R^n,\ p\in\mathbb R^m\qquad\Longleftrightarrow\qquad(0,0)\in K(x^*,p^*).l(x∗,p)≤l(x∗,p∗)≤l(x,p∗)∀x∈Rn, p∈Rm⟺(0,0)∈K(x∗,p∗).

The zeros of KKK are therefore exactly the saddle pairs, which the paper identifies with the optimal solution–Lagrange multiplier pairs of (10). This translates the conclusion of Theorem 1 for KKK into the conclusion of Theorem 8.

Formalization Note The page states two equivalences: "x∗x^*x∗ optimal and p∗p^*p∗ a Lagrange multiplier" iff the saddle inequality, iff (0,0)∈K(x∗,p∗)(0,0)\in K(x^*,p^*)(0,0)∈K(x∗,p∗). This item states the second. The first is how the paper names saddle pairs; the mission takes the saddle inequality itself as the meaning of "optimal solution–Lagrange multiplier pair".

Preamble
import Mathlib
import Definitions.Def_BregmanPPA_Convergence_Model
import Definitions.Def_BregmanPPA_IneqMult_Program
import Definitions.Def_BregmanPPA_ProxMult_Saddle

open ThreeOpSplitting.Convergence
Formal statement
namespace BregmanPPA.ProxMult

/-- §5, p. 220: `(x*, p*)` satisfies the saddle inequality
`l(x*, p) ≤ l(x*, p*) ≤ l(x, p*)` for all `x, p` if and only if `(0, 0) ∈ K(x*, p*)`. -/
theorem saddle_iff_zero {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' : BregmanPPA.IneqMult.E n) (p' : BregmanPPA.IneqMult.E m) :
    IsSaddlePair C f g x' p' ↔ pair x' p' ∈ zer (opK C f g) := 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. 220, §5 (saddle inequality ⇔ (0,0) ∈ K(x*, p*))
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