Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.1 — fixed potential decrease gives a duality-gap bound

Proved
VBSDP.Potential.theorem_5_1

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

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

Consider the primal semidefinite program defined by symmetric F0,…,FmF_0,\ldots,F_mF0​,…,Fm​, with linearly independent F1,…,FmF_1,\ldots,F_mF1​,…,Fm​, matrix size n≥1n\ge1n≥1, and the potential parameter ν≥1\nu\ge1ν≥1. Fix k∈Nk\in\mathbb Nk∈N and let (x(j),Z(j))(x^{(j)},Z^{(j)})(x(j),Z(j)), j=0,…,kj=0,\ldots,kj=0,…,k, be strictly feasible primal-dual pairs. Suppose a fixed δ>0\delta>0δ>0 satisfies φ(x(j+1),Z(j+1))≤φ(x(j),Z(j))−δ\varphi(x^{(j+1)},Z^{(j+1)})\le\varphi(x^{(j)},Z^{(j)})-\deltaφ(x(j+1),Z(j+1))≤φ(x(j),Z(j))−δ at every step j<kj<kj<k. For 0<ε<10<\varepsilon<10<ε<1, if

k≥νnlog⁡(1/ε)+ψ(x(0),Z(0))δ,k\ge\frac{\nu\sqrt n\log(1/\varepsilon)+\psi(x^{(0)},Z^{(0)})}{\delta},k≥δνn​log(1/ε)+ψ(x(0),Z(0))​,

then the duality gap obeys

Tr⁡(F(x(k))Z(k))≤εTr⁡(F(x(0))Z(0)).\operatorname{Tr}(F(x^{(k)})Z^{(k)})\le\varepsilon\operatorname{Tr}(F(x^{(0)})Z^{(0)}).Tr(F(x(k))Z(k))≤εTr(F(x(0))Z(0)).

This gives a numerical iteration bound whenever a method guarantees a fixed decrease in the potential.

Formalization Note The paper prints a strict “<” conclusion, but equality is possible at the displayed threshold. For n=m=1n=m=1n=m=1, F0=0F_0=0F0​=0, F1=c=Z(j)=1F_1=c=Z^{(j)}=1F1​=c=Z(j)=1, x(j)=e−jx^{(j)}=e^{-j}x(j)=e−j, ν=δ=1\nu=\delta=1ν=δ=1, and ε=e−1\varepsilon=e^{-1}ε=e−1, the bound holds with equality at k=1k=1k=1. The non-strict conclusion records the boundary-correct result. The step condition (56) and strict feasibility are required only for the iterates up to kkk, so the statement covers a method that stops after kkk steps. Strict feasibility and n≥1n\ge1n≥1 protect all logarithms. The Fin m matrices are zero-based with F0F_0F0​ separate.


Retired 2026-10-27: a Lean-vs-paper fidelity audit found this statement weaker than, or narrower than, the cited result. A corrected statement will be resubmitted.

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

/-- Theorem 5.1 with the boundary-correct non-strict conclusion. -/
theorem theorem_5_1 {m n : ℕ} [NeZero n] (ν : ℝ) (hν : 1 ≤ ν)
    (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)
    (xs : ℕ → Fin m → ℝ) (Zs : ℕ → Matrix (Fin n) (Fin n) ℝ) (k : ℕ)
    (hfeas : ∀ j ≤ k, IsStrictlyFeasiblePair c F₀ F (xs j) (Zs j))
    (δ : ℝ) (hδ : 0 < δ)
    (h56 : ∀ j < k, phi ν F₀ F (xs (j + 1)) (Zs (j + 1)) ≤
      phi ν F₀ F (xs j) (Zs j) - δ)
    (ε : ℝ) (hε0 : 0 < ε) (hε1 : ε < 1)
    (hk : (ν * Real.sqrt n * Real.log (1 / ε) +
      psi F₀ F (xs 0) (Zs 0)) / δ ≤ k) :
    (VBSDP.Duality.lmi F₀ F (xs k) * Zs k).trace ≤
      ε * (VBSDP.Duality.lmi F₀ F (xs 0) * Zs 0).trace := by sorry

end VBSDP.Potential
Source
Vandenberghe and Boyd, Semidefinite Programming, SIAM Rev. 38 (1996), p. 77 (PDF p. 29), (56) and Theorem 5.1; corrected strict sign as noted, 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