Sylvester's law of inertia

Template:Short description Sylvester's law of inertia is a theorem in matrix algebra about certain properties of the coefficient matrix of a real quadratic form that remain invariant under a change of basis. Namely, if $S$ is a symmetric matrix, then for any invertible matrix $P$, the numbers of positive, negative, and zero eigenvalues of $S^{\prime }=PS{P}^{𝖳}$ are constant (i.e., the inertia of $S^{\prime }$ is constant). This result is particularly useful when $S^{\prime }$ is diagonal, as the inertia of a diagonal matrix can easily be obtained by looking at the signs of its diagonal elements.

This property is named after James Joseph Sylvester, who published its proof in 1852.

Statement

Let $S$ be a symmetric square matrix of order $n$ with real entries. Any non-singular square matrix $P$ of the same order is said to transform $S$ into another symmetric matrix Template:Tmath, also of order Template:Tmath, where $P^{𝖳}$ is the transpose of Template:Tmath. It is also said that matrices $S$ and $S^{\prime }$ are congruent. If $S$ is the coefficient matrix of some quadratic form on Template:Tmath, then $S^{\prime }$ is the coefficient matrix of the same form after the change of basis defined by Template:Tmath.

A symmetric matrix $S$ can always be transformed in this way into a diagonal matrix $D$ which has entries only Template:Tmath, Template:Tmath, Template:Tmath along the diagonal. Sylvester's law of inertia states that the number of diagonal entries of each kind is an invariant of Template:Tmath, i.e., does not depend on the matrix $P$ used.

The number of Template:Tmath's, denoted Template:Tmath, is called the positive index of inertia of Template:Tmath, and the number of Template:Tmath's, denoted Template:Tmath, is called the negative index of inertia of Template:Tmath. The number of Template:Tmath's, denoted Template:Tmath, is the dimension of the null space of Template:Tmath, known as the nullity of Template:Tmath. These numbers satisfy the obvious relation

Template:Tmath.

The difference $\mathrm{s}\mathrm{g}\mathrm{n}(S)=n_{+}-n_{-}$ is usually called the signature of Template:Tmath. However, some authors use that term for the triple $(n_0,n_{+},n_{-})$ consisting of the nullity, the positive, and the negative indices of inertia of Template:Tmath. For a non-degenerate form of a given dimension, these are equivalent data; but in general, the triple yields more data.

If the matrix $S$ has the property that every principal upper left $k\times k$ minor ${\mathrm{\Delta }}_k$ is non-zero, then the negative index of inertia is equal to the number of sign changes in the sequence

Template:Tmath.

Statement in terms of eigenvalues

The law can also be stated as follows: two symmetric square matrices $S$ and $S^{\prime }$ of the same size have the same numbers of positive, negative, and zero eigenvalues if and only if they are congruent (i.e., Template:Tmath for some non-singular square matrix Template:Tmath).

The positive and negative indices of a symmetric matrix $S$ are also the numbers of positive and negative eigenvalues of Template:Tmath. Any symmetric real matrix $S$ has an eigendecomposition of the form Template:Tmath, where $E$ is a diagonal matrix containing the eigenvalues of Template:Tmath, and $Q$ is an orthogonal square matrix containing the eigenvectors. The matrix $E$ can be written Template:Tmath, where $D$ is diagonal with entries Template:Tmath, and $W$ is diagonal with each Template:Tmath. The matrix $P=QW$ transforms $D$ to Template:Tmath, since Template:Tmath.

Statement in terms of quadratic forms

A real quadratic form $q$ in $n$ variables (or on an Template:Tmath-dimensional real vector space) can, by a suitable change of basis (by non-singular linear transformation from $x$ to Template:Tmath), be brought to the diagonal form

Template:Tmath, with each Template:Tmath.

Sylvester's law of inertia states that the number of coefficients of a given sign is an invariant of Template:Tmath, i.e., does not depend on a particular choice of diagonalizing basis.

Expressed geometrically, the law of inertia says that all maximal subspaces on which the restriction of the quadratic form is positive definite (respectively, negative definite) have the same dimension. These dimensions are the positive and negative indices of inertia of Template:Tmath.

Generalizations

Two complex matrices (i.e., with complex entries) $A$ and $B$ are said to be Template:Tmath-congruent if (and only if) there exists a non-singular complex matrix $P$ such that Template:Tmath, where $P^{\ast }$ denotes the conjugate transpose of Template:Tmath.

The definition of inertia is still valid for a Hermitian matrix, as its eigenvalues are always real numbers.

Sylvester's law of inertia can be generalized to complex matrices:
Two Hermitian matrices $A$ and $B$ are Template:Tmath-congruent if and only if they have the same inertia.

Ostrowski proved a quantitative generalization of Sylvester's law of inertia:
If two complex matrices $A$ and $B$ are Template:Tmath-congruent, with Template:Tmath where $P$ is a non-singular complex matrix, then their eigenvalues ${\lambda }_j$ are related by

Template:Tmath,

where Template:Tmath, and each ${\theta }_j$ is such that

Template:Tmath.

A theorem due to Ikramov generalizes the law of inertia to normal matrices:
Two normal matrices $A$ and $B$ are Template:Tmath-congruent if and only if they have the same number of eigenvalues on each open ray from the origin in the complex plane.Template:Efn

See also

• Metric signature
• Morse theory
• Cholesky decomposition
• Haynsworth inertia additivity formula

References

• Template:Cite book

External links

• Template:PlanetMath
• Sylvester's law of inertia and *-congruence