Concept:
Matrix multiplication is generally non-commutative, which means: \[ AB\neq BA \] for arbitrary square matrices \(A\) and \(B\).
However, some special matrices, such as diagonal matrices of the same order, commute under multiplication.
Step 1: Check Assertion (A)
Consider: \[ A= \begin{bmatrix} 0 & 1 \\ 0 & 0 \end{bmatrix}, \qquad B= \begin{bmatrix} 0 & 0 \\ 1 & 0 \end{bmatrix} \] Then: \[ AB= \begin{bmatrix} 1 & 0 \\ 0 & 0 \end{bmatrix} \] while: \[ BA= \begin{bmatrix} 0 & 0 \\ 0 & 1 \end{bmatrix} \] Therefore: \[ AB\neq BA \] Hence, Assertion (A) is true.
Step 2: Check Reason (R)
Let \(D_1\) and \(D_2\) be two diagonal matrices: \[ D_1= \begin{bmatrix} a & 0 \\ 0 & b \end{bmatrix}, \qquad D_2= \begin{bmatrix} c & 0 \\ 0 & d \end{bmatrix} \] Then: \[ D_1D_2= \begin{bmatrix} ac & 0 \\ 0 & bd \end{bmatrix} \] and: \[ D_2D_1= \begin{bmatrix} ca & 0 \\ 0 & db \end{bmatrix} \] Since \(ac=ca\) and \(bd=db\): \[ D_1D_2=D_2D_1 \] Hence, Reason (R) is true.
Step 3: Check whether R explains A
Reason (R) describes a special case in which matrix multiplication is commutative.
It does not explain why matrix multiplication is generally non-commutative.
Final Answer:
\[ \boxed{\text{Both A and R are true, but R is not the correct explanation of A.}} \]
Determine whether each of the following relations are reflexive, symmetric, and transitive.
Show that the relation R in the set R of real numbers, defined as
R = {(a, b): a ≤ b2 } is neither reflexive nor symmetric nor transitive.
Check whether the relation R defined in the set {1, 2, 3, 4, 5, 6} as
R = {(a, b): b = a + 1} is reflexive, symmetric or transitive.