Definition. A bilinear form is symmetric if, for all ,
5.2.1 Rank and radical
Definitions. Let be a symmetric bilinear form.
The radical of is given by
We shall shortly see that .
We say that is non-degenerate if .
If is finite-dimensional, the rank of is (so that is non-degenerate if and only if ).
Lemma5.3. Let be a symmetric bilinear form with matrix with respect to a basis . Then if and only if if and only if .
Corollary5.4. Let be a symmetric bilinear form on a finite-dimensional vector space with matrix
with respect to some basis of . Then
In particular, is non-degenerate if and only if .
5.2.2 Classification of symmetric bilinear forms
Convention. In this section, we work with a field where so that makes sense. This excludes, for example, the -element field .
Lemma5.5. Let be a symmetric bilinear form such that , for all . Then
.
Theorem5.6 (Diagonalisation Theorem). Let be a symmetric bilinear form on a
finite-dimensional vector space over . Then there is a basis of with respect to which the matrix of is diagonal:
for all . We call a diagonalising basis for .
Corollary5.7. Let be symmetric. Then there is an invertible matrix such
that is diagonal.
5.2.3 Sylvester’s Theorem
Definitions. Let be a symmetric bilinear form on a real vector space .
Say that is positive definite if , for all .
Say that is negative definite if is positive definite.
If is finite-dimensional, the signature of is the pair where
Theorem5.8 (Sylvester’s Law of Inertia). Let be a symmetric bilinear form of
signature on a finite-dimensional real vector space Then:
• ;
• any diagonal matrix representing has positive entries and negative entries (necessarily on the diagonal!).