Both are 3×4 with equal corresponding entries, so (AB)C=A(BC).
Want the reason behind every step, the basics and the checks?
The one idea this problem is built on
The associative law: when we multiply three matrices in a fixed order A,B,C, it does not matter which product we do first. (AB)C multiplies A and B first; A(BC) multiplies B and C first. The intermediate matrices are completely different (here AB is 3×2 and BC is 3×4), yet the final answers agree in every entry. The order of the letters stays A,B,C throughout; only the brackets move.
Given, to find, and the plan
Given
A of order 3×3,B of order 3×2,C of order 2×4.
To find / show
(AB)C and A(BC), and that they are equal.
Plan
Check every product is defined and track the orders. Compute AB, then (AB)C. Separately compute BC, then A(BC). Compare the two 3×4 results entry by entry.
Entry (i,k) of a product is row i of the first factor times column k of the second: pair, multiply, add. Basics: pair up, multiply, add
3The associative law
(AB)C=A(BC) whenever both sides are defined (stated in Section 3.4.6 without proof; this example checks it for particular matrices). Lesson: properties of the operations
Check that every product is defined and track the orders
Product
Orders
Inner sizes
Result
AB
(3×3)(3×2)
3=3
3×2
(AB)C
(3×2)(2×4)
2=2
3×4
BC
(3×2)(2×4)
2=2
3×4
A(BC)
(3×3)(3×4)
3=3
3×4
Both sides are defined and both are 3×4, so comparing them makes sense.
The associative law is stated "whenever both sides of the equality are defined", so checking this first is part of applying it. It also tells us how many entries to expect: 6 in AB, 12 in each of the others.
Each entry pairs a row of A (3 entries) with a column of B (3 entries), so each is a sum of three products. Writing each product with its sign before adding keeps track of the many negative entries.
Now the first factor is the matrix AB we just found. Its rows have 2 entries and the columns of C have 2 entries, so each entry is a sum of two products. The result is 3×4, as predicted in Step 1.
Compute BC
Now the other bracketing. Rows of B:[13],[02],[−14]. Columns of C as before. Write BC=[rik]. Row 1:
BC is 3×4, a completely different matrix from AB (which is 3×2). The associative law says that, even so, multiplying A onto it will land on the same final matrix.
Compute A(BC)
Rows of A as in Step 2. Columns of BC:(7,4,7),(2,0,−2),(−3,−4,−11),(−1,2,8). Write A(BC)=[sik]. Row 1, from [11−1]:
Each entry is now a sum of three products, because rows of A and columns of BC have 3 entries. The arithmetic is entirely different from Step 3 (for example q23=−3−36 but s23=−6+0−33), yet the totals agree.
Compare the two results
Both matrices are 3×4, and comparing the twelve entries of Step 3 with those of Step 5:
row 1: 4,4,4,−7 in bothrow 2: 35,−2,−39,22 in bothrow 3: 31,2,−27,11 in both
Same order and all corresponding entries equal, so (AB)C=A(BC).
This is what the definition of equal matrices requires: equal orders and qik=sik for every i,k. Checking all twelve, not just a few, is what makes the conclusion valid for these matrices.
The textbook states the associative law without proof, but the reason is short. Entry (i,l) of (AB)C is
k∑(j∑aijbjk)ckl=j∑k∑aijbjkckl,
and entry (i,l) of A(BC) is
j∑aij(k∑bjkckl)=j∑k∑aijbjkckl.
Both are the sum of aijbjkckl over every pair (j,k), just added up in a different order.
Real-number multiplication is associative and distributes over addition, and a finite sum can be added in any order. So the two double sums are equal for any matrices of compatible orders. Here j runs over 3 values and k over 2, so each entry is a sum of 6 triple products. For entry (2,3), the four terms with j=1 or j=3 are
2⋅1⋅3+2⋅3⋅(−2)+3⋅(−1)⋅3+3⋅4⋅(−2)=6−12−9−24=−39,
and the two terms with j=2 are 0 because a22=0.
Result
Both (AB)C and A(BC) equal the same 3×4 matrix:
435314−224−39−27−72211
with the intermediate products
AB=2−1111815BC=74720−2−3−4−11−128.
All of these agree with the textbook's solution.
Check it with numbers
Multiply both sides by the column (1,1,1,1), which simply adds up each row. Row sums of (AB)C:4+4+4−7=5,35−2−39+22=16, 31+2−27+11=17. Independently, C times (1,1,1,1) is (1+2+3−4,2+0−2+1)=(2,1); then B times (2,1) is (2+3,0+2,−2+4)=(5,2,2); then A times (5,2,2) has entries 5+2−2=5,10+0+6=16 and 15−2+4=17. The row sums match.
Common mistakes
Moving the letters instead of the brackets. Associativity allows (AB)C=A(BC), not (AB)C=(BA)C or A(CB). The order A,B,C never changes.
Expecting AB and BC to be alike. They have different orders here; only the final products agree.
Sign slips with three negatives. In s13,(−1)⋅(−11)=+11.
Checking a few entries only. Equality needs every entry; one unchecked entry could hide an error.
What to take away
For a product of three matrices, you may choose which pair to multiply first, as long as the left-to-right order stays the same.
Choosing well can save work. Counting single multiplications: (AB)C took 6×3=18 for AB and 12×2=24 for the product with C, 42 in all; A(BC) took 12×2=24 for BC and 12×3=36 for the product with A, 60 in all.
Because of associativity, a product like ABC or a power A3 has one meaning without brackets.
Real numbers: associative, distributive; finite sums in any order
Step 7
Arithmetic of real numbers
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 →