Class 12 Maths, Worked in Full Past papersGet updates
Chapter 3 · Matrices

Miscellaneous · Q11 (MCQ): (I+A)3−7A(I+A)^3-7A when A2=AA^2=A

Miscellaneous ExerciseProperties of matrix multiplication · Section 3.4.6
The question

If A is square matrix such that A2=AA^2 = A⁠, then (I+A)3−7A(I + A)^3 - 7A is equal to

(A) A
(B) I−AI - A
(C) I
(D) 3A

Exam answer (I+A)2=I+2A+A2=I+3A[A2=A](I+A)3=(I+3A)(I+A)=I+4A+3A2=I+7A\begin{aligned} (I + A)^2 &= I + 2A + A^2 \\ &= I + 3A \quad [A^2 = A] \\ (I + A)^3 &= (I + 3A)(I + A) \\ &= I + 4A + 3A^2 \\ &= I + 7A \end{aligned}

∴ (I+A)3−7A=I\therefore\ (I + A)^3 - 7A = I⁠.

Answer: (C) I

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

The one idea this problem is built on

Matrix products usually depend on order, but I commutes with everything: IA=AI=AIA = AI = A⁠. So I+AI + A can be multiplied out like an ordinary binomial. Then the condition A2=AA^2 = A collapses every power of A back to A (A3=A⋅A2=A⋅A=AA^3 = A\cdot A^2 = A\cdot A = A⁠). Expanding gives (I+A)3=I+7A(I + A)^3 = I + 7A⁠, and subtracting 7A7A leaves I.

Given, to find, and the plan
Given
A is an n×nn\times n matrix with A2=AA^2 = A⁠; I is the n×nn\times n identity.
To find
(I+A)3−7A(I + A)^3 - 7A⁠, and the matching option.
Plan
(1) Expand (I+A)2(I + A)^2 with the distributive law, then use A2=AA^2 = A⁠. (2) Multiply by I+AI + A once more. (3) Subtract 7A7A⁠. (4) Check with an actual matrix. (5) Examine every option.

Basics you need

1Identity matrix

For square A of order nn⁠, IA=AI=AIA = AI = A⁠, and I2=II^2 = I⁠. Basics: identity and undo

2Distributive law

X(Y+Z)=XY+XZX(Y + Z) = XY + XZ and (X+Y)Z=XZ+YZ(X + Y)Z = XZ + YZ⁠. The order inside each product must be kept. Lesson: properties of the operations

3Powers of a matrix

A2=AAA^2 = AA⁠, A3=AAAA^3 = AAA⁠; these are defined because A is square. Basics: pair up, multiply, add

4Scalars and matrices

A+A=2AA + A = 2A⁠, kA+lA=(k+l)AkA + lA = (k + l)A⁠, and a scalar can be moved through a product: A(3A)=3A2A(3A) = 3A^2⁠. Lesson: addition and scalar multiplication

Solution

  1. Expand (I+A)2(I + A)^2

    A and I are both n×nn\times n⁠, so I+AI + A is n×nn\times n and every product below is defined. By the distributive law (twice),

    (I+A)2=(I+A)(I+A)=I⋅I+I⋅A+A⋅I+A⋅A=I+A+A+A2=I+2A+A2.\begin{aligned} (I + A)^2 &= (I + A)(I + A) \\ &= I\cdot I + I\cdot A \\ &\qquad + A\cdot I + A\cdot A \\ &= I + A + A + A^2 \\ &= I + 2A + A^2. \end{aligned}

    Now use A2=AA^2 = A⁠:

    (I+A)2=I+2A+A=I+3A.(I + A)^2 = I + 2A + A = I + 3A.
    For general matrices X and Y, (X+Y)2=X2+XY+YX+Y2(X + Y)^2 = X^2 + XY + YX + Y^2⁠, and XYXY and YXYX can differ, so the familiar "2XY2XY" is not allowed in general. Here one of the two is I, and IA=AI=AIA = AI = A⁠, so the middle terms are both A and combine to 2A2A⁠.
    Distributive law and multiplicative identity, Section 3.4.6. Lesson: properties of the operations
  2. Multiply by I+AI + A once more

    (I+A)3=(I+A)2(I+A)=(I+3A)(I+A)=I⋅I+I⋅A+3A⋅I+3A⋅A=I+A+3A+3A2=I+4A+3A.\begin{aligned} (I + A)^3 &= (I + A)^2 (I + A) \\ &= (I + 3A)(I + A) \\ &= I\cdot I + I\cdot A \\ &\qquad + 3A\cdot I + 3A\cdot A \\ &= I + A + 3A + 3A^2 \\ &= I + 4A + 3A. \end{aligned}

    So

    (I+A)3=I+7A.(I + A)^3 = I + 7A.
    The fourth line uses 3A⋅A=3(AA)=3A23A\cdot A = 3(AA) = 3A^2 (a scalar factor comes out of a product), and then A2=AA^2 = A turns 3A23A^2 into 3A3A⁠. Writing (I+A)3=(I+A)2(I+A)(I + A)^3 = (I + A)^2(I + A) is allowed by associativity.
    Associative and distributive laws, Section 3.4.6. Lesson: properties of the operations
  3. Subtract 7A7A

    (I+A)3−7A=I+7A−7A=I.(I + A)^3 - 7A = I + 7A - 7A = I.

    So the expression always equals I, whatever idempotent matrix A is.

    The 7 in the question was chosen to cancel the 7A7A exactly. (A matrix with A2=AA^2 = A is called idempotent: squaring it changes nothing, so neither does any higher power.)
    7A−7A=O7A - 7A = O and I+O=II + O = I (Section 3.4.3). Lesson: addition and scalar multiplication
  4. Check with an actual matrix

    Take the matrix F below. Its square has entries 1⋅1+1⋅0=11\cdot1 + 1\cdot0 = 1⁠, 1⋅1+1⋅0=11\cdot1 + 1\cdot0 = 1⁠, 0⋅1+0⋅0=00\cdot1 + 0\cdot0 = 0 and 0⋅1+0⋅0=00\cdot1 + 0\cdot0 = 0⁠, so F2=FF^2 = F⁠.

    F=[1100],I+F=[2101]F = \begin{bmatrix} 1 & 1 \\ 0 & 0 \end{bmatrix}, \quad I + F = \begin{bmatrix} 2 & 1 \\ 0 & 1 \end{bmatrix}

    Square I+FI + F⁠, entry by entry:

    2⋅2+1⋅0=4,2⋅1+1⋅1=30⋅2+1⋅0=0,0⋅1+1⋅1=1\begin{aligned} 2\cdot2 + 1\cdot0 &= 4, \quad 2\cdot1 + 1\cdot1 = 3 \\ 0\cdot2 + 1\cdot0 &= 0, \quad 0\cdot1 + 1\cdot1 = 1 \end{aligned}

    so (I+F)2(I + F)^2 has rows (4,3)(4, 3) and (0,1)(0, 1)⁠, which is I+3FI + 3F ✓. Multiply by I+FI + F again:

    4⋅2+3⋅0=8,4⋅1+3⋅1=70⋅2+1⋅0=0,0⋅1+1⋅1=1\begin{aligned} 4\cdot2 + 3\cdot0 &= 8, \quad 4\cdot1 + 3\cdot1 = 7 \\ 0\cdot2 + 1\cdot0 &= 0, \quad 0\cdot1 + 1\cdot1 = 1 \end{aligned} (I+F)3=[8701]=I+7F(I + F)^3 = \begin{bmatrix} 8 & 7 \\ 0 & 1 \end{bmatrix} = I + 7F (I+F)3−7F=[8−77−70−01−0]=[1001]=I. ✓\begin{aligned} (I + F)^3 - 7F &= \begin{bmatrix} 8 - 7 & 7 - 7 \\ 0 - 0 & 1 - 0 \end{bmatrix} \\ &= \begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix} = I. \ ✓ \end{aligned}
    An example cannot prove the general result (Steps 1 to 3 do that), but it confirms the algebra, and it is exactly the kind of matrix we need to rule out the wrong options in the next step.
  5. Examine every option

    For the matrix F of Step 4 the expression equals I, so any option that is not I for this F is wrong.

    OptionValue for FVerdict
    (A)A =F= F⁠, rows (1,1)(1, 1)⁠, (0,0)(0, 0)Wrong: not I. (It would also need I+7A−7A=AI + 7A - 7A = A⁠, that is A=IA = I⁠.)
    (B)I−FI - F⁠, rows (0,−1)(0, -1)⁠, (0,1)(0, 1)Wrong: not I. (It equals I only when A=OA = O⁠.)
    (C)ICorrect, for every A with A2=AA^2 = A (Step 3).
    (D)3F3F⁠, rows (3,3)(3, 3)⁠, (0,0)(0, 0)Wrong: not I. (3A=I3A = I is impossible with A2=AA^2 = A⁠: it would give A=13IA = \frac13 I⁠, and then A2=19I≠AA^2 = \frac19 I \ne A⁠.)
    Options (A) and (B) do coincide with I for special idempotents (A=IA = I and A=OA = O respectively), which is why a single "nice" test matrix like I or O is not enough to separate the options. F is neither I nor O, and it rules out (A), (B) and (D) at once.
    A counterexample disproves a general claim. Lesson: properties of the operations
Result

The correct answer is (C): with A2=AA^2 = A⁠, (I+A)2=I+3A(I + A)^2 = I + 3A and (I+A)3=I+7A(I + A)^3 = I + 7A⁠, so (I+A)3−7A=I(I + A)^3 - 7A = I⁠. (Textbook answer: C.)

Check it with numbers

A second idempotent, E with rows (1,0)(1, 0) and (0,0)(0, 0)⁠: I+EI + E has diagonal 2,12, 1⁠, its cube has diagonal 8,18, 1⁠, and subtracting 7E7E (diagonal 7,07, 0⁠) leaves diagonal 1,11, 1⁠, that is I ✓. The trivial idempotents also give I: A=OA = O gives I3−O=II^3 - O = I⁠, and A=IA = I gives 8I−7I=I8I - 7I = I⁠. The verification script checks 200 random idempotent matrices of orders 1 to 4.

Common mistakes
  1. Using the binomial theorem without justification. (X+Y)3(X + Y)^3 expands like numbers only when XY=YXXY = YX⁠. Here it is fine because one term is I; say so.
  2. Forgetting to reduce powers: A2=AA^2 = A means A3=AA^3 = A too, since A3=A⋅A2=A⋅AA^3 = A\cdot A^2 = A\cdot A⁠.
  3. Testing only A=OA = O or A=IA = I. Each of those makes a wrong option look right.
What to take away
  1. I commutes with every square matrix of its order, so polynomials in A and I multiply out exactly like ordinary polynomials.
  2. For an idempotent A, every power AkA^k (k≥1k \ge 1⁠) equals A. In general (I+A)k=I+(2k−1)A(I + A)^k = I + (2^k - 1)A⁠; here k=3k = 3 gives 7A7A⁠.
  3. To rule out MCQ options, use an example that is not a special case such as O or I.

Every fact used, and where it comes from

FactUsed inSource
Associative and distributive laws; IA=AI=AIA = AI = ASteps 1, 2Section 3.4.6, properties 1 to 3 (Lesson: properties of the operations)
Scalar multiples and sums: kA+lA=(k+l)AkA + lA = (k + l)ASteps 1–3Section 3.4.4 (Lesson: addition and scalar multiplication)
Product entry formulaStep 4, CheckSection 3.4.5 (Lesson: matrix multiplication)
(I+A)k=I+(2k−1)A(I + A)^k = I + (2^k - 1)A for idempotent AWhat to take awayVerified for kk up to 8 in the site's verification script
All matrices and the random testsSteps 4, 5, CheckRecomputed with sympy 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 →