Skip to content
Exercise 3.2 · Q14

Q.Show that

(i) [5−167][2134]≠[2134][5−167]\begin{bmatrix} 5 & -1 \\ 6 & 7 \end{bmatrix} \begin{bmatrix} 2 & 1 \\ 3 & 4 \end{bmatrix} \neq \begin{bmatrix} 2 & 1 \\ 3 & 4 \end{bmatrix} \begin{bmatrix} 5 & -1 \\ 6 & 7 \end{bmatrix}
(ii) [123010110][−1100−11234]≠[−1100−11234][123010110]\begin{bmatrix} 1 & 2 & 3 \\ 0 & 1 & 0 \\ 1 & 1 & 0 \end{bmatrix} \begin{bmatrix} -1 & 1 & 0 \\ 0 & -1 & 1 \\ 2 & 3 & 4 \end{bmatrix} \neq \begin{bmatrix} -1 & 1 & 0 \\ 0 & -1 & 1 \\ 2 & 3 & 4 \end{bmatrix} \begin{bmatrix} 1 & 2 & 3 \\ 0 & 1 & 0 \\ 1 & 1 & 0 \end{bmatrix}
Uttarakhand UbseTextbookSubjective· 3mImportance★★★★★est
15% · 27/182 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 →

Matrix multiplication is not commutative — swapping the order of two matrices almost always changes the product. For the given pairs, computing both orders shows they yield different matrices, confirming AB≠BAAB \neq BA.

Why Matrix Multiplication Isn't Like Number Multiplication

When you multiply two numbers, 3×53 \times 5 always equals 5×35 \times 3. But matrices are different. Each entry in a matrix product is a dot product of a row from the first matrix with a column from the second. Swap the matrices, and you're pairing entirely different rows with entirely different columns — so the result changes.

This is the core idea: compatibility for multiplication requires the number of columns in the first matrix to equal the number of rows in the second. When you reverse the order, that condition may still hold (as it does here), but the actual arithmetic is completely different.


Part (i): 2×22 \times 2 Matrices

Let

A=[5−167]A = \begin{bmatrix} 5 & -1 \\ 6 & 7 \end{bmatrix},

B=[2134]B = \begin{bmatrix} 2 & 1 \\ 3 & 4 \end{bmatrix}.

Both are 2×22 \times 2, so ABAB and BABA are both defined and also 2×22 \times 2.

Step 1: Compute ABAB

Multiply AA (rows) by BB (columns):

  • Entry (1,1)(1,1): row 1 of AA ⋅\cdot column 1 of BB =(5)(2)+(−1)(3)=10−3=7= (5)(2) + (-1)(3) = 10 - 3 = 7
  • Entry (1,2)(1,2): row 1 of AA ⋅\cdot column 2 of BB =(5)(1)+(−1)(4)=5−4=1= (5)(1) + (-1)(4) = 5 - 4 = 1
  • Entry (2,1)(2,1): row 2 of AA ⋅\cdot column 1 of BB =(6)(2)+(7)(3)=12+21=33= (6)(2) + (7)(3) = 12 + 21 = 33
  • Entry (2,2)(2,2): row 2 of AA ⋅\cdot column 2 of BB =(6)(1)+(7)(4)=6+28=34= (6)(1) + (7)(4) = 6 + 28 = 34

So

AB=[713334]AB = \begin{bmatrix} 7 & 1 \\ 33 & 34 \end{bmatrix}.

Step 2: Compute BABA

Now multiply BB (rows) by AA (columns):

  • Entry (1,1)(1,1): row 1 of BB ⋅\cdot column 1 of AA =(2)(5)+(1)(6)=10+6=16= (2)(5) + (1)(6) = 10 + 6 = 16
  • Entry (1,2)(1,2): row 1 of BB ⋅\cdot column 2 of AA =(2)(−1)+(1)(7)=−2+7=5= (2)(-1) + (1)(7) = -2 + 7 = 5
  • Entry (2,1)(2,1): row 2 of BB ⋅\cdot column 1 of AA =(3)(5)+(4)(6)=15+24=39= (3)(5) + (4)(6) = 15 + 24 = 39
  • Entry (2,2)(2,2): row 2 of BB ⋅\cdot column 2 of AA =(3)(−1)+(4)(7)=−3+28=25= (3)(-1) + (4)(7) = -3 + 28 = 25

So

BA=[1653925]BA = \begin{bmatrix} 16 & 5 \\ 39 & 25 \end{bmatrix}.

Step 3: Compare

AB=[713334]AB = \begin{bmatrix} 7 & 1 \\ 33 & 34 \end{bmatrix}

BA=[1653925]BA = \begin{bmatrix} 16 & 5 \\ 39 & 25 \end{bmatrix}

Every single entry is different. Clearly AB≠BAAB \neq BA.

Watch out

A common mistake is to assume that because both products are defined, they must be equal. But even for 2×22 \times 2 matrices, the only time AB=BAAB = BA is for very special pairs (like when one is a scalar multiple of the identity). Don't assume commutativity — always compute.


Part (ii): 3×33 \times 3 Matrices

Let

P=[123010110]P = \begin{bmatrix} 1 & 2 & 3 \\ 0 & 1 & 0 \\ 1 & 1 & 0 \end{bmatrix},

Q=[−1100−11234]Q = \begin{bmatrix} -1 & 1 & 0 \\ 0 & -1 & 1 \\ 2 & 3 & 4 \end{bmatrix}.

Both are 3×33 \times 3, so PQPQ and QPQP are both 3×33 \times 3.

Step 1: Compute PQPQ

Multiply PP (rows) by QQ (columns). We'll do it entry by entry.

Row 1 of PP: [1,2,3][1, 2, 3]

  • Column 1 of QQ: [−1,0,2]T[-1, 0, 2]^T (1)(−1)+(2)(0)+(3)(2)=−1+0+6=5(1)(-1) + (2)(0) + (3)(2) = -1 + 0 + 6 = 5
  • Column 2 of QQ: [1,−1,3]T[1, -1, 3]^T (1)(1)+(2)(−1)+(3)(3)=1−2+9=8(1)(1) + (2)(-1) + (3)(3) = 1 - 2 + 9 = 8
  • Column 3 of QQ: [0,1,4]T[0, 1, 4]^T (1)(0)+(2)(1)+(3)(4)=0+2+12=14(1)(0) + (2)(1) + (3)(4) = 0 + 2 + 12 = 14

Row 2 of PP: [0,1,0][0, 1, 0]

  • Column 1: (0)(−1)+(1)(0)+(0)(2)=0(0)(-1) + (1)(0) + (0)(2) = 0
  • Column 2: (0)(1)+(1)(−1)+(0)(3)=−1(0)(1) + (1)(-1) + (0)(3) = -1
  • Column 3: (0)(0)+(1)(1)+(0)(4)=1(0)(0) + (1)(1) + (0)(4) = 1

Row 3 of PP: [1,1,0][1, 1, 0]

  • Column 1: (1)(−1)+(1)(0)+(0)(2)=−1(1)(-1) + (1)(0) + (0)(2) = -1
  • Column 2: (1)(1)+(1)(−1)+(0)(3)=1−1=0(1)(1) + (1)(-1) + (0)(3) = 1 - 1 = 0
  • Column 3: (1)(0)+(1)(1)+(0)(4)=1(1)(0) + (1)(1) + (0)(4) = 1

So

PQ=[58140−11−101]PQ = \begin{bmatrix} 5 & 8 & 14 \\ 0 & -1 & 1 \\ -1 & 0 & 1 \end{bmatrix}.

Step 2: Compute QPQP

Now multiply QQ (rows) by PP (columns).

Row 1 of QQ: [−1,1,0][-1, 1, 0]

  • Column 1 of PP: [1,0,1]T[1, 0, 1]^T …

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.