Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Generalized Kuhn–Tucker theorem

Proved
VectorSpaceOpt.generalized_kuhn_tucker

by wenxinzhang · Aug 25, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-conegateaux-derivativekuhn-tuckerlocal-optimum

Let XXX and ZZZ be normed real spaces, let PPP be a convex cone in ZZZ with nonempty interior, and let f:X→Rf : X → ℝf:X→R and G:X→ZG : X → ZG:X→Z have continuous-linear Gâteaux derivatives f′f^\primef′ and G′G^\primeG′ at x0x₀x0​. Assume x0x₀x0​ is a local minimizer of fff subject to G(x)≤p0G (x) ≤ₚ 0G(x)≤p​0, and assume Luenberger regularity: x0x₀x0​ is feasible and some linearized direction is strictly feasible. Then a cone-positive continuous functional z0z₀z0​ exists with

f′+z0∘G′=0,z0(Gx0)=0.f' + z₀ ∘ G' = 0, \qquad z₀(Gx₀)=0.f′+z0​∘G′=0,z0​(Gx0​)=0.

This capstone is the coordinate-free KKT necessary condition and reuses the cone order and dual positivity published by the earlier global-duality mission.

Preamble
import Definitions.Def_VectorSpaceOpt_cone_optimization

open Set
Formal statement
namespace VectorSpaceOpt

/-- Luenberger, Chapter 9, §9.4, Theorem 1. -/
theorem generalized_kuhn_tucker
    {X Z : Type*}
    [NormedAddCommGroup X] [NormedSpace ℝ X]
    [NormedAddCommGroup Z] [NormedSpace ℝ Z]
    (P : ConvexCone ℝ Z) (f : X → ℝ) (G : X → Z) (x₀ : X)
    (f' : X →L[ℝ] ℝ) (G' : X →L[ℝ] Z)
    (hPint : (interior (P : Set Z)).Nonempty)
    (hf : HasGateauxDerivAt f f' x₀) (hG : HasGateauxDerivAt G G' x₀)
    (hmin : IsLocalMinOn f {x | coneLE P (G x) 0} x₀)
    (hregular : IsConeRegularAt P G G' x₀) :
    ∃ z₀ : Z →L[ℝ] ℝ, dualPositive P z₀ ∧
      f' + z₀.comp G' = 0 ∧ z₀ (G x₀) = 0 := by
  sorry

end VectorSpaceOpt
Source
David G. Luenberger, Optimization by Vector Space Methods (Wiley, 1969), Chapter 9, §9.4, Theorem 1, printed pp. 249–250 (physical PDF pp. 267–268). Scan: https://sites.science.oregonstate.edu/~show/old/142_Luenberger.pdf

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