Symmetric maps can be used to define quadratic forms. A quadratic form on a vector space is a second-degree homogeneous polynomial in the coordinates of a vector with respect to a fixed basis of . We begin with a more intrinsic definition for the case of a real vector space. To this end we use the term polarization for the right hand side of the polarization formula of an inner product.
A quadratic form on a real vector space is a function with the following two properties:
- homogeneity: For each scalar and each vector of we have .
- bilinearity of polarization: The real-valued map on pairs of vectors from defined by is bilinear.
The bilinear map is symmetric and uniquely determined by ; it is called the bilinear form of .
If is a symmetric bilinear form on , then is a quadratic form. Each quadratic form can be obtained in this way. Moreover, is the bilinear form of . We call the quadratic form defined by .
Suppose that is a quadratic form on a vector space . Then the associated bilinear form satisfies
This shows that is uniquely determined by .
Now let be a symmetric bilinear form on . Then is homogeneous because of the bilinearity of :
The polarization of is bilinear because of
This shows that is a quadratic form, and that the corresponding bilinear form is equal to .
According to the first statement, every quadratic form with bilinear form can be obtained as the quadratic form determined by .
For each quadratic form we have . This follows from the homogeneity of with .
Let be the inner product space . Each bilinear form on is of the form for a constant real number . In order to see this, put . Then, by the bilinearity of the form, we have . In particular, each bilinear form on a -dimensional vector space is symmetric.
Let be a quadratic form on . Then, there is a constant such that for every real number . The corresponding bilinear form is positive-definite if and only if . Hence, there are quadratic forms whose bilinear forms are not inner products.
The function on determined by is a quadratic form and the corresponding bilinear form is
Indeed, coincides with .
We will show homogeneity is needed for the definition of a quadratic form. We have seen that, for any quadratic form on , there is a constant such that . In particular, is not a quadratic form. Yet satisfies the second condition (bilinearity of polarization) for a quadratic form, since is a symmetric bilinear function in and . This shows that the omission of the condition of homogeneity substantially changes the definition of a quadratic form.
If is a quadratic form on a vector space with bilinear form , then is symmetric. But is not necessarily positive-definite. The form is positive-definite (and therefore also an inner product on ) if and only if and the equality holds only for .
If , for a vector we also write instead of . For example, for .
The definition for complex vector spaces is the same with the understanding that the map has range .
We will now show how the homogeneous polynomials of degree appear after a basis has been fixed. Recall from Coordinatization that, if is a basis of , the map , where , assigns the coordinate vector of a vector of with respect to .
Let be a vector space of finite dimension with basis and a quadratic form on .
- If is the bilinear form of , then there is a unique symmetric matrix such that, for all , we have We call the matrix of with respect to . In particular, is of the form where is the -entry of .
- If is another basis of , then the matrix of with respect to is given by
- There exists a basis for such that the transformation matrix is orthogonal and the matrix of with respect to is diagonal. In particular, is of the form where are the eigenvalues of . We call such a form a diagonal form of .
- The bilinear form of is an inner product on if and only if all of the eigenvalues of are positive.
The formula for shows that the quadratic form is a polynomial in the coordinates of .
The formula for reveals that, relative to a suitable basis, the polynomial may be written as a sum of squared terms, that is to say, of the form .
By replacing by in the formula , we get
Thus, itself can also be written as a linear combination of squares.
We prove each of the statements individually.
1. Let be a standard basis of and put . Further, let be the -matrix with -entry . Then, for in , we have
With this, the expressions in the theorem for have been derived. Next, polarization shows that, for vectors and of , Substituting and , we find .
2. The matrices and are both determined by values of . This leads to the following relation between and :
Because is surjective, both and run over all vectors of . Consequently, the matrices and are identical. This proves that .
3. By theorem Diagonalizibilty of symmetric matrices, there is an orthogonal matrix such that is a diagonal matrix. Let
Then, for all ,
So is a basis for which . From statement 2 it follows that is the matrix of with respect to . Because is a diagonal matrix, the -entries of satisfy if , so
Because is orthogonal, is conjugate to . In particular, the diagonal entries of are the eigenvalues of . This settles the proof of 3.
4. Let be a vector of distinct from the zero vector. The value of is equal to for . This value is positive for all nonzero vectors of if and only if all are positive.
By scaling the vectors of the basis , we can even achieve that each diagonal entry of is equal to one of , , . To this end, we scale the -th element of by if . Here, the transformation matrix is no longer orthogonal, so the distances in are no longer preserved.
Consider once more the quadratic form on determined by with corresponding bilinear form
The matrix of satisfies
From this we deduce:
The -entry of is equal to because is symmetric. So
We bring into diagonal form by calculating an orthonormal basis of eigenvectors of . The eigenvalues are solutions of the characteristic equation:
Thus we have found the diagonal form for . By replacing by we find an expression of as a linear combination of two squares: In particular, turns out to be positive definite.
The diagonal form is immediately clear once the eigenvalues of are known: these are the coefficients of the squares of the coordinates in . The majority of the calculation thus consists of finding an orthonormal basis on which the diagonal form is assumed.
The coordinate transformation made all mixed products (that is, products of two different variables) disappear! We can already write down the diagonal form of once the eigenvalues of are determined.
The theorem also holds for complex vector spaces.
If all of the eigenvalues of are nonnegative, then is positive semi-definite, which means that for all in .
The collection of vectors at which a quadratic form assumes a fixed chosen value, is called a quadric. It is the set of solutions of a quadratic polynomial equation with several unknowns. In general, the equation of a quadric also involves linear terms in addition to a quadratic form. Later we will go into this further.
Let be the quadratic form defined by
What is the matrix of ?
The matrix is determined by
Comparison with the function rule gives
The remaining elements of now follow from the fact that is symmetric. The conclusion is