Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 3.4 (r=0r = 0r=0) — (xˉ,yˉ)(\bar x, \bar y)(xˉ,yˉ​) is a saddle point of L0L_0L0​ iff the ordinary Kuhn–Tucker conditions hold

Proved
PenaltyLag.Exact.corollary_3_4_r0

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

dualitykuhn-tuckerp2o-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), and let L0L_0L0​ be its ordinary Lagrangian (3.2): L0(x,y)=f0(x)+∑iyifi(x)L_0(x, y) = f_0(x) + \sum_i y_i f_i(x)L0​(x,y)=f0​(x)+∑i​yi​fi​(x) if y≥0y \ge 0y≥0 and −∞-\infty−∞ otherwise. 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 L0L_0L0​ on X×RmX \times \mathbb R^mX×Rm,

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

if and only if the ordinary Kuhn–Tucker conditions hold: (i) yˉi≥0\bar y_i \ge 0yˉ​i​≥0, fi(xˉ)≤0f_i(\bar x) \le 0fi​(xˉ)≤0, yˉifi(xˉ)=0\bar y_i f_i(\bar x) = 0yˉ​i​fi​(xˉ)=0 for i=1,…,mi = 1, \dots, mi=1,…,m, and (ii) xˉ\bar xxˉ minimizes f0+∑i=1myˉifif_0 + \sum_{i=1}^m \bar y_i f_if0​+∑i=1m​yˉ​i​fi​ over XXX.

This is the case r=0r = 0r=0 of Corollary 3.4, the classical saddle-point form of the Kuhn–Tucker conditions.

Formalization Note The standing assumption of p. 358 is a hypothesis. L0L_0L0​ is extended-real valued and the inequalities are in the extended reals; yyy ranges over all of Rm\mathbb R^mRm, with L0=−∞L_0 = -\inftyL0​=−∞ off the nonnegative orthant as in (3.2).

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

/-- Corollary 3.4, p. 362, the case r = 0: (x̄, ȳ) is a saddle point of the ordinary
Lagrangian L₀ iff the ordinary Kuhn–Tucker conditions hold. -/
theorem corollary_3_4_r0 {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))
    (xbar : E) (ybar : PenaltyLag.Asymptotic.Mult m) :
    IsSaddle0 X f₀ f xbar ybar ↔ KuhnTuckerConditions X f₀ f xbar ybar := by sorry

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