SOLVER7 Study. Nothing Else.
Exercise 3.2 Q16

\(If\ A=\left[\begin{array}\text 1&0&2\\ 0&2&1\\ 2&0&3\end{array} \right] , prove\ that\ A^3-6A^2+7A+2I=0\)

CBSE Class 12 Maths · Matrices

Solution

👶 Simple Explanation

Simple Explanation

Imagine a special machine called a matrix. Sometimes a machine has a secret rule it always follows. Here, we want to show that the matrix \( A \) obeys a hidden rule: when you combine certain repeated uses of it, everything cancels out to zero. It is like mixing hot and cold water in just the right amounts to get room temperature. We multiply the matrix by itself a few times, then mix the results carefully. When everything is added up, every single entry becomes zero, proving the rule is true.

Answer: The expression reduces to the \(3 \times 3\) zero matrix, so \(A^3 - 6A^2 + 7A + 2I = 0\) is proved.

📖 Verifying a Matrix Polynomial Identity

Detailed Explanation

In this problem we must show that the matrix \(A\) satisfies the equation \(A^3 - 6A^2 + 7A + 2I = 0\). Here \(I\) is the \(3 \times 3\) identity matrix and \(0\) is the \(3 \times 3\) zero (null) matrix. To prove such an identity, we compute the required powers of \(A\) step by step: first \(A^2 = A \cdot A\), then \(A^3 = A^2 \cdot A\). After that, we substitute these matrices into the expression and combine them using scalar multiplication and matrix addition. If the left-hand side reduces to the zero matrix, the identity is proved. Remember that multiplying a matrix by a scalar multiplies every entry, and matrices are added entry by entry.

Formula Used

For an \(n \times n\) matrix, \(A^2 = A \cdot A\), \(A^3 = A^2 \cdot A\), and \(I\) is the identity matrix with \(A I = A\). We must show \(A^3 - 6A^2 + 7A + 2I = 0\), the null matrix.

Solution

  1. Step 1: Write down the matrix: We are given \[A = \begin{bmatrix} 1 & 0 & 2 \\ 0 & 2 & 1 \\ 2 & 0 & 3 \end{bmatrix}.\] We will need \(A^2\) and \(A^3\) to test the identity.
  2. Step 2: Compute \(A^2 = A \cdot A\): Multiply \(A\) by itself using row-by-column multiplication: \[A^2 = \begin{bmatrix} 1 & 0 & 2 \\ 0 & 2 & 1 \\ 2 & 0 & 3 \end{bmatrix} \begin{bmatrix} 1 & 0 & 2 \\ 0 & 2 & 1 \\ 2 & 0 & 3 \end{bmatrix}.\] For example, entry (1,1) is \(1\cdot1 + 0\cdot0 + 2\cdot2 = 5\), and entry (1,3) is \(1\cdot2 + 0\cdot1 + 2\cdot3 = 8\). Completing all entries gives \[A^2 = \begin{bmatrix} 5 & 0 & 8 \\ 2 & 4 & 5 \\ 8 & 0 & 13 \end{bmatrix}.\]
  3. Step 3: Compute \(A^3 = A^2 \cdot A\): Now multiply \(A^2\) by \(A\): \[A^3 = \begin{bmatrix} 5 & 0 & 8 \\ 2 & 4 & 5 \\ 8 & 0 & 13 \end{bmatrix} \begin{bmatrix} 1 & 0 & 2 \\ 0 & 2 & 1 \\ 2 & 0 & 3 \end{bmatrix}.\] For example, entry (1,1) is \(5\cdot1 + 0\cdot0 + 8\cdot2 = 21\), and entry (1,3) is \(5\cdot2 + 0\cdot1 + 8\cdot3 = 34\). Completing all entries gives \[A^3 = \begin{bmatrix} 21 & 0 & 34 \\ 12 & 8 & 23 \\ 34 & 0 & 55 \end{bmatrix}.\]
  4. Step 4: Compute \(6A^2\), \(7A\), and \(2I\): Multiply each matrix by its scalar. First, \[6A^2 = \begin{bmatrix} 30 & 0 & 48 \\ 12 & 24 & 30 \\ 48 & 0 & 78 \end{bmatrix}.\] Next, \[7A = \begin{bmatrix} 7 & 0 & 14 \\ 0 & 14 & 7 \\ 14 & 0 & 21 \end{bmatrix}.\] Finally, \[2I = \begin{bmatrix} 2 & 0 & 0 \\ 0 & 2 & 0 \\ 0 & 0 & 2 \end{bmatrix}.\]
  5. Step 5: Substitute into the expression: Combine the matrices entry by entry: \[A^3 - 6A^2 + 7A + 2I.\] Consider entry (1,1): \(21 - 30 + 7 + 2 = 0\). Entry (1,3): \(34 - 48 + 14 + 0 = 0\). Entry (2,2): \(8 - 24 + 14 + 2 = 0\). Entry (3,3): \(55 - 78 + 21 + 2 = 0\). Checking every position in the same way gives \[A^3 - 6A^2 + 7A + 2I = \begin{bmatrix} 0 & 0 & 0 \\ 0 & 0 & 0 \\ 0 & 0 & 0 \end{bmatrix}.\]
  6. Step 6: Conclude: Since the left-hand side equals the \(3 \times 3\) null matrix, the identity is verified. Hence \[A^3 - 6A^2 + 7A + 2I = 0.\]

Final Answer

The expression reduces to the \(3 \times 3\) zero matrix, so \(A^3 - 6A^2 + 7A + 2I = 0\) is proved.

Common Mistake

A frequent error is treating \(A^2\) and \(A^3\) as element-wise squares and cubes of the entries of \(A\). Powers of a matrix must be found by actual matrix multiplication (row by column), not by squaring or cubing individual entries.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Record the given matrix: The matrix given is \[A = \\begin{bmatrix} 1 & 0 & 2 \\\\ 0 & 2 & 1 \\\\ 2 & 0 & 3 \\end{bmatrix}.\] — Reason: We must have a clear record of \(A\) before performing any matrix multiplication, as every subsequent computation depends on these entries.
  2. Step 2: Compute \(A^2 = A \cdot A\): Multiply \(A\) by itself row-by-column. For instance, entry (1,1): \(1 \cdot 1 + 0 \cdot 0 + 2 \cdot 2 = 5\); entry (1,2): \(1 \cdot 0 + 0 \cdot 2 + 2 \cdot 0 = 0\); entry (1,3): \(1 \cdot 2 + 0 \cdot 1 + 2 \cdot 3 = 8\); entry (2,1): \(0 \cdot 1 + 2 \cdot 0 + 1 \cdot 2 = 2\); entry (2,2): \(0 \cdot 0 + 2 \cdot 2 + 1 \cdot 0 = 4\); entry (2,3): \(0 \cdot 2 + 2 \cdot 1 + 1 \cdot 3 = 5\); entry (3,1): \(2 \cdot 1 + 0 \cdot 0 + 3 \cdot 2 = 8\); entry (3,2): \(2 \cdot 0 + 0 \cdot 2 + 3 \cdot 0 = 0\); entry (3,3): \(2 \cdot 2 + 0 \cdot 1 + 3 \cdot 3 = 13\). Therefore \[A^2 = \\begin{bmatrix} 5 & 0 & 8 \\\\ 2 & 4 & 5 \\\\ 8 & 0 & 13 \\end{bmatrix}.\] — Reason: \(A^2\) is needed both for computing \(A^3\) and for substituting into the polynomial expression.
  3. Step 3: Compute \(A^3 = A^2 \cdot A\): Multiply \(A^2\) by \(A\) row-by-column. Entry (1,1): \(5 \cdot 1 + 0 \cdot 0 + 8 \cdot 2 = 21\); entry (1,2): \(5 \cdot 0 + 0 \cdot 2 + 8 \cdot 0 = 0\); entry (1,3): \(5 \cdot 2 + 0 \cdot 1 + 8 \cdot 3 = 34\); entry (2,1): \(2 \cdot 1 + 4 \cdot 0 + 5 \cdot 2 = 12\); entry (2,2): \(2 \cdot 0 + 4 \cdot 2 + 5 \cdot 0 = 8\); entry (2,3): \(2 \cdot 2 + 4 \cdot 1 + 5 \cdot 3 = 23\); entry (3,1): \(8 \cdot 1 + 0 \cdot 0 + 13 \cdot 2 = 34\); entry (3,2): \(8 \cdot 0 + 0 \cdot 2 + 13 \cdot 0 = 0\); entry (3,3): \(8 \cdot 2 + 0 \cdot 1 + 13 \cdot 3 = 55\). Therefore \[A^3 = \\begin{bmatrix} 21 & 0 & 34 \\\\ 12 & 8 & 23 \\\\ 34 & 0 & 55 \\end{bmatrix}.\] — Reason: \(A^3\) is the highest power in the polynomial and must be computed before substitution.
  4. Step 4: Form the four individual terms: Compute each term of the expression separately by scalar multiplication. \[A^3 = \\begin{bmatrix} 21 & 0 & 34 \\\\ 12 & 8 & 23 \\\\ 34 & 0 & 55 \\end{bmatrix}, \quad 6A^2 = \\begin{bmatrix} 30 & 0 & 48 \\\\ 12 & 24 & 30 \\\\ 48 & 0 & 78 \\end{bmatrix},\] \[7A = \\begin{bmatrix} 7 & 0 & 14 \\\\ 0 & 14 & 7 \\\\ 14 & 0 & 21 \\end{bmatrix}, \quad 2I = \\begin{bmatrix} 2 & 0 & 0 \\\\ 0 & 2 & 0 \\\\ 0 & 0 & 2 \\end{bmatrix}.\] — Reason: Separating each term avoids arithmetic errors when combining; scalar multiplication simply scales every entry of the matrix.
  5. Step 5: Substitute and combine all terms entry by entry: Evaluate \(A^3 - 6A^2 + 7A + 2I\) by adding/subtracting corresponding entries. For each position \((i,j)\) compute: (entry of \(A^3\)) \(-\) (entry of \(6A^2\)) \(+\) (entry of \(7A\)) \(+\) (entry of \(2I\)). For example, position (1,1): \(21 - 30 + 7 + 2 = 0\); position (1,3): \(34 - 48 + 14 + 0 = 0\); position (2,2): \(8 - 24 + 14 + 2 = 0\); position (3,3): \(55 - 78 + 21 + 2 = 0\). Carrying out all nine entries gives \[A^3 - 6A^2 + 7A + 2I = \\begin{bmatrix} 0 & 0 & 0 \\\\ 0 & 0 & 0 \\\\ 0 & 0 & 0 \\end{bmatrix}.\] — Reason: If every entry of the combined matrix is zero, the left-hand side equals the null matrix, which is exactly what we need to prove.

Final Answer

The expression reduces to the \(3 \times 3\) zero matrix, so \(A^3 - 6A^2 + 7A + 2I = 0\) is proved.

Common Mistake

One common mistake: forgetting to include the \(2I\) term entirely, or using the \(2 \times 2\) identity instead of the \(3 \times 3\) identity — the identity matrix must match the size of \(A\), so every diagonal entry contributes 2 to the corresponding position.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Given matrix and compute \( A^2 \): \[A = \begin{bmatrix} 1 & 0 & 2 \\ 0 & 2 & 1 \\ 2 & 0 & 3 \end{bmatrix}, \quad A^2 = A \cdot A = \begin{bmatrix} 5 & 0 & 8 \\ 2 & 4 & 5 \\ 8 & 0 & 13 \end{bmatrix}\]
  2. Step 2: Compute \( A^3 \): \[A^3 = A^2 \cdot A = \begin{bmatrix} 5 & 0 & 8 \\ 2 & 4 & 5 \\ 8 & 0 & 13 \end{bmatrix} \begin{bmatrix} 1 & 0 & 2 \\ 0 & 2 & 1 \\ 2 & 0 & 3 \end{bmatrix} = \begin{bmatrix} 21 & 0 & 34 \\ 12 & 8 & 23 \\ 34 & 0 & 55 \end{bmatrix}\]
  3. Step 3: Evaluate \( A^3 - 6A^2 + 7A + 2I \): \[A^3 - 6A^2 + 7A + 2I = \begin{bmatrix} 21 & 0 & 34 \\ 12 & 8 & 23 \\ 34 & 0 & 55 \end{bmatrix} - 6\begin{bmatrix} 5 & 0 & 8 \\ 2 & 4 & 5 \\ 8 & 0 & 13 \end{bmatrix} + 7\begin{bmatrix} 1 & 0 & 2 \\ 0 & 2 & 1 \\ 2 & 0 & 3 \end{bmatrix} + 2\begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{bmatrix} = \begin{bmatrix} 0 & 0 & 0 \\ 0 & 0 & 0 \\ 0 & 0 & 0 \end{bmatrix}\]

Answer: The expression reduces to the \(3 \times 3\) zero matrix, so \(A^3 - 6A^2 + 7A + 2I = 0\) is proved.

➕ More Examples

More Examples

Example 1

Question: If \(A = \begin{bmatrix} 2 & 1 & 1 \\ 0 & 1 & 0 \\ 1 & 1 & 2 \end{bmatrix}\), prove that \(A^3 - 5A^2 + 7A - 3I = O\).

Solution: Step 1: Compute the characteristic polynomial det(A - λI) = 0. We have: \[A - \lambda I = \begin{bmatrix} 2-\lambda & 1 & 1 \\ 0 & 1-\lambda & 0 \\ 1 & 1 & 2-\lambda \end{bmatrix}\] Expanding along the second row: \[\det(A - \lambda I) = 0 \cdot M_{21} - (1-\lambda)\begin{vmatrix} 2-\lambda & 1 \\ 1 & 2-\lambda \end{vmatrix} + 0 \cdot M_{23}\] Wait — let us expand along the second row more carefully. The cofactor expansion gives: \[\det(A - \lambda I) = -(0) \cdot C_{21} + (1-\lambda) \cdot C_{22} - (0) \cdot C_{23}\] So: \[\det(A - \lambda I) = (1-\lambda) \begin{vmatrix} 2-\lambda & 1 \\ 1 & 2-\lambda \end{vmatrix}\] Now evaluate the 2×2 determinant: \[\begin{vmatrix} 2-\lambda & 1 \\ 1 & 2-\lambda \end{vmatrix} = (2-\lambda)^2 - 1 = 4 - 4\lambda + \lambda^2 - 1 = \lambda^2 - 4\lambda + 3\] So the characteristic polynomial is: \[\det(A - \lambda I) = (1-\lambda)(\lambda^2 - 4\lambda + 3)\] Factor \(\lambda^2 - 4\lambda + 3 = (\lambda-1)(\lambda-3)\), giving: \[\det(A - \lambda I) = (1-\lambda)(\lambda-1)(\lambda-3) = -(\lambda-1)^2(\lambda-3)\] Expand \((\lambda-1)^2(\lambda-3)\): \[(\lambda^2 - 2\lambda + 1)(\lambda - 3) = \lambda^3 - 3\lambda^2 - 2\lambda^2 + 6\lambda + \lambda - 3 = \lambda^3 - 5\lambda^2 + 7\lambda - 3\] So the characteristic equation is: \[-( \lambda^3 - 5\lambda^2 + 7\lambda - 3) = 0\] which is equivalent to: \[\lambda^3 - 5\lambda^2 + 7\lambda - 3 = 0\] Step 2: By the Cayley-Hamilton theorem, A satisfies its own characteristic equation: \[A^3 - 5A^2 + 7A - 3I = O\] Step 3: Verify by direct computation. First compute \(A^2\): \[A^2 = A \cdot A = \begin{bmatrix} 2 & 1 & 1 \\ 0 & 1 & 0 \\ 1 & 1 & 2 \end{bmatrix} \begin{bmatrix} 2 & 1 & 1 \\ 0 & 1 & 0 \\ 1 & 1 & 2 \end{bmatrix}\] Row 1: \((2)(2)+(1)(0)+(1)(1),\ (2)(1)+(1)(1)+(1)(1),\ (2)(1)+(1)(0)+(1)(2)\) = \(5, 4, 4\) Row 2: \((0)(2)+(1)(0)+(0)(1),\ (0)(1)+(1)(1)+(0)(1),\ (0)(1)+(1)(0)+(0)(2)\) = \(0, 1, 0\) Row 3: \((1)(2)+(1)(0)+(2)(1),\ (1)(1)+(1)(1)+(2)(1),\ (1)(1)+(1)(0)+(2)(2)\) = \(4, 4, 5\) So: \[A^2 = \begin{bmatrix} 5 & 4 & 4 \\ 0 & 1 & 0 \\ 4 & 4 & 5 \end{bmatrix}\] Next compute \(A^3 = A^2 \cdot A\): \[A^3 = \begin{bmatrix} 5 & 4 & 4 \\ 0 & 1 & 0 \\ 4 & 4 & 5 \end{bmatrix} \begin{bmatrix} 2 & 1 & 1 \\ 0 & 1 & 0 \\ 1 & 1 & 2 \end{bmatrix}\] Row 1: \((5)(2)+(4)(0)+(4)(1),\ (5)(1)+(4)(1)+(4)(1),\ (5)(1)+(4)(0)+(4)(2)\) = \(14, 13, 13\) Row 2: \((0)(2)+(1)(0)+(0)(1),\ (0)(1)+(1)(1)+(0)(1),\ (0)(1)+(1)(0)+(0)(2)\) = \(0, 1, 0\) Row 3: \((4)(2)+(4)(0)+(5)(1),\ (4)(1)+(4)(1)+(5)(1),\ (4)(1)+(4)(0)+(5)(2)\) = \(13, 13, 14\) So: \[A^3 = \begin{bmatrix} 14 & 13 & 13 \\ 0 & 1 & 0 \\ 13 & 13 & 14 \end{bmatrix}\] Step 4: Now compute \(A^3 - 5A^2 + 7A - 3I\): \[5A^2 = \begin{bmatrix} 25 & 20 & 20 \\ 0 & 5 & 0 \\ 20 & 20 & 25 \end{bmatrix}\] \[7A = \begin{bmatrix} 14 & 7 & 7 \\ 0 & 7 & 0 \\ 7 & 7 & 14 \end{bmatrix}\] \[3I = \begin{bmatrix} 3 & 0 & 0 \\ 0 & 3 & 0 \\ 0 & 0 & 3 \end{bmatrix}\] Combining: \[A^3 - 5A^2 + 7A - 3I = \begin{bmatrix} 14-25+14-3 & 13-20+7-0 & 13-20+7-0 \\ 0-0+0-0 & 1-5+7-3 & 0-0+0-0 \\ 13-20+7-0 & 13-20+7-0 & 14-25+14-3 \end{bmatrix}\] \[= \begin{bmatrix} 0 & 0 & 0 \\ 0 & 0 & 0 \\ 0 & 0 & 0 \end{bmatrix} = O\] Hence proved.

Answer: \(A^3 - 5A^2 + 7A - 3I = O\) is verified.

Example 2

Question: If \(A = \begin{bmatrix} 1 & 2 & 0 \\ 0 & 1 & 0 \\ 0 & 2 & 1 \end{bmatrix}\), prove that \(A^3 - 3A^2 + 3A - I = O\).

Solution: Step 1: Compute the characteristic polynomial. \[A - \lambda I = \begin{bmatrix} 1-\lambda & 2 & 0 \\ 0 & 1-\lambda & 0 \\ 0 & 2 & 1-\lambda \end{bmatrix}\] Since the matrix is upper block triangular with diagonal entries \((1-\lambda)\), \((1-\lambda)\), \((1-\lambda)\), we expand along column 3 (or directly note the determinant): Expanding along column 1 (leftmost column): \[\det(A - \lambda I) = (1-\lambda)\begin{vmatrix} 1-\lambda & 0 \\ 2 & 1-\lambda \end{vmatrix}\] \[= (1-\lambda)\left[(1-\lambda)^2 - 0\right] = (1-\lambda)^3\] Step 2: The characteristic equation is: \[(1-\lambda)^3 = 0\] Expanding \((1-\lambda)^3\): \[1 - 3\lambda + 3\lambda^2 - \lambda^3 = 0\] Multiplying through by \(-1\): \[\lambda^3 - 3\lambda^2 + 3\lambda - 1 = 0\] By the Cayley-Hamilton theorem, A satisfies its own characteristic equation: \[A^3 - 3A^2 + 3A - I = O\] Step 3: Verify by direct computation. First compute \(A^2\): \[A^2 = \begin{bmatrix} 1 & 2 & 0 \\ 0 & 1 & 0 \\ 0 & 2 & 1 \end{bmatrix} \begin{bmatrix} 1 & 2 & 0 \\ 0 & 1 & 0 \\ 0 & 2 & 1 \end{bmatrix}\] Row 1: \((1)(1)+(2)(0)+(0)(0),\ (1)(2)+(2)(1)+(0)(2),\ (1)(0)+(2)(0)+(0)(1)\) = \(1, 4, 0\) Row 2: \((0)(1)+(1)(0)+(0)(0),\ (0)(2)+(1)(1)+(0)(2),\ (0)(0)+(1)(0)+(0)(1)\) = \(0, 1, 0\) Row 3: \((0)(1)+(2)(0)+(1)(0),\ (0)(2)+(2)(1)+(1)(2),\ (0)(0)+(2)(0)+(1)(1)\) = \(0, 4, 1\) So: \[A^2 = \begin{bmatrix} 1 & 4 & 0 \\ 0 & 1 & 0 \\ 0 & 4 & 1 \end{bmatrix}\] Next compute \(A^3 = A^2 \cdot A\): \[A^3 = \begin{bmatrix} 1 & 4 & 0 \\ 0 & 1 & 0 \\ 0 & 4 & 1 \end{bmatrix} \begin{bmatrix} 1 & 2 & 0 \\ 0 & 1 & 0 \\ 0 & 2 & 1 \end{bmatrix}\] Row 1: \((1)(1)+(4)(0)+(0)(0),\ (1)(2)+(4)(1)+(0)(2),\ (1)(0)+(4)(0)+(0)(1)\) = \(1, 6, 0\) Row 2: \((0)(1)+(1)(0)+(0)(0),\ (0)(2)+(1)(1)+(0)(2),\ (0)(0)+(1)(0)+(0)(1)\) = \(0, 1, 0\) Row 3: \((0)(1)+(4)(0)+(1)(0),\ (0)(2)+(4)(1)+(1)(2),\ (0)(0)+(4)(0)+(1)(1)\) = \(0, 6, 1\) So: \[A^3 = \begin{bmatrix} 1 & 6 & 0 \\ 0 & 1 & 0 \\ 0 & 6 & 1 \end{bmatrix}\] Step 4: Compute \(A^3 - 3A^2 + 3A - I\): \[3A^2 = \begin{bmatrix} 3 & 12 & 0 \\ 0 & 3 & 0 \\ 0 & 12 & 3 \end{bmatrix}, \quad 3A = \begin{bmatrix} 3 & 6 & 0 \\ 0 & 3 & 0 \\ 0 & 6 & 3 \end{bmatrix}, \quad I = \begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{bmatrix}\] Entry-by-entry: Position (1,1): \(1 - 3 + 3 - 1 = 0\) Position (1,2): \(6 - 12 + 6 - 0 = 0\) Position (1,3): \(0 - 0 + 0 - 0 = 0\) Position (2,1): \(0 - 0 + 0 - 0 = 0\) Position (2,2): \(1 - 3 + 3 - 1 = 0\) Position (2,3): \(0 - 0 + 0 - 0 = 0\) Position (3,1): \(0 - 0 + 0 - 0 = 0\) Position (3,2): \(6 - 12 + 6 - 0 = 0\) Position (3,3): \(1 - 3 + 3 - 1 = 0\) Therefore: \[A^3 - 3A^2 + 3A - I = \begin{bmatrix} 0 & 0 & 0 \\ 0 & 0 & 0 \\ 0 & 0 & 0 \end{bmatrix} = O\] Hence proved.

Answer: \(A^3 - 3A^2 + 3A - I = O\) is verified.

🎯 Try a Similar Question

Try a Similar Question

Question: If \( A = \begin{bmatrix} 2 & 1 & 0 \\ 0 & 1 & 1 \\ 1 & 0 & 2 \end{bmatrix} \), prove that \( A^3 - 5A^2 + 7A - 3I = O \), where \( I \) is the identity matrix of order 3.

Solution

  1. Step 1: Compute A²: We multiply \( A \) by itself. \[ A^2 = A \cdot A = \begin{bmatrix} 2 & 1 & 0 \\ 0 & 1 & 1 \\ 1 & 0 & 2 \end{bmatrix} \begin{bmatrix} 2 & 1 & 0 \\ 0 & 1 & 1 \\ 1 & 0 & 2 \end{bmatrix} \] Row 1: \( (4+0+0,\ 2+1+0,\ 0+1+0) = (4, 3, 1) \) Row 2: \( (0+0+1,\ 0+1+0,\ 0+1+2) = (1, 1, 3) \) Row 3: \( (2+0+2,\ 1+0+0,\ 0+0+4) = (4, 1, 4) \) \[ A^2 = \begin{bmatrix} 4 & 3 & 1 \\ 1 & 1 & 3 \\ 4 & 1 & 4 \end{bmatrix} \]
  2. Step 2: Compute A³: We multiply \( A^2 \) by \( A \). \[ A^3 = A^2 \cdot A = \begin{bmatrix} 4 & 3 & 1 \\ 1 & 1 & 3 \\ 4 & 1 & 4 \end{bmatrix} \begin{bmatrix} 2 & 1 & 0 \\ 0 & 1 & 1 \\ 1 & 0 & 2 \end{bmatrix} \] Row 1: \( (8+0+1,\ 4+3+0,\ 0+3+2) = (9, 7, 5) \) Row 2: \( (2+0+3,\ 1+1+0,\ 0+1+6) = (5, 2, 7) \) Row 3: \( (8+0+4,\ 4+1+0,\ 0+1+8) = (12, 5, 9) \) \[ A^3 = \begin{bmatrix} 9 & 7 & 5 \\ 5 & 2 & 7 \\ 12 & 5 & 9 \end{bmatrix} \]
  3. Step 3: Compute 5A²: \[ 5A^2 = 5 \begin{bmatrix} 4 & 3 & 1 \\ 1 & 1 & 3 \\ 4 & 1 & 4 \end{bmatrix} = \begin{bmatrix} 20 & 15 & 5 \\ 5 & 5 & 15 \\ 20 & 5 & 20 \end{bmatrix} \]
  4. Step 4: Compute 7A: \[ 7A = 7 \begin{bmatrix} 2 & 1 & 0 \\ 0 & 1 & 1 \\ 1 & 0 & 2 \end{bmatrix} = \begin{bmatrix} 14 & 7 & 0 \\ 0 & 7 & 7 \\ 7 & 0 & 14 \end{bmatrix} \]
  5. Step 5: Compute 3I: \[ 3I = 3 \begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{bmatrix} = \begin{bmatrix} 3 & 0 & 0 \\ 0 & 3 & 0 \\ 0 & 0 & 3 \end{bmatrix} \]
  6. Step 6: Substitute into A³ − 5A² + 7A − 3I: Now we evaluate \( A^3 - 5A^2 + 7A - 3I \): \[ A^3 - 5A^2 + 7A - 3I = \begin{bmatrix} 9 & 7 & 5 \\ 5 & 2 & 7 \\ 12 & 5 & 9 \end{bmatrix} - \begin{bmatrix} 20 & 15 & 5 \\ 5 & 5 & 15 \\ 20 & 5 & 20 \end{bmatrix} + \begin{bmatrix} 14 & 7 & 0 \\ 0 & 7 & 7 \\ 7 & 0 & 14 \end{bmatrix} - \begin{bmatrix} 3 & 0 & 0 \\ 0 & 3 & 0 \\ 0 & 0 & 3 \end{bmatrix} \] Computing entry by entry: Position (1,1): \( 9 - 20 + 14 - 3 = 0 \) Position (1,2): \( 7 - 15 + 7 - 0 = -1 \) — let us recheck \( A^2 \) row 1 col 2 carefully: \( (2)(1)+(1)(1)+(0)(0) = 3 \), so \( 5A^2_{12} = 15 \); \( 7A_{12} = 7 \); giving \( 7 - 15 + 7 - 0 = -1 \). Recheck \( A^3 \) row 1 col 2: \( 4(1)+3(1)+1(0) = 7 \). Correct. So the entry is \( 7 - 15 + 7 + 0 = -1 \). Let us recheck \( A^2 \) more carefully. Row 1 of \( A \) times columns of \( A \): Col 1: \( 2(2)+1(0)+0(1) = 4 \), Col 2: \( 2(1)+1(1)+0(0) = 3 \), Col 3: \( 2(0)+1(1)+0(2) = 1 \). So row 1 of \( A^2 = (4,3,1) \). Confirmed. For \( A^3 \) row 1: row 1 of \( A^2 \) times \( A \): Col 1: \( 4(2)+3(0)+1(1)=9 \), Col 2: \( 4(1)+3(1)+1(0)=7 \), Col 3: \( 4(0)+3(1)+1(2)=5 \). Row 1 of \( A^3 = (9,7,5) \). Confirmed. So \( (1,2) \) entry: \( 9-20+14-3 = 0 \) for \((1,1)\) and \( 7-15+7-0=-1 \) for \((1,2)\). Since this gives \(-1\), let us recheck the question by verifying the characteristic polynomial first.
  7. Step 6 (Revised): Verify the Characteristic Polynomial First: The characteristic polynomial of \( A \) is \( \det(A - \lambda I) = 0 \). \[ \det(A - \lambda I) = \begin{vmatrix} 2-\lambda & 1 & 0 \\ 0 & 1-\lambda & 1 \\ 1 & 0 & 2-\lambda \end{vmatrix} \] Expanding along the first row: \( (2-\lambda)[(1-\lambda)(2-\lambda) - 0] - 1[0(2-\lambda) - 1] + 0 \) \( = (2-\lambda)(2 - 3\lambda + \lambda^2) - 1(0 - 1) \) \( = (2-\lambda)(\lambda^2 - 3\lambda + 2) + 1 \) Expanding \( (2-\lambda)(\lambda^2 - 3\lambda + 2) \): \( = 2\lambda^2 - 6\lambda + 4 - \lambda^3 + 3\lambda^2 - 2\lambda \) \( = -\lambda^3 + 5\lambda^2 - 8\lambda + 4 \) Adding 1: \( = -\lambda^3 + 5\lambda^2 - 8\lambda + 5 \) Setting this to zero and multiplying by \(-1\): \[ \lambda^3 - 5\lambda^2 + 8\lambda - 5 = 0 \] Let us check \( \lambda = 1 \): \( 1 - 5 + 8 - 5 = -1 \ne 0 \). Let us check \( \lambda = 2 \): \( 8 - 20 + 16 - 5 = -1 \ne 0 \). Since the polynomial in the original question does not match, let us use the correct characteristic polynomial \( \lambda^3 - 5\lambda^2 + 8\lambda - 5 = 0 \), so by Cayley–Hamilton, \( A^3 - 5A^2 + 8A - 5I = O \). We now verify this instead.
  8. Step 7: Revised Evaluation of A³ − 5A² + 8A − 5I: Using the matrices computed earlier: \[ 8A = \begin{bmatrix} 16 & 8 & 0 \\ 0 & 8 & 8 \\ 8 & 0 & 16 \end{bmatrix}, \quad 5I = \begin{bmatrix} 5 & 0 & 0 \\ 0 & 5 & 0 \\ 0 & 0 & 5 \end{bmatrix} \] \[ A^3 - 5A^2 + 8A - 5I = \begin{bmatrix} 9 & 7 & 5 \\ 5 & 2 & 7 \\ 12 & 5 & 9 \end{bmatrix} - \begin{bmatrix} 20 & 15 & 5 \\ 5 & 5 & 15 \\ 20 & 5 & 20 \end{bmatrix} + \begin{bmatrix} 16 & 8 & 0 \\ 0 & 8 & 8 \\ 8 & 0 & 16 \end{bmatrix} - \begin{bmatrix} 5 & 0 & 0 \\ 0 & 5 & 0 \\ 0 & 0 & 5 \end{bmatrix} \] Entry-by-entry for each position: (1,1): \( 9 - 20 + 16 - 5 = 0 \) (1,2): \( 7 - 15 + 8 - 0 = 0 \) (1,3): \( 5 - 5 + 0 - 0 = 0 \) (2,1): \( 5 - 5 + 0 - 0 = 0 \) (2,2): \( 2 - 5 + 8 - 5 = 0 \) (2,3): \( 7 - 15 + 8 - 0 = 0 \) (3,1): \( 12 - 20 + 8 - 0 = 0 \) (3,2): \( 5 - 5 + 0 - 0 = 0 \) (3,3): \( 9 - 20 + 16 - 5 = 0 \) All entries are 0, so: \[ A^3 - 5A^2 + 8A - 5I = O \] This completes the proof.

Answer: By computing \( A^2 \), \( A^3 \), and substituting, every entry of \( A^3 - 5A^2 + 8A - 5I \) equals zero. Hence \( A^3 - 5A^2 + 8A - 5I = O \) is proved, which is also the statement of the Cayley–Hamilton theorem for this matrix.

Everything you get with Solver7

More questions in Matrices

Chapter 3 Examples Q1 65/1/1 2023 / Section A Q1 65/2/1 2024 / Section A Q1 65/3/1 2023 / Section A Q1 65/3/1 2024 / Section A Q1 65/4/1 2023 / Section A Q1 65/5/1 2026 / Section A Q1 Chapter 3 Examples Q2 65(B) 2026 / Section A Q2 65/1/1 2024 / Section A Q2 65/1/1 2026 / Section A Q2 65/3/1 2026 / Section A Q2 65/4/1 2023 / Section A Q2 65/4/1 2026 / Section A Q2 65/5/1 2026 / Section A Q2 Chapter 3 Examples Q3 65(B) 2026 / Section A Q3 65/1/1 2026 / Section A Q3 65/3/1 2023 / Section A Q3 65/3/1 2026 / Section A Q3 65/4/1 2023 / Section A Q3 Chapter 3 Examples Q4 65/1/1 2023 / Section A Q4 65/3/1 2023 / Section A Q4 65/3/1 2026 / Section A Q4 65/4/1 2023 / Section A Q4 65/5/1 2026 / Section A Q4 Chapter 3 Examples Q5 65/1/1 2024 / Section A Q5 65/3/1 2026 / Section A Q5 65/4/2 2024 / Section A Q5 Chapter 3 Examples Q6 65/1/1 2026 / Section A Q6 65/2/3 2026 / Section A Q6 Chapter 3 Examples Q7 65/2/3 2026 / Section A Q7 Chapter 3 Examples Q8 65/2/3 2026 / Section A Q8 Chapter 3 Examples Q9 65/2/3 2026 / Section A Q9 Chapter 3 Examples Q10 65/4/2 2024 / Section A Q10 Chapter 3 Examples Q11(i) 65/4/2 2024 / Section A Q11 Chapter 3 Examples Q11(ii) 65/2/1 2024 / Section A Q12 65/3/1 2024 / Section A Q12 65/4/2 2024 / Section A Q12 Chapter 3 Examples Q11(iii) Chapter 3 Examples Q12 65/1/1 2023 / Section A Q14 Chapter 3 Examples Q13 65/2/2 2023 / Section A Q15 Chapter 3 Examples Q14 65/2/2 2023 / Section A Q16 Chapter 3 Examples Q15 65/2/1 2024 / Section A Q17 Chapter 3 Examples Q16 65/1/1 2024 / Section A Q18 65/3/1 2024 / Section A Q18