§6, proof of Theorem 7, p. 29 — A(γ) ⪰ 0 if and only if 𝔸(γ) ⪰ 0
ProvedQCQPTightness.MultHull.psd_iff_kronkronecker-productp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1positive-semidefiniteqcqpquadratic-eigenvalue-multiplicity
Let with , and suppose the QCQP's quadratic forms are with symmetric for every . Then for every ,
This lets the dual problem be rewritten with the constraint in place of the one, which is the program to which the proof of Theorem 7 applies conic duality.
Formalization Note The hypothesis is the paper's observation that the multiplicity is always at least (p. 11); for the matrix is empty and the equivalence fails. The representation is explicit and arbitrary, not necessarily the one of the largest .
Preamble
import Mathlib import Definitions.Def_QCQPTightness_MultHull_QCQP import Definitions.Def_QCQPTightness_MultHull_Mult import Definitions.Def_QCQPTightness_MultHull_Kron
Formal statement
namespace QCQPTightness.MultHull
open Matrix
theorem psd_iff_kron {N m k n : ℕ} (P : QCQP N m) (h : k * n = N) (hk : 0 < k)
(𝔸₀ : Matrix (Fin n) (Fin n) ℝ) (𝔸 : Fin m → Matrix (Fin n) (Fin n) ℝ)
(hrep : P.IsKronRep h 𝔸₀ 𝔸) (γ : Fin m → ℝ) :
(P.Aγ γ).PosSemidef ↔ (kronAγ 𝔸₀ 𝔸 γ).PosSemidef := by sorry
end QCQPTightness.MultHull
Source
arXiv:1911.09195v3, §6, proof of Theorem 7, p. 29, "The second line follows as A(γ) ⪰ 0 if and only if 𝔸(γ) ⪰ 0"
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.