Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(55) — expanded determinant formula for the potential

Proved
VBSDP.Potential.phi_formula_55

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 matrices F0,…,FmF_0,\ldots,F_mF0​,…,Fm​, linearly independent F1,…,FmF_1,\ldots,F_mF1​,…,Fm​, matrix size n≥1n\ge1n≥1, and ν≥1\nu\ge1ν≥1. The potential also has the form

φ(x,Z)=(n+νn)log⁡Tr⁡(F(x)Z)−log⁡det⁡F(x)−log⁡det⁡Z−nlog⁡n.\varphi(x,Z)=(n+\nu\sqrt n)\log\operatorname{Tr}(F(x)Z)-\log\det F(x)-\log\det Z-n\log n.φ(x,Z)=(n+νn​)logTr(F(x)Z)−logdetF(x)−logdetZ−nlogn.

This is the second equality of (55), separating the primal and dual determinant terms.

Formalization Note Strict feasibility ensures the determinants and trace are positive. Linear independence is retained from the standing assumption of §4. 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_phi
Formal statement
namespace VBSDP.Potential

/-- The second line of (55), splitting the determinant of F(x)Z. -/
theorem phi_formula_55 {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)
    (x : Fin m → ℝ) (Z : Matrix (Fin n) (Fin n) ℝ)
    (h : IsStrictlyFeasiblePair c F₀ F x Z) :
    phi ν F₀ F x Z =
      (n + ν * Real.sqrt n) * Real.log (VBSDP.Duality.lmi F₀ F x * Z).trace -
      Real.log (VBSDP.Duality.lmi F₀ F x).det - Real.log Z.det - n * Real.log n := by sorry

end VBSDP.Potential
Source
Vandenberghe and Boyd, Semidefinite Programming, SIAM Rev. 38 (1996), p. 76 (PDF p. 28), (55), 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