(3.3), p. 6 — completed square: [I; Z]ᵀΠ[I; Z] = Π|Π₂₂ + (Z + Π₂₂†Π₂₁)ᵀ Π₂₂ (Z + Π₂₂†Π₂₁)
ProvedQuadMatIneq.Basic.eq_3_3p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pseudo-inversequadratic-matrix-inequalityschur-complement
Let be symmetric, partitioned with of size and of size , and suppose and . Then for every ,
where is the Moore–Penrose pseudo-inverse and .
This "completion of the square" writes the quadratic matrix function as a constant plus a negative semidefinite quadratic term centred at , and is used in every part of Theorem 3.2.
Preamble
import Mathlib import Definitions.Def_QuadMatIneq_Basic_QMI
Formal statement
namespace QuadMatIneq.Basic
open Matrix
theorem eq_3_3 {ι κ : Type*} [Fintype ι] [Fintype κ] [DecidableEq ι] [DecidableEq κ]
(P : Matrix (ι ⊕ κ) (ι ⊕ κ) ℝ) (hP : P.IsHermitian) (h22 : (-P.toBlocks₂₂).PosSemidef)
(hker : ∀ v : κ → ℝ, P.toBlocks₂₂ *ᵥ v = 0 → P.toBlocks₁₂ *ᵥ v = 0) (Z : Matrix κ ι ℝ) :
qmiForm P Z = schur P +
(Z + pinv P.toBlocks₂₂ * P.toBlocks₂₁)ᵀ * P.toBlocks₂₂ *
(Z + pinv P.toBlocks₂₂ * P.toBlocks₂₁) := by sorry
end QuadMatIneq.Basic
Source
van Waarde–Camlibel–Eising–Trentelman, arXiv:2203.12959v3, §3, display (3.3), p. 6
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.