Linear Algebra/Topic: Orthonormal Matrices

Template:AnchorIn The Elements, Euclid considers two figures to be the same if they have the same size and shape. That is, the triangles below are not equal because they are not the same set of points. Template:AnchorBut they are congruent— essentially indistinguishable for Euclid's purposes— because we can imagine picking the plane up, sliding it over and rotating it a bit, although not warping or stretching it, and then putting it back down, to superimpose the first figure on the second. (Euclid never explicitly states this principle but he uses it often Template:Harv.)

In modern terminology, "picking the plane up ..." means considering a map from the plane to itself. Euclid has limited consideration to only certain transformations of the plane, ones that may possibly slide or turn the plane but not bend or stretch it. Template:AnchorAccordingly, we define a map $f:{ℝ}^2\to {ℝ}^2$ to be distance-preserving or a rigid motion or an isometry, if for all points $P_1,P_2\in {ℝ}^2$, the distance from $f(P_1)$ to $f(P_2)$ equals the distance from $P_1$ to $P_2$. Template:AnchorWe also define a plane figure to be a set of points in the plane and we say that two figures are congruent if there is a distance-preserving map from the plane to itself that carries one figure onto the other.

Many statements from Euclidean geometry follow easily from these definitions. Some are: (i) collinearity is invariant under any distance-preserving map (that is, if $P_1$, $P_2$, and $P_3$ are collinear then so are $f(P_1)$, $f(P_2)$, and $f(P_3)$), (ii) betweeness is invariant under any distance-preserving map (if $P_2$ is between $P_1$ and $P_3$ then so is $f(P_2)$ between $f(P_1)$ and $f(P_3)$), (iii) the property of being a triangle is invariant under any distance-preserving map (if a figure is a triangle then the image of that figure is also a triangle), (iv) and the property of being a circle is invariant under any distance-preserving map. Template:AnchorIn 1872, F. Klein suggested that Euclidean geometry can be characterized as the study of properties that are invariant under these maps. Template:Anchor(This forms part of Klein's Erlanger Program, which proposes the organizing principle that each kind of geometry— Euclidean, projective, etc.— can be described as the study of the properties that are invariant under some group of transformations. The word "group" here means more than just "collection", but that lies outside of our scope.)

We can use linear algebra to characterize the distance-preserving maps of the plane.

First, there are distance-preserving transformations of the plane that are not linear. Template:AnchorThe obvious example is this translation.

$\left(\begin{array}{c}x\\ y\end{array}\right)\mapsto \left(\begin{array}{c}x\\ y\end{array}\right)+\left(\begin{array}{c}1\\ 0\end{array}\right)=\left(\begin{array}{c}x+1\\ y\end{array}\right)$

However, this example turns out to be the only example, in the sense that if $f$ is distance-preserving and sends $\overrightarrow{0}$ to ${\overrightarrow{v}}_0$ then the map $\overrightarrow{v}\mapsto f(\overrightarrow{v})-{\overrightarrow{v}}_0$ is linear. That will follow immediately from this statement: a map $t$ that is distance-preserving and sends $\overrightarrow{0}$ to itself is linear. To prove this equivalent statement, let

$t({\overrightarrow{e}}_1)=\left(\begin{array}{c}a\\ b\end{array}\right)t({\overrightarrow{e}}_2)=\left(\begin{array}{c}c\\ d\end{array}\right)$

for some $a,b,c,d\in ℝ$. Then to show that $t$ is linear, we can show that it can be represented by a matrix, that is, that $t$ acts in this way for all $x,y\in ℝ$.

$\overrightarrow{v}=\left(\begin{array}{c}x\\ y\end{array}\right)\stackrel{t}{⟼}\left(\begin{array}{c}ax+cy\\ bx+dy\end{array}\right)(*)$

Recall that if we fix three non-collinear points then any point in the plane can be described by giving its distance from those three. So any point $\overrightarrow{v}$ in the domain is determined by its distance from the three fixed points $\overrightarrow{0}$, ${\overrightarrow{e}}_1$, and ${\overrightarrow{e}}_2$. Similarly, any point $t(\overrightarrow{v})$ in the codomain is determined by its distance from the three fixed points $t(\overrightarrow{0})$, $t({\overrightarrow{e}}_1)$, and $t({\overrightarrow{e}}_2)$ (these three are not collinear because, as mentioned above, collinearity is invariant and $\overrightarrow{0}$, ${\overrightarrow{e}}_1$, and ${\overrightarrow{e}}_2$ are not collinear). In fact, because $t$ is distance-preserving, we can say more: for the point $\overrightarrow{v}$ in the plane that is determined by being the distance $d_0$ from $\overrightarrow{0}$, the distance $d_1$ from ${\overrightarrow{e}}_1$, and the distance $d_2$ from ${\overrightarrow{e}}_2$, its image $t(\overrightarrow{v})$ must be the unique point in the codomain that is determined by being $d_0$ from $t(\overrightarrow{0})$, $d_1$ from $t({\overrightarrow{e}}_1)$, and $d_2$ from $t({\overrightarrow{e}}_2)$. Because of the uniqueness, checking that the action in ($*$) works in the $d_0$, $d_1$, and $d_2$ cases

$\text{dist}(\left(\begin{array}{c}x\\ y\end{array}\right),\overrightarrow{0})=\text{dist}(t(\left(\begin{array}{c}x\\ y\end{array}\right)),t(\overrightarrow{0}))=\text{dist}(\left(\begin{array}{c}ax+cy\\ bx+dy\end{array}\right),\overrightarrow{0})$

($t$ is assumed to send $\overrightarrow{0}$ to itself)

$\text{dist}(\left(\begin{array}{c}x\\ y\end{array}\right),{\overrightarrow{e}}_1)=\text{dist}(t(\left(\begin{array}{c}x\\ y\end{array}\right)),t({\overrightarrow{e}}_1))=\text{dist}(\left(\begin{array}{c}ax+cy\\ bx+dy\end{array}\right),\left(\begin{array}{c}a\\ b\end{array}\right))$

and

$\text{dist}(\left(\begin{array}{c}x\\ y\end{array}\right),{\overrightarrow{e}}_2)=\text{dist}(t(\left(\begin{array}{c}x\\ y\end{array}\right)),t({\overrightarrow{e}}_2))=\text{dist}(\left(\begin{array}{c}ax+cy\\ bx+dy\end{array}\right),\left(\begin{array}{c}c\\ d\end{array}\right))$

suffices to show that ($*$) describes $t$. Those checks are routine.

Thus, any distance-preserving $f:{ℝ}^2\to {ℝ}^2$ can be written $f(\overrightarrow{v})=t(\overrightarrow{v})+{\overrightarrow{v}}_0$ for some constant vector ${\overrightarrow{v}}_0$ and linear map $t$ that is distance-preserving.

Not every linear map is distance-preserving, for example, $\overrightarrow{v}\mapsto 2\overrightarrow{v}$ does not preserve distances. But there is a neat characterization: a linear transformation $t$ of the plane is distance-preserving if and only if both $|t({\overrightarrow{e}}_1)|=|t({\overrightarrow{e}}_2)|=1$ and $t({\overrightarrow{e}}_1)$ is orthogonal to $t({\overrightarrow{e}}_2)$. The "only if" half of that statement is easy— because $t$ is distance-preserving it must preserve the lengths of vectors, and because $t$ is distance-preserving the Pythagorean theorem shows that it must preserve orthogonality. For the "if" half, it suffices to check that the map preserves lengths of vectors, because then for all $\overrightarrow{p}$ and $\overrightarrow{q}$ the distance between the two is preserved $|t(\overrightarrow{p}-\overrightarrow{q})|=|t(\overrightarrow{p})-t(\overrightarrow{q})|=|\overrightarrow{p}-\overrightarrow{q}|$. For that check, let

$\overrightarrow{v}=\left(\begin{array}{c}x\\ y\end{array}\right)t({\overrightarrow{e}}_1)=\left(\begin{array}{c}a\\ b\end{array}\right)t({\overrightarrow{e}}_2)=\left(\begin{array}{c}c\\ d\end{array}\right)$

and, with the "if" assumptions that $a^2+b^2=c^2+d^2=1$ and $ac+bd=0$ we have this.

$\begin{array}{cc}|t(\overrightarrow{v}){|}^2& =(ax+cy{)}^2+(bx+dy{)}^2\\ & =a^2{x}^2+2acxy+c^2{y}^2+b^2{x}^2+2bdxy+d^2{y}^2\\ & =x^2(a^2+b^2)+y^2(c^2+d^2)+2xy(ac+bd)\\ & =x^2+y^2\\ & =|\overrightarrow{v}{|}^2\end{array}$

One thing that is neat about this characterization is that we can easily recognize matrices that represent such a map with respect to the standard bases. Those matrices have that when the columns are written as vectors then they are of length one and are mutually orthogonal. Template:AnchorSuch a matrix is called an orthonormal matrix or orthogonal matrix (the first term is commonly used to mean not just that the columns are orthogonal, but also that they have length one).

We can use this insight to delimit the geometric actions possible in distance-preserving maps. Because $|t(\overrightarrow{v})|=|\overrightarrow{v}|$, any $\overrightarrow{v}$ is mapped by $t$ to lie somewhere on the circle about the origin that has radius equal to the length of $\overrightarrow{v}$. In particular, ${\overrightarrow{e}}_1$ and ${\overrightarrow{e}}_2$ are mapped to the unit circle. What's more, once we fix the unit vector ${\overrightarrow{e}}_1$ as mapped to the vector with components $a$ and $b$ then there are only two places where ${\overrightarrow{e}}_2$ can be mapped if that image is to be perpendicular to the first vector: one where ${\overrightarrow{e}}_2$ maintains its position a quarter circle clockwise from

${\overrightarrow{e}}_1$

        ${\mathrm{R}\mathrm{e}\mathrm{p}}_{{ℰ}_2,{ℰ}_2}(t)=\left(\begin{array}{cc}a& -b\\ b& a\end{array}\right)$

and one where is is mapped a quarter circle counterclockwise.

        ${\mathrm{R}\mathrm{e}\mathrm{p}}_{{ℰ}_2,{ℰ}_2}(t)=\left(\begin{array}{cc}a& b\\ b& -a\end{array}\right)$

We can geometrically describe these two cases. Let $\theta$ be the angle between the $x$-axis and the image of ${\overrightarrow{e}}_1$, measured counterclockwise. Template:AnchorThe first matrix above represents, with respect to the standard bases, a rotation of the plane by $\theta$ radians.

        $\left(\begin{array}{c}x\\ y\end{array}\right)\stackrel{t}{⟼}\left(\begin{array}{c}x\cos \theta -y\sin \theta \\ x\sin \theta +y\cos \theta \end{array}\right)$

The second matrix above represents a reflection of the plane through the line bisecting the angle between ${\overrightarrow{e}}_1$ and $t({\overrightarrow{e}}_1)$.

        $\left(\begin{array}{c}x\\ y\end{array}\right)\stackrel{t}{⟼}\left(\begin{array}{c}x\cos \theta +y\sin \theta \\ x\sin \theta -y\cos \theta \end{array}\right)$

(This picture shows ${\overrightarrow{e}}_1$ reflected up into the first quadrant and ${\overrightarrow{e}}_2$ reflected down into the fourth quadrant.)

Note again: the angle between ${\overrightarrow{e}}_1$ and ${\overrightarrow{e}}_2$ runs counterclockwise, and in the first map above the angle from $t({\overrightarrow{e}}_1)$ to $t({\overrightarrow{e}}_2)$ is also counterclockwise, so the orientation of the angle is preserved. But in the second map the orientation is reversed. Template:AnchorA distance-preserving map is direct if it preserves orientations and opposite if it reverses orientation.

Template:AnchorSo, we have characterized the Euclidean study of congruence: it considers, for plane figures, the properties that are invariant under combinations of (i) a rotation followed by a translation, or (ii) a reflection followed by a translation (a reflection followed by a non-trivial translation is a glide reflection).

Template:AnchorAnother idea, besides congruence of figures, encountered in elementary geometry is that figures are similar if they are congruent after a change of scale. These two triangles are similar since the second is the same shape as the first, but $3/2$-ths the size.

From the above work, we have that figures are similar if there is an orthonormal matrix $T$ such that the points $\overrightarrow{q}$ on one are derived from the points $\overrightarrow{p}$ by $\overrightarrow{q}=(kT)\overrightarrow{v}+{\overrightarrow{p}}_0$ for some nonzero real number $k$ and constant vector ${\overrightarrow{p}}_0$.

Although many of these ideas were first explored by Euclid, mathematics is timeless and they are very much in use today. One application of the maps studied above is in computer graphics. We can, for example, animate this top view of a cube by putting together film frames of it rotating; that's a rigid motion.

Frame 1	Frame 2	Frame 3

We could also make the cube appear to be moving away from us by producing film frames of it shrinking, which gives us figures that are similar.

Frame 1:	Frame 2:	Frame 3:

Computer graphics incorporates techniques from linear algebra in many other ways (see Problem 4).

So the analysis above of distance-preserving maps is useful as well as interesting. A beautiful book that explores some of this area is Template:Harv. More on groups, of transformations and otherwise, can be found in any book on Modern Algebra, for instance Template:Harv. More on Klein and the Erlanger Program is in Template:Harv.

Exercises

/Solutions/

References

• Template:Citation.
• Template:Citation.
• Template:Citation.
• Template:Citation.