Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.2 — MPEC-MFCQ implies standard MFCQ for Scholtes' relaxed programs near x*

Proved
MPECRelax.ScholtesMFCQ.theorem_3_2

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

constraint-qualificationsmpecp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1relaxation-methods

Let the data f,gi,hi,Gi,Hif,g_i,h_i,G_i,H_if,gi​,hi​,Gi​,Hi​ of the MPEC (1) be continuously differentiable, let x∗x^*x∗ be feasible for (1), and suppose MPEC-MFCQ holds at x∗x^*x∗. Then there exist a neighbourhood NNN of x∗x^*x∗ and tˉ>0\bar t>0tˉ>0 such that, for every t>0t>0t>0, standard MFCQ for Scholtes' relaxed program

RS(t):min⁡f(x)  s.t.  gi(x)≤0, hj(x)=0, Gi(x)≥0, Hi(x)≥0, Gi(x)Hi(x)≤tR^S(t):\quad \min f(x)\ \text{ s.t. }\ g_i(x)\le0,\ h_j(x)=0,\ G_i(x)\ge0,\ H_i(x)\ge0,\ G_i(x)H_i(x)\le tRS(t):minf(x)  s.t.  gi​(x)≤0, hj​(x)=0, Gi​(x)≥0, Hi​(x)≥0, Gi​(x)Hi​(x)≤t

is satisfied at all x∈N∩XS(t)x\in N\cap X^S(t)x∈N∩XS(t), where XS(t)X^S(t)XS(t) is the feasible set of RS(t)R^S(t)RS(t).

The theorem guarantees that KKT multipliers exist at local minimizers of the relaxed programs near x∗x^*x∗, which is the hypothesis of the convergence result for the method (Theorem 3.1).

Formalization Note. The paper introduces tˉ>0\bar t>0tˉ>0 but never uses it: ttt is free in the statement, and the proof works for every t>0t>0t>0 (the relaxed program is defined for t>0t>0t>0, p. 8). We keep tˉ\bar ttˉ to mirror the statement and quantify over all t>0t>0t>0; the neighbourhood NNN is chosen before ttt and does not depend on it. "Standard MFCQ for RS(t)R^S(t)RS(t)" is MFCQ of the NLP RS(t)R^S(t)RS(t) at xxx, with its own active set, including −Gi≤0-G_i\le0−Gi​≤0, −Hi≤0-H_i\le0−Hi​≤0 and the product constraint GiHi−t≤0G_iH_i-t\le0Gi​Hi​−t≤0 when active. The C¹ standing assumption of p. 1 is the hypothesis IsC1.

Preamble
import Mathlib
import Definitions.Def_MPECRelax_ScholtesMFCQ_Basic

open Filter Topology
open scoped RealInnerProductSpace
Formal statement
namespace MPECRelax.ScholtesMFCQ

/-- Theorem 3.2 (p. 11): if `xs` is feasible for the MPEC (1) and MPEC-MFCQ holds at
`xs`, there are a neighbourhood `N` of `xs` and `t̄ > 0` such that standard MFCQ for
the relaxed program R^S(t) holds at every `x ∈ N ∩ X^S(t)`. The paper's statement never
uses `t̄`; the parameter `t > 0` is free, as in its proof, and `N` does not depend on `t`. -/
theorem theorem_3_2 {n m p l : ℕ} (P : MPEC n m p l) (hP : P.IsC1)
    (xs : MPECRelax.ScholtesConv.E n) (hfeas : P.Feasible xs) (hCQ : P.MPEC_MFCQ xs) :
    ∃ N ∈ 𝓝 xs, ∃ tbar : ℝ, 0 < tbar ∧
      ∀ t : ℝ, 0 < t → ∀ x ∈ N, (P.RS t).Feasible x → (P.RS t).IsMFCQ x := by sorry

end MPECRelax.ScholtesMFCQ
Source
Hoheisel, Kanzow, Schwartz, Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints, Preprint 299, Univ. Würzburg, Sept. 2010, p. 11, Theorem 3.2
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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