App. A, proof of Proposition 1, p. 34 — if [[1, xᵀ], [x, X]] ⪰ 0 then X ⪰ xxᵀ and X_jj ≥ x_j²
ProvedQCQPTightness.SOCP.schur_diag_gep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1positive-semidefiniteschur-complement
Let and . If the lifted matrix
then ; in particular for every .
This is the Schur-complement step in the proof that : the diagonal of an SDP-feasible is an SOCP-feasible .
Preamble
import Mathlib import Definitions.Def_QCQPTightness_SOCP_QCQP
Formal statement
namespace QCQPTightness.SOCP
open Matrix
/-- App. A, proof of Proposition 1, p. 34, Schur complement step: if
`Y = [[1, xᵀ], [x, X]] ⪰ 0` then `X ⪰ xxᵀ`, and in particular `X_{jj} ≥ x_j²` for every `j`. -/
theorem schur_diag_ge {N : ℕ} (x : Fin N → ℝ) (X : Matrix (Fin N) (Fin N) ℝ)
(hY : (QCQPTightness.ConvHull.liftY x X).PosSemidef) :
(X - Matrix.vecMulVec x x).PosSemidef ∧ ∀ j, x j ^ 2 ≤ X j j := by sorry
end QCQPTightness.SOCP
Source
arXiv:1911.09195v3, App. A, proof of Proposition 1, p. 34, Schur complement step
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.