Operations on Linear Transformations in 2D
Senior 4 · Mathematics
Operations on Linear Transformations in 2D
Lesson 3 of 5
25 min
When a carpenter turns a door on its hinges or a machine turns a metal part, the object is rigid: every length and every angle in it stays the same. Of the transformations you know, rotations and reflections behave like this. A shear does not: in the diagram it turns the unit square into a parallelogram in which one side has grown to length and the angle at has shrunk to . An enlargement keeps angles but changes lengths.
Which matrices give rigid motions? The answer is a simple test on the matrix, and it shows that in the plane there are only two kinds: rotations and reflections.
Definition
Orthogonal transformation: a linear transformation of is orthogonal when it preserves the dot product:
Taking gives : an orthogonal transformation preserves lengths, hence distances, and (through ) angles. Conversely, a linear map that preserves every length preserves the dot product, because .
Example: every rotation and every reflection is orthogonal; the shear is not, since it sends , of length 1, to , of length .
Definition
Orthonormal basis: a basis of in which both vectors are unit vectors and they are orthogonal: and .
Orthogonal matrix: a square matrix with , that is, . Because the entries of are the dot products of the columns of , this says exactly that the columns of form an orthonormal basis. For this reason some books call such matrices, and the transformations they represent, orthonormal.
Example: is an orthonormal basis: twice, and . So is an orthogonal matrix.
Important
Theorem 1. A linear transformation with matrix is orthogonal if and only if .
Proof. Write the dot product as a matrix product, (a row times a column). Then . If , this is . Conversely, if the dot product is preserved, apply it to : the columns , have the same dot products as , so they are orthonormal and .
Theorem 2 (classification). A orthogonal matrix has , and it is either a rotation () or a reflection in a line through ().
Proof. . The first column is a unit vector, so it is for some . The second is a unit vector perpendicular to it, so it is or . The first choice gives , with determinant 1; the second gives , the reflection in the line at angle , with determinant .
Worked example 1: testing and classifying
Decide whether each matrix is orthogonal; if it is, say whether it is a rotation or a reflection. (a) (b) (c)
Solution.
(a) Columns and : lengths , dot product . Orthogonal, : the rotation with , , .
(b) Columns and : both of length 1, dot product . Orthogonal, : a reflection. Its axis is the line of fixed vectors: gives , the line .
(c) The column has length 2: not orthogonal. keeps angles but doubles every length.
Worked example 2: completing an orthogonal matrix
Find every orthogonal matrix whose first column is , and say what each one does.
Solution. , so the first column is a unit vector. The second column must be a unit vector perpendicular to it: or . So
Worked example 3: coordinates in an orthonormal basis
Find the coordinates of in the orthonormal basis , .
Solution. If , dotting with kills the second term: . Likewise . Check: . ✓ With an orthonormal basis, no system of equations is needed: each coordinate is one dot product.
Warning
"Orthogonal matrix" needs more than perpendicular columns. has perpendicular columns but is not orthogonal: the columns must also be unit vectors. And is necessary but not enough: the shear has determinant 1 and is not orthogonal.
Tip
To test a matrix, check three numbers: the two column lengths (both 1) and the dot product of the columns (0). Then the sign of the determinant tells you rotation () or reflection ().
Khan Academy: Orthogonal matrices preserve angles and lengths (about 11 min). Watch for the step that writes a dot product as a row times a column and uses the transpose.
Practice
Work each one, then open the answers.
Key points
Sources and credits
Quick check
The shear with matrix rows (1, 1) and (0, 1) is an orthogonal transformation, because its determinant is 1.