Lemma A.1, p. 26 — AᵀA ⩽ BᵀB iff A = SB with SᵀS ⩽ I; strict version for full-column-rank B; S := AB† works
ProvedQuadMatIneq.Reduced.lemma_A_1factorizationloewner-ordermatrix-inequalityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pseudo-inverse
Let and .
- if and only if there exists such that
- If, in addition, has full column rank, then if and only if there exists such that
- If , then satisfies (A.1); if has full column rank and , then satisfies (A.2).
This factorization lemma (a matrix form of Douglas' lemma) turns a quadratic matrix inequality into a linear equation with a contractive multiplier; it is the step behind the parameterization of QMI solution sets and the explicit gain formula of the mission.
Formalization Note The strict half of the "Moreover" is stated under the full-column-rank hypothesis of part (b), where it appears in the paper. and are the Loewner order: is positive semidefinite, respectively positive definite.
Preamble
import Mathlib import Definitions.Def_QuadMatIneq_Reduced_QMI open Matrix open scoped MatrixOrder
Formal statement
namespace QuadMatIneq.Reduced
theorem lemma_A_1 {ι ρ σ : Type*} [Fintype ι] [Fintype ρ] [Fintype σ]
[DecidableEq ι] [DecidableEq ρ] [DecidableEq σ]
(A : Matrix ρ ι ℝ) (B : Matrix σ ι ℝ) :
((Bᵀ * B - Aᵀ * A).PosSemidef ↔
∃ S : Matrix ρ σ ℝ, A = S * B ∧ (1 - Sᵀ * S).PosSemidef) ∧
(B.rank = Fintype.card ι →
((Bᵀ * B - Aᵀ * A).PosDef ↔
∃ S : Matrix ρ σ ℝ, A = S * B ∧ (1 - Sᵀ * S).PosDef)) ∧
((-(Aᵀ * A - Bᵀ * B)).PosSemidef →
A = (A * pinv B) * B ∧ (1 - (A * pinv B)ᵀ * (A * pinv B)).PosSemidef) ∧
(B.rank = Fintype.card ι → (-(Aᵀ * A - Bᵀ * B)).PosDef →
A = (A * pinv B) * B ∧ (1 - (A * pinv B)ᵀ * (A * pinv B)).PosDef) := by sorry
end QuadMatIneq.Reduced
Source
van Waarde–Camlibel–Eising–Trentelman, arXiv:2203.12959v3, Lemma A.1, p. 26
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.