Basis & Dimension - Linear Algebra

1. Let $W$ be the subspace of $\mathbb{R}^4$ consisting of all vectors $\mathbf{x} = (x_1, x_2, x_3, x_4)$ such that $x_1 - 2x_2 + x_3 - x_4 = 0$. What is the dimension of $W$?
   Answer: $3$ The subspace $W$ is defined by a single homogeneous linear equation in $\mathbb{R}^4$. The dimension of the ambient space is 4. Each independent linear constraint reduces the dimension by one. Since there is one constraint, the dimension of the subspace is $4 - 1 = 3$. Alternatively, we can express one variable in terms of the others, for example, $x_1 = 2x_2 - x_3 + x_4$. This shows that any vector in $W$ can be described using three free parameters ($x_2, x_3, x_4$), which means the dimension of $W$ is 3.
2. The column space of a matrix $A$ has basis $\{(1, 2, 3), (0, 1, 1)\}$. The null space of $A$ has basis $\{(1, 1, 0, 0), (1, 0, 1, 0), (1, 0, 0, 1)\}$. What are the dimensions of matrix $A$?
   Answer: $3 \times 5$ When you encounter problems about matrix dimensions involving column space and null space, you need to connect the dimensions of these subspaces to the matrix's structure using fundamental theorems. The column space basis $\{(1, 2, 3), (0, 1, 1)\}$ tells you two key facts: the column space has dimension 2 (since there are 2 basis vectors), and the matrix has 3 rows (since each vector has 3 components). The null space basis $\{(1, 1, 0, 0), (1, 0, 1, 0), (1, 0, 0, 1)\}$ reveals that the null space has dimension 3, and the matrix has 4 columns (since each null space vector has 4 components). The Rank-Nullity Theorem provides the crucial check: for any matrix, rank + nullity = number of columns. Here, rank = 2 (dimension of column space) and nullity = 3 (dimension of null space), so $2 + 3 = 5$. Wait - this seems wrong since we determined 4 columns from the null space vectors. Actually, let's reconsider: the null space vectors being 4-dimensional means the matrix has 4 columns, but our rank-nullity calculation suggests 5 columns total. The issue is that we need $2 + 3 = 5$ columns for consistency. Therefore, the matrix is $3 \times 5$. Choice A ($3 \times 4$) fails rank-nullity since $2 + 3 \neq 4$. Choice B ($4 \times 3$) has the wrong number of rows. Choice C ($4 \times 5$) has too many rows given the 3-component column space vectors. Remember: column space vectors determine the number of rows, null space vectors suggest the number of columns, but always verify using the Rank-Nullity Theorem for consistency.
3. Let $A$ be a $5 \times 8$ matrix such that the solution set to the homogeneous system $A\mathbf{x} = \mathbf{0}$ can be described with 4 free parameters. What is the dimension of the column space of $A$?
   Answer: $4$ The number of free parameters in the solution to $A\mathbf{x} = \mathbf{0}$ is the dimension of the null space of $A$, which is the nullity. So, $\mathrm{nullity}(A) = 4$. The Rank-Nullity Theorem states that for an $m \times n$ matrix, $\mathrm{rank}(A) + \mathrm{nullity}(A) = n$, where $n$ is the number of columns. Here, $n=8$. So, $\mathrm{rank}(A) + 4 = 8$, which gives $\mathrm{rank}(A) = 4$. The dimension of the column space is equal to the rank of the matrix. Therefore, the dimension of the column space of $A$ is 4.
4. Let $V$ be the vector space of all $3 \times 3$ symmetric matrices over $\mathbb{R}$. Consider the subset $S = \{A \in V : \text{tr}(A) = 0\}$ where $\text{tr}(A)$ denotes the trace of matrix $A$. If $\{B_1, B_2, B_3, B_4, B_5\}$ is a basis for $S$, what is $\dim(V)$?
   Answer: 6 First, find $\dim(V)$: A $3 \times 3$ symmetric matrix has 6 independent entries (3 diagonal + 3 above diagonal), so $\dim(V) = 6$. Next, $S$ is the kernel of the linear map $T: V \to \mathbb{R}$ defined by $T(A) = \text{tr}(A)$. Since $T$ is surjective, $\text{rank}(T) = 1$. By the rank-nullity theorem: $\dim(V) = \text{rank}(T) + \dim(S) = 1 + 5 = 6$. Choice A gives $\dim(S)$ instead of $\dim(V)$. Choice C incorrectly counts 8 entries (all entries of $3 \times 3$ matrix minus trace constraint). Choice D counts all 9 entries without considering symmetry.
5. A basis for a subspace $W \subseteq \mathbb{R}^3$ is given by $\mathcal{B} = \{(1, 0, 1), (0, 1, -1)\}$. Which of the following vectors lies in $W$?
   Answer: $(2, -1, 3)$ When you encounter a question about whether a vector lies in a subspace given by a basis, you need to determine if the vector can be written as a linear combination of the basis vectors. A vector is in the subspace $W$ if and only if it can be expressed as $c_1(1, 0, 1) + c_2(0, 1, -1)$ for some scalars $c_1$ and $c_2$. Let's check option D: $(2, -1, 3)$. We need to solve: $c_1(1, 0, 1) + c_2(0, 1, -1) = (2, -1, 3)$ This gives us the system: - $c_1 = 2$ - $c_2 = -1$ - $c_1 - c_2 = 3$ From the first two equations, $c_1 = 2$ and $c_2 = -1$. Checking the third: $2 - (-1) = 3$ ✓. Since this system has a solution, $(2, -1, 3)$ is in $W$. Now let's verify why the other options fail: A) For $(1, 1, 1)$: We'd need $c_1 = 1$, $c_2 = 1$, and $c_1 - c_2 = 1$. But $1 - 1 = 0 \neq 1$, so this is inconsistent. B) For $(-1, 3, 2)$: We'd need $c_1 = -1$, $c_2 = 3$, and $c_1 - c_2 = 2$. But $-1 - 3 = -4 \neq 2$. C) For $(1, 2, 0)$: We'd need $c_1 = 1$, $c_2 = 2$, and $c_1 - c_2 = 0$. But $1 - 2 = -1 \neq 0$. Study tip: Always set up the linear combination systematically and check all three equations. If any equation fails, the vector isn't in the subspace. This algebraic approach is more reliable than trying to "see" the answer.
6. Let $\mathcal{B} = \{\mathbf{v}_1, \mathbf{v}_2, \mathbf{v}_3\}$ be a basis for a vector space $V$. Which of the following sets is also a basis for $V$?
   Answer: $\{\mathbf{v}_1 + \mathbf{v}_2, \mathbf{v}_2 + \mathbf{v}_3, \mathbf{v}_3 + \mathbf{v}_1\}$ Since $\dim(V)=3$, any basis for $V$ must contain exactly 3 linearly independent vectors. (B) is linearly dependent because the third vector is a sum of the first two. (C) only has two vectors, so it cannot span $V$. (D) includes the zero vector, so it is linearly dependent. For (A), let the new vectors be $\mathbf{w}_1, \mathbf{w}_2, \mathbf{w}_3$. We check for linear independence by solving $c_1\mathbf{w}_1 + c_2\mathbf{w}_2 + c_3\mathbf{w}_3 = \mathbf{0}$. This gives $c_1(\mathbf{v}_1 + \mathbf{v}_2) + c_2(\mathbf{v}_2 + \mathbf{v}_3) + c_3(\mathbf{v}_3 + \mathbf{v}_1) = (c_1+c_3)\mathbf{v}_1 + (c_1+c_2)\mathbf{v}_2 + (c_2+c_3)\mathbf{v}_3 = \mathbf{0}$. Since $\{\mathbf{v}_i\}$ is a basis, they are linearly independent, so we must have $c_1+c_3=0$, $c_1+c_2=0$, and $c_2+c_3=0$. This system of equations only has the trivial solution $c_1=c_2=c_3=0$. Thus, the set is linearly independent and forms a basis.
7. Consider the vector space of $2 \times 2$ matrices, $M_{2 \times 2}(\mathbb{R})$. Let $W$ be the subspace of all matrices $A$ in $M_{2 \times 2}(\mathbb{R})$ such that $\begin{pmatrix} 1 & 1 \end{pmatrix} A = \begin{pmatrix} 0 & 0 \end{pmatrix}$. What is the dimension of $W$?
   Answer: $2$ Let $A = \begin{pmatrix} a & b \\ c & d \end{pmatrix}$. The condition is $\begin{pmatrix} 1 & 1 \end{pmatrix} \begin{pmatrix} a & b \\ c & d \end{pmatrix} = \begin{pmatrix} a+c & b+d \end{pmatrix} = \begin{pmatrix} 0 & 0 \end{pmatrix}$. This gives two linear equations: $a+c=0$ and $b+d=0$. These equations imply $c=-a$ and $d=-b$. A matrix in $W$ must have the form $\begin{pmatrix} a & b \\ -a & -b \end{pmatrix} = a \begin{pmatrix} 1 & 0 \\ -1 & 0 \end{pmatrix} + b \begin{pmatrix} 0 & 1 \\ 0 & -1 \end{pmatrix}$. The matrices in $W$ are determined by the two free parameters $a$ and $b$. Thus, the dimension of $W$ is 2. The set $\left\{ \begin{pmatrix} 1 & 0 \\ -1 & 0 \end{pmatrix}, \begin{pmatrix} 0 & 1 \\ 0 & -1 \end{pmatrix} \right\}$ is a basis for $W$.
8. Let $V = \text{span}\{v_1, v_2, v_3, v_4\}$ where the vectors are linearly independent. Consider the set $B = \{v_1 + v_2, v_2 + v_3, v_3 + v_4, v_1 + v_4, v_1 + v_3\}$. What is the maximum number of vectors that can be selected from $B$ to form a linearly independent set?
   Answer: 4 When you encounter questions about linear independence in a span, focus on the dimension of the underlying vector space. Since $v_1, v_2, v_3, v_4$ are linearly independent, they form a basis for $V$, making $\dim(V) = 4$. This is your key constraint: no matter how you combine these basis vectors, you cannot create more than 4 linearly independent vectors in $V$. To confirm that 4 vectors from $B$ can be linearly independent, consider $\{v_1 + v_2, v_2 + v_3, v_3 + v_4, v_1 + v_4\}$. If these were linearly dependent, there would exist constants $c_1, c_2, c_3, c_4$ (not all zero) such that: $c_1(v_1 + v_2) + c_2(v_2 + v_3) + c_3(v_3 + v_4) + c_4(v_1 + v_4) = 0$ Rearranging: $(c_1 + c_4)v_1 + (c_1 + c_2)v_2 + (c_2 + c_3)v_3 + (c_3 + c_4)v_4 = 0$ Since $v_1, v_2, v_3, v_4$ are linearly independent, each coefficient must be zero. This system has only the trivial solution $c_1 = c_2 = c_3 = c_4 = 0$, confirming these 4 vectors are linearly independent. Choice B) 3 is incorrect because we just showed 4 vectors can be linearly independent. Choice C) 5 is impossible since the dimension of $V$ is only 4. Choice D) is wrong because the maximum is always 4, regardless of which vectors you choose from $B$. Study tip: Remember that linear independence is limited by dimension. In any vector space of dimension $n$, you cannot have more than $n$ linearly independent vectors.
9. Let $A$ be a $4 \times 6$ matrix with $\text{rank}(A) = 3$. Consider the vector spaces $\text{Col}(A)$ (column space) and $\text{Row}(A)$ (row space) of $A$. Which statement is true?
   Answer: $\dim(\text{Col}(A)) = 3$ and $\dim(\text{Row}(A)) = 3$ For any matrix, $\text{rank}(A) = \dim(\text{Col}(A)) = \dim(\text{Row}(A))$. Since $\text{rank}(A) = 3$, both column space and row space have dimension 3. The column space is a subspace of $\mathbb{R}^4$ (since $A$ has 4 rows) and the row space is a subspace of $\mathbb{R}^6$ (since $A$ has 6 columns), but their dimensions are equal to the rank. Choice A incorrectly sets $\dim(\text{Row}(A))$ equal to the number of rows. Choice B swaps the dimensions. Choice D incorrectly sets $\dim(\text{Row}(A))$ equal to the number of columns.
10. In $\mathbb{R}^3$, let $U$ be the plane defined by $x+y+z=0$ and let $W$ be the $xy$-plane (defined by $z=0$). What is the dimension of the subspace $U \cap W$?
    Answer: $1$ When you encounter questions about intersections of subspaces, you're looking for the set of all vectors that belong to both subspaces simultaneously. The dimension of this intersection depends on how the subspaces relate to each other geometrically. To find $U \cap W$, you need vectors that satisfy both conditions: $x + y + z = 0$ (the plane $U$) and $z = 0$ (the $xy$-plane $W$). Substituting $z = 0$ into the first equation gives $x + y + 0 = 0$, so $x + y = 0$ or $y = -x$. This means the intersection consists of all points of the form $(x, -x, 0)$, which you can write as $x(1, -1, 0)$. This is a line through the origin in the direction of vector $(1, -1, 0)$, so it has dimension 1. Looking at the wrong answers: Choice (A) suggests dimension 0, which would mean the subspaces only intersect at the origin—but these two planes clearly intersect along an entire line. Choice (B) gives dimension 3, which is impossible since neither $U$ nor $W$ spans all of $\mathbb{R}^3$. Choice (C) suggests dimension 2, which would mean the planes are identical, but $U$ has normal vector $(1,1,1)$ while $W$ has normal vector $(0,0,1)$—they're clearly different planes. Remember: when finding intersections of subspaces, substitute one set of constraints into the other and count how many free parameters remain in your solution. That tells you the dimension.
11. Let $U$ and $V$ be subspaces of $\mathbb{R}^6$ with $\dim(U) = 4$ and $\dim(V) = 3$. If $B_1 = \{\mathbf{u}_1, \mathbf{u}_2, \mathbf{u}_3, \mathbf{u}_4\}$ is a basis for $U$ and $B_2 = \{\mathbf{v}_1, \mathbf{v}_2, \mathbf{v}_3\}$ is a basis for $V$, what can be concluded about the set $B_1 \cup B_2$?
    Answer: $B_1 \cup B_2$ spans $U + V$ but may be linearly dependent When you encounter questions about combining bases from different subspaces, you need to think about two key properties: spanning and linear independence. These properties behave differently when you take the union of bases. The union $B_1 \cup B_2$ will always span $U + V$ because any vector in $U + V$ can be written as $\mathbf{u} + \mathbf{v}$ where $\mathbf{u} \in U$ and $\mathbf{v} \in V$. Since $B_1$ spans $U$ and $B_2$ spans $V$, their union spans the sum $U + V$. However, $B_1 \cup B_2$ may contain redundant vectors, making it linearly dependent if the subspaces overlap. Choice A is wrong because $B_1 \cup B_2$ is not always linearly independent. If $U$ and $V$ intersect nontrivially, some vectors in $B_1$ might be expressible as linear combinations of vectors in $B_2$, creating dependence. Choice B incorrectly states a biconditional. While $U \cap V = \{\mathbf{0}\}$ is sufficient for linear independence, it's not necessary. Even when subspaces intersect, the specific basis vectors chosen might still be linearly independent. Choice C assumes $\dim(\text{span}(B_1 \cup B_2)) = 4 + 3 = 7$, but this ignores potential overlap between $U$ and $V$. By the dimension formula, $\dim(U + V) = \dim(U) + \dim(V) - \dim(U \cap V) \leq 7$, with equality only when $U \cap V = \{\mathbf{0}\}$. Remember: unions of bases always span the sum of subspaces, but may introduce linear dependence when subspaces overlap.
12. Let $W_1 = \text{span}\{(1,2,0,1), (0,1,1,2), (1,0,-2,-3)\}$ and $W_2 = \text{span}\{(2,1,1,0), (1,1,1,1), (0,1,1,2)\}$ be subspaces of $\mathbb{R}^4$. If $\dim(W_1) = 2$, $\dim(W_2) = 3$, and $\dim(W_1 \cap W_2) = 1$, what is $\dim(W_1 + W_2)$?
    Answer: 4 Use the dimension formula for subspace sum: $\dim(W_1 + W_2) = \dim(W_1) + \dim(W_2) - \dim(W_1 \cap W_2) = 2 + 3 - 1 = 4$. Since $W_1 + W_2 \subseteq \mathbb{R}^4$, we have $\dim(W_1 + W_2) \leq 4$, which is consistent. Choice A incorrectly uses $\max\{\dim(W_1), \dim(W_2)\} = 3$. Choice C adds dimensions without subtracting the intersection. Choice D would exceed the dimension of the ambient space $\mathbb{R}^4$.
13. Let $V$ be a vector space of dimension $n$. Which of the following statements is always true?
    Answer: Any set of $n+1$ vectors in $V$ is linearly dependent. The dimension of a vector space is defined as the number of vectors in any basis, which is also the maximum number of linearly independent vectors in the space. Therefore, any set containing more vectors than the dimension ($n+1$ vectors in this case) must be linearly dependent. (A) is false because the set of $n$ vectors must also be linearly independent. (C) is false because a linearly independent set must also contain exactly $n$ vectors to be a basis. (D) is false because a spanning set must also be linearly independent (or contain exactly $n$ vectors) to be a basis.
14. Let $W$ be the vector space of all $3 \times 3$ skew-symmetric matrices with real entries. A matrix $A$ is skew-symmetric if $A^T = -A$. What is the dimension of $W$?
    Answer: $3$ A $3 \times 3$ matrix $A = (a_{ij})$ is skew-symmetric if $a_{ji} = -a_{ij}$. For the diagonal entries ($i=j$), this implies $a_{ii} = -a_{ii}$, which means $a_{ii} = 0$. So the diagonal entries are all zero. For the off-diagonal entries, the entries below the main diagonal are determined by the entries above it: $a_{21} = -a_{12}$, $a_{31} = -a_{13}$, and $a_{32} = -a_{23}$. We are only free to choose the entries $a_{12}$, $a_{13}$, and $a_{23}$. Since there are 3 free parameters, the dimension of $W$ is 3. Distractor (C) is the dimension of $3 \times 3$ symmetric matrices, and (D) is the dimension of all $3 \times 3$ matrices.
15. Let $V$ be a 5-dimensional vector space and let $T: V \to V$ be a linear transformation with $\text{rank}(T) = 3$. If $U$ is a 2-dimensional subspace of $V$ such that $U \cap \ker(T) = \{0\}$, what is $\dim(T(U))$?
    Answer: 2 Since $\text{rank}(T) = 3$ and $\dim(V) = 5$, by rank-nullity theorem: $\dim(\ker(T)) = 5 - 3 = 2$. The restriction $T|_U: U \to T(U)$ has kernel $\ker(T|_U) = U \cap \ker(T) = \{0\}$. Since $T|_U$ is injective and $\dim(U) = 2$, we have $\dim(T(U)) = \dim(U) = 2$. Choice A would occur if $U \subseteq \ker(T)$. Choice B might result from incorrectly computing $\dim(U) - \dim(U \cap \ker(T))$ as $2 - 1 = 1$. Choice D incorrectly assumes $\dim(T(U)) = \text{rank}(T)$.
16. The set $\{\mathbf{v}_1, \mathbf{v}_2\}$ is a basis for a subspace $W$ of $\mathbb{R}^4$. Let $\mathbf{v}_3$ be a vector in $\mathbb{R}^4$ such that $\mathbf{v}_3$ is not in $W$. What is the dimension of the subspace $W' = \mathrm{span}(\{\mathbf{v}_1, \mathbf{v}_2, \mathbf{v}_3\})$?
    Answer: $3$ We are given that $\{\mathbf{v}_1, \mathbf{v}_2\}$ is a basis for $W$, which means $\mathbf{v}_1$ and $\mathbf{v}_2$ are linearly independent and $\dim(W) = 2$. We are also given that $\mathbf{v}_3$ is not in $W$, which means $\mathbf{v}_3$ cannot be written as a linear combination of $\mathbf{v}_1$ and $\mathbf{v}_2$. This implies that the set $\{\mathbf{v}_1, \mathbf{v}_2, \mathbf{v}_3\}$ is linearly independent. The subspace $W'$ is the span of this linearly independent set. The dimension of a subspace is the number of vectors in its basis. Therefore, the dimension of $W'$ is 3.
17. Consider the vector space $P_3(x)$ of polynomials of degree at most 3. Let $S = \{p(x) \in P_3(x) : p(1) = p(-1) = 0\}$. Which of the following is a basis for $S$?
    Answer: $\{x^2 - 1, x^3 - x\}$ When you encounter questions about finding a basis for a subspace defined by conditions, you need to first understand what polynomials satisfy those conditions, then find a linearly independent set that spans the subspace. The set $S$ consists of polynomials in $P_3(x)$ that have roots at both $x = 1$ and $x = -1$. Since any polynomial with these two roots must be divisible by $(x-1)(x+1) = x^2-1$, every polynomial in $S$ can be written as $(x^2-1) \cdot q(x)$ where $q(x)$ is at most degree 1. This means $S = \text{span}\{x^2-1, x(x^2-1)\} = \text{span}\{x^2-1, x^3-x\}$, making $S$ a 2-dimensional subspace. Let's verify that choice A works: both $x^2-1$ and $x^3-x$ clearly vanish at $x = \pm 1$, so they're in $S$. They're linearly independent since $x^3-x$ has degree 3 while $x^2-1$ has degree 2. Since $\dim(S) = 2$, these two linearly independent vectors form a basis. Choice B includes an extra polynomial $x^2+x-1$, but since $(-1)^2+(-1)-1 = -1 \neq 0$, this polynomial isn't even in $S$. Choice C has three polynomials, but $\dim(S) = 2$, so this set is linearly dependent. Choice D includes $(x^2-1)^2 = x^4-2x^2+1$, which has degree 4 and thus isn't in $P_3(x)$. Study tip: When a subspace is defined by polynomial conditions like $p(a) = 0$, factor out $(x-a)$ from the general form to understand the subspace's structure and dimension.
18. Let $V = P_3(\mathbb{R})$ be the vector space of polynomials of degree at most 3. Let $S$ be the subspace of $V$ defined by $S = \{ p(x) \in V \mid p(1) = 0 \text{ and } p'(0) = 0 \}$, where $p'(x)$ is the derivative of $p(x)$. What is the dimension of $S$?
    Answer: $2$ A general polynomial in $P_3(\mathbb{R})$ is $p(x) = a_3x^3 + a_2x^2 + a_1x + a_0$. The dimension of $P_3(\mathbb{R})$ is 4. The conditions impose constraints on the coefficients. The first condition is $p(1) = a_3 + a_2 + a_1 + a_0 = 0$. The derivative is $p'(x) = 3a_3x^2 + 2a_2x + a_1$. The second condition is $p'(0) = a_1 = 0$. Substituting $a_1=0$ into the first equation gives $a_3 + a_2 + a_0 = 0$, or $a_0 = -a_3 - a_2$. This means the coefficients $a_3$ and $a_2$ can be chosen freely, and they determine $a_1$ and $a_0$. Since there are two free parameters, the dimension of the subspace $S$ is 2.
19. In $\mathbb{R}^4$, let $W$ be the subspace of vectors $(x_1, x_2, x_3, x_4)$ satisfying $x_1 + 2x_2 - x_3 + x_4 = 0$ and $2x_1 - x_2 + x_3 - 2x_4 = 0$. After row reducing the coefficient matrix of this system, you find that the rank is 2. How many vectors are needed to form a basis for $W$?
    Answer: 2 $W$ is the null space of the $2 \times 4$ matrix $A = \begin{pmatrix} 1 & 2 & -1 & 1 \\ 2 & -1 & 1 & -2 \end{pmatrix}$. Since $\text{rank}(A) = 2$ and the matrix has 4 columns, by the rank-nullity theorem: $\dim(W) = \dim(\text{null}(A)) = 4 - 2 = 2$. Therefore, any basis for $W$ must contain exactly 2 vectors. Choice A gives $\text{rank}(A) - 1$. Choice C is a duplicate of the correct answer. Choice D gives the dimension of the ambient space $\mathbb{R}^4$.

Start this quiz