Can you spot which property makes the answer instant, with (almost) no arithmetic?
Recall Solution 1.1
Look at columns 1 and 3 — they are identical (3,1,6).
P1 says column properties equal row properties, and P3 says two equal rows (hence columns)
force the determinant to 0.
=0
No arithmetic needed — that is the whole point of Recognition.
Recall Solution 1.2
det(A⊤)=detA=7 by P1.
2A scales all three rows by 2, so by the P4 corollary det(2A)=23detA=8⋅7=56.
det(A⊤)=7,det(2A)=56
Recall Solution 1.3
Column 3 is all zeros. By P7 (via P1), a zero row/column gives det=0.
=0
Recall Solution 1.4
P8: for a triangular matrix the determinant is just the product of the diagonal.
detA=2⋅(−3)⋅5=−30
Step 1 (why): Use P6 to clear column 1 — these operations don't change the value.
R2→R2−2R1, R3→R3−R1:
1002−1−3−135.Step 2 (why): Clear column 2 below the diagonal. R3→R3−3R2:
1002−10−13−4.Step 3: Now triangular. By P8, det=1⋅(−1)⋅(−4)=4.
Recall Solution 2.2
Step 1 (why): Row 1 =3⋅(1,2,3). P4 lets us factor 3 out of that one row.
=3112202320.Step 2 (why):P6 to make zeros. R2→R2−R1, R3→R3−2R1:
=31002−2−23−1−6.Step 3:R3→R3−R2: 1002−203−1−5. By P8:
=3⋅(1⋅(−2)⋅(−5))=3⋅10=30.
Recall Solution 2.3
By P9 corollary, det(A−1)=detA1=41.
2A−1 scales all 3 rows by 2, so P4 corollary gives 23⋅41=8⋅41=2.
Reason about what happens to det under operations, without a full recompute.
Recall Solution 3.1
Track each operation's factor:
Multiply R1 by 5: factor ×5 (P4). Running =5⋅6=30.
Swap R2,R3: factor ×(−1) (P2). Running =−30.
R1→R1+4R3: factor ×1 (P6, no change). Running =−30.
detB=−30
Recall Solution 3.2
Idea: make row 2 collapse using P6.
R2→R2−R1 (subtract row 1; P6, value unchanged):
a21b21c21.
Now row 2 =2⋅(1,1,1)=2⋅ row 3. Pull out the 2 (P4):
=2a11b11c11.
Rows 2 and 3 are equal ⇒det=0 by P3. Hence the whole thing is 2⋅0=0.
Recall Solution 3.3
Take A=B=I2 (the identity). Then detA=detB=1, so detA+detB=2.
But A+B=2I2=(2002), and by P8 (diagonal) det(2I2)=2⋅2=4.
Since 4=2, the "rule" fails. P5 is linearity in one row at a time; adding whole
matrices changes every row at once, so it does not factor.
det(A+B)=4=2=detA+detB
Step 1 (why): kill the first column below the top using column operations
(P1 lets column ops mirror row ops). C3→C3−C2 then C2→C2−C1:
1aa20b−ab2−a20c−bc2−b2.Step 2: factor each of the new columns (P4): b2−a2=(b−a)(b+a), c2−b2=(c−b)(c+b):
=(b−a)(c−b)1aa201b+a01c+b.Step 3: expand along row 1 (only the top-left 1 survives), leaving the 2×2:
=(b−a)(c−b)[(c+b)−(b+a)]=(b−a)(c−b)(c−a).=(b−a)(c−a)(c−b)
Recall Solution 4.2
Chain three properties:
det(M⊤)=detM by P1.
M⊤=−M means we multiplied all 3 rows by −1, so det(M⊤)=(−1)3detM=−detM
(P4 corollary).
Combine: detM=−detM⇒2detM=0⇒detM=0.
(Key: (−1)3=−1 because 3 is odd — this fails for even-sized skew matrices, where det can be nonzero.)
Full multi-property arguments; connect to inverses and transformations.
Recall Solution 5.1
Break the product with P9, P1, P4 corollary:
det(A2)=(detA)2=9 (apply P9 twice).
det(B−1)=1/detB=−21.
det(2A⊤)=23det(A⊤)=8⋅detA=24 (P4 corollary + P1).
Multiply (order doesn't matter, det of a product is the product of dets):
9⋅(−21)⋅24=9⋅(−12)=−108.
Recall Solution 5.2
The determinant is the area-scaling factor of the map (see Linear Transformations & Scaling of Area).
detT=2⋅3−1⋅1=5.
New area =∣detT∣×old area=5×6=30.
Since detT=5>0, orientation is preserved (no flip). Look at the red parallelogram in the figure:
the unit square of area 1 becomes a region of area 5 — every shape scales by the same factor.
Recall Solution 5.3
If A−1 exists, then AA−1=I. Apply P9:
detA⋅det(A−1)=detI=1.
A product equalling 1 cannot have a zero factor, so detA=0 (and det(A−1)=1/detA,
the P9 corollary).
Conversely, if detA=0 the map squashes area to 0 (rows are linearly dependent, P3-style),
so it cannot be undone — no inverse exists. This is exactly the bridge to
Inverse of a Matrix via Adjoint. ■