Lemma 2.13, p. 1401 — Schur complement: (Q S; Sᵀ R) > 0 iff Q > 0 and R − SᵀQ⁻¹S > 0, iff R > 0 and Q − SR⁻¹Sᵀ > 0
ProvedPinningSync.Tree.lemma_2_13Let and be symmetric and . Then the following three conditions are equivalent:
- and ;
- and .
Here means positive definite. This is the strict Schur complement lemma for linear matrix inequalities; in the paper it drives the induction in the proof of Lemma 4.4.
Formalization Note The paper states the lemma for matrices depending on a parameter ; the condition is pointwise in , so it is stated for fixed matrices. The inverse is Mathlib's Matrix.inv, which returns for a singular matrix, but on the side of each equivalence where it occurs the inverted block is assumed positive definite, hence invertible. Mathlib currently has only the positive semidefinite version.
import Mathlib open Matrix
namespace PinningSync.Tree
theorem lemma_2_13 {p q : ℕ} (Q : Matrix (Fin p) (Fin p) ℝ) (S : Matrix (Fin p) (Fin q) ℝ)
(R : Matrix (Fin q) (Fin q) ℝ) (hQ : Qᵀ = Q) (hR : Rᵀ = R) :
((Matrix.fromBlocks Q S Sᵀ R).PosDef ↔ (Q.PosDef ∧ (R - Sᵀ * Q⁻¹ * S).PosDef)) ∧
((Matrix.fromBlocks Q S Sᵀ R).PosDef ↔ (R.PosDef ∧ (Q - S * R⁻¹ * Sᵀ).PosDef)) := by sorry
end PinningSync.Tree
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.
Confirmed by the moderator at approval.