Bilinear form/Symmetric/Definiteness/Introduction/Section
Let be a real vector space, endowed with a symmetric bilinear form . This bilinear form is called
- positive definite, if holds for all , .
- negative definite, if holds for all , .
- positive semidefinite, if holds for all .
- negative semidefinite, if holds for all .
- indefinite, if is neither positive semidefinite nor negative semidefinite.
Positive definite symmetric bilinear forms are the the real inner products. We have an indefinite if there exist vectors and such that and . The zero form is positive semidefinite and negative semidefinite at the same time, but neither positive definite nor negative definite.
It is possible to restrict a bilinear form on to a linear subspace , yielding a bilinear form on . If the original form is positive definite, then so is the restriction. However, an arbitrary form might become positive definite when restricted to certain linear subspaces, and negative definite when restricted to other linear subspaces. This leads us to the following definition.
Let be a finite-dimensional real vector space, endowed with a symmetric bilinear form . We say that this bilinear form has the type
where
and
For an inner product on a -dimensional real vector space, the type is . Because of exercise, we always have
The matrix
is the Gram matrix of a symmetric bilinear form on , say with respect to the standard basis. The restriction of the form to is positive definite, the restriction to is negative definite, the restriction to is the zero form. Therefore, we get immediately . However, it is not immediately clear whether there exist some two-dimensional linear subspace such that the restriction to this space is positive definite. An investigation of "all“ linear subspaces is not really feasible. However, there are several possibilities to determine the type of a symmetric bilinear, without checking all linear subspaces of . The following statement is called Sylvester's law of inertia.

Let be a finite-dimensional real vector space, endowed with a symmetric bilinear form of type . Then the Gram matrix of with respect to any orthogonal basis is a diagonal matrix
with positive and negative entries.With respect to an orthogonal basis of (which exists due to fact), the Gram matrix is in diagonal form. Let be the number of positive diagonal entries, and let be the number of negative diagonal entries. We may order the basis in such a way that the first diagonal entries are positive, the following diagonal entries are negative, and the remaining entries are . On the linear subspace of dimension , the restricted bilinear form is positive definite; therefore, holds. Let ; on this linear subspace, the restricted bilinear form is negative semidefinite. We have , and these spaces are orthogonal to each other.
Assume now that there exists a linear subspace , such that the bilinear form restricted to is positive definite, and such that its dimension is larger than .
The dimension of is , therefore, because of fact. For a vector , , we get directly the contradiction and .
By scaling the orthogonal vectors, we can even achieve that only the values occur in the diagonal. The form given on by the diagonal matrix with times , times and times shows that every type fulfilling
can be realized. We talk about the standard form of type on .