Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.1: strong duality and attainment under strict feasibility

Proved
VBSDP.Duality.theorem_3_1

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

dualityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1semidefinite-programming

Let c∈Rmc\in\mathbb R^mc∈Rm and let F0,…,FmF_0,\ldots,F_mF0​,…,Fm​ be symmetric real n×nn\times nn×n matrices. For the primal problem (1) and dual problem (27), either of the following conditions implies equality of extended optimal values:

  1. There is xxx with F(x)≻0F(x)\succ0F(x)≻0.
  2. There is a dual feasible Z≻0Z\succ0Z≻0.
p∗=d∗.p^*=d^*.p∗=d∗.

If both strict-feasibility conditions hold, then both optimal sets are nonempty: Xopt≠∅X_{\mathrm{opt}}\ne\varnothingXopt​=∅ and Zopt≠∅Z_{\mathrm{opt}}\ne\varnothingZopt​=∅.

This statement supplies a target in the duality development.

Formalization Note Matrices have dimension n×nn\times nn×n, with coefficients F1,…,FmF_1,\ldots,F_mF1​,…,Fm​ indexed in Lean from 0 and F0F_0F0​ passed separately. Positive semidefiniteness and positive definiteness are matrix conditions; trace is the matrix trace.

Preamble
import Mathlib
import Definitions.Def_VBSDP_Duality_lmi
import Definitions.Def_VBSDP_Duality_pStar
import Definitions.Def_VBSDP_Duality_dStar
import Definitions.Def_VBSDP_Duality_Xopt
import Definitions.Def_VBSDP_Duality_Zopt
Formal statement
namespace VBSDP.Duality

theorem theorem_3_1 {m n : ℕ} (c : Fin m → ℝ)
    (F₀ : Matrix (Fin n) (Fin n) ℝ) (F : Fin m → Matrix (Fin n) (Fin n) ℝ)
    (hF₀ : F₀.IsHermitian) (hF : ∀ i, (F i).IsHermitian) :
    (((∃ x, (lmi F₀ F x).PosDef) ∨
      (∃ Z : Matrix (Fin n) (Fin n) ℝ, Z.PosDef ∧ ∀ i, (F i * Z).trace = c i)) →
      pStar c F₀ F = dStar c F₀ F) ∧
    (((∃ x, (lmi F₀ F x).PosDef) ∧
      (∃ Z : Matrix (Fin n) (Fin n) ℝ, Z.PosDef ∧ ∀ i, (F i * Z).trace = c i)) →
      (Xopt c F₀ F).Nonempty ∧ (Zopt c F₀ F).Nonempty) := by sorry

end VBSDP.Duality
Source
Vandenberghe and Boyd, Semidefinite Programming, SIAM Review 38(1) (1996), p. 64, Theorem 3.1, continued on p. 65, PDF p. 16, https://doi.org/10.1137/1038003
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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