Theorem 4.8 (Matrix Finsler's lemma), p. 12 — under , iff for some
ProvedQuadMatIneq.Finsler.theorem_4_8Let be partitioned as in (4.1), with of size and of size .
- If there exists such that , then .
- Define
Assume that , , and . Then
Here is the set of with and the set with . This is a matrix version of Finsler's lemma: it is the counterpart of the matrix S-lemma (Theorem 4.7) for the case where has no positive eigenvalue, in which and the Slater condition fails. Example 4.9 shows that the kernel assumption on cannot be dropped.
Formalization Note The two statements are the two conjuncts of one Lean theorem. Symmetry of and is a hypothesis of both. In the second statement (Nonempty ι) is added: the paper's proof picks a nonzero , and at the equivalence fails (, , : every hypothesis holds, both sets are the single point of , and no gives ). The multiplier is any real number in the first statement and nonnegative in the second, as printed. The kernel inclusion is stated with matrix–vector products.
import Mathlib import Definitions.Def_QuadMatIneq_Finsler_QMI
namespace QuadMatIneq.Finsler
open Matrix QuadMatIneq.Basic
theorem theorem_4_8 {ι κ : Type*} [Fintype ι] [Fintype κ] [DecidableEq ι] [DecidableEq κ]
(M N : Matrix (ι ⊕ κ) (ι ⊕ κ) ℝ) (hMh : M.IsHermitian) (hNh : N.IsHermitian) :
((∃ α : ℝ, (M - α • N).PosSemidef) → ZZero N ⊆ ZSet M) ∧
(Nonempty ι → InPi M → InPi N → schur N = 0 →
(∀ v : ι → ℝ, Theta M N *ᵥ v = 0 → schur M *ᵥ v = 0) →
(ZZero N ⊆ ZSet M ↔ ∃ α : ℝ, 0 ≤ α ∧ (M - α • N).PosSemidef)) := by sorry
end QuadMatIneq.Finsler
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.