In the chapter Linear maps we studied properties of a linear map , where is a vector space. If is a real inner product space, then the linear maps that preserve the real inner product are of importance. We will see that these are precisely those linear maps from an inner product space to itself that preserve length.
Let be a real inner product space. A linear map is called orthogonal if for each .
In other words, a linear map is orthogonal if the length is invariant under . In this case, we also say that preserves length.
Due to the linearity of the map, is orthogonal if and only if the distance is invariant under , that is, if for all .
The identity map (also referred to as ) satisfies for each vector . In particular, we have . Therefore, the identity map is orthogonal.
Also is orthogonal.
For , the scalar multiplication is not orthogonal.
We examine the orthogonal maps in case . The only linear maps on a vector space of dimension are scalar multiplication, i.e., multiplications by a number . The length is invariant under the linear transformation on if and only if or .
- For we find , a direct orthogonal map.
- For we find the map ; this is the reflection about the origin.
The linear map given by
is orthogonal because
This suffices for the proof that because the norm takes non-negative values only.
Let be a vector of length in the inner product space . We consider the orthogonal reflection about the subspace . This map is given by the rule We can obtain this mapping rule by the following reasoning. Let be a vector of . Move from along the direction of until you arrive at , that is, the intersection of the straight line with . This occurs for and thus we are at the vector . To find the image of under the reflection, we need to subtract twice from .
An orthogonal reflection preserves the length of a vector. This geometrically known fact follows immediately from the following calculation of the square of the length of :
For an arbitrary nonzero vector , we set , where is the normalized vector . The rule for this map is
If and if is the
orthogonal projection onto the straight line through the origin spanned by a vector , then is not an orthogonal map. To see this, choose a vector perpendicular to which is not equal to the zero vector (this is possible because ). Then we have , so .
The translation on a vector space along a vector of is the map given by . The map is the identity if and only if . If is distinct from the zero vector, then translation along is not linear (after all, the image of under is , distinct from the null vector). But if is an inner product space, then preserves distance. After all, for each pair of vectors , of we have Thus there are non-linear maps that preserve distance.
Translation along also does not preserve length if . This can be seen in the simple example with . Then we have
Later we will look at maps of the more general form which preserve distance. Here, unlike the case of orthogonal maps, and need not be the same. Such a map is called an isometry. The map given by is an example.
For a linear map, orthogonality can also be determined on the basis of the inner product:
Let be an inner product space. A linear map is orthogonal if and only if for all vectors and of .
If the linear map preserves the inner product (that is, for every and in we have ), then also leaves invariant the length because of the following equalities
Proving invariance of the inner product for a linear map preserving length is a little more difficult. For this purpose we rely on the polarization formula, which, for arbitrary vectors and of , reads Invariance of the inner product can now be derived as follows.
Translation on an inner product space along a vector distinct from the zero vector is a map that does not preserve the inner product: the map given by satisfies
In the chapter Inner product spaces we introduced the concept of length on the basis of the inner product. To keep in line with this set-up, we could also have chosen to define an orthogonal map as a map that preserves the inner product. This characterization tells us that these two definitions are equivalent. In applications, it is more convenient to work with the definition according to which the length is preserved.
We view as the inner product space with standard inner product.
Does there exist a real number such that is an orthogonal map with ?
No
The map is linear, and so is orthogonal if and only if for all vectors . In particular, we must have . This leads to the following equation with unknown , which will be rewritten: Therefore, the answer is No.