Matrix A represents a 90° counterclockwise rotation and matrix B represents a reflection across the x-axis. You want to apply the rotation FIRST and then the reflection. Which matrix product represents this composition?
AAB — A is applied first, so it appears first (leftmost) in the product
BBA — the first-applied transformation appears rightmost in the product
CA + B — composition corresponds to matrix addition
DEither AB or BA — matrix multiplication is commutative for rotations and reflections
For composition S ∘ T (apply T first, then S), the matrix product is BA where B is S's matrix and A is T's matrix. The rightmost matrix acts first, matching how function composition is written: S(T(x)) = B(Ax) = (BA)x. Option A is the most common error — students reason 'A goes first so it goes on the left,' which inverts the correct order. Option D is false: rotations and reflections generally do not commute.
Question 2 Multiple Choice
You compute AB and BA for two non-identity transformation matrices and find AB ≠ BA. A classmate argues this is a flaw in the definition of matrix multiplication. The correct response is:
AThey're right — matrix multiplication should be made commutative to match scalar algebra
BNon-commutativity is an error that only appears for certain matrix sizes
CNon-commutativity directly reflects that applying transformation A then B gives a different result than B then A — it is geometrically necessary
DThis only happens for non-square matrices; square matrices always commute
Non-commutativity is not a flaw — it honestly reflects that geometric transformations generally do not commute. 'Rotate then reflect' and 'reflect then rotate' produce different outcomes; the matrices encode this asymmetry faithfully. Option D is false: most square matrices do not commute. The non-commutativity is a feature of the definition, not a bug.
Question 3 True / False
Matrix multiplication is associative (A(BC) = (AB)C) because function composition is associative.
TTrue
FFalse
Answer: True
Since matrix multiplication encodes function composition, all algebraic properties of function composition carry over directly. Composing three transformations gives the same result regardless of which pair you compute first — as long as you preserve their order. This directly explains why (AB)C = A(BC): both compute 'apply C, then B, then A' on any input vector.
Question 4 True / False
If AB = BA for two matrices A and B, then A and B should represent the same transformation.
TTrue
FFalse
Answer: False
Commutativity (AB = BA) holds for some pairs of distinct matrices without them being equal. Any matrix commutes with the identity matrix I and with scalar multiples of itself. Two matrices can commute while being completely different transformations. Commutativity is a special algebraic relationship, not evidence of equality or geometric similarity.
Question 5 Short Answer
Why is the row-by-column dot product rule for matrix multiplication — which can seem arbitrary at first — actually the only sensible definition if matrices represent linear transformations?
Think about your answer, then reveal below.
Model answer: Matrix multiplication must encode function composition. If A represents transformation T and B represents transformation S, the matrix for S ∘ T must satisfy M·v = B(Av) for all vectors v. Working out what entries M must have to satisfy this constraint forces exactly the row-by-column dot product formula. The rule isn't arbitrary — it is the unique formula you would derive by demanding that sequential application of transformations be representable as a single matrix-vector product.
Students who memorize the row-by-column rule without this motivation find matrix multiplication mysterious. Understanding the geometric underpinning makes it inevitable: multiply the matrices in the right order, and the product automatically encodes whatever combined transformation results from applying them in sequence.