Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(31), p. 12 — if FᵀJ̄F = J̄ then F is invertible and FᵀJ̄ = J̄F⁻¹, J̄F = F⁻ᵀJ̄, J̄Fᵀ = F⁻¹J̄

Proved
SDPT3.ScaleInv.eq_31

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

lorentz-transformationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1scale-invariancesecond-order-cone

Let Jˉ=diag⁡(1,−I)\bar J = \operatorname{diag}(1, -I)Jˉ=diag(1,−I) on Rq\mathbb R^{q}Rq and let FFF be a real q×qq \times qq×q matrix with F⊤JˉF=JˉF^\top \bar J F = \bar JF⊤JˉF=Jˉ. Then FFF is invertible and

F⊤Jˉ=JˉF−1,JˉF=F−⊤Jˉ,JˉF⊤=F−1Jˉ.F^\top \bar J = \bar J F^{-1},\qquad \bar J F = F^{-\top} \bar J,\qquad \bar J F^\top = F^{-1} \bar J.F⊤Jˉ=JˉF−1,JˉF=F−⊤Jˉ,JˉF⊤=F−1Jˉ.

These are the identities (31) used throughout the proof of Proposition 1 to move a scaling matrix across Jˉ\bar JJˉ.

Formalization Note The paper asserts (31) for every FiF_iFi​ in the automorphism group Gi\mathcal G_iGi​; it holds exactly for those with F⊤JˉF=JˉF^\top \bar J F = \bar JF⊤JˉF=Jˉ (the case λ=1\lambda = 1λ=1). For λF\lambda FλF with λ≠1\lambda \ne 1λ=1 the first identity reads F⊤JˉF=λ2JˉF^\top \bar J F = \lambda^2 \bar JF⊤JˉF=λ2Jˉ. The statement therefore takes the first identity of (31) as its hypothesis, and does not need F00>0F_{00} > 0F00​>0. Invertibility is part of the conclusion because Lean's F⁻¹ is 000 for singular FFF.

Preamble
import Mathlib
import Definitions.Def_SDPT3_ScaleInv_Setting
Formal statement
namespace SDPT3.ScaleInv

open Matrix

theorem eq_31 {k : ℕ} (F : Matrix (Fin (k + 1)) (Fin (k + 1)) ℝ)
    (hF : Fᵀ * Jbar k * F = Jbar k) :
    IsUnit F.det ∧ Fᵀ * Jbar k = Jbar k * F⁻¹ ∧ Jbar k * F = (F⁻¹)ᵀ * Jbar k ∧
      Jbar k * Fᵀ = F⁻¹ * Jbar k := by sorry

end SDPT3.ScaleInv
Source
Tütüncü, Toh & Todd, Solving semidefinite-quadratic-linear programs using SDPT3, Math. Program. 95 (2003) 189–217; authors' copy, p. 12, proof of Proposition 1, (31)
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