Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, p. 4 — a nonzero solution of (2.4) contradicts MFCQ

Proved
StrictCQ.Scaled.eq_2_4_not_mfcq

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

constraint-qualificationmfcqp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let h1,…,hmh_1,\dots,h_mh1​,…,hm​, g1,…,gpg_1,\dots,g_pg1​,…,gp​ be a constraint system on Rn\mathbb R^nRn and x∗x^*x∗ a feasible point. Suppose there are λ∈Rm\lambda \in \mathbb R^mλ∈Rm and μ∈Rp\mu \in \mathbb R^pμ∈Rp with μj≥0\mu_j \ge 0μj​≥0 for all jjj, μj=0\mu_j = 0μj​=0 whenever gj(x∗)≠0g_j(x^*) \ne 0gj​(x∗)=0, max⁡{∥λ∥∞,∥μ∥∞}=1\max\{\|\lambda\|_\infty, \|\mu\|_\infty\} = 1max{∥λ∥∞​,∥μ∥∞​}=1, and

∑i=1mλi∇hi(x∗)+∑j: gj(x∗)=0μj∇gj(x∗)=0.\sum_{i=1}^m \lambda_i \nabla h_i(x^*) + \sum_{j:\, g_j(x^*) = 0} \mu_j \nabla g_j(x^*) = 0 .i=1∑m​λi​∇hi​(x∗)+j:gj​(x∗)=0∑​μj​∇gj​(x∗)=0.

Then x∗x^*x∗ does not satisfy the Mangasarian–Fromovitz constraint qualification.

Combined with the previous milestone, this closes the proof that (2.3) is a strict constraint qualification associated with Scaled-AKKT.

Preamble
import Mathlib
import Definitions.Def_StrictCQ_Scaled_Setting
import Definitions.Def_StrictCQ_Scaled_Conditions

open Filter Topology
open scoped InnerProductSpace
Formal statement
namespace StrictCQ.Scaled

theorem eq_2_4_not_mfcq {n m p : ℕ} (C : Constraints n m p)
    (xs : EuclideanSpace ℝ (Fin n)) (hxs : xs ∈ C.feasible)
    (l : Fin m → ℝ) (u : Fin p → ℝ) (hu : ∀ j, 0 ≤ u j) (hcomp : ∀ j, C.g j xs ≠ 0 → u j = 0)
    (hnorm : max ‖l‖ ‖u‖ = 1)
    (h24 : ∑ i, l i • gradient (C.h i) xs + ∑ j, u j • gradient (C.g j) xs = 0) :
    ¬ C.MFCQ xs := by sorry

end StrictCQ.Scaled
Source
Andreani, Martínez, Ramos & Silva, Strict constraint qualifications and sequential optimality conditions for constrained optimization, Optimization Online 5197 (version of November 12, 2015), p. 4, §2 (sentence after (2.4))
Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

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