\(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
CBSE Class 12 Maths · Matrices
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.
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.
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.
The expression reduces to the \(3 \times 3\) zero matrix, so \(A^3 - 6A^2 + 7A + 2I = 0\) is proved.
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.
The expression reduces to the \(3 \times 3\) zero matrix, so \(A^3 - 6A^2 + 7A + 2I = 0\) is proved.
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.
Answer: The expression reduces to the \(3 \times 3\) zero matrix, so \(A^3 - 6A^2 + 7A + 2I = 0\) is proved.
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.
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.
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.
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.