Lemma 4.9.1 — S ≻ 0 symmetric, C skew-symmetric: |Det(S + C)| ≥ Det(S)
ProvedModernConvex.Ellipsoids.det_sym_add_skewdeterminantslinear-algebra
Let be a square real matrix written as the sum of a symmetric matrix and a skew-symmetric matrix (). Assume that is positive definite. Then
The determinant of the symmetric part therefore bounds from below the volume of the inner ellipsoids of Proposition 4.9.6. This lets one maximize a concave function of the symmetric part instead of the determinant of a general square matrix.
Formalization Note "Symmetric and positive definite" is Mathlib's PosDef, which includes symmetry.
Preamble
import Mathlib open Matrix
Formal statement
namespace ModernConvex.Ellipsoids
/-- Ben-Tal–Nemirovski, Lemma 4.9.1, p. 273. Let `Y = S + C` be a square matrix represented as the
sum of a symmetric matrix `S` and a skew-symmetric (`Cᵀ = −C`) matrix `C`. Assume that `S` is
positive definite. Then `|Det(Y)| ≥ Det(S)`. -/
theorem det_sym_add_skew {n : ℕ} (S C : Matrix (Fin n) (Fin n) ℝ) (hS : S.PosDef)
(hC : Cᵀ = -C) :
S.det ≤ |(S + C).det| := by sorry
end ModernConvex.Ellipsoids
Source
Ben-Tal & Nemirovski, Lectures on Modern Convex Optimization, SIAM 2001, p. 273, Lemma 4.9.1
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Let and let and be real matrices. Assume:
- is positive definite: symmetric, with for every nonzero ;
- is skew-symmetric: .
Then
Degenerate cases.
- : both determinants are those of the empty matrix, equal to , so the claim reads .
- : the claim reads .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.