How to use these solutions#
These are the worked solutions to the mixed practice in Symmetric Matrices, Inverses and Mixed Practice . Try each question first, then compare your working with the steps here. For row-operation questions, many different sequences of operations are correct — what matters is that each operation is applied to the whole augmented row and that you finish with the identity on the left.
Question 1: Showing a matrix is skew-symmetric#
The problem#
Show that A = [ 0 3 − 2 − 3 0 5 2 − 5 0 ] A = \begin{bmatrix} 0 & 3 & -2 \\ -3 & 0 & 5 \\ 2 & -5 & 0 \end{bmatrix} A = 0 − 3 2 3 0 − 5 − 2 5 0 is skew-symmetric.
Understanding the problem#
A square matrix is skew-symmetric when A T = − A A^T = -A A T = − A , that is, a j i = − a i j a_{ji} = -a_{ij} a j i = − a ij for every i , j i, j i , j . In particular, every diagonal entry must be 0 0 0 .
The idea#
Write down A T A^T A T (rows become columns) and − A -A − A (change every sign), and compare them.
Step-by-step solution#
Step 1. Transpose: the first row of A T A^T A T is the first column of A A A , and so on.
A T = [ 0 − 3 2 3 0 − 5 − 2 5 0 ] A^T = \begin{bmatrix} 0 & -3 & 2 \\ 3 & 0 & -5 \\ -2 & 5 & 0 \end{bmatrix} A T = 0 3 − 2 − 3 0 5 2 − 5 0
Step 2. Negative of A A A .
− A = [ 0 − 3 2 3 0 − 5 − 2 5 0 ] -A = \begin{bmatrix} 0 & -3 & 2 \\ 3 & 0 & -5 \\ -2 & 5 & 0 \end{bmatrix} − A = 0 3 − 2 − 3 0 5 2 − 5 0
Step 3. The two matrices agree entry by entry, so A T = − A A^T = -A A T = − A and A A A is skew-symmetric.
Checking the answer#
The diagonal is all zeros, and each mirror pair has opposite signs: ( 3 , − 3 ) (3, -3) ( 3 , − 3 ) , ( − 2 , 2 ) (-2, 2) ( − 2 , 2 ) , ( 5 , − 5 ) (5, -5) ( 5 , − 5 ) . ✓
Answer#
A T = − A A^T = -A A T = − A , so A A A is skew-symmetric.
Question 2: Symmetric plus skew-symmetric (2 × 2)#
The problem#
Write [ 3 5 1 − 1 ] \begin{bmatrix} 3 & 5 \\ 1 & -1 \end{bmatrix} [ 3 1 5 − 1 ] as the sum of a symmetric and a skew-symmetric matrix.
Understanding the problem#
Every square matrix A A A splits as A = P + Q A = P + Q A = P + Q with P P P symmetric (P T = P P^T = P P T = P ) and Q Q Q skew-symmetric (Q T = − Q Q^T = -Q Q T = − Q ).
The idea#
Use P = 1 2 ( A + A T ) \displaystyle P = \tfrac12(A + A^T) P = 2 1 ( A + A T ) and Q = 1 2 ( A − A T ) \displaystyle Q = \tfrac12(A - A^T) Q = 2 1 ( A − A T ) .
Step-by-step solution#
Step 1. Transpose.
A T = [ 3 1 5 − 1 ] A^T = \begin{bmatrix} 3 & 1 \\ 5 & -1 \end{bmatrix} A T = [ 3 5 1 − 1 ]
Step 2. Symmetric part.
P = 1 2 [ 6 6 6 − 2 ] = [ 3 3 3 − 1 ] \displaystyle P = \frac12\begin{bmatrix} 6 & 6 \\ 6 & -2 \end{bmatrix} = \begin{bmatrix} 3 & 3 \\ 3 & -1 \end{bmatrix} P = 2 1 [ 6 6 6 − 2 ] = [ 3 3 3 − 1 ]
Step 3. Skew-symmetric part.
Q = 1 2 [ 0 4 − 4 0 ] = [ 0 2 − 2 0 ] \displaystyle Q = \frac12\begin{bmatrix} 0 & 4 \\ -4 & 0 \end{bmatrix} = \begin{bmatrix} 0 & 2 \\ -2 & 0 \end{bmatrix} Q = 2 1 [ 0 − 4 4 0 ] = [ 0 − 2 2 0 ]
Checking the answer#
P + Q = [ 3 5 1 − 1 ] = A P + Q = \begin{bmatrix} 3 & 5 \\ 1 & -1 \end{bmatrix} = A P + Q = [ 3 1 5 − 1 ] = A ✓; P P P is symmetric and Q Q Q has zero diagonal with opposite off-diagonal entries. ✓
Answer#
[ 3 5 1 − 1 ] = [ 3 3 3 − 1 ] + [ 0 2 − 2 0 ] \begin{bmatrix} 3 & 5 \\ 1 & -1 \end{bmatrix} = \begin{bmatrix} 3 & 3 \\ 3 & -1 \end{bmatrix} + \begin{bmatrix} 0 & 2 \\ -2 & 0 \end{bmatrix} [ 3 1 5 − 1 ] = [ 3 3 3 − 1 ] + [ 0 − 2 2 0 ]
Question 3: Symmetric plus skew-symmetric (3 × 3)#
The problem#
Write [ 1 4 − 2 0 3 6 2 − 2 5 ] \begin{bmatrix} 1 & 4 & -2 \\ 0 & 3 & 6 \\ 2 & -2 & 5 \end{bmatrix} 1 0 2 4 3 − 2 − 2 6 5 as a sum of symmetric and skew-symmetric parts.
Understanding the problem#
Same task as Question 2, for a 3 × 3 3 \times 3 3 × 3 matrix.
The idea#
P = 1 2 ( A + A T ) \displaystyle P = \tfrac12(A + A^T) P = 2 1 ( A + A T ) and Q = 1 2 ( A − A T ) \displaystyle Q = \tfrac12(A - A^T) Q = 2 1 ( A − A T ) .
Step-by-step solution#
Step 1. Transpose.
A T = [ 1 0 2 4 3 − 2 − 2 6 5 ] A^T = \begin{bmatrix} 1 & 0 & 2 \\ 4 & 3 & -2 \\ -2 & 6 & 5 \end{bmatrix} A T = 1 4 − 2 0 3 6 2 − 2 5
Step 2. Add and halve.
A + A T = [ 2 4 0 4 6 4 0 4 10 ] , P = [ 1 2 0 2 3 2 0 2 5 ] A + A^T = \begin{bmatrix} 2 & 4 & 0 \\ 4 & 6 & 4 \\ 0 & 4 & 10 \end{bmatrix}, \qquad P = \begin{bmatrix} 1 & 2 & 0 \\ 2 & 3 & 2 \\ 0 & 2 & 5 \end{bmatrix} A + A T = 2 4 0 4 6 4 0 4 10 , P = 1 2 0 2 3 2 0 2 5
Step 3. Subtract and halve.
A − A T = [ 0 4 − 4 − 4 0 8 4 − 8 0 ] , Q = [ 0 2 − 2 − 2 0 4 2 − 4 0 ] A - A^T = \begin{bmatrix} 0 & 4 & -4 \\ -4 & 0 & 8 \\ 4 & -8 & 0 \end{bmatrix}, \qquad Q = \begin{bmatrix} 0 & 2 & -2 \\ -2 & 0 & 4 \\ 2 & -4 & 0 \end{bmatrix} A − A T = 0 − 4 4 4 0 − 8 − 4 8 0 , Q = 0 − 2 2 2 0 − 4 − 2 4 0
Checking the answer#
P + Q = [ 1 4 − 2 0 3 6 2 − 2 5 ] = A P + Q = \begin{bmatrix} 1 & 4 & -2 \\ 0 & 3 & 6 \\ 2 & -2 & 5 \end{bmatrix} = A P + Q = 1 0 2 4 3 − 2 − 2 6 5 = A . ✓
Answer#
P = [ 1 2 0 2 3 2 0 2 5 ] P = \begin{bmatrix} 1 & 2 & 0 \\ 2 & 3 & 2 \\ 0 & 2 & 5 \end{bmatrix} P = 1 2 0 2 3 2 0 2 5 (symmetric), Q = [ 0 2 − 2 − 2 0 4 2 − 4 0 ] Q = \begin{bmatrix} 0 & 2 & -2 \\ -2 & 0 & 4 \\ 2 & -4 & 0 \end{bmatrix} Q = 0 − 2 2 2 0 − 4 − 2 4 0 (skew-symmetric), A = P + Q A = P + Q A = P + Q .
Question 4: A Aᵀ is always symmetric#
The problem#
Show that for any square A A A , A A T AA^T A A T is symmetric.
Understanding the problem#
This is a proof. A matrix M M M is symmetric when M T = M M^T = M M T = M . So you must show ( A A T ) T = A A T (AA^T)^T = AA^T ( A A T ) T = A A T .
The idea#
Use two rules of transposes: ( X Y ) T = Y T X T (XY)^T = Y^TX^T ( X Y ) T = Y T X T (order reverses) and ( X T ) T = X (X^T)^T = X ( X T ) T = X .
Step-by-step solution#
Step 1. Apply the product rule with X = A X = A X = A , Y = A T Y = A^T Y = A T .
( A A T ) T = ( A T ) T A T (AA^T)^T = (A^T)^T A^T ( A A T ) T = ( A T ) T A T
Step 2. Transposing twice gives back the original: ( A T ) T = A (A^T)^T = A ( A T ) T = A .
( A A T ) T = A A T (AA^T)^T = AA^T ( A A T ) T = A A T
Step 3. So A A T AA^T A A T equals its own transpose, which means it is symmetric.
Checking the answer#
Take A = [ 1 2 0 3 ] A = \begin{bmatrix} 1 & 2 \\ 0 & 3 \end{bmatrix} A = [ 1 0 2 3 ] : A A T = [ 5 6 6 9 ] AA^T = \begin{bmatrix} 5 & 6 \\ 6 & 9 \end{bmatrix} A A T = [ 5 6 6 9 ] , which is symmetric. ✓
Answer#
( A A T ) T = ( A T ) T A T = A A T (AA^T)^T = (A^T)^TA^T = AA^T ( A A T ) T = ( A T ) T A T = A A T , so A A T AA^T A A T is symmetric.
Question 5: Inverses by elementary row operations#
The problem#
Find the inverse by row operations: (a) [ 3 1 5 2 ] \begin{bmatrix} 3 & 1 \\ 5 & 2 \end{bmatrix} [ 3 5 1 2 ] ; (b) [ 4 − 3 1 − 1 ] \begin{bmatrix} 4 & -3 \\ 1 & -1 \end{bmatrix} [ 4 1 − 3 − 1 ] .
Understanding the problem#
Write the augmented matrix [ A ∣ I ] [A \mid I] [ A ∣ I ] . Apply row operations to the whole row until the left half becomes I I I ; the right half is then A − 1 A^{-1} A − 1 .
The idea#
Aim to create a 1 1 1 in the top-left, clear the entry below it, then clear the entry above the second 1 1 1 . Choose operations that avoid fractions where possible.
Step-by-step solution#
Part (a)
Step 1. Start.
[ 3 1 1 0 5 2 0 1 ] \left[\begin{array}{cc|cc} 3 & 1 & 1 & 0 \\ 5 & 2 & 0 & 1 \end{array}\right] [ 3 5 1 2 1 0 0 1 ]
Step 2. R 2 → R 2 − R 1 R_2 \to R_2 - R_1 R 2 → R 2 − R 1 .
[ 3 1 1 0 2 1 − 1 1 ] \left[\begin{array}{cc|cc} 3 & 1 & 1 & 0 \\ 2 & 1 & -1 & 1 \end{array}\right] [ 3 2 1 1 1 − 1 0 1 ]
Step 3. R 1 → R 1 − R 2 R_1 \to R_1 - R_2 R 1 → R 1 − R 2 gives a leading 1 1 1 .
[ 1 0 2 − 1 2 1 − 1 1 ] \left[\begin{array}{cc|cc} 1 & 0 & 2 & -1 \\ 2 & 1 & -1 & 1 \end{array}\right] [ 1 2 0 1 2 − 1 − 1 1 ]
Step 4. R 2 → R 2 − 2 R 1 R_2 \to R_2 - 2R_1 R 2 → R 2 − 2 R 1 .
[ 1 0 2 − 1 0 1 − 5 3 ] \left[\begin{array}{cc|cc} 1 & 0 & 2 & -1 \\ 0 & 1 & -5 & 3 \end{array}\right] [ 1 0 0 1 2 − 5 − 1 3 ]
The left half is I I I , so A − 1 = [ 2 − 1 − 5 3 ] A^{-1} = \begin{bmatrix} 2 & -1 \\ -5 & 3 \end{bmatrix} A − 1 = [ 2 − 5 − 1 3 ] .
Part (b)
Step 1. Start, then R 1 ↔ R 2 R_1 \leftrightarrow R_2 R 1 ↔ R 2 to bring a 1 1 1 to the top.
[ 4 − 3 1 0 1 − 1 0 1 ] → [ 1 − 1 0 1 4 − 3 1 0 ] \left[\begin{array}{cc|cc} 4 & -3 & 1 & 0 \\ 1 & -1 & 0 & 1 \end{array}\right] \to \left[\begin{array}{cc|cc} 1 & -1 & 0 & 1 \\ 4 & -3 & 1 & 0 \end{array}\right] [ 4 1 − 3 − 1 1 0 0 1 ] → [ 1 4 − 1 − 3 0 1 1 0 ]
Step 2. R 2 → R 2 − 4 R 1 R_2 \to R_2 - 4R_1 R 2 → R 2 − 4 R 1 .
[ 1 − 1 0 1 0 1 1 − 4 ] \left[\begin{array}{cc|cc} 1 & -1 & 0 & 1 \\ 0 & 1 & 1 & -4 \end{array}\right] [ 1 0 − 1 1 0 1 1 − 4 ]
Step 3. R 1 → R 1 + R 2 R_1 \to R_1 + R_2 R 1 → R 1 + R 2 .
[ 1 0 1 − 3 0 1 1 − 4 ] \left[\begin{array}{cc|cc} 1 & 0 & 1 & -3 \\ 0 & 1 & 1 & -4 \end{array}\right] [ 1 0 0 1 1 1 − 3 − 4 ]
So A − 1 = [ 1 − 3 1 − 4 ] A^{-1} = \begin{bmatrix} 1 & -3 \\ 1 & -4 \end{bmatrix} A − 1 = [ 1 1 − 3 − 4 ] .
Checking the answer#
(a) [ 3 1 5 2 ] [ 2 − 1 − 5 3 ] = [ 6 − 5 − 3 + 3 10 − 10 − 5 + 6 ] = I \begin{bmatrix} 3 & 1 \\ 5 & 2 \end{bmatrix}\begin{bmatrix} 2 & -1 \\ -5 & 3 \end{bmatrix} = \begin{bmatrix} 6 - 5 & -3 + 3 \\ 10 - 10 & -5 + 6 \end{bmatrix} = I [ 3 5 1 2 ] [ 2 − 5 − 1 3 ] = [ 6 − 5 10 − 10 − 3 + 3 − 5 + 6 ] = I . ✓
(b) [ 4 − 3 1 − 1 ] [ 1 − 3 1 − 4 ] = [ 4 − 3 − 12 + 12 1 − 1 − 3 + 4 ] = I \begin{bmatrix} 4 & -3 \\ 1 & -1 \end{bmatrix}\begin{bmatrix} 1 & -3 \\ 1 & -4 \end{bmatrix} = \begin{bmatrix} 4 - 3 & -12 + 12 \\ 1 - 1 & -3 + 4 \end{bmatrix} = I [ 4 1 − 3 − 1 ] [ 1 1 − 3 − 4 ] = [ 4 − 3 1 − 1 − 12 + 12 − 3 + 4 ] = I . ✓
Answer#
(a) [ 2 − 1 − 5 3 ] \begin{bmatrix} 2 & -1 \\ -5 & 3 \end{bmatrix} [ 2 − 5 − 1 3 ] ; (b) [ 1 − 3 1 − 4 ] \begin{bmatrix} 1 & -3 \\ 1 & -4 \end{bmatrix} [ 1 1 − 3 − 4 ] .
Common mistake to avoid#
Applying an operation to the left half only. Every operation must be applied to the right half too.
Question 6: A matrix with no inverse#
The problem#
Show that [ 6 − 3 − 2 1 ] \begin{bmatrix} 6 & -3 \\ -2 & 1 \end{bmatrix} [ 6 − 2 − 3 1 ] has no inverse.
Understanding the problem#
With row operations, a matrix has no inverse when, at some stage, a row of zeros appears on the left-hand side: then the left side can never become I I I .
The idea#
Notice row 1 is − 3 -3 − 3 times row 2. So adding 3 R 2 3R_2 3 R 2 to R 1 R_1 R 1 should wipe out row 1.
Step-by-step solution#
Step 1. Write [ A ∣ I ] [A \mid I] [ A ∣ I ] .
[ 6 − 3 1 0 − 2 1 0 1 ] \left[\begin{array}{cc|cc} 6 & -3 & 1 & 0 \\ -2 & 1 & 0 & 1 \end{array}\right] [ 6 − 2 − 3 1 1 0 0 1 ]
Step 2. R 1 → R 1 + 3 R 2 R_1 \to R_1 + 3R_2 R 1 → R 1 + 3 R 2 .
[ 0 0 1 3 − 2 1 0 1 ] \left[\begin{array}{cc|cc} 0 & 0 & 1 & 3 \\ -2 & 1 & 0 & 1 \end{array}\right] [ 0 − 2 0 1 1 0 3 1 ]
Step 3. The first row on the left is all zeros. No further row operations can turn it into a row of I I I , so A − 1 A^{-1} A − 1 does not exist.
Checking the answer#
Row 1 of A A A is − 3 -3 − 3 times row 2, so for any matrix C C C , row 1 of A C AC A C is − 3 -3 − 3 times row 2 of A C AC A C . If A C AC A C were I I I , you would need ( 1 , 0 ) = − 3 ( 0 , 1 ) (1, 0) = -3(0, 1) ( 1 , 0 ) = − 3 ( 0 , 1 ) , which is false. So no inverse can exist. ✓
Answer#
R 1 → R 1 + 3 R 2 R_1 \to R_1 + 3R_2 R 1 → R 1 + 3 R 2 gives a zero row, so the matrix has no inverse.
Question 7: Inverse of an upper triangular matrix#
The problem#
Find A − 1 A^{-1} A − 1 for A = [ 1 2 0 0 1 3 0 0 1 ] A = \begin{bmatrix} 1 & 2 & 0 \\ 0 & 1 & 3 \\ 0 & 0 & 1 \end{bmatrix} A = 1 0 0 2 1 0 0 3 1 .
Understanding the problem#
A A A already has 1 1 1 s on the diagonal and zeros below it, so you only need to clear the entries above the diagonal.
The idea#
Work from the bottom up: use R 3 R_3 R 3 to clear column 3, then R 2 R_2 R 2 to clear column 2.
Step-by-step solution#
Step 1. Write [ A ∣ I ] [A \mid I] [ A ∣ I ] .
[ 1 2 0 1 0 0 0 1 3 0 1 0 0 0 1 0 0 1 ] \left[\begin{array}{ccc|ccc} 1 & 2 & 0 & 1 & 0 & 0 \\ 0 & 1 & 3 & 0 & 1 & 0 \\ 0 & 0 & 1 & 0 & 0 & 1 \end{array}\right] 1 0 0 2 1 0 0 3 1 1 0 0 0 1 0 0 0 1
Step 2. R 2 → R 2 − 3 R 3 R_2 \to R_2 - 3R_3 R 2 → R 2 − 3 R 3 clears the 3 3 3 .
[ 1 2 0 1 0 0 0 1 0 0 1 − 3 0 0 1 0 0 1 ] \left[\begin{array}{ccc|ccc} 1 & 2 & 0 & 1 & 0 & 0 \\ 0 & 1 & 0 & 0 & 1 & -3 \\ 0 & 0 & 1 & 0 & 0 & 1 \end{array}\right] 1 0 0 2 1 0 0 0 1 1 0 0 0 1 0 0 − 3 1
Step 3. R 1 → R 1 − 2 R 2 R_1 \to R_1 - 2R_2 R 1 → R 1 − 2 R 2 clears the 2 2 2 .
[ 1 0 0 1 − 2 6 0 1 0 0 1 − 3 0 0 1 0 0 1 ] \left[\begin{array}{ccc|ccc} 1 & 0 & 0 & 1 & -2 & 6 \\ 0 & 1 & 0 & 0 & 1 & -3 \\ 0 & 0 & 1 & 0 & 0 & 1 \end{array}\right] 1 0 0 0 1 0 0 0 1 1 0 0 − 2 1 0 6 − 3 1
Checking the answer#
[ 1 2 0 0 1 3 0 0 1 ] [ 1 − 2 6 0 1 − 3 0 0 1 ] = [ 1 − 2 + 2 6 − 6 0 1 − 3 + 3 0 0 1 ] = I \begin{bmatrix} 1 & 2 & 0 \\ 0 & 1 & 3 \\ 0 & 0 & 1 \end{bmatrix}\begin{bmatrix} 1 & -2 & 6 \\ 0 & 1 & -3 \\ 0 & 0 & 1 \end{bmatrix} = \begin{bmatrix} 1 & -2 + 2 & 6 - 6 \\ 0 & 1 & -3 + 3 \\ 0 & 0 & 1 \end{bmatrix} = I 1 0 0 2 1 0 0 3 1 1 0 0 − 2 1 0 6 − 3 1 = 1 0 0 − 2 + 2 1 0 6 − 6 − 3 + 3 1 = I
Answer#
A − 1 = [ 1 − 2 6 0 1 − 3 0 0 1 ] A^{-1} = \begin{bmatrix} 1 & -2 & 6 \\ 0 & 1 & -3 \\ 0 & 0 & 1 \end{bmatrix} A − 1 = 1 0 0 − 2 1 0 6 − 3 1
Question 8: The rotation matrix is orthogonal#
The problem#
If A = [ cos α − sin α sin α cos α ] A = \begin{bmatrix} \cos\alpha & -\sin\alpha \\ \sin\alpha & \cos\alpha \end{bmatrix} A = [ cos α sin α − sin α cos α ] , show A T A = I A^TA = I A T A = I and hence A − 1 = A T A^{-1} = A^T A − 1 = A T .
Understanding the problem#
First compute the product A T A A^TA A T A and show it is the identity. Then explain why that makes A T A^T A T the inverse of A A A .
The idea#
Multiply and use cos 2 α + sin 2 α = 1 \cos^2\alpha + \sin^2\alpha = 1 cos 2 α + sin 2 α = 1 .
Step-by-step solution#
Step 1. Transpose.
A T = [ cos α sin α − sin α cos α ] A^T = \begin{bmatrix} \cos\alpha & \sin\alpha \\ -\sin\alpha & \cos\alpha \end{bmatrix} A T = [ cos α − sin α sin α cos α ]
Step 2. Multiply A T A A^TA A T A .
A T A = [ cos 2 α + sin 2 α − cos α sin α + sin α cos α − sin α cos α + cos α sin α sin 2 α + cos 2 α ] A^TA = \begin{bmatrix} \cos^2\alpha + \sin^2\alpha & -\cos\alpha\sin\alpha + \sin\alpha\cos\alpha \\ -\sin\alpha\cos\alpha + \cos\alpha\sin\alpha & \sin^2\alpha + \cos^2\alpha \end{bmatrix} A T A = [ cos 2 α + sin 2 α − sin α cos α + cos α sin α − cos α sin α + sin α cos α sin 2 α + cos 2 α ]
Step 3. Simplify: each diagonal entry is 1 1 1 , each off-diagonal entry is 0 0 0 .
A T A = [ 1 0 0 1 ] = I A^TA = \begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix} = I A T A = [ 1 0 0 1 ] = I
Step 4. In the same way, A A T = [ cos 2 α + sin 2 α cos α sin α − sin α cos α sin α cos α − cos α sin α sin 2 α + cos 2 α ] = I AA^T = \begin{bmatrix} \cos^2\alpha + \sin^2\alpha & \cos\alpha\sin\alpha - \sin\alpha\cos\alpha \\ \sin\alpha\cos\alpha - \cos\alpha\sin\alpha & \sin^2\alpha + \cos^2\alpha \end{bmatrix} = I A A T = [ cos 2 α + sin 2 α sin α cos α − cos α sin α cos α sin α − sin α cos α sin 2 α + cos 2 α ] = I . Since A T A^T A T multiplied by A A A on either side gives I I I , A T A^T A T is the inverse of A A A : A − 1 = A T A^{-1} = A^T A − 1 = A T .
Checking the answer#
Take α = 90 ∘ \alpha = 90^\circ α = 9 0 ∘ : A = [ 0 − 1 1 0 ] A = \begin{bmatrix} 0 & -1 \\ 1 & 0 \end{bmatrix} A = [ 0 1 − 1 0 ] , A T = [ 0 1 − 1 0 ] A^T = \begin{bmatrix} 0 & 1 \\ -1 & 0 \end{bmatrix} A T = [ 0 − 1 1 0 ] , and A T A = I A^TA = I A T A = I . ✓
Answer#
A T A = A A T = I A^TA = AA^T = I A T A = A A T = I , so A − 1 = A T A^{-1} = A^T A − 1 = A T .
Question 9: The reversal law for inverses#
The problem#
If A A A and B B B are invertible, verify ( A B ) − 1 = B − 1 A − 1 (AB)^{-1} = B^{-1}A^{-1} ( A B ) − 1 = B − 1 A − 1 by multiplying.
Understanding the problem#
A matrix C C C is the inverse of A B AB A B when ( A B ) C = I (AB)C = I ( A B ) C = I and C ( A B ) = I C(AB) = I C ( A B ) = I . So take C = B − 1 A − 1 C = B^{-1}A^{-1} C = B − 1 A − 1 and check both products. (A A A and B B B are square of the same order.)
The idea#
Use associativity to regroup the brackets so that B B − 1 BB^{-1} B B − 1 or A − 1 A A^{-1}A A − 1 A sit next to each other.
Step-by-step solution#
Step 1. Multiply on the right.
( A B ) ( B − 1 A − 1 ) = A ( B B − 1 ) A − 1 = A I A − 1 = A A − 1 = I (AB)(B^{-1}A^{-1}) = A(BB^{-1})A^{-1} = AIA^{-1} = AA^{-1} = I ( A B ) ( B − 1 A − 1 ) = A ( B B − 1 ) A − 1 = A I A − 1 = A A − 1 = I
Step 2. Multiply on the left.
( B − 1 A − 1 ) ( A B ) = B − 1 ( A − 1 A ) B = B − 1 I B = B − 1 B = I (B^{-1}A^{-1})(AB) = B^{-1}(A^{-1}A)B = B^{-1}IB = B^{-1}B = I ( B − 1 A − 1 ) ( A B ) = B − 1 ( A − 1 A ) B = B − 1 I B = B − 1 B = I
Step 3. Both products are I I I , so B − 1 A − 1 B^{-1}A^{-1} B − 1 A − 1 is the inverse of A B AB A B .
Checking the answer#
Note the order: in A − 1 B − 1 ( A B ) A^{-1}B^{-1}(AB) A − 1 B − 1 ( A B ) nothing cancels, because B − 1 B^{-1} B − 1 and A A A are not next to each other; that is why the order must reverse.
Answer#
( A B ) ( B − 1 A − 1 ) = ( B − 1 A − 1 ) ( A B ) = I (AB)(B^{-1}A^{-1}) = (B^{-1}A^{-1})(AB) = I ( A B ) ( B − 1 A − 1 ) = ( B − 1 A − 1 ) ( A B ) = I , so ( A B ) − 1 = B − 1 A − 1 (AB)^{-1} = B^{-1}A^{-1} ( A B ) − 1 = B − 1 A − 1 .
Question 10: Finding k in a matrix equation#
The problem#
Find k k k if A = [ 1 2 3 4 ] A = \begin{bmatrix} 1 & 2 \\ 3 & 4 \end{bmatrix} A = [ 1 3 2 4 ] satisfies A 2 − 5 A − k I = O A^2 - 5A - kI = O A 2 − 5 A − k I = O .
Understanding the problem#
O O O is the zero matrix. You need the number k k k that makes A 2 − 5 A A^2 - 5A A 2 − 5 A equal to k I kI k I .
The idea#
Compute A 2 − 5 A A^2 - 5A A 2 − 5 A ; if it comes out as a multiple of I I I , that multiple is k k k .
Step-by-step solution#
Step 1. Square A A A .
A 2 = [ 1 + 6 2 + 8 3 + 12 6 + 16 ] = [ 7 10 15 22 ] A^2 = \begin{bmatrix} 1 + 6 & 2 + 8 \\ 3 + 12 & 6 + 16 \end{bmatrix} = \begin{bmatrix} 7 & 10 \\ 15 & 22 \end{bmatrix} A 2 = [ 1 + 6 3 + 12 2 + 8 6 + 16 ] = [ 7 15 10 22 ]
Step 2. Subtract 5 A 5A 5 A .
A 2 − 5 A = [ 7 − 5 10 − 10 15 − 15 22 − 20 ] = [ 2 0 0 2 ] = 2 I A^2 - 5A = \begin{bmatrix} 7 - 5 & 10 - 10 \\ 15 - 15 & 22 - 20 \end{bmatrix} = \begin{bmatrix} 2 & 0 \\ 0 & 2 \end{bmatrix} = 2I A 2 − 5 A = [ 7 − 5 15 − 15 10 − 10 22 − 20 ] = [ 2 0 0 2 ] = 2 I
Step 3. So A 2 − 5 A − k I = ( 2 − k ) I = O A^2 - 5A - kI = (2 - k)I = O A 2 − 5 A − k I = ( 2 − k ) I = O requires k = 2 k = 2 k = 2 .
Checking the answer#
With k = 2 k = 2 k = 2 : A 2 − 5 A − 2 I = 2 I − 2 I = O A^2 - 5A - 2I = 2I - 2I = O A 2 − 5 A − 2 I = 2 I − 2 I = O . ✓
Answer#
k = 2 k = 2 k = 2