Determinant & Invertibility - Linear Algebra

  1. Matrix AA has the property that A4=2A2A^4 = 2A^2. Which statement about the possible values of det⁡(A)\det(A) is correct?
    Answer: det⁡(A)∈{0,2,−2}\det(A) \in \{0, \sqrt{2}, -\sqrt{2}\} are the only possibilities From A4=2A2A^4 = 2A^2, we get A4−2A2=0A^4 - 2A^2 = 0, which factors as A2(A2−2I)=0A^2(A^2 - 2I) = 0. Taking determinants: det⁡(A2)det⁡(A2−2I)=0\det(A^2)\det(A^2 - 2I) = 0. This means either det⁡(A2)=0\det(A^2) = 0 or det⁡(A2−2I)=0\det(A^2 - 2I) = 0. Since det⁡(A2)=(det⁡(A))2\det(A^2) = (\det(A))^2, the first case gives det⁡(A)=0\det(A) = 0. For the second case, det⁡(A2−2I)=0\det(A^2 - 2I) = 0 means A2−2IA^2 - 2I is singular, so 2 is an eigenvalue of A2A^2. If λ\lambda is an eigenvalue of AA, then λ2\lambda^2 is an eigenvalue of A2A^2. So we need λ2=2\lambda^2 = 2 for some eigenvalue λ\lambda of AA, giving λ=±2\lambda = \pm\sqrt{2}. Since det⁡(A)\det(A) is the product of eigenvalues of AA, and all eigenvalues must satisfy λ2∈{0,2}\lambda^2 \in \{0, 2\} (from A2(A2−2I)=0A^2(A^2-2I)=0), we get det⁡(A)∈{0,±2}\det(A) \in \{0, \pm\sqrt{2}\}. Choice A includes impossible values like ±1\pm 1. Choice B includes ±2\pm 2 which would require eigenvalues ±44=±2\pm\sqrt[4]{4} = \pm\sqrt{2}, but 2⋅2=2\sqrt{2} \cdot \sqrt{2} = 2, not giving det⁡(A)=±2\det(A) = \pm 2 unless we have repeated eigenvalues in a specific way that doesn't work. Choice C is too broad.
  2. The entry in the first row, first column of the inverse of the matrix M=(x+132x−2)M = \begin{pmatrix} x+1 & 3 \\ 2 & x-2 \end{pmatrix} is 1/31/3. What is a possible value of xx?
    Answer: 2−62 - \sqrt{6} When you encounter a matrix inverse problem where you're given specific information about one entry of the inverse, you need to use the formula for matrix inverses and set up an equation. For a 2×2 matrix (abcd)\begin{pmatrix} a & b \\ c & d \end{pmatrix}, the inverse is 1ad−bc(d−b−ca)\frac{1}{ad-bc}\begin{pmatrix} d & -b \\ -c & a \end{pmatrix}. The (1,1) entry of the inverse is dad−bc\frac{d}{ad-bc}. For matrix M=(x+132x−2)M = \begin{pmatrix} x+1 & 3 \\ 2 & x-2 \end{pmatrix}, we have a=x+1a = x+1, b=3b = 3, c=2c = 2, and d=x−2d = x-2. The determinant is (x+1)(x−2)−(3)(2)=x2−x−8(x+1)(x-2) - (3)(2) = x^2 - x - 8. The (1,1) entry of M−1M^{-1} is x−2x2−x−8=13\frac{x-2}{x^2-x-8} = \frac{1}{3}. Cross-multiplying: 3(x−2)=x2−x−83(x-2) = x^2-x-8, which gives us 3x−6=x2−x−83x-6 = x^2-x-8. Rearranging: x2−4x−2=0x^2-4x-2 = 0. Using the quadratic formula: x=4±16+82=4±242=4±262=2±6x = \frac{4 \pm \sqrt{16+8}}{2} = \frac{4 \pm \sqrt{24}}{2} = \frac{4 \pm 2\sqrt{6}}{2} = 2 \pm \sqrt{6}. Looking at the answer choices: A) x=4x = 4 gives the wrong quadratic equation. B) x=2x = 2 makes the determinant −6-6, giving us 0−6=0≠13\frac{0}{-6} = 0 \neq \frac{1}{3}. C) x=2+3x = 2 + \sqrt{3} doesn't satisfy our quadratic equation. D) x=2−6x = 2 - \sqrt{6} is one of our two solutions. Remember: when working with matrix inverses, always check that your solution doesn't make the determinant zero (which would make the matrix non-invertible), and verify your algebra carefully since quadratic equations often appear in these problems.
  3. Let AA and BB be n×nn \times n matrices. If matrix AA is invertible and matrix BB is non-invertible, which of the following matrices is guaranteed to be non-invertible?
    Answer: A2BA^2 B A matrix MM is non-invertible if and only if its determinant is zero, det⁡(M)=0\det(M)=0. We are given that AA is invertible, so det⁡(A)≠0\det(A) \neq 0. We are given that BB is non-invertible, so det⁡(B)=0\det(B)=0. Let's examine the choices using the property det⁡(XY)=det⁡(X)det⁡(Y)\det(XY) = \det(X)\det(Y). For choice C: det⁡(A2B)=det⁡(A2)det⁡(B)=(det⁡(A))2⋅det⁡(B)\det(A^2 B) = \det(A^2) \det(B) = (\det(A))^2 \cdot \det(B). Since det⁡(B)=0\det(B)=0, we have det⁡(A2B)=(det⁡(A))2⋅0=0\det(A^2 B) = (\det(A))^2 \cdot 0 = 0. Therefore, A2BA^2 B is guaranteed to be non-invertible. For choices A and B: There is no general formula for det⁡(A±B)\det(A \pm B). For example, if A=IA=I (invertible) and B=(0100)B=\begin{pmatrix} 0 & 1 \\ 0 & 0 \end{pmatrix} (non-invertible), then A+B=(1101)A+B = \begin{pmatrix} 1 & 1 \\ 0 & 1 \end{pmatrix} is invertible. So A+BA+B is not guaranteed to be non-invertible. For choice D: Since AA is invertible, A−1A^{-1} exists and is invertible. Their sum, A+A−1A+A^{-1}, is not guaranteed to be non-invertible. For example, if A=IA=I, A+A−1=2IA+A^{-1}=2I which is invertible.
  4. Matrix PP satisfies P3−2P2+P=IP^3 - 2P^2 + P = I, where II is the identity matrix. Which statement about the invertibility of PP is correct?
    Answer: PP is invertible with P−1=P2−2P+IP^{-1} = P^2 - 2P + I From P3−2P2+P=IP^3 - 2P^2 + P = I, we can factor the left side: P(P2−2P+I)=IP(P^2 - 2P + I) = I. This shows that PP has a right inverse, namely P2−2P+IP^2 - 2P + I. Since PP is a square matrix with a right inverse, it must be invertible, and P−1=P2−2P+IP^{-1} = P^2 - 2P + I. Choice B has incorrect signs. Choice C is wrong because the equation actually guarantees PP is invertible. Choice D is incorrect since the given equation determines that PP must be invertible regardless of its specific entries.
  5. Consider matrices XX and YY such that XYXY is invertible but YXYX is not invertible. If both XX and YY are 3×33 \times 3 matrices, which statement must be true?
    Answer: This scenario is impossible because det⁡(XY)=det⁡(YX)\det(XY) = \det(YX) always For square matrices, det⁡(XY)=det⁡(X)det⁡(Y)=det⁡(Y)det⁡(X)=det⁡(YX)\det(XY) = \det(X)\det(Y) = \det(Y)\det(X) = \det(YX). Therefore, XYXY is invertible (det⁡(XY)≠0\det(XY) \neq 0) if and only if YXYX is invertible (det⁡(YX)≠0\det(YX) \neq 0). The scenario described is impossible for 3×33 \times 3 matrices. Choice B is incorrect because XYXY being invertible does imply both XX and YY are invertible, but this would then make YXYX invertible too. Choice C mentions rectangular matrices, but the problem specifies 3×33 \times 3 matrices. Choice D about eigenvalues is true but less direct than the determinant argument.
  6. Consider the system of linear equations Ax=bA\mathbf{x} = \mathbf{b}, where AA is a 3×33 \times 3 matrix. If this system has a unique solution for any vector b∈R3\mathbf{b} \in \mathbb{R}^3, what must be true about the determinant of the matrix ATAA^T A?
    Answer: det⁡(ATA)>0\det(A^T A) > 0 The statement that the system Ax=bA\mathbf{x} = \mathbf{b} has a unique solution for any b\mathbf{b} is a condition for the square matrix AA to be invertible. If AA is invertible, its determinant must be non-zero, i.e., det⁡(A)≠0\det(A) \neq 0. We need to find the determinant of ATAA^T A. Using the properties of determinants: det⁡(ATA)=det⁡(AT)det⁡(A)\det(A^T A) = \det(A^T) \det(A). We also know that the determinant of a matrix is equal to the determinant of its transpose, so det⁡(AT)=det⁡(A)\det(A^T) = \det(A). Therefore, det⁡(ATA)=det⁡(A)det⁡(A)=(det⁡(A))2\det(A^T A) = \det(A) \det(A) = (\det(A))^2. Since det⁡(A)\det(A) is a non-zero real number, its square, (det⁡(A))2(\det(A))^2, must be strictly positive. Thus, det⁡(ATA)>0\det(A^T A) > 0.
  7. A linear transformation T:R2→R2T: \mathbb{R}^2 \to \mathbb{R}^2 is represented by the matrix M=(k42k−2)M = \begin{pmatrix} k & 4 \\ 2 & k-2 \end{pmatrix}. For which values of kk does this transformation compress the entire plane into a single line or the origin?
    Answer: k=4k=4 and k=−2k=-2 A linear transformation compresses the plane onto a line or the origin if and only if the matrix representing it is non-invertible (singular). This occurs when the determinant of the matrix is zero. The column vectors of the matrix become linearly dependent. We calculate the determinant of MM: det⁡(M)=k(k−2)−(4)(2)=k2−2k−8\det(M) = k(k-2) - (4)(2) = k^2 - 2k - 8. To find when the transformation is non-invertible, we set the determinant to zero: k2−2k−8=0k^2 - 2k - 8 = 0. This is a quadratic equation which can be factored as: (k−4)(k+2)=0(k-4)(k+2) = 0. The solutions are k=4k=4 and k=−2k=-2. For these values, the determinant is zero, and the transformation is not invertible, meaning it maps the plane to a lower-dimensional space (a line or the origin).
  8. Matrix BB satisfies BTB=4IB^T B = 4I where BTB^T denotes the transpose. If BB is a 2×22 \times 2 matrix with det⁡(B)<0\det(B) < 0, what is det⁡(B)\det(B)?
    Answer: det⁡(B)=−4\det(B) = -4 From BTB=4IB^T B = 4I, taking determinants: det⁡(BTB)=det⁡(4I)=42=16\det(B^T B) = \det(4I) = 4^2 = 16 for a 2×22 \times 2 matrix. Since det⁡(BT)=det⁡(B)\det(B^T) = \det(B), we have det⁡(BTB)=det⁡(BT)det⁡(B)=(det⁡(B))2=16\det(B^T B) = \det(B^T)\det(B) = (\det(B))^2 = 16. Therefore det⁡(B)=±4\det(B) = \pm 4. Since we're given that det⁡(B)<0\det(B) < 0, we have det⁡(B)=−4\det(B) = -4.
  9. Let T:R3→R3T: \mathbb{R}^3 \to \mathbb{R}^3 be a linear transformation represented by matrix AA. If TT maps the unit sphere to an ellipsoid with semi-axes of lengths 4, 2, and 0.5, what is ∣det⁡(A)∣|\det(A)|?
    Answer: ∣det⁡(A)∣=4×2×0.5=4|\det(A)| = 4 \times 2 \times 0.5 = 4 The absolute value of the determinant of a linear transformation equals the factor by which it scales volumes. When a linear transformation maps the unit sphere to an ellipsoid, the semi-axis lengths of the resulting ellipsoid are the singular values of the transformation matrix. The volume scaling factor is the product of these singular values. Since the unit sphere has volume 4π3\frac{4\pi}{3}, and the ellipsoid has volume 4π3×4×2×0.5=4π3×4\frac{4\pi}{3} \times 4 \times 2 \times 0.5 = \frac{4\pi}{3} \times 4, we have ∣det⁡(A)∣=4×2×0.5=4|\det(A)| = 4 \times 2 \times 0.5 = 4. Choice A incorrectly adds the lengths. Choice C uses the Euclidean norm instead of the product. Choice D introduces an unnecessary division by 3.
  10. If AA and BB are both non-invertible n×nn \times n matrices, which statement about their sum, C=A+BC = A+B, must be true?
    Answer: CC may be invertible or non-invertible. The determinant of a sum of matrices is not, in general, the sum of their determinants. That is, det⁡(A+B)≠det⁡(A)+det⁡(B)\det(A+B) \neq \det(A) + \det(B). Since AA and BB are non-invertible, we know det⁡(A)=0\det(A)=0 and det⁡(B)=0\det(B)=0. However, this tells us nothing definite about det⁡(A+B)\det(A+B). Consider two examples: 1. Let A=(1000)A = \begin{pmatrix} 1 & 0 \\ 0 & 0 \end{pmatrix} and B=(0001)B = \begin{pmatrix} 0 & 0 \\ 0 & 1 \end{pmatrix}. Both have a determinant of 0 and are non-invertible. Their sum is C=A+B=(1001)=IC = A+B = \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix} = I, the identity matrix. det⁡(C)=1\det(C)=1, so CC is invertible. 2. Let A=(1000)A = \begin{pmatrix} 1 & 0 \\ 0 & 0 \end{pmatrix} and B=(2000)B = \begin{pmatrix} 2 & 0 \\ 0 & 0 \end{pmatrix}. Both are non-invertible. Their sum is C=A+B=(3000)C = A+B = \begin{pmatrix} 3 & 0 \\ 0 & 0 \end{pmatrix}. det⁡(C)=0\det(C)=0, so CC is non-invertible. Since the sum can be either invertible or non-invertible, the only correct statement is that the outcome is not predetermined.
  11. Let AA be a 3×33 \times 3 matrix with det⁡(A)=4\det(A) = 4. What is the determinant of the matrix B=2A−1ATB = 2A^{-1}A^T?
    Answer: 88 We need to find det⁡(B)=det⁡(2A−1AT)\det(B) = \det(2A^{-1}A^T). We use the following properties of determinants for an n×nn \times n matrix MM: det⁡(kM)=kndet⁡(M)\det(kM) = k^n \det(M), det⁡(MN)=det⁡(M)det⁡(N)\det(MN) = \det(M)\det(N), det⁡(M−1)=1/det⁡(M)\det(M^{-1}) = 1/\det(M), and det⁡(MT)=det⁡(M)\det(M^T) = \det(M). Here, the matrix A−1ATA^{-1}A^T is a 3×33 \times 3 matrix, so n=3n=3. The scalar is k=2k=2. det⁡(B)=det⁡(2(A−1AT))\det(B) = \det(2(A^{-1}A^T)) =23det⁡(A−1AT)= 2^3 \det(A^{-1}A^T) =8(det⁡(A−1)det⁡(AT))= 8 (\det(A^{-1}) \det(A^T)) We are given det⁡(A)=4\det(A)=4. So, det⁡(A−1)=1/det⁡(A)=1/4\det(A^{-1}) = 1/\det(A) = 1/4, and det⁡(AT)=det⁡(A)=4\det(A^T) = \det(A) = 4. Substituting these values: det⁡(B)=8⋅(1/4)⋅(4)=8⋅1=8\det(B) = 8 \cdot (1/4) \cdot (4) = 8 \cdot 1 = 8.
  12. For what value of cc are the vectors v1=(12−1)\mathbf{v}_1 = \begin{pmatrix} 1 \\ 2 \\ -1 \end{pmatrix}, v2=(013)\mathbf{v}_2 = \begin{pmatrix} 0 \\ 1 \\ 3 \end{pmatrix}, and v3=(25c)\mathbf{v}_3 = \begin{pmatrix} 2 \\ 5 \\ c \end{pmatrix} linearly dependent, and what does this imply about the matrix A=[v1 v2 v3]A = [\mathbf{v}_1 \ \mathbf{v}_2 \ \mathbf{v}_3]?
    Answer: c=1c=1; the matrix AA is non-invertible. A set of nn vectors in Rn\mathbb{R}^n is linearly dependent if and only if the matrix formed by using these vectors as columns has a determinant of zero. A matrix with a zero determinant is non-invertible. So, we need to find the value of cc that makes det⁡(A)=0\det(A) = 0. A=(102215−13c)A = \begin{pmatrix} 1 & 0 & 2 \\ 2 & 1 & 5 \\ -1 & 3 & c \end{pmatrix}. We calculate the determinant by cofactor expansion along the first row: det⁡(A)=1⋅det⁡(153c)−0⋅det⁡(25−1c)+2⋅det⁡(21−13)\det(A) = 1 \cdot \det\begin{pmatrix} 1 & 5 \\ 3 & c \end{pmatrix} - 0 \cdot \det\begin{pmatrix} 2 & 5 \\ -1 & c \end{pmatrix} + 2 \cdot \det\begin{pmatrix} 2 & 1 \\ -1 & 3 \end{pmatrix} =1(1⋅c−5⋅3)−0+2(2⋅3−1⋅(−1))= 1(1 \cdot c - 5 \cdot 3) - 0 + 2(2 \cdot 3 - 1 \cdot (-1)) =(c−15)+2(6+1)= (c - 15) + 2(6 + 1) =c−15+2(7)= c - 15 + 2(7) =c−15+14=c−1= c - 15 + 14 = c - 1. For the vectors to be linearly dependent, we must have det⁡(A)=0\det(A) = 0. So, c−1=0c - 1 = 0, which gives c=1c=1. When c=1c=1, the determinant is zero, and therefore the matrix AA is non-invertible.
  13. Let PP and SS be n×nn \times n matrices, with PP being invertible. A matrix QQ is defined by the similarity transformation Q=P−1SPQ = P^{-1}SP. Which statement accurately describes the invertibility of QQ?
    Answer: QQ is invertible if and only if SS is invertible. A matrix is invertible if and only if its determinant is non-zero. Let's analyze the determinant of QQ. Using the property that the determinant of a product is the product of the determinants: det⁡(Q)=det⁡(P−1SP)=det⁡(P−1)det⁡(S)det⁡(P)\det(Q) = \det(P^{-1}SP) = \det(P^{-1}) \det(S) \det(P). Since PP is invertible, det⁡(P)≠0\det(P) \neq 0, and det⁡(P−1)=1/det⁡(P)\det(P^{-1}) = 1/\det(P). Substituting this in, we get det⁡(Q)=(1/det⁡(P))⋅det⁡(S)⋅det⁡(P)\det(Q) = (1/\det(P)) \cdot \det(S) \cdot \det(P). The terms det⁡(P)\det(P) and 1/det⁡(P)1/\det(P) cancel out, leaving det⁡(Q)=det⁡(S)\det(Q) = \det(S). This means det⁡(Q)\det(Q) is non-zero if and only if det⁡(S)\det(S) is non-zero. Therefore, QQ is invertible if and only if SS is invertible.
  14. Consider the matrix M=(abcd)M = \begin{pmatrix} a & b \\ c & d \end{pmatrix} where a,b,c,da, b, c, d are integers with ∣a∣,∣b∣,∣c∣,∣d∣≤2|a|, |b|, |c|, |d| \leq 2. If M2=IM^2 = I, how many such matrices MM are invertible?
    Answer: All matrices satisfying M2=IM^2 = I are automatically invertible If M2=IM^2 = I, then M⋅M=IM \cdot M = I, which means MM is its own inverse. Therefore, MM is automatically invertible with det⁡(M)≠0\det(M) \neq 0. Any matrix satisfying M2=IM^2 = I must be invertible by definition. The constraint on integer entries in [−2,2][-2,2] limits which specific matrices exist, but all solutions to M2=IM^2 = I are necessarily invertible. Choices B and C give specific counts that miss this fundamental point. Choice D incorrectly suggests no such matrices exist.
  15. Let AA and BB be n×nn \times n matrices. Which of the following statements is NOT always true?
    Answer: If AA and BB are invertible, then A+BA+B is invertible. When you encounter questions about matrix invertibility, focus on the fundamental properties that govern when matrices have inverses and how operations affect invertibility. Let's examine why option D is the exception. Consider two invertible 2×2 matrices: A=(1001)A = \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix} and B=(−100−1)B = \begin{pmatrix} -1 & 0 \\ 0 & -1 \end{pmatrix}. Both are clearly invertible (A is the identity matrix, B has determinant 1). However, A+B=(0000)A + B = \begin{pmatrix} 0 & 0 \\ 0 & 0 \end{pmatrix}, which is the zero matrix and definitely not invertible. This counterexample shows that the sum of invertible matrices can fail to be invertible. Now let's verify why the other statements are always true. Option A holds because det⁡(AT)=det⁡(A)\det(A^T) = \det(A), so if A is invertible (nonzero determinant), then ATA^T is also invertible. Option B is correct because if AB were invertible while, say, A was not invertible, then A would have zero determinant, making det⁡(AB)=det⁡(A)det⁡(B)=0\det(AB) = \det(A)\det(B) = 0, contradicting AB's invertibility. Option C follows similarly: if A is not invertible, then det⁡(A)=0\det(A) = 0, so det⁡(AB)=det⁡(A)det⁡(B)=0\det(AB) = \det(A)\det(B) = 0, making AB non-invertible. Remember this key distinction: multiplication preserves invertibility (invertible matrices times invertible matrices stay invertible), but addition does not. Matrix addition can produce linear dependence even when starting with independent matrices.
  16. For what values of the constant kk is the matrix A=(1k024135k)A = \begin{pmatrix} 1 & k & 0 \\ 2 & 4 & 1 \\ 3 & 5 & k \end{pmatrix} non-invertible?
    Answer: k=1k=1 and k=2k=2 A matrix is non-invertible if and only if its determinant is zero. We compute the determinant of AA by cofactor expansion along the first row: det⁡(A)=1⋅det⁡(415k)−k⋅det⁡(213k)+0⋅det⁡(2435)\det(A) = 1 \cdot \det\begin{pmatrix} 4 & 1 \\ 5 & k \end{pmatrix} - k \cdot \det\begin{pmatrix} 2 & 1 \\ 3 & k \end{pmatrix} + 0 \cdot \det\begin{pmatrix} 2 & 4 \\ 3 & 5 \end{pmatrix} =1(4k−5)−k(2k−3)+0= 1(4k - 5) - k(2k - 3) + 0 =4k−5−2k2+3k= 4k - 5 - 2k^2 + 3k =−2k2+7k−5= -2k^2 + 7k - 5 Setting the determinant to zero to find when the matrix is non-invertible: −2k2+7k−5=0-2k^2 + 7k - 5 = 0 2k2−7k+5=02k^2 - 7k + 5 = 0 Factoring the quadratic equation gives: (2k−5)(k−1)=0(2k - 5)(k - 1) = 0 The solutions are k=1k=1 and k=5/2k=5/2. Wait, I made a mistake in my calculation. Let me re-calculate the factorization of 2k2−7k+5=02k^2-7k+5=0. It is (2k−5)(k−1)=0(2k-5)(k-1)=0, so k=5/2k=5/2 and k=1k=1. Let me re-check the determinant calculation. 1(4k−5)−k(2k−3)=4k−5−2k2+3k=−2k2+7k−51(4k-5) - k(2k-3) = 4k-5 - 2k^2+3k = -2k^2+7k-5. This seems correct. Let me re-evaluate the problem. Ah, I see, my initial scratchpad had different values. Let me adjust the question or answers. Let's adjust the matrix to give integer answers. Let the matrix be A=(k101k2342)A = \begin{pmatrix} k & 1 & 0 \\ 1 & k & 2 \\ 3 & 4 & 2 \end{pmatrix}. det⁡(A)=k(2k−8)−1(2−6)=2k2−8k+4=0  ⟹  k2−4k+2=0\det(A) = k(2k-8) - 1(2-6) = 2k^2-8k+4=0 \implies k^2-4k+2=0. This gives non-integer roots. Let's try again. A=(12k0k1−103)A = \begin{pmatrix} 1 & 2 & k \\ 0 & k & 1 \\ -1 & 0 & 3 \end{pmatrix}. det⁡(A)=1(3k−0)−2(0−(−1))+k(0−(−k))=3k−2+k2\det(A) = 1(3k-0) - 2(0 - (-1)) + k(0 - (-k)) = 3k - 2 + k^2. So k2+3k−2=0k^2+3k-2=0. Still not nice roots. Let's go back to the original calculation and check my factorization. 2k2−7k+5=02k^2 - 7k + 5 = 0. Using quadratic formula: k=7±49−4(2)(5)4=7±94=7±34k = \frac{7 \pm \sqrt{49 - 4(2)(5)}}{4} = \frac{7 \pm \sqrt{9}}{4} = \frac{7 \pm 3}{4}. So k=104=5/2k = \frac{10}{4} = 5/2 and k=44=1k = \frac{4}{4} = 1. The original work was correct. The choices should reflect this. Let me rewrite the question stem and choices for clarity and to match the intended difficulty. I will make a new matrix that gives integer solutions as intended. Let A=(k1311k012)A = \begin{pmatrix} k & 1 & 3 \\ 1 & 1 & k \\ 0 & 1 & 2 \end{pmatrix}. det⁡(A)=k(2−k)−1(2−0)+3(1−0)=2k−k2−2+3=−k2+2k+1\det(A) = k(2-k) - 1(2-0) + 3(1-0) = 2k - k^2 - 2 + 3 = -k^2+2k+1. Still not good. Let's engineer it. I want roots k=1,k=2k=1, k=2. So the equation should be (k−1)(k−2)=k2−3k+2=0(k-1)(k-2)=k^2-3k+2=0. Let's try to build a matrix for this. A=(k311k0111)A = \begin{pmatrix} k & 3 & 1 \\ 1 & k & 0 \\ 1 & 1 & 1 \end{pmatrix}. det⁡(A)=k(k−0)−3(1−0)+1(1−k)=k2−3+1−k=k2−k−2\det(A) = k(k-0) - 3(1-0) + 1(1-k) = k^2 - 3 + 1 - k = k^2 - k - 2. Set to zero: (k−2)(k+1)=0(k-2)(k+1)=0, so k=2,k=−1k=2, k=-1. This is good. I will use this version. New Question: For what values of the constant kk is the matrix A=(k311k0111)A = \begin{pmatrix} k & 3 & 1 \\ 1 & k & 0 \\ 1 & 1 & 1 \end{pmatrix} non-invertible? A: k=2k=2 and k=−1k=-1 (Correct) B: k=1k=1 only (Distractor: might happen if student makes a sign error or calculation slip, e.g. k2−1=0k^2-1=0) C: k=3k=3 and k=0k=0 (Distractor: student might set entries to zero or miscalculate cofactors) D: k=2k=2 and k=1k=1 (Distractor: common combination of integers, plausible guessing error). So, the final explanation needs to be for this new matrix. Explanation: A matrix is non-invertible if its determinant is zero. We compute the determinant: det⁡(A)=k(k⋅1−0⋅1)−3(1⋅1−0⋅1)+1(1⋅1−k⋅1)=k(k)−3(1)+1(1−k)=k2−3+1−k=k2−k−2\det(A) = k(k \cdot 1 - 0 \cdot 1) - 3(1 \cdot 1 - 0 \cdot 1) + 1(1 \cdot 1 - k \cdot 1) = k(k) - 3(1) + 1(1-k) = k^2 - 3 + 1 - k = k^2 - k - 2. Setting the determinant to zero: k2−k−2=0k^2 - k - 2 = 0. Factoring the quadratic gives (k−2)(k+1)=0(k-2)(k+1)=0. The solutions are k=2k=2 and k=−1k=-1. For these values of kk, the matrix is non-invertible. Distractor B arises from a potential calculation error like k2−1=0k^2 - 1 = 0. Distractor C could come from miscalculating the cofactors. Distractor D pairs one correct root with an incorrect one.
  17. A 3×33 \times 3 matrix AA has eigenvalues λ1=−1\lambda_1 = -1, λ2=2\lambda_2 = 2. It is also known that the matrix A−3IA - 3I is non-invertible. What is the determinant of AA?
    Answer: −6-6 The statement that the matrix A−3IA - 3I is non-invertible means that its determinant is zero: det⁡(A−3I)=0\det(A-3I)=0. This is the characteristic equation for finding eigenvalues, which tells us that λ=3\lambda=3 is an eigenvalue of AA. So, the three eigenvalues of the 3×33 \times 3 matrix AA are λ1=−1\lambda_1 = -1, λ2=2\lambda_2 = 2, and λ3=3\lambda_3 = 3. The determinant of a matrix is the product of its eigenvalues. Therefore, det⁡(A)=λ1⋅λ2⋅λ3=(−1)(2)(3)=−6\det(A) = \lambda_1 \cdot \lambda_2 \cdot \lambda_3 = (-1)(2)(3) = -6.
  18. A 3×33 \times 3 matrix AA has a determinant of 55. A new matrix BB is created by performing the following sequence of elementary row operations on AA: 1. Swap Row 1 and Row 3. 2. Multiply Row 2 by −2-2. 3. Add 4 times Row 2 to Row 1. What is the determinant of BB, and is BB invertible?
    Answer: det⁡(B)=10\det(B) = 10; BB is invertible. We track the effect of each row operation on the determinant, starting with det⁡(A)=5\det(A) = 5. 1. Swap Row 1 and Row 3: Swapping any two rows of a matrix multiplies its determinant by −1-1. After this step, the determinant is 5×(−1)=−55 \times (-1) = -5. 2. Multiply Row 2 by -2: Multiplying a single row by a scalar kk multiplies the determinant by kk. After this step, the determinant becomes (−5)×(−2)=10(-5) \times (-2) = 10. 3. Add 4 times Row 2 to Row 1: Adding a multiple of one row to another row does not change the determinant. After this step, the determinant remains 1010. So, det⁡(B)=10\det(B) = 10. A matrix is invertible if and only if its determinant is non-zero. Since det⁡(B)=10≠0\det(B) = 10 \neq 0, the matrix BB is invertible. The distractor det⁡(B)=−40\det(B)=-40 comes from incorrectly multiplying by 4 in the third step.
  19. Consider a 3×33 \times 3 matrix AA with integer entries where each row sum equals 5 and each column sum equals 5. If one eigenvalue of AA is 5, what can be concluded about det⁡(A)\det(A)?
    Answer: det⁡(A)=5k\det(A) = 5k for some integer kk Since all row sums equal 5, we have A1=51A\mathbf{1} = 5\mathbf{1} where 1=(1,1,1)T\mathbf{1} = (1,1,1)^T, confirming that 5 is indeed an eigenvalue with eigenvector 1\mathbf{1}. Since AA has integer entries and the characteristic polynomial has integer coefficients, all eigenvalues are algebraic integers. For a 3×33 \times 3 matrix, det⁡(A)\det(A) equals the product of the three eigenvalues. We know one eigenvalue is 5, so det⁡(A)=5λ2λ3\det(A) = 5\lambda_2\lambda_3 where λ2,λ3\lambda_2, \lambda_3 are the other eigenvalues. Since AA has integer entries, det⁡(A)\det(A) is an integer, and since it equals 5λ2λ35\lambda_2\lambda_3, we have det⁡(A)=5k\det(A) = 5k for some integer k=λ2λ3k = \lambda_2\lambda_3. Choice A assumes all eigenvalues are 5, which isn't necessarily true. Choice B misinterprets the given information. Choice D is too broad since kk must be an integer, not allowing arbitrary real multiples.

Start this quiz