Class 12 Maths, Worked in Full Past papersGet updates
Chapter 4 · Determinants

Exercise 4.4 · Q16: Verify A3−6A2+9A−4I=OA^3-6A^2+9A-4I=O⁠; hence find A−1A^{-1}

Exercise 4.4Adjoint and inverse of a matrix · Section 4.5
The question

If

A=[2−11−12−11−12]A = \begin{bmatrix} 2 & -1 & 1 \\ -1 & 2 & -1 \\ 1 & -1 & 2 \end{bmatrix}

verify that A3−6A2+9A−4I=OA^3 - 6A^2 + 9A - 4I = O and hence find A−1A^{-1}⁠.

Exam answer

Entries cijc_{ij} of A2=AAA^2 = AA (row ii times column jj⁠):

c11=4+1+1=6c12=−2−2−1=−5c13=2+1+2=5c21=−2−2−1=−5c22=1+4+1=6c23=−1−2−2=−5c31=2+1+2=5c32=−1−2−2=−5c33=1+1+4=6\begin{aligned} c_{11} &= 4 + 1 + 1 = 6 \\ c_{12} &= -2 - 2 - 1 = -5 \\ c_{13} &= 2 + 1 + 2 = 5 \\ c_{21} &= -2 - 2 - 1 = -5 \\ c_{22} &= 1 + 4 + 1 = 6 \\ c_{23} &= -1 - 2 - 2 = -5 \\ c_{31} &= 2 + 1 + 2 = 5 \\ c_{32} &= -1 - 2 - 2 = -5 \\ c_{33} &= 1 + 1 + 4 = 6 \end{aligned} A2=[6−55−56−55−56]A^2 = \begin{bmatrix} 6 & -5 & 5 \\ -5 & 6 & -5 \\ 5 & -5 & 6 \end{bmatrix}

Entries dijd_{ij} of A3=A2AA^3 = A^2A⁠:

d11=12+5+5=22d12=−6−10−5=−21d13=6+5+10=21d21=−10−6−5=−21d22=5+12+5=22d23=−5−6−10=−21d31=10+5+6=21d32=−5−10−6=−21d33=5+5+12=22\begin{aligned} d_{11} &= 12 + 5 + 5 = 22 \\ d_{12} &= -6 - 10 - 5 = -21 \\ d_{13} &= 6 + 5 + 10 = 21 \\ d_{21} &= -10 - 6 - 5 = -21 \\ d_{22} &= 5 + 12 + 5 = 22 \\ d_{23} &= -5 - 6 - 10 = -21 \\ d_{31} &= 10 + 5 + 6 = 21 \\ d_{32} &= -5 - 10 - 6 = -21 \\ d_{33} &= 5 + 5 + 12 = 22 \end{aligned} A3=[22−2121−2122−2121−2122]A^3 = \begin{bmatrix} 22 & -21 & 21 \\ -21 & 22 & -21 \\ 21 & -21 & 22 \end{bmatrix} A3−6A2+9A−4I=[22−2121−2122−2121−2122]−[36−3030−3036−3030−3036]+[18−99−918−99−918]−[400040004]=[000000000]=O\begin{aligned} &A^3 - 6A^2 + 9A - 4I \\ &= \begin{bmatrix} 22 & -21 & 21 \\ -21 & 22 & -21 \\ 21 & -21 & 22 \end{bmatrix} \\ &\quad - \begin{bmatrix} 36 & -30 & 30 \\ -30 & 36 & -30 \\ 30 & -30 & 36 \end{bmatrix} \\ &\quad + \begin{bmatrix} 18 & -9 & 9 \\ -9 & 18 & -9 \\ 9 & -9 & 18 \end{bmatrix} \\ &\quad - \begin{bmatrix} 4 & 0 & 0 \\ 0 & 4 & 0 \\ 0 & 0 & 4 \end{bmatrix} \\ &= \begin{bmatrix} 0 & 0 & 0 \\ 0 & 0 & 0 \\ 0 & 0 & 0 \end{bmatrix} = O \end{aligned}

Hence A3−6A2+9A−4I=OA^3 - 6A^2 + 9A - 4I = O⁠.

Expanding along R1R_1⁠:

∣A∣=2(4−1)+1(−2+1)+1(1−2)=6−1−1=4\begin{aligned} |A| &= 2(4 - 1) + 1(-2 + 1) \\ &\quad + 1(1 - 2) \\ &= 6 - 1 - 1 = 4 \end{aligned}

Since ∣A∣≠0|A| \ne 0⁠, A−1A^{-1} exists. Post-multiplying by A−1A^{-1}⁠,

(A3−6A2+9A−4I)A−1=OA−1⇒ A2−6A+9I−4A−1=O⇒ A−1=14(A2−6A+9I)\begin{aligned} &(A^3 - 6A^2 + 9A - 4I)A^{-1} \\ &\qquad = OA^{-1} \\ &\Rightarrow\ A^2 - 6A + 9I - 4A^{-1} = O \\ &\Rightarrow\ A^{-1} = \frac{1}{4}(A^2 - 6A + 9I) \end{aligned} A2−6A+9I=[6−55−56−55−56]−[12−66−612−66−612]+[900090009]=[31−1131−113]\begin{aligned} &A^2 - 6A + 9I \\ &= \begin{bmatrix} 6 & -5 & 5 \\ -5 & 6 & -5 \\ 5 & -5 & 6 \end{bmatrix} \\ &\quad - \begin{bmatrix} 12 & -6 & 6 \\ -6 & 12 & -6 \\ 6 & -6 & 12 \end{bmatrix} \\ &\quad + \begin{bmatrix} 9 & 0 & 0 \\ 0 & 9 & 0 \\ 0 & 0 & 9 \end{bmatrix} \\ &= \begin{bmatrix} 3 & 1 & -1 \\ 1 & 3 & 1 \\ -1 & 1 & 3 \end{bmatrix} \end{aligned}

∴ A−1=14[31−1131−113]\therefore\ A^{-1} = \dfrac{1}{4}\begin{bmatrix} 3 & 1 & -1 \\ 1 & 3 & 1 \\ -1 & 1 & 3 \end{bmatrix}

Want the reason behind every step, the basics and the checks?

The one idea this problem is built on

Check the cubic equation entry by entry, then multiply it by A−1A^{-1}⁠. Each power of AA drops by one and 4I4I becomes 4A−14A^{-1}⁠:

A2−6A+9I−4A−1=O,A^2 - 6A + 9I - 4A^{-1} = O,

so A−1=14(A2−6A+9I)A^{-1} = \frac{1}{4}(A^2 - 6A + 9I)⁠. Because AA is symmetric, every matrix in the working is symmetric too, which halves the checking.

Given, to find, and the plan
Given
The 3×33\times3 matrix AA above; II and OO are the 3×33\times3 identity and zero matrices.
To show / find
A3−6A2+9A−4I=OA^3 - 6A^2 + 9A - 4I = O⁠; then A−1A^{-1}⁠.
Plan
(1) A2A^2⁠. (2) A3=A2AA^3 = A^2A⁠. (3) Combine the four terms. (4) ∣A∣≠0|A| \neq 0⁠. (5) Multiply the equation by A−1A^{-1}⁠. (6) Compute A2−6A+9IA^2 - 6A + 9I and A−1A^{-1}⁠. (7) Check AA−1=IAA^{-1} = I⁠.

Basics you need

1Powers of a matrix

A2=AAA^2 = AA⁠, A3=A2AA^3 = A^2A⁠, each computed row times column. Basics: matrix facts the chapter uses

2Scalar multiples and sums

9A9A multiplies every entry by 9; 4I4I has 44 on the diagonal only. Basics: scaling and adding matrices

3Symmetric matrices

AA equals its transpose: entry (i,j)(i,j) equals entry (j,i)(j,i)⁠. Then A2A^2 and A3A^3 are symmetric too, because (A2)′=A′A′=AA(A^2)' = A'A' = AA⁠. Basics: transpose and identity

4Inverse

A−1A^{-1} exists exactly when ∣A∣≠0|A| \neq 0 (Theorem 4); the method follows Example 15. Basics: why the inverse divides by |A|

Solution

  1. Compute A2=A⋅AA^2 = A\cdot A

    AA is 3×33\times3⁠, so A⋅AA\cdot A is 3×33\times3⁠. Because AA is symmetric, its columns are the same as its rows: (2,−1,1)(2,-1,1)⁠, (−1,2,−1)(-1,2,-1)⁠, (1,−1,2)(1,-1,2)⁠.

    c11=2⋅2+(−1)(−1)+1⋅1=6c12=2(−1)+(−1)2+1(−1)=−5c13=2⋅1+(−1)(−1)+1⋅2=5c21=(−1)2+2(−1)+(−1)1=−5c22=(−1)(−1)+2⋅2+(−1)(−1)=6c23=(−1)1+2(−1)+(−1)2=−5c31=1⋅2+(−1)(−1)+2⋅1=5c32=1(−1)+(−1)2+2(−1)=−5c33=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} A2=[6−55−56−55−56]A^2 = \begin{bmatrix} 6 & -5 & 5 \\ -5 & 6 & -5 \\ 5 & -5 & 6 \end{bmatrix}
    The result is symmetric (c12=c21c_{12} = c_{21}⁠, c13=c31c_{13} = c_{31}⁠, c23=c32c_{23} = c_{32}⁠), as Basic 3 says it must be. That is a free check on three of the nine entries.
  2. Compute A3=A2⋅AA^3 = A^2\cdot A

    Rows of A2A^2 times the columns of AA⁠:

    d11=6⋅2+(−5)(−1)+5⋅1=22d12=6(−1)+(−5)2+5(−1)=−21d13=6⋅1+(−5)(−1)+5⋅2=21d21=(−5)2+6(−1)+(−5)1=−21d22=(−5)(−1)+6⋅2+(−5)(−1)=22d23=(−5)1+6(−1)+(−5)2=−21d31=5⋅2+(−5)(−1)+6⋅1=21d32=5(−1)+(−5)2+6(−1)=−21d33=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} A3=[22−2121−2122−2121−2122]A^3 = \begin{bmatrix} 22 & -21 & 21 \\ -21 & 22 & -21 \\ 21 & -21 & 22 \end{bmatrix}
    Again symmetric, as expected. Associativity means A2A=AA2A^2A = AA^2⁠, so it does not matter which side the extra AA goes on.
  3. Combine A3−6A2+9A−4IA^3 - 6A^2 + 9A - 4I

    6A2=[36−3030−3036−3030−3036]6A^2 = \begin{bmatrix} 36 & -30 & 30 \\ -30 & 36 & -30 \\ 30 & -30 & 36 \end{bmatrix} 9A=[18−99−918−99−918]9A = \begin{bmatrix} 18 & -9 & 9 \\ -9 & 18 & -9 \\ 9 & -9 & 18 \end{bmatrix}

    4I4I subtracts 44 from the diagonal only. Entry by entry (A3A^3⁠, minus 6A26A^2⁠, plus 9A9A⁠, minus 4I4I⁠):

    (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}

    So A3−6A2+9A−4I=OA^3 - 6A^2 + 9A - 4I = O, verified.

    All nine entries must be zero for the sum to be the zero matrix OO⁠; 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.
  4. ∣A∣≠0|A| \neq 0⁠, so A−1A^{-1} exists

    No entry is zero; expand along row 1. Signs +,−,++, -, +⁠.

    M11=∣2−1−12∣=2⋅2−(−1)(−1)=3M12=∣−1−112∣=(−1)2−(−1)1=−1M13=∣−121−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} ∣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∣=4≠0|A| = 4 \neq 0⁠, so A−1A^{-1} exists.

    Multiplying the equation by A−1A^{-1} in the next step needs A−1A^{-1} to exist (Theorem 4). The middle term is a12a_{12} times its cofactor, (−1)⋅(−M12)(-1)\cdot(-M_{12})⁠, which is (−1)⋅1=−1(-1)\cdot1 = -1⁠; writing it as −a12M12=−(−1)(−1)-a_{12}M_{12} = -(-1)(-1) gives the same −1-1⁠.
  5. Multiply the equation by A−1A^{-1}

    Post-multiply every term of AAA−6AA+9A−4I=OAAA - 6AA + 9A - 4I = O by A−1A^{-1}⁠, using AA−1=IAA^{-1} = I⁠:

    AA(AA−1)−6A(AA−1)+9AA−1−4IA−1=OA−1A2−6A+9I−4A−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} A−1=14(A2−6A+9I)A^{-1} = \frac{1}{4}\left(A^2 - 6A + 9I\right)
    Distribute over each term, all on the right, and regroup by associativity, for example (AAA)A−1(AAA)A^{-1} as AA(AA−1)AA(AA^{-1})⁠; then AA−1=IAA^{-1} = I⁠, XI=XXI = X⁠, IA−1=A−1IA^{-1} = A^{-1}⁠, OA−1=OOA^{-1} = O⁠. Moving −4A−1-4A^{-1} to the other side gives 4A−1=A2−6A+9I4A^{-1} = A^2 - 6A + 9I⁠, and we divide by the number 4.
  6. Compute A2−6A+9IA^2 - 6A + 9I and A−1A^{-1}

    6A6A has rows 12,−6,612, -6, 6 / −6,12,−6-6, 12, -6 / 6,−6,126, -6, 12⁠. Entry by entry (A2A^2⁠, minus 6A6A⁠, plus 9I9I 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} A−1=14[31−1131−113]A^{-1} = \frac{1}{4}\begin{bmatrix} 3 & 1 & -1 \\ 1 & 3 & 1 \\ -1 & 1 & 3 \end{bmatrix}
    Cross-check with the adjoint: A−1=1∣A∣adj⁡A=14adj⁡AA^{-1} = \frac{1}{|A|}\operatorname{adj}A = \frac14\operatorname{adj}A⁠, so the integer matrix must be adj⁡A\operatorname{adj}A⁠. Its first row should be the cofactors of column 1: A11=M11=3A_{11} = M_{11} = 3⁠, A21=−M21A_{21} = -M_{21} with M21=(−1)2−1(−1)=−1M_{21} = (-1)2 - 1(-1) = -1⁠, so A21=1A_{21} = 1⁠, and A31=M31A_{31} = M_{31} with M31=(−1)(−1)−1⋅2=−1M_{31} = (-1)(-1) - 1\cdot2 = -1⁠. That is 3,1,−13, 1, -1 ✓.
  7. Check: AA−1=IAA^{-1} = I

    Multiply AA 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} AA−1=14[400040004]=IAA^{-1} = \frac{1}{4}\begin{bmatrix} 4 & 0 & 0 \\ 0 & 4 & 0 \\ 0 & 0 & 4 \end{bmatrix} = I
    Before dividing, the product is 4I=∣A∣ I4I = |A|\,I⁠, exactly A(adj⁡A)=∣A∣ IA(\operatorname{adj}A) = |A|\,I (Theorem 1), confirming the integer matrix is adj⁡A\operatorname{adj}A⁠.
Result

A3−6A2+9A−4I=OA^3 - 6A^2 + 9A - 4I = O holds, ∣A∣=4|A| = 4⁠, and

A−1=14[31−1131−113]A^{-1} = \frac{1}{4}\begin{bmatrix} 3 & 1 & -1 \\ 1 & 3 & 1 \\ -1 & 1 & 3 \end{bmatrix}

(Textbook answer: the same matrix.)

Check it with numbers

Test the cubic on the column (1,1,0)(1, 1, 0)⁠. AA sends it to (2−1, −1+2, 1−1)(2 - 1,\ -1 + 2,\ 1 - 1)⁠, that is (1,1,0)(1, 1, 0) again: this column is unchanged by AA⁠, so every power of AA leaves it unchanged too, and the cubic multiplies it by 1−6+9−4=01 - 6 + 9 - 4 = 0 ✓. The column (1,0,−1)(1, 0, -1) is also unchanged by AA⁠, and (1,−1,1)(1, -1, 1) is sent to 44 times itself, since 2+1+1=42 + 1 + 1 = 4⁠; the cubic gives 64−96+36−4=064 - 96 + 36 - 4 = 0 for it ✓.

Common mistakes
  1. Sign of 4I4I⁠. The equation has −4I-4I⁠, so multiplying by A−1A^{-1} gives −4A−1-4A^{-1}⁠, and then A−1=+14(A2−6A+9I)A^{-1} = +\frac14(A^2 - 6A + 9I)⁠.
  2. Adding 9I9I or 4I4I to every entry. The identity has non-zero entries only on the diagonal.
  3. Mixing up rows and columns. For a symmetric matrix this happens to be harmless, but for other matrices it is not; always use row ii of the first factor and column jj of the second.
What to take away
  1. From A3+pA2+qA+rI=OA^3 + pA^2 + qA + rI = O with r≠0r \neq 0⁠: A−1=−1r(A2+pA+qI)A^{-1} = -\frac{1}{r}(A^2 + pA + qI)⁠. Here r=−4r = -4⁠.
  2. Symmetry of AA carries over to its powers: a quick check on half the entries.
  3. The integer matrix in A−1=1∣A∣(… )A^{-1} = \frac{1}{|A|}(\dots) is adj⁡A\operatorname{adj}A⁠; comparing one row with the cofactors is a cheap cross-check.

Every fact used, and where it comes from

FactUsed inSource
Row-times-column product; associativitySteps 1, 2, 7Chapter 3, Sections 3.4.5 and 3.4.6
Scalar multiples, sums, distributive lawSteps 3, 5, 6Chapter 3, Sections 3.4.2–3.4.6
Symmetric matrices; (AB)′=B′A′(AB)' = B'A'Steps 1, 2Chapter 3, Sections 3.5.1 and 3.6
Expansion of a 3×33\times3 determinant along a rowStep 4Section 4.2.3 (Lesson: expanding)
AA invertible   ⟺  ∣A∣≠0\iff |A|\neq0⁠; A−1=1∣A∣adj⁡AA^{-1} = \frac{1}{|A|}\operatorname{adj}ASteps 4, 6Theorem 4, Section 4.5 (Lesson: inverse)
Post-multiplying by A−1A^{-1} to find the inverseStep 5Example 15
A(adj⁡A)=∣A∣ IA(\operatorname{adj}A) = |A|\,IStep 7Theorem 1, Section 4.5
Every entry, the combinations and the checkSteps 1–7, CheckRecomputed in the site's verification script
Found an error, or want more?

Tell us if something on this page is wrong or unclear, or if you would like a fuller explanation, another method or a new feature. Send feedback on this problem →