Intuition What this page is for
The parent note gave you the rules (swap flips sign, scale multiplies, replacement does nothing, and det ( A B ) = det A det B ). Rules are easy to nod along to and easy to misapply the moment a case looks unfamiliar. So here we hunt down every kind of situation these rules can appear in — good signs, bad signs, zeros, degenerate matrices, limiting cases, a word problem, and an exam trap — and we crush each one with a full worked example.
Before each solution you will see a Forecast line. Cover the steps, guess the answer, then read on. That guess is where the learning happens.
This deep dive builds on the parent properties note and leans on the cofactor/Leibniz definition , Gaussian Elimination & Row Echelon Form , Elementary Matrices , Invertibility & Singular Matrices , and Volume, Orientation & the Determinant .
Every worked example below reduces a matrix to triangular form and reads off the answer with one master formula . Two little symbols do all the bookkeeping — let us define them once, in plain words, before we use them anywhere.
Definition The swap-count
s and the scale-product ∏ k
== s == is simply the number of row swaps you perform during the reduction. Count them on your fingers: each time you exchange two rows, add 1 to s . Because a single swap multiplies the determinant by − 1 (parent Rule 1), doing s of them multiplies it by ( − 1 ) s — which is + 1 for an even count and − 1 for an odd count.
== ∏ k == (read "the product of all the k 's") is the product of every scaling factor k you used when you did an operation of the form R i → k R i . If you scaled one row by 3 1 and another by 2 , then ∏ k = 3 1 ⋅ 2 = 3 2 . If you never scaled a row, there are no factors to multiply, so by convention ∏ k = 1 . Because scaling a row by k multiplies the determinant by k (parent Rule 2), scaling several rows multiplies it by their product ∏ k .
Careful — what does NOT count. A replacement R i → R i + k R j (adding a multiple of another row) is not a scaling: it leaves the determinant unchanged, so its k is never collected into ∏ k and never touches s . Only the standalone move R i → k R i feeds ∏ k .
With those two symbols nailed down, every example is just careful counting.
Every determinant computation you will ever meet lands in one of these cells. The whole point of this page is to make sure not one cell is left dark .
#
Case class
What makes it tricky
Covered by
C1
Pure replacement to triangular, no swap/scale
Bookkeeping: prove nothing was lost
Ex 1
C2
A swap appears → sign bookkeeping
Off-by-one on the ( − 1 ) s factor
Ex 2
C3
You scale a row to get a pivot 1 → must divide back
Forgetting to undo the scale
Ex 3
C4
Degenerate / singular input → det = 0
Recognising a zero pivot appears
Ex 4
C5
Sign / orientation case → negative determinant, flipped area
Reading the minus sign as "area got mirrored"
Ex 5 (figure)
C6
Multiplicativity with mixed signs det A < 0 < det B
Signs multiply, they don't add
Ex 6
C7
Scalar multiple of whole matrix det ( k A ) = k n det A , incl. negative k
The exponent is n , and k can be negative
Ex 7
C8
Inverse / power corollaries, incl. a limiting "almost singular" matrix
det A − 1 = 1/ det A blows up as det A → 0
Ex 8
C9
Word problem — real-world area scaling
Translating geometry into a determinant
Ex 9 (figure)
C10
Exam twist — combine swap + scale + multiplicativity in one shot
Doing all bookkeeping simultaneously
Ex 10
Read the table top-to-bottom once. Each row is a promise; the ten examples keep them all.
Compute det A for
A = 1 2 3 2 5 7 − 1 1 2
using only replacement operations (R i → R i + k R j ).
Forecast: Since replacement never changes the determinant, the answer will just be the product of the pivots we reach — guess whether it is positive or negative before reading on.
Step 1. R 2 → R 2 − 2 R 1 , R 3 → R 3 − 3 R 1 .
Why this step? Replacement leaves det exactly unchanged (it adds a term with two equal rows, which is 0 ), so it is the one "free" move. We use it to zero out the first column below the pivot.
→ 1 0 0 2 1 1 − 1 3 5
Step 2. R 3 → R 3 − R 2 .
Why this step? Same free move, now clearing the entry below the second pivot to reach upper-triangular form.
→ 1 0 0 2 1 0 − 1 3 2
Step 3. For a triangular matrix, det = product of the diagonal. We used only replacements, so the swap-count is s = 0 and there were no row-scalings, giving ∏ k = 1 . The master formula then reads
det A = ( − 1 ) 0 ⋅ 1 1 ⋅ ( 1 ⋅ 1 ⋅ 2 ) = 2.
Verify: Let us cofactor-expand along column 1 and deliberately show the trap first. A tempting shortcut is to write only the top entry's term, 1 ⋅ ( 5 ⋅ 2 − 1 ⋅ 7 ) = 1 ⋅ 3 = 3 — this is wrong , because it silently drops the two other cofactor terms coming from the 2 and the 3 in column 1 (they are not zero in the original A ; only after reduction were those entries zeroed). The honest full expansion keeps all three terms:
1 ( 5 ⋅ 2 − 1 ⋅ 7 ) − 2 ( 2 ⋅ 2 − 1 ⋅ 3 ) + ( − 1 ) ( 2 ⋅ 7 − 5 ⋅ 3 ) = 1 ( 3 ) − 2 ( 1 ) − 1 ( − 1 ) = 3 − 2 + 1 = 2.
So the correct value is 2 , matching the reduction. ✓
Compute det B for
B = 0 1 2 2 1 3 1 0 1
Forecast: The top-left entry is 0 , so we must swap to get a usable pivot. One swap means one factor of − 1 . Predict the sign of your final answer.
Step 1. Swap R 1 ↔ R 2 .
Why this step? You cannot pivot on a 0 . A swap fixes it, at the known cost of multiplying det by − 1 (from Rule 1). This is our first (and only) swap, so the swap-count is now s = 1 .
→ 1 0 2 1 2 3 0 1 1
Step 2. R 3 → R 3 − 2 R 1 (free replacement).
→ 1 0 0 1 2 1 0 1 1
Step 3. R 3 → R 3 − 2 1 R 2 (free replacement — note this is not a scaling of a row by itself , it is adding a multiple of R 2 to R 3 , so det is untouched and it feeds neither s nor ∏ k ).
→ 1 0 0 1 2 0 0 1 2 1
Step 4. Pivots product = 1 ⋅ 2 ⋅ 2 1 = 1 . No scalings so ∏ k = 1 ; apply the swap factor ( − 1 ) s = ( − 1 ) 1 :
det B = ( − 1 ) 1 ⋅ 1 1 ⋅ 1 = − 1.
Verify: Leibniz directly: 0 ( 1 ⋅ 1 − 0 ⋅ 3 ) − 2 ( 1 ⋅ 1 − 0 ⋅ 2 ) + 1 ( 1 ⋅ 3 − 1 ⋅ 2 ) = 0 − 2 ( 1 ) + 1 ( 1 ) = − 1. ✓
Common mistake Off-by-one on swaps
If you swap twice , the factor is ( − 1 ) 2 = + 1 , not − 2 . The sign toggles; it does not accumulate additively.
Compute det C where
C = 3 1 0 6 2 1 9 5 4
while deliberately scaling R 1 to make its pivot 1 (so you can practise undoing it).
Forecast: If you multiply a row by 3 1 you divide the whole determinant by 3 , so at the end you must multiply back by 3 . Guess: does the final det come out as a multiple of 3 ?
Step 1. R 1 → 3 1 R 1 .
Why this step? A clean leading 1 simplifies the arithmetic — but scaling a row by 3 1 multiplies det by 3 1 (Rule 2). This is a genuine row-scaling, so it feeds the scale-product: ∏ k = 3 1 . By the master formula we will divide det U by this ∏ k , i.e. multiply by 3 at the end.
→ 1 1 0 2 2 1 3 5 4
Step 2. R 2 → R 2 − R 1 (free replacement).
→ 1 0 0 2 0 1 3 2 4
Step 3. The second pivot is now 0 . Swap R 2 ↔ R 3 ; this is our first swap, so the swap-count is s = 1 .
→ 1 0 0 2 1 0 3 4 2
Step 4. Triangular: pivots product det U = 1 ⋅ 1 ⋅ 2 = 2 . Assemble the master formula det C = ( − 1 ) s ⋅ ∏ k 1 ⋅ det U with s = 1 and ∏ k = 3 1 :
det C = ( − 1 ) 1 ⋅ 1/3 1 ⋅ 2 = ( − 1 ) ⋅ 3 ⋅ 2 = − 6.
Verify: Direct Leibniz on C : 3 ( 2 ⋅ 4 − 5 ⋅ 1 ) − 6 ( 1 ⋅ 4 − 5 ⋅ 0 ) + 9 ( 1 ⋅ 1 − 2 ⋅ 0 ) = 3 ( 3 ) − 6 ( 4 ) + 9 ( 1 ) = 9 − 24 + 9 = − 6. ✓
Mnemonic Divide-back rule
"Scale by c , pay it back." If you did R i → c 1 R i , your working determinant is c 1 too small, so multiply the final answer by c .
Compute det D for
D = 1 2 5 2 4 0 3 6 1
Forecast: Look hard at rows R 1 and R 2 before computing. See it? Predict the answer with no arithmetic .
Step 1. Notice R 2 = 2 R 1 exactly.
Why this step? If one row is a scalar multiple of another, the matrix is singular — its rows are linearly dependent, so the parallelepiped they span is squashed flat (zero volume). We can confirm mechanically:
Step 2. R 2 → R 2 − 2 R 1 (free replacement).
→ 1 0 5 2 0 0 3 0 1
A zero row appears. By multilinearity, scaling that zero row by any k leaves it a zero row, yet must multiply det by k ; the only number unchanged by every k is 0 . Hence
det D = 0.
Verify: Leibniz: 1 ( 4 ⋅ 1 − 6 ⋅ 0 ) − 2 ( 2 ⋅ 1 − 6 ⋅ 5 ) + 3 ( 2 ⋅ 0 − 4 ⋅ 5 ) = 1 ( 4 ) − 2 ( − 28 ) + 3 ( − 20 ) = 4 + 56 − 60 = 0. ✓
The matrix M = ( 0 1 1 0 ) maps the unit square to a new shape. Find det M and say what the sign means geometrically .
Forecast: M sends ( 1 , 0 ) ↦ ( 0 , 1 ) and ( 0 , 1 ) ↦ ( 1 , 0 ) — it swaps the axes. Guess the area factor and its sign before reading.
Step 1. M is one row swap away from I : swap R 1 ↔ R 2 gives I , whose det = 1 .
Why this step? det I = 1 is the normalization axiom, and a single swap (s = 1 ) multiplies by ( − 1 ) 1 .
det M = ( − 1 ) 1 ⋅ 1 = − 1.
Step 2. Interpret the sign. ∣ det M ∣ = 1 means area is preserved . The minus sign means orientation flipped — the image is a mirror reflection of the original, as if the square were turned over. In the figure, watch the corner-labels P , Q , R go clockwise after the map though they were counter-clockwise before.
Figure — what to observe: On the LEFT, the teal unit square has its corners O → P → Q → R traced counter-clockwise (the purple arrow curls CCW). On the RIGHT, after applying M , the very same corner labels now trace out clockwise (the purple arrow curls CW), even though the shape has the same size. That reversal of the go-round direction is exactly what a negative determinant looks like — the plane has been flipped over like a pancake, not merely rotated.
Verify: Leibniz 2 × 2 : 0 ⋅ 0 − 1 ⋅ 1 = − 1. ✓
A = ( 1 3 2 4 ) (so det A = − 2 ) and B = ( 2 0 1 3 ) (so det B = 6 ). Compute det ( A B ) two ways.
Forecast: One determinant is negative, one positive. Do they add or multiply? Predict the sign of det ( A B ) .
Step 1. Multiply the matrices.
Why this step? We want det ( A B ) the "honest" way first, to check the shortcut.
A B = ( 1 ⋅ 2 + 2 ⋅ 0 3 ⋅ 2 + 4 ⋅ 0 1 ⋅ 1 + 2 ⋅ 3 3 ⋅ 1 + 4 ⋅ 3 ) = ( 2 6 7 15 ) .
Step 2. det ( A B ) = 2 ⋅ 15 − 7 ⋅ 6 = 30 − 42 = − 12.
Step 3. Shortcut via multiplicativity: det A ⋅ det B = ( − 2 ) ( 6 ) = − 12.
Why this works: each map scales signed area, and stacking maps multiplies those factors (a flip times a non-flip is still a flip → negative).
Verify: Both routes give − 12 , and ( − 2 ) ( 6 ) = − 12 . ✓
det ( A + B ) = det A + det B "
Signs multiply through products, they do not add through sums. det ( A + B ) has no such rule (try A = B = I 2 : det 2 I = 4 = 2 ).
For a 3 × 3 matrix A with det A = 5 , compute (a) det ( 2 A ) and (b) det ( − A ) .
Forecast: The scalar hits all three rows. Guess the exponent, and be careful: − A means k = − 1 .
Step 1 (a). det ( 2 A ) = 2 3 det A .
Why this step? 2 A scales every one of the n = 3 rows by 2 ; each scaling pulls out a factor 2 (Rule 2), giving 2 n .
det ( 2 A ) = 8 ⋅ 5 = 40.
Step 2 (b). det ( − A ) = ( − 1 ) 3 det A .
Why this step? − A = ( − 1 ) A , so k = − 1 and n = 3 : ( − 1 ) 3 = − 1 .
det ( − A ) = ( − 1 ) ⋅ 5 = − 5.
Limit sanity: for even n , ( − 1 ) n = + 1 , so det ( − A ) = det A ; for odd n it flips. Our n = 3 is odd → flip. ✓
Verify: 2 3 ⋅ 5 = 40 and ( − 1 ) 3 ⋅ 5 = − 5 . ✓
Let A = ( 2 1 1 ε ) . (a) Find det A . (b) Find det ( A − 1 ) and det ( A 3 ) for ε = 1 . (c) Describe what happens to det ( A − 1 ) as ε → 2 1 .
Forecast: det ( A − 1 ) = 1/ det A . What must happen to 1/ det A when det A heads toward 0 ?
Step 1. det A = 2 ε − 1 ⋅ 1 = 2 ε − 1.
Why this step? For a 2 × 2 matrix ( a c b d ) the Leibniz/cofactor definition gives det = a d − b c — the two "diagonal products" minus the two "anti-diagonal products". Here a = 2 , b = 1 , c = 1 , d = ε , so det A = 2 ε − 1 .
Step 2 (b), ε = 1 . det A = 2 ( 1 ) − 1 = 1. Then
det ( A − 1 ) = d e t A 1 = 1 1 = 1 , det ( A 3 ) = ( det A ) 3 = 1 3 = 1.
Why: det ( A − 1 ) = 1/ det A comes from det A ⋅ det A − 1 = det I = 1 ; det ( A k ) = ( det A ) k by iterating multiplicativity.
Step 3 (c), the limit — sign matters. Write det A = 2 ε − 1 , so det ( A − 1 ) = 2 ε − 1 1 . As ε → 2 1 the denominator → 0 , and its sign depends on which side you approach from :
If ε ↓ 2 1 (from above , ε > 2 1 ), then 2 ε − 1 > 0 and tiny, so det ( A − 1 ) → + ∞ .
If ε ↑ 2 1 (from below , ε < 2 1 ), then 2 ε − 1 < 0 and tiny, so det ( A − 1 ) → − ∞ .
So the blow-up is + ∞ from the right and − ∞ from the left — the two-sided limit does not exist. Geometrically the parallelogram is being crushed toward a line from opposite orientations, so the inverse map's stretch factor grows without bound, positive on one side and negative (orientation-flipped) on the other.
Verify: at ε = 1 : det A = 1 , det A − 1 = 1 , det A 3 = 1 ; and det A = 2 ε − 1 = 0 exactly at ε = 2 1 . ✓
A graphic designer applies the transform T = ( 3 0 1 2 ) to a company logo whose original area is 12 cm 2 . What is the new area, and did the logo get mirrored?
Forecast: The determinant is the area-scaling factor. Predict the new area before computing.
Step 1. det T = 3 ⋅ 2 − 1 ⋅ 0 = 6.
Why this step? The determinant is exactly the signed area-scaling factor of the linear map, so any shape's area is multiplied by ∣ det T ∣ .
Step 2. New area = ∣ det T ∣ × 12 = 6 × 12 = 72 cm 2 .
Step 3. Sign of det T is positive , so orientation is preserved — the logo is stretched and sheared, not mirrored. The figure shows the unit square (area 1) becoming a parallelogram of area 6.
Figure — what to observe: The small teal square is the original unit cell (area 1 ). Apply T and it becomes the orange parallelogram: the two basis arrows land at T e 1 = ( 3 , 0 ) (purple, along the axis) and T e 2 = ( 1 , 2 ) (ink, tilted). Notice the arrows still turn the same way as the original axes — no mirror flip — which is why det T = + 6 is positive. The orange region visibly holds six copies of the teal square, confirming the area grew by the factor det T = 6 . Multiply your real logo's 12 cm 2 by that same 6 .
Verify: det T = 6 > 0 and 6 × 12 = 72 . Units: (dimensionless factor)× cm 2 = cm 2 . ✓
Given that det P = 4 for a 3 × 3 matrix P , and E 1 (swap R 1 ↔ R 3 ), E 2 (scale R 2 by 5 ) are elementary matrices , compute
det ( 2 E 1 E 2 P ) .
Forecast: Four effects stack: the scalar 2 on a 3 × 3 (that's 2 3 ), a swap (− 1 ), a scale-by-5 (5 ), and det P = 4 . Multiply them — don't add.
Step 1. Peel the scalar: det ( 2 X ) = 2 3 det X = 8 det X where X = E 1 E 2 P .
Why this step? 2 X scales all n = 3 rows (Rule 2 / Cell C7), giving the factor 2 n = 2 3 = 8 .
Step 2. Use multiplicativity: det ( E 1 E 2 P ) = det E 1 ⋅ det E 2 ⋅ det P .
Why this step? det ( A B ) = det A det B chained across all three factors.
Step 3. Fill in the elementary determinants (parent's table): a swap matrix has det E 1 = − 1 , a scale-by-5 matrix has det E 2 = 5 , and we are told det P = 4 . Substituting,
det ( E 1 E 2 P ) = ( − 1 ) ⋅ 5 ⋅ 4 = − 20.
Step 4. Combine with the scalar factor from Step 1:
det ( 2 E 1 E 2 P ) = 8 ⋅ ( − 20 ) = − 160.
Verify: 8 × ( − 1 ) × 5 × 4 = − 160 . ✓
Recall Which cell, which factor? (cover the answers)
You swapped rows 3 times computing a det — what factor? ::: ( − 1 ) 3 = − 1 .
det ( 3 A ) for a 4 × 4 with det A = 2 ? ::: 3 4 ⋅ 2 = 162 .
A has two proportional rows — det ? ::: 0 (singular).
det A = − 3 , det B = 2 , then det ( A B ) ? ::: − 6 .
As det A → 0 + , what does det ( A − 1 ) do? ::: → + ∞ (and → − ∞ if det A → 0 − ).
det T = 6 positive — mirrored or not? ::: Not mirrored (orientation preserved).