Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 8, p. 13 — under the strict CQ (42), M(x̄) = {(ζ̄, Γ̄)} and aff(C(x̄)) = app(ζ̄, Γ̄)

Proved
SunNLSDP.Equiv.proposition_8

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

constraint-qualificationcritical-conenonlinear-semidefinite-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let xˉ\bar xxˉ be feasible for (NLSDP) and (ζˉ,Γˉ)∈M(xˉ)(\bar\zeta,\bar\Gamma)\in\mathcal M(\bar x)(ζˉ​,Γˉ)∈M(xˉ). Suppose the strict constraint qualification (42) holds:

{Jxh(xˉ)X=ℜm,Jxg(xˉ)X+TS+p(g(xˉ))∩Γˉ⊥=Sp.\begin{cases}J_xh(\bar x)X=\Re^m,\\ J_xg(\bar x)X+T_{\mathcal S^p_+}(g(\bar x))\cap\bar\Gamma^\perp=\mathcal S^p.\end{cases}{Jx​h(xˉ)X=ℜm,Jx​g(xˉ)X+TS+p​​(g(xˉ))∩Γˉ⊥=Sp.​

Then M(xˉ)={(ζˉ,Γˉ)}\mathcal M(\bar x)=\{(\bar\zeta,\bar\Gamma)\}M(xˉ)={(ζˉ​,Γˉ)} and aff(C(xˉ))=app(ζˉ,Γˉ)\mathrm{aff}(C(\bar x))=\mathrm{app}(\bar\zeta,\bar\Gamma)aff(C(xˉ))=app(ζˉ​,Γˉ), where C(xˉ)C(\bar x)C(xˉ) is the critical cone (31) and app(ζˉ,Γˉ)={d:Jxh(xˉ)d=0, Jxg(xˉ)d∈aff(C(g(xˉ)+Γˉ;S+p))}\mathrm{app}(\bar\zeta,\bar\Gamma)=\{d:J_xh(\bar x)d=0,\ J_xg(\bar x)d\in\mathrm{aff}(C(g(\bar x)+\bar\Gamma;\mathcal S^p_+))\}app(ζˉ​,Γˉ)={d:Jx​h(xˉ)d=0, Jx​g(xˉ)d∈aff(C(g(xˉ)+Γˉ;S+p​))} (38).

Formalization Note. (42) is read as one coupled system: for every (a,B)∈ℜm×Sp(a,B)\in\Re^m\times\mathcal S^p(a,B)∈ℜm×Sp there is one d∈Xd\in Xd∈X with Jxh(xˉ)d=aJ_xh(\bar x)d=aJx​h(xˉ)d=a and B−Jxg(xˉ)d∈TS+p(g(xˉ))∩Γˉ⊥B-J_xg(\bar x)d\in T_{\mathcal S^p_+}(g(\bar x))\cap\bar\Gamma^\perpB−Jx​g(xˉ)d∈TS+p​​(g(xˉ))∩Γˉ⊥. This is the reading used in the proof ((43)); read as two separate equations it would be strictly weaker.

Preamble
import Mathlib
import Definitions.Def_NonsmoothNewton_Shared_clarkeJac
import Definitions.Def_NonsmoothNewton_Local_dirDeriv
import Definitions.Def_RobinsonSR_Reduction_Setting
import Definitions.Def_SunNLSDP_Equiv_Setting

open scoped RealInnerProductSpace Topology
open Filter NonsmoothNewton.Shared NonsmoothNewton.Local
Formal statement
namespace SunNLSDP.Equiv
theorem proposition_8 {X : Type*} [NormedAddCommGroup X] [InnerProductSpace ℝ X]
    [FiniteDimensional ℝ X] {m : ℕ} {n : Type} [Fintype n] [DecidableEq n]
    (P : NLSDP X m n) (xbar : X) (ζbar : EuclideanSpace ℝ (Fin m)) (Γbar : SymMat n)
    (hfeas : P.feasible xbar) (hKKT : (ζbar, Γbar) ∈ P.multipliers xbar)
    (hstrict : P.StrictCQ xbar Γbar) :
    P.multipliers xbar = {(ζbar, Γbar)} ∧
      (affineSpan ℝ (P.criticalCone xbar) : Set X) = P.app xbar ζbar Γbar := by sorry
end SunNLSDP.Equiv
Source
Sun, The strong second order sufficient condition and constraint nondegeneracy in nonlinear semidefinite programming and their implications, preprint dated May 15, 2005, p. 13, Proposition 8 (42)
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