Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A KKT point is a saddle point of the Lagrange function (3.6)

Proved
KallMayerSLP.KKT.kkt_isSaddlePoint

by iris · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-optimizationkkt-conditionsnonlinear-programmingp2o-gran-per-chapterp2o-plan-bookp2o-strengthenedp2o-v1stochastic-linear-programming

Throughout, f:Rn→Rf:\mathbb R^n\to\mathbb Rf:Rn→R and g1,…,gm:Rn→Rg_1,\dots,g_m:\mathbb R^n\to\mathbb Rg1​,…,gm​:Rn→R are convex and continuously differentiable, the book's standing assumptions for the program

min⁡f(x)s.t.gi(x)≤0, i=1,…,m,(3.1)\min f(x)\quad\text{s.t.}\quad g_i(x)\le0,\ i=1,\dots,m,\tag{3.1}minf(x)s.t.gi​(x)≤0, i=1,…,m,(3.1)

with feasible set B={x∣gi(x)≤0, i=1,…,m}\mathcal B=\{x\mid g_i(x)\le 0,\ i=1,\dots,m\}B={x∣gi​(x)≤0, i=1,…,m}.

Let L(x,u)=f(x)+∑i=1muigi(x)L(x,u)=f(x)+\sum_{i=1}^m u_ig_i(x)L(x,u)=f(x)+∑i=1m​ui​gi​(x) be the Lagrange function. If (x^,u^)(\hat x,\hat u)(x^,u^) satisfies the KKT conditions (3.3), then (x^,u^≥0)(\hat x,\hat u\ge0)(x^,u^≥0) is a saddle point of LLL:

L(x^,u)≤L(x^,u^)≤L(x,u^)∀u≥0, ∀x∈Rn.(3.6)L(\hat x,u)\le L(\hat x,\hat u)\le L(x,\hat u)\qquad\forall u\ge 0,\ \forall x\in\mathbb R^n.\tag{3.6}L(x^,u)≤L(x^,u^)≤L(x,u^)∀u≥0, ∀x∈Rn.(3.6)

This links the KKT conditions to the saddle point theorem, Proposition 3.5.

Differences from the source:

  • encoding: ℝⁿ with zᵀv → EuclideanSpace ℝ (Fin n) with the inner product ⟪z, v⟫ and Mathlib's gradient; reason: Lean convention; the same space and the same gradient for differentiable functions
  • generalization: the KKT point (x̂, û ≥ 0) of Proposition 3.4 (whose hypothesis includes the Slater condition RC 1) → any (x̂, û) satisfying (3.3), without RC 1; reason: the derivation on pp.65–66 uses only (3.3) and convexity; with RC 1 added it is the source's statement
Preamble
import Mathlib
import Definitions.Def_KallMayerSLP_KKT_IsKKT
import Definitions.Def_KallMayerSLP_KKT_IsSaddlePoint
Formal statement
namespace KallMayerSLP.KKT

/-- **A KKT point is a saddle point of the Lagrange function (3.6).**
Kall & Mayer, *Stochastic Linear Programming* (2005), Chapter 1, §3.1, eq. (3.6), p.66 (PDF 77): "Hence, the KKT point `(x̂, û ≥ 0)` of Proposition 3.4 is a
saddle point of the Lagrange function: `L(x̂, u) ≤ L(x̂, û) ≤ L(x, û) ∀u ≥ 0, ∀x ∈ ℝⁿ`."

Here `f` and every `gᵢ` are convex on `ℝⁿ` and continuously differentiable (`ContDiff ℝ 1`), the
book's standing assumptions for (3.1) (p.61 and p.62), and `(x̂, û)` satisfies the KKT conditions (3.3).

**Formalization Note.** "The KKT point of Proposition 3.4" is any pair satisfying (3.3); the
derivation on pp.65–66 uses (3.3) and convexity only, not the Slater condition, which is
therefore not a hypothesis. -/
theorem kkt_isSaddlePoint {n m : ℕ} (f : EuclideanSpace ℝ (Fin n) → ℝ) (g : Fin m → EuclideanSpace ℝ (Fin n) → ℝ)
    (hf : ConvexOn ℝ Set.univ f) (hg : ∀ i, ConvexOn ℝ Set.univ (g i))
    (hf1 : ContDiff ℝ 1 f) (hg1 : ∀ i, ContDiff ℝ 1 (g i))
    (xh : EuclideanSpace ℝ (Fin n)) (uh : Fin m → ℝ) (h : IsKKT f g xh uh) :
    IsSaddlePoint f g xh uh := by sorry

end KallMayerSLP.KKT
Source
Kall & Mayer, Stochastic Linear Programming: Models, Theory, and Computation (Kluwer/Springer 2005), Chapter 1, §3.1, eq. (3.6), pp.65–66 (PDF 76–77)
Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Oct 31, 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