Quiz · Hard
Harder questions that need properties rather than computation: adjugates, rank bounds, nilpotent and skew-symmetric matrices, and what row operations preserve.
A is a 3 × 3 matrix with det A = 2. What is det(adj A)?
2
4
8
1/2
For an n × n matrix, det(adj A) = (det A)ⁿ⁻¹. Here that is 2² = 4. This follows from A·adj A = (det A)I, whose determinant is (det A)ⁿ.
det A = 5 and det B = −3 for n × n matrices. What is det(A⁻¹BᵀA)?
−15
3/5
−3/25
−3
det(A⁻¹)·det(Bᵀ)·det(A) = (1/5)(−3)(5) = −3. The determinants are numbers, so they commute even though the matrices do not. This is why similar matrices have the same determinant.
A is a real square matrix with A² = I. Which values can det A take?
Only −1
1 or −1
Any nonzero number
Only 1
(det A)² = det(A²) = det I = 1, so det A = ±1. Both occur: A = I gives 1, and a reflection such as diag(1, −1) gives −1.
A is 3 × 5 with rank 2. How many free variables does Ax = 0 have?
5
1
2
3
Free variables = columns − rank = 5 − 2 = 3 (rank-nullity). Counting rows instead of columns, 3 − 2 = 1, is the usual slip.
For which value of k is x + 2y = 3, 2x + 4y = k consistent?
Any k
k = 3
k = 6
k = 7
Subtract twice equation 1 from equation 2: 0 = k − 6. The system is consistent only for k = 6, and then it has infinitely many solutions.
A is 5 × 3 and B is 3 × 5. Can AB be invertible?
Yes, if det B ≠ 0
No, AB has rank at most 3 but is 5 × 5
Yes, always
Yes, if A has rank 3
rank(AB) ≤ min(rank A, rank B) ≤ 3, but a 5 × 5 matrix needs rank 5 to be invertible. (B has no determinant since it is not square.)
A is n × n, invertible, and AB = 0. What must B be?
B = 0
B is invertible
B = A⁻¹
Nothing can be said
Multiply on the left by A⁻¹: B = A⁻¹·0 = 0. Zero divisors only occur when A is singular.
N is a square matrix with N² = 0. What is (I − N)⁻¹?
It does not exist
I − N
I + N
I
(I − N)(I + N) = I − N² = I. This is the finite geometric series 1/(1 − x) = 1 + x + x² + ... when higher powers vanish.
A is a real 5 × 5 skew-symmetric matrix (Aᵀ = −A). What is det A?
0
It depends on A
1
−1
det Aᵀ = det A, but det(−A) = (−1)⁵ det A = −det A. So det A = −det A, hence det A = 0. This works for every odd n.
Which quantity is unchanged by every row operation (swap, scale, add a multiple)?
The column space
The row space
The trace
The determinant
Each row operation replaces rows by combinations of rows, and it can be undone, so the row space is the same. The determinant changes under swaps and scalings, the column space generally changes, and the trace changes too.
A is 2 × 2, A ≠ 0 and A² = 0. What is rank A?
2
It cannot be determined
0
1
A ≠ 0 means rank ≥ 1. If rank were 2, A would be invertible and A² = 0 would force A = 0. So rank 1, like [[0, 1], [0, 0]].
Find det .
0
1
2
6
This is a Vandermonde matrix with nodes 1, 2, 3: the determinant is the product of the differences, (2−1)(3−1)(3−2) = 2. A zero determinant would require two equal nodes.
A = LU with L unit lower triangular and U = . What is det A?
10
1
5
7
det L = 1 (unit diagonal), and det U = 2 · 5 = 10, so det A = 10. This is how determinants are computed efficiently in software.
A is n × n and has rank n − 1. Which statement is true?
A⁻¹ exists
Ax = b is solvable for every b
det A ≠ 0
Ax = 0 has exactly one nonzero solution (up to scaling)
Nullity = n − rank = 1, so the null space is a line: nonzero solutions are all multiples of one vector. det A = 0 and A is singular, so there is no inverse and some b are unreachable.
B is obtained from A by a sequence of row operations. Which must be true?
B = A
det B = det A
B and A have the same null space
B and A have the same column space
Row operations preserve the solution set of Ax = 0, i.e. the null space. They do not preserve the determinant (swaps and scalings change it) or the column space.
A is invertible and symmetric. Which statement about A⁻¹ is true?
A⁻¹ is skew-symmetric
A⁻¹ is symmetric only if A is diagonal
A⁻¹ = −A
A⁻¹ is symmetric
(A⁻¹)ᵀ = (Aᵀ)⁻¹ = A⁻¹, so the inverse of a symmetric matrix is symmetric. It is not skew-symmetric (that would force a zero diagonal and contradict A⁻¹A = I in general), and no diagonal assumption is needed.