A symmetric matrix A can always be transformed into an equivalent diagonal matrix with entries 0, 1 and −1 along the diagonal. Sylvester's law of inertia states that the number of diagonal entries of each kind is an invariant of A, i.e. it does not depend on the matrix S used. The number of 0s, denoted n0, is equal to the dimension of the kernel of A, and also the corank of A. The number of 1s, denoted n+, is called the positive index of inertia, the number of −1s, denoted n−, is called the negative index of inertia and their difference the signature of A:
Sunday, October 4, 2009
Sylvester's law of inertia
Let A be a real symmetric square matrix of order n. Any non-singular matrix S of the same size transforms A into another symmetric matrix B of order n defined by the rule
A symmetric matrix A can always be transformed into an equivalent diagonal matrix with entries 0, 1 and −1 along the diagonal. Sylvester's law of inertia states that the number of diagonal entries of each kind is an invariant of A, i.e. it does not depend on the matrix S used. The number of 0s, denoted n0, is equal to the dimension of the kernel of A, and also the corank of A. The number of 1s, denoted n+, is called the positive index of inertia, the number of −1s, denoted n−, is called the negative index of inertia and their difference the signature of A:
A symmetric matrix A can always be transformed into an equivalent diagonal matrix with entries 0, 1 and −1 along the diagonal. Sylvester's law of inertia states that the number of diagonal entries of each kind is an invariant of A, i.e. it does not depend on the matrix S used. The number of 0s, denoted n0, is equal to the dimension of the kernel of A, and also the corank of A. The number of 1s, denoted n+, is called the positive index of inertia, the number of −1s, denoted n−, is called the negative index of inertia and their difference the signature of A:




