Invertible Matrices - Linear Algebra

1. Let $T: \mathbb{R}^n \to \mathbb{R}^n$ be a linear transformation with standard matrix $A$. If the equation $T(x)=0$ has only the trivial solution, which statement about the equation $T(x)=b$ must be true?
   Answer: It has a unique solution for every $b \in \mathbb{R}^n$. The condition that $T(x)=0$ (which is equivalent to $Ax=0$) has only the trivial solution ($x=0$) is a key part of the Invertible Matrix Theorem. It implies that the matrix $A$ is invertible. If $A$ is invertible, then for any vector $b \in \mathbb{R}^n$, the equation $Ax=b$ (or $T(x)=b$) has a unique solution given by $x = A^{-1}b$.
2. Which of the following conditions is sufficient to guarantee that a system of $n$ linear equations in $n$ unknowns, represented by $Ax=b$, has a unique solution?
   Answer: The columns of the coefficient matrix $A$ are linearly independent. When you encounter questions about unique solutions to linear systems, you're dealing with fundamental concepts of linear independence, matrix invertibility, and solution existence. The key is understanding what mathematical conditions guarantee exactly one solution. For a system $Ax = b$ to have a unique solution, the coefficient matrix $A$ must be invertible (non-singular). This happens precisely when the columns of $A$ are linearly independent. When columns are linearly independent in an $n \times n$ matrix, the matrix has full rank (rank = $n$), making it invertible. This means you can solve for $x$ uniquely as $x = A^{-1}b$. Therefore, answer D is correct. Let's examine why the other options fail. A is insufficient because consistency only means a solution exists—it could be one solution or infinitely many. For example, if $A$ has dependent columns, consistent systems have infinitely many solutions. B is a common trap: having equal numbers of equations and unknowns is necessary but not sufficient. You could have $n$ equations in $n$ unknowns where some equations are redundant (linearly dependent), leading to infinitely many solutions or no solution. C is irrelevant—the nature of vector $b$ doesn't determine uniqueness of solutions. Even when $b = 0$, you can have unique solutions (just $x = 0$) if $A$ is invertible. Study tip: Remember that for square systems, linear independence of columns is equivalent to the matrix being invertible, having non-zero determinant, and guaranteeing unique solutions. These concepts are all interconnected in linear algebra.
3. Consider the matrix $A = \begin{pmatrix} 2 & -1 & 3 \\ -4 & 2 & k \\ 6 & -3 & 9 \end{pmatrix}$. For which value of $k$ does the system $A\mathbf{x} = \mathbf{b}$ have a solution for every vector $\mathbf{b} \in \mathbb{R}^3$?
   Answer: No value of $k$ makes the system solvable for every $\mathbf{b}$ The correct answer is D. Notice that row 3 is exactly -3 times row 1: $(6, -3, 9) = -3(2, -1, 3)$. Also, row 2 is -2 times row 1 plus some adjustment in the third column: $(-4, 2, k) = -2(2, -1, 3) + (0, 0, k+6)$. Since rows 1 and 3 are linearly dependent, the matrix can have rank at most 2, regardless of the value of $k$. A $3 \times 3$ matrix with rank less than 3 cannot be invertible, so the system cannot have a solution for every $\mathbf{b} \in \mathbb{R}^3$. Choice A is wrong because even with $k = -6$, the rank is still 2. Choice B is wrong because $k = 0$ doesn't eliminate the linear dependence between rows 1 and 3. Choice C is wrong because no value of $k$ can make the rank equal to 3 when two rows are already linearly dependent.
4. If an $n \times n$ matrix $A$ has rank $n$, which of the following is a necessary consequence?
   Answer: The equation $Ax=b$ has a unique solution for any $b \in \mathbb{R}^n$. For an $n \times n$ matrix, having rank $n$ is one of the equivalent conditions for the matrix to be invertible (by the Invertible Matrix Theorem). If a matrix $A$ is invertible, then the system of equations $Ax=b$ has a unique solution, $x = A^{-1}b$, for every vector $b$ in $\mathbb{R}^n$. The other choices describe properties of non-invertible matrices.
5. Let $A$ be an $n \times n$ matrix. If the columns of $A$ do not span $\mathbb{R}^n$, which statement regarding the equation $Ax=b$ is correct?
   Answer: The equation $Ax=b$ has either no solution or infinitely many solutions. The statement that the columns of $A$ do not span $\mathbb{R}^n$ is one of the conditions for a square matrix to be non-invertible (singular) according to the Invertible Matrix Theorem. For a singular matrix $A$, the system $Ax=b$ cannot have a unique solution. Depending on whether $b$ lies in the column space of $A$, the system will either have infinitely many solutions (if consistent) or no solution (if inconsistent).
6. Consider the $3 \times 3$ matrix $A = \begin{pmatrix} 1 & 2 & 3 \\ 0 & 4 & 5 \\ 0 & 0 & k \end{pmatrix}$ where $k$ is a parameter. For the matrix $(A - 2I)$, determine the condition on $k$ that makes this matrix invertible.
   Answer: $k \neq 2$ is the only condition needed for invertibility The correct answer is A. We have $A - 2I = \begin{pmatrix} 1-2 & 2 & 3 \\ 0 & 4-2 & 5 \\ 0 & 0 & k-2 \end{pmatrix} = \begin{pmatrix} -1 & 2 & 3 \\ 0 & 2 & 5 \\ 0 & 0 & k-2 \end{pmatrix}$. Since this is an upper triangular matrix, its determinant is the product of its diagonal entries: $\det(A - 2I) = (-1)(2)(k-2) = -2(k-2)$. The matrix is invertible if and only if this determinant is nonzero, which occurs when $k - 2 \neq 0$, or $k \neq 2$. Choice B incorrectly focuses on making $A$ invertible rather than $A - 2I$. Choice C incorrectly includes the condition $k \neq 4$, which isn't necessary. Choice D lists irrelevant conditions that don't affect the determinant of $A - 2I$.
7. Matrix $B$ is $4 \times 4$ and has the property that $B^2 = I$, where $I$ is the $4 \times 4$ identity matrix. If $\det(B) = -1$, which of the following statements about the invertibility of $(B + I)$ is correct?
   Answer: Matrix $(B + I)$ is not invertible because $-1$ is an eigenvalue of $B$ The correct answer is B. Since $B^2 = I$, we have $B^2 - I = 0$, which factors as $(B-I)(B+I) = 0$. This means that every eigenvalue $\lambda$ of $B$ satisfies $\lambda^2 = 1$, so $\lambda = 1$ or $\lambda = -1$. Since $\det(B) = -1$ and the determinant is the product of eigenvalues, $B$ must have an odd number of eigenvalues equal to $-1$. If $-1$ is an eigenvalue of $B$, then $0 = -1 - (-1) = -1 + 1$ is an eigenvalue of $B + I$, making $B + I$ singular (not invertible). Choice A is wrong because invertibility of $B$ doesn't guarantee invertibility of $B + I$. Choice C is wrong because we can definitively determine that $B + I$ is not invertible. Choice D is technically correct but doesn't provide the deeper insight that $\det(B + I) = 0$ necessarily.
8. Let $A$ be a $5 \times 5$ matrix with $\text{nullity}(A) = 2$. Consider the matrix equation $AX = B$ where $X$ and $B$ are $5 \times 3$ matrices. What is the maximum possible number of linearly independent columns that matrix $B$ can have for this equation to be consistent?
   Answer: At most 3 linearly independent columns since $\text{rank}(A) = 3$ When you encounter matrix equations like $AX = B$ with given nullity information, you need to connect the rank-nullity theorem to the concept of column space and consistency. Since $A$ is $5 \times 5$ with $\text{nullity}(A) = 2$, the rank-nullity theorem tells us that $\text{rank}(A) = 5 - 2 = 3$. This means the column space of $A$ is a 3-dimensional subspace of $\mathbb{R}^5$. For the equation $AX = B$ to be consistent, every column of $B$ must lie in the column space of $A$. Since the column space of $A$ has dimension 3, any set of vectors within it can have at most 3 linearly independent vectors. Therefore, $B$ can have at most 3 linearly independent columns, making answer C correct. Let's examine why the other options fail. Option A incorrectly focuses on the ambient space $\mathbb{R}^{5 \times 3}$ rather than the constraint that $B$'s columns must lie in $A$'s column space. Option B confuses nullity with the dimension of the column space - the nullity tells us about the kernel, not directly about linear independence in $B$. Option D is too restrictive, claiming exactly 3 independent columns are required, when fewer might suffice depending on the specific $B$. Study tip: Always connect rank and nullity to dimensional constraints on solution spaces. When you see "consistent system," immediately ask yourself what subspace the right-hand side must belong to, then use rank-nullity to find that subspace's dimension.
9. Let $A$ and $B$ be $n \times n$ matrices. If the product $C = AB$ is an invertible matrix, what must be true about $A$ and $B$?
   Answer: Both $A$ and $B$ must be invertible. A matrix is invertible if and only if its determinant is non-zero. The determinant of a product of matrices is the product of their determinants: $\det(AB) = \det(A) \det(B)$. Since $AB$ is invertible, we know $\det(AB) \neq 0$. Therefore, $\det(A) \det(B) \neq 0$. This implies that both $\det(A) \neq 0$ and $\det(B) \neq 0$. Consequently, both matrix $A$ and matrix $B$ must be invertible.
10. Let $A$ and $C$ be $n \times n$ matrices where $A$ is invertible. Consider the block matrix $M = \begin{pmatrix} A & B \\ 0 & C \end{pmatrix}$ where $B$ is $n \times n$ and $0$ is the $n \times n$ zero matrix. Under what conditions is $M$ invertible?
    Answer: $M$ is invertible if and only if $C$ is invertible, regardless of $B$ The correct answer is A. For a block upper triangular matrix $M = \begin{pmatrix} A & B \\ 0 & C \end{pmatrix}$, we have $\det(M) = \det(A) \cdot \det(C)$. Since $A$ is given to be invertible, $\det(A) \neq 0$. Therefore, $\det(M) \neq 0$ if and only if $\det(C) \neq 0$, which means $M$ is invertible if and only if $C$ is invertible. The matrix $B$ can be any $n \times n$ matrix without affecting invertibility. Choice B is wrong because $B$ doesn't need to be zero. Choice C is wrong because determinants multiply, not add, for block triangular matrices. Choice D is wrong because $M$ also requires $C$ to be invertible.
11. Let $A$ be a $4 \times 4$ matrix such that its reduced row echelon form has a row of zeros. Which of the following statements must be true?
    Answer: The system $Ax=0$ has infinitely many solutions. When you encounter questions about reduced row echelon form and rows of zeros, you're dealing with fundamental concepts about matrix rank and solution spaces. A row of zeros in the reduced row echelon form directly tells you about the matrix's rank and the behavior of associated linear systems. If matrix $A$ has a row of zeros in its reduced row echelon form, then $\text{rank}(A) < 4$. This means $A$ cannot have full rank, which has immediate consequences for the homogeneous system $Ax = 0$. Since the rank is less than the number of variables (4), the null space has dimension greater than zero, meaning there are infinitely many solutions to $Ax = 0$. The system will have free variables that can take any values, generating infinitely many solution vectors. Choice A is incorrect because when $\text{rank}(A) < 4$, the system $Ax = b$ either has no solution or infinitely many solutions for any given $b$, never a unique solution. Choice B is wrong because matrices with rank less than their size always have determinant zero - the row of zeros makes this clear. Choice C fails because if $\text{rank}(A) < 4$, the columns cannot span all of $\mathbb{R}^4$; they span a subspace of smaller dimension. Remember this key connection: a row of zeros in reduced row echelon form means the matrix lacks full rank, which always implies the homogeneous system has infinitely many solutions. This relationship between rank deficiency and non-trivial null spaces appears frequently in linear algebra problems.
12. A system of three linear equations in three variables can be interpreted as the intersection of three planes in $\mathbb{R}^3$. If the determinant of the coefficient matrix is zero, what is a possible geometric interpretation of the system's solutions?
    Answer: The three planes may intersect along a common line or not at all. A zero determinant for the coefficient matrix means the system does not have a unique solution. Geometrically, this means the three planes do not intersect at a single point. This can happen in two ways: there are infinitely many solutions (the planes intersect along a line or are all coincident) or there is no solution (the planes are parallel, two are parallel, or they intersect to form a triangular prism with no common intersection). The most general correct description is that they might intersect along a line (infinite solutions) or have no common intersection point (no solution).
13. Suppose $A$ is a $3 \times 3$ matrix with $\text{rank}(A) = 2$. Consider the augmented matrix $[A | \mathbf{b}]$ for the system $A\mathbf{x} = \mathbf{b}$. If this system has infinitely many solutions, what can be concluded about $\text{rank}([A | \mathbf{b}])$?
    Answer: $\text{rank}([A | \mathbf{b}]) = 2$ since the system has infinitely many solutions The correct answer is B. For a system $A\mathbf{x} = \mathbf{b}$ to have infinitely many solutions, it must be consistent (have at least one solution) and have free variables. The system is consistent if and only if $\text{rank}(A) = \text{rank}([A | \mathbf{b}])$. Since $\text{rank}(A) = 2$ and the system has infinitely many solutions, we must have $\text{rank}([A | \mathbf{b}]) = 2$. If $\text{rank}([A | \mathbf{b}]) = 3$, the system would be inconsistent. Choice A is wrong because rank 3 would make the system inconsistent. Choice C is wrong because the rank cannot decrease when adding a column. Choice D is wrong because once we know the system has infinitely many solutions, the rank relationship is determined.
14. Let $A$ be a $3 \times 3$ matrix such that the system $A\mathbf{x} = \mathbf{b}$ has a unique solution for some vector $\mathbf{b}$, but the homogeneous system $A\mathbf{x} = \mathbf{0}$ has infinitely many solutions. Which of the following statements about $A$ is correct?
    Answer: The given conditions are contradictory and cannot occur simultaneously The correct answer is C. If the homogeneous system $A\mathbf{x} = \mathbf{0}$ has infinitely many solutions, then $A$ has a non-trivial null space, meaning $A$ is not invertible. However, if $A$ is not invertible, then for any vector $\mathbf{b}$ not in the column space of $A$, the system $A\mathbf{x} = \mathbf{b}$ has no solution, and for any $\mathbf{b}$ in the column space, the system has infinitely many solutions (never a unique solution). The conditions are contradictory. Choice A is wrong because an invertible matrix cannot have infinitely many solutions to the homogeneous system. Choice B is wrong because while $A$ would indeed not be invertible, such a matrix cannot produce a unique solution to any non-homogeneous system. Choice D is wrong because the zero matrix cannot produce a unique solution to any non-zero system.
15. Let $P$ be an invertible $n \times n$ matrix and let $A$ be any $n \times n$ matrix. Consider the relationship between the systems $A\mathbf{x} = \mathbf{b}$ and $(PAP^{-1})\mathbf{y} = P\mathbf{b}$. How do the solution sets of these two systems relate?
    Answer: The systems have the same number of solutions with $\mathbf{x} = P\mathbf{y}$ relating them The correct answer is D. If $\mathbf{x}$ is a solution to $A\mathbf{x} = \mathbf{b}$, then setting $\mathbf{y} = P\mathbf{x}$ gives us $(PAP^{-1})\mathbf{y} = (PAP^{-1})(P\mathbf{x}) = PA\mathbf{x} = P\mathbf{b}$, so $\mathbf{y}$ solves the second system. Conversely, if $\mathbf{y}$ solves the second system, then $\mathbf{x} = P^{-1}\mathbf{y}$ solves the first. Since $P$ is invertible, this establishes a bijection between solution sets, so they have the same cardinality. The relationship is $\mathbf{y} = P\mathbf{x}$ or equivalently $\mathbf{x} = P^{-1}\mathbf{y}$. Choice A is wrong because $\mathbf{x} \neq \mathbf{y}$ in general. Choice B states the relationship in one direction but is incomplete. Choice C is wrong because the systems have the same number of solutions (including the possibility of zero or infinitely many).
16. Matrix $A$ is $n \times n$ and satisfies $A^2 + 2A + I = 0$. Which of the following conclusions about $A$ is correct?
    Answer: Matrix $A$ is always invertible with $A^{-1} = -A - 2I$ The correct answer is A. From $A^2 + 2A + I = 0$, we can rearrange to get $A^2 + 2A = -I$, which factors as $A(A + 2I) = -I$. Multiplying both sides by $-1$: $A(-A - 2I) = I$. This shows that $A$ has inverse $A^{-1} = -A - 2I$. Since we can explicitly construct the inverse, $A$ must be invertible. We can verify: $A(-A - 2I) = -A^2 - 2A = -(-I) = I$. Choice B is wrong because invertibility doesn't depend on the dimension being even or odd. Choice C is wrong because we've proven $A$ is always invertible. Choice D is wrong because satisfying a polynomial equation doesn't prevent invertibility (the constant term determines this, and here the 'constant term' equation $I = 0$ is avoided since we can solve for the inverse).
17. Consider the system of equations: $x + y - z = 2$ $x + 2y + z = 3$ $x + y + (c^2 - 5)z = c$ For which value of the constant $c$ will the system have no unique solution?
    Answer: $c=2$ or $c=-2$ When you encounter a system of linear equations with a parameter and need to find when there's "no unique solution," you're looking for values that make the system either inconsistent (no solutions) or dependent (infinitely many solutions). Both cases occur when the coefficient matrix becomes singular. To solve this, set up the augmented matrix and find when the determinant of the coefficient matrix equals zero: $\begin{bmatrix} 1 & 1 & -1 \\ 1 & 2 & 1 \\ 1 & 1 & c^2-5 \end{bmatrix}$ Computing the determinant: $\det = 1(2(c^2-5) - 1) - 1(1(c^2-5) - 1) + (-1)(1 - 2)$ Simplifying: $\det = 2c^2 - 10 - 1 - c^2 + 5 + 1 = c^2 - 4$ The system has no unique solution when $c^2 - 4 = 0$, which gives us $c^2 = 4$, so $c = 2$ or $c = -2$. Looking at the wrong answers: Choice A suggests only $c = 2$ works, missing the negative solution. Choice B suggests only $c = -2$, missing the positive solution. Choice C gives $c = \pm\sqrt{5}$, which comes from incorrectly solving $c^2 - 5 = 0$ instead of setting the determinant to zero—this is a common trap where students confuse the parameter in the matrix with the condition for singularity. Study tip: For parametric systems, always find when the determinant equals zero to identify non-unique solutions. Don't forget that quadratic equations in the parameter typically yield two critical values, and both positive and negative roots matter.
18. Consider a $4 \times 4$ matrix $A$ such that $A^3 = A$. If $A$ has exactly two distinct eigenvalues, which of the following statements about the invertibility of $A$ is most accurate?
    Answer: Matrix $A$ is invertible if and only if $0$ is not an eigenvalue The correct answer is B. Since $A^3 = A$, we have $A^3 - A = 0$, which factors as $A(A^2 - I) = A(A-I)(A+I) = 0$. This means every eigenvalue $\lambda$ satisfies $\lambda(\lambda^2 - 1) = \lambda(\lambda - 1)(\lambda + 1) = 0$, so the possible eigenvalues are $0, 1, -1$. Since $A$ has exactly two distinct eigenvalues, the possibilities are $\{0,1\}$, $\{0,-1\}$, or $\{1,-1\}$. Matrix $A$ is invertible if and only if $0$ is not an eigenvalue, which occurs only when the eigenvalues are $\{1,-1\}$. Choice A is wrong because having $0$ as an eigenvalue makes $A$ singular. Choice C is wrong because $A$ can be invertible if its eigenvalues are $\{1,-1\}$. Choice D is wrong because all eigenvalues here are real, and invertibility depends on whether $0$ is an eigenvalue, not on real vs. complex.
19. If a $3 \times 3$ matrix $A$ is singular, what can be concluded about the solution set of the system $Ax=b$?
    Answer: The system has either no solution or infinitely many solutions. A singular matrix is a square matrix that is not invertible. For a system $Ax=b$ where $A$ is singular, the system is not guaranteed to have a solution. If the vector $b$ is not in the column space of $A$, the system is inconsistent (no solution). If $b$ is in the column space of $A$, the system is consistent and will have infinitely many solutions because there will be at least one free variable. Therefore, the system has either no solution or infinitely many solutions, depending on $b$.
20. Consider the system of linear equations $Ax=0$, where $A$ is the matrix $A = \begin{pmatrix} 1 & k & 0 \\ 2 & 4 & 1 \\ 3 & 5 & 2 \end{pmatrix}$ For which value of $k$ does this system have non-trivial solutions?
    Answer: $k=3$ A homogeneous system $Ax=0$ has non-trivial solutions if and only if the matrix $A$ is singular, which means its determinant is zero. We calculate the determinant of $A$: $\det(A) = 1 \cdot \det\begin{pmatrix} 4 & 1 \\ 5 & 2 \end{pmatrix} - k \cdot \det\begin{pmatrix} 2 & 1 \\ 3 & 2 \end{pmatrix} + 0 \cdot \det\begin{pmatrix} 2 & 4 \\ 3 & 5 \end{pmatrix}$ $\det(A) = 1(4\cdot2 - 1\cdot5) - k(2\cdot2 - 1\cdot3) + 0$ $\det(A) = 1(8 - 5) - k(4 - 3) = 3 - k$ For non-trivial solutions, we must have $\det(A) = 0$, so $3 - k = 0$, which gives $k=3$.

Start this quiz