×

A generalization of Sylvester’s law of inertia. (English) Zbl 0993.15011

The authors introduce the class of unitoid matrices as those that are diagonalizable by congruence; the nondegenerate canonical angles of a unitoid matrix \(A\) are the directions of the nonzero entries of a diagonal matrix congruent to \(A\). Sylvester’s law states that two Hermitian matrices of the same size are congruent if and only if they have the same numbers of positive (respectively, negative) eigenvalues. The following is the primary result:
Two unitoid matrices are congruent if and only if they have the same nondegenerate canonical angles.
The paper ends with two remarks. The authors close by noting that the canonical angles of \(A\) are, generally, unrelated to the eigenvalues of the unitary part in the polar decomposition of \(A\). They also note that their theorem may be proven using the canonical pair form for two Hermitian matrices.

MSC:

15A21 Canonical forms, reductions, classification
15A18 Eigenvalues, singular values, and eigenvectors
Full Text: DOI

References:

[1] DePrima, C. R.; Johnson, C. R., The range of \(A^{−1}A^∗\) in \(GL(n,C)\), Linear Algebra Appl., 9, 209-222 (1974) · Zbl 0292.15007
[2] Eves, H., Elementary Matrix Theory (1966), Allyn & Bacon: Allyn & Bacon Boston, MA · Zbl 0136.24706
[3] Horn, R.; Johnson, C. R., Matrix Analysis (1985), Cambridge University Press: Cambridge University Press New York · Zbl 0576.15001
[4] Thompson, R. C., The characteristic polynomial of a principal subpencil of a Hermitian matrix pencil, Linear Algebra Appl., 14, 135-177 (1976) · Zbl 0386.15011
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.