The name symmetric for a linear map on a finite dimensional vector space has to do with the matrix representation of . We will use the following theorem to make the connection with matrices.
For each linear map on a finite-dimensional inner product space the following statements are equivalent:
- is symmetric.
- For each orthonormal system in we have for all .
- There is an orthonormal basis of with the property that for all .
- There is an orthonormal basis of with the property that for all with .
The implications , , and are trivial.
: Write and . Then
: The proof of this implication follows from the following two observations:
- If then is a direct consequence of the symmetry of the inner product.
- If then is a consequence of .
Each linear map is a scalar multiplication. This is always symmetric. If the scalar that is multiplied by equals , then the corresponding matrix is ; each -matrix is indeed always symmetric.
Suppose that and that is an orthonormal basis of . Then, because of condition 4, the linear map is symmetric if and only if .
This theorem says that if a linear map is symmetric on a orthonormal basis, then this map is symmetric on the whole space. This is not very surprising, since every vector can be written as a linear combination of vectors in the orthonormal basis.
Here is the link between symmetric maps and symmetric matrices.
Let be a finite-dimensional real inner product space and an orthonormal basis of . The linear map is symmetric if and only if the matrix of relative to is symmetric.
Let be an orthonormal basis for . The matrix has as columns the -coordinates of the vectors . The -entry of is the -th coordinate of . With a view to property 2 of orthonormal systems of vectors, this means: . Likewise, the -entry equals the -th coordinate of , so . If is symmetric, then these entries are equal. The matrix thus satisfies . That is to say, is symmetric.
Conversely, if is symmetric, then its -entry is equal to its -entry:
Using the above theorem Characterizations of symmetry we conclude that is symmetric.
As we saw in an example of the definition of a symmetric map, the orthogonal projection on a subspace is symmetric. We can also establish this fact by use of the theorem. Choose an orthonormal basis of such that is an orthonormal basis of (this is possible thanks to the Gram-Schmidt procedure). Each vector from the basis is an eigenvector: the first vectors with eigenvalue and the last with eigenvalue . Thus, the matrix of the map with respect to above orthonormal basis is a diagonal matrix, and is therefore symmetric. By the theorem we may conclude that is symmetric.
Write . Previously we saw that the map which assigns to a linear map the matrix , is an isomorphism of vector spaces. This vector space has dimension , the number of entries of an -matrix. On the basis of the first two properties of symmetric maps and the fact that the zero matrix is symmetric, the subset of of all symmetric linear maps is a linear subspace. This linear subspace is isomorphic (via the restriction of the isomorphism ) to the image , which is the subspace of consisting of all symmetric matrices (this follows from the above theorem). The subspace has dimension . This can be verified by use of the basis formed by the set for all with , where is the -matrix having as -entry and all other entries equal to .
Consider the matrix . The linear map determined by is symmetric if and only if is symmetric, that is, if and only if .
Let be the inner product space of all polynomials in of degree at most with orthonormal basis . Consider the linear map given by For what value of is symmetric?
In view of statement 4 of the theorem
Characterizations of symmetry, it suffices to verify that . We work out this equation as follows
We conclude that .