SOLVER7 Study. Nothing Else.
Chapter 3 Examples Q14

If \(A= \left[ \begin{array}\text 1&0\\ 0&-1 \end{array} \right]\text and\ B=\left[ \begin{array}\text 0&1\\ 1&0\end{array} \right], \text then\ AB=\left[ \begin{array}\text 0&1\\ -1&0\end{array} \right] . \) \[and \ BA= \left[ \begin{array}\text 0&-1\\ 1&0\end{array} \right].Clearly\ AB\ne BA. \] Thus matrix multiplication is not commutative.

CBSE Class 12 Maths · Matrices

Solution

👶 Simple Explanation

Simple Explanation

Imagine putting on your socks and then your shoes — that is very different from putting on your shoes and then your socks! Matrices work the same way. When we multiply matrix \( A \) times matrix \( B \), we get one result. When we flip the order and multiply \( B \) times \( A \), we get a different result. The two answers are not equal, so swapping the order in matrix multiplication is not allowed the way it is with regular numbers.

Answer: \[ AB = \begin{bmatrix} 0 & 1 \\ -1 & 0 \end{bmatrix}, \quad BA = \begin{bmatrix} 0 & -1 \\ 1 & 0 \end{bmatrix} \] Since \( AB \ne BA \), matrix multiplication is not commutative.

📖 Matrix Multiplication is Not Commutative

Detailed Explanation

In ordinary numbers, multiplication is commutative, meaning \( a \times b = b \times a \). For matrices, this is generally NOT true. The product \( AB \) is usually different from \( BA \). To multiply two matrices, we take the dot product of each row of the first matrix with each column of the second matrix. Because the roles of the two matrices swap when we compute \( BA \) instead of \( AB \), the resulting entries change. This example proves the non-commutative nature of matrix multiplication by direct computation.

Formula Used

For \( 2 \times 2 \) matrices, \[ \begin{bmatrix} a & b \\ c & d \end{bmatrix} \begin{bmatrix} p & q \\ r & s \end{bmatrix} = \begin{bmatrix} ap+br & aq+bs \\ cp+dr & cq+ds \end{bmatrix} \]

Solution

  1. Step 1: Write down the given matrices clearly. \[ A = \begin{bmatrix} 1 & 0 \\ 0 & -1 \end{bmatrix}, \quad B = \begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix} \]
  2. Step 2: Compute \( AB \) by multiplying each row of \( A \) with each column of \( B \). \[ AB = \begin{bmatrix} 1 & 0 \\ 0 & -1 \end{bmatrix} \begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix} \] The entries are computed as: \[ (1)(0)+(0)(1)=0, \quad (1)(1)+(0)(0)=1 \] \[ (0)(0)+(-1)(1)=-1, \quad (0)(1)+(-1)(0)=0 \]
  3. Step 3: Collect the entries to get the product. \[ AB = \begin{bmatrix} 0 & 1 \\ -1 & 0 \end{bmatrix} \]
  4. Step 4: Now compute \( BA \), this time with \( B \) first and \( A \) second. \[ BA = \begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix} \begin{bmatrix} 1 & 0 \\ 0 & -1 \end{bmatrix} \] The entries are computed as: \[ (0)(1)+(1)(0)=0, \quad (0)(0)+(1)(-1)=-1 \] \[ (1)(1)+(0)(0)=1, \quad (1)(0)+(0)(-1)=0 \]
  5. Step 5: Collect the entries to get the product. \[ BA = \begin{bmatrix} 0 & -1 \\ 1 & 0 \end{bmatrix} \]
  6. Step 6: Compare the two results. \[ AB = \begin{bmatrix} 0 & 1 \\ -1 & 0 \end{bmatrix}, \quad BA = \begin{bmatrix} 0 & -1 \\ 1 & 0 \end{bmatrix} \] The off-diagonal signs are opposite, so \( AB \ne BA \). This shows matrix multiplication is not commutative.

Final Answer

\[ AB = \begin{bmatrix} 0 & 1 \\ -1 & 0 \end{bmatrix}, \quad BA = \begin{bmatrix} 0 & -1 \\ 1 & 0 \end{bmatrix} \] Since \( AB \ne BA \), matrix multiplication is not commutative.

Common Mistake

A common mistake is assuming \( AB = BA \) for matrices as with ordinary numbers, and computing only one product. Always compute both products separately and never swap the order of a matrix product carelessly.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the given matrices: \[A = \begin{bmatrix} 1 & 0 \\ 0 & -1 \end{bmatrix}, \quad B = \begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix}\] — Reason: Writing the matrices clearly before starting any computation prevents errors in picking up the wrong entries.
  2. Step 2: Set up the product \( AB \) by placing \( A \) on the left and \( B \) on the right: \[AB = \begin{bmatrix} 1 & 0 \\ 0 & -1 \end{bmatrix} \begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix}\] — Reason: The order matters in matrix multiplication; \( AB \) means rows of \( A \) dot with columns of \( B \).
  3. Step 3: Compute each entry of \( AB \) using the row-times-column rule. Row 1 of \( A \) with Column 1 of \( B \): \( (1)(0) + (0)(1) = 0 \). Row 1 of \( A \) with Column 2 of \( B \): \( (1)(1) + (0)(0) = 1 \). Row 2 of \( A \) with Column 1 of \( B \): \( (0)(0) + (-1)(1) = -1 \). Row 2 of \( A \) with Column 2 of \( B \): \( (0)(1) + (-1)(0) = 0 \). Collecting these: \[AB = \begin{bmatrix} 0 & 1 \\ -1 & 0 \end{bmatrix}\] — Reason: Each entry \( (i,j) \) of the product is the dot product of the \( i \)-th row of the first matrix with the \( j \)-th column of the second.
  4. Step 4: Now set up the reverse product \( BA \), placing \( B \) on the left and \( A \) on the right: \[BA = \begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix} \begin{bmatrix} 1 & 0 \\ 0 & -1 \end{bmatrix}\] — Reason: To test commutativity, we must compute the product in the swapped order and compare.
  5. Step 5: Compute each entry of \( BA \). Row 1 of \( B \) with Column 1 of \( A \): \( (0)(1) + (1)(0) = 0 \). Row 1 of \( B \) with Column 2 of \( A \): \( (0)(0) + (1)(-1) = -1 \). Row 2 of \( B \) with Column 1 of \( A \): \( (1)(1) + (0)(0) = 1 \). Row 2 of \( B \) with Column 2 of \( A \): \( (1)(0) + (0)(-1) = 0 \). Collecting these: \[BA = \begin{bmatrix} 0 & -1 \\ 1 & 0 \end{bmatrix}\] — Reason: Swapping the order of multiplication changes which rows pair with which columns, generally producing a different result.
  6. Step 6: Compare the two results: \[AB = \begin{bmatrix} 0 & 1 \\ -1 & 0 \end{bmatrix} \quad \text{and} \quad BA = \begin{bmatrix} 0 & -1 \\ 1 & 0 \end{bmatrix}\] Since the \( (1,2) \) entry of \( AB \) is \( 1 \) but that of \( BA \) is \( -1 \), and similarly the \( (2,1) \) entries differ, we conclude \( AB \ne BA \). — Reason: Two matrices are equal only when every corresponding entry is identical; even one differing entry is enough to declare them unequal.

Final Answer

\[ AB = \begin{bmatrix} 0 & 1 \\ -1 & 0 \end{bmatrix}, \quad BA = \begin{bmatrix} 0 & -1 \\ 1 & 0 \end{bmatrix} \] Since \( AB \ne BA \), matrix multiplication is not commutative.

Common Mistake

One common mistake: students sometimes assume \( AB = BA \) by analogy with number multiplication and skip computing \( BA \) altogether — always compute both products separately and compare entry by entry to verify commutativity.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Given: \[A = \begin{bmatrix} 1 & 0 \\ 0 & -1 \end{bmatrix}, \quad B = \begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix}\]
  2. Step 2: Compute \( AB \): \[AB = \begin{bmatrix} 1 & 0 \\ 0 & -1 \end{bmatrix}\begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix} = \begin{bmatrix} (1)(0)+(0)(1) & (1)(1)+(0)(0) \\ (0)(0)+(-1)(1) & (0)(1)+(-1)(0) \end{bmatrix} = \begin{bmatrix} 0 & 1 \\ -1 & 0 \end{bmatrix}\]
  3. Step 3: Compute \( BA \): \[BA = \begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix}\begin{bmatrix} 1 & 0 \\ 0 & -1 \end{bmatrix} = \begin{bmatrix} (0)(1)+(1)(0) & (0)(0)+(1)(-1) \\ (1)(1)+(0)(0) & (1)(0)+(0)(-1) \end{bmatrix} = \begin{bmatrix} 0 & -1 \\ 1 & 0 \end{bmatrix}\]

Answer: \[ AB = \begin{bmatrix} 0 & 1 \\ -1 & 0 \end{bmatrix}, \quad BA = \begin{bmatrix} 0 & -1 \\ 1 & 0 \end{bmatrix} \] Since \( AB \ne BA \), matrix multiplication is not commutative.

➕ More Examples

More Examples

Example 1

Question: Let \( A = \begin{bmatrix} 2 & 1 \\ 0 & 3 \end{bmatrix} \) and \( B = \begin{bmatrix} 1 & -1 \\ 2 & 0 \end{bmatrix} \). Compute \( AB \) and \( BA \), and verify that \( AB \ne BA \).

Solution: We compute \( AB \) first. \[ AB = \begin{bmatrix} 2 & 1 \\ 0 & 3 \end{bmatrix} \begin{bmatrix} 1 & -1 \\ 2 & 0 \end{bmatrix} \] Entry (1,1): \( (2)(1) + (1)(2) = 2 + 2 = 4 \) Entry (1,2): \( (2)(-1) + (1)(0) = -2 + 0 = -2 \) Entry (2,1): \( (0)(1) + (3)(2) = 0 + 6 = 6 \) Entry (2,2): \( (0)(-1) + (3)(0) = 0 + 0 = 0 \) Therefore: \[ AB = \begin{bmatrix} 4 & -2 \\ 6 & 0 \end{bmatrix} \] Now we compute \( BA \). \[ BA = \begin{bmatrix} 1 & -1 \\ 2 & 0 \end{bmatrix} \begin{bmatrix} 2 & 1 \\ 0 & 3 \end{bmatrix} \] Entry (1,1): \( (1)(2) + (-1)(0) = 2 + 0 = 2 \) Entry (1,2): \( (1)(1) + (-1)(3) = 1 - 3 = -2 \) Entry (2,1): \( (2)(2) + (0)(0) = 4 + 0 = 4 \) Entry (2,2): \( (2)(1) + (0)(3) = 2 + 0 = 2 \) Therefore: \[ BA = \begin{bmatrix} 2 & -2 \\ 4 & 2 \end{bmatrix} \] Comparing the two results: \[ AB = \begin{bmatrix} 4 & -2 \\ 6 & 0 \end{bmatrix} \ne \begin{bmatrix} 2 & -2 \\ 4 & 2 \end{bmatrix} = BA \] Since \( AB \ne BA \), matrix multiplication is not commutative.

Answer: \( AB = \begin{bmatrix} 4 & -2 \\ 6 & 0 \end{bmatrix} \), \( BA = \begin{bmatrix} 2 & -2 \\ 4 & 2 \end{bmatrix} \), and \( AB \ne BA \).

Example 2

Question: Let \( P = \begin{bmatrix} 0 & -1 \\ 1 & 0 \end{bmatrix} \) and \( Q = \begin{bmatrix} 1 & 2 \\ 3 & 4 \end{bmatrix} \). Compute \( PQ \) and \( QP \), and verify that matrix multiplication is not commutative.

Solution: We compute \( PQ \) first. \[ PQ = \begin{bmatrix} 0 & -1 \\ 1 & 0 \end{bmatrix} \begin{bmatrix} 1 & 2 \\ 3 & 4 \end{bmatrix} \] Entry (1,1): \( (0)(1) + (-1)(3) = 0 - 3 = -3 \) Entry (1,2): \( (0)(2) + (-1)(4) = 0 - 4 = -4 \) Entry (2,1): \( (1)(1) + (0)(3) = 1 + 0 = 1 \) Entry (2,2): \( (1)(2) + (0)(4) = 2 + 0 = 2 \) Therefore: \[ PQ = \begin{bmatrix} -3 & -4 \\ 1 & 2 \end{bmatrix} \] Now we compute \( QP \). \[ QP = \begin{bmatrix} 1 & 2 \\ 3 & 4 \end{bmatrix} \begin{bmatrix} 0 & -1 \\ 1 & 0 \end{bmatrix} \] Entry (1,1): \( (1)(0) + (2)(1) = 0 + 2 = 2 \) Entry (1,2): \( (1)(-1) + (2)(0) = -1 + 0 = -1 \) Entry (2,1): \( (3)(0) + (4)(1) = 0 + 4 = 4 \) Entry (2,2): \( (3)(-1) + (4)(0) = -3 + 0 = -3 \) Therefore: \[ QP = \begin{bmatrix} 2 & -1 \\ 4 & -3 \end{bmatrix} \] Comparing the two results: \[ PQ = \begin{bmatrix} -3 & -4 \\ 1 & 2 \end{bmatrix} \ne \begin{bmatrix} 2 & -1 \\ 4 & -3 \end{bmatrix} = QP \] Since \( PQ \ne QP \), this confirms that matrix multiplication is not commutative in general.

Answer: \( PQ = \begin{bmatrix} -3 & -4 \\ 1 & 2 \end{bmatrix} \), \( QP = \begin{bmatrix} 2 & -1 \\ 4 & -3 \end{bmatrix} \), and \( PQ \ne QP \).

🎯 Try a Similar Question

Try a Similar Question

Question: Let \(P = \begin{bmatrix} 2 & 1 \\ 0 & 3 \end{bmatrix}\) and \(Q = \begin{bmatrix} 1 & -1 \\ 2 & 0 \end{bmatrix}\). Compute \(PQ\) and \(QP\), and hence verify that matrix multiplication is not commutative.

Solution

  1. Step 1: Compute PQ: Multiply matrix P by matrix Q using the row-by-column rule. The (1,1) entry: \(2 \times 1 + 1 \times 2 = 2 + 2 = 4\) The (1,2) entry: \(2 \times (-1) + 1 \times 0 = -2 + 0 = -2\) The (2,1) entry: \(0 \times 1 + 3 \times 2 = 0 + 6 = 6\) The (2,2) entry: \(0 \times (-1) + 3 \times 0 = 0 + 0 = 0\) Therefore, \[PQ = \begin{bmatrix} 4 & -2 \\ 6 & 0 \end{bmatrix}\]
  2. Step 2: Compute QP: Now multiply matrix Q by matrix P. The (1,1) entry: \(1 \times 2 + (-1) \times 0 = 2 + 0 = 2\) The (1,2) entry: \(1 \times 1 + (-1) \times 3 = 1 - 3 = -2\) The (2,1) entry: \(2 \times 2 + 0 \times 0 = 4 + 0 = 4\) The (2,2) entry: \(2 \times 1 + 0 \times 3 = 2 + 0 = 2\) Therefore, \[QP = \begin{bmatrix} 2 & -2 \\ 4 & 2 \end{bmatrix}\]
  3. Step 3: Compare PQ and QP: We have \[PQ = \begin{bmatrix} 4 & -2 \\ 6 & 0 \end{bmatrix}\] and \[QP = \begin{bmatrix} 2 & -2 \\ 4 & 2 \end{bmatrix}\] Since the (1,1), (2,1), and (2,2) entries are different, clearly \(PQ \ne QP\). This confirms that matrix multiplication is not commutative.

Answer: \[PQ = \begin{bmatrix} 4 & -2 \\ 6 & 0 \end{bmatrix}, \quad QP = \begin{bmatrix} 2 & -2 \\ 4 & 2 \end{bmatrix}\] Since \(PQ \ne QP\), matrix multiplication is not commutative.

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 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 Chapter 3 Examples Q17