Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, p. 362 — (xˉ,yˉ)(\bar x, \bar y)(xˉ,yˉ​) is a saddle point of LrL_rLr​ iff xˉ\bar xxˉ is optimal for (P) and yˉ\bar yyˉ​ is a Kuhn–Tucker vector

Proved
PenaltyLag.Exact.saddle_iff

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

augmented-lagrangiandualityp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1saddle-point

Let XXX be a nonempty convex subset of a real vector space EEE and f0,f1,…,fmf_0, f_1, \dots, f_mf0​,f1​,…,fm​ convex functions on XXX, defining the convex program (P). Let r>0r > 0r>0 and let LrL_rLr​ be the penalty Lagrangian (2.3). For xˉ∈E\bar x \in Exˉ∈E and yˉ∈Rm\bar y \in \mathbb R^myˉ​∈Rm, the pair (xˉ,yˉ)(\bar x, \bar y)(xˉ,yˉ​) is a saddle point of LrL_rLr​ on X×RmX \times \mathbb R^mX×Rm, that is, xˉ∈X\bar x \in Xxˉ∈X and

Lr(xˉ,y)≤Lr(xˉ,yˉ)≤Lr(x,yˉ)for all x∈X, y∈Rm,L_r(\bar x, y) \le L_r(\bar x, \bar y) \le L_r(x, \bar y) \qquad \text{for all } x \in X,\ y \in \mathbb R^m,Lr​(xˉ,y)≤Lr​(xˉ,yˉ​)≤Lr​(x,yˉ​)for all x∈X, y∈Rm,

if and only if xˉ\bar xxˉ is an optimal solution to (P) and yˉ\bar yyˉ​ is a Kuhn–Tucker vector for (P) relative to LrL_rLr​.

This is the penalty-Lagrangian counterpart of the classical saddle-point characterization of optimality, and the bridge used in the proof of Theorem 3.5.

Formalization Note The standing assumption of p. 358 (convex X≠∅X \ne \emptysetX=∅, convex fif_ifi​) is a hypothesis. The pair is arbitrary: if xˉ∉X\bar x \notin Xxˉ∈/X both sides fail. Saddle points are in the sense of Rockafellar's Convex Analysis, §36 (minimum over x∈Xx \in Xx∈X, maximum over y∈Rmy \in \mathbb R^my∈Rm, no sign restriction on yyy).

Preamble
import Mathlib
import Definitions.Def_PenaltyLag_Exact_Basic
Formal statement
namespace PenaltyLag.Exact

/-- §3, p. 362: for r > 0, (x̄, ȳ) is a saddle point of L_r iff x̄ is an optimal solution
to (P) and ȳ is a Kuhn–Tucker vector relative to L_r. -/
theorem saddle_iff {E : Type*} [AddCommGroup E] [Module ℝ E] {m : ℕ}
    (X : Set E) (hX : Convex ℝ X) (hXne : X.Nonempty)
    (f₀ : E → ℝ) (f : Fin m → E → ℝ) (hf₀ : ConvexOn ℝ X f₀) (hf : ∀ i, ConvexOn ℝ X (f i))
    (r : ℝ) (hr : 0 < r) (xbar : E) (ybar : PenaltyLag.Asymptotic.Mult m) :
    IsSaddle X f₀ f r xbar ybar ↔ (IsOptimal X f₀ f xbar ∧ IsKTVector X f₀ f r ybar) := by sorry

end PenaltyLag.Exact
Source
Rockafellar, A Dual Approach to Solving Nonlinear Programming Problems by Unconstrained Optimization, Math. Programming 5 (1973), §3, p. 362 (sentence before Corollary 3.4)
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