Cholesky decomposition for symmetric matrices, Riemannian geometry, and random matrices
Apoorva Khare, Prateek Kumar Vishwakarma

TL;DR
This paper introduces a new geometric and algebraic framework for symmetric matrices using Cholesky decompositions, revealing their Riemannian and Lie group structures, and extends these concepts to probabilistic models.
Contribution
It defines cones of symmetric matrices with sign patterns, establishes smooth Cholesky factorizations as diffeomorphisms, and uncovers their Riemannian and Lie group structures, extending to complex and probabilistic settings.
Findings
Cholesky-type factorizations form smooth diffeomorphisms
LPM cones are isometric Riemannian manifolds and abelian Lie groups
The framework extends to complex matrices and probabilistic models
Abstract
For each and sign pattern , we introduce a cone of real symmetric matrices : those with leading principal minors of signs . These cones are pairwise disjoint and their union is an open dense cone in all symmetric matrices; they subsume positive and negative definite matrices, and symmetric (P-,) N-, PN-, almost P-, and almost N- matrices. We show that each matrix admits an uncountable family of Cholesky-type factorizations - yielding a unique lower triangular matrix with positive diagonals - with additional attractive properties: (i) each such factorization is algorithmic; and (ii) each such Cholesky map is a smooth diffeomorphism from onto an open Euclidean ball. We then show that (iii) the (diffeomorphic) balls are isometric…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
