(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̄
ProvedSDPT3.ScaleInv.eq_31lorentz-transformationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1scale-invariancesecond-order-cone
Let on and let be a real matrix with . Then is invertible and
These are the identities (31) used throughout the proof of Proposition 1 to move a scaling matrix across .
Formalization Note The paper asserts (31) for every in the automorphism group ; it holds exactly for those with (the case ). For with the first identity reads . The statement therefore takes the first identity of (31) as its hypothesis, and does not need . Invertibility is part of the conclusion because Lean's F⁻¹ is for singular .
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.