Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 76 — nonnegative deviation and its equality case

Proved
VBSDP.Potential.psi_nonneg

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

interior-point-methodsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1semidefinite-programming

Let (x,Z)(x,Z)(x,Z) be a strictly feasible pair for the semidefinite program with symmetric data, linearly independent variable matrices, and matrix size n≥1n\ge1n≥1. Then its deviation from centrality satisfies

ψ(x,Z)≥0,ψ(x,Z)=0 ⟹ F(x)Z=tI for some t∈R.\psi(x,Z)\ge0,\qquad \psi(x,Z)=0\ \Longrightarrow\ F(x)Z=tI\ \text{for some }t\in\mathbb R.ψ(x,Z)≥0,ψ(x,Z)=0 ⟹ F(x)Z=tI for some t∈R.

Thus vanishing deviation forces the primal and dual matrices to be inverses up to scale. The nonnegativity clause is the central inequality behind the potential bound.

Formalization Note The page says feasible pairs, but its logarithmic formula is meaningful as a finite real quantity on strictly feasible pairs; §4 and the algorithm use that domain. F0F_0F0​ is separate from the zero-based Fin m family.

Preamble
import Mathlib
import Definitions.Def_VBSDP_Potential_IsStrictlyFeasiblePair
import Definitions.Def_VBSDP_Potential_psi
Formal statement
namespace VBSDP.Potential

/-- The nonnegativity assertion for the deviation from centrality on p. 76. -/
theorem psi_nonneg {m n : ℕ} [NeZero 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)
    (hlin : LinearIndependent ℝ F)
    (x : Fin m → ℝ) (Z : Matrix (Fin n) (Fin n) ℝ)
    (h : IsStrictlyFeasiblePair c F₀ F x Z) :
    0 ≤ psi F₀ F x Z ∧
      (psi F₀ F x Z = 0 → ∃ t : ℝ, VBSDP.Duality.lmi F₀ F x * Z = t • 1) := by sorry

end VBSDP.Potential
Source
Vandenberghe and Boyd, Semidefinite Programming, SIAM Rev. 38 (1996), p. 76 (PDF p. 28), §4.5, ψ ≥ 0 statement, with §4 assumptions on p. 70, 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