Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.1, p. 330 — ε²-optimal feasible points satisfying the Lagrange multiplier rule up to ε

Proved
EkelandVP.Constraints.theorem_3_1

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

banach-spaceconstrained-optimizationkkt-conditionslagrange-multipliersp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1variational-principle

Let VVV be a real Banach space with dual V∗V^*V∗, let F:V→RF:V\to\mathbb RF:V→R be Fréchet-differentiable, and let G1,…,Gm:V→RG_1,\dots,G_m:V\to\mathbb RG1​,…,Gm​:V→R be C1C^1C1 functions, 0≤p≤m0\le p\le m0≤p≤m, defining the problem

inf⁡F(v)subject toGi(v)=0 (1≤i≤p),Gi(v)≥0 (p+1≤i≤m),(3.1)\inf F(v)\quad\text{subject to}\quad G_i(v)=0\ (1\le i\le p),\qquad G_i(v)\ge0\ (p+1\le i\le m), \tag{3.1}infF(v)subject toGi​(v)=0 (1≤i≤p),Gi​(v)≥0 (p+1≤i≤m),(3.1)

with feasible set C\mathcal CC (3.2). Assume the regularity assumption (3.4): at every v∈Cv\in\mathcal Cv∈C the derivatives Gi′(v)G_i'(v)Gi′​(v) of the saturated constraints i∈I(v)i\in I(v)i∈I(v) are linearly independent. Assume C≠∅\mathcal C\neq\emptysetC=∅ and that FFF is bounded below on C\mathcal CC, inf⁡v∈CF(v)>−∞\inf_{v\in\mathcal C}F(v)>-\inftyinfv∈C​F(v)>−∞ (3.5). Then for every ε>0\varepsilon>0ε>0 there exist a point vεv_\varepsilonvε​ with

vε∈CandF(vε)≤inf⁡v∈CF(v)+ε2,(3.6)v_\varepsilon\in\mathcal C\qquad\text{and}\qquad F(v_\varepsilon)\le\inf_{v\in\mathcal C}F(v)+\varepsilon^2, \tag{3.6}vε​∈CandF(vε​)≤v∈Cinf​F(v)+ε2,(3.6)

and real numbers λ1,…,λm\lambda_1,\dots,\lambda_mλ1​,…,λm​ with

λi≥0  (p+1≤i≤m),λi=0  if Gi(vε)≠0,∥F′(vε)−∑i=1mλiGi′(vε)∥∗≤ε.(3.7)\lambda_i\ge0\ \ (p+1\le i\le m),\qquad \lambda_i=0\ \text{ if } G_i(v_\varepsilon)\ne0,\qquad \Big\|F'(v_\varepsilon)-\sum_{i=1}^m\lambda_iG_i'(v_\varepsilon)\Big\|_*\le\varepsilon. \tag{3.7}λi​≥0  (p+1≤i≤m),λi​=0  if Gi​(vε​)=0,​F′(vε​)−i=1∑m​λi​Gi′​(vε​)​∗​≤ε.(3.7)

The problem (3.1) need have no solution in an infinite-dimensional space; the theorem asserts that nearly optimal points nevertheless satisfy the Karush–Kuhn–Tucker conditions up to an error ε\varepsilonε in the dual norm.

Formalization Note. The infimum over C\mathcal CC is not formed in Lean: (3.5) is BddBelow (F '' 𝒞) and (3.6) is F(vε)≤F(w)+ε2F(v_\varepsilon)\le F(w)+\varepsilon^2F(vε​)≤F(w)+ε2 for every w∈Cw\in\mathcal Cw∈C. Non-emptiness of C\mathcal CC is an added hypothesis: if C=∅\mathcal C=\emptysetC=∅ the page's (3.5) holds (inf⁡∅=+∞\inf\emptyset=+\inftyinf∅=+∞) but no vε∈Cv_\varepsilon\in\mathcal Cvε​∈C exists. Constraints are indexed by Fin m (constraint iii of the page is Lean index i−1i-1i−1), F′(v)F'(v)F′(v) is fderiv ℝ F v and ∥⋅∥∗\|\cdot\|_*∥⋅∥∗​ is the operator norm on V →L[ℝ] ℝ.

Preamble
import Mathlib
import Definitions.Def_EkelandVP_Constraints_feasibleSet
import Definitions.Def_EkelandVP_Constraints_IsRegular
Formal statement
namespace EkelandVP.Constraints

/-- Ekeland (1974), Theorem 3.1, p. 330: on a Banach space `V`, let `F` be Fréchet-differentiable and
`G_1, …, G_m` be `C¹` with the regularity assumption (3.4), and let `F` be bounded below on the
(nonempty) feasible set `𝒞` (3.5). Then for every `ε > 0` there is `v_ε ∈ 𝒞` with
`F(v_ε) ≤ inf_𝒞 F + ε²` (3.6), and reals `λ_1, …, λ_m` with `λ_i ≥ 0` for the inequality constraints,
`λ_i = 0` when `G_i(v_ε) ≠ 0`, and `‖F'(v_ε) - Σ λ_i G_i'(v_ε)‖* ≤ ε` (3.7). -/
theorem theorem_3_1 {V : Type*} [NormedAddCommGroup V] [NormedSpace ℝ V] [CompleteSpace V]
    {m : ℕ} (p : ℕ) (hp : p ≤ m) (F : V → ℝ) (G : Fin m → V → ℝ)
    (hF : Differentiable ℝ F) (hG : ∀ i, ContDiff ℝ 1 (G i))
    (hreg : IsRegular p G)
    (hne : (feasibleSet p G).Nonempty) (hbdd : BddBelow (F '' feasibleSet p G))
    (ε : ℝ) (hε : 0 < ε) :
    ∃ v ∈ feasibleSet p G,
      (∀ w ∈ feasibleSet p G, F v ≤ F w + ε ^ 2) ∧
      ∃ lam : Fin m → ℝ,
        (∀ i : Fin m, p ≤ i.val → 0 ≤ lam i) ∧
        (∀ i : Fin m, G i v ≠ 0 → lam i = 0) ∧
        ‖fderiv ℝ F v - ∑ i, lam i • fderiv ℝ (G i) v‖ ≤ ε := by sorry

end EkelandVP.Constraints
Source
Ekeland, On the Variational Principle, J. Math. Anal. Appl. 47 (1974), p. 330, §3, Theorem 3.1, (3.5)–(3.7); standing setting pp. 329–330, (3.1)–(3.4)
Human review
  • Endorsed by Shuze Chen · Oct 4, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 4, 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