On generalization of Williamson's theorem to real symmetric matrices
Abstract
Williamson's theorem states that if A is a 2n × 2n real symmetric positive definite matrix then there exists a 2n × 2n real symplectic matrix M such that MT A M=D D, where D is an n × n diagonal matrix with positive diagonal entries known as the symplectic eigenvalues of A. The theorem is known to be generalized to 2n × 2n real symmetric positive semidefinite matrices whose kernels are symplectic subspaces of R2n, in which case, some of the diagonal entries of D are allowed to be zero. In this paper, we further generalize Williamson's theorem to 2n × 2n real symmetric matrices by allowing the diagonal elements of D to be any real numbers, and thus extending the notion of symplectic eigenvalues to real symmetric matrices. Also, we provide an explicit description of symplectic eigenvalues, construct symplectic matrices achieving Williamson's theorem type decomposition, and establish perturbation bounds on symplectic eigenvalues for a class of 2n × 2n real symmetric matrices denoted by EigSpSm(2n). The set EigSpSm(2n) contains 2n × 2n real symmetric positive semidefinite whose kernels are symplectic subspaces of R2n. Our perturbation bounds on symplectic eigenvalues for EigSpSm(2n) generalize known perturbation bounds on symplectic eigenvalues of positive definite matrices given by Bhatia and Jain [J. Math. Phys. 56, 112201 (2015)].
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.