Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 2.2 — MFCQ iff the active inequality and all equality gradients are positive-linearly independent

Proved
MPECRelax.ScholtesConv.remark_2_2

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

constraint-qualificationsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1theorems-of-the-alternative

Let x∗x^*x∗ be a feasible point of a nonlinear program (2) with finitely many inequality constraints gi≤0g_i\le0gi​≤0 and equality constraints hj=0h_j=0hj​=0, and let Ig={i∣gi(x∗)=0}I_g=\{i\mid g_i(x^*)=0\}Ig​={i∣gi​(x∗)=0} be its active set. Then

x∗ satisfies MFCQ  ⟺  {∇gi(x∗)∣i∈Ig}∪{∇hj(x∗)∣j=1,…,p} is positive-linearly independent.x^*\ \text{satisfies MFCQ}\iff\{\nabla g_i(x^*)\mid i\in I_g\}\cup\{\nabla h_j(x^*)\mid j=1,\dots,p\}\ \text{is positive-linearly independent.}x∗ satisfies MFCQ⟺{∇gi​(x∗)∣i∈Ig​}∪{∇hj​(x∗)∣j=1,…,p} is positive-linearly independent.

This dual characterisation of MFCQ is the form used throughout the convergence analysis of relaxation methods: MPEC-MFCQ is applied as positive-linear independence of a family of gradients.

Formalization Note The statement concerns only the gradient values at x∗x^*x∗; no differentiability is assumed (for non-differentiable data, Mathlib's gradient is 000, and the equivalence is still a statement about those vectors). Positive-linear independence is the negation of positive-linear dependence (Definition 2.1) with I1=IgI_1=I_gI1​=Ig​ and I2I_2I2​ all equality indices.

Preamble
import Mathlib
import Definitions.Def_MPECRelax_ScholtesConv_NLP
Formal statement
namespace MPECRelax.ScholtesConv

theorem remark_2_2 {n : ℕ} {ι κ : Type} [Fintype ι] [Fintype κ] (P : NLP n ι κ) (x : E n)
    (hx : P.Feasible x) :
    P.IsMFCQ x ↔ ¬ P.PosLinDep x (P.activeSet x) Set.univ := by sorry

end MPECRelax.ScholtesConv
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. 4, Remark 2.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