Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, proof of the generalized Fritz John conditions, p. 41, (2.14) — D = {x : g_i(x) < 0, i ∈ M − M̄} is open

Proved
MangasarianFJ.GenFJ.region_isOpen

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

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

Let g1,…,gm:En→Rg_1,\dots,g_m:E^n\to\mathbb Rg1​,…,gm​:En→R be continuous and xˉ∈En\bar x\in E^nxˉ∈En. With the active set Mˉ={i∈M:gi(xˉ)=0}\bar M=\{i\in M: g_i(\bar x)=0\}Mˉ={i∈M:gi​(xˉ)=0} (2.13), the set

D={x∈En:gi(x)<0, i∈M∖Mˉ}(2.14)D=\{x\in E^n : g_i(x)<0,\ i\in M\setminus\bar M\} \tag{2.14}D={x∈En:gi​(x)<0, i∈M∖Mˉ}(2.14)

is open in EnE^nEn.

This is the first step of the proof of the main result: DDD is the open set on which Lemma 2 is applied.

Formalization Note Only continuity of the gig_igi​ is assumed, which is what the page uses ("Since M−MˉM-\bar MM−Mˉ is finite, and gi(x)g_i(x)gi​(x) are continuous"); the objective, the equalities and the C1C^1C1 hypothesis of §1 play no role here and are dropped, which makes the statement stronger.

Preamble
import Mathlib
import Definitions.Def_MangasarianFJ_GenFJ_Setting
Formal statement
namespace MangasarianFJ.GenFJ
theorem region_isOpen {n m : ℕ} (g : Fin m → EuclideanSpace ℝ (Fin n) → ℝ)
    (hg : ∀ i, Continuous (g i)) (xbar : EuclideanSpace ℝ (Fin n)) :
    IsOpen (region g xbar) := 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, §2, proof of the generalized Fritz John conditions, (2.13)–(2.14)
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