Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.1, pp. 10–11 — the limit x* is weakly stationary

Proved
MPECRelax.ScholtesConv.limit_weakly_stationary

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

mpecp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1relaxation-methodsstationarity

Let the MPEC data f,g,h,G,Hf,g,h,G,Hf,g,h,G,H be continuously differentiable, let {tk}↓0\{t_k\}\downarrow0{tk​}↓0, let xkx^kxk be a stationary (KKT) point of Scholtes' relaxed program RS(tk)R^S(t_k)RS(tk​) for every kkk, let xk→x∗x^k\to x^*xk→x∗, and let MPEC-MFCQ hold at x∗x^*x∗. Then x∗x^*x∗ is feasible for (1) and weakly stationary: there are λ∗∈Rm\lambda^*\in\mathbb R^mλ∗∈Rm, μ∗∈Rp\mu^*\in\mathbb R^pμ∗∈Rp, γ∗,ν∗∈Rl\gamma^*,\nu^*\in\mathbb R^lγ∗,ν∗∈Rl with λ∗≥0\lambda^*\ge0λ∗≥0, λi∗gi(x∗)=0\lambda^*_ig_i(x^*)=0λi∗​gi​(x∗)=0, γi∗=0\gamma^*_i=0γi∗​=0 (i∈I+0i\in I_{+0}i∈I+0​), νi∗=0\nu^*_i=0νi∗​=0 (i∈I0+i\in I_{0+}i∈I0+​) and

0=∇f(x∗)+∑i=1mλi∗∇gi(x∗)+∑i=1pμi∗∇hi(x∗)−∑i=1lγi∗∇Gi(x∗)−∑i=1lνi∗∇Hi(x∗).0=\nabla f(x^*)+\sum_{i=1}^m\lambda^*_i\nabla g_i(x^*)+\sum_{i=1}^p\mu^*_i\nabla h_i(x^*)-\sum_{i=1}^l\gamma^*_i\nabla G_i(x^*)-\sum_{i=1}^l\nu^*_i\nabla H_i(x^*).0=∇f(x∗)+i=1∑m​λi∗​∇gi​(x∗)+i=1∑p​μi∗​∇hi​(x∗)−i=1∑l​γi∗​∇Gi​(x∗)−i=1∑l​νi∗​∇Hi​(x∗).

This is the first half of Theorem 3.1; the remaining step is the sign condition on I00I_{00}I00​.

Formalization Note The paper states this inside the proof of Theorem 3.1, for multipliers obtained as limits of modified KKT multipliers of RS(tk)R^S(t_k)RS(tk​); the statement here asserts only the existence of weak-stationarity multipliers, with the same hypotheses as Theorem 3.1. "Stationary point" means KKT point including feasibility (p. 5); {tk}↓0\{t_k\}\downarrow0{tk​}↓0 is tk>0t_k>0tk​>0, nonincreasing, tk→0t_k\to0tk​→0.

Preamble
import Mathlib
import Definitions.Def_MPECRelax_ScholtesConv_NLP
import Definitions.Def_MPECRelax_ScholtesConv_MPEC
import Definitions.Def_MPECRelax_ScholtesConv_Scholtes

open Filter Topology
Formal statement
namespace MPECRelax.ScholtesConv

theorem limit_weakly_stationary {n m p l : ℕ} (P : MPEC n m p l) (hP : P.IsC1)
    (t : ℕ → ℝ) (ht_pos : ∀ k, 0 < t k) (ht_anti : Antitone t)
    (ht_lim : Tendsto t atTop (𝓝 0))
    (x : ℕ → E n) (hx : ∀ k, (P.RS (t k)).IsKKTPoint (x k))
    (xs : E n) (hxs : Tendsto x atTop (𝓝 xs)) (hCQ : P.MPEC_MFCQ xs) :
    P.IsWeaklyStationary xs := 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, pp. 10–11, proof of Theorem 3.1
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