Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, proof of the generalized Fritz John conditions, pp. 41–42 — (2.17) has the solution x̄ ∈ D and (2.18) has no solution in D

Proved
MangasarianFJ.GenFJ.system_2_18_no_solution

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

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

Let xˉ\bar xxˉ be a solution of (1.1): xˉ∈S\bar x\in Sxˉ∈S and θ(xˉ)≤θ(x)\theta(\bar x)\le\theta(x)θ(xˉ)≤θ(x) for all x∈Sx\in Sx∈S. Let Mˉ\bar MMˉ be the active set (2.13) and D={x:gi(x)<0, i∈M∖Mˉ}D=\{x: g_i(x)<0,\ i\in M\setminus\bar M\}D={x:gi​(x)<0, i∈M∖Mˉ} (2.14). With f1(x)=θ(x)−θ(xˉ)f_1(x)=\theta(x)-\theta(\bar x)f1​(x)=θ(x)−θ(xˉ) (2.15) and fi=gpif_i=g_{p_i}fi​=gpi​​, pi∈Mˉp_i\in\bar Mpi​∈Mˉ (2.16), the following hold:

  1. xˉ∈D\bar x\in Dxˉ∈D, and xˉ\bar xxˉ solves (2.17): gi(xˉ)=0g_i(\bar x)=0gi​(xˉ)=0 for i∈Mˉi\in\bar Mi∈Mˉ and hj(xˉ)=0h_j(\bar x)=0hj​(xˉ)=0 for j∈Kj\in Kj∈K (and trivially f1(xˉ)=0f_1(\bar x)=0f1​(xˉ)=0);
  2. the system (2.18)
θ(x)−θ(xˉ)<0,gi(x)<0, i∈Mˉ,hj(x)=0, j∈K\theta(x)-\theta(\bar x)<0,\qquad g_i(x)<0,\ i\in\bar M,\qquad h_j(x)=0,\ j\in Kθ(x)−θ(xˉ)<0,gi​(x)<0, i∈Mˉ,hj​(x)=0, j∈K

has no solution x∈Dx\in Dx∈D.

These are exactly the hypotheses (2.1)–(2.2) of Lemma 2 for the family f1,…,flf_1,\dots,f_lf1​,…,fl​, which is how the main result follows from Lemma 2.

Formalization Note The family f1,…,flf_1,\dots,f_lf1​,…,fl​ of (2.15)–(2.16) is substituted, not defined: the statement lists the conditions on θ\thetaθ and on gig_igi​, i∈Mˉi\in\bar Mi∈Mˉ, directly, so no enumeration pip_ipi​ of Mˉ\bar MMˉ is needed. The trivial clause f1(xˉ)=θ(xˉ)−θ(xˉ)=0f_1(\bar x)=\theta(\bar x)-\theta(\bar x)=0f1​(xˉ)=θ(xˉ)−θ(xˉ)=0 is omitted. No differentiability is used in this step, so the C1C^1C1 hypothesis of §1 is dropped (a stronger statement).

Preamble
import Mathlib
import Definitions.Def_MangasarianFJ_GenFJ_Setting
Formal statement
namespace MangasarianFJ.GenFJ
theorem system_2_18_no_solution {n m k : ℕ} (θ : EuclideanSpace ℝ (Fin n) → ℝ)
    (g : Fin m → EuclideanSpace ℝ (Fin n) → ℝ) (h : Fin k → EuclideanSpace ℝ (Fin n) → ℝ)
    (xbar : EuclideanSpace ℝ (Fin n)) (hsol : IsSolution θ g h xbar) :
    xbar ∈ region g xbar ∧
    ((∀ i ∈ activeSet g xbar, g i xbar = 0) ∧ ∀ j, h j xbar = 0) ∧
    ¬ ∃ x ∈ region g xbar,
      θ x - θ xbar < 0 ∧ (∀ i ∈ activeSet g xbar, g i x < 0) ∧ ∀ j, h j x = 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), pp. 41–42, §2, proof of the generalized Fritz John conditions, (2.15)–(2.19)
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