Proof of Theorem 3.4, p. 9 — principal submatrices of an M-matrix are nonsingular M-matrices
ProvedPDASNewton.Perturb.isMMatrix_principallinear-algebram-matrixp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be an M-matrix: nonsingular, with for and entrywise. Then for every index set the principal submatrix is again an M-matrix:
The proof of Theorem 3.4 recalls this classical fact from Berman and Plemmons; it makes every exist and be nonnegative, which the Neumann-series representation of and the estimates of the proof rely on.
Formalization Note The index set is any Finset (Fin n), including the empty set (for which the empty matrix is trivially an M-matrix) and the full set.
Preamble
import Mathlib import Definitions.Def_PDASNewton_Perturb_Setting open Filter Topology Matrix
Formal statement
namespace PDASNewton.Perturb
theorem isMMatrix_principal {n : ℕ} (M : Matrix (Fin n) (Fin n) ℝ) (hM : IsMMatrix M) :
∀ S : Finset (Fin n), IsMMatrix (PDASNewton.MMatrix.principal M S) := by sorry
end PDASNewton.Perturb
Source
Hintermüller, Ito, Kunisch, The primal-dual active set strategy as a semismooth Newton method, HAL hal-01660511v1, p. 9, proof of Theorem 3.4, first sentence (citing [BP])
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.