Intuition What this page is for
The parent note told you how the operations are defined. This page makes sure you never meet a matrix problem you have not already seen. We first lay out a scenario matrix — a checklist of every case type — then work an example for each cell, forecasting the answer before we compute it.
Think of every matrix exercise as landing in one of these boxes. If you can do one example from each box, nothing on an exam is new.
Cell
Scenario
What makes it tricky
A
Compatible product A B , both nonzero
getting the row·column pairing right
B
Non-commutativity: compute A B and B A
showing they differ
C
Degenerate : multiplying by the zero matrix / identity
the "do nothing" and "collapse" cases
D
Zero divisors : A B = 0 with A = 0 , B = 0
the surprising box that breaks number-intuition
E
Transpose reversal ( A B ) ⊤ = B ⊤ A ⊤
order flips
F
Symmetric + skew split
the 2 1 trick, zero diagonal
G
Shape mismatch : when a product simply does not exist
reading dimensions
H
Limiting / repeated : powers A 2 , A 3 of a matrix
composition with itself
I
Word problem : matrices modelling something real
translating words to a grid
J
Exam twist : orthogonal matrix, verify A ⊤ A = I
length-preserving check
Every symbol below is built from scratch. A matrix is just a rectangular grid of numbers; an entry a ij sits in row i , column j (count rows top-to-bottom, columns left-to-right). The dot product of a row and a column means: multiply matching numbers and add them up — that single idea powers every product on this page. See it as sliding a horizontal strip onto a vertical strip:
A B
A = [ 2 0 − 1 3 ] , B = [ 1 2 4 − 2 ]
Forecast: before reading on, guess the top-left entry. It is row 1 of A = ( 2 , − 1 ) dotted with column 1 of B = ( 1 , 2 ) . Hold your guess.
Step 1 — check the shapes.
Why this step? A product only exists if the inner dimensions match: A is 2 × 2 , B is 2 × 2 , inner numbers are both 2 . ✓ Result is 2 × 2 .
Step 2 — entry ( 1 , 1 ) : row 1 · col 1.
2 ⋅ 1 + ( − 1 ) ⋅ 2 = 2 − 2 = 0
Why this step? Each output entry is one row met with one column; nothing else is combined.
Step 3 — remaining entries.
( 1 , 2 ) : 2 ⋅ 4 + ( − 1 ) ( − 2 ) = 8 + 2 = 10
( 2 , 1 ) : 0 ⋅ 1 + 3 ⋅ 2 = 6
( 2 , 2 ) : 0 ⋅ 4 + 3 ⋅ ( − 2 ) = − 6
A B = [ 0 6 10 − 6 ]
Verify: the ( 1 , 1 ) entry landed on 0 — a coincidence here, not a rule. Sanity check: row 2 of A starts with 0 , so both entries of row 2 of A B come only from the 3 : 3 ⋅ ( 2 , − 2 ) = ( 6 , − 6 ) . ✓ Matches.
B A for the same A , B
Forecast: will B A equal A B from Cell A? Guess "no" — but by how much?
Step 1 — entry ( 1 , 1 ) : row 1 of B · col 1 of A .
1 ⋅ 2 + 4 ⋅ 0 = 2
Why this step? Now B acts second-in-writing but first-in-action — the roles swapped, so we dot B 's rows with A 's columns.
Step 2 — finish.
( 1 , 2 ) : 1 ⋅ ( − 1 ) + 4 ⋅ 3 = 11 , ( 2 , 1 ) : 2 ⋅ 2 + ( − 2 ) ⋅ 0 = 4 , ( 2 , 2 ) : 2 ⋅ ( − 1 ) + ( − 2 ) ⋅ 3 = − 8
B A = [ 2 4 11 − 8 ]
Verify: A B = [ 0 6 10 − 6 ] = [ 2 4 11 − 8 ] = B A . Every single entry differs — concrete proof that "do B then A " = "do A then B ." Like socks-then-shoes.
Worked example Multiply by the identity and the zero matrix
Let I = [ 1 0 0 1 ] (the identity : 1's on the diagonal, 0's elsewhere) and 0 = [ 0 0 0 0 ] .
Forecast: I A = ? and 0 ⋅ A = ?
Step 1 — I A . Row 1 of I is ( 1 , 0 ) ; dotted with any column picks out only that column's first entry. So I hands each column back unchanged.
I A = [ 2 0 − 1 3 ] = A
Why this step? I is the "do nothing" transformation; multiplying changes nothing.
Step 2 — 0 ⋅ A . Every row of 0 is ( 0 , 0 ) ; every dot product is 0 .
0 ⋅ A = [ 0 0 0 0 ] = 0
Verify: I A = A ✓ and 0 A = 0 ✓ — the two degenerate limiting cases, matching the parent's "I A = A I = A ."
Worked example Two nonzero matrices whose product is zero
P = [ 1 0 0 0 ] , Q = [ 0 0 0 1 ]
Forecast: with ordinary numbers, ab = 0 forces a = 0 or b = 0 . Do you expect that here?
Step 1 — compute P Q .
( 1 , 1 ) : 1 ⋅ 0 + 0 ⋅ 0 = 0 , ( 1 , 2 ) : 1 ⋅ 0 + 0 ⋅ 1 = 0 , ( 2 , ⋅ ) : 0.
P Q = [ 0 0 0 0 ] = 0
Why this step? P keeps only the x -axis; Q keeps only the y -axis. Do Q first (survive on y ), then P (kill y ) — nothing survives.
Verify: P = 0 , Q = 0 , yet P Q = 0 . So the rule "A B = 0 ⇒ A = 0 or B = 0 " fails for matrices. These are zero divisors . This is exactly why you cannot cancel matrices unless they are invertible — see Determinant and Inverse of a Matrix .
Worked example Verify the reversal law
Use A , B from Cell A. The transpose A ⊤ flips the grid across its diagonal: ( A ⊤ ) ij = a j i .
Forecast: which order — A ⊤ B ⊤ or B ⊤ A ⊤ — matches ( A B ) ⊤ ?
Step 1 — transpose the answer. A B = [ 0 6 10 − 6 ] ⇒ ( A B ) ⊤ = [ 0 10 6 − 6 ] .
Step 2 — build B ⊤ A ⊤ .
B ⊤ = [ 1 4 2 − 2 ] , A ⊤ = [ 2 − 1 0 3 ]
B ⊤ A ⊤ = [ 1 ⋅ 2 + 2 ( − 1 ) 4 ⋅ 2 + ( − 2 ) ( − 1 ) 1 ⋅ 0 + 2 ⋅ 3 4 ⋅ 0 + ( − 2 ) 3 ] = [ 0 10 6 − 6 ]
Why this step? Transpose reverses roles and order — "socks and shoes": undo in reverse.
Verify: B ⊤ A ⊤ = ( A B ) ⊤ ✓. Try A ⊤ B ⊤ and you'd get [ 4 − 5 − 6 9 ] — wrong.
M into symmetric and skew-symmetric parts
M = [ 5 − 4 2 1 ]
A symmetric matrix satisfies S ⊤ = S (mirror across the diagonal); a skew-symmetric one satisfies K ⊤ = − K (forces zeros on the diagonal, since k ii = − k ii ).
Forecast: the diagonal of the skew part must be all zeros. Watch for it.
Step 1 — transpose. M ⊤ = [ 5 2 − 4 1 ] .
Step 2 — symmetric part 2 1 ( M + M ⊤ ) .
2 1 [ 10 − 2 − 2 2 ] = [ 5 − 1 − 1 1 ]
Why this step? Averaging M with its mirror forces s ij = s j i .
Step 3 — skew part 2 1 ( M − M ⊤ ) .
2 1 [ 0 − 6 6 0 ] = [ 0 − 3 3 0 ]
Verify: sum = [ 5 − 4 2 1 ] = M ✓; skew diagonal is 0 ✓. The trick always works because you added and subtracted the same 2 1 M ⊤ .
Worked example When is a product illegal?
C = [ 1 4 2 5 3 6 ] ( 2 × 3 ) , D = [ 7 9 8 0 ] ( 2 × 2 )
Forecast: does C D exist? Does D C exist?
Step 1 — test C D . Inner dimensions: C has 3 columns, D has 2 rows. 3 = 2 → no product .
Why this step? The dot product needs equal-length strips; C 's row has 3 entries, D 's column has 2. They cannot pair up.
Step 2 — test D C . D is 2 × 2 , C is 2 × 3 : inner 2 = 2 ✓, result 2 × 3 .
D C = [ 7 ⋅ 1 + 8 ⋅ 4 9 ⋅ 1 + 0 ⋅ 4 7 ⋅ 2 + 8 ⋅ 5 9 ⋅ 2 + 0 ⋅ 5 7 ⋅ 3 + 8 ⋅ 6 9 ⋅ 3 + 0 ⋅ 6 ] = [ 39 9 54 18 69 27 ]
Verify: D C is 2 × 3 as predicted ✓. Row 2 of D is ( 9 , 0 ) , so row 2 of D C is 9 ⋅ ( 1 , 2 , 3 ) = ( 9 , 18 , 27 ) ✓.
A 2 and A 3 for a shear
A = [ 1 0 1 1 ]
This is a shear : it slides points right by an amount equal to their height (see Linear Transformations ).
Forecast: guess A 2 . A shear applied twice should shear "twice as hard."
Step 1 — A 2 = A ⋅ A .
[ 1 ⋅ 1 + 1 ⋅ 0 0 1 ⋅ 1 + 1 ⋅ 1 1 ] = [ 1 0 2 1 ]
Why this step? A 2 means "do the shear, then the shear again" — composition.
Step 2 — A 3 = A 2 ⋅ A .
[ 1 0 2 1 ] [ 1 0 1 1 ] = [ 1 0 3 1 ]
Verify: the top-right entry counts how many shears — A n = [ 1 0 n 1 ] . So A 3 has 3 ✓. Limiting picture: as n → ∞ the shear grows without bound.
Worked example Two shops, two products
Shop sells prices (in ₹) pen = 10 , book = 50 , stored as a row P = [ 10 50 ] . Monday–Tuesday quantities sold are columns of
Q = [ 3 1 5 2 ] ← pens ← books
Forecast: what does P Q mean, and what shape is it?
Step 1 — shapes. P is 1 × 2 , Q is 2 × 2 , inner 2 = 2 ✓ → result 1 × 2 : one revenue number per day.
Why this step? Matching inner dimensions guarantees each day's price·quantity dot product has the right number of terms — this is a dot product in disguise.
Step 2 — compute.
P Q = [ 10 ⋅ 3 + 50 ⋅ 1 10 ⋅ 5 + 50 ⋅ 2 ] = [ 80 150 ]
Verify (units): ₹/pen × pens + ₹/book × books = ₹. Monday: 30 + 50 = ₹80 ; Tuesday: 50 + 100 = ₹150 ✓. The matrix packaged the whole revenue calculation into one product.
Worked example Is this rotation matrix orthogonal?
R = [ cos θ sin θ − sin θ cos θ ]
A matrix is orthogonal when R ⊤ R = I ; such maps preserve lengths — pure rotations/reflections (central in Eigenvalues and Eigenvectors ).
Forecast: guess the product R ⊤ R before expanding — should it be I ?
Step 1 — build R ⊤ R . R ⊤ = [ cos θ − sin θ sin θ cos θ ] .
( 1 , 1 ) : cos 2 θ + sin 2 θ , ( 1 , 2 ) : − cos θ sin θ + sin θ cos θ , …
Why this step? Each entry is a dot product of two columns of R ; orthogonality means columns are unit-length and perpendicular.
Step 2 — simplify using cos 2 θ + sin 2 θ = 1 .
R ⊤ R = [ 1 0 0 1 ] = I
Verify (numeric, θ = 3 0 ∘ ): cos 3 0 ∘ = 2 3 , sin 3 0 ∘ = 2 1 . Then ( 1 , 1 ) = 4 3 + 4 1 = 1 ✓ and the off-diagonal − 2 3 ⋅ 2 1 + 2 1 ⋅ 2 3 = 0 ✓. Rotation preserves length as expected.
Recall Which cell was which?
Every product exists only when ::: the inner dimensions match (columns of first = rows of second).
The box that breaks number-intuition ::: zero divisors, P Q = 0 with P , Q = 0 (Cell D).
Transpose of a product ::: reverses order: ( A B ) ⊤ = B ⊤ A ⊤ (Cell E).
Skew part always has ::: a zero diagonal (Cell F).
A n for the shear [ 1 0 1 1 ] ::: [ 1 0 n 1 ] (Cell H).
Orthogonal test ::: R ⊤ R = I (Cell J).
"Shapes first, dot second, order never assumed." Check dimensions, take row·column dot products, and never assume A B = B A or that A B = 0 means a factor is zero.