Skip to content
NCERT Exemplar · Q17

Q.Find A−1A^{-1} if A=(011101110)A = \begin{pmatrix} 0 & 1 & 1 \\ 1 & 0 & 1 \\ 1 & 1 & 0 \end{pmatrix} and show that A−1=A2−3I2A^{-1} = \dfrac{A^2 - 3I}{2}.

Sikkim CbseShort· 3mImportance★★★★★
66% · 97/146 Questions
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

Using the Cayley-Hamilton theorem, we find the characteristic equation of AA and use it to express A−1A^{-1} as a polynomial in AA. The inverse is A−1=12(A2−3I)A^{-1} = \frac{1}{2}(A^2 - 3I).

The problem asks us to find A−1A^{-1} and then verify a given expression. The direct approach — computing the inverse via cofactors or row reduction — would work, but the problem is clearly designed to illustrate a deeper idea: the Cayley-Hamilton theorem. This theorem says that every square matrix satisfies its own characteristic equation. That means we can replace the matrix AA in its characteristic polynomial and get the zero matrix. Once we have that polynomial, we can rearrange it to solve for A−1A^{-1} as a polynomial in AA — no messy fractions or cofactor expansions needed.

Let’s walk through it.


1. Find the characteristic polynomial of AA.

The characteristic polynomial is p(λ)=det⁡(A−λI)p(\lambda) = \det(A - \lambda I). For

A=(011101110),A = \begin{pmatrix} 0 & 1 & 1 \\ 1 & 0 & 1 \\ 1 & 1 & 0 \end{pmatrix},

we have

A−λI=(−λ111−λ111−λ).A - \lambda I = \begin{pmatrix} -\lambda & 1 & 1 \\ 1 & -\lambda & 1 \\ 1 & 1 & -\lambda \end{pmatrix}.

Compute the determinant. A neat trick: add all rows to the first row, or notice the pattern. Let’s do it systematically:

det⁡(A−λI)=(−λ)det⁡(−λ11−λ)−1⋅det⁡(111−λ)+1⋅det⁡(1−λ11).\det(A - \lambda I) = (-\lambda) \det\begin{pmatrix} -\lambda & 1 \\ 1 & -\lambda \end{pmatrix} - 1 \cdot \det\begin{pmatrix} 1 & 1 \\ 1 & -\lambda \end{pmatrix} + 1 \cdot \det\begin{pmatrix} 1 & -\lambda \\ 1 & 1 \end{pmatrix}.

Each 2×22\times2 determinant:

  • First: (−λ)(−λ)−(1)(1)=λ2−1(-\lambda)(-\lambda) - (1)(1) = \lambda^2 - 1.
  • Second: (1)(−λ)−(1)(1)=−λ−1(1)(-\lambda) - (1)(1) = -\lambda - 1.
  • Third: (1)(1)−(−λ)(1)=1+λ(1)(1) - (-\lambda)(1) = 1 + \lambda.

So

det⁡=(−λ)(λ2−1)−1(−λ−1)+1(1+λ).\det = (-\lambda)(\lambda^2 - 1) - 1(-\lambda - 1) + 1(1 + \lambda).

Simplify:

=−λ3+λ+λ+1+1+λ=−λ3+3λ+2.= -\lambda^3 + \lambda + \lambda + 1 + 1 + \lambda = -\lambda^3 + 3\lambda + 2.

Thus

p(λ)=−λ3+3λ+2.p(\lambda) = -\lambda^3 + 3\lambda + 2.

It’s often nicer to multiply by −1-1:

p(λ)=λ3−3λ−2.p(\lambda) = \lambda^3 - 3\lambda - 2.

Characteristic equation: λ3−3λ−2=0\lambda^3 - 3\lambda - 2 = 0.


2. Apply the Cayley-Hamilton theorem.

The theorem states that AA satisfies its own characteristic equation:

A3−3A−2I=0.A^3 - 3A - 2I = 0.

So

A3−3A=2I.A^3 - 3A = 2I.

We want A−1A^{-1}. Multiply both sides of A3−3A=2IA^3 - 3A = 2I by A−1A^{-1} (which exists because det⁡A≠0\det A \neq 0 — we’ll check later). That gives:

A2−3I=2A−1.A^2 - 3I = 2A^{-1}.

Therefore

A−1=12(A2−3I).A^{-1} = \frac{1}{2}(A^2 - 3I).

That’s exactly the expression we needed to show. So the second part is done — it follows directly from Cayley-Hamilton.

Tip

You don’t need to compute A−1A^{-1} by row reduction at all if you only need to verify the given formula. But the problem also asks to find A−1A^{-1}, so we should compute A2A^2 and then plug in.


3. Compute A2A^2 explicitly.

A2=(011101110)(011101110).A^2 = \begin{pmatrix} 0 & 1 & 1 \\ 1 & 0 & 1 \\ 1 & 1 & 0 \end{pmatrix} \begin{pmatrix} 0 & 1 & 1 \\ 1 & 0 & 1 \\ 1 & 1 & 0 \end{pmatrix}.

Compute entry by entry:

  • Row 1, Col 1: (0)(0)+(1)(1)+(1)(1)=0+1+1=2(0)(0) + (1)(1) + (1)(1) = 0 + 1 + 1 = 2.

  • Row 1, Col 2: (0)(1)+(1)(0)+(1)(1)=0+0+1=1(0)(1) + (1)(0) + (1)(1) = 0 + 0 + 1 = 1.

  • Row 1, Col 3: (0)(1)+(1)(1)+(1)(0)=0+1+0=1(0)(1) + (1)(1) + (1)(0) = 0 + 1 + 0 = 1.

  • Row 2, Col 1: (1)(0)+(0)(1)+(1)(1)=0+0+1=1(1)(0) + (0)(1) + (1)(1) = 0 + 0 + 1 = 1.

  • Row 2, Col 2: (1)(1)+(0)(0)+(1)(1)=1+0+1=2(1)(1) + (0)(0) + (1)(1) = 1 + 0 + 1 = 2.

  • Row 2, Col 3: (1)(1)+(0)(1)+(1)(0)=1+0+0=1(1)(1) + (0)(1) + (1)(0) = 1 + 0 + 0 = 1.

  • Row 3, Col 1: (1)(0)+(1)(1)+(0)(1)=0+1+0=1(1)(0) + (1)(1) + (0)(1) = 0 + 1 + 0 = 1.

  • Row 3, Col 2: (1)(1)+(1)(0)+(0)(1)=1+0+0=1(1)(1) + (1)(0) + (0)(1) = 1 + 0 + 0 = 1.

  • Row 3, Col 3: (1)(1)+(1)(1)+(0)(0)=1+1+0=2(1)(1) + (1)(1) + (0)(0) = 1 + 1 + 0 = 2.

So …

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.