Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Generalized Fritz John Necessary Conditions (§2), p. 41 — at a solution of (1.1) there are ū ≥ 0, v̄, (ū, v̄) ≠ 0, satisfying (2.9)–(2.10)

Proved
MangasarianFJ.GenFJ.generalized_fritz_john

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

fritz-john-conditionslagrange-multipliersnecessary-optimality-conditionsnonlinear-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider the program (1.1): minimize θ(x)\theta(x)θ(x) subject to gi(x)≤0g_i(x)\le0gi​(x)≤0, i∈M={1,…,m}i\in M=\{1,\dots,m\}i∈M={1,…,m}, and hj(x)=0h_j(x)=0hj​(x)=0, j∈K={1,…,k}j\in K=\{1,\dots,k\}j∈K={1,…,k}, where θ,gi,hj:En→R\theta, g_i, h_j:E^n\to\mathbb Rθ,gi​,hj​:En→R have continuous first partial derivatives on EnE^nEn. Let xˉ\bar xxˉ be a solution of (1.1), i.e. xˉ\bar xxˉ is feasible and θ(xˉ)\theta(\bar x)θ(xˉ) is the minimum of θ\thetaθ on the feasible set SSS. Then there exist uˉ=(uˉ0,uˉ1,…,uˉm)∈Em+1\bar u=(\bar u_0,\bar u_1,\dots,\bar u_m)\in E^{m+1}uˉ=(uˉ0​,uˉ1​,…,uˉm​)∈Em+1 and vˉ=(vˉ1,…,vˉk)∈Ek\bar v=(\bar v_1,\dots,\bar v_k)\in E^kvˉ=(vˉ1​,…,vˉk​)∈Ek such that

uˉ0∇θ(xˉ)+∑i=1muˉi∇gi(xˉ)+∑j=1kvˉj∇hj(xˉ)=0,(2.9)\bar u_0\nabla\theta(\bar x)+\sum_{i=1}^m\bar u_i\nabla g_i(\bar x)+\sum_{j=1}^k\bar v_j\nabla h_j(\bar x)=0, \tag{2.9}uˉ0​∇θ(xˉ)+i=1∑m​uˉi​∇gi​(xˉ)+j=1∑k​vˉj​∇hj​(xˉ)=0,(2.9) ∑i=1muˉigi(xˉ)=0,(2.10)\sum_{i=1}^m\bar u_i g_i(\bar x)=0, \tag{2.10}i=1∑m​uˉi​gi​(xˉ)=0,(2.10) uˉ≥0,(2.11)\bar u\ge0, \tag{2.11}uˉ≥0,(2.11) (uˉ,vˉ)≠0.(2.12)(\bar u,\bar v)\ne0. \tag{2.12}(uˉ,vˉ)=0.(2.12)

This is the main result of the paper: Fritz John's necessary conditions extended to problems with equality constraints, in a form that does not become trivial when the equalities are present (splitting each equality into two inequalities makes the original conditions hold at every feasible point). It is the basis of the Mangasarian–Fromovitz constraint qualification of §3.

Formalization Note EnE^nEn is EuclideanSpace ℝ (Fin n), ∇\nabla∇ is Mathlib's gradient, and "continuous first partial derivatives on EnE^nEn" (the standing assumption of §1) is ContDiff ℝ 1, equivalent in finite dimension. Indices are Fin m, Fin k (0-based). uˉ\bar uuˉ is split into u0 (multiplier of θ\thetaθ) and u; (2.11) is 0≤uˉ00\le\bar u_00≤uˉ0​ and 0≤uˉi0\le\bar u_i0≤uˉi​ for all iii; (2.12) is "uˉ0≠0\bar u_0\ne0uˉ0​=0 or some uˉi≠0\bar u_i\ne0uˉi​=0 or some vˉj≠0\bar v_j\ne0vˉj​=0". A solution of (1.1) is a global minimizer over SSS (definition IsSolution). m=0m=0m=0 and k=0k=0k=0 are allowed.

Preamble
import Mathlib
import Definitions.Def_MangasarianFJ_GenFJ_Setting
Formal statement
namespace MangasarianFJ.GenFJ
theorem generalized_fritz_john {n m k : ℕ} (θ : EuclideanSpace ℝ (Fin n) → ℝ)
    (g : Fin m → EuclideanSpace ℝ (Fin n) → ℝ) (h : Fin k → EuclideanSpace ℝ (Fin n) → ℝ)
    (hθ : ContDiff ℝ 1 θ) (hg : ∀ i, ContDiff ℝ 1 (g i)) (hh : ∀ j, ContDiff ℝ 1 (h j))
    (xbar : EuclideanSpace ℝ (Fin n)) (hsol : IsSolution θ g h xbar) :
    ∃ (u0 : ℝ) (u : Fin m → ℝ) (v : Fin k → ℝ),
      u0 • gradient θ xbar + ∑ i, u i • gradient (g i) xbar
          + ∑ j, v j • gradient (h j) xbar = 0 ∧
      ∑ i, u i * g i xbar = 0 ∧
      0 ≤ u0 ∧ (∀ i, 0 ≤ u i) ∧
      (u0 ≠ 0 ∨ (∃ i, u i ≠ 0) ∨ ∃ j, v j ≠ 0) := by sorry
end MangasarianFJ.GenFJ
Source
Mangasarian and Fromovitz, The Fritz John necessary optimality conditions in the presence of equality and inequality constraints, J. Math. Anal. Appl. 17 (1967), p. 41, The generalized Fritz John Necessary Conditions, (2.9)–(2.12)
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