5.2 Symmetric bilinear forms

  • Definition. A bilinear form B:V×VF is symmetric if, for all v,wV,

    B(v,w)=B(w,v)

5.2.1 Rank and radical
  • Definitions. Let B:V×VF be a symmetric bilinear form.

    The radical radB of B is given by

    radB:={vV|B(v,w)=0, for all wV}.

    We shall shortly see that radBV.

    We say that B is non-degenerate if radB={0}.

    If V is finite-dimensional, the rank of B is dimVdimradB (so that B is non-degenerate if and only if rankB=dimV).

  • Lemma 5.3. Let B:V×VF be a symmetric bilinear form with matrix A with respect to a basis v1,,vn. Then v=i=1nxiviradB if and only if Ax=0 if and only if xTA=0.

  • Corollary 5.4. Let B:V×VF be a symmetric bilinear form on a finite-dimensional vector space V with matrix A with respect to some basis of V. Then

    rankB=rankA.

    In particular, B is non-degenerate if and only if detA0.

5.2.2 Classification of symmetric bilinear forms
  • Convention. In this section, we work with a field F where 1+10 so that 12=(1+1)1 makes sense. This excludes, for example, the 2-element field Z2.

  • Lemma 5.5. Let B:V×VF be a symmetric bilinear form such that B(v,v)=0, for all vV. Then B0.

  • Theorem 5.6 (Diagonalisation Theorem). Let B be a symmetric bilinear form on a finite-dimensional vector space over F. Then there is a basis v1,,vn of V with respect to which the matrix of B is diagonal:

    B(vi,vj)=0,

    for all 1ijn. We call v1,,vn a diagonalising basis for B.

  • Corollary 5.7. Let AMn×n(F) be symmetric. Then there is an invertible matrix PGL(n,F) such that PTAP is diagonal.

5.2.3 Sylvester’s Theorem
  • Definitions. Let B be a symmetric bilinear form on a real vector space V.

    Say that B is positive definite if B(v,v)>0, for all vV{0}.

    Say that B is negative definite if B is positive definite.

    If V is finite-dimensional, the signature of B is the pair (p,q) where

    p=max{dimU|UV with B|U×U positive definite}q=max{dimW|WV with B|W×W negative definite}.

  • Theorem 5.8 (Sylvester’s Law of Inertia). Let B be a symmetric bilinear form of signature (p,q) on a finite-dimensional real vector space Then:

    • p+q=rankB;

    • • any diagonal matrix representing B has p positive entries and q negative entries (necessarily on the diagonal!).