The one idea this problem is built on
Check the cubic equation entry by entry, then multiply it by A − 1 A^{-1} A − 1 . Each power of A A A drops by one and 4 I 4I 4 I becomes 4 A − 1 4A^{-1} 4 A − 1 :
A 2 − 6 A + 9 I − 4 A − 1 = O , A^2 - 6A + 9I - 4A^{-1} = O, A 2 − 6 A + 9 I − 4 A − 1 = O ,
so A − 1 = 1 4 ( A 2 − 6 A + 9 I ) A^{-1} = \frac{1}{4}(A^2 - 6A + 9I) A − 1 = 4 1 ( A 2 − 6 A + 9 I ) . Because A A A is symmetric, every matrix in the working is symmetric too, which halves the checking.
3 Symmetric matrices A A A equals its transpose: entry ( i , j ) (i,j) ( i , j ) equals entry ( j , i ) (j,i) ( j , i ) . Then A 2 A^2 A 2 and A 3 A^3 A 3 are symmetric too, because ( A 2 ) ′ = A ′ A ′ = A A (A^2)' = A'A' = AA ( A 2 ) ′ = A ′ A ′ = AA . Basics: transpose and identity
Compute A 2 = A ⋅ A A^2 = A\cdot A A 2 = A ⋅ A
A A A is 3 × 3 3\times3 3 × 3 , so A ⋅ A A\cdot A A ⋅ A is 3 × 3 3\times3 3 × 3 . Because A A A is symmetric, its columns are the same as its rows: ( 2 , − 1 , 1 ) (2,-1,1) ( 2 , − 1 , 1 ) , ( − 1 , 2 , − 1 ) (-1,2,-1) ( − 1 , 2 , − 1 ) , ( 1 , − 1 , 2 ) (1,-1,2) ( 1 , − 1 , 2 ) .
c 11 = 2 ⋅ 2 + ( − 1 ) ( − 1 ) + 1 ⋅ 1 = 6 c 12 = 2 ( − 1 ) + ( − 1 ) 2 + 1 ( − 1 ) = − 5 c 13 = 2 ⋅ 1 + ( − 1 ) ( − 1 ) + 1 ⋅ 2 = 5 c 21 = ( − 1 ) 2 + 2 ( − 1 ) + ( − 1 ) 1 = − 5 c 22 = ( − 1 ) ( − 1 ) + 2 ⋅ 2 + ( − 1 ) ( − 1 ) = 6 c 23 = ( − 1 ) 1 + 2 ( − 1 ) + ( − 1 ) 2 = − 5 c 31 = 1 ⋅ 2 + ( − 1 ) ( − 1 ) + 2 ⋅ 1 = 5 c 32 = 1 ( − 1 ) + ( − 1 ) 2 + 2 ( − 1 ) = − 5 c 33 = 1 ⋅ 1 + ( − 1 ) ( − 1 ) + 2 ⋅ 2 = 6 \begin{aligned}
c_{11} &= 2\cdot2 + (-1)(-1) + 1\cdot1 = 6\\
c_{12} &= 2(-1) + (-1)2 + 1(-1) = -5\\
c_{13} &= 2\cdot1 + (-1)(-1) + 1\cdot2 = 5\\[1mm]
c_{21} &= (-1)2 + 2(-1) + (-1)1 = -5\\
c_{22} &= (-1)(-1) + 2\cdot2 + (-1)(-1) = 6\\
c_{23} &= (-1)1 + 2(-1) + (-1)2 = -5\\[1mm]
c_{31} &= 1\cdot2 + (-1)(-1) + 2\cdot1 = 5\\
c_{32} &= 1(-1) + (-1)2 + 2(-1) = -5\\
c_{33} &= 1\cdot1 + (-1)(-1) + 2\cdot2 = 6
\end{aligned} c 11 c 12 c 13 c 21 c 22 c 23 c 31 c 32 c 33 = 2 ⋅ 2 + ( − 1 ) ( − 1 ) + 1 ⋅ 1 = 6 = 2 ( − 1 ) + ( − 1 ) 2 + 1 ( − 1 ) = − 5 = 2 ⋅ 1 + ( − 1 ) ( − 1 ) + 1 ⋅ 2 = 5 = ( − 1 ) 2 + 2 ( − 1 ) + ( − 1 ) 1 = − 5 = ( − 1 ) ( − 1 ) + 2 ⋅ 2 + ( − 1 ) ( − 1 ) = 6 = ( − 1 ) 1 + 2 ( − 1 ) + ( − 1 ) 2 = − 5 = 1 ⋅ 2 + ( − 1 ) ( − 1 ) + 2 ⋅ 1 = 5 = 1 ( − 1 ) + ( − 1 ) 2 + 2 ( − 1 ) = − 5 = 1 ⋅ 1 + ( − 1 ) ( − 1 ) + 2 ⋅ 2 = 6
A 2 = [ 6 − 5 5 − 5 6 − 5 5 − 5 6 ] A^2 = \begin{bmatrix} 6 & -5 & 5 \\ -5 & 6 & -5 \\ 5 & -5 & 6 \end{bmatrix} A 2 = 6 − 5 5 − 5 6 − 5 5 − 5 6
The result is symmetric (
c 12 = c 21 c_{12} = c_{21} c 12 = c 21 , c 13 = c 31 c_{13} = c_{31} c 13 = c 31 , c 23 = c 32 c_{23} = c_{32} c 23 = c 32 ), as Basic 3 says it must be. That is a free check on three of the nine entries.
Compute A 3 = A 2 ⋅ A A^3 = A^2\cdot A A 3 = A 2 ⋅ A
Rows of A 2 A^2 A 2 times the columns of A A A :
d 11 = 6 ⋅ 2 + ( − 5 ) ( − 1 ) + 5 ⋅ 1 = 22 d 12 = 6 ( − 1 ) + ( − 5 ) 2 + 5 ( − 1 ) = − 21 d 13 = 6 ⋅ 1 + ( − 5 ) ( − 1 ) + 5 ⋅ 2 = 21 d 21 = ( − 5 ) 2 + 6 ( − 1 ) + ( − 5 ) 1 = − 21 d 22 = ( − 5 ) ( − 1 ) + 6 ⋅ 2 + ( − 5 ) ( − 1 ) = 22 d 23 = ( − 5 ) 1 + 6 ( − 1 ) + ( − 5 ) 2 = − 21 d 31 = 5 ⋅ 2 + ( − 5 ) ( − 1 ) + 6 ⋅ 1 = 21 d 32 = 5 ( − 1 ) + ( − 5 ) 2 + 6 ( − 1 ) = − 21 d 33 = 5 ⋅ 1 + ( − 5 ) ( − 1 ) + 6 ⋅ 2 = 22 \begin{aligned}
d_{11} &= 6\cdot2 + (-5)(-1) + 5\cdot1 = 22\\
d_{12} &= 6(-1) + (-5)2 + 5(-1) = -21\\
d_{13} &= 6\cdot1 + (-5)(-1) + 5\cdot2 = 21\\[1mm]
d_{21} &= (-5)2 + 6(-1) + (-5)1 = -21\\
d_{22} &= (-5)(-1) + 6\cdot2 + (-5)(-1) = 22\\
d_{23} &= (-5)1 + 6(-1) + (-5)2 = -21\\[1mm]
d_{31} &= 5\cdot2 + (-5)(-1) + 6\cdot1 = 21\\
d_{32} &= 5(-1) + (-5)2 + 6(-1) = -21\\
d_{33} &= 5\cdot1 + (-5)(-1) + 6\cdot2 = 22
\end{aligned} d 11 d 12 d 13 d 21 d 22 d 23 d 31 d 32 d 33 = 6 ⋅ 2 + ( − 5 ) ( − 1 ) + 5 ⋅ 1 = 22 = 6 ( − 1 ) + ( − 5 ) 2 + 5 ( − 1 ) = − 21 = 6 ⋅ 1 + ( − 5 ) ( − 1 ) + 5 ⋅ 2 = 21 = ( − 5 ) 2 + 6 ( − 1 ) + ( − 5 ) 1 = − 21 = ( − 5 ) ( − 1 ) + 6 ⋅ 2 + ( − 5 ) ( − 1 ) = 22 = ( − 5 ) 1 + 6 ( − 1 ) + ( − 5 ) 2 = − 21 = 5 ⋅ 2 + ( − 5 ) ( − 1 ) + 6 ⋅ 1 = 21 = 5 ( − 1 ) + ( − 5 ) 2 + 6 ( − 1 ) = − 21 = 5 ⋅ 1 + ( − 5 ) ( − 1 ) + 6 ⋅ 2 = 22
A 3 = [ 22 − 21 21 − 21 22 − 21 21 − 21 22 ] A^3 = \begin{bmatrix} 22 & -21 & 21 \\ -21 & 22 & -21 \\ 21 & -21 & 22 \end{bmatrix} A 3 = 22 − 21 21 − 21 22 − 21 21 − 21 22
Again symmetric, as expected. Associativity means
A 2 A = A A 2 A^2A = AA^2 A 2 A = A A 2 , so it does not matter which side the extra
A A A goes on.
Combine A 3 − 6 A 2 + 9 A − 4 I A^3 - 6A^2 + 9A - 4I A 3 − 6 A 2 + 9 A − 4 I
6 A 2 = [ 36 − 30 30 − 30 36 − 30 30 − 30 36 ] 6A^2 = \begin{bmatrix} 36 & -30 & 30 \\ -30 & 36 & -30 \\ 30 & -30 & 36 \end{bmatrix} 6 A 2 = 36 − 30 30 − 30 36 − 30 30 − 30 36
9 A = [ 18 − 9 9 − 9 18 − 9 9 − 9 18 ] 9A = \begin{bmatrix} 18 & -9 & 9 \\ -9 & 18 & -9 \\ 9 & -9 & 18 \end{bmatrix} 9 A = 18 − 9 9 − 9 18 − 9 9 − 9 18
4 I 4I 4 I subtracts 4 4 4 from the diagonal only. Entry by entry (A 3 A^3 A 3 , minus 6 A 2 6A^2 6 A 2 , plus 9 A 9A 9 A , minus 4 I 4I 4 I ) :
( 1 , 1 ) : 22 − 36 + 18 − 4 = 0 ( 1 , 2 ) : − 21 + 30 − 9 − 0 = 0 ( 1 , 3 ) : 21 − 30 + 9 − 0 = 0 ( 2 , 1 ) : − 21 + 30 − 9 − 0 = 0 ( 2 , 2 ) : 22 − 36 + 18 − 4 = 0 ( 2 , 3 ) : − 21 + 30 − 9 − 0 = 0 ( 3 , 1 ) : 21 − 30 + 9 − 0 = 0 ( 3 , 2 ) : − 21 + 30 − 9 − 0 = 0 ( 3 , 3 ) : 22 − 36 + 18 − 4 = 0 \begin{aligned}
(1,1)&:\ 22 - 36 + 18 - 4 = 0\\
(1,2)&:\ -21 + 30 - 9 - 0 = 0\\
(1,3)&:\ 21 - 30 + 9 - 0 = 0\\[1mm]
(2,1)&:\ -21 + 30 - 9 - 0 = 0\\
(2,2)&:\ 22 - 36 + 18 - 4 = 0\\
(2,3)&:\ -21 + 30 - 9 - 0 = 0\\[1mm]
(3,1)&:\ 21 - 30 + 9 - 0 = 0\\
(3,2)&:\ -21 + 30 - 9 - 0 = 0\\
(3,3)&:\ 22 - 36 + 18 - 4 = 0
\end{aligned} ( 1 , 1 ) ( 1 , 2 ) ( 1 , 3 ) ( 2 , 1 ) ( 2 , 2 ) ( 2 , 3 ) ( 3 , 1 ) ( 3 , 2 ) ( 3 , 3 ) : 22 − 36 + 18 − 4 = 0 : − 21 + 30 − 9 − 0 = 0 : 21 − 30 + 9 − 0 = 0 : − 21 + 30 − 9 − 0 = 0 : 22 − 36 + 18 − 4 = 0 : − 21 + 30 − 9 − 0 = 0 : 21 − 30 + 9 − 0 = 0 : − 21 + 30 − 9 − 0 = 0 : 22 − 36 + 18 − 4 = 0
So A 3 − 6 A 2 + 9 A − 4 I = O A^3 - 6A^2 + 9A - 4I = O A 3 − 6 A 2 + 9 A − 4 I = O , verified.
All nine entries must be zero for the sum to be the zero matrix
O O O ; one non-zero entry would make the statement false. The pattern repeats (all diagonal entries alike, and all off-diagonal entries alike apart from sign), so the nine lines are really three calculations, but every position is still checked.
∣ A ∣ ≠ 0 |A| \neq 0 ∣ A ∣ = 0 , so A − 1 A^{-1} A − 1 exists
No entry is zero; expand along row 1. Signs + , − , + +, -, + + , − , + .
M 11 = ∣ 2 − 1 − 1 2 ∣ = 2 ⋅ 2 − ( − 1 ) ( − 1 ) = 3 M 12 = ∣ − 1 − 1 1 2 ∣ = ( − 1 ) 2 − ( − 1 ) 1 = − 1 M 13 = ∣ − 1 2 1 − 1 ∣ = ( − 1 ) ( − 1 ) − 2 ⋅ 1 = − 1 \begin{aligned}
M_{11} &= \begin{vmatrix} 2 & -1 \\ -1 & 2 \end{vmatrix}\\
&= 2\cdot2-(-1)(-1) = 3\\[1mm]
M_{12} &= \begin{vmatrix} -1 & -1 \\ 1 & 2 \end{vmatrix}\\
&= (-1)2-(-1)1 = -1\\[1mm]
M_{13} &= \begin{vmatrix} -1 & 2 \\ 1 & -1 \end{vmatrix}\\
&= (-1)(-1)-2\cdot1 = -1
\end{aligned} M 11 M 12 M 13 = 2 − 1 − 1 2 = 2 ⋅ 2 − ( − 1 ) ( − 1 ) = 3 = − 1 1 − 1 2 = ( − 1 ) 2 − ( − 1 ) 1 = − 1 = − 1 1 2 − 1 = ( − 1 ) ( − 1 ) − 2 ⋅ 1 = − 1
∣ A ∣ = 2 ⋅ 3 − ( − 1 ) ( − 1 ) + 1 ⋅ ( − 1 ) = 6 − 1 − 1 = 4 \begin{aligned}
|A| &= 2\cdot3 - (-1)(-1) + 1\cdot(-1)\\
&= 6 - 1 - 1 = 4
\end{aligned} ∣ A ∣ = 2 ⋅ 3 − ( − 1 ) ( − 1 ) + 1 ⋅ ( − 1 ) = 6 − 1 − 1 = 4
∣ A ∣ = 4 ≠ 0 |A| = 4 \neq 0 ∣ A ∣ = 4 = 0 , so A − 1 A^{-1} A − 1 exists.
Multiplying the equation by
A − 1 A^{-1} A − 1 in the next step needs
A − 1 A^{-1} A − 1 to exist (Theorem 4). The middle term is
a 12 a_{12} a 12 times its cofactor,
( − 1 ) ⋅ ( − M 12 ) (-1)\cdot(-M_{12}) ( − 1 ) ⋅ ( − M 12 ) , which is
( − 1 ) ⋅ 1 = − 1 (-1)\cdot1 = -1 ( − 1 ) ⋅ 1 = − 1 ; writing it as
− a 12 M 12 = − ( − 1 ) ( − 1 ) -a_{12}M_{12} = -(-1)(-1) − a 12 M 12 = − ( − 1 ) ( − 1 ) gives the same
− 1 -1 − 1 .
Multiply the equation by A − 1 A^{-1} A − 1
Post-multiply every term of A A A − 6 A A + 9 A − 4 I = O AAA - 6AA + 9A - 4I = O AAA − 6 AA + 9 A − 4 I = O by A − 1 A^{-1} A − 1 , using A A − 1 = I AA^{-1} = I A A − 1 = I :
A A ( A A − 1 ) − 6 A ( A A − 1 ) + 9 A A − 1 − 4 I A − 1 = O A − 1 A 2 − 6 A + 9 I − 4 A − 1 = O \begin{aligned}
AA(AA^{-1}) - 6A(AA^{-1}) &\\
+ 9AA^{-1} - 4IA^{-1} &= OA^{-1}\\
A^2 - 6A + 9I - 4A^{-1} &= O
\end{aligned} AA ( A A − 1 ) − 6 A ( A A − 1 ) + 9 A A − 1 − 4 I A − 1 A 2 − 6 A + 9 I − 4 A − 1 = O A − 1 = O
A − 1 = 1 4 ( A 2 − 6 A + 9 I ) A^{-1} = \frac{1}{4}\left(A^2 - 6A + 9I\right) A − 1 = 4 1 ( A 2 − 6 A + 9 I )
Distribute over each term, all on the right, and regroup by associativity, for example
( A A A ) A − 1 (AAA)A^{-1} ( AAA ) A − 1 as
A A ( A A − 1 ) AA(AA^{-1}) AA ( A A − 1 ) ; then
A A − 1 = I AA^{-1} = I A A − 1 = I , X I = X XI = X X I = X , I A − 1 = A − 1 IA^{-1} = A^{-1} I A − 1 = A − 1 , O A − 1 = O OA^{-1} = O O A − 1 = O . Moving
− 4 A − 1 -4A^{-1} − 4 A − 1 to the other side gives
4 A − 1 = A 2 − 6 A + 9 I 4A^{-1} = A^2 - 6A + 9I 4 A − 1 = A 2 − 6 A + 9 I , and we divide by the number 4.
Compute A 2 − 6 A + 9 I A^2 - 6A + 9I A 2 − 6 A + 9 I and A − 1 A^{-1} A − 1
6 A 6A 6 A has rows 12 , − 6 , 6 12, -6, 6 12 , − 6 , 6 / − 6 , 12 , − 6 -6, 12, -6 − 6 , 12 , − 6 / 6 , − 6 , 12 6, -6, 12 6 , − 6 , 12 . Entry by entry (A 2 A^2 A 2 , minus 6 A 6A 6 A , plus 9 I 9I 9 I on the diagonal):
( 1 , 1 ) : 6 − 12 + 9 = 3 ( 1 , 2 ) : − 5 + 6 + 0 = 1 ( 1 , 3 ) : 5 − 6 + 0 = − 1 ( 2 , 1 ) : − 5 + 6 + 0 = 1 ( 2 , 2 ) : 6 − 12 + 9 = 3 ( 2 , 3 ) : − 5 + 6 + 0 = 1 ( 3 , 1 ) : 5 − 6 + 0 = − 1 ( 3 , 2 ) : − 5 + 6 + 0 = 1 ( 3 , 3 ) : 6 − 12 + 9 = 3 \begin{aligned}
(1,1)&:\ 6 - 12 + 9 = 3\\
(1,2)&:\ -5 + 6 + 0 = 1\\
(1,3)&:\ 5 - 6 + 0 = -1\\[1mm]
(2,1)&:\ -5 + 6 + 0 = 1\\
(2,2)&:\ 6 - 12 + 9 = 3\\
(2,3)&:\ -5 + 6 + 0 = 1\\[1mm]
(3,1)&:\ 5 - 6 + 0 = -1\\
(3,2)&:\ -5 + 6 + 0 = 1\\
(3,3)&:\ 6 - 12 + 9 = 3
\end{aligned} ( 1 , 1 ) ( 1 , 2 ) ( 1 , 3 ) ( 2 , 1 ) ( 2 , 2 ) ( 2 , 3 ) ( 3 , 1 ) ( 3 , 2 ) ( 3 , 3 ) : 6 − 12 + 9 = 3 : − 5 + 6 + 0 = 1 : 5 − 6 + 0 = − 1 : − 5 + 6 + 0 = 1 : 6 − 12 + 9 = 3 : − 5 + 6 + 0 = 1 : 5 − 6 + 0 = − 1 : − 5 + 6 + 0 = 1 : 6 − 12 + 9 = 3
A − 1 = 1 4 [ 3 1 − 1 1 3 1 − 1 1 3 ] A^{-1} = \frac{1}{4}\begin{bmatrix} 3 & 1 & -1 \\ 1 & 3 & 1 \\ -1 & 1 & 3 \end{bmatrix} A − 1 = 4 1 3 1 − 1 1 3 1 − 1 1 3
Cross-check with the adjoint:
A − 1 = 1 ∣ A ∣ adj A = 1 4 adj A A^{-1} = \frac{1}{|A|}\operatorname{adj}A = \frac14\operatorname{adj}A A − 1 = ∣ A ∣ 1 adj A = 4 1 adj A , so the integer matrix must be
adj A \operatorname{adj}A adj A . Its first row should be the cofactors of column 1:
A 11 = M 11 = 3 A_{11} = M_{11} = 3 A 11 = M 11 = 3 , A 21 = − M 21 A_{21} = -M_{21} A 21 = − M 21 with
M 21 = ( − 1 ) 2 − 1 ( − 1 ) = − 1 M_{21} = (-1)2 - 1(-1) = -1 M 21 = ( − 1 ) 2 − 1 ( − 1 ) = − 1 , so
A 21 = 1 A_{21} = 1 A 21 = 1 , and
A 31 = M 31 A_{31} = M_{31} A 31 = M 31 with
M 31 = ( − 1 ) ( − 1 ) − 1 ⋅ 2 = − 1 M_{31} = (-1)(-1) - 1\cdot2 = -1 M 31 = ( − 1 ) ( − 1 ) − 1 ⋅ 2 = − 1 . That is
3 , 1 , − 1 3, 1, -1 3 , 1 , − 1 ✓.
Check: A A − 1 = I AA^{-1} = I A A − 1 = I
Multiply A A A by the integer matrix, then divide by 4:
( 1 , 1 ) : 2 ⋅ 3 + ( − 1 ) 1 + 1 ( − 1 ) = 4 ( 1 , 2 ) : 2 ⋅ 1 + ( − 1 ) 3 + 1 ⋅ 1 = 0 ( 1 , 3 ) : 2 ( − 1 ) + ( − 1 ) 1 + 1 ⋅ 3 = 0 ( 2 , 1 ) : ( − 1 ) 3 + 2 ⋅ 1 + ( − 1 ) ( − 1 ) = 0 ( 2 , 2 ) : ( − 1 ) 1 + 2 ⋅ 3 + ( − 1 ) 1 = 4 ( 2 , 3 ) : ( − 1 ) ( − 1 ) + 2 ⋅ 1 + ( − 1 ) 3 = 0 ( 3 , 1 ) : 1 ⋅ 3 + ( − 1 ) 1 + 2 ( − 1 ) = 0 ( 3 , 2 ) : 1 ⋅ 1 + ( − 1 ) 3 + 2 ⋅ 1 = 0 ( 3 , 3 ) : 1 ( − 1 ) + ( − 1 ) 1 + 2 ⋅ 3 = 4 \begin{aligned}
(1,1)&:\ 2\cdot3 + (-1)1 + 1(-1) = 4\\
(1,2)&:\ 2\cdot1 + (-1)3 + 1\cdot1 = 0\\
(1,3)&:\ 2(-1) + (-1)1 + 1\cdot3 = 0\\[1mm]
(2,1)&:\ (-1)3 + 2\cdot1 + (-1)(-1) = 0\\
(2,2)&:\ (-1)1 + 2\cdot3 + (-1)1 = 4\\
(2,3)&:\ (-1)(-1) + 2\cdot1 + (-1)3 = 0\\[1mm]
(3,1)&:\ 1\cdot3 + (-1)1 + 2(-1) = 0\\
(3,2)&:\ 1\cdot1 + (-1)3 + 2\cdot1 = 0\\
(3,3)&:\ 1(-1) + (-1)1 + 2\cdot3 = 4
\end{aligned} ( 1 , 1 ) ( 1 , 2 ) ( 1 , 3 ) ( 2 , 1 ) ( 2 , 2 ) ( 2 , 3 ) ( 3 , 1 ) ( 3 , 2 ) ( 3 , 3 ) : 2 ⋅ 3 + ( − 1 ) 1 + 1 ( − 1 ) = 4 : 2 ⋅ 1 + ( − 1 ) 3 + 1 ⋅ 1 = 0 : 2 ( − 1 ) + ( − 1 ) 1 + 1 ⋅ 3 = 0 : ( − 1 ) 3 + 2 ⋅ 1 + ( − 1 ) ( − 1 ) = 0 : ( − 1 ) 1 + 2 ⋅ 3 + ( − 1 ) 1 = 4 : ( − 1 ) ( − 1 ) + 2 ⋅ 1 + ( − 1 ) 3 = 0 : 1 ⋅ 3 + ( − 1 ) 1 + 2 ( − 1 ) = 0 : 1 ⋅ 1 + ( − 1 ) 3 + 2 ⋅ 1 = 0 : 1 ( − 1 ) + ( − 1 ) 1 + 2 ⋅ 3 = 4
A A − 1 = 1 4 [ 4 0 0 0 4 0 0 0 4 ] = I AA^{-1} = \frac{1}{4}\begin{bmatrix} 4 & 0 & 0 \\ 0 & 4 & 0 \\ 0 & 0 & 4 \end{bmatrix} = I A A − 1 = 4 1 4 0 0 0 4 0 0 0 4 = I
Before dividing, the product is
4 I = ∣ A ∣ I 4I = |A|\,I 4 I = ∣ A ∣ I , exactly
A ( adj A ) = ∣ A ∣ I A(\operatorname{adj}A) = |A|\,I A ( adj A ) = ∣ A ∣ I (Theorem 1), confirming the integer matrix is
adj A \operatorname{adj}A adj A .
Result
A 3 − 6 A 2 + 9 A − 4 I = O A^3 - 6A^2 + 9A - 4I = O A 3 − 6 A 2 + 9 A − 4 I = O holds, ∣ A ∣ = 4 |A| = 4 ∣ A ∣ = 4 , and
A − 1 = 1 4 [ 3 1 − 1 1 3 1 − 1 1 3 ] A^{-1} = \frac{1}{4}\begin{bmatrix} 3 & 1 & -1 \\ 1 & 3 & 1 \\ -1 & 1 & 3 \end{bmatrix} A − 1 = 4 1 3 1 − 1 1 3 1 − 1 1 3
(Textbook answer: the same matrix.)
Check it with numbers
Test the cubic on the column ( 1 , 1 , 0 ) (1, 1, 0) ( 1 , 1 , 0 ) . A A A sends it to ( 2 − 1 , − 1 + 2 , 1 − 1 ) (2 - 1,\ -1 + 2,\ 1 - 1) ( 2 − 1 , − 1 + 2 , 1 − 1 ) , that is ( 1 , 1 , 0 ) (1, 1, 0) ( 1 , 1 , 0 ) again: this column is unchanged by A A A , so every power of A A A leaves it unchanged too, and the cubic multiplies it by 1 − 6 + 9 − 4 = 0 1 - 6 + 9 - 4 = 0 1 − 6 + 9 − 4 = 0 ✓. The column ( 1 , 0 , − 1 ) (1, 0, -1) ( 1 , 0 , − 1 ) is also unchanged by A A A , and ( 1 , − 1 , 1 ) (1, -1, 1) ( 1 , − 1 , 1 ) is sent to 4 4 4 times itself, since 2 + 1 + 1 = 4 2 + 1 + 1 = 4 2 + 1 + 1 = 4 ; the cubic gives 64 − 96 + 36 − 4 = 0 64 - 96 + 36 - 4 = 0 64 − 96 + 36 − 4 = 0 for it ✓.